1 /* Handle types for the GNU compiler for the Java(TM) language.
2 Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005
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, 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, 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 = fold_build3 (COND_EXPR, type,
87 fold_build2 (NE_EXPR, boolean_type_node, expr, expr),
88 convert (type, integer_zero_node),
89 convert_to_integer (type, expr));
91 result = fold_build3 (COND_EXPR, type,
92 fold_build2 (LE_EXPR, boolean_type_node, expr,
93 convert (TREE_TYPE (expr),
94 TYPE_MIN_VALUE (type))),
95 TYPE_MIN_VALUE (type),
98 result = fold_build3 (COND_EXPR, type,
99 fold_build2 (GE_EXPR, boolean_type_node, expr,
100 convert (TREE_TYPE (expr),
101 TYPE_MAX_VALUE (type))),
102 TYPE_MAX_VALUE (type),
108 /* Create an expression whose value is that of EXPR,
109 converted to type TYPE. The TREE_TYPE of the value
110 is always TYPE. This function implements all reasonable
111 conversions; callers should filter out those that are
112 not permitted by the language being compiled. */
115 convert (tree type, tree expr)
117 enum tree_code code = TREE_CODE (type);
120 return error_mark_node;
122 if (type == TREE_TYPE (expr)
123 || TREE_CODE (expr) == ERROR_MARK)
125 if (TREE_CODE (TREE_TYPE (expr)) == ERROR_MARK)
126 return error_mark_node;
127 if (code == VOID_TYPE)
128 return build1 (CONVERT_EXPR, type, expr);
129 if (code == BOOLEAN_TYPE || code == CHAR_TYPE)
130 return fold_convert (type, expr);
131 if (code == INTEGER_TYPE)
133 if ((really_constant_p (expr)
134 || (! 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 convert_ieee_real_to_integer (type, expr);
141 /* fold very helpfully sets the overflow status if a type
142 overflows in a narrowing integer conversion, but Java
144 tree tmp = fold (convert_to_integer (type, expr));
145 if (TREE_CODE (tmp) == INTEGER_CST)
146 TREE_OVERFLOW (tmp) = 0;
150 if (code == REAL_TYPE)
151 return fold (convert_to_real (type, expr));
152 if (code == POINTER_TYPE)
153 return fold (convert_to_pointer (type, expr));
154 error ("conversion to non-scalar type requested");
155 return error_mark_node;
159 /* Return a data type that has machine mode MODE.
160 If the mode is an integer,
161 then UNSIGNEDP selects between signed and unsigned types. */
164 java_type_for_mode (enum machine_mode mode, int unsignedp)
166 if (mode == TYPE_MODE (int_type_node))
167 return unsignedp ? unsigned_int_type_node : int_type_node;
168 if (mode == TYPE_MODE (long_type_node))
169 return unsignedp ? unsigned_long_type_node : long_type_node;
170 if (mode == TYPE_MODE (short_type_node))
171 return unsignedp ? unsigned_short_type_node : short_type_node;
172 if (mode == TYPE_MODE (byte_type_node))
173 return unsignedp ? unsigned_byte_type_node : byte_type_node;
174 if (mode == TYPE_MODE (float_type_node))
175 return float_type_node;
176 if (mode == TYPE_MODE (double_type_node))
177 return double_type_node;
182 /* Return an integer type with BITS bits of precision,
183 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
186 java_type_for_size (unsigned bits, int unsignedp)
188 if (bits <= TYPE_PRECISION (byte_type_node))
189 return unsignedp ? unsigned_byte_type_node : byte_type_node;
190 if (bits <= TYPE_PRECISION (short_type_node))
191 return unsignedp ? unsigned_short_type_node : short_type_node;
192 if (bits <= TYPE_PRECISION (int_type_node))
193 return unsignedp ? unsigned_int_type_node : int_type_node;
194 if (bits <= TYPE_PRECISION (long_type_node))
195 return unsignedp ? unsigned_long_type_node : long_type_node;
199 /* Return a type the same as TYPE except unsigned or
200 signed according to UNSIGNEDP. */
203 java_signed_or_unsigned_type (int unsignedp, tree type)
205 if (! INTEGRAL_TYPE_P (type))
207 if (TYPE_PRECISION (type) == TYPE_PRECISION (int_type_node))
208 return unsignedp ? unsigned_int_type_node : int_type_node;
209 if (TYPE_PRECISION (type) == TYPE_PRECISION (byte_type_node))
210 return unsignedp ? unsigned_byte_type_node : byte_type_node;
211 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_type_node))
212 return unsignedp ? unsigned_short_type_node : short_type_node;
213 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_type_node))
214 return unsignedp ? unsigned_long_type_node : long_type_node;
218 /* Return a signed type the same as TYPE in other respects. */
221 java_signed_type (tree type)
223 return java_signed_or_unsigned_type (0, type);
226 /* Return an unsigned type the same as TYPE in other respects. */
229 java_unsigned_type (tree type)
231 return java_signed_or_unsigned_type (1, type);
234 /* Mark EXP saying that we need to be able to take the
235 address of it; it should not be allocated in a register.
236 Value is true if successful. */
239 java_mark_addressable (tree exp)
243 switch (TREE_CODE (x))
250 x = TREE_OPERAND (x, 0);
253 case TRUTH_ANDIF_EXPR:
254 case TRUTH_ORIF_EXPR:
256 x = TREE_OPERAND (x, 1);
260 return java_mark_addressable (TREE_OPERAND (x, 1))
261 && java_mark_addressable (TREE_OPERAND (x, 2));
264 TREE_ADDRESSABLE (x) = 1;
268 /* We sometimes add a cast *(TYPE*)&FOO to handle type and mode
269 incompatibility problems. Handle this case by marking FOO. */
270 if (TREE_CODE (TREE_OPERAND (x, 0)) == NOP_EXPR
271 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (x, 0), 0)) == ADDR_EXPR)
273 x = TREE_OPERAND (TREE_OPERAND (x, 0), 0);
276 if (TREE_CODE (TREE_OPERAND (x, 0)) == ADDR_EXPR)
278 x = TREE_OPERAND (x, 0);
288 TREE_ADDRESSABLE (x) = 1;
289 #if 0 /* poplevel deals with this now. */
290 if (DECL_CONTEXT (x) == 0)
291 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
299 /* Thorough checking of the arrayness of TYPE. */
302 is_array_type_p (tree type)
304 return TREE_CODE (type) == POINTER_TYPE
305 && TREE_CODE (TREE_TYPE (type)) == RECORD_TYPE
306 && TYPE_ARRAY_P (TREE_TYPE (type));
309 /* Return the length of a Java array type.
310 Return -1 if the length is unknown or non-constant. */
313 java_array_type_length (tree array_type)
316 if (TREE_CODE (array_type) == POINTER_TYPE)
317 array_type = TREE_TYPE (array_type);
318 arfld = TREE_CHAIN (TREE_CHAIN (TYPE_FIELDS (array_type)));
319 if (arfld != NULL_TREE)
321 tree index_type = TYPE_DOMAIN (TREE_TYPE (arfld));
322 if (index_type != NULL_TREE)
324 tree high = TYPE_MAX_VALUE (index_type);
325 if (TREE_CODE (high) == INTEGER_CST)
326 return TREE_INT_CST_LOW (high) + 1;
332 /* An array of unknown length will be ultimately given a length of
333 -2, so that we can still have `length' producing a negative value
334 even if found. This was part of an optimization aiming at removing
335 `length' from static arrays. We could restore it, FIXME. */
338 build_prim_array_type (tree element_type, HOST_WIDE_INT length)
344 tree max_index = build_int_cst (sizetype, length - 1);
345 index = build_index_type (max_index);
347 return build_array_type (element_type, index);
350 /* Return a Java array type with a given ELEMENT_TYPE and LENGTH.
351 These are hashed (shared) using IDENTIFIER_SIGNATURE_TYPE.
352 The LENGTH is -1 if the length is unknown. */
355 build_java_array_type (tree element_type, HOST_WIDE_INT length)
357 tree sig, t, fld, atype, arfld;
359 tree elsig = build_java_signature (element_type);
360 tree el_name = element_type;
363 sprintf (buf+1, HOST_WIDE_INT_PRINT_DEC, length);
366 sig = ident_subst (IDENTIFIER_POINTER (elsig), IDENTIFIER_LENGTH (elsig),
368 t = IDENTIFIER_SIGNATURE_TYPE (sig);
370 return TREE_TYPE (t);
372 IDENTIFIER_SIGNATURE_TYPE (sig) = build_pointer_type (t);
373 TYPE_ARRAY_P (t) = 1;
375 if (TREE_CODE (el_name) == POINTER_TYPE)
376 el_name = TREE_TYPE (el_name);
377 el_name = TYPE_NAME (el_name);
378 if (TREE_CODE (el_name) == TYPE_DECL)
379 el_name = DECL_NAME (el_name);
383 sprintf (suffix, "[%d]", (int)length);
385 strcpy (suffix, "[]");
387 = build_decl (TYPE_DECL,
388 identifier_subst (el_name, "", '.', '.', suffix),
392 set_java_signature (t, sig);
393 set_super_info (0, t, object_type_node, 0);
394 if (TREE_CODE (element_type) == RECORD_TYPE)
395 element_type = promote_type (element_type);
396 TYPE_ARRAY_ELEMENT (t) = element_type;
398 /* Add length pseudo-field. */
399 fld = build_decl (FIELD_DECL, get_identifier ("length"), int_type_node);
400 TYPE_FIELDS (t) = fld;
401 DECL_CONTEXT (fld) = t;
402 FIELD_PUBLIC (fld) = 1;
403 FIELD_FINAL (fld) = 1;
404 TREE_READONLY (fld) = 1;
406 atype = build_prim_array_type (element_type, length);
407 arfld = build_decl (FIELD_DECL, get_identifier ("data"), atype);
408 DECL_CONTEXT (arfld) = t;
409 TREE_CHAIN (fld) = arfld;
410 DECL_ALIGN (arfld) = TYPE_ALIGN (element_type);
412 /* We could layout_class, but that loads java.lang.Object prematurely.
413 * This is called by the parser, and it is a bad idea to do load_class
414 * in the middle of parsing, because of possible circularity problems. */
415 push_super_field (t, object_type_node);
421 /* Promote TYPE to the type actually used for fields and parameters. */
424 promote_type (tree type)
426 switch (TREE_CODE (type))
429 return build_pointer_type (type);
431 if (type == boolean_type_node)
432 return promoted_boolean_type_node;
435 if (type == char_type_node)
436 return promoted_char_type_node;
440 if (TYPE_PRECISION (type) < TYPE_PRECISION (int_type_node))
442 if (type == short_type_node)
443 return promoted_short_type_node;
444 if (type == byte_type_node)
445 return promoted_byte_type_node;
446 return int_type_node;
448 /* ... else fall through ... */
454 /* Parse a signature string, starting at *PTR and ending at LIMIT.
455 Return the seen TREE_TYPE, updating *PTR. */
458 parse_signature_type (const unsigned char **ptr, const unsigned char *limit)
467 case 'B': (*ptr)++; return byte_type_node;
468 case 'C': (*ptr)++; return char_type_node;
469 case 'D': (*ptr)++; return double_type_node;
470 case 'F': (*ptr)++; return float_type_node;
471 case 'S': (*ptr)++; return short_type_node;
472 case 'I': (*ptr)++; return int_type_node;
473 case 'J': (*ptr)++; return long_type_node;
474 case 'Z': (*ptr)++; return boolean_type_node;
475 case 'V': (*ptr)++; return void_type_node;
477 for ((*ptr)++; (*ptr) < limit && ISDIGIT (**ptr); ) (*ptr)++;
478 type = parse_signature_type (ptr, limit);
479 type = build_java_array_type (type, -1);
483 const unsigned char *start = ++(*ptr);
484 const unsigned char *str = start;
493 type = lookup_class (unmangle_classname ((const char *) start, str - start));
499 return promote_type (type);
502 /* Parse a Java "mangled" signature string, starting at SIG_STRING,
503 and SIG_LENGTH bytes long.
504 Return a gcc type node. */
507 parse_signature_string (const unsigned char *sig_string, int sig_length)
510 const unsigned char *str = sig_string;
511 const unsigned char *limit = str + sig_length;
513 if (str < limit && str[0] == '(')
515 tree argtype_list = NULL_TREE;
517 while (str < limit && str[0] != ')')
519 tree argtype = parse_signature_type (&str, limit);
520 argtype_list = tree_cons (NULL_TREE, argtype, argtype_list);
522 if (str++, str >= limit)
524 result_type = parse_signature_type (&str, limit);
525 argtype_list = chainon (nreverse (argtype_list), end_params_node);
526 result_type = build_function_type (result_type, argtype_list);
529 result_type = parse_signature_type (&str, limit);
531 error ("junk at end of signature string");
535 /* Convert a signature to its type.
536 * Uses IDENTIFIER_SIGNATURE_TYPE as a cache (except for primitive types).
540 get_type_from_signature (tree signature)
542 const unsigned char *sig = (const unsigned char *) IDENTIFIER_POINTER (signature);
543 int len = IDENTIFIER_LENGTH (signature);
545 /* Primitive types aren't cached. */
547 return parse_signature_string (sig, len);
548 type = IDENTIFIER_SIGNATURE_TYPE (signature);
549 if (type == NULL_TREE)
551 type = parse_signature_string (sig, len);
552 IDENTIFIER_SIGNATURE_TYPE (signature) = type;
557 /* Ignore signature and always return null. Used by has_method. */
560 build_null_signature (tree type ATTRIBUTE_UNUSED)
565 /* Return the signature string for the arguments of method type TYPE. */
568 build_java_argument_signature (tree type)
570 extern struct obstack temporary_obstack;
571 tree sig = TYPE_ARGUMENT_SIGNATURE (type);
572 if (sig == NULL_TREE)
574 tree args = TYPE_ARG_TYPES (type);
575 if (TREE_CODE (type) == METHOD_TYPE)
576 args = TREE_CHAIN (args); /* Skip "this" argument. */
577 for (; args != end_params_node; args = TREE_CHAIN (args))
579 tree t = build_java_signature (TREE_VALUE (args));
580 obstack_grow (&temporary_obstack,
581 IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t));
583 obstack_1grow (&temporary_obstack, '\0');
585 sig = get_identifier (obstack_base (&temporary_obstack));
586 TYPE_ARGUMENT_SIGNATURE (type) = sig;
587 obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
592 /* Return the signature of the given TYPE. */
595 build_java_signature (tree type)
598 while (TREE_CODE (type) == POINTER_TYPE)
599 type = TREE_TYPE (type);
600 MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC (type);
601 sig = TYPE_SIGNATURE (type);
602 if (sig == NULL_TREE)
605 switch (TREE_CODE (type))
607 case BOOLEAN_TYPE: sg[0] = 'Z'; goto native;
608 case CHAR_TYPE: sg[0] = 'C'; goto native;
609 case VOID_TYPE: sg[0] = 'V'; goto native;
611 switch (TYPE_PRECISION (type))
613 case 8: sg[0] = 'B'; goto native;
614 case 16: sg[0] = 'S'; goto native;
615 case 32: sg[0] = 'I'; goto native;
616 case 64: sg[0] = 'J'; goto native;
617 default: goto bad_type;
620 switch (TYPE_PRECISION (type))
622 case 32: sg[0] = 'F'; goto native;
623 case 64: sg[0] = 'D'; goto native;
624 default: goto bad_type;
628 sig = get_identifier (sg);
631 if (TYPE_ARRAY_P (type))
633 t = build_java_signature (TYPE_ARRAY_ELEMENT (type));
634 sig = ident_subst (IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t),
639 t = DECL_NAME (TYPE_NAME (type));
640 sig = ident_subst (IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t),
647 extern struct obstack temporary_obstack;
648 sig = build_java_argument_signature (type);
649 obstack_1grow (&temporary_obstack, '(');
650 obstack_grow (&temporary_obstack,
651 IDENTIFIER_POINTER (sig), IDENTIFIER_LENGTH (sig));
652 obstack_1grow (&temporary_obstack, ')');
654 t = build_java_signature (TREE_TYPE (type));
655 obstack_grow0 (&temporary_obstack,
656 IDENTIFIER_POINTER (t), IDENTIFIER_LENGTH (t));
658 sig = get_identifier (obstack_base (&temporary_obstack));
659 obstack_free (&temporary_obstack,
660 obstack_base (&temporary_obstack));
667 TYPE_SIGNATURE (type) = sig;
672 /* Save signature string SIG (an IDENTIFIER_NODE) in TYPE for future use. */
675 set_java_signature (tree type, tree sig)
678 while (TREE_CODE (type) == POINTER_TYPE)
679 type = TREE_TYPE (type);
680 MAYBE_CREATE_TYPE_TYPE_LANG_SPECIFIC (type);
681 old_sig = TYPE_SIGNATURE (type);
682 if (old_sig != NULL_TREE && old_sig != sig)
684 TYPE_SIGNATURE (type) = sig;
685 #if 0 /* careful about METHOD_TYPE */
686 if (IDENTIFIER_SIGNATURE_TYPE (sig) == NULL_TREE && TREE_PERMANENT (type))
687 IDENTIFIER_SIGNATURE_TYPE (sig) = type;
691 /* Search in SEARCHED_CLASS and its superclasses for a method matching
692 METHOD_NAME and signature METHOD_SIGNATURE. This function will
693 only search for methods declared in the class hierarchy; interfaces
694 will not be considered. Returns NULL_TREE if the method is not
697 lookup_argument_method (tree searched_class, tree method_name,
698 tree method_signature)
700 return lookup_do (searched_class, 0,
701 method_name, method_signature,
702 build_java_argument_signature);
705 /* Like lookup_argument_method, but lets the caller set any flags
708 lookup_argument_method_generic (tree searched_class, tree method_name,
709 tree method_signature, int flags)
711 return lookup_do (searched_class, flags,
712 method_name, method_signature,
713 build_java_argument_signature);
717 /* Search in class SEARCHED_CLASS (and its superclasses) for a method
718 matching METHOD_NAME and signature METHOD_SIGNATURE. Return a
719 FUNCTION_DECL on success, or NULL_TREE if none found. (Contrast
720 lookup_argument_method, which ignores return type.) If
721 SEARCHED_CLASS is an interface, search it too. */
723 lookup_java_method (tree searched_class, tree method_name,
724 tree method_signature)
726 return lookup_do (searched_class, SEARCH_INTERFACE, method_name,
727 method_signature, build_java_signature);
730 /* Return true iff CLASS (or its ancestors) has a method METHOD_NAME. */
732 has_method (tree class, tree method_name)
734 return lookup_do (class, SEARCH_INTERFACE,
735 method_name, NULL_TREE,
736 build_null_signature) != NULL_TREE;
739 /* Search in class SEARCHED_CLASS, but not its superclasses, for a
740 method matching METHOD_NAME and signature SIGNATURE. A private
741 helper for lookup_do. */
743 shallow_find_method (tree searched_class, int flags, tree method_name,
744 tree signature, tree (*signature_builder) (tree))
747 for (method = TYPE_METHODS (searched_class);
748 method != NULL_TREE; method = TREE_CHAIN (method))
750 tree method_sig = (*signature_builder) (TREE_TYPE (method));
751 if (DECL_NAME (method) == method_name && method_sig == signature)
753 /* If the caller requires a visible method, then we
754 skip invisible methods here. */
755 if (! (flags & SEARCH_VISIBLE)
756 || ! METHOD_INVISIBLE (method))
763 /* Search in the superclasses of SEARCHED_CLASS for a method matching
764 METHOD_NAME and signature SIGNATURE. A private helper for
767 find_method_in_superclasses (tree searched_class, int flags,
768 tree method_name, tree signature,
769 tree (*signature_builder) (tree))
772 for (klass = CLASSTYPE_SUPER (searched_class); klass != NULL_TREE;
773 klass = CLASSTYPE_SUPER (klass))
776 method = shallow_find_method (klass, flags, method_name,
777 signature, signature_builder);
778 if (method != NULL_TREE)
785 /* Search in the interfaces of SEARCHED_CLASS and its superinterfaces
786 for a method matching METHOD_NAME and signature SIGNATURE. A
787 private helper for lookup_do. */
789 find_method_in_interfaces (tree searched_class, int flags, tree method_name,
790 tree signature, tree (*signature_builder) (tree))
793 tree binfo, base_binfo;
795 for (binfo = TYPE_BINFO (searched_class), i = 1;
796 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
798 tree iclass = BINFO_TYPE (base_binfo);
801 /* If the superinterface hasn't been loaded yet, do so now. */
802 if (CLASS_FROM_SOURCE_P (iclass))
803 safe_layout_class (iclass);
804 else if (!CLASS_LOADED_P (iclass))
805 load_class (iclass, 1);
807 /* First, we look in ICLASS. If that doesn't work we'll
808 recursively look through all its superinterfaces. */
809 method = shallow_find_method (iclass, flags, method_name,
810 signature, signature_builder);
811 if (method != NULL_TREE)
814 method = find_method_in_interfaces
815 (iclass, flags, method_name, signature, signature_builder);
816 if (method != NULL_TREE)
824 /* Search in class SEARCHED_CLASS (and its superclasses) for a method
825 matching METHOD_NAME and signature SIGNATURE. FLAGS control some
826 parameters of the search.
828 SEARCH_INTERFACE means also search interfaces and superinterfaces
831 SEARCH_SUPER means skip SEARCHED_CLASS and start with its
834 SEARCH_VISIBLE means skip methods for which METHOD_INVISIBLE is
837 Return the matched method DECL or NULL_TREE. SIGNATURE_BUILDER is
838 used on method candidates to build their (sometimes partial)
841 lookup_do (tree searched_class, int flags, tree method_name,
842 tree signature, tree (*signature_builder) (tree))
845 tree orig_class = searched_class;
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 (orig_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;