1 /* Handle types for the GNU compiler for the Java(TM) language.
2 Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2007, 2008
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC 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 3, or (at your option)
12 GCC 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 GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>.
21 Java and all Java-based marks are trademarks or registered trademarks
22 of Sun Microsystems, Inc. in the United States and other countries.
23 The Free Software Foundation is independent of Sun Microsystems, Inc. */
25 /* Written by Per Bothner <bothner@cygnus.com> */
29 #include "coretypes.h"
33 #include "java-tree.h"
36 #include "diagnostic-core.h"
40 static tree convert_ieee_real_to_integer (tree, tree);
41 static tree parse_signature_type (const unsigned char **,
42 const unsigned char *);
43 static tree lookup_do (tree, int, tree, tree, tree (*)(tree));
44 static tree build_null_signature (tree);
48 /* Set the type of the local variable with index SLOT to TYPE. */
51 set_local_type (int slot, tree type)
53 int max_locals = DECL_MAX_LOCALS(current_function_decl);
54 int nslots = TYPE_IS_WIDE (type) ? 2 : 1;
56 gcc_assert (slot >= 0 && (slot + nslots - 1 < max_locals));
58 type_map[slot] = type;
60 type_map[++slot] = void_type_node;
63 /* Convert an IEEE real to an integer type. The result of such a
64 conversion when the source operand is a NaN isn't defined by
65 IEEE754, but by the Java language standard: it must be zero. Also,
66 overflows must be clipped to within range. This conversion
67 produces something like:
69 ((expr >= (float)MAX_INT)
71 : ((expr <= (float)MIN_INT)
78 convert_ieee_real_to_integer (tree type, tree expr)
81 expr = save_expr (expr);
83 result = fold_build3 (COND_EXPR, type,
84 fold_build2 (NE_EXPR, boolean_type_node, expr, expr),
85 convert (type, integer_zero_node),
86 convert_to_integer (type, expr));
88 result = fold_build3 (COND_EXPR, type,
89 fold_build2 (LE_EXPR, boolean_type_node, expr,
90 convert (TREE_TYPE (expr),
91 TYPE_MIN_VALUE (type))),
92 TYPE_MIN_VALUE (type),
95 result = fold_build3 (COND_EXPR, type,
96 fold_build2 (GE_EXPR, boolean_type_node, expr,
97 convert (TREE_TYPE (expr),
98 TYPE_MAX_VALUE (type))),
99 TYPE_MAX_VALUE (type),
105 /* Create an expression whose value is that of EXPR,
106 converted to type TYPE. The TREE_TYPE of the value
107 is always TYPE. This function implements all reasonable
108 conversions; callers should filter out those that are
109 not permitted by the language being compiled. */
112 convert (tree type, tree expr)
114 enum tree_code code = TREE_CODE (type);
117 return error_mark_node;
119 if (type == TREE_TYPE (expr)
120 || TREE_CODE (expr) == ERROR_MARK)
122 if (TREE_CODE (TREE_TYPE (expr)) == ERROR_MARK)
123 return error_mark_node;
124 if (code == VOID_TYPE)
125 return build1 (CONVERT_EXPR, type, expr);
126 if (code == BOOLEAN_TYPE)
127 return fold_convert (type, expr);
128 if (code == INTEGER_TYPE)
130 if (type == char_type_node || type == promoted_char_type_node)
131 return fold_convert (type, expr);
132 if ((really_constant_p (expr) || ! flag_unsafe_math_optimizations)
133 && TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE)
134 return convert_ieee_real_to_integer (type, expr);
137 /* fold very helpfully sets the overflow status if a type
138 overflows in a narrowing integer conversion, but Java
140 tree tmp = fold (convert_to_integer (type, expr));
141 if (TREE_CODE (tmp) == INTEGER_CST)
142 TREE_OVERFLOW (tmp) = 0;
146 if (code == REAL_TYPE)
147 return fold (convert_to_real (type, expr));
148 if (code == POINTER_TYPE)
149 return fold (convert_to_pointer (type, expr));
150 error ("conversion to non-scalar type requested");
151 return error_mark_node;
155 /* Return a data type that has machine mode MODE.
156 If the mode is an integer,
157 then UNSIGNEDP selects between signed and unsigned types. */
160 java_type_for_mode (enum machine_mode mode, int unsignedp)
162 if (mode == TYPE_MODE (int_type_node))
163 return unsignedp ? unsigned_int_type_node : int_type_node;
164 if (mode == TYPE_MODE (long_type_node))
165 return unsignedp ? unsigned_long_type_node : long_type_node;
166 if (mode == TYPE_MODE (short_type_node))
167 return unsignedp ? unsigned_short_type_node : short_type_node;
168 if (mode == TYPE_MODE (byte_type_node))
169 return unsignedp ? unsigned_byte_type_node : byte_type_node;
170 if (mode == TYPE_MODE (float_type_node))
171 return float_type_node;
172 if (mode == TYPE_MODE (double_type_node))
173 return double_type_node;
178 /* Return an integer type with BITS bits of precision,
179 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
182 java_type_for_size (unsigned bits, int unsignedp)
184 if (bits <= TYPE_PRECISION (byte_type_node))
185 return unsignedp ? unsigned_byte_type_node : byte_type_node;
186 if (bits <= TYPE_PRECISION (short_type_node))
187 return unsignedp ? unsigned_short_type_node : short_type_node;
188 if (bits <= TYPE_PRECISION (int_type_node))
189 return unsignedp ? unsigned_int_type_node : int_type_node;
190 if (bits <= TYPE_PRECISION (long_type_node))
191 return unsignedp ? unsigned_long_type_node : long_type_node;
195 /* Thorough checking of the arrayness of TYPE. */
198 is_array_type_p (tree type)
200 return TREE_CODE (type) == POINTER_TYPE
201 && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE
202 && TYPE_ARRAY_P (TREE_TYPE (type));
205 /* Return the length of a Java array type.
206 Return -1 if the length is unknown or non-constant. */
209 java_array_type_length (tree array_type)
212 if (TREE_CODE (array_type) == POINTER_TYPE)
213 array_type = TREE_TYPE (array_type);
214 arfld = TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (array_type)));
215 if (arfld != NULL_TREE)
217 tree index_type = TYPE_DOMAIN (TREE_TYPE (arfld));
218 if (index_type != NULL_TREE)
220 tree high = TYPE_MAX_VALUE (index_type);
221 if (TREE_CODE (high) == INTEGER_CST)
222 return TREE_INT_CST_LOW (high) + 1;
228 /* An array of unknown length will be ultimately given a length of
229 -2, so that we can still have `length' producing a negative value
230 even if found. This was part of an optimization aiming at removing
231 `length' from static arrays. We could restore it, FIXME. */
234 build_prim_array_type (tree element_type, HOST_WIDE_INT length)
240 tree max_index = build_int_cst (sizetype, length - 1);
241 index = build_index_type (max_index);
243 return build_array_type (element_type, index);
246 /* Return a Java array type with a given ELEMENT_TYPE and LENGTH.
247 These are hashed (shared) using IDENTIFIER_SIGNATURE_TYPE.
248 The LENGTH is -1 if the length is unknown. */
251 build_java_array_type (tree element_type, HOST_WIDE_INT length)
253 tree sig, t, fld, atype, arfld;
255 tree elsig = build_java_signature (element_type);
256 tree el_name = element_type;
259 sprintf (buf+1, HOST_WIDE_INT_PRINT_DEC, length);
262 sig = ident_subst (IDENTIFIER_POINTER (elsig), IDENTIFIER_LENGTH (elsig),
264 t = IDENTIFIER_SIGNATURE_TYPE (sig);
266 return TREE_TYPE (t);
268 IDENTIFIER_SIGNATURE_TYPE (sig) = build_pointer_type (t);
269 TYPE_ARRAY_P (t) = 1;
271 if (TREE_CODE (el_name) == POINTER_TYPE)
272 el_name = TREE_TYPE (el_name);
273 el_name = TYPE_NAME (el_name);
274 if (TREE_CODE (el_name) == TYPE_DECL)
275 el_name = DECL_NAME (el_name);
279 sprintf (suffix, "[%d]", (int)length);
281 strcpy (suffix, "[]");
284 = build_decl (input_location, TYPE_DECL,
285 identifier_subst (el_name, "", '.', '.', suffix),
287 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (t)) = true;
290 set_java_signature (t, sig);
291 set_super_info (0, t, object_type_node, 0);
292 if (TREE_CODE (element_type) == RECORD_TYPE)
293 element_type = promote_type (element_type);
294 TYPE_ARRAY_ELEMENT (t) = element_type;
296 /* Add length pseudo-field. */
297 fld = build_decl (input_location,
298 FIELD_DECL, get_identifier ("length"), int_type_node);
299 TYPE_FIELDS (t) = fld;
300 DECL_CONTEXT (fld) = t;
301 FIELD_PUBLIC (fld) = 1;
302 FIELD_FINAL (fld) = 1;
303 TREE_READONLY (fld) = 1;
305 atype = build_prim_array_type (element_type, length);
306 arfld = build_decl (input_location,
307 FIELD_DECL, get_identifier ("data"), atype);
308 DECL_CONTEXT (arfld) = t;
309 TREE_CHAIN (fld) = arfld;
310 DECL_ALIGN (arfld) = TYPE_ALIGN (element_type);
312 /* We could layout_class, but that loads java.lang.Object prematurely.
313 * This is called by the parser, and it is a bad idea to do load_class
314 * in the middle of parsing, because of possible circularity problems. */
315 push_super_field (t, object_type_node);
321 /* Promote TYPE to the type actually used for fields and parameters. */
324 promote_type (tree type)
326 switch (TREE_CODE (type))
329 return build_pointer_type (type);
331 if (type == boolean_type_node)
332 return promoted_boolean_type_node;
335 if (type == char_type_node)
336 return promoted_char_type_node;
338 if (TYPE_PRECISION (type) < TYPE_PRECISION (int_type_node))
340 if (type == short_type_node)
341 return promoted_short_type_node;
342 if (type == byte_type_node)
343 return promoted_byte_type_node;
344 return int_type_node;
346 /* ... else fall through ... */
352 /* Parse a signature string, starting at *PTR and ending at LIMIT.
353 Return the seen TREE_TYPE, updating *PTR. */
356 parse_signature_type (const unsigned char **ptr, const unsigned char *limit)
359 gcc_assert (*ptr < limit);
363 case 'B': (*ptr)++; return byte_type_node;
364 case 'C': (*ptr)++; return char_type_node;
365 case 'D': (*ptr)++; return double_type_node;
366 case 'F': (*ptr)++; return float_type_node;
367 case 'S': (*ptr)++; return short_type_node;
368 case 'I': (*ptr)++; return int_type_node;
369 case 'J': (*ptr)++; return long_type_node;
370 case 'Z': (*ptr)++; return boolean_type_node;
371 case 'V': (*ptr)++; return void_type_node;
373 for ((*ptr)++; (*ptr) < limit && ISDIGIT (**ptr); ) (*ptr)++;
374 type = parse_signature_type (ptr, limit);
375 type = build_java_array_type (type, -1);
379 const unsigned char *start = ++(*ptr);
380 const unsigned char *str = start;
383 gcc_assert (str < limit);
388 type = lookup_class (unmangle_classname ((const char *) start, str - start));
394 return promote_type (type);
397 /* Parse a Java "mangled" signature string, starting at SIG_STRING,
398 and SIG_LENGTH bytes long.
399 Return a gcc type node. */
402 parse_signature_string (const unsigned char *sig_string, int sig_length)
405 const unsigned char *str = sig_string;
406 const unsigned char *limit = str + sig_length;
408 if (str < limit && str[0] == '(')
410 tree argtype_list = NULL_TREE;
412 while (str < limit && str[0] != ')')
414 tree argtype = parse_signature_type (&str, limit);
415 argtype_list = tree_cons (NULL_TREE, argtype, argtype_list);
417 if (str++, str >= limit)
419 result_type = parse_signature_type (&str, limit);
420 argtype_list = chainon (nreverse (argtype_list), end_params_node);
421 result_type = build_function_type (result_type, argtype_list);
424 result_type = parse_signature_type (&str, limit);
426 error ("junk at end of signature string");
430 /* Convert a signature to its type.
431 * Uses IDENTIFIER_SIGNATURE_TYPE as a cache (except for primitive types).
435 get_type_from_signature (tree signature)
437 const unsigned char *sig = (const unsigned char *) IDENTIFIER_POINTER (signature);
438 int len = IDENTIFIER_LENGTH (signature);
440 /* Primitive types aren't cached. */
442 return parse_signature_string (sig, len);
443 type = IDENTIFIER_SIGNATURE_TYPE (signature);
444 if (type == NULL_TREE)
446 type = parse_signature_string (sig, len);
447 IDENTIFIER_SIGNATURE_TYPE (signature) = type;
452 /* Ignore signature and always return null. Used by has_method. */
455 build_null_signature (tree type ATTRIBUTE_UNUSED)
460 /* Return the signature string for the arguments of method type TYPE. */
463 build_java_argument_signature (tree type)
465 extern struct obstack temporary_obstack;
466 tree sig = TYPE_ARGUMENT_SIGNATURE (type);
467 if (sig == NULL_TREE)
469 tree args = TYPE_ARG_TYPES (type);
470 if (TREE_CODE (type) == METHOD_TYPE)
471 args = TREE_CHAIN (args); /* Skip "this" argument. */
472 for (; args != end_params_node; args = TREE_CHAIN (args))
474 tree t = build_java_signature (TREE_VALUE (args));
475 obstack_grow (&temporary_obstack,
476 IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t));
478 obstack_1grow (&temporary_obstack, '\0');
480 sig = get_identifier (obstack_base (&temporary_obstack));
481 TYPE_ARGUMENT_SIGNATURE (type) = sig;
482 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
487 /* Return the signature of the given TYPE. */
490 build_java_signature (tree type)
493 while (TREE_CODE (type) == POINTER_TYPE)
494 type = TREE_TYPE (type);
495 MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC (type);
496 sig = TYPE_SIGNATURE (type);
497 if (sig == NULL_TREE)
500 switch (TREE_CODE (type))
502 case BOOLEAN_TYPE: sg[0] = 'Z'; goto native;
503 case VOID_TYPE: sg[0] = 'V'; goto native;
505 if (type == char_type_node || type == promoted_char_type_node)
510 switch (TYPE_PRECISION (type))
512 case 8: sg[0] = 'B'; goto native;
513 case 16: sg[0] = 'S'; goto native;
514 case 32: sg[0] = 'I'; goto native;
515 case 64: sg[0] = 'J'; goto native;
516 default: goto bad_type;
519 switch (TYPE_PRECISION (type))
521 case 32: sg[0] = 'F'; goto native;
522 case 64: sg[0] = 'D'; goto native;
523 default: goto bad_type;
527 sig = get_identifier (sg);
530 if (TYPE_ARRAY_P (type))
532 t = build_java_signature (TYPE_ARRAY_ELEMENT (type));
533 sig = ident_subst (IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t),
538 t = DECL_NAME (TYPE_NAME (type));
539 sig = ident_subst (IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t),
546 extern struct obstack temporary_obstack;
547 sig = build_java_argument_signature (type);
548 obstack_1grow (&temporary_obstack, '(');
549 obstack_grow (&temporary_obstack,
550 IDENTIFIER_POINTER (sig), IDENTIFIER_LENGTH (sig));
551 obstack_1grow (&temporary_obstack, ')');
553 t = build_java_signature (TREE_TYPE (type));
554 obstack_grow0 (&temporary_obstack,
555 IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t));
557 sig = get_identifier (obstack_base (&temporary_obstack));
558 obstack_free (&temporary_obstack,
559 obstack_base (&temporary_obstack));
566 TYPE_SIGNATURE (type) = sig;
571 /* Save signature string SIG (an IDENTIFIER_NODE) in TYPE for future use. */
574 set_java_signature (tree type, tree sig)
577 while (TREE_CODE (type) == POINTER_TYPE)
578 type = TREE_TYPE (type);
579 MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC (type);
580 old_sig = TYPE_SIGNATURE (type);
581 if (old_sig != NULL_TREE && old_sig != sig)
583 TYPE_SIGNATURE (type) = sig;
584 #if 0 /* careful about METHOD_TYPE */
585 if (IDENTIFIER_SIGNATURE_TYPE (sig) == NULL_TREE && TREE_PERMANENT (type))
586 IDENTIFIER_SIGNATURE_TYPE (sig) = type;
590 /* Search in SEARCHED_CLASS and its superclasses for a method matching
591 METHOD_NAME and signature METHOD_SIGNATURE. This function will
592 only search for methods declared in the class hierarchy; interfaces
593 will not be considered. Returns NULL_TREE if the method is not
596 lookup_argument_method (tree searched_class, tree method_name,
597 tree method_signature)
599 return lookup_do (searched_class, 0,
600 method_name, method_signature,
601 build_java_argument_signature);
604 /* Like lookup_argument_method, but lets the caller set any flags
607 lookup_argument_method_generic (tree searched_class, tree method_name,
608 tree method_signature, int flags)
610 return lookup_do (searched_class, flags,
611 method_name, method_signature,
612 build_java_argument_signature);
616 /* Search in class SEARCHED_CLASS (and its superclasses) for a method
617 matching METHOD_NAME and signature METHOD_SIGNATURE. Return a
618 FUNCTION_DECL on success, or NULL_TREE if none found. (Contrast
619 lookup_argument_method, which ignores return type.) If
620 SEARCHED_CLASS is an interface, search it too. */
622 lookup_java_method (tree searched_class, tree method_name,
623 tree method_signature)
625 return lookup_do (searched_class, SEARCH_INTERFACE, method_name,
626 method_signature, build_java_signature);
629 /* Return true iff KLASS (or its ancestors) has a method METHOD_NAME. */
631 has_method (tree klass, tree method_name)
633 return lookup_do (klass, SEARCH_INTERFACE,
634 method_name, NULL_TREE,
635 build_null_signature) != NULL_TREE;
638 /* Search in class SEARCHED_CLASS, but not its superclasses, for a
639 method matching METHOD_NAME and signature SIGNATURE. A private
640 helper for lookup_do. */
642 shallow_find_method (tree searched_class, int flags, tree method_name,
643 tree signature, tree (*signature_builder) (tree))
646 for (method = TYPE_METHODS (searched_class);
647 method != NULL_TREE; method = TREE_CHAIN (method))
649 tree method_sig = (*signature_builder) (TREE_TYPE (method));
650 if (DECL_NAME (method) == method_name && method_sig == signature)
652 /* If the caller requires a visible method, then we
653 skip invisible methods here. */
654 if (! (flags & SEARCH_VISIBLE)
655 || ! METHOD_INVISIBLE (method))
662 /* Search in the superclasses of SEARCHED_CLASS for a method matching
663 METHOD_NAME and signature SIGNATURE. A private helper for
666 find_method_in_superclasses (tree searched_class, int flags,
667 tree method_name, tree signature,
668 tree (*signature_builder) (tree))
671 for (klass = CLASSTYPE_SUPER (searched_class); klass != NULL_TREE;
672 klass = CLASSTYPE_SUPER (klass))
675 method = shallow_find_method (klass, flags, method_name,
676 signature, signature_builder);
677 if (method != NULL_TREE)
684 /* Search in the interfaces of SEARCHED_CLASS and its superinterfaces
685 for a method matching METHOD_NAME and signature SIGNATURE. A
686 private helper for lookup_do. */
688 find_method_in_interfaces (tree searched_class, int flags, tree method_name,
689 tree signature, tree (*signature_builder) (tree))
692 tree binfo, base_binfo;
694 for (binfo = TYPE_BINFO (searched_class), i = 1;
695 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
697 tree iclass = BINFO_TYPE (base_binfo);
700 /* If the superinterface hasn't been loaded yet, do so now. */
701 if (!CLASS_LOADED_P (iclass))
702 load_class (iclass, 1);
704 /* First, we look in ICLASS. If that doesn't work we'll
705 recursively look through all its superinterfaces. */
706 method = shallow_find_method (iclass, flags, method_name,
707 signature, signature_builder);
708 if (method != NULL_TREE)
711 method = find_method_in_interfaces
712 (iclass, flags, method_name, signature, signature_builder);
713 if (method != NULL_TREE)
721 /* Search in class SEARCHED_CLASS (and its superclasses) for a method
722 matching METHOD_NAME and signature SIGNATURE. FLAGS control some
723 parameters of the search.
725 SEARCH_INTERFACE means also search interfaces and superinterfaces
728 SEARCH_SUPER means skip SEARCHED_CLASS and start with its
731 SEARCH_VISIBLE means skip methods for which METHOD_INVISIBLE is
734 Return the matched method DECL or NULL_TREE. SIGNATURE_BUILDER is
735 used on method candidates to build their (sometimes partial)
738 lookup_do (tree searched_class, int flags, tree method_name,
739 tree signature, tree (*signature_builder) (tree))
742 tree orig_class = searched_class;
744 if (searched_class == NULL_TREE)
747 if (flags & SEARCH_SUPER)
749 searched_class = CLASSTYPE_SUPER (searched_class);
750 if (searched_class == NULL_TREE)
754 /* First look in our own methods. */
755 method = shallow_find_method (searched_class, flags, method_name,
756 signature, signature_builder);
760 /* Then look in our superclasses. */
761 if (! CLASS_INTERFACE (TYPE_NAME (searched_class)))
762 method = find_method_in_superclasses (searched_class, flags, method_name,
763 signature, signature_builder);
767 /* If that doesn't work, look in our interfaces. */
768 if (flags & SEARCH_INTERFACE)
769 method = find_method_in_interfaces (orig_class, flags, method_name,
770 signature, signature_builder);
775 /* Search in class CLAS for a constructor matching METHOD_SIGNATURE.
776 Return a FUNCTION_DECL on success, or NULL_TREE if none found. */
779 lookup_java_constructor (tree clas, tree method_signature)
781 tree method = TYPE_METHODS (clas);
782 for ( ; method != NULL_TREE; method = TREE_CHAIN (method))
784 tree method_sig = build_java_signature (TREE_TYPE (method));
785 if (DECL_CONSTRUCTOR_P (method) && method_sig == method_signature)
791 /* Return a type which is the Binary Numeric Promotion of the pair T1,
792 T2 and convert EXP1 and/or EXP2. See 5.6.2 Binary Numeric
793 Promotion. It assumes that both T1 and T2 are eligible to BNP. */
796 binary_numeric_promotion (tree t1, tree t2, tree *exp1, tree *exp2)
798 if (t1 == double_type_node || t2 == double_type_node)
800 if (t1 != double_type_node)
801 *exp1 = convert (double_type_node, *exp1);
802 if (t2 != double_type_node)
803 *exp2 = convert (double_type_node, *exp2);
804 return double_type_node;
806 if (t1 == float_type_node || t2 == float_type_node)
808 if (t1 != float_type_node)
809 *exp1 = convert (float_type_node, *exp1);
810 if (t2 != float_type_node)
811 *exp2 = convert (float_type_node, *exp2);
812 return float_type_node;
814 if (t1 == long_type_node || t2 == long_type_node)
816 if (t1 != long_type_node)
817 *exp1 = convert (long_type_node, *exp1);
818 if (t2 != long_type_node)
819 *exp2 = convert (long_type_node, *exp2);
820 return long_type_node;
823 if (t1 != int_type_node)
824 *exp1 = convert (int_type_node, *exp1);
825 if (t2 != int_type_node)
826 *exp2 = convert (int_type_node, *exp2);
827 return int_type_node;