1 /* Handle types for the GNU compiler for the Java(TM) language.
2 Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003
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 2, 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 COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA.
22 Java and all Java-based marks are trademarks or registered trademarks
23 of Sun Microsystems, Inc. in the United States and other countries.
24 The Free Software Foundation is independent of Sun Microsystems, Inc. */
26 /* Written by Per Bothner <bothner@cygnus.com> */
30 #include "coretypes.h"
36 #include "java-tree.h"
42 static tree convert_ieee_real_to_integer (tree, tree);
43 static tree parse_signature_type (const unsigned char **,
44 const unsigned char *);
45 static tree lookup_do (tree, int, tree, tree, tree (*)(tree));
46 static tree build_null_signature (tree);
50 /* Set the type of the local variable with index SLOT to TYPE. */
53 set_local_type (int slot, tree type)
55 int max_locals = DECL_MAX_LOCALS(current_function_decl);
56 int nslots = TYPE_IS_WIDE (type) ? 2 : 1;
58 if (slot < 0 || slot + nslots - 1 >= max_locals)
61 type_map[slot] = type;
63 type_map[++slot] = void_type_node;
66 /* Convert an IEEE real to an integer type. The result of such a
67 conversion when the source operand is a NaN isn't defined by
68 IEEE754, but by the Java language standard: it must be zero. Also,
69 overflows must be clipped to within range. This conversion
70 produces something like:
72 ((expr >= (float)MAX_INT)
74 : ((expr <= (float)MIN_INT)
81 convert_ieee_real_to_integer (tree type, tree expr)
84 expr = save_expr (expr);
86 result = build (COND_EXPR, type,
87 build (NE_EXPR, boolean_type_node, expr, expr),
88 convert (type, integer_zero_node),
89 convert_to_integer (type, expr));
91 result = build (COND_EXPR, type,
92 build (LE_EXPR, boolean_type_node, expr,
93 convert (TREE_TYPE (expr), TYPE_MIN_VALUE (type))),
94 TYPE_MIN_VALUE (type),
97 result = build (COND_EXPR, type,
98 build (GE_EXPR, boolean_type_node, expr,
99 convert (TREE_TYPE (expr), TYPE_MAX_VALUE (type))),
100 TYPE_MAX_VALUE (type),
106 /* Create an expression whose value is that of EXPR,
107 converted to type TYPE. The TREE_TYPE of the value
108 is always TYPE. This function implements all reasonable
109 conversions; callers should filter out those that are
110 not permitted by the language being compiled. */
113 convert (tree type, tree expr)
115 enum tree_code code = TREE_CODE (type);
118 return error_mark_node;
121 return build1 (NOP_EXPR, type, expr);
123 if (type == TREE_TYPE (expr)
124 || TREE_CODE (expr) == ERROR_MARK)
126 if (TREE_CODE (TREE_TYPE (expr)) == ERROR_MARK)
127 return error_mark_node;
128 if (code == VOID_TYPE)
129 return build1 (CONVERT_EXPR, type, expr);
130 if (code == BOOLEAN_TYPE)
131 return fold (convert_to_boolean (type, expr));
132 if (code == INTEGER_TYPE)
134 if (! flag_unsafe_math_optimizations
135 && ! flag_emit_class_files
136 && TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
137 && TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT)
138 return fold (convert_ieee_real_to_integer (type, expr));
140 return fold (convert_to_integer (type, expr));
142 if (code == REAL_TYPE)
143 return fold (convert_to_real (type, expr));
144 if (code == CHAR_TYPE)
145 return fold (convert_to_char (type, expr));
146 if (code == POINTER_TYPE)
147 return fold (convert_to_pointer (type, expr));
148 error ("conversion to non-scalar type requested");
149 return error_mark_node;
154 convert_to_char (tree type, tree expr)
156 return build1 (NOP_EXPR, type, expr);
160 convert_to_boolean (tree type, tree expr)
162 return build1 (NOP_EXPR, type, expr);
165 /* Return a data type that has machine mode MODE.
166 If the mode is an integer,
167 then UNSIGNEDP selects between signed and unsigned types. */
170 java_type_for_mode (enum machine_mode mode, int unsignedp)
172 if (mode == TYPE_MODE (int_type_node))
173 return unsignedp ? unsigned_int_type_node : int_type_node;
174 if (mode == TYPE_MODE (long_type_node))
175 return unsignedp ? unsigned_long_type_node : long_type_node;
176 if (mode == TYPE_MODE (short_type_node))
177 return unsignedp ? unsigned_short_type_node : short_type_node;
178 if (mode == TYPE_MODE (byte_type_node))
179 return unsignedp ? unsigned_byte_type_node : byte_type_node;
180 if (mode == TYPE_MODE (float_type_node))
181 return float_type_node;
182 if (mode == TYPE_MODE (double_type_node))
183 return double_type_node;
188 /* Return an integer type with BITS bits of precision,
189 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
192 java_type_for_size (unsigned bits, int unsignedp)
194 if (bits <= TYPE_PRECISION (byte_type_node))
195 return unsignedp ? unsigned_byte_type_node : byte_type_node;
196 if (bits <= TYPE_PRECISION (short_type_node))
197 return unsignedp ? unsigned_short_type_node : short_type_node;
198 if (bits <= TYPE_PRECISION (int_type_node))
199 return unsignedp ? unsigned_int_type_node : int_type_node;
200 if (bits <= TYPE_PRECISION (long_type_node))
201 return unsignedp ? unsigned_long_type_node : long_type_node;
205 /* Return a type the same as TYPE except unsigned or
206 signed according to UNSIGNEDP. */
209 java_signed_or_unsigned_type (int unsignedp, tree type)
211 if (! INTEGRAL_TYPE_P (type))
213 if (TYPE_PRECISION (type) == TYPE_PRECISION (int_type_node))
214 return unsignedp ? unsigned_int_type_node : int_type_node;
215 if (TYPE_PRECISION (type) == TYPE_PRECISION (byte_type_node))
216 return unsignedp ? unsigned_byte_type_node : byte_type_node;
217 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_type_node))
218 return unsignedp ? unsigned_short_type_node : short_type_node;
219 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_type_node))
220 return unsignedp ? unsigned_long_type_node : long_type_node;
224 /* Return a signed type the same as TYPE in other respects. */
227 java_signed_type (tree type)
229 return java_signed_or_unsigned_type (0, type);
232 /* Return an unsigned type the same as TYPE in other respects. */
235 java_unsigned_type (tree type)
237 return java_signed_or_unsigned_type (1, type);
240 /* Mark EXP saying that we need to be able to take the
241 address of it; it should not be allocated in a register.
242 Value is true if successful. */
245 java_mark_addressable (tree exp)
249 switch (TREE_CODE (x))
256 x = TREE_OPERAND (x, 0);
259 case TRUTH_ANDIF_EXPR:
260 case TRUTH_ORIF_EXPR:
262 x = TREE_OPERAND (x, 1);
266 return java_mark_addressable (TREE_OPERAND (x, 1))
267 && java_mark_addressable (TREE_OPERAND (x, 2));
270 TREE_ADDRESSABLE (x) = 1;
274 /* We sometimes add a cast *(TYPE*)&FOO to handle type and mode
275 incompatibility problems. Handle this case by marking FOO. */
276 if (TREE_CODE (TREE_OPERAND (x, 0)) == NOP_EXPR
277 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (x, 0), 0)) == ADDR_EXPR)
279 x = TREE_OPERAND (TREE_OPERAND (x, 0), 0);
282 if (TREE_CODE (TREE_OPERAND (x, 0)) == ADDR_EXPR)
284 x = TREE_OPERAND (x, 0);
294 TREE_ADDRESSABLE (x) = 1;
295 #if 0 /* poplevel deals with this now. */
296 if (DECL_CONTEXT (x) == 0)
297 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
305 /* Thorough checking of the arrayness of TYPE. */
308 is_array_type_p (tree type)
310 return TREE_CODE (type) == POINTER_TYPE
311 && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE
312 && TYPE_ARRAY_P (TREE_TYPE (type));
315 /* Return the length of a Java array type.
316 Return -1 if the length is unknown or non-constant. */
319 java_array_type_length (tree array_type)
322 if (TREE_CODE (array_type) == POINTER_TYPE)
323 array_type = TREE_TYPE (array_type);
324 arfld = TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (array_type)));
325 if (arfld != NULL_TREE)
327 tree index_type = TYPE_DOMAIN (TREE_TYPE (arfld));
328 if (index_type != NULL_TREE)
330 tree high = TYPE_MAX_VALUE (index_type);
331 if (TREE_CODE (high) == INTEGER_CST)
332 return TREE_INT_CST_LOW (high) + 1;
338 /* An array of unknown length will be ultimately given an length of
339 -2, so that we can still have `length' producing a negative value
340 even if found. This was part of an optimization aiming at removing
341 `length' from static arrays. We could restore it, FIXME. */
344 build_prim_array_type (tree element_type, HOST_WIDE_INT length)
350 tree max_index = build_int_2 (length - 1, (0 == length ? -1 : 0));
351 TREE_TYPE (max_index) = sizetype;
352 index = build_index_type (max_index);
354 return build_array_type (element_type, index);
357 /* Return a Java array type with a given ELEMENT_TYPE and LENGTH.
358 These are hashed (shared) using IDENTIFIER_SIGNATURE_TYPE.
359 The LENGTH is -1 if the length is unknown. */
362 build_java_array_type (tree element_type, HOST_WIDE_INT length)
364 tree sig, t, fld, atype, arfld;
366 tree elsig = build_java_signature (element_type);
367 tree el_name = element_type;
370 sprintf (buf+1, HOST_WIDE_INT_PRINT_DEC, length);
373 sig = ident_subst (IDENTIFIER_POINTER (elsig), IDENTIFIER_LENGTH (elsig),
375 t = IDENTIFIER_SIGNATURE_TYPE (sig);
377 return TREE_TYPE (t);
379 IDENTIFIER_SIGNATURE_TYPE (sig) = build_pointer_type (t);
380 TYPE_ARRAY_P (t) = 1;
382 if (TREE_CODE (el_name) == POINTER_TYPE)
383 el_name = TREE_TYPE (el_name);
384 el_name = TYPE_NAME (el_name);
385 if (TREE_CODE (el_name) == TYPE_DECL)
386 el_name = DECL_NAME (el_name);
387 TYPE_NAME (t) = build_decl (TYPE_DECL,
388 identifier_subst (el_name, "", '.', '.', "[]"),
391 set_java_signature (t, sig);
392 set_super_info (0, t, object_type_node, 0);
393 if (TREE_CODE (element_type) == RECORD_TYPE)
394 element_type = promote_type (element_type);
395 TYPE_ARRAY_ELEMENT (t) = element_type;
397 /* Add length pseudo-field. */
398 fld = build_decl (FIELD_DECL, get_identifier ("length"), int_type_node);
399 TYPE_FIELDS (t) = fld;
400 DECL_CONTEXT (fld) = t;
401 FIELD_PUBLIC (fld) = 1;
402 FIELD_FINAL (fld) = 1;
403 TREE_READONLY (fld) = 1;
405 atype = build_prim_array_type (element_type, length);
406 arfld = build_decl (FIELD_DECL, get_identifier ("data"), atype);
407 DECL_CONTEXT (arfld) = t;
408 TREE_CHAIN (fld) = arfld;
409 DECL_ALIGN (arfld) = TYPE_ALIGN (element_type);
411 /* We could layout_class, but that loads java.lang.Object prematurely.
412 * This is called by the parser, and it is a bad idea to do load_class
413 * in the middle of parsing, because of possible circularity problems. */
414 push_super_field (t, object_type_node);
420 /* Promote TYPE to the type actually used for fields and parameters. */
423 promote_type (tree type)
425 switch (TREE_CODE (type))
428 return build_pointer_type (type);
430 if (type == boolean_type_node)
431 return promoted_boolean_type_node;
434 if (type == char_type_node)
435 return promoted_char_type_node;
439 if (TYPE_PRECISION (type) < TYPE_PRECISION (int_type_node))
441 if (type == short_type_node)
442 return promoted_short_type_node;
443 if (type == byte_type_node)
444 return promoted_byte_type_node;
445 return int_type_node;
447 /* ... else fall through ... */
453 /* Parse a signature string, starting at *PTR and ending at LIMIT.
454 Return the seen TREE_TYPE, updating *PTR. */
457 parse_signature_type (const unsigned char **ptr, const unsigned char *limit)
466 case 'B': (*ptr)++; return byte_type_node;
467 case 'C': (*ptr)++; return char_type_node;
468 case 'D': (*ptr)++; return double_type_node;
469 case 'F': (*ptr)++; return float_type_node;
470 case 'S': (*ptr)++; return short_type_node;
471 case 'I': (*ptr)++; return int_type_node;
472 case 'J': (*ptr)++; return long_type_node;
473 case 'Z': (*ptr)++; return boolean_type_node;
474 case 'V': (*ptr)++; return void_type_node;
476 for ((*ptr)++; (*ptr) < limit && ISDIGIT (**ptr); ) (*ptr)++;
477 type = parse_signature_type (ptr, limit);
478 type = build_java_array_type (type, -1);
482 const unsigned char *start = ++(*ptr);
483 const unsigned char *str = start;
492 type = lookup_class (unmangle_classname (start, str - start));
498 return promote_type (type);
501 /* Parse a Java "mangled" signature string, starting at SIG_STRING,
502 and SIG_LENGTH bytes long.
503 Return a gcc type node. */
506 parse_signature_string (const unsigned char *sig_string, int sig_length)
509 const unsigned char *str = sig_string;
510 const unsigned char *limit = str + sig_length;
512 if (str < limit && str[0] == '(')
514 tree argtype_list = NULL_TREE;
516 while (str < limit && str[0] != ')')
518 tree argtype = parse_signature_type (&str, limit);
519 argtype_list = tree_cons (NULL_TREE, argtype, argtype_list);
521 if (str++, str >= limit)
523 result_type = parse_signature_type (&str, limit);
524 argtype_list = chainon (nreverse (argtype_list), end_params_node);
525 result_type = build_function_type (result_type, argtype_list);
528 result_type = parse_signature_type (&str, limit);
530 error ("junk at end of signature string");
534 /* Convert a signature to its type.
535 * Uses IDENTIFIER_SIGNATURE_TYPE as a cache (except for primitive types).
539 get_type_from_signature (tree signature)
541 const unsigned char *sig = (const unsigned char *) IDENTIFIER_POINTER (signature);
542 int len = IDENTIFIER_LENGTH (signature);
544 /* Primitive types aren't cached. */
546 return parse_signature_string (sig, len);
547 type = IDENTIFIER_SIGNATURE_TYPE (signature);
548 if (type == NULL_TREE)
550 type = parse_signature_string (sig, len);
551 IDENTIFIER_SIGNATURE_TYPE (signature) = type;
556 /* Ignore signature and always return null. Used by has_method. */
559 build_null_signature (tree type ATTRIBUTE_UNUSED)
564 /* Return the signature string for the arguments of method type TYPE. */
567 build_java_argument_signature (tree type)
569 extern struct obstack temporary_obstack;
570 tree sig = TYPE_ARGUMENT_SIGNATURE (type);
571 if (sig == NULL_TREE)
573 tree args = TYPE_ARG_TYPES (type);
574 if (TREE_CODE (type) == METHOD_TYPE)
575 args = TREE_CHAIN (args); /* Skip "this" argument. */
576 for (; args != end_params_node; args = TREE_CHAIN (args))
578 tree t = build_java_signature (TREE_VALUE (args));
579 obstack_grow (&temporary_obstack,
580 IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t));
582 obstack_1grow (&temporary_obstack, '\0');
584 sig = get_identifier (obstack_base (&temporary_obstack));
585 TYPE_ARGUMENT_SIGNATURE (type) = sig;
586 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
591 /* Return the signature of the given TYPE. */
594 build_java_signature (tree type)
597 while (TREE_CODE (type) == POINTER_TYPE)
598 type = TREE_TYPE (type);
599 MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC (type);
600 sig = TYPE_SIGNATURE (type);
601 if (sig == NULL_TREE)
604 switch (TREE_CODE (type))
606 case BOOLEAN_TYPE: sg[0] = 'Z'; goto native;
607 case CHAR_TYPE: sg[0] = 'C'; goto native;
608 case VOID_TYPE: sg[0] = 'V'; goto native;
610 switch (TYPE_PRECISION (type))
612 case 8: sg[0] = 'B'; goto native;
613 case 16: sg[0] = 'S'; goto native;
614 case 32: sg[0] = 'I'; goto native;
615 case 64: sg[0] = 'J'; goto native;
616 default: goto bad_type;
619 switch (TYPE_PRECISION (type))
621 case 32: sg[0] = 'F'; goto native;
622 case 64: sg[0] = 'D'; goto native;
623 default: goto bad_type;
627 sig = get_identifier (sg);
630 if (TYPE_ARRAY_P (type))
632 t = build_java_signature (TYPE_ARRAY_ELEMENT (type));
633 sig = ident_subst (IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t),
638 t = DECL_NAME (TYPE_NAME (type));
639 sig = ident_subst (IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t),
646 extern struct obstack temporary_obstack;
647 sig = build_java_argument_signature (type);
648 obstack_1grow (&temporary_obstack, '(');
649 obstack_grow (&temporary_obstack,
650 IDENTIFIER_POINTER (sig), IDENTIFIER_LENGTH (sig));
651 obstack_1grow (&temporary_obstack, ')');
653 t = build_java_signature (TREE_TYPE (type));
654 obstack_grow0 (&temporary_obstack,
655 IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t));
657 sig = get_identifier (obstack_base (&temporary_obstack));
658 obstack_free (&temporary_obstack,
659 obstack_base (&temporary_obstack));
666 TYPE_SIGNATURE (type) = sig;
671 /* Save signature string SIG (an IDENTIFIER_NODE) in TYPE for future use. */
674 set_java_signature (tree type, tree sig)
677 while (TREE_CODE (type) == POINTER_TYPE)
678 type = TREE_TYPE (type);
679 MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC (type);
680 old_sig = TYPE_SIGNATURE (type);
681 if (old_sig != NULL_TREE && old_sig != sig)
683 TYPE_SIGNATURE (type) = sig;
684 #if 0 /* careful about METHOD_TYPE */
685 if (IDENTIFIER_SIGNATURE_TYPE (sig) == NULL_TREE && TREE_PERMANENT (type))
686 IDENTIFIER_SIGNATURE_TYPE (sig) = type;
690 /* Search in SEARCHED_CLASS and its superclasses for a method matching
691 METHOD_NAME and signature METHOD_SIGNATURE. This function will
692 only search for methods declared in the class hierarchy; interfaces
693 will not be considered. Returns NULL_TREE if the method is not
696 lookup_argument_method (tree searched_class, tree method_name,
697 tree method_signature)
699 return lookup_do (searched_class, 0,
700 method_name, method_signature,
701 build_java_argument_signature);
704 /* Like lookup_argument_method, but lets the caller set any flags
707 lookup_argument_method_generic (tree searched_class, tree method_name,
708 tree method_signature, int flags)
710 return lookup_do (searched_class, flags,
711 method_name, method_signature,
712 build_java_argument_signature);
716 /* Search in class SEARCHED_CLASS (and its superclasses) for a method
717 matching METHOD_NAME and signature METHOD_SIGNATURE. Return a
718 FUNCTION_DECL on success, or NULL_TREE if none found. (Contrast
719 lookup_argument_method, which ignores return type.) If
720 SEARCHED_CLASS is an interface, search it too. */
722 lookup_java_method (tree searched_class, tree method_name,
723 tree method_signature)
725 return lookup_do (searched_class, SEARCH_INTERFACE, method_name,
726 method_signature, build_java_signature);
729 /* Return true iff CLASS (or its ancestors) has a method METHOD_NAME. */
731 has_method (tree class, tree method_name)
733 return lookup_do (class, SEARCH_INTERFACE,
734 method_name, NULL_TREE,
735 build_null_signature) != NULL_TREE;
738 /* Search in class SEARCHED_CLASS, but not its superclasses, for a
739 method matching METHOD_NAME and signature SIGNATURE. A private
740 helper for lookup_do. */
742 shallow_find_method (tree searched_class, int flags, tree method_name,
743 tree signature, tree (*signature_builder) (tree))
746 for (method = TYPE_METHODS (searched_class);
747 method != NULL_TREE; method = TREE_CHAIN (method))
749 tree method_sig = (*signature_builder) (TREE_TYPE (method));
750 if (DECL_NAME (method) == method_name && method_sig == signature)
752 /* If the caller requires a visible method, then we
753 skip invisible methods here. */
754 if (! (flags & SEARCH_VISIBLE)
755 || ! METHOD_INVISIBLE (method))
762 /* Search in the superclasses of SEARCHED_CLASS for a method matching
763 METHOD_NAME and signature SIGNATURE. A private helper for
766 find_method_in_superclasses (tree searched_class, int flags,
768 tree signature, tree (*signature_builder) (tree))
771 for (klass = CLASSTYPE_SUPER (searched_class); klass != NULL_TREE;
772 klass = CLASSTYPE_SUPER (klass))
775 method = shallow_find_method (klass, flags, method_name,
776 signature, signature_builder);
777 if (method != NULL_TREE)
784 /* Search in the interfaces of SEARCHED_CLASS and its superinterfaces
785 for a method matching METHOD_NAME and signature SIGNATURE. A
786 private helper for lookup_do. */
788 find_method_in_interfaces (tree searched_class, int flags, tree method_name,
789 tree signature, tree (*signature_builder) (tree))
793 TREE_VEC_LENGTH (TYPE_BINFO_BASETYPES (searched_class)) - 1;
795 for (i = interface_len; i > 0; i--)
798 TREE_VEC_ELT (TYPE_BINFO_BASETYPES (searched_class), i);
799 tree iclass = BINFO_TYPE (child);
802 /* If the superinterface hasn't been loaded yet, do so now. */
803 if (CLASS_FROM_SOURCE_P (iclass))
804 safe_layout_class (iclass);
805 else if (!CLASS_LOADED_P (iclass))
806 load_class (iclass, 1);
808 /* First, we look in ICLASS. If that doesn't work we'll
809 recursively look through all its superinterfaces. */
810 method = shallow_find_method (iclass, flags, method_name,
811 signature, signature_builder);
812 if (method != NULL_TREE)
815 method = find_method_in_interfaces
816 (iclass, flags, method_name, signature, signature_builder);
817 if (method != NULL_TREE)
825 /* Search in class SEARCHED_CLASS (and its superclasses) for a method
826 matching METHOD_NAME and signature SIGNATURE. FLAGS control some
827 parameters of the search.
829 SEARCH_INTERFACE means also search interfaces and superinterfaces
832 SEARCH_SUPER means skip SEARCHED_CLASS and start with its
835 SEARCH_VISIBLE means skip methods for which METHOD_INVISIBLE is
838 Return the matched method DECL or NULL_TREE. SIGNATURE_BUILDER is
839 used on method candidates to build their (sometimes partial)
842 lookup_do (tree searched_class, int flags, tree method_name,
843 tree signature, tree (*signature_builder) (tree))
847 if (searched_class == NULL_TREE)
850 if (flags & SEARCH_SUPER)
852 searched_class = CLASSTYPE_SUPER (searched_class);
853 if (searched_class == NULL_TREE)
857 /* First look in our own methods. */
858 method = shallow_find_method (searched_class, flags, method_name,
859 signature, signature_builder);
863 /* Then look in our superclasses. */
864 if (! CLASS_INTERFACE (TYPE_NAME (searched_class)))
865 method = find_method_in_superclasses (searched_class, flags, method_name,
866 signature, signature_builder);
870 /* If that doesn't work, look in our interfaces. */
871 if (flags & SEARCH_INTERFACE)
872 method = find_method_in_interfaces (searched_class, flags, method_name,
873 signature, signature_builder);
878 /* Search in class CLAS for a constructor matching METHOD_SIGNATURE.
879 Return a FUNCTION_DECL on success, or NULL_TREE if none found. */
882 lookup_java_constructor (tree clas, tree method_signature)
884 tree method = TYPE_METHODS (clas);
885 for ( ; method != NULL_TREE; method = TREE_CHAIN (method))
887 tree method_sig = build_java_signature (TREE_TYPE (method));
888 if (DECL_CONSTRUCTOR_P (method) && method_sig == method_signature)
894 /* Return a type which is the Binary Numeric Promotion of the pair T1,
895 T2 and convert EXP1 and/or EXP2. See 5.6.2 Binary Numeric
896 Promotion. It assumes that both T1 and T2 are eligible to BNP. */
899 binary_numeric_promotion (tree t1, tree t2, tree *exp1, tree *exp2)
901 if (t1 == double_type_node || t2 == double_type_node)
903 if (t1 != double_type_node)
904 *exp1 = convert (double_type_node, *exp1);
905 if (t2 != double_type_node)
906 *exp2 = convert (double_type_node, *exp2);
907 return double_type_node;
909 if (t1 == float_type_node || t2 == float_type_node)
911 if (t1 != float_type_node)
912 *exp1 = convert (float_type_node, *exp1);
913 if (t2 != float_type_node)
914 *exp2 = convert (float_type_node, *exp2);
915 return float_type_node;
917 if (t1 == long_type_node || t2 == long_type_node)
919 if (t1 != long_type_node)
920 *exp1 = convert (long_type_node, *exp1);
921 if (t2 != long_type_node)
922 *exp2 = convert (long_type_node, *exp2);
923 return long_type_node;
926 if (t1 != int_type_node)
927 *exp1 = convert (int_type_node, *exp1);
928 if (t2 != int_type_node)
929 *exp2 = convert (int_type_node, *exp2);
930 return int_type_node;