1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 88, 89, 92-96, 1997 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). */
41 extern void compiler_error ();
43 static tree convert_for_assignment
PROTO((tree
, tree
, char*, tree
,
45 static tree pointer_int_sum
PROTO((enum tree_code
, tree
, tree
));
46 static tree rationalize_conditional_expr
PROTO((enum tree_code
, tree
));
47 static int comp_target_parms
PROTO((tree
, tree
, int));
48 static int comp_ptr_ttypes_real
PROTO((tree
, tree
, int));
49 static int comp_ptr_ttypes_const
PROTO((tree
, tree
));
50 static int comp_ptr_ttypes_reinterpret
PROTO((tree
, tree
));
51 static int comp_array_types
PROTO((int (*) (tree
, tree
, int), tree
,
53 static tree build_ptrmemfunc1
PROTO((tree
, tree
, tree
, tree
, tree
));
54 static tree common_base_type
PROTO((tree
, tree
));
56 static tree convert_sequence
PROTO((tree
, tree
));
58 static tree lookup_anon_field
PROTO((tree
, tree
));
59 static tree pointer_diff
PROTO((tree
, tree
, tree
));
60 static tree qualify_type
PROTO((tree
, tree
));
61 static tree get_delta_difference
PROTO((tree
, tree
, int));
63 /* Return the target type of TYPE, which meas return T for:
64 T*, T&, T[], T (...), and otherwise, just T. */
70 if (TREE_CODE (type
) == REFERENCE_TYPE
)
71 type
= TREE_TYPE (type
);
72 while (TREE_CODE (type
) == POINTER_TYPE
73 || TREE_CODE (type
) == ARRAY_TYPE
74 || TREE_CODE (type
) == FUNCTION_TYPE
75 || TREE_CODE (type
) == METHOD_TYPE
76 || TREE_CODE (type
) == OFFSET_TYPE
)
77 type
= TREE_TYPE (type
);
81 /* Do `exp = require_complete_type (exp);' to make sure exp
82 does not have an incomplete type. (That includes void types.) */
85 require_complete_type (value
)
90 if (processing_template_decl
)
93 type
= TREE_TYPE (value
);
95 /* First, detect a valid value with a complete type. */
96 if (TYPE_SIZE (type
) != 0
97 && type
!= void_type_node
98 && ! (TYPE_LANG_SPECIFIC (type
)
99 && (IS_SIGNATURE_POINTER (type
) || IS_SIGNATURE_REFERENCE (type
))
100 && TYPE_SIZE (SIGNATURE_TYPE (type
)) == 0))
103 /* If we see X::Y, we build an OFFSET_TYPE which has
104 not been laid out. Try to avoid an error by interpreting
105 it as this->X::Y, if reasonable. */
106 if (TREE_CODE (value
) == OFFSET_REF
107 && current_class_ref
!= 0
108 && TREE_OPERAND (value
, 0) == current_class_ref
)
110 tree base
, member
= TREE_OPERAND (value
, 1);
111 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
112 my_friendly_assert (TREE_CODE (member
) == FIELD_DECL
, 305);
113 base
= convert_pointer_to (basetype
, current_class_ptr
);
114 value
= build (COMPONENT_REF
, TREE_TYPE (member
),
115 build_indirect_ref (base
, NULL_PTR
), member
);
116 return require_complete_type (value
);
119 if (IS_AGGR_TYPE (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
121 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
122 if (TYPE_SIZE (type
) != 0)
126 incomplete_type_error (value
, type
);
127 return error_mark_node
;
134 if (type
== NULL_TREE
)
135 /* Rather than crash, we return something sure to cause an error
137 return error_mark_node
;
139 if (type
== error_mark_node
|| TYPE_SIZE (type
) != NULL_TREE
)
141 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
143 tree t
= complete_type (TREE_TYPE (type
));
144 if (TYPE_SIZE (t
) != NULL_TREE
&& ! processing_template_decl
)
146 TYPE_NEEDS_CONSTRUCTING (type
)
147 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
148 TYPE_NEEDS_DESTRUCTOR (type
)
149 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
151 else if (IS_AGGR_TYPE (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
152 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
157 /* Return truthvalue of whether type of EXP is instantiated. */
163 return (TREE_CODE (exp
) == TREE_LIST
164 || TREE_TYPE (exp
) == unknown_type_node
165 || (TREE_CODE (TREE_TYPE (exp
)) == OFFSET_TYPE
166 && TREE_TYPE (TREE_TYPE (exp
)) == unknown_type_node
));
169 /* Return truthvalue of whether T is function (or pfn) type. */
175 return (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
176 || (TREE_CODE (t
) == POINTER_TYPE
177 && (TREE_CODE (TREE_TYPE (t
)) == FUNCTION_TYPE
178 || TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
)));
181 /* Do `exp = require_instantiated_type (type, exp);' to make sure EXP
182 does not have an uninstantiated type.
183 TYPE is type to instantiate with, if uninstantiated. */
186 require_instantiated_type (type
, exp
, errval
)
187 tree type
, exp
, errval
;
189 if (TREE_TYPE (exp
) == NULL_TREE
)
191 error ("argument list may not have an initializer list");
195 if (TREE_TYPE (exp
) == unknown_type_node
196 || (TREE_CODE (TREE_TYPE (exp
)) == OFFSET_TYPE
197 && TREE_TYPE (TREE_TYPE (exp
)) == unknown_type_node
))
199 exp
= instantiate_type (type
, exp
, 1);
200 if (TREE_TYPE (exp
) == error_mark_node
)
206 /* Return a variant of TYPE which has all the type qualifiers of LIKE
207 as well as those of TYPE. */
210 qualify_type (type
, like
)
213 int constflag
= TYPE_READONLY (type
) || TYPE_READONLY (like
);
214 int volflag
= TYPE_VOLATILE (type
) || TYPE_VOLATILE (like
);
215 /* @@ Must do member pointers here. */
216 return cp_build_type_variant (type
, constflag
, volflag
);
219 /* Return the common type of two parameter lists.
220 We assume that comptypes has already been done and returned 1;
221 if that isn't so, this may crash.
223 As an optimization, free the space we allocate if the parameter
224 lists are already common. */
230 tree oldargs
= p1
, newargs
, n
;
233 char *first_obj
= (char *) oballoc (0);
235 len
= list_length (p1
);
236 newargs
= tree_last (p1
);
238 if (newargs
== void_list_node
)
247 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
252 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
254 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
256 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
259 else if (! TREE_PURPOSE (p1
))
261 if (TREE_PURPOSE (p2
))
263 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
269 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
271 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
273 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
276 TREE_VALUE (n
) = common_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
279 TREE_VALUE (n
) = TREE_VALUE (p1
);
290 /* Return the common type of two types.
291 We assume that comptypes has already been done and returned 1;
292 if that isn't so, this may crash.
294 This is the type for the result of most arithmetic operations
295 if the operands have the given two types.
297 We do not deal with enumeral types here because they have already been
298 converted to integer types. */
304 register enum tree_code code1
;
305 register enum tree_code code2
;
308 /* Save time if the two types are the same. */
310 if (t1
== t2
) return t1
;
312 /* If one type is nonsense, use the other. */
313 if (t1
== error_mark_node
)
315 if (t2
== error_mark_node
)
318 /* Merge the attributes. */
319 attributes
= merge_machine_type_attributes (t1
, t2
);
321 { register tree a1
, a2
;
322 a1
= TYPE_ATTRIBUTES (t1
);
323 a2
= TYPE_ATTRIBUTES (t2
);
325 /* Either one unset? Take the set one. */
327 if (!(attributes
= a1
))
330 /* One that completely contains the other? Take it. */
332 else if (a2
&& !attribute_list_contained (a1
, a2
))
334 if (attribute_list_contained (a2
, a1
))
338 /* Pick the longest list, and hang on the other list. */
339 /* ??? For the moment we punt on the issue of attrs with args. */
341 if (list_length (a1
) < list_length (a2
))
342 attributes
= a2
, a2
= a1
;
344 for (; a2
; a2
= TREE_CHAIN (a2
))
345 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
346 attributes
) == NULL_TREE
)
349 TREE_CHAIN (a1
) = attributes
;
356 /* Treat an enum type as the unsigned integer type of the same width. */
358 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
359 t1
= type_for_size (TYPE_PRECISION (t1
), 1);
360 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
361 t2
= type_for_size (TYPE_PRECISION (t2
), 1);
363 if (TYPE_PTRMEMFUNC_P (t1
))
364 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
365 if (TYPE_PTRMEMFUNC_P (t2
))
366 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
368 code1
= TREE_CODE (t1
);
369 code2
= TREE_CODE (t2
);
371 /* If one type is complex, form the common type of the non-complex
372 components, then make that complex. Use T1 or T2 if it is the
374 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
376 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
377 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
378 tree subtype
= common_type (subtype1
, subtype2
);
380 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
381 return build_type_attribute_variant (t1
, attributes
);
382 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
383 return build_type_attribute_variant (t2
, attributes
);
385 return build_type_attribute_variant (build_complex_type (subtype
),
393 /* If only one is real, use it as the result. */
395 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
396 return build_type_attribute_variant (t1
, attributes
);
398 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
399 return build_type_attribute_variant (t2
, attributes
);
401 /* Both real or both integers; use the one with greater precision. */
403 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
404 return build_type_attribute_variant (t1
, attributes
);
405 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
406 return build_type_attribute_variant (t2
, attributes
);
408 /* Same precision. Prefer longs to ints even when same size. */
410 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
411 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
412 return build_type_attribute_variant (long_unsigned_type_node
,
415 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
416 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
418 /* But preserve unsignedness from the other type,
419 since long cannot hold all the values of an unsigned int. */
420 if (TREE_UNSIGNED (t1
) || TREE_UNSIGNED (t2
))
421 t1
= long_unsigned_type_node
;
423 t1
= long_integer_type_node
;
424 return build_type_attribute_variant (t1
, attributes
);
427 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
428 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
429 return build_type_attribute_variant (long_double_type_node
,
432 /* Otherwise prefer the unsigned one. */
434 if (TREE_UNSIGNED (t1
))
435 return build_type_attribute_variant (t1
, attributes
);
437 return build_type_attribute_variant (t2
, attributes
);
441 /* For two pointers, do this recursively on the target type,
442 and combine the qualifiers of the two types' targets. */
443 /* This code was turned off; I don't know why.
444 But ANSI C++ specifies doing this with the qualifiers.
445 So I turned it on again. */
447 tree tt1
= TYPE_MAIN_VARIANT (TREE_TYPE (t1
));
448 tree tt2
= TYPE_MAIN_VARIANT (TREE_TYPE (t2
));
450 = TYPE_READONLY (TREE_TYPE (t1
)) || TYPE_READONLY (TREE_TYPE (t2
));
452 = TYPE_VOLATILE (TREE_TYPE (t1
)) || TYPE_VOLATILE (TREE_TYPE (t2
));
457 else if (tt1
== void_type_node
|| tt2
== void_type_node
)
458 target
= void_type_node
;
459 else if (tt1
== unknown_type_node
)
461 else if (tt2
== unknown_type_node
)
464 target
= common_type (tt1
, tt2
);
466 target
= cp_build_type_variant (target
, constp
, volatilep
);
467 if (code1
== POINTER_TYPE
)
468 t1
= build_pointer_type (target
);
470 t1
= build_reference_type (target
);
471 t1
= build_type_attribute_variant (t1
, attributes
);
473 if (TREE_CODE (target
) == METHOD_TYPE
)
474 t1
= build_ptrmemfunc_type (t1
);
481 tree elt
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
482 /* Save space: see if the result is identical to one of the args. */
483 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
484 return build_type_attribute_variant (t1
, attributes
);
485 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
486 return build_type_attribute_variant (t2
, attributes
);
487 /* Merge the element types, and have a size if either arg has one. */
488 t1
= build_cplus_array_type
489 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
490 return build_type_attribute_variant (t1
, attributes
);
494 /* Function types: prefer the one that specified arg types.
495 If both do, merge the arg types. Also merge the return types. */
497 tree valtype
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
498 tree p1
= TYPE_ARG_TYPES (t1
);
499 tree p2
= TYPE_ARG_TYPES (t2
);
502 /* Save space: see if the result is identical to one of the args. */
503 if (valtype
== TREE_TYPE (t1
) && ! p2
)
504 return build_type_attribute_variant (t1
, attributes
);
505 if (valtype
== TREE_TYPE (t2
) && ! p1
)
506 return build_type_attribute_variant (t2
, attributes
);
508 /* Simple way if one arg fails to specify argument types. */
509 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
511 rval
= build_function_type (valtype
, p2
);
512 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
513 rval
= build_exception_variant (rval
, raises
);
514 return build_type_attribute_variant (rval
, attributes
);
516 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
517 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
519 rval
= build_function_type (valtype
, p1
);
521 rval
= build_exception_variant (rval
, raises
);
522 return build_type_attribute_variant (rval
, attributes
);
525 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
526 rval
= build_exception_variant (rval
, raises
);
527 return build_type_attribute_variant (rval
, attributes
);
532 t1
= TYPE_MAIN_VARIANT (t1
);
533 t2
= TYPE_MAIN_VARIANT (t2
);
535 if (DERIVED_FROM_P (t1
, t2
) && binfo_or_else (t1
, t2
))
536 return build_type_attribute_variant (t1
, attributes
);
537 else if (binfo_or_else (t2
, t1
))
538 return build_type_attribute_variant (t2
, attributes
);
540 compiler_error ("common_type called with uncommon aggregate types");
543 if (TREE_CODE (TREE_TYPE (t1
)) == TREE_CODE (TREE_TYPE (t2
)))
545 /* Get this value the long way, since TYPE_METHOD_BASETYPE
546 is just the main variant of this. */
550 tree b1
= TYPE_OFFSET_BASETYPE (t1
);
551 tree b2
= TYPE_OFFSET_BASETYPE (t2
);
553 if (comptypes (b1
, b2
, 1)
554 || (DERIVED_FROM_P (b1
, b2
) && binfo_or_else (b1
, b2
)))
555 basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
558 if (binfo_or_else (b2
, b1
) == NULL_TREE
)
559 compiler_error ("common_type called with uncommon method types");
560 basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t1
)));
563 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
565 /* If this was a member function type, get back to the
566 original type of type member function (i.e., without
567 the class instance variable up front. */
568 t1
= build_function_type (TREE_TYPE (t1
),
569 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
570 t2
= build_function_type (TREE_TYPE (t2
),
571 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
572 t3
= common_type (t1
, t2
);
573 t3
= build_cplus_method_type (basetype
, TREE_TYPE (t3
),
574 TYPE_ARG_TYPES (t3
));
575 t1
= build_exception_variant (t3
, raises
);
578 compiler_error ("common_type called with uncommon method types");
580 return build_type_attribute_variant (t1
, attributes
);
583 if (TREE_TYPE (t1
) == TREE_TYPE (t2
))
585 tree b1
= TYPE_OFFSET_BASETYPE (t1
);
586 tree b2
= TYPE_OFFSET_BASETYPE (t2
);
588 if (comptypes (b1
, b2
, 1)
589 || (DERIVED_FROM_P (b1
, b2
) && binfo_or_else (b1
, b2
)))
590 return build_type_attribute_variant (t2
, attributes
);
591 else if (binfo_or_else (b2
, b1
))
592 return build_type_attribute_variant (t1
, attributes
);
594 compiler_error ("common_type called with uncommon member types");
597 return build_type_attribute_variant (t1
, attributes
);
601 /* Return 1 if TYPE1 and TYPE2 raise the same exceptions. */
604 compexcepttypes (t1
, t2
)
607 return TYPE_RAISES_EXCEPTIONS (t1
) == TYPE_RAISES_EXCEPTIONS (t2
);
611 comp_array_types (cmp
, t1
, t2
, strict
)
612 register int (*cmp
) PROTO((tree
, tree
, int));
616 tree d1
= TYPE_DOMAIN (t1
);
617 tree d2
= TYPE_DOMAIN (t2
);
619 /* Target types must match incl. qualifiers. */
620 if (!(TREE_TYPE (t1
) == TREE_TYPE (t2
)
621 || (*cmp
) (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
)))
624 /* Sizes must match unless one is missing or variable. */
625 if (d1
== 0 || d2
== 0 || d1
== d2
626 || TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
627 || TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
628 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
629 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
)
632 return ((TREE_INT_CST_LOW (TYPE_MIN_VALUE (d1
))
633 == TREE_INT_CST_LOW (TYPE_MIN_VALUE (d2
)))
634 && (TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d1
))
635 == TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d2
)))
636 && (TREE_INT_CST_LOW (TYPE_MAX_VALUE (d1
))
637 == TREE_INT_CST_LOW (TYPE_MAX_VALUE (d2
)))
638 && (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d1
))
639 == TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d2
))));
642 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
643 or various other operations. This is what ANSI C++ speaks of as
646 For C++: argument STRICT says we should be strict about this
649 2 : strict, except that if one type is a reference and
650 the other is not, compare the target type of the
651 reference to the type that's not a reference (ARM, p308).
652 This is used for checking for invalid overloading.
653 1 : strict (compared according to ANSI C)
654 This is used for checking whether two function decls match.
655 0 : <= (compared according to C++)
656 -1: <= or >= (relaxed)
658 Otherwise, pointers involving base classes and derived classes can
659 be mixed as valid: i.e. a pointer to a derived class may be converted
660 to a pointer to one of its base classes, as per C++. A pointer to
661 a derived class may be passed as a parameter to a function expecting a
662 pointer to a base classes. These allowances do not commute. In this
663 case, TYPE1 is assumed to be the base class, and TYPE2 is assumed to
664 be the derived class. */
667 comptypes (type1
, type2
, strict
)
671 register tree t1
= type1
;
672 register tree t2
= type2
;
675 /* Suppress errors caused by previously reported errors */
680 /* This should never happen. */
681 my_friendly_assert (t1
!= error_mark_node
, 307);
683 if (t2
== error_mark_node
)
688 /* Treat an enum type as the unsigned integer type of the same width. */
690 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
691 t1
= type_for_size (TYPE_PRECISION (t1
), 1);
692 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
693 t2
= type_for_size (TYPE_PRECISION (t2
), 1);
699 if (TYPE_PTRMEMFUNC_P (t1
))
700 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
701 if (TYPE_PTRMEMFUNC_P (t2
))
702 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
704 /* Different classes of types can't be compatible. */
706 if (TREE_CODE (t1
) != TREE_CODE (t2
))
709 && ((TREE_CODE (t1
) == REFERENCE_TYPE
)
710 ^ (TREE_CODE (t2
) == REFERENCE_TYPE
)))
712 if (TREE_CODE (t1
) == REFERENCE_TYPE
)
713 return comptypes (TREE_TYPE (t1
), t2
, 1);
714 return comptypes (t1
, TREE_TYPE (t2
), 1);
722 /* Qualifiers must match. */
724 if (TYPE_READONLY (t1
) != TYPE_READONLY (t2
))
726 if (TYPE_VOLATILE (t1
) != TYPE_VOLATILE (t2
))
729 /* Allow for two different type nodes which have essentially the same
730 definition. Note that we already checked for equality of the type
731 type qualifiers (just above). */
733 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
736 /* ??? COMP_TYPE_ATTRIBUTES is currently useless for variables as each
737 attribute is its own main variant (`val' will remain 0). */
738 #ifndef COMP_TYPE_ATTRIBUTES
739 #define COMP_TYPE_ATTRIBUTES(t1,t2) 1
742 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
743 if (! (attrval
= COMP_TYPE_ATTRIBUTES (t1
, t2
)))
746 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
749 switch (TREE_CODE (t1
))
751 case TEMPLATE_TEMPLATE_PARM
:
752 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
753 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
))
755 if (! CLASSTYPE_TEMPLATE_INFO (t1
) && ! CLASSTYPE_TEMPLATE_INFO (t2
))
757 /* Don't check inheritance. */
763 if (CLASSTYPE_TEMPLATE_INFO (t1
) && CLASSTYPE_TEMPLATE_INFO (t2
)
764 && (CLASSTYPE_TI_TEMPLATE (t1
) == CLASSTYPE_TI_TEMPLATE (t2
)
765 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
))
767 int i
= TREE_VEC_LENGTH (CLASSTYPE_TI_ARGS (t1
));
768 tree
*p1
= &TREE_VEC_ELT (CLASSTYPE_TI_ARGS (t1
), 0);
769 tree
*p2
= &TREE_VEC_ELT (CLASSTYPE_TI_ARGS (t2
), 0);
773 if (TREE_CODE_CLASS (TREE_CODE (p1
[i
])) == 't')
775 if (! comptypes (p1
[i
], p2
[i
], 1))
780 if (simple_cst_equal (p1
[i
], p2
[i
]) <= 0)
791 val
= (comptypes (build_pointer_type (TYPE_OFFSET_BASETYPE (t1
)),
792 build_pointer_type (TYPE_OFFSET_BASETYPE (t2
)), strict
)
793 && comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
));
797 if (! compexcepttypes (t1
, t2
))
800 /* This case is anti-symmetrical!
801 One can pass a base member (or member function)
802 to something expecting a derived member (or member function),
803 but not vice-versa! */
805 val
= (comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
)
806 && compparms (TYPE_ARG_TYPES (t1
),
807 TYPE_ARG_TYPES (t2
), strict
));
821 if (TREE_CODE (t1
) == RECORD_TYPE
&& TREE_CODE (t2
) == RECORD_TYPE
)
825 rval
= t1
== t2
|| DERIVED_FROM_P (t1
, t2
);
834 val
= DERIVED_FROM_P (t2
, t1
);
841 val
= comptypes (t1
, t2
, strict
);
845 if (! compexcepttypes (t1
, t2
))
848 val
= ((TREE_TYPE (t1
) == TREE_TYPE (t2
)
849 || comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
))
850 && compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
), strict
));
854 /* Target types must match incl. qualifiers. */
855 val
= comp_array_types (comptypes
, t1
, t2
, strict
);
858 case TEMPLATE_TYPE_PARM
:
859 return TEMPLATE_TYPE_IDX (t1
) == TEMPLATE_TYPE_IDX (t2
)
860 && TEMPLATE_TYPE_LEVEL (t1
) == TEMPLATE_TYPE_LEVEL (t2
);
863 if (TYPE_IDENTIFIER (t1
) != TYPE_IDENTIFIER (t2
))
865 return comptypes (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
), 1);
870 return attrval
== 2 && val
== 1 ? 2 : val
;
873 /* Return 1 or -1 if TTL and TTR are pointers to types that are equivalent,
874 ignoring their qualifiers, 0 if not. Return 1 means that TTR can be
875 converted to TTL. Return -1 means that TTL can be converted to TTR but
878 NPTRS is the number of pointers we can strip off and keep cool.
879 This is used to permit (for aggr A, aggr B) A, B* to convert to A*,
880 but to not permit B** to convert to A**. */
883 comp_target_types (ttl
, ttr
, nptrs
)
887 ttl
= TYPE_MAIN_VARIANT (ttl
);
888 ttr
= TYPE_MAIN_VARIANT (ttr
);
892 if (TREE_CODE (ttr
) != TREE_CODE (ttl
))
895 if (TREE_CODE (ttr
) == POINTER_TYPE
)
897 ttl
= TREE_TYPE (ttl
);
898 ttr
= TREE_TYPE (ttr
);
902 if (TREE_CODE (ttl
) == UNKNOWN_TYPE
903 || TREE_CODE (ttr
) == UNKNOWN_TYPE
)
905 else if (TREE_CODE (ttl
) == VOID_TYPE
906 && TREE_CODE (ttr
) != FUNCTION_TYPE
907 && TREE_CODE (ttr
) != METHOD_TYPE
908 && TREE_CODE (ttr
) != OFFSET_TYPE
)
910 else if (TREE_CODE (ttr
) == VOID_TYPE
911 && TREE_CODE (ttl
) != FUNCTION_TYPE
912 && TREE_CODE (ttl
) != METHOD_TYPE
913 && TREE_CODE (ttl
) != OFFSET_TYPE
)
915 else if (TREE_CODE (ttl
) == POINTER_TYPE
916 || TREE_CODE (ttl
) == ARRAY_TYPE
)
918 if (comp_ptr_ttypes (ttl
, ttr
))
920 else if (comp_ptr_ttypes (ttr
, ttl
))
926 /* Const and volatile mean something different for function types,
927 so the usual checks are not appropriate. */
928 if (TREE_CODE (ttl
) == FUNCTION_TYPE
|| TREE_CODE (ttl
) == METHOD_TYPE
)
929 return comp_target_types (ttl
, ttr
, nptrs
- 1);
931 /* Make sure that the cv-quals change only in the same direction as
935 int c
= TYPE_READONLY (ttl
) - TYPE_READONLY (ttr
);
936 int v
= TYPE_VOLATILE (ttl
) - TYPE_VOLATILE (ttr
);
938 if ((c
> 0 && v
< 0) || (c
< 0 && v
> 0))
941 if (TYPE_MAIN_VARIANT (ttl
) == TYPE_MAIN_VARIANT (ttr
))
942 return (c
+ v
< 0) ? -1 : 1;
944 t
= comp_target_types (ttl
, ttr
, nptrs
- 1);
945 if ((t
== 1 && c
+ v
>= 0) || (t
== -1 && c
+ v
<= 0))
952 if (TREE_CODE (ttr
) == REFERENCE_TYPE
)
953 return comp_target_types (TREE_TYPE (ttl
), TREE_TYPE (ttr
), nptrs
);
954 if (TREE_CODE (ttr
) == ARRAY_TYPE
)
955 return comp_array_types (comp_target_types
, ttl
, ttr
, 0);
956 else if (TREE_CODE (ttr
) == FUNCTION_TYPE
|| TREE_CODE (ttr
) == METHOD_TYPE
)
958 if (comp_target_types (TREE_TYPE (ttl
), TREE_TYPE (ttr
), -1))
959 switch (comp_target_parms (TYPE_ARG_TYPES (ttl
),
960 TYPE_ARG_TYPES (ttr
), 1))
969 my_friendly_abort (112);
975 else if (TREE_CODE (ttr
) == OFFSET_TYPE
)
977 /* Contravariance: we can assign a pointer to base member to a pointer
978 to derived member. Note difference from simple pointer case, where
979 we can pass a pointer to derived to a pointer to base. */
980 if (comptypes (TYPE_OFFSET_BASETYPE (ttr
),
981 TYPE_OFFSET_BASETYPE (ttl
), 0))
982 return comp_target_types (TREE_TYPE (ttl
), TREE_TYPE (ttr
), nptrs
);
983 else if (comptypes (TYPE_OFFSET_BASETYPE (ttl
),
984 TYPE_OFFSET_BASETYPE (ttr
), 0)
985 && comp_target_types (TREE_TYPE (ttl
), TREE_TYPE (ttr
), nptrs
))
988 else if (IS_AGGR_TYPE (ttl
))
992 if (comptypes (build_pointer_type (ttl
), build_pointer_type (ttr
), 0))
994 if (comptypes (build_pointer_type (ttr
), build_pointer_type (ttl
), 0))
1002 /* If two types share a common base type, return that basetype.
1003 If there is not a unique most-derived base type, this function
1004 returns ERROR_MARK_NODE. */
1007 common_base_type (tt1
, tt2
)
1010 tree best
= NULL_TREE
;
1013 /* If one is a baseclass of another, that's good enough. */
1014 if (UNIQUELY_DERIVED_FROM_P (tt1
, tt2
))
1016 if (UNIQUELY_DERIVED_FROM_P (tt2
, tt1
))
1019 /* Otherwise, try to find a unique baseclass of TT1
1020 that is shared by TT2, and follow that down. */
1021 for (i
= CLASSTYPE_N_BASECLASSES (tt1
)-1; i
>= 0; i
--)
1023 tree basetype
= TYPE_BINFO_BASETYPE (tt1
, i
);
1024 tree trial
= common_base_type (basetype
, tt2
);
1027 if (trial
== error_mark_node
)
1029 if (best
== NULL_TREE
)
1031 else if (best
!= trial
)
1032 return error_mark_node
;
1037 for (i
= CLASSTYPE_N_BASECLASSES (tt2
)-1; i
>= 0; i
--)
1039 tree basetype
= TYPE_BINFO_BASETYPE (tt2
, i
);
1040 tree trial
= common_base_type (tt1
, basetype
);
1043 if (trial
== error_mark_node
)
1045 if (best
== NULL_TREE
)
1047 else if (best
!= trial
)
1048 return error_mark_node
;
1054 /* Subroutines of `comptypes'. */
1056 /* Return 1 if two parameter type lists PARMS1 and PARMS2
1057 are equivalent in the sense that functions with those parameter types
1058 can have equivalent types.
1059 If either list is empty, we win.
1060 Otherwise, the two lists must be equivalent, element by element.
1062 C++: See comment above about TYPE1, TYPE2, STRICT.
1063 If STRICT == 3, it means checking is strict, but do not compare
1064 default parameter values. */
1067 compparms (parms1
, parms2
, strict
)
1068 tree parms1
, parms2
;
1071 register tree t1
= parms1
, t2
= parms2
;
1073 /* An unspecified parmlist matches any specified parmlist
1074 whose argument types don't need default promotions. */
1076 if (strict
<= 0 && t1
== 0)
1077 return self_promoting_args_p (t2
);
1078 if (strict
< 0 && t2
== 0)
1079 return self_promoting_args_p (t1
);
1083 if (t1
== 0 && t2
== 0)
1085 /* If one parmlist is shorter than the other,
1086 they fail to match, unless STRICT is <= 0. */
1087 if (t1
== 0 || t2
== 0)
1094 return t1
&& TREE_PURPOSE (t1
);
1096 if (! comptypes (TREE_VALUE (t2
), TREE_VALUE (t1
), strict
))
1101 return t2
== void_list_node
&& TREE_PURPOSE (t1
);
1102 return TREE_PURPOSE (t1
) || TREE_PURPOSE (t2
);
1105 t1
= TREE_CHAIN (t1
);
1106 t2
= TREE_CHAIN (t2
);
1110 /* This really wants return whether or not parameter type lists
1111 would make their owning functions assignment compatible or not. */
1114 comp_target_parms (parms1
, parms2
, strict
)
1115 tree parms1
, parms2
;
1118 register tree t1
= parms1
, t2
= parms2
;
1119 int warn_contravariance
= 0;
1121 /* An unspecified parmlist matches any specified parmlist
1122 whose argument types don't need default promotions.
1123 @@@ see 13.3.3 for a counterexample... */
1125 if (t1
== 0 && t2
!= 0)
1127 cp_pedwarn ("ANSI C++ prohibits conversion from `(%#T)' to `(...)'",
1129 return self_promoting_args_p (t2
);
1132 return self_promoting_args_p (t1
);
1134 for (; t1
|| t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1138 /* If one parmlist is shorter than the other,
1139 they fail to match, unless STRICT is <= 0. */
1140 if (t1
== 0 || t2
== 0)
1145 return 1 + warn_contravariance
;
1146 return ((t1
&& TREE_PURPOSE (t1
)) + warn_contravariance
);
1148 p1
= TREE_VALUE (t1
);
1149 p2
= TREE_VALUE (t2
);
1153 if ((TREE_CODE (p1
) == POINTER_TYPE
&& TREE_CODE (p2
) == POINTER_TYPE
)
1154 || (TREE_CODE (p1
) == REFERENCE_TYPE
1155 && TREE_CODE (p2
) == REFERENCE_TYPE
))
1158 && (TYPE_MAIN_VARIANT (TREE_TYPE (p1
))
1159 == TYPE_MAIN_VARIANT (TREE_TYPE (p2
))))
1162 /* The following is wrong for contravariance,
1163 but many programs depend on it. */
1164 if (TREE_TYPE (p1
) == void_type_node
)
1166 if (TREE_TYPE (p2
) == void_type_node
)
1168 warn_contravariance
= 1;
1171 if (IS_AGGR_TYPE (TREE_TYPE (p1
)))
1173 if (comptypes (p2
, p1
, 0) == 0)
1175 if (comptypes (p1
, p2
, 0) != 0)
1176 warn_contravariance
= 1;
1183 /* Note backwards order due to contravariance. */
1184 if (comp_target_types (p2
, p1
, 1) == 0)
1186 if (comp_target_types (p1
, p2
, 1))
1188 warn_contravariance
= 1;
1194 /* Target types are compatible--just make sure that if
1195 we use parameter lists, that they are ok as well. */
1196 if (TREE_CODE (p1
) == FUNCTION_TYPE
|| TREE_CODE (p1
) == METHOD_TYPE
)
1197 switch (comp_target_parms (TYPE_ARG_TYPES (p1
),
1198 TYPE_ARG_TYPES (p2
),
1206 warn_contravariance
= 1;
1209 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
1211 int cmp
= simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
));
1213 my_friendly_abort (114);
1218 return 1 + warn_contravariance
;
1221 /* Return 1 if PARMS specifies a fixed number of parameters
1222 and none of their types is affected by default promotions. */
1225 self_promoting_args_p (parms
)
1229 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
1231 register tree type
= TREE_VALUE (t
);
1233 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
1239 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
1242 if (C_PROMOTING_INTEGER_TYPE_P (type
))
1248 /* Return an unsigned type the same as TYPE in other respects.
1250 C++: must make these work for type variants as well. */
1253 unsigned_type (type
)
1256 tree type1
= TYPE_MAIN_VARIANT (type
);
1257 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
1258 return unsigned_char_type_node
;
1259 if (type1
== integer_type_node
)
1260 return unsigned_type_node
;
1261 if (type1
== short_integer_type_node
)
1262 return short_unsigned_type_node
;
1263 if (type1
== long_integer_type_node
)
1264 return long_unsigned_type_node
;
1265 if (type1
== long_long_integer_type_node
)
1266 return long_long_unsigned_type_node
;
1267 if (type1
== intDI_type_node
)
1268 return unsigned_intDI_type_node
;
1269 if (type1
== intSI_type_node
)
1270 return unsigned_intSI_type_node
;
1271 if (type1
== intHI_type_node
)
1272 return unsigned_intHI_type_node
;
1273 if (type1
== intQI_type_node
)
1274 return unsigned_intQI_type_node
;
1276 return signed_or_unsigned_type (1, type
);
1279 /* Return a signed type the same as TYPE in other respects. */
1285 tree type1
= TYPE_MAIN_VARIANT (type
);
1286 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
1287 return signed_char_type_node
;
1288 if (type1
== unsigned_type_node
)
1289 return integer_type_node
;
1290 if (type1
== short_unsigned_type_node
)
1291 return short_integer_type_node
;
1292 if (type1
== long_unsigned_type_node
)
1293 return long_integer_type_node
;
1294 if (type1
== long_long_unsigned_type_node
)
1295 return long_long_integer_type_node
;
1296 if (type1
== unsigned_intDI_type_node
)
1297 return intDI_type_node
;
1298 if (type1
== unsigned_intSI_type_node
)
1299 return intSI_type_node
;
1300 if (type1
== unsigned_intHI_type_node
)
1301 return intHI_type_node
;
1302 if (type1
== unsigned_intQI_type_node
)
1303 return intQI_type_node
;
1305 return signed_or_unsigned_type (0, type
);
1308 /* Return a type the same as TYPE except unsigned or
1309 signed according to UNSIGNEDP. */
1312 signed_or_unsigned_type (unsignedp
, type
)
1316 if (! INTEGRAL_TYPE_P (type
)
1317 || TREE_UNSIGNED (type
) == unsignedp
)
1320 if (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
))
1321 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1322 if (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
1323 return unsignedp
? unsigned_type_node
: integer_type_node
;
1324 if (TYPE_PRECISION (type
) == TYPE_PRECISION (short_integer_type_node
))
1325 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1326 if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_integer_type_node
))
1327 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1328 if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_long_integer_type_node
))
1329 return (unsignedp
? long_long_unsigned_type_node
1330 : long_long_integer_type_node
);
1334 /* Compute the value of the `sizeof' operator. */
1340 enum tree_code code
= TREE_CODE (type
);
1343 if (processing_template_decl
)
1344 return build_min (SIZEOF_EXPR
, sizetype
, type
);
1346 if (code
== FUNCTION_TYPE
)
1348 if (pedantic
|| warn_pointer_arith
)
1349 pedwarn ("ANSI C++ forbids taking the sizeof a function type");
1350 return size_int (1);
1352 if (code
== METHOD_TYPE
)
1354 if (pedantic
|| warn_pointer_arith
)
1355 pedwarn ("ANSI C++ forbids taking the sizeof a method type");
1356 return size_int (1);
1358 if (code
== VOID_TYPE
)
1360 if (pedantic
|| warn_pointer_arith
)
1361 pedwarn ("ANSI C++ forbids taking the sizeof a void type");
1362 return size_int (1);
1364 if (code
== ERROR_MARK
)
1365 return size_int (1);
1367 /* ARM $5.3.2: ``When applied to a reference, the result is the size of the
1368 referenced object.'' */
1369 if (code
== REFERENCE_TYPE
)
1370 type
= TREE_TYPE (type
);
1372 /* We couldn't find anything in the ARM or the draft standard that says,
1373 one way or the other, if doing sizeof on something that doesn't have
1374 an object associated with it is correct or incorrect. For example, if
1375 you declare `struct S { char str[16]; };', and in your program do
1376 a `sizeof (S::str)', should we flag that as an error or should we give
1377 the size of it? Since it seems like a reasonable thing to do, we'll go
1378 with giving the value. */
1379 if (code
== OFFSET_TYPE
)
1380 type
= TREE_TYPE (type
);
1382 /* @@ This also produces an error for a signature ref.
1383 In that case we should be able to do better. */
1384 if (IS_SIGNATURE (type
))
1386 error ("`sizeof' applied to a signature type");
1387 return size_int (0);
1390 if (TYPE_SIZE (complete_type (type
)) == 0)
1392 cp_error ("`sizeof' applied to incomplete type `%T'", type
);
1393 return size_int (0);
1396 /* Convert in case a char is more than one unit. */
1397 t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
1398 size_int (TYPE_PRECISION (char_type_node
)));
1399 t
= convert (sizetype
, t
);
1400 /* size_binop does not put the constant in range, so do it now. */
1401 if (TREE_CODE (t
) == INTEGER_CST
&& force_fit_type (t
, 0))
1402 TREE_CONSTANT_OVERFLOW (t
) = TREE_OVERFLOW (t
) = 1;
1410 if (processing_template_decl
)
1411 return build_min (SIZEOF_EXPR
, sizetype
, e
);
1413 if (TREE_CODE (e
) == COMPONENT_REF
1414 && DECL_BIT_FIELD (TREE_OPERAND (e
, 1)))
1415 error ("sizeof applied to a bit-field");
1416 /* ANSI says arrays and functions are converted inside comma.
1417 But we can't really convert them in build_compound_expr
1418 because that would break commas in lvalues.
1419 So do the conversion here if operand was a comma. */
1420 if (TREE_CODE (e
) == COMPOUND_EXPR
1421 && (TREE_CODE (TREE_TYPE (e
)) == ARRAY_TYPE
1422 || TREE_CODE (TREE_TYPE (e
)) == FUNCTION_TYPE
))
1423 e
= default_conversion (e
);
1424 else if (TREE_CODE (e
) == TREE_LIST
)
1426 tree t
= TREE_VALUE (e
);
1429 && TREE_CODE (TREE_TYPE (t
)) == FUNCTION_TYPE
)
1430 || is_overloaded_fn (t
)))
1431 pedwarn ("ANSI C++ forbids taking the sizeof a function type");
1433 return c_sizeof (TREE_TYPE (e
));
1437 c_sizeof_nowarn (type
)
1440 enum tree_code code
= TREE_CODE (type
);
1443 if (code
== FUNCTION_TYPE
1444 || code
== METHOD_TYPE
1445 || code
== VOID_TYPE
1446 || code
== ERROR_MARK
)
1447 return size_int (1);
1448 if (code
== REFERENCE_TYPE
)
1449 type
= TREE_TYPE (type
);
1451 if (TYPE_SIZE (type
) == 0)
1452 return size_int (0);
1454 /* Convert in case a char is more than one unit. */
1455 t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
1456 size_int (TYPE_PRECISION (char_type_node
)));
1457 t
= convert (sizetype
, t
);
1458 force_fit_type (t
, 0);
1462 /* Implement the __alignof keyword: Return the minimum required
1463 alignment of TYPE, measured in bytes. */
1469 enum tree_code code
= TREE_CODE (type
);
1472 if (processing_template_decl
)
1473 return build_min (ALIGNOF_EXPR
, sizetype
, type
);
1475 if (code
== FUNCTION_TYPE
|| code
== METHOD_TYPE
)
1476 return size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1478 if (code
== VOID_TYPE
|| code
== ERROR_MARK
)
1479 return size_int (1);
1481 /* C++: this is really correct! */
1482 if (code
== REFERENCE_TYPE
)
1483 type
= TREE_TYPE (type
);
1485 /* @@ This also produces an error for a signature ref.
1486 In that case we should be able to do better. */
1487 if (IS_SIGNATURE (type
))
1489 error ("`__alignof' applied to a signature type");
1490 return size_int (1);
1493 t
= size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
1494 force_fit_type (t
, 0);
1498 /* Perform default promotions for C data used in expressions.
1499 Arrays and functions are converted to pointers;
1500 enumeral types or short or char, to int.
1501 In addition, manifest constants symbols are replaced by their values.
1503 C++: this will automatically bash references to their target type. */
1506 decay_conversion (exp
)
1509 register tree type
= TREE_TYPE (exp
);
1510 register enum tree_code code
= TREE_CODE (type
);
1512 if (code
== OFFSET_TYPE
)
1514 if (TREE_CODE (exp
) == OFFSET_REF
)
1515 return decay_conversion (resolve_offset_ref (exp
));
1517 type
= TREE_TYPE (type
);
1518 code
= TREE_CODE (type
);
1520 if (type
== unknown_type_node
)
1522 cp_pedwarn ("assuming & on overloaded member function");
1523 return build_unary_op (ADDR_EXPR
, exp
, 0);
1527 if (code
== REFERENCE_TYPE
)
1529 exp
= convert_from_reference (exp
);
1530 type
= TREE_TYPE (exp
);
1531 code
= TREE_CODE (type
);
1534 /* Constants can be used directly unless they're not loadable. */
1535 if (TREE_CODE (exp
) == CONST_DECL
)
1536 exp
= DECL_INITIAL (exp
);
1537 /* Replace a nonvolatile const static variable with its value. */
1538 else if (TREE_READONLY_DECL_P (exp
))
1540 exp
= decl_constant_value (exp
);
1541 type
= TREE_TYPE (exp
);
1544 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1545 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1547 if (code
== VOID_TYPE
)
1549 error ("void value not ignored as it ought to be");
1550 return error_mark_node
;
1552 if (code
== FUNCTION_TYPE
)
1554 return build_unary_op (ADDR_EXPR
, exp
, 0);
1556 if (code
== METHOD_TYPE
)
1558 cp_pedwarn ("assuming & on `%E'", exp
);
1559 return build_unary_op (ADDR_EXPR
, exp
, 0);
1561 if (code
== ARRAY_TYPE
)
1566 int constp
, volatilep
;
1568 if (TREE_CODE (exp
) == INDIRECT_REF
)
1570 /* Stripping away the INDIRECT_REF is not the right
1571 thing to do for references... */
1572 tree inner
= TREE_OPERAND (exp
, 0);
1573 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
)
1575 inner
= build1 (CONVERT_EXPR
,
1576 build_pointer_type (TREE_TYPE
1577 (TREE_TYPE (inner
))),
1579 TREE_CONSTANT (inner
) = TREE_CONSTANT (TREE_OPERAND (inner
, 0));
1581 return cp_convert (build_pointer_type (TREE_TYPE (type
)), inner
);
1584 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1586 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1587 return build (COMPOUND_EXPR
, TREE_TYPE (op1
),
1588 TREE_OPERAND (exp
, 0), op1
);
1592 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1594 error ("invalid use of non-lvalue array");
1595 return error_mark_node
;
1598 constp
= volatilep
= 0;
1599 if (TREE_CODE_CLASS (TREE_CODE (exp
)) == 'r'
1600 || TREE_CODE_CLASS (TREE_CODE (exp
)) == 'd')
1602 constp
= TREE_READONLY (exp
);
1603 volatilep
= TREE_THIS_VOLATILE (exp
);
1606 restype
= TREE_TYPE (type
);
1607 if (TYPE_READONLY (type
) || TYPE_VOLATILE (type
)
1608 || constp
|| volatilep
)
1609 restype
= cp_build_type_variant (restype
,
1610 TYPE_READONLY (type
) || constp
,
1611 TYPE_VOLATILE (type
) || volatilep
);
1612 ptrtype
= build_pointer_type (restype
);
1614 if (TREE_CODE (exp
) == VAR_DECL
)
1616 /* ??? This is not really quite correct
1617 in that the type of the operand of ADDR_EXPR
1618 is not the target type of the type of the ADDR_EXPR itself.
1619 Question is, can this lossage be avoided? */
1620 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
1621 if (mark_addressable (exp
) == 0)
1622 return error_mark_node
;
1623 TREE_CONSTANT (adr
) = staticp (exp
);
1624 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1627 /* This way is better for a COMPONENT_REF since it can
1628 simplify the offset for a component. */
1629 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1630 return cp_convert (ptrtype
, adr
);
1637 default_conversion (exp
)
1641 enum tree_code code
;
1643 exp
= decay_conversion (exp
);
1645 type
= TREE_TYPE (exp
);
1646 code
= TREE_CODE (type
);
1648 if (INTEGRAL_CODE_P (code
))
1650 tree t
= type_promotes_to (type
);
1652 return cp_convert (t
, exp
);
1658 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1662 inline_conversion (exp
)
1665 if (TREE_CODE (exp
) == FUNCTION_DECL
)
1667 tree type
= build_type_variant
1668 (TREE_TYPE (exp
), TREE_READONLY (exp
), TREE_THIS_VOLATILE (exp
));
1669 exp
= build1 (ADDR_EXPR
, build_pointer_type (type
), exp
);
1675 build_object_ref (datum
, basetype
, field
)
1676 tree datum
, basetype
, field
;
1679 if (datum
== error_mark_node
)
1680 return error_mark_node
;
1682 dtype
= TREE_TYPE (datum
);
1683 if (TREE_CODE (dtype
) == REFERENCE_TYPE
)
1684 dtype
= TREE_TYPE (dtype
);
1685 if (! IS_AGGR_TYPE_CODE (TREE_CODE (dtype
)))
1687 cp_error ("request for member `%T::%D' in expression of non-aggregate type `%T'",
1688 basetype
, field
, dtype
);
1689 return error_mark_node
;
1691 else if (IS_SIGNATURE (basetype
))
1693 warning ("signature name in scope resolution ignored");
1694 return build_component_ref (datum
, field
, NULL_TREE
, 1);
1696 else if (is_aggr_type (basetype
, 1))
1698 tree binfo
= binfo_or_else (basetype
, dtype
);
1700 return build_x_component_ref (build_scoped_ref (datum
, basetype
),
1703 return error_mark_node
;
1706 /* Like `build_component_ref, but uses an already found field, and converts
1707 from a reference. Must compute access for current_class_ref.
1711 build_component_ref_1 (datum
, field
, protect
)
1715 return convert_from_reference
1716 (build_component_ref (datum
, field
, NULL_TREE
, protect
));
1719 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1720 can, for example, use as an lvalue. This code used to be in
1721 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1722 expressions, where we're dealing with aggregates. But now it's again only
1723 called from unary_complex_lvalue. The case (in particular) that led to
1724 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1728 rationalize_conditional_expr (code
, t
)
1729 enum tree_code code
;
1732 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1733 the first operand is always the one to be used if both operands
1734 are equal, so we know what conditional expression this used to be. */
1735 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
1738 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
1739 ? LE_EXPR
: GE_EXPR
),
1740 TREE_OPERAND (t
, 0),
1741 TREE_OPERAND (t
, 1)),
1742 build_unary_op (code
, TREE_OPERAND (t
, 0), 0),
1743 build_unary_op (code
, TREE_OPERAND (t
, 1), 0));
1747 build_conditional_expr (TREE_OPERAND (t
, 0),
1748 build_unary_op (code
, TREE_OPERAND (t
, 1), 0),
1749 build_unary_op (code
, TREE_OPERAND (t
, 2), 0));
1752 /* Given the TYPE of an anonymous union field inside T, return the
1753 FIELD_DECL for the field. If not found return NULL_TREE. Because
1754 anonymous unions can nest, we must also search all anonymous unions
1755 that are directly reachable. */
1758 lookup_anon_field (t
, type
)
1763 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
1765 if (TREE_STATIC (field
))
1767 if (TREE_CODE (field
) != FIELD_DECL
)
1770 /* If we find it directly, return the field. */
1771 if (DECL_NAME (field
) == NULL_TREE
1772 && type
== TREE_TYPE (field
))
1777 /* Otherwise, it could be nested, search harder. */
1778 if (DECL_NAME (field
) == NULL_TREE
1779 && TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1781 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
1789 /* Build a COMPONENT_REF for a given DATUM, and it's member COMPONENT.
1790 COMPONENT can be an IDENTIFIER_NODE that is the name of the member
1791 that we are interested in, or it can be a FIELD_DECL. */
1794 build_component_ref (datum
, component
, basetype_path
, protect
)
1795 tree datum
, component
, basetype_path
;
1798 register tree basetype
= TREE_TYPE (datum
);
1799 register enum tree_code code
;
1800 register tree field
= NULL
;
1803 if (processing_template_decl
)
1804 return build_min_nt (COMPONENT_REF
, datum
, component
);
1806 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference
1808 switch (TREE_CODE (datum
))
1812 tree value
= build_component_ref (TREE_OPERAND (datum
, 1), component
,
1813 basetype_path
, protect
);
1814 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
1815 TREE_OPERAND (datum
, 0), value
);
1818 return build_conditional_expr
1819 (TREE_OPERAND (datum
, 0),
1820 build_component_ref (TREE_OPERAND (datum
, 1), component
,
1821 basetype_path
, protect
),
1822 build_component_ref (TREE_OPERAND (datum
, 2), component
,
1823 basetype_path
, protect
));
1826 cp_error ("invalid use of %D", datum
);
1827 datum
= error_mark_node
;
1834 code
= TREE_CODE (basetype
);
1836 if (code
== REFERENCE_TYPE
)
1838 datum
= convert_from_reference (datum
);
1839 basetype
= TREE_TYPE (datum
);
1840 code
= TREE_CODE (basetype
);
1842 if (TREE_CODE (datum
) == OFFSET_REF
)
1844 datum
= resolve_offset_ref (datum
);
1845 basetype
= TREE_TYPE (datum
);
1846 code
= TREE_CODE (basetype
);
1849 /* First, see if there is a field or component with name COMPONENT. */
1850 if (TREE_CODE (component
) == TREE_LIST
)
1852 my_friendly_assert (!(TREE_CHAIN (component
) == NULL_TREE
1853 && DECL_CHAIN (TREE_VALUE (component
)) == NULL_TREE
), 309);
1854 return build (COMPONENT_REF
, TREE_TYPE (component
), datum
, component
);
1857 if (! IS_AGGR_TYPE_CODE (code
))
1859 if (code
!= ERROR_MARK
)
1860 cp_error ("request for member `%D' in `%E', which is of non-aggregate type `%T'",
1861 component
, datum
, basetype
);
1862 return error_mark_node
;
1865 if (TYPE_SIZE (complete_type (basetype
)) == 0)
1867 incomplete_type_error (0, basetype
);
1868 return error_mark_node
;
1871 if (TREE_CODE (component
) == BIT_NOT_EXPR
)
1873 if (TYPE_IDENTIFIER (basetype
) != TREE_OPERAND (component
, 0))
1875 cp_error ("destructor specifier `%T::~%T' must have matching names",
1876 basetype
, TREE_OPERAND (component
, 0));
1877 return error_mark_node
;
1879 if (! TYPE_HAS_DESTRUCTOR (basetype
))
1881 cp_error ("type `%T' has no destructor", basetype
);
1882 return error_mark_node
;
1884 return TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype
), 1);
1887 /* Look up component name in the structure type definition. */
1888 if (CLASSTYPE_VFIELD (basetype
)
1889 && DECL_NAME (CLASSTYPE_VFIELD (basetype
)) == component
)
1890 /* Special-case this because if we use normal lookups in an ambiguous
1891 hierarchy, the compiler will abort (because vptr lookups are
1892 not supposed to be ambiguous. */
1893 field
= CLASSTYPE_VFIELD (basetype
);
1894 else if (TREE_CODE (component
) == FIELD_DECL
1895 || TREE_CODE (component
) == TYPE_DECL
)
1901 tree name
= component
;
1902 if (TREE_CODE (component
) == VAR_DECL
)
1903 name
= DECL_NAME (component
);
1904 if (basetype_path
== NULL_TREE
)
1905 basetype_path
= TYPE_BINFO (basetype
);
1906 field
= lookup_field (basetype_path
, name
,
1907 protect
&& !VFIELD_NAME_P (name
), 0);
1908 if (field
== error_mark_node
)
1909 return error_mark_node
;
1911 if (field
== NULL_TREE
)
1913 /* Not found as a data field, look for it as a method. If found,
1914 then if this is the only possible one, return it, else
1915 report ambiguity error. */
1916 tree fndecls
= lookup_fnfields (basetype_path
, name
, 1);
1917 if (fndecls
== error_mark_node
)
1918 return error_mark_node
;
1921 if (TREE_CHAIN (fndecls
) == NULL_TREE
1922 && DECL_CHAIN (TREE_VALUE (fndecls
)) == NULL_TREE
)
1924 tree access
, fndecl
;
1926 /* Unique, so use this one now. */
1927 basetype
= TREE_PURPOSE (fndecls
);
1928 fndecl
= TREE_VALUE (fndecls
);
1929 access
= compute_access (TREE_PURPOSE (fndecls
), fndecl
);
1930 if (access
== access_public_node
)
1932 if (DECL_VINDEX (fndecl
)
1933 && ! resolves_to_fixed_type_p (datum
, 0))
1935 tree addr
= build_unary_op (ADDR_EXPR
, datum
, 0);
1936 tree fntype
= TREE_TYPE (fndecl
);
1938 addr
= convert_pointer_to (DECL_CONTEXT (fndecl
),
1940 datum
= build_indirect_ref (addr
, NULL_PTR
);
1941 my_friendly_assert (datum
!= error_mark_node
, 310);
1942 fndecl
= build_vfn_ref (&addr
, datum
,
1943 DECL_VINDEX (fndecl
));
1944 /* The type of fndecl is a function type,
1945 not a pointer-to-function type, since
1946 build_vfn_ref returns not the correct
1947 vtable slot, but the indirection of the
1948 correct vtable slot. */
1949 TREE_TYPE (fndecl
) = fntype
;
1953 return build (OFFSET_REF
, TREE_TYPE (fndecl
),
1956 if (access
== access_protected_node
)
1957 cp_error ("member function `%D' is protected", fndecl
);
1959 cp_error ("member function `%D' is private", fndecl
);
1960 return error_mark_node
;
1964 /* Just act like build_offset_ref, since the object does
1965 not matter unless we're actually calling the function. */
1968 t
= build_tree_list (error_mark_node
, fndecls
);
1969 TREE_TYPE (t
) = build_offset_type (basetype
,
1975 cp_error ("`%#T' has no member named `%D'", basetype
, name
);
1976 return error_mark_node
;
1978 else if (TREE_TYPE (field
) == error_mark_node
)
1979 return error_mark_node
;
1981 if (TREE_CODE (field
) != FIELD_DECL
)
1983 if (TREE_CODE (field
) == TYPE_DECL
)
1985 cp_error ("invalid use of type decl `%#D' as expression", field
);
1986 return error_mark_node
;
1988 else if (DECL_RTL (field
) != 0)
1991 TREE_USED (field
) = 1;
1996 /* See if we have to do any conversions so that we pick up the field from the
1998 if (DECL_FIELD_CONTEXT (field
) != basetype
)
2000 tree context
= DECL_FIELD_CONTEXT (field
);
2001 tree base
= context
;
2002 while (base
!= basetype
&& TYPE_NAME (base
)
2003 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (base
)))
2005 base
= TYPE_CONTEXT (base
);
2008 /* Handle base classes here... */
2009 if (base
!= basetype
&& TYPE_USES_COMPLEX_INHERITANCE (basetype
))
2011 tree addr
= build_unary_op (ADDR_EXPR
, datum
, 0);
2012 if (integer_zerop (addr
))
2014 error ("invalid reference to NULL ptr, use ptr-to-member instead");
2015 return error_mark_node
;
2017 if (VBASE_NAME_P (DECL_NAME (field
)))
2019 /* It doesn't matter which vbase pointer we grab, just
2020 find one of them. */
2021 tree binfo
= get_binfo (base
,
2022 TREE_TYPE (TREE_TYPE (addr
)), 0);
2023 addr
= convert_pointer_to_real (binfo
, addr
);
2026 addr
= convert_pointer_to (base
, addr
);
2027 datum
= build_indirect_ref (addr
, NULL_PTR
);
2028 my_friendly_assert (datum
!= error_mark_node
, 311);
2032 /* Handle things from anon unions here... */
2033 if (TYPE_NAME (context
) && ANON_AGGRNAME_P (TYPE_IDENTIFIER (context
)))
2035 tree subfield
= lookup_anon_field (basetype
, context
);
2036 tree subdatum
= build_component_ref (datum
, subfield
,
2037 basetype_path
, protect
);
2038 return build_component_ref (subdatum
, field
, basetype_path
, protect
);
2042 ref
= fold (build (COMPONENT_REF
, TREE_TYPE (field
),
2043 break_out_cleanups (datum
), field
));
2045 if (TREE_READONLY (datum
) || TREE_READONLY (field
))
2046 TREE_READONLY (ref
) = 1;
2047 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (field
))
2048 TREE_THIS_VOLATILE (ref
) = 1;
2049 if (DECL_MUTABLE_P (field
))
2050 TREE_READONLY (ref
) = 0;
2055 /* Variant of build_component_ref for use in expressions, which should
2056 never have REFERENCE_TYPE. */
2059 build_x_component_ref (datum
, component
, basetype_path
, protect
)
2060 tree datum
, component
, basetype_path
;
2063 tree t
= build_component_ref (datum
, component
, basetype_path
, protect
);
2065 if (! processing_template_decl
)
2066 t
= convert_from_reference (t
);
2071 /* Given an expression PTR for a pointer, return an expression
2072 for the value pointed to.
2073 ERRORSTRING is the name of the operator to appear in error messages.
2075 This function may need to overload OPERATOR_FNNAME.
2076 Must also handle REFERENCE_TYPEs for C++. */
2079 build_x_indirect_ref (ptr
, errorstring
)
2085 if (processing_template_decl
)
2086 return build_min_nt (INDIRECT_REF
, ptr
);
2088 rval
= build_opfncall (INDIRECT_REF
, LOOKUP_NORMAL
, ptr
, NULL_TREE
,
2092 return build_indirect_ref (ptr
, errorstring
);
2096 build_indirect_ref (ptr
, errorstring
)
2100 register tree pointer
, type
;
2102 if (ptr
== error_mark_node
)
2103 return error_mark_node
;
2105 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2106 ? ptr
: default_conversion (ptr
));
2107 type
= TREE_TYPE (pointer
);
2109 if (ptr
== current_class_ptr
)
2110 return current_class_ref
;
2112 if (TREE_CODE (type
) == POINTER_TYPE
|| TREE_CODE (type
) == REFERENCE_TYPE
)
2114 if (TREE_CODE (pointer
) == ADDR_EXPR
2116 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (pointer
, 0)))
2117 == TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
2118 && (TREE_READONLY (TREE_OPERAND (pointer
, 0))
2119 == TYPE_READONLY (TREE_TYPE (type
)))
2120 && (TREE_THIS_VOLATILE (TREE_OPERAND (pointer
, 0))
2121 == TYPE_VOLATILE (TREE_TYPE (type
))))
2122 return TREE_OPERAND (pointer
, 0);
2125 tree t
= TREE_TYPE (type
);
2126 register tree ref
= build1 (INDIRECT_REF
,
2127 TYPE_MAIN_VARIANT (t
), pointer
);
2129 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2130 so that we get the proper error message if the result is used
2131 to assign to. Also, &* is supposed to be a no-op. */
2132 TREE_READONLY (ref
) = TYPE_READONLY (t
);
2133 TREE_SIDE_EFFECTS (ref
)
2134 = (TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
)
2136 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
2140 /* `pointer' won't be an error_mark_node if we were given a
2141 pointer to member, so it's cool to check for this here. */
2142 else if (TYPE_PTRMEMFUNC_P (type
))
2143 error ("invalid use of `%s' on pointer to member function", errorstring
);
2144 else if (TREE_CODE (type
) == RECORD_TYPE
2145 && (IS_SIGNATURE_POINTER (type
) || IS_SIGNATURE_REFERENCE (type
)))
2146 error ("cannot dereference signature pointer/reference");
2147 else if (pointer
!= error_mark_node
)
2150 error ("invalid type argument of `%s'", errorstring
);
2152 error ("invalid type argument");
2154 return error_mark_node
;
2157 /* This handles expressions of the form "a[i]", which denotes
2160 This is logically equivalent in C to *(a+i), but we may do it differently.
2161 If A is a variable or a member, we generate a primitive ARRAY_REF.
2162 This avoids forcing the array out of registers, and can work on
2163 arrays that are not lvalues (for example, members of structures returned
2166 If INDEX is of some user-defined type, it must be converted to
2167 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2168 will inherit the type of the array, which will be some pointer type. */
2171 build_array_ref (array
, idx
)
2176 error ("subscript missing in array reference");
2177 return error_mark_node
;
2180 if (TREE_TYPE (array
) == error_mark_node
2181 || TREE_TYPE (idx
) == error_mark_node
)
2182 return error_mark_node
;
2184 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
2185 && TREE_CODE (array
) != INDIRECT_REF
)
2189 /* Subscripting with type char is likely to lose
2190 on a machine where chars are signed.
2191 So warn on any machine, but optionally.
2192 Don't warn for unsigned char since that type is safe.
2193 Don't warn for signed char because anyone who uses that
2194 must have done so deliberately. */
2195 if (warn_char_subscripts
2196 && TYPE_MAIN_VARIANT (TREE_TYPE (idx
)) == char_type_node
)
2197 warning ("array subscript has type `char'");
2199 /* Apply default promotions *after* noticing character types. */
2200 idx
= default_conversion (idx
);
2202 if (TREE_CODE (TREE_TYPE (idx
)) != INTEGER_TYPE
)
2204 error ("array subscript is not an integer");
2205 return error_mark_node
;
2208 /* An array that is indexed by a non-constant
2209 cannot be stored in a register; we must be able to do
2210 address arithmetic on its address.
2211 Likewise an array of elements of variable size. */
2212 if (TREE_CODE (idx
) != INTEGER_CST
2213 || (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))) != 0
2214 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2217 if (mark_addressable (array
) == 0)
2218 return error_mark_node
;
2220 /* An array that is indexed by a constant value which is not within
2221 the array bounds cannot be stored in a register either; because we
2222 would get a crash in store_bit_field/extract_bit_field when trying
2223 to access a non-existent part of the register. */
2224 if (TREE_CODE (idx
) == INTEGER_CST
2225 && TYPE_VALUES (TREE_TYPE (array
))
2226 && ! int_fits_type_p (idx
, TYPE_VALUES (TREE_TYPE (array
))))
2228 if (mark_addressable (array
) == 0)
2229 return error_mark_node
;
2232 if (pedantic
&& !lvalue_p (array
))
2233 pedwarn ("ANSI C++ forbids subscripting non-lvalue array");
2235 /* Note in C++ it is valid to subscript a `register' array, since
2236 it is valid to take the address of something with that
2237 storage specification. */
2241 while (TREE_CODE (foo
) == COMPONENT_REF
)
2242 foo
= TREE_OPERAND (foo
, 0);
2243 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2244 warning ("subscripting array declared `register'");
2247 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array
)));
2248 rval
= build (ARRAY_REF
, type
, array
, idx
);
2249 /* Array ref is const/volatile if the array elements are
2250 or if the array is.. */
2251 TREE_READONLY (rval
)
2252 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
2253 | TREE_READONLY (array
));
2254 TREE_SIDE_EFFECTS (rval
)
2255 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2256 | TREE_SIDE_EFFECTS (array
));
2257 TREE_THIS_VOLATILE (rval
)
2258 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2259 /* This was added by rms on 16 Nov 91.
2260 It fixes vol struct foo *a; a->elts[1]
2261 in an inline function.
2262 Hope it doesn't break something else. */
2263 | TREE_THIS_VOLATILE (array
));
2264 return require_complete_type (fold (rval
));
2268 tree ar
= default_conversion (array
);
2269 tree ind
= default_conversion (idx
);
2271 /* Put the integer in IND to simplify error checking. */
2272 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2279 if (ar
== error_mark_node
)
2282 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2284 error ("subscripted value is neither array nor pointer");
2285 return error_mark_node
;
2287 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2289 error ("array subscript is not an integer");
2290 return error_mark_node
;
2293 return build_indirect_ref (build_binary_op_nodefault (PLUS_EXPR
, ar
,
2299 /* Build a function call to function FUNCTION with parameters PARAMS.
2300 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2301 TREE_VALUE of each node is a parameter-expression. The PARAMS do
2302 not include any object pointer that may be required. FUNCTION's
2303 data type may be a function type or a pointer-to-function.
2305 For C++: If FUNCTION's data type is a TREE_LIST, then the tree list
2306 is the list of possible methods that FUNCTION could conceivably
2307 be. If the list of methods comes from a class, then it will be
2308 a list of lists (where each element is associated with the class
2309 that produced it), otherwise it will be a simple list (for
2310 functions overloaded in global scope).
2312 In the first case, TREE_VALUE (function) is the head of one of those
2313 lists, and TREE_PURPOSE is the name of the function.
2315 In the second case, TREE_PURPOSE (function) is the function's
2318 DECL is the class instance variable, usually CURRENT_CLASS_REF.
2320 When calling a TEMPLATE_DECL, we don't require a complete return
2324 build_x_function_call (function
, params
, decl
)
2325 tree function
, params
, decl
;
2328 tree template_id
= NULL_TREE
;
2331 if (function
== error_mark_node
)
2332 return error_mark_node
;
2334 if (processing_template_decl
)
2335 return build_min_nt (CALL_EXPR
, function
, params
, NULL_TREE
);
2337 /* Save explicit template arguments if found */
2338 if (TREE_CODE (function
) == TEMPLATE_ID_EXPR
)
2340 template_id
= function
;
2341 function
= TREE_OPERAND (function
, 0);
2344 type
= TREE_TYPE (function
);
2346 if (TREE_CODE (type
) == OFFSET_TYPE
2347 && TREE_TYPE (type
) == unknown_type_node
2348 && TREE_CODE (function
) == TREE_LIST
2349 && TREE_CHAIN (function
) == NULL_TREE
)
2351 /* Undo (Foo:bar)()... */
2352 type
= TYPE_OFFSET_BASETYPE (type
);
2353 function
= TREE_VALUE (function
);
2354 my_friendly_assert (TREE_CODE (function
) == TREE_LIST
, 999);
2355 my_friendly_assert (TREE_CHAIN (function
) == NULL_TREE
, 999);
2356 function
= TREE_VALUE (function
);
2357 my_friendly_assert (TREE_CODE (function
) == FUNCTION_DECL
, 999);
2358 function
= DECL_NAME (function
);
2359 return build_method_call (decl
, function
, params
,
2360 TYPE_BINFO (type
), LOOKUP_NORMAL
);
2363 is_method
= ((TREE_CODE (function
) == TREE_LIST
2364 && current_class_type
!= NULL_TREE
2365 && (IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (function
))
2367 || TREE_CODE (function
) == IDENTIFIER_NODE
2368 || TREE_CODE (type
) == METHOD_TYPE
2369 || TYPE_PTRMEMFUNC_P (type
));
2371 if ((TREE_CODE (function
) == FUNCTION_DECL
2372 && DECL_STATIC_FUNCTION_P (function
))
2373 || (TREE_CODE (function
) == TEMPLATE_DECL
2374 && DECL_STATIC_FUNCTION_P (DECL_RESULT (function
))))
2375 return build_member_call
2376 (DECL_CONTEXT (function
), DECL_NAME (function
), params
);
2378 /* A friend template. Make it look like a toplevel declaration. */
2379 if (! is_method
&& TREE_CODE (function
) == TEMPLATE_DECL
)
2380 function
= build_scratch_list (NULL_TREE
, function
);
2382 /* Handle methods, friends, and overloaded functions, respectively. */
2385 tree basetype
= NULL_TREE
;
2387 if (TREE_CODE (function
) == FUNCTION_DECL
2388 || DECL_FUNCTION_TEMPLATE_P (function
))
2390 basetype
= DECL_CLASS_CONTEXT (function
);
2392 if (DECL_NAME (function
))
2393 function
= DECL_NAME (function
);
2395 function
= TYPE_IDENTIFIER (DECL_CLASS_CONTEXT (function
));
2397 else if (TREE_CODE (function
) == TREE_LIST
)
2399 my_friendly_assert (TREE_CODE (TREE_VALUE (function
))
2400 == FUNCTION_DECL
, 312);
2401 basetype
= DECL_CLASS_CONTEXT (TREE_VALUE (function
));
2402 function
= TREE_PURPOSE (function
);
2404 else if (TREE_CODE (function
) != IDENTIFIER_NODE
)
2406 if (TREE_CODE (function
) == OFFSET_REF
)
2408 if (TREE_OPERAND (function
, 0))
2409 decl
= TREE_OPERAND (function
, 0);
2411 /* Call via a pointer to member function. */
2412 if (decl
== NULL_TREE
)
2414 error ("pointer to member function called, but not in class scope");
2415 return error_mark_node
;
2417 /* What other type of POINTER_TYPE could this be? */
2418 if (TREE_CODE (TREE_TYPE (function
)) != POINTER_TYPE
2419 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (function
))
2420 && TREE_CODE (function
) != OFFSET_REF
)
2421 function
= build (OFFSET_REF
, TREE_TYPE (type
), NULL_TREE
,
2426 /* this is an abbreviated method call.
2427 must go through here in case it is a virtual function.
2428 @@ Perhaps this could be optimized. */
2430 if (basetype
&& (! current_class_type
2431 || ! DERIVED_FROM_P (basetype
, current_class_type
)))
2432 return build_member_call (basetype
, function
, params
);
2434 if (decl
== NULL_TREE
)
2436 if (current_class_type
== NULL_TREE
)
2438 error ("object missing in call to method `%s'",
2439 IDENTIFIER_POINTER (function
));
2440 return error_mark_node
;
2442 /* Yow: call from a static member function. */
2443 decl
= build1 (NOP_EXPR
, build_pointer_type (current_class_type
),
2445 decl
= build_indirect_ref (decl
, NULL_PTR
);
2448 /* Put back explicit template arguments, if any. */
2450 function
= template_id
;
2451 return build_method_call (decl
, function
, params
,
2452 NULL_TREE
, LOOKUP_NORMAL
);
2454 else if (TREE_CODE (function
) == COMPONENT_REF
2455 && type
== unknown_type_node
)
2457 /* Should we undo what was done in build_component_ref? */
2458 if (TREE_CODE (TREE_PURPOSE (TREE_OPERAND (function
, 1))) == TREE_VEC
)
2459 /* Get the name that build_component_ref hid. */
2460 function
= DECL_NAME (TREE_VALUE (TREE_OPERAND (function
, 1)));
2462 function
= TREE_PURPOSE (TREE_OPERAND (function
, 1));
2463 return build_method_call (decl
, function
, params
,
2464 NULL_TREE
, LOOKUP_NORMAL
);
2466 else if (really_overloaded_fn (function
))
2468 if (TREE_VALUE (function
) == NULL_TREE
)
2470 cp_error ("function `%D' declared overloaded, but no definitions appear with which to resolve it?!?",
2471 TREE_PURPOSE (function
));
2472 return error_mark_node
;
2476 /* Put back explicit template arguments, if any. */
2478 function
= template_id
;
2479 return build_new_function_call (function
, params
);
2484 if (TREE_CODE (function
) == OFFSET_REF
)
2486 /* If the component is a data element (or a virtual function), we play
2487 games here to make things work. */
2490 if (TREE_OPERAND (function
, 0))
2491 decl
= TREE_OPERAND (function
, 0);
2493 decl
= current_class_ref
;
2495 decl_addr
= build_unary_op (ADDR_EXPR
, decl
, 0);
2496 function
= get_member_function_from_ptrfunc (&decl_addr
,
2497 TREE_OPERAND (function
, 1));
2498 params
= expr_tree_cons (NULL_TREE
, decl_addr
, params
);
2499 return build_function_call (function
, params
);
2502 type
= TREE_TYPE (function
);
2503 if (type
!= error_mark_node
)
2505 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2506 type
= TREE_TYPE (type
);
2508 if (IS_AGGR_TYPE (type
))
2509 return build_opfncall (CALL_EXPR
, LOOKUP_NORMAL
, function
, params
, NULL_TREE
);
2514 tree fntype
= TREE_TYPE (function
);
2515 tree ctypeptr
= NULL_TREE
;
2517 /* Explicitly named method? */
2518 if (TREE_CODE (function
) == FUNCTION_DECL
)
2519 ctypeptr
= build_pointer_type (DECL_CLASS_CONTEXT (function
));
2520 /* Expression with ptr-to-method type? It could either be a plain
2521 usage, or it might be a case where the ptr-to-method is being
2522 passed in as an argument. */
2523 else if (TYPE_PTRMEMFUNC_P (fntype
))
2525 tree rec
= TYPE_METHOD_BASETYPE (TREE_TYPE
2526 (TYPE_PTRMEMFUNC_FN_TYPE (fntype
)));
2527 ctypeptr
= build_pointer_type (rec
);
2529 /* Unexpected node type? */
2531 my_friendly_abort (116);
2532 if (decl
== NULL_TREE
)
2534 if (current_function_decl
2535 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2536 error ("invalid call to member function needing `this' in static member function scope");
2538 error ("pointer to member function called, but not in class scope");
2539 return error_mark_node
;
2541 if (TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
2542 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (decl
)))
2544 decl
= build_unary_op (ADDR_EXPR
, decl
, 0);
2545 decl
= convert_pointer_to (TREE_TYPE (ctypeptr
), decl
);
2548 decl
= build_c_cast (ctypeptr
, decl
);
2549 params
= expr_tree_cons (NULL_TREE
, decl
, params
);
2552 return build_function_call (function
, params
);
2555 /* Resolve a pointer to member function. INSTANCE is the object
2556 instance to use, if the member points to a virtual member. */
2559 get_member_function_from_ptrfunc (instance_ptrptr
, function
)
2560 tree
*instance_ptrptr
;
2563 if (TREE_CODE (function
) == OFFSET_REF
)
2565 function
= TREE_OPERAND (function
, 1);
2568 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2570 tree fntype
, idx
, e1
, delta
, delta2
, e2
, e3
, aref
, vtbl
;
2573 tree instance_ptr
= *instance_ptrptr
;
2575 if (TREE_SIDE_EFFECTS (instance_ptr
))
2576 instance_ptr
= save_expr (instance_ptr
);
2578 if (TREE_SIDE_EFFECTS (function
))
2579 function
= save_expr (function
);
2581 fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2583 /* Promoting idx before saving it improves performance on RISC
2584 targets. Without promoting, the first compare used
2585 load-with-sign-extend, while the second used normal load then
2586 shift to sign-extend. An optimizer flaw, perhaps, but it's easier
2587 to make this change. */
2588 idx
= save_expr (default_conversion
2589 (build_component_ref (function
,
2592 e1
= build_binary_op (GT_EXPR
, idx
, integer_zero_node
, 1);
2593 delta
= cp_convert (ptrdiff_type_node
,
2594 build_component_ref (function
, delta_identifier
,
2596 delta2
= DELTA2_FROM_PTRMEMFUNC (function
);
2598 /* Convert down to the right base, before using the instance. */
2600 = convert_pointer_to_real (TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
)),
2602 if (instance
== error_mark_node
&& instance_ptr
!= error_mark_node
)
2605 vtbl
= convert_pointer_to (ptr_type_node
, instance
);
2608 build_pointer_type (build_pointer_type (vtable_entry_type
)),
2609 vtbl
, cp_convert (ptrdiff_type_node
, delta2
));
2610 vtbl
= build_indirect_ref (vtbl
, NULL_PTR
);
2611 aref
= build_array_ref (vtbl
, build_binary_op (MINUS_EXPR
,
2613 integer_one_node
, 1));
2614 if (! flag_vtable_thunks
)
2616 aref
= save_expr (aref
);
2618 delta
= build_binary_op
2620 build_conditional_expr (e1
, build_component_ref (aref
,
2627 *instance_ptrptr
= build (PLUS_EXPR
, TREE_TYPE (instance_ptr
),
2628 instance_ptr
, delta
);
2629 if (flag_vtable_thunks
)
2632 e2
= build_component_ref (aref
, pfn_identifier
, NULL_TREE
, 0);
2634 e3
= PFN_FROM_PTRMEMFUNC (function
);
2635 TREE_TYPE (e2
) = TREE_TYPE (e3
);
2636 e1
= build_conditional_expr (e1
, e2
, e3
);
2638 if (instance_ptr
== error_mark_node
2639 && TREE_CODE (e1
) != ADDR_EXPR
2640 && TREE_CODE (TREE_OPERAND (e1
, 0)) != FUNCTION_DECL
)
2641 cp_error ("object missing in `%E'", function
);
2645 /* Make sure this doesn't get evaluated first inside one of the
2646 branches of the COND_EXPR. */
2647 if (TREE_CODE (instance_ptr
) == SAVE_EXPR
)
2648 function
= build (COMPOUND_EXPR
, TREE_TYPE (function
),
2649 instance_ptr
, function
);
2655 build_function_call_real (function
, params
, require_complete
, flags
)
2656 tree function
, params
;
2657 int require_complete
, flags
;
2659 register tree fntype
, fndecl
;
2660 register tree value_type
;
2661 register tree coerced_params
;
2662 tree name
= NULL_TREE
, assembler_name
= NULL_TREE
;
2665 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2666 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2667 if (TREE_CODE (function
) == NOP_EXPR
2668 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
2669 function
= TREE_OPERAND (function
, 0);
2671 if (TREE_CODE (function
) == FUNCTION_DECL
)
2673 name
= DECL_NAME (function
);
2674 assembler_name
= DECL_ASSEMBLER_NAME (function
);
2676 GNU_xref_call (current_function_decl
,
2677 IDENTIFIER_POINTER (name
? name
2678 : TYPE_IDENTIFIER (DECL_CLASS_CONTEXT
2680 mark_used (function
);
2683 /* Convert anything with function type to a pointer-to-function. */
2686 && IDENTIFIER_LENGTH (name
) == 4
2687 && ! strcmp (IDENTIFIER_POINTER (name
), "main")
2688 && DECL_CONTEXT (function
) == NULL_TREE
)
2690 pedwarn ("ANSI C++ forbids calling `main' from within program");
2693 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2694 (because calling an inline function does not mean the function
2695 needs to be separately compiled). */
2697 if (DECL_INLINE (function
))
2698 function
= inline_conversion (function
);
2700 function
= build_addr_func (function
);
2706 function
= build_addr_func (function
);
2709 if (function
== error_mark_node
)
2710 return error_mark_node
;
2712 fntype
= TREE_TYPE (function
);
2714 if (TYPE_PTRMEMFUNC_P (fntype
))
2716 cp_error ("must use .* or ->* to call pointer-to-member function in `%E (...)'",
2718 return error_mark_node
;
2721 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
2722 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
2724 if (!((TREE_CODE (fntype
) == POINTER_TYPE
2725 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
2727 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
2729 cp_error ("`%E' cannot be used as a function", function
);
2730 return error_mark_node
;
2733 /* fntype now gets the type of function pointed to. */
2734 fntype
= TREE_TYPE (fntype
);
2736 /* Convert the parameters to the types declared in the
2737 function prototype, or apply default promotions. */
2739 if (flags
& LOOKUP_COMPLAIN
)
2740 coerced_params
= convert_arguments (NULL_TREE
, TYPE_ARG_TYPES (fntype
),
2741 params
, fndecl
, LOOKUP_NORMAL
);
2743 coerced_params
= convert_arguments (NULL_TREE
, TYPE_ARG_TYPES (fntype
),
2746 if (coerced_params
== error_mark_node
)
2748 if (flags
& LOOKUP_SPECULATIVELY
)
2751 return error_mark_node
;
2754 /* Check for errors in format strings. */
2756 if (warn_format
&& (name
|| assembler_name
))
2757 check_function_format (name
, assembler_name
, coerced_params
);
2759 /* Recognize certain built-in functions so we can make tree-codes
2760 other than CALL_EXPR. We do this when it enables fold-const.c
2761 to do something useful. */
2763 if (TREE_CODE (function
) == ADDR_EXPR
2764 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
2765 && DECL_BUILT_IN (TREE_OPERAND (function
, 0)))
2766 switch (DECL_FUNCTION_CODE (TREE_OPERAND (function
, 0)))
2771 if (coerced_params
== 0)
2772 return integer_zero_node
;
2773 return build_unary_op (ABS_EXPR
, TREE_VALUE (coerced_params
), 0);
2780 value_type
= TREE_TYPE (fntype
) ? TREE_TYPE (fntype
) : void_type_node
;
2782 register tree result
2783 = build_call (function
, value_type
, coerced_params
);
2785 if (require_complete
)
2787 if (value_type
== void_type_node
)
2789 result
= require_complete_type (result
);
2791 if (IS_AGGR_TYPE (value_type
))
2792 result
= build_cplus_new (value_type
, result
);
2793 return convert_from_reference (result
);
2798 build_function_call (function
, params
)
2799 tree function
, params
;
2801 return build_function_call_real (function
, params
, 1, LOOKUP_NORMAL
);
2804 /* Convert the actual parameter expressions in the list VALUES
2805 to the types in the list TYPELIST.
2806 If parmdecls is exhausted, or when an element has NULL as its type,
2807 perform the default conversions.
2809 RETURN_LOC is the location of the return value, if known, NULL_TREE
2810 otherwise. This is useful in the case where we can avoid creating
2811 a temporary variable in the case where we can initialize the return
2812 value directly. If we are not eliding constructors, then we set this
2813 to NULL_TREE to avoid this avoidance.
2815 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2817 This is also where warnings about wrong number of args are generated.
2819 Return a list of expressions for the parameters as converted.
2821 Both VALUES and the returned value are chains of TREE_LIST nodes
2822 with the elements of the list in the TREE_VALUE slots of those nodes.
2824 In C++, unspecified trailing parameters can be filled in with their
2825 default arguments, if such were specified. Do so here. */
2828 convert_arguments (return_loc
, typelist
, values
, fndecl
, flags
)
2829 tree return_loc
, typelist
, values
, fndecl
;
2832 register tree typetail
, valtail
;
2833 register tree result
= NULL_TREE
;
2834 char *called_thing
= 0;
2837 if (! flag_elide_constructors
)
2840 /* Argument passing is always copy-initialization. */
2841 flags
|= LOOKUP_ONLYCONVERTING
;
2845 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
2847 if (DECL_NAME (fndecl
) == NULL_TREE
2848 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
2849 called_thing
= "constructor";
2851 called_thing
= "member function";
2854 called_thing
= "function";
2857 for (valtail
= values
, typetail
= typelist
;
2859 valtail
= TREE_CHAIN (valtail
), i
++)
2861 register tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2862 register tree val
= TREE_VALUE (valtail
);
2864 if (val
== error_mark_node
)
2865 return error_mark_node
;
2867 if (type
== void_type_node
)
2871 cp_error_at ("too many arguments to %s `%+D'", called_thing
,
2873 error ("at this point in file");
2876 error ("too many arguments to function");
2877 /* In case anybody wants to know if this argument
2880 TREE_TYPE (tree_last (result
)) = error_mark_node
;
2884 /* The tree type of the parameter being passed may not yet be
2885 known. In this case, its type is TYPE_UNKNOWN, and will
2886 be instantiated by the type given by TYPE. If TYPE
2887 is also NULL, the tree type of VAL is ERROR_MARK_NODE. */
2888 if (type
&& type_unknown_p (val
))
2889 val
= require_instantiated_type (type
, val
, integer_zero_node
);
2890 else if (type_unknown_p (val
))
2892 /* Strip the `&' from an overloaded FUNCTION_DECL. */
2893 if (TREE_CODE (val
) == ADDR_EXPR
)
2894 val
= TREE_OPERAND (val
, 0);
2895 if (really_overloaded_fn (val
))
2896 cp_error ("insufficient type information to resolve address of overloaded function `%D'",
2897 DECL_NAME (get_first_fn (val
)));
2899 error ("insufficient type information in parameter list");
2900 val
= integer_zero_node
;
2902 else if (TREE_CODE (val
) == OFFSET_REF
2903 && TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
2905 /* This is unclean. Should be handled elsewhere. */
2906 val
= build_unary_op (ADDR_EXPR
, val
, 0);
2908 else if (TREE_CODE (val
) == OFFSET_REF
)
2909 val
= resolve_offset_ref (val
);
2911 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2912 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
2913 if (TREE_CODE (val
) == NOP_EXPR
2914 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
2915 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
2916 val
= TREE_OPERAND (val
, 0);
2918 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
2920 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
2921 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
2922 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
2923 val
= default_conversion (val
);
2925 val
= require_complete_type (val
);
2928 if (val
== error_mark_node
)
2929 return error_mark_node
;
2933 /* Formal parm type is specified by a function prototype. */
2936 if (TYPE_SIZE (complete_type (type
)) == 0)
2938 error ("parameter type of called function is incomplete");
2943 parmval
= convert_for_initialization
2944 (return_loc
, type
, val
, flags
,
2945 "argument passing", fndecl
, i
);
2946 #ifdef PROMOTE_PROTOTYPES
2947 if ((TREE_CODE (type
) == INTEGER_TYPE
2948 || TREE_CODE (type
) == ENUMERAL_TYPE
)
2949 && (TYPE_PRECISION (type
)
2950 < TYPE_PRECISION (integer_type_node
)))
2951 parmval
= default_conversion (parmval
);
2955 if (parmval
== error_mark_node
)
2956 return error_mark_node
;
2958 result
= expr_tree_cons (NULL_TREE
, parmval
, result
);
2962 if (TREE_CODE (TREE_TYPE (val
)) == REFERENCE_TYPE
)
2963 val
= convert_from_reference (val
);
2965 if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
2966 && (TYPE_PRECISION (TREE_TYPE (val
))
2967 < TYPE_PRECISION (double_type_node
)))
2968 /* Convert `float' to `double'. */
2969 result
= expr_tree_cons (NULL_TREE
,
2970 cp_convert (double_type_node
, val
),
2972 else if (IS_AGGR_TYPE (TREE_TYPE (val
))
2973 && ! TYPE_HAS_TRIVIAL_INIT_REF (TREE_TYPE (val
)))
2975 cp_warning ("cannot pass objects of type `%T' through `...'",
2977 result
= expr_tree_cons (NULL_TREE
, val
, result
);
2980 /* Convert `short' and `char' to full-size `int'. */
2981 result
= expr_tree_cons (NULL_TREE
, default_conversion (val
),
2986 typetail
= TREE_CHAIN (typetail
);
2989 if (typetail
!= 0 && typetail
!= void_list_node
)
2991 /* See if there are default arguments that can be used */
2992 if (TREE_PURPOSE (typetail
))
2994 for (; typetail
!= void_list_node
; ++i
)
2996 tree type
= TREE_VALUE (typetail
);
2997 tree val
= break_out_target_exprs (TREE_PURPOSE (typetail
));
3000 if (val
== NULL_TREE
)
3001 parmval
= error_mark_node
;
3002 else if (TREE_CODE (val
) == CONSTRUCTOR
)
3004 parmval
= digest_init (type
, val
, (tree
*)0);
3005 parmval
= convert_for_initialization (return_loc
, type
,
3007 "default constructor",
3012 /* This could get clobbered by the following call. */
3013 if (TREE_HAS_CONSTRUCTOR (val
))
3014 val
= copy_node (val
);
3016 parmval
= convert_for_initialization (return_loc
, type
,
3020 #ifdef PROMOTE_PROTOTYPES
3021 if ((TREE_CODE (type
) == INTEGER_TYPE
3022 || TREE_CODE (type
) == ENUMERAL_TYPE
)
3023 && (TYPE_PRECISION (type
)
3024 < TYPE_PRECISION (integer_type_node
)))
3025 parmval
= default_conversion (parmval
);
3029 if (parmval
== error_mark_node
)
3030 return error_mark_node
;
3032 result
= expr_tree_cons (0, parmval
, result
);
3033 typetail
= TREE_CHAIN (typetail
);
3034 /* ends with `...'. */
3035 if (typetail
== NULL_TREE
)
3043 char *buf
= (char *)alloca (32 + strlen (called_thing
));
3044 sprintf (buf
, "too few arguments to %s `%%#D'", called_thing
);
3045 cp_error_at (buf
, fndecl
);
3046 error ("at this point in file");
3049 error ("too few arguments to function");
3050 return error_mark_list
;
3054 return nreverse (result
);
3057 /* Build a binary-operation expression, after performing default
3058 conversions on the operands. CODE is the kind of expression to build. */
3061 build_x_binary_op (code
, arg1
, arg2
)
3062 enum tree_code code
;
3067 if (processing_template_decl
)
3068 return build_min_nt (code
, arg1
, arg2
);
3070 return build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
);
3074 build_binary_op (code
, arg1
, arg2
, convert_p
)
3075 enum tree_code code
;
3087 args
[0] = decay_conversion (args
[0]);
3088 args
[1] = decay_conversion (args
[1]);
3090 if (args
[0] == error_mark_node
|| args
[1] == error_mark_node
)
3091 return error_mark_node
;
3093 type0
= TREE_TYPE (args
[0]);
3094 type1
= TREE_TYPE (args
[1]);
3096 if (type_unknown_p (args
[0]))
3098 args
[0] = instantiate_type (type1
, args
[0], 1);
3099 args
[0] = decay_conversion (args
[0]);
3101 else if (type_unknown_p (args
[1]))
3103 args
[1] = require_instantiated_type (type0
, args
[1],
3105 args
[1] = decay_conversion (args
[1]);
3108 if (IS_AGGR_TYPE (type0
) || IS_AGGR_TYPE (type1
))
3109 my_friendly_abort (754867);
3111 return build_binary_op_nodefault (code
, args
[0], args
[1], code
);
3114 /* Build a binary-operation expression without default conversions.
3115 CODE is the kind of expression to build.
3116 This function differs from `build' in several ways:
3117 the data type of the result is computed and recorded in it,
3118 warnings are generated if arg data types are invalid,
3119 special handling for addition and subtraction of pointers is known,
3120 and some optimization is done (operations on narrow ints
3121 are done in the narrower type when that gives the same result).
3122 Constant folding is also done before the result is returned.
3124 ERROR_CODE is the code that determines what to say in error messages.
3125 It is usually, but not always, the same as CODE.
3127 Note that the operands will never have enumeral types
3128 because either they have just had the default conversions performed
3129 or they have both just been converted to some other type in which
3130 the arithmetic is to be done.
3132 C++: must do special pointer arithmetic when implementing
3133 multiple inheritance, and deal with pointer to member functions. */
3136 build_binary_op_nodefault (code
, orig_op0
, orig_op1
, error_code
)
3137 enum tree_code code
;
3138 tree orig_op0
, orig_op1
;
3139 enum tree_code error_code
;
3142 register enum tree_code code0
, code1
;
3145 /* Expression code to give to the expression when it is built.
3146 Normally this is CODE, which is what the caller asked for,
3147 but in some special cases we change it. */
3148 register enum tree_code resultcode
= code
;
3150 /* Data type in which the computation is to be performed.
3151 In the simplest cases this is the common type of the arguments. */
3152 register tree result_type
= NULL
;
3154 /* Nonzero means operands have already been type-converted
3155 in whatever way is necessary.
3156 Zero means they need to be converted to RESULT_TYPE. */
3159 /* Nonzero means create the expression with this type, rather than
3161 tree build_type
= 0;
3163 /* Nonzero means after finally constructing the expression
3164 convert it to this type. */
3165 tree final_type
= 0;
3167 /* Nonzero if this is an operation like MIN or MAX which can
3168 safely be computed in short if both args are promoted shorts.
3169 Also implies COMMON.
3170 -1 indicates a bitwise operation; this makes a difference
3171 in the exact conditions for when it is safe to do the operation
3172 in a narrower mode. */
3175 /* Nonzero if this is a comparison operation;
3176 if both args are promoted shorts, compare the original shorts.
3177 Also implies COMMON. */
3178 int short_compare
= 0;
3180 /* Nonzero if this is a right-shift operation, which can be computed on the
3181 original short and then promoted if the operand is a promoted short. */
3182 int short_shift
= 0;
3184 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3187 /* Apply default conversions. */
3188 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3189 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3190 || code
== TRUTH_XOR_EXPR
)
3192 op0
= decay_conversion (orig_op0
);
3193 op1
= decay_conversion (orig_op1
);
3197 op0
= default_conversion (orig_op0
);
3198 op1
= default_conversion (orig_op1
);
3201 type0
= TREE_TYPE (op0
);
3202 type1
= TREE_TYPE (op1
);
3204 /* The expression codes of the data types of the arguments tell us
3205 whether the arguments are integers, floating, pointers, etc. */
3206 code0
= TREE_CODE (type0
);
3207 code1
= TREE_CODE (type1
);
3209 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3210 STRIP_TYPE_NOPS (op0
);
3211 STRIP_TYPE_NOPS (op1
);
3213 /* If an error was already reported for one of the arguments,
3214 avoid reporting another error. */
3216 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3217 return error_mark_node
;
3222 /* Handle the pointer + int case. */
3223 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3224 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
3225 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
3226 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
3232 /* Subtraction of two similar pointers.
3233 We must subtract them as integers, then divide by object size. */
3234 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3235 && comp_target_types (type0
, type1
, 1))
3236 return pointer_diff (op0
, op1
, common_type (type0
, type1
));
3237 /* Handle pointer minus int. Just like pointer plus int. */
3238 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3239 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
3248 case TRUNC_DIV_EXPR
:
3250 case FLOOR_DIV_EXPR
:
3251 case ROUND_DIV_EXPR
:
3252 case EXACT_DIV_EXPR
:
3253 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3254 || code0
== COMPLEX_TYPE
)
3255 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3256 || code1
== COMPLEX_TYPE
))
3258 if (TREE_CODE (op1
) == INTEGER_CST
&& integer_zerop (op1
))
3259 cp_warning ("division by zero in `%E / 0'", op0
);
3260 else if (TREE_CODE (op1
) == REAL_CST
&& real_zerop (op1
))
3261 cp_warning ("division by zero in `%E / 0.'", op0
);
3263 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
3264 resultcode
= RDIV_EXPR
;
3266 /* When dividing two signed integers, we have to promote to int.
3267 unless we divide by a constant != -1. Note that default
3268 conversion will have been performed on the operands at this
3269 point, so we have to dig out the original type to find out if
3271 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3272 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3273 || (TREE_CODE (op1
) == INTEGER_CST
3274 && (TREE_INT_CST_LOW (op1
) != -1
3275 || TREE_INT_CST_HIGH (op1
) != -1)));
3281 case BIT_ANDTC_EXPR
:
3284 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3286 /* If one operand is a constant, and the other is a short type
3287 that has been converted to an int,
3288 really do the work in the short type and then convert the
3289 result to int. If we are lucky, the constant will be 0 or 1
3290 in the short type, making the entire operation go away. */
3291 if (TREE_CODE (op0
) == INTEGER_CST
3292 && TREE_CODE (op1
) == NOP_EXPR
3293 && (TYPE_PRECISION (type1
)
3294 > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0))))
3295 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1
, 0))))
3297 final_type
= result_type
;
3298 op1
= TREE_OPERAND (op1
, 0);
3299 result_type
= TREE_TYPE (op1
);
3301 if (TREE_CODE (op1
) == INTEGER_CST
3302 && TREE_CODE (op0
) == NOP_EXPR
3303 && (TYPE_PRECISION (type0
)
3304 > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3305 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3307 final_type
= result_type
;
3308 op0
= TREE_OPERAND (op0
, 0);
3309 result_type
= TREE_TYPE (op0
);
3313 case TRUNC_MOD_EXPR
:
3314 case FLOOR_MOD_EXPR
:
3315 if (code1
== INTEGER_TYPE
&& integer_zerop (op1
))
3316 cp_warning ("division by zero in `%E % 0'", op0
);
3317 else if (code1
== REAL_TYPE
&& real_zerop (op1
))
3318 cp_warning ("division by zero in `%E % 0.'", op0
);
3320 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3322 /* Although it would be tempting to shorten always here, that loses
3323 on some targets, since the modulo instruction is undefined if the
3324 quotient can't be represented in the computation mode. We shorten
3325 only if unsigned or if dividing by something we know != -1. */
3326 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3327 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3328 || (TREE_CODE (op1
) == INTEGER_CST
3329 && (TREE_INT_CST_LOW (op1
) != -1
3330 || TREE_INT_CST_HIGH (op1
) != -1)));
3335 case TRUTH_ANDIF_EXPR
:
3336 case TRUTH_ORIF_EXPR
:
3337 case TRUTH_AND_EXPR
:
3339 result_type
= boolean_type_node
;
3342 /* Shift operations: result has same type as first operand;
3343 always convert second operand to int.
3344 Also set SHORT_SHIFT if shifting rightward. */
3347 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3349 result_type
= type0
;
3350 if (TREE_CODE (op1
) == INTEGER_CST
)
3352 if (tree_int_cst_lt (op1
, integer_zero_node
))
3353 warning ("right shift count is negative");
3356 if (TREE_INT_CST_LOW (op1
) | TREE_INT_CST_HIGH (op1
))
3358 if (TREE_INT_CST_HIGH (op1
) != 0
3359 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
3360 >= TYPE_PRECISION (type0
)))
3361 warning ("right shift count >= width of type");
3364 /* Convert the shift-count to an integer, regardless of
3365 size of value being shifted. */
3366 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3367 op1
= cp_convert (integer_type_node
, op1
);
3368 /* Avoid converting op1 to result_type later. */
3374 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3376 result_type
= type0
;
3377 if (TREE_CODE (op1
) == INTEGER_CST
)
3379 if (tree_int_cst_lt (op1
, integer_zero_node
))
3380 warning ("left shift count is negative");
3381 else if (TREE_INT_CST_HIGH (op1
) != 0
3382 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
3383 >= TYPE_PRECISION (type0
)))
3384 warning ("left shift count >= width of type");
3386 /* Convert the shift-count to an integer, regardless of
3387 size of value being shifted. */
3388 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3389 op1
= cp_convert (integer_type_node
, op1
);
3390 /* Avoid converting op1 to result_type later. */
3397 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3399 result_type
= type0
;
3400 if (TREE_CODE (op1
) == INTEGER_CST
)
3402 if (tree_int_cst_lt (op1
, integer_zero_node
))
3403 warning ("%s rotate count is negative",
3404 (code
== LROTATE_EXPR
) ? "left" : "right");
3405 else if (TREE_INT_CST_HIGH (op1
) != 0
3406 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
3407 >= TYPE_PRECISION (type0
)))
3408 warning ("%s rotate count >= width of type",
3409 (code
== LROTATE_EXPR
) ? "left" : "right");
3411 /* Convert the shift-count to an integer, regardless of
3412 size of value being shifted. */
3413 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3414 op1
= cp_convert (integer_type_node
, op1
);
3420 build_type
= boolean_type_node
;
3421 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3422 || code0
== COMPLEX_TYPE
)
3423 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3424 || code1
== COMPLEX_TYPE
))
3426 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3428 register tree tt0
= TYPE_MAIN_VARIANT (TREE_TYPE (type0
));
3429 register tree tt1
= TYPE_MAIN_VARIANT (TREE_TYPE (type1
));
3431 if (comp_target_types (type0
, type1
, 1))
3432 result_type
= common_type (type0
, type1
);
3433 else if (tt0
== void_type_node
)
3435 if (pedantic
&& TREE_CODE (tt1
) == FUNCTION_TYPE
3436 && tree_int_cst_lt (TYPE_SIZE (type0
), TYPE_SIZE (type1
)))
3437 pedwarn ("ANSI C++ forbids comparison of `void *' with function pointer");
3438 else if (TREE_CODE (tt1
) == OFFSET_TYPE
)
3439 pedwarn ("ANSI C++ forbids conversion of a pointer to member to `void *'");
3441 else if (tt1
== void_type_node
)
3443 if (pedantic
&& TREE_CODE (tt0
) == FUNCTION_TYPE
3444 && tree_int_cst_lt (TYPE_SIZE (type1
), TYPE_SIZE (type0
)))
3445 pedwarn ("ANSI C++ forbids comparison of `void *' with function pointer");
3448 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3451 if (result_type
== NULL_TREE
)
3452 result_type
= ptr_type_node
;
3454 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3455 && integer_zerop (op1
))
3456 result_type
= type0
;
3457 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3458 && integer_zerop (op0
))
3459 result_type
= type1
;
3460 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3462 result_type
= type0
;
3463 error ("ANSI C++ forbids comparison between pointer and integer");
3465 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3467 result_type
= type1
;
3468 error ("ANSI C++ forbids comparison between pointer and integer");
3470 else if (TYPE_PTRMEMFUNC_P (type0
) && TREE_CODE (op1
) == INTEGER_CST
3471 && integer_zerop (op1
))
3473 op0
= build_component_ref (op0
, index_identifier
, NULL_TREE
, 0);
3474 op1
= integer_zero_node
;
3475 result_type
= TREE_TYPE (op0
);
3477 else if (TYPE_PTRMEMFUNC_P (type1
) && TREE_CODE (op0
) == INTEGER_CST
3478 && integer_zerop (op0
))
3480 op0
= build_component_ref (op1
, index_identifier
, NULL_TREE
, 0);
3481 op1
= integer_zero_node
;
3482 result_type
= TREE_TYPE (op0
);
3484 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
)
3485 && (TYPE_PTRMEMFUNC_FN_TYPE (type0
)
3486 == TYPE_PTRMEMFUNC_FN_TYPE (type1
)))
3488 /* The code we generate for the test is:
3490 (op0.index == op1.index
3491 && ((op1.index != -1 && op0.delta2 == op1.delta2)
3492 || op0.pfn == op1.pfn)) */
3494 tree index0
= build_component_ref (op0
, index_identifier
,
3496 tree index1
= save_expr (build_component_ref (op1
, index_identifier
,
3498 tree pfn0
= PFN_FROM_PTRMEMFUNC (op0
);
3499 tree pfn1
= PFN_FROM_PTRMEMFUNC (op1
);
3500 tree delta20
= DELTA2_FROM_PTRMEMFUNC (op0
);
3501 tree delta21
= DELTA2_FROM_PTRMEMFUNC (op1
);
3503 tree integer_neg_one_node
3504 = build_binary_op (MINUS_EXPR
, integer_zero_node
,
3505 integer_one_node
, 1);
3506 e1
= build_binary_op (EQ_EXPR
, index0
, index1
, 1);
3507 e2
= build_binary_op (NE_EXPR
, index1
, integer_neg_one_node
, 1);
3508 e2
= build_binary_op (TRUTH_ANDIF_EXPR
, e2
,
3509 build_binary_op (EQ_EXPR
, delta20
, delta21
, 1),
3511 e3
= build_binary_op (EQ_EXPR
, pfn0
, pfn1
, 1);
3512 e2
= build_binary_op (TRUTH_ORIF_EXPR
, e2
, e3
, 1);
3513 e2
= build_binary_op (TRUTH_ANDIF_EXPR
, e1
, e2
, 1);
3514 if (code
== EQ_EXPR
)
3516 return build_binary_op (EQ_EXPR
, e2
, integer_zero_node
, 1);
3518 else if (TYPE_PTRMEMFUNC_P (type0
)
3519 && TYPE_PTRMEMFUNC_FN_TYPE (type0
) == type1
)
3521 tree index0
= build_component_ref (op0
, index_identifier
,
3524 tree pfn0
= PFN_FROM_PTRMEMFUNC (op0
);
3525 tree delta20
= DELTA2_FROM_PTRMEMFUNC (op0
);
3526 tree delta21
= integer_zero_node
;
3528 tree integer_neg_one_node
3529 = build_binary_op (MINUS_EXPR
, integer_zero_node
, integer_one_node
, 1);
3530 if (TREE_CODE (TREE_OPERAND (op1
, 0)) == FUNCTION_DECL
3531 && DECL_VINDEX (TREE_OPERAND (op1
, 0)))
3533 /* Map everything down one to make room for
3534 the null pointer to member. */
3535 index1
= size_binop (PLUS_EXPR
,
3536 DECL_VINDEX (TREE_OPERAND (op1
, 0)),
3538 op1
= integer_zero_node
;
3539 delta21
= CLASSTYPE_VFIELD (TYPE_METHOD_BASETYPE
3540 (TREE_TYPE (type1
)));
3541 delta21
= DECL_FIELD_BITPOS (delta21
);
3542 delta21
= size_binop (FLOOR_DIV_EXPR
, delta21
,
3543 size_int (BITS_PER_UNIT
));
3544 delta21
= convert (sizetype
, delta21
);
3547 index1
= integer_neg_one_node
;
3549 tree nop1
= build1 (NOP_EXPR
, TYPE_PTRMEMFUNC_FN_TYPE (type0
),
3551 TREE_CONSTANT (nop1
) = TREE_CONSTANT (op1
);
3554 e1
= build_binary_op (EQ_EXPR
, index0
, index1
, 1);
3555 e2
= build_binary_op (NE_EXPR
, index1
, integer_neg_one_node
, 1);
3556 e2
= build_binary_op (TRUTH_ANDIF_EXPR
, e2
,
3557 build_binary_op (EQ_EXPR
, delta20
, delta21
, 1),
3559 e3
= build_binary_op (EQ_EXPR
, pfn0
, op1
, 1);
3560 e2
= build_binary_op (TRUTH_ORIF_EXPR
, e2
, e3
, 1);
3561 e2
= build_binary_op (TRUTH_ANDIF_EXPR
, e1
, e2
, 1);
3562 if (code
== EQ_EXPR
)
3564 return build_binary_op (EQ_EXPR
, e2
, integer_zero_node
, 1);
3566 else if (TYPE_PTRMEMFUNC_P (type1
)
3567 && TYPE_PTRMEMFUNC_FN_TYPE (type1
) == type0
)
3569 return build_binary_op (code
, op1
, op0
, 1);
3575 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3576 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3578 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3580 if (comp_target_types (type0
, type1
, 1))
3581 result_type
= common_type (type0
, type1
);
3584 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3586 result_type
= ptr_type_node
;
3595 build_type
= boolean_type_node
;
3596 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3597 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3599 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3601 if (comp_target_types (type0
, type1
, 1))
3602 result_type
= common_type (type0
, type1
);
3605 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3607 result_type
= ptr_type_node
;
3610 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3611 && integer_zerop (op1
))
3612 result_type
= type0
;
3613 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3614 && integer_zerop (op0
))
3615 result_type
= type1
;
3616 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3618 result_type
= type0
;
3619 pedwarn ("ANSI C++ forbids comparison between pointer and integer");
3621 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3623 result_type
= type1
;
3624 pedwarn ("ANSI C++ forbids comparison between pointer and integer");
3632 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
3634 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
3636 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
3638 if (shorten
|| common
|| short_compare
)
3639 result_type
= common_type (type0
, type1
);
3641 /* For certain operations (which identify themselves by shorten != 0)
3642 if both args were extended from the same smaller type,
3643 do the arithmetic in that type and then extend.
3645 shorten !=0 and !=1 indicates a bitwise operation.
3646 For them, this optimization is safe only if
3647 both args are zero-extended or both are sign-extended.
3648 Otherwise, we might change the result.
3649 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3650 but calculated in (unsigned short) it would be (unsigned short)-1. */
3652 if (shorten
&& none_complex
)
3654 int unsigned0
, unsigned1
;
3655 tree arg0
= get_narrower (op0
, &unsigned0
);
3656 tree arg1
= get_narrower (op1
, &unsigned1
);
3657 /* UNS is 1 if the operation to be done is an unsigned one. */
3658 int uns
= TREE_UNSIGNED (result_type
);
3661 final_type
= result_type
;
3663 /* Handle the case that OP0 does not *contain* a conversion
3664 but it *requires* conversion to FINAL_TYPE. */
3666 if (op0
== arg0
&& TREE_TYPE (op0
) != final_type
)
3667 unsigned0
= TREE_UNSIGNED (TREE_TYPE (op0
));
3668 if (op1
== arg1
&& TREE_TYPE (op1
) != final_type
)
3669 unsigned1
= TREE_UNSIGNED (TREE_TYPE (op1
));
3671 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3673 /* For bitwise operations, signedness of nominal type
3674 does not matter. Consider only how operands were extended. */
3678 /* Note that in all three cases below we refrain from optimizing
3679 an unsigned operation on sign-extended args.
3680 That would not be valid. */
3682 /* Both args variable: if both extended in same way
3683 from same width, do it in that width.
3684 Do it unsigned if args were zero-extended. */
3685 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
3686 < TYPE_PRECISION (result_type
))
3687 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3688 == TYPE_PRECISION (TREE_TYPE (arg0
)))
3689 && unsigned0
== unsigned1
3690 && (unsigned0
|| !uns
))
3692 = signed_or_unsigned_type (unsigned0
,
3693 common_type (TREE_TYPE (arg0
),
3695 else if (TREE_CODE (arg0
) == INTEGER_CST
3696 && (unsigned1
|| !uns
)
3697 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3698 < TYPE_PRECISION (result_type
))
3699 && (type
= signed_or_unsigned_type (unsigned1
,
3701 int_fits_type_p (arg0
, type
)))
3703 else if (TREE_CODE (arg1
) == INTEGER_CST
3704 && (unsigned0
|| !uns
)
3705 && (TYPE_PRECISION (TREE_TYPE (arg0
))
3706 < TYPE_PRECISION (result_type
))
3707 && (type
= signed_or_unsigned_type (unsigned0
,
3709 int_fits_type_p (arg1
, type
)))
3713 /* Shifts can be shortened if shifting right. */
3718 tree arg0
= get_narrower (op0
, &unsigned_arg
);
3720 final_type
= result_type
;
3722 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
3723 unsigned_arg
= TREE_UNSIGNED (TREE_TYPE (op0
));
3725 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
3726 /* We can shorten only if the shift count is less than the
3727 number of bits in the smaller type size. */
3728 && TREE_INT_CST_HIGH (op1
) == 0
3729 && TYPE_PRECISION (TREE_TYPE (arg0
)) > TREE_INT_CST_LOW (op1
)
3730 /* If arg is sign-extended and then unsigned-shifted,
3731 we can simulate this with a signed shift in arg's type
3732 only if the extended result is at least twice as wide
3733 as the arg. Otherwise, the shift could use up all the
3734 ones made by sign-extension and bring in zeros.
3735 We can't optimize that case at all, but in most machines
3736 it never happens because available widths are 2**N. */
3737 && (!TREE_UNSIGNED (final_type
)
3739 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0
)))
3740 <= TYPE_PRECISION (result_type
))))
3742 /* Do an unsigned shift if the operand was zero-extended. */
3744 = signed_or_unsigned_type (unsigned_arg
,
3746 /* Convert value-to-be-shifted to that type. */
3747 if (TREE_TYPE (op0
) != result_type
)
3748 op0
= cp_convert (result_type
, op0
);
3753 /* Comparison operations are shortened too but differently.
3754 They identify themselves by setting short_compare = 1. */
3758 /* Don't write &op0, etc., because that would prevent op0
3759 from being kept in a register.
3760 Instead, make copies of the our local variables and
3761 pass the copies by reference, then copy them back afterward. */
3762 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
3763 enum tree_code xresultcode
= resultcode
;
3765 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
3767 return cp_convert (boolean_type_node
, val
);
3768 op0
= xop0
, op1
= xop1
;
3770 resultcode
= xresultcode
;
3773 if (short_compare
&& warn_sign_compare
)
3775 int op0_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op0
));
3776 int op1_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op1
));
3778 int unsignedp0
, unsignedp1
;
3779 tree primop0
= get_narrower (op0
, &unsignedp0
);
3780 tree primop1
= get_narrower (op1
, &unsignedp1
);
3782 /* Check for comparison of different enum types. */
3783 if (flag_int_enum_equivalence
== 0
3784 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
3785 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
3786 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
3787 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
3789 cp_warning ("comparison between `%#T' and `%#T'",
3790 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
3793 /* Give warnings for comparisons between signed and unsigned
3794 quantities that may fail. */
3795 /* Do the checking based on the original operand trees, so that
3796 casts will be considered, but default promotions won't be. */
3798 /* Do not warn if the comparison is being done in a signed type,
3799 since the signed type will only be chosen if it can represent
3800 all the values of the unsigned type. */
3801 if (! TREE_UNSIGNED (result_type
))
3803 /* Do not warn if both operands are unsigned. */
3804 else if (op0_signed
== op1_signed
)
3806 /* Do not warn if the signed quantity is an unsuffixed
3807 integer literal (or some static constant expression
3808 involving such literals) and it is non-negative. */
3809 else if ((op0_signed
&& TREE_CODE (orig_op0
) == INTEGER_CST
3810 && tree_int_cst_sgn (orig_op0
) >= 0)
3811 || (op1_signed
&& TREE_CODE (orig_op1
) == INTEGER_CST
3812 && tree_int_cst_sgn (orig_op1
) >= 0))
3814 /* Do not warn if the comparison is an equality operation,
3815 the unsigned quantity is an integral constant and it does
3816 not use the most significant bit of result_type. */
3817 else if ((resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
3818 && ((op0_signed
&& TREE_CODE (orig_op1
) == INTEGER_CST
3819 && int_fits_type_p (orig_op1
,
3820 signed_type (result_type
)))
3821 || (op1_signed
&& TREE_CODE (orig_op0
) == INTEGER_CST
3822 && int_fits_type_p (orig_op0
,
3823 signed_type (result_type
)))))
3826 warning ("comparison between signed and unsigned");
3828 /* Warn if two unsigned values are being compared in a size
3829 larger than their original size, and one (and only one) is the
3830 result of a `~' operator. This comparison will always fail.
3832 Also warn if one operand is a constant, and the constant does not
3833 have all bits set that are set in the ~ operand when it is
3836 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3837 ^ (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
3839 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3840 primop0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
3841 if (TREE_CODE (primop1
) == BIT_NOT_EXPR
)
3842 primop1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
3844 if (TREE_CODE (primop0
) == INTEGER_CST
3845 || TREE_CODE (primop1
) == INTEGER_CST
)
3848 HOST_WIDE_INT constant
, mask
;
3852 if (TREE_CODE (primop0
) == INTEGER_CST
)
3855 unsignedp
= unsignedp1
;
3856 constant
= TREE_INT_CST_LOW (primop0
);
3861 unsignedp
= unsignedp0
;
3862 constant
= TREE_INT_CST_LOW (primop1
);
3865 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
3866 if (bits
< TYPE_PRECISION (result_type
)
3867 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
3869 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
3870 if ((mask
& constant
) != mask
)
3871 warning ("comparison of promoted ~unsigned with constant");
3874 else if (unsignedp0
&& unsignedp1
3875 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3876 < TYPE_PRECISION (result_type
))
3877 && (TYPE_PRECISION (TREE_TYPE (primop1
))
3878 < TYPE_PRECISION (result_type
)))
3879 warning ("comparison of promoted ~unsigned with unsigned");
3884 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
3885 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3886 Then the expression will be built.
3887 It will be given type FINAL_TYPE if that is nonzero;
3888 otherwise, it will be given type RESULT_TYPE. */
3892 cp_error ("invalid operands `%T' and `%T' to binary `%O'",
3893 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), error_code
);
3894 return error_mark_node
;
3899 if (TREE_TYPE (op0
) != result_type
)
3900 op0
= cp_convert (result_type
, op0
);
3901 if (TREE_TYPE (op1
) != result_type
)
3902 op1
= cp_convert (result_type
, op1
);
3905 if (build_type
== NULL_TREE
)
3906 build_type
= result_type
;
3909 register tree result
= build (resultcode
, build_type
, op0
, op1
);
3910 register tree folded
;
3912 folded
= fold (result
);
3913 if (folded
== result
)
3914 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
3915 if (final_type
!= 0)
3916 return cp_convert (final_type
, folded
);
3921 /* Return a tree for the sum or difference (RESULTCODE says which)
3922 of pointer PTROP and integer INTOP. */
3925 pointer_int_sum (resultcode
, ptrop
, intop
)
3926 enum tree_code resultcode
;
3927 register tree ptrop
, intop
;
3931 register tree result
;
3932 register tree folded
= fold (intop
);
3934 /* The result is a pointer of the same type that is being added. */
3936 register tree result_type
= TREE_TYPE (ptrop
);
3938 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3940 if (pedantic
|| warn_pointer_arith
)
3941 pedwarn ("ANSI C++ forbids using pointer of type `void *' in arithmetic");
3942 size_exp
= integer_one_node
;
3944 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3946 if (pedantic
|| warn_pointer_arith
)
3947 pedwarn ("ANSI C++ forbids using pointer to a function in arithmetic");
3948 size_exp
= integer_one_node
;
3950 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
3952 if (pedantic
|| warn_pointer_arith
)
3953 pedwarn ("ANSI C++ forbids using pointer to a method in arithmetic");
3954 size_exp
= integer_one_node
;
3956 else if (TREE_CODE (TREE_TYPE (result_type
)) == OFFSET_TYPE
)
3958 if (pedantic
|| warn_pointer_arith
)
3959 pedwarn ("ANSI C++ forbids using pointer to a member in arithmetic");
3960 size_exp
= integer_one_node
;
3963 size_exp
= size_in_bytes (complete_type (TREE_TYPE (result_type
)));
3965 /* Needed to make OOPS V2R3 work. */
3967 if (TREE_CODE (intop
) == INTEGER_CST
3968 && TREE_INT_CST_LOW (intop
) == 0
3969 && TREE_INT_CST_HIGH (intop
) == 0)
3972 /* If what we are about to multiply by the size of the elements
3973 contains a constant term, apply distributive law
3974 and multiply that constant term separately.
3975 This helps produce common subexpressions. */
3977 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3978 && ! TREE_CONSTANT (intop
)
3979 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3980 && TREE_CONSTANT (size_exp
))
3982 enum tree_code subcode
= resultcode
;
3983 if (TREE_CODE (intop
) == MINUS_EXPR
)
3984 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3985 ptrop
= build_binary_op (subcode
, ptrop
, TREE_OPERAND (intop
, 1), 1);
3986 intop
= TREE_OPERAND (intop
, 0);
3989 /* Convert the integer argument to a type the same size as sizetype
3990 so the multiply won't overflow spuriously. */
3992 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
))
3993 intop
= cp_convert (type_for_size (TYPE_PRECISION (sizetype
), 0), intop
);
3995 /* Replace the integer argument with a suitable product by the object size.
3996 Do this multiplication as signed, then convert to the appropriate
3997 pointer type (actually unsigned integral). */
3999 intop
= cp_convert (result_type
,
4000 build_binary_op (MULT_EXPR
, intop
,
4001 cp_convert (TREE_TYPE (intop
),
4005 /* Create the sum or difference. */
4007 result
= build (resultcode
, result_type
, ptrop
, intop
);
4009 folded
= fold (result
);
4010 if (folded
== result
)
4011 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
4015 /* Return a tree for the difference of pointers OP0 and OP1.
4016 The resulting tree has type int. */
4019 pointer_diff (op0
, op1
, ptrtype
)
4020 register tree op0
, op1
;
4021 register tree ptrtype
;
4023 register tree result
, folded
;
4024 tree restype
= ptrdiff_type_node
;
4025 tree target_type
= TREE_TYPE (ptrtype
);
4027 if (pedantic
|| warn_pointer_arith
)
4029 if (TREE_CODE (target_type
) == VOID_TYPE
)
4030 pedwarn ("ANSI C++ forbids using pointer of type `void *' in subtraction");
4031 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4032 pedwarn ("ANSI C++ forbids using pointer to a function in subtraction");
4033 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4034 pedwarn ("ANSI C++ forbids using pointer to a method in subtraction");
4035 if (TREE_CODE (target_type
) == OFFSET_TYPE
)
4036 pedwarn ("ANSI C++ forbids using pointer to a member in subtraction");
4039 /* First do the subtraction as integers;
4040 then drop through to build the divide operator. */
4042 op0
= build_binary_op (MINUS_EXPR
, cp_convert (restype
, op0
),
4043 cp_convert (restype
, op1
), 1);
4045 /* This generates an error if op1 is a pointer to an incomplete type. */
4046 if (TYPE_SIZE (TREE_TYPE (TREE_TYPE (op1
))) == 0)
4047 error ("arithmetic on pointer to an incomplete type");
4049 op1
= ((TREE_CODE (target_type
) == VOID_TYPE
4050 || TREE_CODE (target_type
) == FUNCTION_TYPE
4051 || TREE_CODE (target_type
) == METHOD_TYPE
4052 || TREE_CODE (target_type
) == OFFSET_TYPE
)
4054 : size_in_bytes (target_type
));
4056 /* Do the division. */
4058 result
= build (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4060 folded
= fold (result
);
4061 if (folded
== result
)
4062 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
4066 /* Handle the case of taking the address of a COMPONENT_REF.
4067 Called by `build_unary_op' and `build_up_reference'.
4069 ARG is the COMPONENT_REF whose address we want.
4070 ARGTYPE is the pointer type that this address should have.
4071 MSG is an error message to print if this COMPONENT_REF is not
4072 addressable (such as a bitfield). */
4075 build_component_addr (arg
, argtype
, msg
)
4079 tree field
= TREE_OPERAND (arg
, 1);
4080 tree basetype
= decl_type_context (field
);
4081 tree rval
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), 0);
4083 if (DECL_BIT_FIELD (field
))
4085 error (msg
, IDENTIFIER_POINTER (DECL_NAME (field
)));
4086 return error_mark_node
;
4089 if (TREE_CODE (field
) == FIELD_DECL
4090 && TYPE_USES_COMPLEX_INHERITANCE (basetype
))
4092 /* Can't convert directly to ARGTYPE, since that
4093 may have the same pointer type as one of our
4095 rval
= build1 (NOP_EXPR
, argtype
,
4096 convert_pointer_to (basetype
, rval
));
4097 TREE_CONSTANT (rval
) = TREE_CONSTANT (TREE_OPERAND (rval
, 0));
4100 /* This conversion is harmless. */
4101 rval
= convert_force (argtype
, rval
, 0);
4103 if (! integer_zerop (DECL_FIELD_BITPOS (field
)))
4105 tree offset
= size_binop (EASY_DIV_EXPR
, DECL_FIELD_BITPOS (field
),
4106 size_int (BITS_PER_UNIT
));
4107 int flag
= TREE_CONSTANT (rval
);
4108 offset
= convert (sizetype
, offset
);
4109 rval
= fold (build (PLUS_EXPR
, argtype
,
4110 rval
, cp_convert (argtype
, offset
)));
4111 TREE_CONSTANT (rval
) = flag
;
4116 /* Construct and perhaps optimize a tree representation
4117 for a unary operation. CODE, a tree_code, specifies the operation
4118 and XARG is the operand. */
4121 build_x_unary_op (code
, xarg
)
4122 enum tree_code code
;
4125 if (processing_template_decl
)
4126 return build_min_nt (code
, xarg
, NULL_TREE
);
4128 /* & rec, on incomplete RECORD_TYPEs is the simple opr &, not an
4130 if (code
== ADDR_EXPR
4131 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4132 && ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (xarg
)))
4133 && TYPE_SIZE (TREE_TYPE (xarg
)) == NULL_TREE
)
4134 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4135 /* don't look for a function */;
4140 rval
= build_new_op (code
, LOOKUP_NORMAL
, xarg
,
4141 NULL_TREE
, NULL_TREE
);
4142 if (rval
|| code
!= ADDR_EXPR
)
4146 if (code
== ADDR_EXPR
)
4148 if (TREE_CODE (xarg
) == TARGET_EXPR
)
4149 warning ("taking address of temporary");
4152 return build_unary_op (code
, xarg
, 0);
4155 /* Just like truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4158 condition_conversion (expr
)
4162 if (processing_template_decl
)
4164 t
= cp_convert (boolean_type_node
, expr
);
4165 t
= fold (build1 (CLEANUP_POINT_EXPR
, boolean_type_node
, t
));
4169 /* C++: Must handle pointers to members.
4171 Perhaps type instantiation should be extended to handle conversion
4172 from aggregates to types we don't yet know we want? (Or are those
4173 cases typically errors which should be reported?)
4175 NOCONVERT nonzero suppresses the default promotions
4176 (such as from short to int). */
4179 build_unary_op (code
, xarg
, noconvert
)
4180 enum tree_code code
;
4184 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4185 register tree arg
= xarg
;
4186 register tree argtype
= 0;
4187 char *errstring
= NULL
;
4190 if (arg
== error_mark_node
)
4191 return error_mark_node
;
4196 /* This is used for unary plus, because a CONVERT_EXPR
4197 is enough to prevent anybody from looking inside for
4198 associativity, but won't generate any code. */
4199 if (!(arg
= build_expr_type_conversion
4200 (WANT_ARITH
| WANT_ENUM
| WANT_POINTER
, arg
, 1)))
4201 errstring
= "wrong type argument to unary plus";
4205 arg
= default_conversion (arg
);
4206 arg
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (arg
), arg
);
4211 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, 1)))
4212 errstring
= "wrong type argument to unary minus";
4213 else if (!noconvert
)
4214 arg
= default_conversion (arg
);
4218 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4222 arg
= default_conversion (arg
);
4224 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
4226 errstring
= "wrong type argument to bit-complement";
4227 else if (!noconvert
)
4228 arg
= default_conversion (arg
);
4232 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, 1)))
4233 errstring
= "wrong type argument to abs";
4234 else if (!noconvert
)
4235 arg
= default_conversion (arg
);
4239 /* Conjugating a real value is a no-op, but allow it anyway. */
4240 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, 1)))
4241 errstring
= "wrong type argument to conjugation";
4242 else if (!noconvert
)
4243 arg
= default_conversion (arg
);
4246 case TRUTH_NOT_EXPR
:
4247 arg
= cp_convert (boolean_type_node
, arg
);
4248 val
= invert_truthvalue (arg
);
4249 if (arg
!= error_mark_node
)
4251 errstring
= "in argument to unary !";
4258 if (TREE_CODE (arg
) == COMPLEX_CST
)
4259 return TREE_REALPART (arg
);
4260 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4261 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
4266 if (TREE_CODE (arg
) == COMPLEX_CST
)
4267 return TREE_IMAGPART (arg
);
4268 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4269 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
4271 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4273 case PREINCREMENT_EXPR
:
4274 case POSTINCREMENT_EXPR
:
4275 case PREDECREMENT_EXPR
:
4276 case POSTDECREMENT_EXPR
:
4277 /* Handle complex lvalues (when permitted)
4278 by reduction to simpler cases. */
4280 val
= unary_complex_lvalue (code
, arg
);
4284 /* Increment or decrement the real part of the value,
4285 and don't change the imaginary part. */
4286 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4290 arg
= stabilize_reference (arg
);
4291 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
4292 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
4293 return build (COMPLEX_EXPR
, TREE_TYPE (arg
),
4294 build_unary_op (code
, real
, 1), imag
);
4297 /* Report invalid types. */
4299 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4302 if (code
== PREINCREMENT_EXPR
)
4303 errstring
="no pre-increment operator for type";
4304 else if (code
== POSTINCREMENT_EXPR
)
4305 errstring
="no post-increment operator for type";
4306 else if (code
== PREDECREMENT_EXPR
)
4307 errstring
="no pre-decrement operator for type";
4309 errstring
="no post-decrement operator for type";
4313 /* Report something read-only. */
4315 if (TYPE_READONLY (TREE_TYPE (arg
))
4316 || TREE_READONLY (arg
))
4317 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4318 || code
== POSTINCREMENT_EXPR
)
4319 ? "increment" : "decrement"),
4324 tree result_type
= TREE_TYPE (arg
);
4326 arg
= get_unwidened (arg
, 0);
4327 argtype
= TREE_TYPE (arg
);
4329 /* ARM $5.2.5 last annotation says this should be forbidden. */
4330 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4331 pedwarn ("ANSI C++ forbids %sing an enum",
4332 (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4333 ? "increment" : "decrement");
4335 /* Compute the increment. */
4337 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4339 enum tree_code tmp
= TREE_CODE (TREE_TYPE (argtype
));
4340 if (TYPE_SIZE (complete_type (TREE_TYPE (argtype
))) == 0)
4341 cp_error ("cannot %s a pointer to incomplete type `%T'",
4342 ((code
== PREINCREMENT_EXPR
4343 || code
== POSTINCREMENT_EXPR
)
4344 ? "increment" : "decrement"), TREE_TYPE (argtype
));
4345 else if ((pedantic
|| warn_pointer_arith
)
4346 && (tmp
== FUNCTION_TYPE
|| tmp
== METHOD_TYPE
4347 || tmp
== VOID_TYPE
|| tmp
== OFFSET_TYPE
))
4348 cp_pedwarn ("ANSI C++ forbids %sing a pointer of type `%T'",
4349 ((code
== PREINCREMENT_EXPR
4350 || code
== POSTINCREMENT_EXPR
)
4351 ? "increment" : "decrement"), argtype
);
4352 inc
= c_sizeof_nowarn (TREE_TYPE (argtype
));
4355 inc
= integer_one_node
;
4357 inc
= cp_convert (argtype
, inc
);
4359 /* Handle incrementing a cast-expression. */
4361 switch (TREE_CODE (arg
))
4366 case FIX_TRUNC_EXPR
:
4367 case FIX_FLOOR_EXPR
:
4368 case FIX_ROUND_EXPR
:
4371 tree incremented
, modify
, value
, compound
;
4372 if (! lvalue_p (arg
) && pedantic
)
4373 pedwarn ("cast to non-reference type used as lvalue");
4374 arg
= stabilize_reference (arg
);
4375 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4378 value
= save_expr (arg
);
4379 incremented
= build (((code
== PREINCREMENT_EXPR
4380 || code
== POSTINCREMENT_EXPR
)
4381 ? PLUS_EXPR
: MINUS_EXPR
),
4382 argtype
, value
, inc
);
4383 TREE_SIDE_EFFECTS (incremented
) = 1;
4385 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
4386 compound
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), modify
, value
);
4388 /* Eliminate warning about unused result of + or -. */
4389 TREE_NO_UNUSED_WARNING (compound
) = 1;
4397 /* Complain about anything else that is not a true lvalue. */
4398 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4399 || code
== POSTINCREMENT_EXPR
)
4400 ? "increment" : "decrement")))
4401 return error_mark_node
;
4403 /* Forbid using -- on `bool'. */
4404 if (TREE_TYPE (arg
) == boolean_type_node
)
4406 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4408 cp_error ("invalid use of `--' on bool variable `%D'", arg
);
4409 return error_mark_node
;
4412 /* This will only work if someone can convince Kenner to accept
4413 my patch to expand_increment. (jason) */
4414 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
4416 if (code
== POSTINCREMENT_EXPR
)
4418 arg
= stabilize_reference (arg
);
4419 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4421 TREE_SIDE_EFFECTS (val
) = 1;
4422 arg
= save_expr (arg
);
4423 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4424 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4427 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4432 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
4434 TREE_SIDE_EFFECTS (val
) = 1;
4435 return cp_convert (result_type
, val
);
4439 /* Note that this operation never does default_conversion
4440 regardless of NOCONVERT. */
4442 argtype
= TREE_TYPE (arg
);
4443 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4447 build_pointer_type (TREE_TYPE (TREE_TYPE (arg
))), arg
);
4448 TREE_CONSTANT (arg
) = TREE_CONSTANT (TREE_OPERAND (arg
, 0));
4452 && TREE_CODE (arg
) == FUNCTION_DECL
4454 && DECL_CONTEXT (arg
) == NULL_TREE
4455 && IDENTIFIER_LENGTH (DECL_NAME (arg
)) == 4
4456 && IDENTIFIER_POINTER (DECL_NAME (arg
))[0] == 'm'
4457 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (arg
)), "main"))
4459 pedwarn ("taking address of function `main'");
4461 /* Let &* cancel out to simplify resulting code. */
4462 if (TREE_CODE (arg
) == INDIRECT_REF
)
4464 /* We don't need to have `current_class_ptr' wrapped in a
4465 NON_LVALUE_EXPR node. */
4466 if (arg
== current_class_ref
)
4467 return current_class_ptr
;
4469 arg
= TREE_OPERAND (arg
, 0);
4470 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4474 build_pointer_type (TREE_TYPE (TREE_TYPE (arg
))), arg
);
4475 TREE_CONSTANT (arg
) = TREE_CONSTANT (TREE_OPERAND (arg
, 0));
4477 else if (lvalue_p (arg
))
4478 /* Don't let this be an lvalue. */
4479 return non_lvalue (arg
);
4483 /* For &x[y], return x+y */
4484 if (TREE_CODE (arg
) == ARRAY_REF
)
4486 if (mark_addressable (TREE_OPERAND (arg
, 0)) == 0)
4487 return error_mark_node
;
4488 return build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
4489 TREE_OPERAND (arg
, 1), 1);
4492 /* Uninstantiated types are all functions. Taking the
4493 address of a function is a no-op, so just return the
4496 if (TREE_CODE (arg
) == IDENTIFIER_NODE
4497 && IDENTIFIER_OPNAME_P (arg
))
4499 my_friendly_abort (117);
4500 /* We don't know the type yet, so just work around the problem.
4501 We know that this will resolve to an lvalue. */
4502 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4505 if (TREE_CODE (arg
) == TREE_LIST
)
4507 if (TREE_CODE (TREE_VALUE (arg
)) == FUNCTION_DECL
4508 && DECL_CHAIN (TREE_VALUE (arg
)) == NULL_TREE
)
4509 /* Unique overloaded non-member function. */
4510 return build_unary_op (ADDR_EXPR
, TREE_VALUE (arg
), 0);
4511 if (TREE_CHAIN (arg
) == NULL_TREE
4512 && TREE_CODE (TREE_VALUE (arg
)) == TREE_LIST
4513 && DECL_CHAIN (TREE_VALUE (TREE_VALUE (arg
))) == NULL_TREE
)
4514 /* Unique overloaded member function. */
4515 return build_unary_op (ADDR_EXPR
, TREE_VALUE (TREE_VALUE (arg
)),
4517 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4519 else if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
4524 /* We don't require a match here; it's possible that the
4525 context (like a cast to a particular type) will resolve
4526 the particular choice of template. */
4527 fn
= determine_specialization (arg
,
4535 fn
= instantiate_template (fn
, targs
);
4536 mark_addressable (fn
);
4537 return build_unary_op (ADDR_EXPR
, fn
, 0);
4540 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4543 /* Handle complex lvalues (when permitted)
4544 by reduction to simpler cases. */
4545 val
= unary_complex_lvalue (code
, arg
);
4549 switch (TREE_CODE (arg
))
4554 case FIX_TRUNC_EXPR
:
4555 case FIX_FLOOR_EXPR
:
4556 case FIX_ROUND_EXPR
:
4558 if (! lvalue_p (arg
) && pedantic
)
4559 pedwarn ("taking the address of a cast to non-reference type");
4566 /* Allow the address of a constructor if all the elements
4568 if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_CONSTANT (arg
))
4570 /* Anything not already handled and not a true memory reference
4572 else if (TREE_CODE (argtype
) != FUNCTION_TYPE
4573 && TREE_CODE (argtype
) != METHOD_TYPE
4574 && !lvalue_or_else (arg
, "unary `&'"))
4575 return error_mark_node
;
4577 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4578 /* If the lvalue is const or volatile,
4579 merge that into the type that the address will point to. */
4580 if (TREE_CODE_CLASS (TREE_CODE (arg
)) == 'd'
4581 || TREE_CODE_CLASS (TREE_CODE (arg
)) == 'r')
4583 if (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
))
4584 argtype
= cp_build_type_variant (argtype
,
4585 TREE_READONLY (arg
),
4586 TREE_THIS_VOLATILE (arg
));
4589 argtype
= build_pointer_type (argtype
);
4591 if (mark_addressable (arg
) == 0)
4592 return error_mark_node
;
4597 if (TREE_CODE (arg
) == COMPONENT_REF
)
4598 addr
= build_component_addr
4600 "attempt to take address of bit-field structure member `%s'");
4602 addr
= build1 (code
, argtype
, arg
);
4604 /* Address of a static or external variable or
4605 function counts as a constant */
4607 TREE_CONSTANT (addr
) = 1;
4609 if (TREE_CODE (argtype
) == POINTER_TYPE
4610 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4612 build_ptrmemfunc_type (argtype
);
4613 addr
= build_ptrmemfunc (argtype
, addr
, 0);
4626 argtype
= TREE_TYPE (arg
);
4627 return fold (build1 (code
, argtype
, arg
));
4631 return error_mark_node
;
4635 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
4636 convert ARG with the same conversions in the same order
4637 and return the result. */
4640 convert_sequence (conversions
, arg
)
4644 switch (TREE_CODE (conversions
))
4649 case FIX_TRUNC_EXPR
:
4650 case FIX_FLOOR_EXPR
:
4651 case FIX_ROUND_EXPR
:
4653 return cp_convert (TREE_TYPE (conversions
),
4654 convert_sequence (TREE_OPERAND (conversions
, 0),
4663 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4664 for certain kinds of expressions which are not really lvalues
4665 but which we can accept as lvalues.
4667 If ARG is not a kind of expression we can handle, return zero. */
4670 unary_complex_lvalue (code
, arg
)
4671 enum tree_code code
;
4674 /* Handle (a, b) used as an "lvalue". */
4675 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
4677 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0);
4678 return build (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4679 TREE_OPERAND (arg
, 0), real_result
);
4682 /* Handle (a ? b : c) used as an "lvalue". */
4683 if (TREE_CODE (arg
) == COND_EXPR
4684 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
4685 return rationalize_conditional_expr (code
, arg
);
4687 if (TREE_CODE (arg
) == MODIFY_EXPR
4688 || TREE_CODE (arg
) == PREINCREMENT_EXPR
4689 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
4690 return unary_complex_lvalue
4691 (code
, build (COMPOUND_EXPR
, TREE_TYPE (TREE_OPERAND (arg
, 0)),
4692 arg
, TREE_OPERAND (arg
, 0)));
4694 if (code
!= ADDR_EXPR
)
4697 /* Handle (a = b) used as an "lvalue" for `&'. */
4698 if (TREE_CODE (arg
) == MODIFY_EXPR
4699 || TREE_CODE (arg
) == INIT_EXPR
)
4701 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 0), 0);
4702 arg
= build (COMPOUND_EXPR
, TREE_TYPE (real_result
), arg
, real_result
);
4703 TREE_NO_UNUSED_WARNING (arg
) = 1;
4707 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
4708 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
4709 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
4711 /* The representation of something of type OFFSET_TYPE
4712 is really the representation of a pointer to it.
4713 Here give the representation its true type. */
4716 my_friendly_assert (TREE_CODE (arg
) != SCOPE_REF
, 313);
4718 if (TREE_CODE (arg
) != OFFSET_REF
)
4721 t
= TREE_OPERAND (arg
, 1);
4723 /* Check all this code for right semantics. */
4724 if (TREE_CODE (t
) == FUNCTION_DECL
)
4725 return build_unary_op (ADDR_EXPR
, t
, 0);
4726 if (TREE_CODE (t
) == VAR_DECL
)
4727 return build_unary_op (ADDR_EXPR
, t
, 0);
4733 if (TREE_OPERAND (arg
, 0)
4734 && (TREE_CODE (TREE_OPERAND (arg
, 0)) != NOP_EXPR
4735 || (TREE_OPERAND (TREE_OPERAND (arg
, 0), 0)
4736 != error_mark_node
)))
4737 if (TREE_CODE (t
) != FIELD_DECL
)
4739 /* Don't know if this should return address to just
4740 _DECL, or actual address resolved in this expression. */
4741 sorry ("address of bound pointer-to-member expression");
4742 return error_mark_node
;
4745 /* Add in the offset to the field. */
4746 offset
= convert (sizetype
,
4747 size_binop (EASY_DIV_EXPR
,
4748 DECL_FIELD_BITPOS (t
),
4749 size_int (BITS_PER_UNIT
)));
4751 /* We offset all pointer to data members by 1 so that we can
4752 distinguish between a null pointer to data member and the first
4753 data member of a structure. */
4754 offset
= size_binop (PLUS_EXPR
, offset
, size_int (1));
4756 type
= build_offset_type (DECL_FIELD_CONTEXT (t
), TREE_TYPE (t
));
4757 type
= build_pointer_type (type
);
4759 return cp_convert (type
, offset
);
4764 /* We permit compiler to make function calls returning
4765 objects of aggregate type look like lvalues. */
4769 if (TREE_CODE (targ
) == SAVE_EXPR
)
4770 targ
= TREE_OPERAND (targ
, 0);
4772 if (TREE_CODE (targ
) == CALL_EXPR
&& IS_AGGR_TYPE (TREE_TYPE (targ
)))
4774 if (TREE_CODE (arg
) == SAVE_EXPR
)
4777 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
4778 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
4781 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
4782 return build (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
4783 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
4786 /* Don't let anything else be handled specially. */
4790 /* Mark EXP saying that we need to be able to take the
4791 address of it; it should not be allocated in a register.
4792 Value is 1 if successful.
4794 C++: we do not allow `current_class_ptr' to be addressable. */
4797 mark_addressable (exp
)
4800 register tree x
= exp
;
4802 if (TREE_ADDRESSABLE (x
) == 1)
4806 switch (TREE_CODE (x
))
4813 x
= TREE_OPERAND (x
, 0);
4817 if (x
== current_class_ptr
)
4819 if (! flag_this_is_variable
)
4820 error ("address of `this' not available");
4821 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later */
4822 put_var_into_stack (x
);
4826 if (TREE_STATIC (x
) && TREE_READONLY (x
)
4827 && DECL_RTL (x
) != 0
4828 && ! DECL_IN_MEMORY_P (x
))
4830 /* We thought this would make a good constant variable,
4831 but we were wrong. */
4832 push_obstacks_nochange ();
4833 end_temporary_allocation ();
4835 TREE_ASM_WRITTEN (x
) = 0;
4837 rest_of_decl_compilation (x
, 0, IDENTIFIER_LOCAL_VALUE (x
) == 0,
4839 TREE_ADDRESSABLE (x
) = 1;
4845 /* Caller should not be trying to mark initialized
4846 constant fields addressable. */
4847 my_friendly_assert (DECL_LANG_SPECIFIC (x
) == 0
4848 || DECL_IN_AGGR_P (x
) == 0
4850 || DECL_EXTERNAL (x
), 314);
4854 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
4855 && !DECL_ARTIFICIAL (x
) && extra_warnings
)
4856 cp_warning ("address requested for `%D', which is declared `register'",
4858 put_var_into_stack (x
);
4859 TREE_ADDRESSABLE (x
) = 1;
4863 if (DECL_LANG_SPECIFIC (x
) != 0)
4865 x
= DECL_MAIN_VARIANT (x
);
4866 /* We have to test both conditions here. The first may be
4867 non-zero in the case of processing a default function. The
4868 second may be non-zero in the case of a template function. */
4869 if (DECL_TEMPLATE_INFO (x
) && !DECL_TEMPLATE_SPECIALIZATION (x
))
4872 TREE_ADDRESSABLE (x
) = 1;
4874 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x
)) = 1;
4878 TREE_ADDRESSABLE (x
) = 1;
4882 TREE_ADDRESSABLE (x
) = 1;
4883 mark_addressable (TREE_OPERAND (x
, 0));
4891 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4894 build_x_conditional_expr (ifexp
, op1
, op2
)
4895 tree ifexp
, op1
, op2
;
4897 if (processing_template_decl
)
4898 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
4900 return build_new_op (COND_EXPR
, LOOKUP_NORMAL
, ifexp
, op1
, op2
);
4904 build_conditional_expr (ifexp
, op1
, op2
)
4905 tree ifexp
, op1
, op2
;
4907 register tree type1
;
4908 register tree type2
;
4909 register enum tree_code code1
;
4910 register enum tree_code code2
;
4911 register tree result_type
= NULL_TREE
;
4913 /* If second operand is omitted, it is the same as the first one;
4914 make sure it is calculated only once. */
4918 pedwarn ("ANSI C++ forbids omitting the middle term of a ?: expression");
4919 ifexp
= op1
= save_expr (ifexp
);
4922 ifexp
= cp_convert (boolean_type_node
, ifexp
);
4924 if (TREE_CODE (ifexp
) == ERROR_MARK
)
4925 return error_mark_node
;
4927 op1
= require_instantiated_type (TREE_TYPE (op2
), op1
, error_mark_node
);
4928 if (op1
== error_mark_node
)
4929 return error_mark_node
;
4930 op2
= require_instantiated_type (TREE_TYPE (op1
), op2
, error_mark_node
);
4931 if (op2
== error_mark_node
)
4932 return error_mark_node
;
4934 /* C++: REFERENCE_TYPES must be dereferenced. */
4935 type1
= TREE_TYPE (op1
);
4936 code1
= TREE_CODE (type1
);
4937 type2
= TREE_TYPE (op2
);
4938 code2
= TREE_CODE (type2
);
4940 if (code1
== REFERENCE_TYPE
)
4942 op1
= convert_from_reference (op1
);
4943 type1
= TREE_TYPE (op1
);
4944 code1
= TREE_CODE (type1
);
4946 if (code2
== REFERENCE_TYPE
)
4948 op2
= convert_from_reference (op2
);
4949 type2
= TREE_TYPE (op2
);
4950 code2
= TREE_CODE (type2
);
4953 /* Don't promote the operands separately if they promote
4954 the same way. Return the unpromoted type and let the combined
4955 value get promoted if necessary. */
4957 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
)
4958 && code2
!= ARRAY_TYPE
4959 && code2
!= FUNCTION_TYPE
4960 && code2
!= METHOD_TYPE
)
4964 if (TREE_CONSTANT (ifexp
)
4965 && (TREE_CODE (ifexp
) == INTEGER_CST
4966 || TREE_CODE (ifexp
) == ADDR_EXPR
))
4967 return (integer_zerop (ifexp
) ? op2
: op1
);
4969 if (TREE_CODE (op1
) == CONST_DECL
)
4970 op1
= DECL_INITIAL (op1
);
4971 else if (TREE_READONLY_DECL_P (op1
))
4972 op1
= decl_constant_value (op1
);
4973 if (TREE_CODE (op2
) == CONST_DECL
)
4974 op2
= DECL_INITIAL (op2
);
4975 else if (TREE_READONLY_DECL_P (op2
))
4976 op2
= decl_constant_value (op2
);
4978 type1
= cp_build_type_variant
4980 TREE_READONLY (op1
) || TREE_READONLY (op2
),
4981 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
4982 /* ??? This is a kludge to deal with the fact that
4983 we don't sort out integers and enums properly, yet. */
4984 result
= fold (build (COND_EXPR
, type1
, ifexp
, op1
, op2
));
4985 if (TREE_TYPE (result
) != type1
)
4986 result
= build1 (NOP_EXPR
, type1
, result
);
4987 /* Expand both sides into the same slot,
4988 hopefully the target of the ?: expression. */
4989 if (TREE_CODE (op1
) == TARGET_EXPR
&& TREE_CODE (op2
) == TARGET_EXPR
)
4991 tree slot
= build (VAR_DECL
, TREE_TYPE (result
));
4992 layout_decl (slot
, 0);
4993 result
= build (TARGET_EXPR
, TREE_TYPE (result
),
4994 slot
, result
, NULL_TREE
, NULL_TREE
);
4999 /* They don't match; promote them both and then try to reconcile them.
5000 But don't permit mismatching enum types. */
5001 if (code1
== ENUMERAL_TYPE
)
5003 if (code2
== ENUMERAL_TYPE
)
5005 cp_error ("enumeral mismatch in conditional expression: `%T' vs `%T'",
5007 return error_mark_node
;
5009 else if (extra_warnings
&& ! IS_AGGR_TYPE_CODE (code2
)
5010 && type2
!= type_promotes_to (type1
))
5011 warning ("enumeral and non-enumeral type in conditional expression");
5013 else if (extra_warnings
5014 && code2
== ENUMERAL_TYPE
&& ! IS_AGGR_TYPE_CODE (code1
)
5015 && type1
!= type_promotes_to (type2
))
5016 warning ("enumeral and non-enumeral type in conditional expression");
5018 if (code1
!= VOID_TYPE
)
5020 op1
= default_conversion (op1
);
5021 type1
= TREE_TYPE (op1
);
5022 if (TYPE_PTRMEMFUNC_P (type1
))
5023 type1
= TYPE_PTRMEMFUNC_FN_TYPE (type1
);
5024 code1
= TREE_CODE (type1
);
5026 if (code2
!= VOID_TYPE
)
5028 op2
= default_conversion (op2
);
5029 type2
= TREE_TYPE (op2
);
5030 if (TYPE_PTRMEMFUNC_P (type2
))
5031 type2
= TYPE_PTRMEMFUNC_FN_TYPE (type2
);
5032 code2
= TREE_CODE (type2
);
5035 if (code1
== RECORD_TYPE
&& code2
== RECORD_TYPE
5036 && real_lvalue_p (op1
) && real_lvalue_p (op2
)
5037 && comptypes (type1
, type2
, -1))
5039 type1
= build_reference_type (type1
);
5040 type2
= build_reference_type (type2
);
5041 result_type
= common_type (type1
, type2
);
5042 op1
= convert_to_reference (result_type
, op1
, CONV_IMPLICIT
,
5043 LOOKUP_NORMAL
, NULL_TREE
);
5044 op2
= convert_to_reference (result_type
, op2
, CONV_IMPLICIT
,
5045 LOOKUP_NORMAL
, NULL_TREE
);
5047 /* Quickly detect the usual case where op1 and op2 have the same type
5049 else if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
5052 result_type
= type1
;
5054 result_type
= cp_build_type_variant
5056 TREE_READONLY (op1
) || TREE_READONLY (op2
),
5057 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
5059 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
)
5060 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
))
5062 result_type
= common_type (type1
, type2
);
5064 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
5066 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
5067 pedwarn ("ANSI C++ forbids conditional expr with only one void side");
5068 result_type
= void_type_node
;
5070 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op2
))
5071 result_type
= qualify_type (type1
, type2
);
5072 else if (code2
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
5073 result_type
= qualify_type (type2
, type1
);
5074 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
5076 if (comp_target_types (type1
, type2
, 1))
5077 result_type
= common_type (type1
, type2
);
5078 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type1
)) == void_type_node
)
5080 if (pedantic
&& TREE_CODE (type2
) == FUNCTION_TYPE
)
5081 pedwarn ("ANSI C++ forbids conditional expr between `void *' and function pointer");
5082 result_type
= qualify_type (type1
, type2
);
5084 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type2
)) == void_type_node
)
5086 if (pedantic
&& TREE_CODE (type1
) == FUNCTION_TYPE
)
5087 pedwarn ("ANSI C++ forbids conditional expr between `void *' and function pointer");
5088 result_type
= qualify_type (type2
, type1
);
5091 else if (comptypes (type2
, type1
, 0))
5092 result_type
= type2
;
5093 else if (IS_AGGR_TYPE (TREE_TYPE (type1
))
5094 && IS_AGGR_TYPE (TREE_TYPE (type2
))
5095 && (result_type
= common_base_type (TREE_TYPE (type1
),
5096 TREE_TYPE (type2
))))
5098 if (result_type
== error_mark_node
)
5100 cp_error ("common base type of types `%T' and `%T' is ambiguous",
5101 TREE_TYPE (type1
), TREE_TYPE (type2
));
5102 result_type
= ptr_type_node
;
5107 && result_type
!= TREE_TYPE (type1
)
5108 && result_type
!= TREE_TYPE (type2
))
5109 cp_pedwarn ("`%T' and `%T' converted to `%T *' in conditional expression",
5110 type1
, type2
, result_type
);
5112 result_type
= build_pointer_type (result_type
);
5117 pedwarn ("pointer type mismatch in conditional expression");
5118 result_type
= ptr_type_node
;
5121 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
5123 pedwarn ("pointer/integer type mismatch in conditional expression");
5124 result_type
= type1
;
5126 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
5128 pedwarn ("pointer/integer type mismatch in conditional expression");
5129 result_type
= type2
;
5134 /* The match does not look good. If either is
5135 an aggregate value, try converting to a scalar type. */
5136 if (code1
== RECORD_TYPE
&& code2
== RECORD_TYPE
)
5138 cp_error ("aggregate mismatch in conditional expression: `%T' vs `%T'",
5140 return error_mark_node
;
5142 /* Warning: this code assumes that conversion between cv-variants of
5143 a type is done using NOP_EXPRs. */
5144 if (code1
== RECORD_TYPE
&& TYPE_HAS_CONVERSION (type1
))
5146 /* There are other types besides pointers and records. */
5148 if (code2
== POINTER_TYPE
)
5149 tmp
= build_pointer_type
5150 (build_type_variant (TREE_TYPE (type2
), 1, 1));
5153 tmp
= build_type_conversion (CONVERT_EXPR
, tmp
, op1
, 0);
5154 if (tmp
== NULL_TREE
)
5156 cp_error ("incompatible types `%T' and `%T' in `?:'",
5158 return error_mark_node
;
5160 if (tmp
== error_mark_node
)
5161 error ("ambiguous pointer conversion");
5164 result_type
= common_type (type2
, TREE_TYPE (tmp
));
5167 else if (code2
== RECORD_TYPE
&& TYPE_HAS_CONVERSION (type2
))
5170 if (code1
== POINTER_TYPE
)
5171 tmp
= build_pointer_type
5172 (build_type_variant (TREE_TYPE (type1
), 1, 1));
5176 tmp
= build_type_conversion (CONVERT_EXPR
, tmp
, op2
, 0);
5177 if (tmp
== NULL_TREE
)
5179 cp_error ("incompatible types `%T' and `%T' in `?:'",
5181 return error_mark_node
;
5183 if (tmp
== error_mark_node
)
5184 error ("ambiguous pointer conversion");
5187 result_type
= common_type (type1
, TREE_TYPE (tmp
));
5190 else if (flag_cond_mismatch
)
5191 result_type
= void_type_node
;
5194 error ("type mismatch in conditional expression");
5195 return error_mark_node
;
5199 if (TREE_CODE (result_type
) == POINTER_TYPE
5200 && TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
5201 result_type
= build_ptrmemfunc_type (result_type
);
5203 if (result_type
!= TREE_TYPE (op1
))
5204 op1
= convert_for_initialization
5205 (NULL_TREE
, result_type
, op1
, LOOKUP_NORMAL
, "converting", NULL_TREE
, 0);
5206 if (result_type
!= TREE_TYPE (op2
))
5207 op2
= convert_for_initialization
5208 (NULL_TREE
, result_type
, op2
, LOOKUP_NORMAL
, "converting", NULL_TREE
, 0);
5210 if (TREE_CONSTANT (ifexp
))
5211 return integer_zerop (ifexp
) ? op2
: op1
;
5213 return convert_from_reference
5214 (fold (build (COND_EXPR
, result_type
, ifexp
, op1
, op2
)));
5217 /* Handle overloading of the ',' operator when needed. Otherwise,
5218 this function just builds an expression list. */
5221 build_x_compound_expr (list
)
5224 tree rest
= TREE_CHAIN (list
);
5227 if (processing_template_decl
)
5228 return build_min_nt (COMPOUND_EXPR
, list
, NULL_TREE
);
5230 if (rest
== NULL_TREE
)
5231 return build_compound_expr (list
);
5233 result
= build_opfncall (COMPOUND_EXPR
, LOOKUP_NORMAL
,
5234 TREE_VALUE (list
), TREE_VALUE (rest
), NULL_TREE
);
5236 return build_x_compound_expr (expr_tree_cons (NULL_TREE
, result
,
5237 TREE_CHAIN (rest
)));
5239 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)))
5241 /* the left-hand operand of a comma expression is like an expression
5242 statement: we should warn if it doesn't have any side-effects,
5243 unless it was explicitly cast to (void). */
5244 if ((extra_warnings
|| warn_unused
)
5245 && !(TREE_CODE (TREE_VALUE(list
)) == CONVERT_EXPR
5246 && TREE_TYPE (TREE_VALUE(list
)) == void_type_node
))
5247 warning("left-hand operand of comma expression has no effect");
5249 #if 0 /* this requires a gcc backend patch to export warn_if_unused_value */
5250 else if (warn_unused
)
5251 warn_if_unused_value (TREE_VALUE(list
));
5254 return build_compound_expr
5255 (expr_tree_cons (NULL_TREE
, TREE_VALUE (list
),
5256 build_expr_list (NULL_TREE
,
5257 build_x_compound_expr (rest
))));
5260 /* Given a list of expressions, return a compound expression
5261 that performs them all and returns the value of the last of them. */
5264 build_compound_expr (list
)
5269 if (TREE_READONLY_DECL_P (TREE_VALUE (list
)))
5270 TREE_VALUE (list
) = decl_constant_value (TREE_VALUE (list
));
5272 if (TREE_CHAIN (list
) == 0)
5274 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5275 Strip such NOP_EXPRs, since LIST is used in non-lvalue context. */
5276 if (TREE_CODE (list
) == NOP_EXPR
5277 && TREE_TYPE (list
) == TREE_TYPE (TREE_OPERAND (list
, 0)))
5278 list
= TREE_OPERAND (list
, 0);
5280 /* Convert arrays to pointers. */
5281 if (TREE_CODE (TREE_TYPE (TREE_VALUE (list
))) == ARRAY_TYPE
)
5282 return default_conversion (TREE_VALUE (list
));
5284 return TREE_VALUE (list
);
5287 rest
= build_compound_expr (TREE_CHAIN (list
));
5289 /* When pedantic, a compound expression cannot be a constant expression. */
5290 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)) && ! pedantic
)
5293 return build (COMPOUND_EXPR
, TREE_TYPE (rest
),
5294 break_out_cleanups (TREE_VALUE (list
)), rest
);
5298 build_static_cast (type
, expr
)
5304 if (type
== error_mark_node
|| expr
== error_mark_node
)
5305 return error_mark_node
;
5307 if (TREE_CODE (expr
) == OFFSET_REF
)
5308 expr
= resolve_offset_ref (expr
);
5310 if (processing_template_decl
)
5312 tree t
= build_min (STATIC_CAST_EXPR
, copy_to_permanent (type
),
5317 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5318 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5319 if (TREE_CODE (type
) != REFERENCE_TYPE
5320 && TREE_CODE (expr
) == NOP_EXPR
5321 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5322 expr
= TREE_OPERAND (expr
, 0);
5324 if (TREE_CODE (type
) == VOID_TYPE
)
5325 return build1 (CONVERT_EXPR
, type
, expr
);
5327 if (type_unknown_p (expr
))
5329 expr
= instantiate_type (type
, expr
, 1);
5330 if (expr
== error_mark_node
)
5331 return error_mark_node
;
5334 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5335 return (convert_from_reference
5336 (convert_to_reference (type
, expr
, CONV_STATIC
|CONV_IMPLICIT
,
5337 LOOKUP_COMPLAIN
, NULL_TREE
)));
5339 if (IS_AGGR_TYPE (type
))
5340 return build_cplus_new
5341 (type
, (build_method_call
5342 (NULL_TREE
, ctor_identifier
, build_expr_list (NULL_TREE
, expr
),
5343 TYPE_BINFO (type
), LOOKUP_NORMAL
)));
5345 expr
= decay_conversion (expr
);
5346 intype
= TREE_TYPE (expr
);
5348 /* FIXME handle casting to array type. */
5351 if (can_convert_arg (type
, intype
, expr
))
5353 else if (TYPE_PTROB_P (type
) && TYPE_PTROB_P (intype
))
5356 if (IS_AGGR_TYPE (TREE_TYPE (type
)) && IS_AGGR_TYPE (TREE_TYPE (intype
))
5357 && (TYPE_READONLY (TREE_TYPE (type
))
5358 >= TYPE_READONLY (TREE_TYPE (intype
)))
5359 && (TYPE_VOLATILE (TREE_TYPE (type
))
5360 >= TYPE_VOLATILE (TREE_TYPE (intype
)))
5361 && (binfo
= get_binfo (TREE_TYPE (intype
), TREE_TYPE (type
), 0))
5362 && ! TREE_VIA_VIRTUAL (binfo
))
5365 else if (TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5367 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
))),
5368 TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (intype
))), 1)
5369 && (TYPE_READONLY (TREE_TYPE (TREE_TYPE (type
)))
5370 >= TYPE_READONLY (TREE_TYPE (TREE_TYPE (intype
))))
5371 && (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (type
)))
5372 >= TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (intype
))))
5373 && (binfo
= get_binfo (TYPE_OFFSET_BASETYPE (intype
),
5374 TYPE_OFFSET_BASETYPE (type
), 0))
5375 && ! TREE_VIA_VIRTUAL (binfo
))
5378 else if (TREE_CODE (intype
) != BOOLEAN_TYPE
5379 && TREE_CODE (type
) != ARRAY_TYPE
5380 && TREE_CODE (type
) != FUNCTION_TYPE
5381 && can_convert (intype
, type
))
5385 return build_c_cast (type
, expr
);
5387 cp_error ("static_cast from `%T' to `%T'", intype
, type
);
5388 return error_mark_node
;
5392 build_reinterpret_cast (type
, expr
)
5397 if (type
== error_mark_node
|| expr
== error_mark_node
)
5398 return error_mark_node
;
5400 if (TREE_CODE (expr
) == OFFSET_REF
)
5401 expr
= resolve_offset_ref (expr
);
5403 if (processing_template_decl
)
5405 tree t
= build_min (REINTERPRET_CAST_EXPR
,
5406 copy_to_permanent (type
), expr
);
5410 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5412 expr
= decay_conversion (expr
);
5414 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5415 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5416 if (TREE_CODE (expr
) == NOP_EXPR
5417 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5418 expr
= TREE_OPERAND (expr
, 0);
5421 if (type_unknown_p (expr
))
5423 expr
= instantiate_type (type
, expr
, 1);
5424 if (expr
== error_mark_node
)
5425 return error_mark_node
;
5428 intype
= TREE_TYPE (expr
);
5430 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5432 if (! real_lvalue_p (expr
))
5434 cp_error ("reinterpret_cast from `%T' rvalue to `%T'", intype
, type
);
5435 return error_mark_node
;
5437 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5438 if (expr
!= error_mark_node
)
5439 expr
= build_reinterpret_cast
5440 (build_pointer_type (TREE_TYPE (type
)), expr
);
5441 if (expr
!= error_mark_node
)
5442 expr
= build_indirect_ref (expr
, 0);
5445 else if (comptypes (TYPE_MAIN_VARIANT (intype
), TYPE_MAIN_VARIANT (type
), 1))
5446 return build_static_cast (type
, expr
);
5448 if (TYPE_PTR_P (type
) && (TREE_CODE (intype
) == INTEGER_TYPE
5449 || TREE_CODE (intype
) == ENUMERAL_TYPE
))
5451 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_PTR_P (intype
))
5453 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
5454 cp_pedwarn ("reinterpret_cast from `%T' to `%T' loses precision",
5457 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
5458 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5460 if (TREE_READONLY_DECL_P (expr
))
5461 expr
= decl_constant_value (expr
);
5462 return fold (build1 (NOP_EXPR
, type
, expr
));
5464 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5465 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
5467 if (! comp_ptr_ttypes_reinterpret (TREE_TYPE (type
), TREE_TYPE (intype
)))
5468 cp_pedwarn ("reinterpret_cast from `%T' to `%T' casts away const (or volatile)",
5471 if (TREE_READONLY_DECL_P (expr
))
5472 expr
= decl_constant_value (expr
);
5473 return fold (build1 (NOP_EXPR
, type
, expr
));
5475 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
5476 || (TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
)))
5478 pedwarn ("ANSI C++ forbids casting between pointers to functions and objects");
5479 if (TREE_READONLY_DECL_P (expr
))
5480 expr
= decl_constant_value (expr
);
5481 return fold (build1 (NOP_EXPR
, type
, expr
));
5485 cp_error ("reinterpret_cast from `%T' to `%T'", intype
, type
);
5486 return error_mark_node
;
5489 return cp_convert (type
, expr
);
5493 build_const_cast (type
, expr
)
5498 if (type
== error_mark_node
|| expr
== error_mark_node
)
5499 return error_mark_node
;
5501 if (TREE_CODE (expr
) == OFFSET_REF
)
5502 expr
= resolve_offset_ref (expr
);
5504 if (processing_template_decl
)
5506 tree t
= build_min (CONST_CAST_EXPR
, copy_to_permanent (type
),
5511 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5513 expr
= decay_conversion (expr
);
5515 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5516 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5517 if (TREE_CODE (expr
) == NOP_EXPR
5518 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5519 expr
= TREE_OPERAND (expr
, 0);
5522 if (type_unknown_p (expr
))
5524 expr
= instantiate_type (type
, expr
, 1);
5525 if (expr
== error_mark_node
)
5526 return error_mark_node
;
5529 intype
= TREE_TYPE (expr
);
5531 if (comptypes (TYPE_MAIN_VARIANT (intype
), TYPE_MAIN_VARIANT (type
), 1))
5532 return build_static_cast (type
, expr
);
5533 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5535 if (! real_lvalue_p (expr
))
5537 cp_error ("const_cast from `%T' rvalue to `%T'", intype
, type
);
5538 return error_mark_node
;
5541 if (comp_ptr_ttypes_const (TREE_TYPE (type
), intype
))
5543 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5544 expr
= build1 (NOP_EXPR
, type
, expr
);
5545 return convert_from_reference (expr
);
5548 else if (TREE_CODE (type
) == POINTER_TYPE
5549 && TREE_CODE (intype
) == POINTER_TYPE
5550 && comp_ptr_ttypes_const (TREE_TYPE (type
), TREE_TYPE (intype
)))
5551 return cp_convert (type
, expr
);
5553 cp_error ("const_cast from `%T' to `%T'", intype
, type
);
5554 return error_mark_node
;
5557 /* Build an expression representing a cast to type TYPE of expression EXPR.
5559 ALLOW_NONCONVERTING is true if we should allow non-converting constructors
5560 when doing the cast. */
5563 build_c_cast (type
, expr
)
5566 register tree value
= expr
;
5568 if (type
== error_mark_node
|| expr
== error_mark_node
)
5569 return error_mark_node
;
5571 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5572 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5573 if (TREE_CODE (type
) != REFERENCE_TYPE
5574 && TREE_CODE (value
) == NOP_EXPR
5575 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
5576 value
= TREE_OPERAND (value
, 0);
5578 if (TREE_TYPE (expr
)
5579 && TREE_CODE (TREE_TYPE (expr
)) == OFFSET_TYPE
5580 && TREE_CODE (type
) != OFFSET_TYPE
)
5581 value
= resolve_offset_ref (value
);
5583 if (TREE_CODE (type
) == ARRAY_TYPE
)
5585 /* Allow casting from T1* to T2[] because Cfront allows it.
5586 NIHCL uses it. It is not valid ANSI C however, and hence, not
5588 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
5591 pedwarn ("ANSI C++ forbids casting to an array type");
5592 type
= build_pointer_type (TREE_TYPE (type
));
5596 error ("ANSI C++ forbids casting to an array type");
5597 return error_mark_node
;
5601 if (TREE_CODE (type
) == FUNCTION_TYPE
5602 || TREE_CODE (type
) == METHOD_TYPE
)
5604 cp_error ("casting to function type `%T'", type
);
5605 return error_mark_node
;
5608 if (IS_SIGNATURE (type
))
5610 error ("cast specifies signature type");
5611 return error_mark_node
;
5614 if (processing_template_decl
)
5616 tree t
= build_min (CAST_EXPR
, type
,
5617 min_tree_cons (NULL_TREE
, value
, NULL_TREE
));
5621 if (TREE_CODE (type
) == VOID_TYPE
)
5622 value
= build1 (CONVERT_EXPR
, type
, value
);
5623 else if (TREE_TYPE (value
) == NULL_TREE
5624 || type_unknown_p (value
))
5626 value
= instantiate_type (type
, value
, 1);
5628 if (value
== error_mark_node
)
5629 return error_mark_node
;
5635 /* Convert functions and arrays to pointers and
5636 convert references to their expanded types,
5637 but don't convert any other types. */
5638 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
5639 || (TREE_CODE (TREE_TYPE (value
)) == METHOD_TYPE
5640 /* Don't do the default conversion if we want a
5641 pointer to a function. */
5642 && ! (TREE_CODE (type
) == POINTER_TYPE
5643 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
))
5644 || TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
5645 || TREE_CODE (TREE_TYPE (value
)) == REFERENCE_TYPE
)
5646 value
= default_conversion (value
);
5647 otype
= TREE_TYPE (value
);
5649 /* Optionally warn about potentially worrisome casts. */
5652 && TREE_CODE (type
) == POINTER_TYPE
5653 && TREE_CODE (otype
) == POINTER_TYPE
)
5655 /* For C++ we make these regular warnings, rather than
5656 softening them into pedwarns. */
5657 if (TYPE_VOLATILE (TREE_TYPE (otype
))
5658 && ! TYPE_VOLATILE (TREE_TYPE (type
)))
5659 warning ("cast discards `volatile' from pointer target type");
5660 if (TYPE_READONLY (TREE_TYPE (otype
))
5661 && ! TYPE_READONLY (TREE_TYPE (type
)))
5662 warning ("cast discards `const' from pointer target type");
5665 /* Warn about possible alignment problems. */
5666 if (STRICT_ALIGNMENT
&& warn_cast_align
5667 && TREE_CODE (type
) == POINTER_TYPE
5668 && TREE_CODE (otype
) == POINTER_TYPE
5669 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
5670 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
5671 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
5672 warning ("cast increases required alignment of target type");
5675 /* We should see about re-enabling these, they seem useful to
5677 if (TREE_CODE (type
) == INTEGER_TYPE
5678 && TREE_CODE (otype
) == POINTER_TYPE
5679 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
))
5680 warning ("cast from pointer to integer of different size");
5682 if (TREE_CODE (type
) == POINTER_TYPE
5683 && TREE_CODE (otype
) == INTEGER_TYPE
5684 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
5685 /* Don't warn about converting 0 to pointer,
5686 provided the 0 was explicit--not cast or made by folding. */
5687 && !(TREE_CODE (value
) == INTEGER_CST
&& integer_zerop (value
)))
5688 warning ("cast to pointer from integer of different size");
5691 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5692 value
= (convert_from_reference
5693 (convert_to_reference (type
, value
, CONV_C_CAST
,
5694 LOOKUP_COMPLAIN
, NULL_TREE
)));
5699 if (TREE_READONLY_DECL_P (value
))
5700 value
= decl_constant_value (value
);
5703 value
= convert_force (type
, value
, CONV_C_CAST
);
5705 /* Ignore any integer overflow caused by the cast. */
5706 if (TREE_CODE (value
) == INTEGER_CST
)
5708 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
5709 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
5714 /* Always produce some operator for an explicit cast,
5715 so we can tell (for -pedantic) that the cast is no lvalue. */
5716 if (TREE_CODE (type
) != REFERENCE_TYPE
&& value
== expr
5717 && real_lvalue_p (value
))
5718 value
= non_lvalue (value
);
5723 /* Build an assignment expression of lvalue LHS from value RHS.
5724 MODIFYCODE is the code for a binary operator that we use
5725 to combine the old value of LHS with RHS to get the new value.
5726 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5728 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5731 build_modify_expr (lhs
, modifycode
, rhs
)
5733 enum tree_code modifycode
;
5736 register tree result
;
5738 tree lhstype
= TREE_TYPE (lhs
);
5739 tree olhstype
= lhstype
;
5742 /* Avoid duplicate error messages from operands that had errors. */
5743 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5744 return error_mark_node
;
5746 /* Types that aren't fully specified cannot be used in assignments. */
5747 lhs
= require_complete_type (lhs
);
5751 /* Handle assignment to signature pointers/refs. */
5753 if (TYPE_LANG_SPECIFIC (lhstype
)
5754 && (IS_SIGNATURE_POINTER (lhstype
) || IS_SIGNATURE_REFERENCE (lhstype
)))
5756 return build_signature_pointer_constructor (lhs
, rhs
);
5759 /* Handle control structure constructs used as "lvalues". */
5761 switch (TREE_CODE (lhs
))
5763 /* Handle --foo = 5; as these are valid constructs in C++ */
5764 case PREDECREMENT_EXPR
:
5765 case PREINCREMENT_EXPR
:
5766 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5767 lhs
= build (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5768 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5769 TREE_OPERAND (lhs
, 1));
5770 return build (COMPOUND_EXPR
, lhstype
,
5772 build_modify_expr (TREE_OPERAND (lhs
, 0),
5775 /* Handle (a, b) used as an "lvalue". */
5777 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1),
5779 if (newrhs
== error_mark_node
)
5780 return error_mark_node
;
5781 return build (COMPOUND_EXPR
, lhstype
,
5782 TREE_OPERAND (lhs
, 0), newrhs
);
5785 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
);
5786 if (newrhs
== error_mark_node
)
5787 return error_mark_node
;
5788 return build (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
5790 /* Handle (a ? b : c) used as an "lvalue". */
5792 rhs
= save_expr (rhs
);
5794 /* Produce (a ? (b = rhs) : (c = rhs))
5795 except that the RHS goes through a save-expr
5796 so the code to compute it is only emitted once. */
5798 = build_conditional_expr (TREE_OPERAND (lhs
, 0),
5799 build_modify_expr (cp_convert (TREE_TYPE (lhs
), TREE_OPERAND (lhs
, 1)),
5801 build_modify_expr (cp_convert (TREE_TYPE (lhs
), TREE_OPERAND (lhs
, 2)),
5803 if (cond
== error_mark_node
)
5805 /* Make sure the code to compute the rhs comes out
5806 before the split. */
5807 return build (COMPOUND_EXPR
, TREE_TYPE (lhs
),
5808 /* Case to void to suppress warning
5809 from warn_if_unused_value. */
5810 cp_convert (void_type_node
, rhs
), cond
);
5817 if (TREE_CODE (lhs
) == OFFSET_REF
)
5819 if (TREE_OPERAND (lhs
, 0) == NULL_TREE
)
5821 /* Static class member? */
5822 tree member
= TREE_OPERAND (lhs
, 1);
5823 if (TREE_CODE (member
) == VAR_DECL
)
5827 compiler_error ("invalid static class member");
5828 return error_mark_node
;
5832 lhs
= resolve_offset_ref (lhs
);
5834 olhstype
= lhstype
= TREE_TYPE (lhs
);
5837 if (TREE_CODE (lhstype
) == REFERENCE_TYPE
5838 && modifycode
!= INIT_EXPR
)
5840 lhs
= convert_from_reference (lhs
);
5841 olhstype
= lhstype
= TREE_TYPE (lhs
);
5844 /* If a binary op has been requested, combine the old LHS value with the RHS
5845 producing the value we should actually store into the LHS. */
5847 if (modifycode
== INIT_EXPR
)
5849 if (! IS_AGGR_TYPE (lhstype
))
5850 /* Do the default thing */;
5853 result
= build_method_call (lhs
, ctor_identifier
,
5854 build_expr_list (NULL_TREE
, rhs
),
5855 TYPE_BINFO (lhstype
), LOOKUP_NORMAL
);
5856 if (result
== NULL_TREE
)
5857 return error_mark_node
;
5861 else if (modifycode
== NOP_EXPR
)
5863 /* `operator=' is not an inheritable operator. */
5864 if (! IS_AGGR_TYPE (lhstype
))
5865 /* Do the default thing */;
5868 result
= build_opfncall (MODIFY_EXPR
, LOOKUP_NORMAL
,
5869 lhs
, rhs
, make_node (NOP_EXPR
));
5870 if (result
== NULL_TREE
)
5871 return error_mark_node
;
5876 else if (PROMOTES_TO_AGGR_TYPE (lhstype
, REFERENCE_TYPE
))
5878 my_friendly_abort (978652);
5882 lhs
= stabilize_reference (lhs
);
5883 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
5884 if (newrhs
== error_mark_node
)
5886 cp_error (" in evaluation of `%Q(%#T, %#T)'", modifycode
,
5887 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
5888 return error_mark_node
;
5892 /* Handle a cast used as an "lvalue".
5893 We have already performed any binary operator using the value as cast.
5894 Now convert the result to the cast type of the lhs,
5895 and then true type of the lhs and store it there;
5896 then convert result back to the cast type to be the value
5897 of the assignment. */
5899 switch (TREE_CODE (lhs
))
5904 case FIX_TRUNC_EXPR
:
5905 case FIX_FLOOR_EXPR
:
5906 case FIX_ROUND_EXPR
:
5908 if (TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
5909 || TREE_CODE (TREE_TYPE (newrhs
)) == FUNCTION_TYPE
5910 || TREE_CODE (TREE_TYPE (newrhs
)) == METHOD_TYPE
5911 || TREE_CODE (TREE_TYPE (newrhs
)) == OFFSET_TYPE
)
5912 newrhs
= default_conversion (newrhs
);
5914 tree inner_lhs
= TREE_OPERAND (lhs
, 0);
5917 /* WP 5.4.1: The result is an lvalue if T is a reference type,
5918 otherwise the result is an rvalue. */
5919 if (! lvalue_p (lhs
))
5920 pedwarn ("ANSI C++ forbids cast to non-reference type used as lvalue");
5922 result
= build_modify_expr (inner_lhs
, NOP_EXPR
,
5923 cp_convert (TREE_TYPE (inner_lhs
),
5924 cp_convert (lhstype
, newrhs
)));
5925 if (result
== error_mark_node
)
5927 return cp_convert (TREE_TYPE (lhs
), result
);
5934 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
5935 Reject anything strange now. */
5937 if (!lvalue_or_else (lhs
, "assignment"))
5938 return error_mark_node
;
5940 GNU_xref_assign (lhs
);
5942 /* Warn about storing in something that is `const'. */
5943 /* For C++, don't warn if this is initialization. */
5944 if (modifycode
!= INIT_EXPR
5945 /* For assignment to `const' signature pointer/reference fields,
5946 don't warn either, we already printed a better message before. */
5947 && ! (TREE_CODE (lhs
) == COMPONENT_REF
5948 && (IS_SIGNATURE_POINTER (TREE_TYPE (TREE_OPERAND (lhs
, 0)))
5949 || IS_SIGNATURE_REFERENCE (TREE_TYPE (TREE_OPERAND (lhs
, 0)))))
5950 && (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
5951 || ((TREE_CODE (lhstype
) == RECORD_TYPE
5952 || TREE_CODE (lhstype
) == UNION_TYPE
)
5953 && C_TYPE_FIELDS_READONLY (lhstype
))
5954 || (TREE_CODE (lhstype
) == REFERENCE_TYPE
5955 && TYPE_READONLY (TREE_TYPE (lhstype
)))))
5956 readonly_error (lhs
, "assignment", 0);
5958 /* If storing into a structure or union member,
5959 it has probably been given type `int'.
5960 Compute the type that would go with
5961 the actual amount of storage the member occupies. */
5963 if (TREE_CODE (lhs
) == COMPONENT_REF
5964 && (TREE_CODE (lhstype
) == INTEGER_TYPE
5965 || TREE_CODE (lhstype
) == REAL_TYPE
5966 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
5968 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
5970 /* If storing in a field that is in actuality a short or narrower
5971 than one, we must store in the field in its actual type. */
5973 if (lhstype
!= TREE_TYPE (lhs
))
5975 lhs
= copy_node (lhs
);
5976 TREE_TYPE (lhs
) = lhstype
;
5980 /* check to see if there is an assignment to `this' */
5981 if (lhs
== current_class_ptr
)
5983 if (flag_this_is_variable
> 0
5984 && DECL_NAME (current_function_decl
) != NULL_TREE
5985 && (DECL_NAME (current_function_decl
)
5986 != constructor_name (current_class_type
)))
5987 warning ("assignment to `this' not in constructor or destructor");
5988 current_function_just_assigned_this
= 1;
5991 /* The TREE_TYPE of RHS may be TYPE_UNKNOWN. This can happen
5992 when the type of RHS is not yet known, i.e. its type
5993 is inherited from LHS. */
5994 rhs
= require_instantiated_type (lhstype
, newrhs
, error_mark_node
);
5995 if (rhs
== error_mark_node
)
5996 return error_mark_node
;
5999 if (modifycode
!= INIT_EXPR
)
6001 /* Make modifycode now either a NOP_EXPR or an INIT_EXPR. */
6002 modifycode
= NOP_EXPR
;
6003 /* Reference-bashing */
6004 if (TREE_CODE (lhstype
) == REFERENCE_TYPE
)
6006 tree tmp
= convert_from_reference (lhs
);
6007 lhstype
= TREE_TYPE (tmp
);
6008 if (TYPE_SIZE (lhstype
) == 0)
6010 incomplete_type_error (lhs
, lhstype
);
6011 return error_mark_node
;
6016 if (TREE_CODE (TREE_TYPE (newrhs
)) == REFERENCE_TYPE
)
6018 tree tmp
= convert_from_reference (newrhs
);
6019 if (TYPE_SIZE (TREE_TYPE (tmp
)) == 0)
6021 incomplete_type_error (newrhs
, TREE_TYPE (tmp
));
6022 return error_mark_node
;
6028 if (TREE_SIDE_EFFECTS (lhs
))
6029 lhs
= stabilize_reference (lhs
);
6030 if (TREE_SIDE_EFFECTS (newrhs
))
6031 newrhs
= stabilize_reference (newrhs
);
6033 /* Convert new value to destination type. */
6035 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6039 if (! comptypes (lhstype
, TREE_TYPE (rhs
), 0))
6041 cp_error ("incompatible types in assignment of `%T' to `%T'",
6042 TREE_TYPE (rhs
), lhstype
);
6043 return error_mark_node
;
6046 /* Allow array assignment in compiler-generated code. */
6047 if (pedantic
&& ! DECL_ARTIFICIAL (current_function_decl
))
6048 pedwarn ("ANSI C++ forbids assignment of arrays");
6050 /* Have to wrap this in RTL_EXPR for two cases:
6051 in base or member initialization and if we
6052 are a branch of a ?: operator. Since we
6053 can't easily know the latter, just do it always. */
6055 result
= make_node (RTL_EXPR
);
6057 TREE_TYPE (result
) = void_type_node
;
6058 do_pending_stack_adjust ();
6059 start_sequence_for_rtl_expr (result
);
6061 /* As a matter of principle, `start_sequence' should do this. */
6064 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6065 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6066 expand_vec_init (lhs
, lhs
, array_type_nelts (lhstype
), newrhs
,
6069 do_pending_stack_adjust ();
6071 TREE_SIDE_EFFECTS (result
) = 1;
6072 RTL_EXPR_SEQUENCE (result
) = get_insns ();
6073 RTL_EXPR_RTL (result
) = const0_rtx
;
6078 if (modifycode
== INIT_EXPR
)
6080 newrhs
= convert_for_initialization (lhs
, lhstype
, newrhs
, LOOKUP_NORMAL
,
6081 "assignment", NULL_TREE
, 0);
6082 if (lhs
== DECL_RESULT (current_function_decl
))
6084 if (DECL_INITIAL (lhs
))
6085 warning ("return value from function receives multiple initializations");
6086 DECL_INITIAL (lhs
) = newrhs
;
6091 /* Avoid warnings on enum bit fields. */
6092 if (TREE_CODE (olhstype
) == ENUMERAL_TYPE
6093 && TREE_CODE (lhstype
) == INTEGER_TYPE
)
6095 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6097 newrhs
= convert_force (lhstype
, newrhs
, 0);
6100 newrhs
= convert_for_assignment (lhstype
, newrhs
, "assignment",
6102 if (TREE_CODE (newrhs
) == CALL_EXPR
6103 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6104 newrhs
= build_cplus_new (lhstype
, newrhs
);
6106 /* Can't initialize directly from a TARGET_EXPR, since that would
6107 cause the lhs to be constructed twice, and possibly result in
6108 accidental self-initialization. So we force the TARGET_EXPR to be
6109 expanded without a target. */
6110 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6111 newrhs
= build (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6112 TREE_OPERAND (newrhs
, 0));
6115 if (newrhs
== error_mark_node
)
6116 return error_mark_node
;
6118 if (TREE_CODE (newrhs
) == COND_EXPR
)
6121 tree cond
= TREE_OPERAND (newrhs
, 0);
6123 if (TREE_SIDE_EFFECTS (lhs
))
6124 cond
= build_compound_expr (tree_cons
6126 build_expr_list (NULL_TREE
, cond
)));
6128 /* Cannot have two identical lhs on this one tree (result) as preexpand
6129 calls will rip them out and fill in RTL for them, but when the
6130 rtl is generated, the calls will only be in the first side of the
6131 condition, not on both, or before the conditional jump! (mrs) */
6132 lhs1
= break_out_calls (lhs
);
6135 /* If there's no change, the COND_EXPR behaves like any other rhs. */
6136 result
= build (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6137 lhstype
, lhs
, newrhs
);
6140 tree result_type
= TREE_TYPE (newrhs
);
6141 /* We have to convert each arm to the proper type because the
6142 types may have been munged by constant folding. */
6144 = build (COND_EXPR
, result_type
, cond
,
6145 build_modify_expr (lhs
, modifycode
,
6146 cp_convert (result_type
,
6147 TREE_OPERAND (newrhs
, 1))),
6148 build_modify_expr (lhs1
, modifycode
,
6149 cp_convert (result_type
,
6150 TREE_OPERAND (newrhs
, 2))));
6154 result
= build (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6155 lhstype
, lhs
, newrhs
);
6157 TREE_SIDE_EFFECTS (result
) = 1;
6159 /* If we got the LHS in a different type for storing in,
6160 convert the result back to the nominal type of LHS
6161 so that the value we return always has the same type
6162 as the LHS argument. */
6164 if (olhstype
== TREE_TYPE (result
))
6166 /* Avoid warnings converting integral types back into enums
6167 for enum bit fields. */
6168 if (TREE_CODE (TREE_TYPE (result
)) == INTEGER_TYPE
6169 && TREE_CODE (olhstype
) == ENUMERAL_TYPE
)
6171 result
= build (COMPOUND_EXPR
, olhstype
, result
, olhs
);
6172 TREE_NO_UNUSED_WARNING (result
) = 1;
6175 return convert_for_assignment (olhstype
, result
, "assignment",
6180 build_x_modify_expr (lhs
, modifycode
, rhs
)
6182 enum tree_code modifycode
;
6185 if (processing_template_decl
)
6186 return build_min_nt (MODOP_EXPR
, lhs
,
6187 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6189 if (modifycode
!= NOP_EXPR
)
6191 tree rval
= build_opfncall (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6192 make_node (modifycode
));
6196 return build_modify_expr (lhs
, modifycode
, rhs
);
6199 /* Return 0 if EXP is not a valid lvalue in this language
6200 even though `lvalue_or_else' would accept it. */
6203 language_lvalue_valid (exp
)
6209 /* Get difference in deltas for different pointer to member function
6210 types. Return integer_zero_node, if FROM cannot be converted to a
6211 TO type. If FORCE is true, then allow reverse conversions as well. */
6214 get_delta_difference (from
, to
, force
)
6218 tree delta
= integer_zero_node
;
6224 /* Should get_base_distance here, so we can check if any thing along the
6225 path is virtual, and we need to make sure we stay
6226 inside the real binfos when going through virtual bases.
6227 Maybe we should replace virtual bases with
6228 binfo_member (...CLASSTYPE_VBASECLASSES...)... (mrs) */
6229 binfo
= get_binfo (from
, to
, 1);
6230 if (binfo
== error_mark_node
)
6232 error (" in pointer to member function conversion");
6239 error_not_base_type (from
, to
);
6240 error (" in pointer to member conversion");
6243 binfo
= get_binfo (to
, from
, 1);
6244 if (binfo
== 0 || binfo
== error_mark_node
)
6246 if (TREE_VIA_VIRTUAL (binfo
))
6248 binfo
= binfo_member (BINFO_TYPE (binfo
),
6249 CLASSTYPE_VBASECLASSES (from
));
6250 cp_warning ("pointer to member cast to virtual base `%T'",
6251 BINFO_TYPE (binfo
));
6252 warning (" will only work if you are very careful");
6254 delta
= BINFO_OFFSET (binfo
);
6255 delta
= cp_convert (ptrdiff_type_node
, delta
);
6257 return build_binary_op (MINUS_EXPR
,
6262 if (TREE_VIA_VIRTUAL (binfo
))
6266 cp_warning ("pointer to member cast from virtual base `%T'",
6267 BINFO_TYPE (binfo
));
6268 warning (" will only work if you are very careful");
6271 cp_error ("pointer to member conversion from virtual base `%T'",
6272 BINFO_TYPE (binfo
));
6275 return BINFO_OFFSET (binfo
);
6279 build_ptrmemfunc1 (type
, delta
, idx
, pfn
, delta2
)
6280 tree type
, delta
, idx
, pfn
, delta2
;
6285 /* This is the old way we did it. We want to avoid calling
6286 digest_init, so that it can give an error if we use { } when
6287 initializing a pointer to member function. */
6291 u
= build_nt (CONSTRUCTOR
, NULL_TREE
,
6292 expr_tree_cons (pfn_identifier
, pfn
, NULL_TREE
));
6296 u
= build_nt (CONSTRUCTOR
, NULL_TREE
,
6297 expr_tree_cons (delta2_identifier
, delta2
, NULL_TREE
));
6300 u
= build_nt (CONSTRUCTOR
, NULL_TREE
,
6301 expr_tree_cons (NULL_TREE
, delta
,
6302 expr_tree_cons (NULL_TREE
, idx
,
6303 expr_tree_cons (NULL_TREE
, u
, NULL_TREE
))));
6305 return digest_init (type
, u
, (tree
*)0);
6307 tree delta_field
, idx_field
, pfn_or_delta2_field
, pfn_field
, delta2_field
;
6309 int allconstant
, allsimple
;
6311 delta_field
= TYPE_FIELDS (type
);
6312 idx_field
= TREE_CHAIN (delta_field
);
6313 pfn_or_delta2_field
= TREE_CHAIN (idx_field
);
6314 subtype
= TREE_TYPE (pfn_or_delta2_field
);
6315 pfn_field
= TYPE_FIELDS (subtype
);
6316 delta2_field
= TREE_CHAIN (pfn_field
);
6320 allconstant
= TREE_CONSTANT (pfn
);
6321 allsimple
= !! initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
));
6322 u
= expr_tree_cons (pfn_field
, pfn
, NULL_TREE
);
6326 delta2
= convert_and_check (delta_type_node
, delta2
);
6327 allconstant
= TREE_CONSTANT (delta2
);
6328 allsimple
= !! initializer_constant_valid_p (delta2
, TREE_TYPE (delta2
));
6329 u
= expr_tree_cons (delta2_field
, delta2
, NULL_TREE
);
6332 delta
= convert_and_check (delta_type_node
, delta
);
6333 idx
= convert_and_check (delta_type_node
, idx
);
6335 allconstant
= allconstant
&& TREE_CONSTANT (delta
) && TREE_CONSTANT (idx
);
6336 allsimple
= allsimple
6337 && initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6338 && initializer_constant_valid_p (idx
, TREE_TYPE (idx
));
6340 u
= build (CONSTRUCTOR
, subtype
, NULL_TREE
, u
);
6341 u
= expr_tree_cons (delta_field
, delta
,
6342 expr_tree_cons (idx_field
, idx
,
6343 expr_tree_cons (pfn_or_delta2_field
, u
, NULL_TREE
)));
6344 u
= build (CONSTRUCTOR
, type
, NULL_TREE
, u
);
6345 TREE_CONSTANT (u
) = allconstant
;
6346 TREE_STATIC (u
) = allconstant
&& allsimple
;
6351 /* Build a constructor for a pointer to member function. It can be
6352 used to initialize global variables, local variable, or used
6353 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6356 If FORCE is non-zero, then force this conversion, even if
6357 we would rather not do it. Usually set when using an explicit
6360 Return error_mark_node, if something goes wrong. */
6363 build_ptrmemfunc (type
, pfn
, force
)
6367 tree idx
= integer_zero_node
;
6368 tree delta
= integer_zero_node
;
6369 tree delta2
= integer_zero_node
;
6371 tree npfn
= NULL_TREE
;
6373 /* Handle multiple conversions of pointer to member functions. */
6374 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (pfn
)))
6376 tree ndelta
, ndelta2
;
6380 /* Is is already the right type? */
6381 if (type
== TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (pfn
)))
6384 pfn_type
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (pfn
));
6386 && comp_target_types (type
, pfn_type
, 0) != 1)
6387 cp_error ("conversion to `%T' from `%T'", type
, pfn_type
);
6389 ndelta
= cp_convert (ptrdiff_type_node
, build_component_ref (pfn
, delta_identifier
, NULL_TREE
, 0));
6390 ndelta2
= cp_convert (ptrdiff_type_node
, DELTA2_FROM_PTRMEMFUNC (pfn
));
6391 idx
= build_component_ref (pfn
, index_identifier
, NULL_TREE
, 0);
6393 n
= get_delta_difference (TYPE_METHOD_BASETYPE (TREE_TYPE (pfn_type
)),
6394 TYPE_METHOD_BASETYPE (TREE_TYPE (type
)),
6397 delta
= build_binary_op (PLUS_EXPR
, ndelta
, n
, 1);
6398 delta2
= build_binary_op (PLUS_EXPR
, ndelta2
, n
, 1);
6399 e1
= fold (build (GT_EXPR
, boolean_type_node
, idx
, integer_zero_node
));
6401 e2
= build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type
), delta
, idx
,
6404 pfn
= PFN_FROM_PTRMEMFUNC (pfn
);
6405 npfn
= build1 (NOP_EXPR
, type
, pfn
);
6406 TREE_CONSTANT (npfn
) = TREE_CONSTANT (pfn
);
6408 e3
= build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type
), delta
, idx
, npfn
,
6410 return build_conditional_expr (e1
, e2
, e3
);
6413 /* Handle null pointer to member function conversions. */
6414 if (integer_zerop (pfn
))
6416 pfn
= build_c_cast (type
, integer_zero_node
);
6417 return build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type
),
6418 integer_zero_node
, integer_zero_node
,
6422 if (TREE_CODE (pfn
) == TREE_LIST
6423 || (TREE_CODE (pfn
) == ADDR_EXPR
6424 && TREE_CODE (TREE_OPERAND (pfn
, 0)) == TREE_LIST
))
6425 return instantiate_type (type
, pfn
, 1);
6428 && comp_target_types (type
, TREE_TYPE (pfn
), 0) != 1)
6429 cp_error ("conversion to `%T' from `%T'", type
, TREE_TYPE (pfn
));
6431 /* Allow pointer to member conversions here. */
6432 delta
= get_delta_difference (TYPE_METHOD_BASETYPE (TREE_TYPE (TREE_TYPE (pfn
))),
6433 TYPE_METHOD_BASETYPE (TREE_TYPE (type
)),
6435 delta2
= build_binary_op (PLUS_EXPR
, delta2
, delta
, 1);
6437 if (TREE_CODE (TREE_OPERAND (pfn
, 0)) != FUNCTION_DECL
)
6438 warning ("assuming pointer to member function is non-virtual");
6440 if (TREE_CODE (TREE_OPERAND (pfn
, 0)) == FUNCTION_DECL
6441 && DECL_VINDEX (TREE_OPERAND (pfn
, 0)))
6443 /* Find the offset to the vfield pointer in the object. */
6444 vfield_offset
= get_binfo (DECL_CONTEXT (TREE_OPERAND (pfn
, 0)),
6445 DECL_CLASS_CONTEXT (TREE_OPERAND (pfn
, 0)),
6447 vfield_offset
= get_vfield_offset (vfield_offset
);
6448 delta2
= size_binop (PLUS_EXPR
, vfield_offset
, delta2
);
6450 /* Map everything down one to make room for the null pointer to member. */
6451 idx
= size_binop (PLUS_EXPR
,
6452 DECL_VINDEX (TREE_OPERAND (pfn
, 0)),
6457 idx
= size_binop (MINUS_EXPR
, integer_zero_node
, integer_one_node
);
6459 if (type
== TREE_TYPE (pfn
))
6465 npfn
= build1 (NOP_EXPR
, type
, pfn
);
6466 TREE_CONSTANT (npfn
) = TREE_CONSTANT (pfn
);
6470 return build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type
), delta
, idx
, npfn
, delta2
);
6473 /* Convert value RHS to type TYPE as preparation for an assignment
6474 to an lvalue of type TYPE.
6475 The real work of conversion is done by `convert'.
6476 The purpose of this function is to generate error messages
6477 for assignments that are not allowed in C.
6478 ERRTYPE is a string to use in error messages:
6479 "assignment", "return", etc.
6481 C++: attempts to allow `convert' to find conversions involving
6482 implicit type conversion between aggregate and scalar types
6483 as per 8.5.6 of C++ manual. Does not randomly dereference
6484 pointers to aggregates! */
6487 convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
)
6493 register enum tree_code codel
= TREE_CODE (type
);
6494 register tree rhstype
;
6495 register enum tree_code coder
= TREE_CODE (TREE_TYPE (rhs
));
6497 if (coder
== UNKNOWN_TYPE
)
6498 rhs
= instantiate_type (type
, rhs
, 1);
6500 if (coder
== ERROR_MARK
)
6501 return error_mark_node
;
6503 if (codel
== OFFSET_TYPE
)
6505 type
= TREE_TYPE (type
);
6506 codel
= TREE_CODE (type
);
6509 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6510 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
6511 rhs
= TREE_OPERAND (rhs
, 0);
6513 if (rhs
== error_mark_node
)
6514 return error_mark_node
;
6516 if (TREE_VALUE (rhs
) == error_mark_node
)
6517 return error_mark_node
;
6519 if (TREE_CODE (TREE_TYPE (rhs
)) == OFFSET_TYPE
)
6521 rhs
= resolve_offset_ref (rhs
);
6522 if (rhs
== error_mark_node
)
6523 return error_mark_node
;
6524 rhstype
= TREE_TYPE (rhs
);
6525 coder
= TREE_CODE (rhstype
);
6528 if (TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
6529 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
6530 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
6531 rhs
= default_conversion (rhs
);
6532 else if (TREE_CODE (TREE_TYPE (rhs
)) == REFERENCE_TYPE
)
6533 rhs
= convert_from_reference (rhs
);
6535 rhstype
= TREE_TYPE (rhs
);
6536 coder
= TREE_CODE (rhstype
);
6538 /* This should no longer change types on us. */
6539 if (TREE_CODE (rhs
) == CONST_DECL
)
6540 rhs
= DECL_INITIAL (rhs
);
6541 else if (TREE_READONLY_DECL_P (rhs
))
6542 rhs
= decl_constant_value (rhs
);
6544 if (type
== rhstype
)
6546 overflow_warning (rhs
);
6550 if (coder
== VOID_TYPE
)
6552 error ("void value not ignored as it ought to be");
6553 return error_mark_node
;
6555 /* Arithmetic types all interconvert. */
6556 if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
|| codel
== BOOLEAN_TYPE
6557 || codel
== COMPLEX_TYPE
)
6558 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
|| coder
== BOOLEAN_TYPE
6559 || coder
== COMPLEX_TYPE
))
6561 /* But we should warn if assigning REAL_TYPE to INTEGER_TYPE. */
6562 if (coder
== REAL_TYPE
&& codel
== INTEGER_TYPE
)
6565 cp_warning ("`%T' used for argument %P of `%D'",
6566 rhstype
, parmnum
, fndecl
);
6568 cp_warning ("%s to `%T' from `%T'", errtype
, type
, rhstype
);
6570 /* And we should warn if assigning a negative value to
6571 an unsigned variable. */
6572 else if (TREE_UNSIGNED (type
) && codel
!= BOOLEAN_TYPE
)
6574 if (TREE_CODE (rhs
) == INTEGER_CST
6575 && TREE_NEGATED_INT (rhs
))
6578 cp_warning ("negative value `%E' passed as argument %P of `%D'",
6579 rhs
, parmnum
, fndecl
);
6581 cp_warning ("%s of negative value `%E' to `%T'",
6582 errtype
, rhs
, type
);
6584 overflow_warning (rhs
);
6585 if (TREE_CONSTANT (rhs
))
6589 return convert_and_check (type
, rhs
);
6591 /* Conversions involving enums. */
6592 else if ((codel
== ENUMERAL_TYPE
6593 && (INTEGRAL_CODE_P (coder
) || coder
== REAL_TYPE
))
6594 || (coder
== ENUMERAL_TYPE
6595 && (INTEGRAL_CODE_P (codel
) || codel
== REAL_TYPE
)))
6597 return ocp_convert (type
, rhs
, CONV_IMPLICIT
, LOOKUP_NORMAL
);
6599 /* Conversions among pointers */
6600 else if (codel
== POINTER_TYPE
6601 && (coder
== POINTER_TYPE
6602 || (coder
== RECORD_TYPE
6603 && (IS_SIGNATURE_POINTER (rhstype
)
6604 || IS_SIGNATURE_REFERENCE (rhstype
)))))
6606 register tree ttl
= TREE_TYPE (type
);
6610 if (coder
== RECORD_TYPE
)
6612 rhs
= build_optr_ref (rhs
);
6613 rhstype
= TREE_TYPE (rhs
);
6615 ttr
= TREE_TYPE (rhstype
);
6617 /* If both pointers are of aggregate type, then we
6618 can give better error messages, and save some work
6620 if (TREE_CODE (ttl
) == RECORD_TYPE
&& TREE_CODE (ttr
) == RECORD_TYPE
)
6624 if (TYPE_MAIN_VARIANT (ttl
) == TYPE_MAIN_VARIANT (ttr
)
6625 || type
== class_star_type_node
6626 || rhstype
== class_star_type_node
)
6627 binfo
= TYPE_BINFO (ttl
);
6629 binfo
= get_binfo (ttl
, ttr
, 1);
6631 if (binfo
== error_mark_node
)
6632 return error_mark_node
;
6634 return error_not_base_type (ttl
, ttr
);
6636 if (! TYPE_READONLY (ttl
) && TYPE_READONLY (ttr
))
6639 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6640 rhstype
, parmnum
, fndecl
);
6642 cp_pedwarn ("%s to `%T' from `%T' discards const",
6643 errtype
, type
, rhstype
);
6645 if (! TYPE_VOLATILE (ttl
) && TYPE_VOLATILE (ttr
))
6648 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6649 rhstype
, parmnum
, fndecl
);
6651 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6652 errtype
, type
, rhstype
);
6656 /* Any non-function converts to a [const][volatile] void *
6657 and vice versa; otherwise, targets must be the same.
6658 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
6659 else if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
6660 || TYPE_MAIN_VARIANT (ttr
) == void_type_node
6661 || (ctt
= comp_target_types (type
, rhstype
, 1))
6662 || (unsigned_type (TYPE_MAIN_VARIANT (ttl
))
6663 == unsigned_type (TYPE_MAIN_VARIANT (ttr
))))
6665 /* ARM $4.8, commentary on p39. */
6666 if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
6667 && TREE_CODE (ttr
) == OFFSET_TYPE
)
6669 cp_error ("no standard conversion from `%T' to `void *'", ttr
);
6670 return error_mark_node
;
6673 if (ctt
< 0 && TYPE_MAIN_VARIANT (ttl
) != TYPE_MAIN_VARIANT (ttr
))
6674 cp_pedwarn ("converting `%T' to `%T' is a contravariance violation",
6677 if (TYPE_MAIN_VARIANT (ttl
) != void_type_node
6678 && TYPE_MAIN_VARIANT (ttr
) == void_type_node
6679 && ! null_ptr_cst_p (rhs
))
6681 if (coder
== RECORD_TYPE
)
6682 cp_pedwarn ("implicit conversion of signature pointer to type `%T'",
6685 pedwarn ("ANSI C++ forbids implicit conversion from `void *' in %s",
6688 /* Const and volatile mean something different for function types,
6689 so the usual warnings are not appropriate. */
6690 else if ((TREE_CODE (ttr
) != FUNCTION_TYPE
&& TREE_CODE (ttr
) != METHOD_TYPE
)
6691 || (TREE_CODE (ttl
) != FUNCTION_TYPE
&& TREE_CODE (ttl
) != METHOD_TYPE
))
6693 if (TREE_CODE (ttl
) == OFFSET_TYPE
6694 && binfo_member (TYPE_OFFSET_BASETYPE (ttr
),
6695 CLASSTYPE_VBASECLASSES (TYPE_OFFSET_BASETYPE (ttl
))))
6697 sorry ("%s between pointer to members converting across virtual baseclasses", errtype
);
6698 return error_mark_node
;
6700 else if (! TYPE_READONLY (ttl
) && TYPE_READONLY (ttr
))
6703 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6704 rhstype
, parmnum
, fndecl
);
6706 cp_pedwarn ("%s to `%T' from `%T' discards const",
6707 errtype
, type
, rhstype
);
6709 else if (! TYPE_VOLATILE (ttl
) && TYPE_VOLATILE (ttr
))
6712 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6713 rhstype
, parmnum
, fndecl
);
6715 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6716 errtype
, type
, rhstype
);
6718 else if (TREE_CODE (ttl
) == TREE_CODE (ttr
)
6719 && ! comp_target_types (type
, rhstype
, 1))
6722 cp_pedwarn ("passing `%T' as argument %P of `%D' changes signedness",
6723 rhstype
, parmnum
, fndecl
);
6725 cp_pedwarn ("%s to `%T' from `%T' changes signedness",
6726 errtype
, type
, rhstype
);
6732 int add_quals
= 0, const_parity
= 0, volatile_parity
= 0;
6734 int unsigned_parity
;
6737 /* This code is basically a duplicate of comp_ptr_ttypes_real. */
6738 for (; ; ttl
= TREE_TYPE (ttl
), ttr
= TREE_TYPE (ttr
))
6741 const_parity
|= (TYPE_READONLY (ttl
) < TYPE_READONLY (ttr
));
6742 volatile_parity
|= (TYPE_VOLATILE (ttl
) < TYPE_VOLATILE (ttr
));
6745 && (TYPE_READONLY (ttl
) > TYPE_READONLY (ttr
)
6746 || TYPE_VOLATILE (ttl
) > TYPE_VOLATILE (ttr
)))
6748 left_const
&= TYPE_READONLY (ttl
);
6750 if (TREE_CODE (ttl
) != POINTER_TYPE
6751 || TREE_CODE (ttr
) != POINTER_TYPE
)
6754 unsigned_parity
= TREE_UNSIGNED (ttl
) - TREE_UNSIGNED (ttr
);
6755 if (unsigned_parity
)
6757 if (TREE_UNSIGNED (ttl
))
6758 ttr
= unsigned_type (ttr
);
6760 ttl
= unsigned_type (ttl
);
6763 if (comp_target_types (ttl
, ttr
, nptrs
) > 0)
6768 cp_pedwarn ("passing `%T' as argument %P of `%D' adds cv-quals without intervening `const'",
6769 rhstype
, parmnum
, fndecl
);
6771 cp_pedwarn ("%s to `%T' from `%T' adds cv-quals without intervening `const'",
6772 errtype
, type
, rhstype
);
6777 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6778 rhstype
, parmnum
, fndecl
);
6780 cp_pedwarn ("%s to `%T' from `%T' discards const",
6781 errtype
, type
, rhstype
);
6783 if (volatile_parity
)
6786 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6787 rhstype
, parmnum
, fndecl
);
6789 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6790 errtype
, type
, rhstype
);
6792 if (unsigned_parity
> 0)
6795 cp_pedwarn ("passing `%T' as argument %P of `%D' changes signed to unsigned",
6796 rhstype
, parmnum
, fndecl
);
6798 cp_pedwarn ("%s to `%T' from `%T' changes signed to unsigned",
6799 errtype
, type
, rhstype
);
6801 else if (unsigned_parity
< 0)
6804 cp_pedwarn ("passing `%T' as argument %P of `%D' changes unsigned to signed",
6805 rhstype
, parmnum
, fndecl
);
6807 cp_pedwarn ("%s to `%T' from `%T' changes unsigned to signed",
6808 errtype
, type
, rhstype
);
6811 /* C++ is not so friendly about converting function and
6812 member function pointers as C. Emit warnings here. */
6813 if (TREE_CODE (ttl
) == FUNCTION_TYPE
6814 || TREE_CODE (ttl
) == METHOD_TYPE
)
6815 if (! comptypes (ttl
, ttr
, 0))
6817 warning ("conflicting function types in %s:", errtype
);
6818 cp_warning ("\t`%T' != `%T'", type
, rhstype
);
6824 cp_error ("passing `%T' as argument %P of `%D'",
6825 rhstype
, parmnum
, fndecl
);
6827 cp_error ("%s to `%T' from `%T'", errtype
, type
, rhstype
);
6828 return error_mark_node
;
6831 return cp_convert (type
, rhs
);
6833 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
6835 /* An explicit constant 0 can convert to a pointer,
6836 but not a 0 that results from casting or folding. */
6837 if (! (TREE_CODE (rhs
) == INTEGER_CST
&& integer_zerop (rhs
)))
6840 cp_pedwarn ("passing `%T' to argument %P of `%D' lacks a cast",
6841 rhstype
, parmnum
, fndecl
);
6843 cp_pedwarn ("%s to `%T' from `%T' lacks a cast",
6844 errtype
, type
, rhstype
);
6846 return cp_convert (type
, rhs
);
6848 else if (codel
== INTEGER_TYPE
6849 && (coder
== POINTER_TYPE
6850 || (coder
== RECORD_TYPE
6851 && (IS_SIGNATURE_POINTER (rhstype
)
6852 || TYPE_PTRMEMFUNC_FLAG (rhstype
)
6853 || IS_SIGNATURE_REFERENCE (rhstype
)))))
6856 cp_pedwarn ("passing `%T' to argument %P of `%D' lacks a cast",
6857 rhstype
, parmnum
, fndecl
);
6859 cp_pedwarn ("%s to `%T' from `%T' lacks a cast",
6860 errtype
, type
, rhstype
);
6861 return cp_convert (type
, rhs
);
6863 else if (codel
== BOOLEAN_TYPE
6864 && (coder
== POINTER_TYPE
6865 || (coder
== RECORD_TYPE
6866 && (IS_SIGNATURE_POINTER (rhstype
)
6867 || TYPE_PTRMEMFUNC_FLAG (rhstype
)
6868 || IS_SIGNATURE_REFERENCE (rhstype
)))))
6869 return cp_convert (type
, rhs
);
6872 else if (((coder
== POINTER_TYPE
6873 && TREE_CODE (TREE_TYPE (rhstype
)) == METHOD_TYPE
)
6874 || integer_zerop (rhs
)
6875 || TYPE_PTRMEMFUNC_P (rhstype
))
6876 && TYPE_PTRMEMFUNC_P (type
))
6878 tree ttl
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
6879 tree ttr
= (TREE_CODE (rhstype
) == POINTER_TYPE
? rhstype
6880 : TYPE_PTRMEMFUNC_FN_TYPE (type
));
6881 int ctt
= comp_target_types (ttl
, ttr
, 1);
6884 cp_pedwarn ("converting `%T' to `%T' is a contravariance violation",
6887 cp_error ("%s to `%T' from `%T'", errtype
, ttl
, ttr
);
6889 /* compatible pointer to member functions. */
6890 return build_ptrmemfunc (ttl
, rhs
, 0);
6892 else if (codel
== ERROR_MARK
|| coder
== ERROR_MARK
)
6893 return error_mark_node
;
6895 /* This should no longer happen. References are initialized via
6896 `convert_for_initialization'. They should otherwise be
6897 bashed before coming here. */
6898 else if (codel
== REFERENCE_TYPE
)
6899 my_friendly_abort (317);
6900 else if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (TREE_TYPE (rhs
)))
6902 tree nrhs
= build1 (NOP_EXPR
, type
, rhs
);
6903 TREE_CONSTANT (nrhs
) = TREE_CONSTANT (rhs
);
6906 else if (TYPE_HAS_CONSTRUCTOR (type
) || IS_AGGR_TYPE (TREE_TYPE (rhs
)))
6907 return cp_convert (type
, rhs
);
6908 /* Handle anachronistic conversions from (::*)() to cv void* or (*)(). */
6909 else if (TREE_CODE (type
) == POINTER_TYPE
6910 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6911 || TYPE_MAIN_VARIANT (TREE_TYPE (type
)) == void_type_node
)
6913 && TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
6914 return cp_convert (type
, rhs
);
6916 cp_error ("%s to `%T' from `%T'", errtype
, type
, rhstype
);
6917 return error_mark_node
;
6920 /* Convert RHS to be of type TYPE. If EXP is non-zero,
6921 it is the target of the initialization.
6922 ERRTYPE is a string to use in error messages.
6924 Two major differences between the behavior of
6925 `convert_for_assignment' and `convert_for_initialization'
6926 are that references are bashed in the former, while
6927 copied in the latter, and aggregates are assigned in
6928 the former (operator=) while initialized in the
6931 If using constructor make sure no conversion operator exists, if one does
6932 exist, an ambiguity exists.
6934 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6937 convert_for_initialization (exp
, type
, rhs
, flags
, errtype
, fndecl
, parmnum
)
6938 tree exp
, type
, rhs
;
6944 register enum tree_code codel
= TREE_CODE (type
);
6945 register tree rhstype
;
6946 register enum tree_code coder
;
6948 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6949 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6950 if (TREE_CODE (rhs
) == NOP_EXPR
6951 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
6952 && codel
!= REFERENCE_TYPE
)
6953 rhs
= TREE_OPERAND (rhs
, 0);
6955 if (rhs
== error_mark_node
6956 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
6957 return error_mark_node
;
6959 if (TREE_CODE (TREE_TYPE (rhs
)) == OFFSET_TYPE
)
6961 rhs
= resolve_offset_ref (rhs
);
6962 if (rhs
== error_mark_node
)
6963 return error_mark_node
;
6966 if (TREE_CODE (TREE_TYPE (rhs
)) == REFERENCE_TYPE
)
6967 rhs
= convert_from_reference (rhs
);
6969 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
6970 && TREE_CODE (type
) != ARRAY_TYPE
6971 && (TREE_CODE (type
) != REFERENCE_TYPE
6972 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
6973 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
6974 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
6975 rhs
= default_conversion (rhs
);
6977 rhstype
= TREE_TYPE (rhs
);
6978 coder
= TREE_CODE (rhstype
);
6980 if (coder
== UNKNOWN_TYPE
)
6982 rhs
= instantiate_type (type
, rhs
, 1);
6983 rhstype
= TREE_TYPE (rhs
);
6984 coder
= TREE_CODE (rhstype
);
6987 if (coder
== ERROR_MARK
)
6988 return error_mark_node
;
6990 /* We accept references to incomplete types, so we can
6991 return here before checking if RHS is of complete type. */
6993 if (codel
== REFERENCE_TYPE
)
6995 /* This should eventually happen in convert_arguments. */
6996 extern int warningcount
, errorcount
;
6997 int savew
= 0, savee
= 0;
7000 savew
= warningcount
, savee
= errorcount
;
7001 rhs
= convert_to_reference (type
, rhs
, CONV_IMPLICIT
, flags
,
7002 exp
? exp
: error_mark_node
);
7005 if (warningcount
> savew
)
7006 cp_warning_at ("in passing argument %P of `%+D'", parmnum
, fndecl
);
7007 else if (errorcount
> savee
)
7008 cp_error_at ("in passing argument %P of `%+D'", parmnum
, fndecl
);
7013 rhs
= require_complete_type (rhs
);
7014 if (rhs
== error_mark_node
)
7015 return error_mark_node
;
7017 if (exp
!= 0) exp
= require_complete_type (exp
);
7018 if (exp
== error_mark_node
)
7019 return error_mark_node
;
7021 if (TREE_CODE (rhstype
) == REFERENCE_TYPE
)
7022 rhstype
= TREE_TYPE (rhstype
);
7024 type
= complete_type (type
);
7026 if (TYPE_LANG_SPECIFIC (type
)
7027 && (IS_SIGNATURE_POINTER (type
) || IS_SIGNATURE_REFERENCE (type
)))
7028 return build_signature_pointer_constructor (type
, rhs
);
7030 if (IS_AGGR_TYPE (type
))
7031 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7033 if (type
== TREE_TYPE (rhs
))
7035 if (TREE_READONLY_DECL_P (rhs
))
7036 rhs
= decl_constant_value (rhs
);
7040 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
);
7043 /* Expand an ASM statement with operands, handling output operands
7044 that are not variables or INDIRECT_REFS by transforming such
7045 cases into cases that expand_asm_operands can handle.
7047 Arguments are same as for expand_asm_operands.
7049 We don't do default conversions on all inputs, because it can screw
7050 up operands that are expected to be in memory. */
7053 c_expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
)
7054 tree string
, outputs
, inputs
, clobbers
;
7059 int noutputs
= list_length (outputs
);
7061 /* o[I] is the place that output number I should be written. */
7062 register tree
*o
= (tree
*) alloca (noutputs
* sizeof (tree
));
7065 /* Record the contents of OUTPUTS before it is modified. */
7066 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
7067 o
[i
] = TREE_VALUE (tail
);
7069 /* Generate the ASM_OPERANDS insn;
7070 store into the TREE_VALUEs of OUTPUTS some trees for
7071 where the values were actually stored. */
7072 expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
);
7074 /* Copy all the intermediate outputs into the specified outputs. */
7075 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
7077 if (o
[i
] != TREE_VALUE (tail
))
7079 expand_expr (build_modify_expr (o
[i
], NOP_EXPR
, TREE_VALUE (tail
)),
7080 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
7083 /* Detect modification of read-only values.
7084 (Otherwise done by build_modify_expr.) */
7087 tree type
= TREE_TYPE (o
[i
]);
7088 if (TYPE_READONLY (type
)
7089 || ((TREE_CODE (type
) == RECORD_TYPE
7090 || TREE_CODE (type
) == UNION_TYPE
)
7091 && C_TYPE_FIELDS_READONLY (type
)))
7092 readonly_error (o
[i
], "modification by `asm'", 1);
7096 /* Those MODIFY_EXPRs could do autoincrements. */
7100 /* Expand a C `return' statement.
7101 RETVAL is the expression for what to return,
7102 or a null pointer for `return;' with no value.
7104 C++: upon seeing a `return', we must call destructors on all
7105 variables in scope which had constructors called on them.
7106 This means that if in a destructor, the base class destructors
7107 must be called before returning.
7109 The RETURN statement in C++ has initialization semantics. */
7112 c_expand_return (retval
)
7115 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
7116 extern tree dtor_label
, ctor_label
;
7117 tree result
= DECL_RESULT (current_function_decl
);
7118 tree valtype
= TREE_TYPE (result
);
7120 if (TREE_THIS_VOLATILE (current_function_decl
))
7121 warning ("function declared `noreturn' has a `return' statement");
7123 if (retval
== error_mark_node
)
7125 current_function_returns_null
= 1;
7129 if (processing_template_decl
)
7131 add_tree (build_min_nt (RETURN_STMT
, retval
));
7135 if (retval
== NULL_TREE
)
7137 /* A non-named return value does not count. */
7139 /* Can't just return from a destructor. */
7142 expand_goto (dtor_label
);
7146 if (DECL_CONSTRUCTOR_P (current_function_decl
))
7147 retval
= current_class_ptr
;
7148 else if (DECL_NAME (result
) != NULL_TREE
7149 && TREE_CODE (valtype
) != VOID_TYPE
)
7153 current_function_returns_null
= 1;
7155 if (valtype
!= NULL_TREE
&& TREE_CODE (valtype
) != VOID_TYPE
)
7157 if (DECL_NAME (DECL_RESULT (current_function_decl
)) == NULL_TREE
)
7159 pedwarn ("`return' with no value, in function returning non-void");
7160 /* Clear this, so finish_function won't say that we
7161 reach the end of a non-void function (which we don't,
7162 we gave a return!). */
7163 current_function_returns_null
= 0;
7167 expand_null_return ();
7171 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
7172 && retval
!= current_class_ptr
)
7174 if (flag_this_is_variable
)
7175 error ("return from a constructor: use `this = ...' instead");
7177 error ("return from a constructor");
7178 retval
= current_class_ptr
;
7181 /* Effective C++ rule 15. See also start_function. */
7183 && DECL_NAME (current_function_decl
) == ansi_opname
[(int) MODIFY_EXPR
]
7184 && retval
!= current_class_ref
)
7185 cp_warning ("`operator=' should return a reference to `*this'");
7187 if (valtype
== NULL_TREE
|| TREE_CODE (valtype
) == VOID_TYPE
)
7189 current_function_returns_null
= 1;
7190 if ((pedantic
&& ! DECL_ARTIFICIAL (current_function_decl
))
7191 || TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
7192 pedwarn ("`return' with a value, in function returning void");
7193 expand_return (retval
);
7197 /* Now deal with possible C++ hair:
7198 (1) Compute the return value.
7199 (2) If there are aggregate values with destructors which
7200 must be cleaned up, clean them (taking care
7201 not to clobber the return value).
7202 (3) If an X(X&) constructor is defined, the return
7203 value must be returned via that. */
7205 if (retval
== result
7206 || DECL_CONSTRUCTOR_P (current_function_decl
))
7207 /* It's already done for us. */;
7208 else if (TREE_TYPE (retval
) == void_type_node
)
7210 pedwarn ("return of void value in function returning non-void");
7211 expand_expr_stmt (retval
);
7216 retval
= convert_for_initialization
7217 (NULL_TREE
, valtype
, retval
, LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
,
7218 "return", NULL_TREE
, 0);
7220 if (retval
== error_mark_node
)
7222 /* Avoid warning about control reaching end of function. */
7223 expand_null_return ();
7227 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7228 else if (! current_function_returns_struct
7229 && TREE_CODE (retval
) == TARGET_EXPR
7230 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7231 retval
= build (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7232 TREE_OPERAND (retval
, 0));
7234 /* Add some useful error checking for C++. */
7235 else if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7237 tree whats_returned
;
7239 /* Sort through common things to see what it is
7240 we are returning. */
7241 whats_returned
= retval
;
7242 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7244 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7245 if (TREE_CODE (whats_returned
) == ADDR_EXPR
)
7246 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7248 while (TREE_CODE (whats_returned
) == CONVERT_EXPR
7249 || TREE_CODE (whats_returned
) == NOP_EXPR
)
7250 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7251 if (TREE_CODE (whats_returned
) == ADDR_EXPR
)
7253 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7254 while (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7255 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7257 /* Get the target. */
7258 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7259 warning ("returning reference to temporary");
7263 if (TREE_CODE (whats_returned
) == VAR_DECL
&& DECL_NAME (whats_returned
))
7265 if (TEMP_NAME_P (DECL_NAME (whats_returned
)))
7266 warning ("reference to non-lvalue returned");
7267 else if (TREE_CODE (TREE_TYPE (whats_returned
)) != REFERENCE_TYPE
7268 && ! TREE_STATIC (whats_returned
)
7269 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (whats_returned
))
7270 && !TREE_PUBLIC (whats_returned
))
7271 cp_warning_at ("reference to local variable `%D' returned", whats_returned
);
7274 else if (TREE_CODE (retval
) == ADDR_EXPR
)
7276 tree whats_returned
= TREE_OPERAND (retval
, 0);
7278 if (TREE_CODE (whats_returned
) == VAR_DECL
7279 && DECL_NAME (whats_returned
)
7280 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (whats_returned
))
7281 && !TREE_STATIC (whats_returned
)
7282 && !TREE_PUBLIC (whats_returned
))
7283 cp_warning_at ("address of local variable `%D' returned", whats_returned
);
7287 if (retval
!= NULL_TREE
7288 && TREE_CODE_CLASS (TREE_CODE (retval
)) == 'd'
7289 && cond_stack
== 0 && loop_stack
== 0 && case_stack
== 0)
7290 current_function_return_value
= retval
;
7292 if (ctor_label
&& TREE_CODE (ctor_label
) != ERROR_MARK
)
7294 /* Here RETVAL is CURRENT_CLASS_PTR, so there's nothing to do. */
7295 expand_goto (ctor_label
);
7298 if (retval
&& retval
!= result
)
7300 result
= build (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7301 TREE_SIDE_EFFECTS (result
) = 1;
7304 expand_start_target_temps ();
7306 expand_return (result
);
7308 expand_end_target_temps ();
7310 current_function_returns_value
= 1;
7313 /* Start a C switch statement, testing expression EXP.
7314 Return EXP if it is valid, an error node otherwise. */
7317 c_expand_start_case (exp
)
7321 register enum tree_code code
;
7323 /* Convert from references, etc. */
7324 exp
= default_conversion (exp
);
7325 type
= TREE_TYPE (exp
);
7326 code
= TREE_CODE (type
);
7328 if (IS_AGGR_TYPE_CODE (code
))
7329 exp
= build_type_conversion (CONVERT_EXPR
, integer_type_node
, exp
, 1);
7331 if (exp
== NULL_TREE
)
7333 error ("switch quantity not an integer");
7334 exp
= error_mark_node
;
7336 type
= TREE_TYPE (exp
);
7337 code
= TREE_CODE (type
);
7339 if (code
!= INTEGER_TYPE
&& code
!= ENUMERAL_TYPE
&& code
!= ERROR_MARK
)
7341 error ("switch quantity not an integer");
7342 exp
= error_mark_node
;
7348 exp
= default_conversion (exp
);
7349 type
= TREE_TYPE (exp
);
7350 idx
= get_unwidened (exp
, 0);
7351 /* We can't strip a conversion from a signed type to an unsigned,
7352 because if we did, int_fits_type_p would do the wrong thing
7353 when checking case values for being in range,
7354 and it's too hard to do the right thing. */
7355 if (TREE_UNSIGNED (TREE_TYPE (exp
))
7356 == TREE_UNSIGNED (TREE_TYPE (idx
)))
7361 (1, fold (build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
)),
7362 type
, "switch statement");
7367 /* CONSTP remembers whether or not all the intervening pointers in the `to'
7368 type have been const. */
7371 comp_ptr_ttypes_real (to
, from
, constp
)
7375 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7377 if (TREE_CODE (to
) != TREE_CODE (from
))
7380 if (TREE_CODE (from
) == OFFSET_TYPE
7381 && comptypes (TYPE_OFFSET_BASETYPE (from
),
7382 TYPE_OFFSET_BASETYPE (to
), 1))
7385 /* Const and volatile mean something different for function types,
7386 so the usual checks are not appropriate. */
7387 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7389 if (TYPE_READONLY (from
) > TYPE_READONLY (to
)
7390 || TYPE_VOLATILE (from
) > TYPE_VOLATILE (to
))
7394 && (TYPE_READONLY (to
) > TYPE_READONLY (from
)
7395 || TYPE_VOLATILE (to
) > TYPE_READONLY (from
)))
7397 constp
&= TYPE_READONLY (to
);
7400 if (TREE_CODE (to
) != POINTER_TYPE
)
7401 return comptypes (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
), 1);
7405 /* When comparing, say, char ** to char const **, this function takes the
7406 'char *' and 'char const *'. Do not pass non-pointer types to this
7410 comp_ptr_ttypes (to
, from
)
7413 return comp_ptr_ttypes_real (to
, from
, 1);
7416 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7417 type or inheritance-related types, regardless of cv-quals. */
7420 ptr_reasonably_similar (to
, from
)
7423 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7425 if (TREE_CODE (to
) != TREE_CODE (from
))
7428 if (TREE_CODE (from
) == OFFSET_TYPE
7429 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7430 TYPE_OFFSET_BASETYPE (from
), -1))
7433 if (TREE_CODE (to
) != POINTER_TYPE
)
7435 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
), -1);
7439 /* Like comp_ptr_ttypes, for const_cast. */
7442 comp_ptr_ttypes_const (to
, from
)
7445 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7447 if (TREE_CODE (to
) != TREE_CODE (from
))
7450 if (TREE_CODE (from
) == OFFSET_TYPE
7451 && comptypes (TYPE_OFFSET_BASETYPE (from
),
7452 TYPE_OFFSET_BASETYPE (to
), 1))
7455 if (TREE_CODE (to
) != POINTER_TYPE
)
7456 return comptypes (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
), 1);
7460 /* Like comp_ptr_ttypes, for reinterpret_cast. */
7463 comp_ptr_ttypes_reinterpret (to
, from
)
7468 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7470 if (TREE_CODE (from
) == OFFSET_TYPE
)
7471 from
= TREE_TYPE (from
);
7472 if (TREE_CODE (to
) == OFFSET_TYPE
)
7473 to
= TREE_TYPE (to
);
7475 if (TREE_CODE (to
) != TREE_CODE (from
))
7478 /* Const and volatile mean something different for function types,
7479 so the usual checks are not appropriate. */
7480 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7482 if (TYPE_READONLY (from
) > TYPE_READONLY (to
)
7483 || TYPE_VOLATILE (from
) > TYPE_VOLATILE (to
))
7487 && (TYPE_READONLY (to
) > TYPE_READONLY (from
)
7488 || TYPE_VOLATILE (to
) > TYPE_READONLY (from
)))
7490 constp
&= TYPE_READONLY (to
);
7493 if (TREE_CODE (to
) != POINTER_TYPE
)