1 /* Process expressions for the GNU compiler for the Java(TM) language.
2 Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 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, 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 /* Hacked by Per Bothner <bothner@cygnus.com> February 1996. */
30 #include "coretypes.h"
37 #include "java-tree.h"
39 #include "java-opcodes.h"
41 #include "java-except.h"
46 #include "tree-gimple.h"
49 static void flush_quick_stack (void);
50 static void push_value (tree);
51 static tree pop_value (tree);
52 static void java_stack_swap (void);
53 static void java_stack_dup (int, int);
54 static void build_java_athrow (tree);
55 static void build_java_jsr (int, int);
56 static void build_java_ret (tree);
57 static void expand_java_multianewarray (tree, int);
58 static void expand_java_arraystore (tree);
59 static void expand_java_arrayload (tree);
60 static void expand_java_array_length (void);
61 static tree build_java_monitor (tree, tree);
62 static void expand_java_pushc (int, tree);
63 static void expand_java_return (tree);
64 static void expand_load_internal (int, tree, int);
65 static void expand_java_NEW (tree);
66 static void expand_java_INSTANCEOF (tree);
67 static void expand_java_CHECKCAST (tree);
68 static void expand_iinc (unsigned int, int, int);
69 static void expand_java_binop (tree, enum tree_code);
70 static void note_label (int, int);
71 static void expand_compare (enum tree_code, tree, tree, int);
72 static void expand_test (enum tree_code, tree, int);
73 static void expand_cond (enum tree_code, tree, int);
74 static void expand_java_goto (int);
75 static tree expand_java_switch (tree, int);
76 static void expand_java_add_case (tree, int, int);
78 static void expand_java_call (int, int);
79 static void expand_java_ret (tree);
81 static tree pop_arguments (tree);
82 static void expand_invoke (int, int, int);
83 static void expand_java_field_op (int, int, int);
84 static void java_push_constant_from_pool (struct JCF *, int);
85 static void java_stack_pop (int);
86 static tree build_java_throw_out_of_bounds_exception (tree);
87 static tree build_java_check_indexed_type (tree, tree);
88 static unsigned char peek_opcode_at_pc (struct JCF *, int, int);
89 static void promote_arguments (void);
91 static GTY(()) tree operand_type[59];
93 static GTY(()) tree methods_ident;
94 static GTY(()) tree ncode_ident;
95 tree dtable_ident = NULL_TREE;
97 /* Set to nonzero value in order to emit class initialization code
98 before static field references. */
99 int always_initialize_class_p = 0;
101 /* We store the stack state in two places:
102 Within a basic block, we use the quick_stack, which is a
103 pushdown list (TREE_LISTs) of expression nodes.
104 This is the top part of the stack; below that we use find_stack_slot.
105 At the end of a basic block, the quick_stack must be flushed
106 to the stack slot array (as handled by find_stack_slot).
107 Using quick_stack generates better code (especially when
108 compiled without optimization), because we do not have to
109 explicitly store and load trees to temporary variables.
111 If a variable is on the quick stack, it means the value of variable
112 when the quick stack was last flushed. Conceptually, flush_quick_stack
113 saves all the quick_stack elements in parallel. However, that is
114 complicated, so it actually saves them (i.e. copies each stack value
115 to is home virtual register) from low indexes. This allows a quick_stack
116 element at index i (counting from the bottom of stack the) to references
117 slot virtuals for register that are >= i, but not those that are deeper.
118 This convention makes most operations easier. For example iadd works
119 even when the stack contains (reg[0], reg[1]): It results in the
120 stack containing (reg[0]+reg[1]), which is OK. However, some stack
121 operations are more complicated. For example dup given a stack
122 containing (reg[0]) would yield (reg[0], reg[0]), which would violate
123 the convention, since stack value 1 would refer to a register with
124 lower index (reg[0]), which flush_quick_stack does not safely handle.
125 So dup cannot just add an extra element to the quick_stack, but iadd can.
128 static GTY(()) tree quick_stack;
130 /* A free-list of unused permanent TREE_LIST nodes. */
131 static GTY((deletable)) tree tree_list_free_list;
133 /* The stack pointer of the Java virtual machine.
134 This does include the size of the quick_stack. */
138 const unsigned char *linenumber_table;
139 int linenumber_count;
142 init_expr_processing (void)
144 operand_type[21] = operand_type[54] = int_type_node;
145 operand_type[22] = operand_type[55] = long_type_node;
146 operand_type[23] = operand_type[56] = float_type_node;
147 operand_type[24] = operand_type[57] = double_type_node;
148 operand_type[25] = operand_type[58] = ptr_type_node;
152 java_truthvalue_conversion (tree expr)
154 /* It is simpler and generates better code to have only TRUTH_*_EXPR
155 or comparison expressions as truth values at this level.
157 This function should normally be identity for Java. */
159 switch (TREE_CODE (expr))
161 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
162 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
163 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
164 case ORDERED_EXPR: case UNORDERED_EXPR:
165 case TRUTH_ANDIF_EXPR:
166 case TRUTH_ORIF_EXPR:
175 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
178 return real_zerop (expr) ? boolean_false_node : boolean_true_node;
180 /* are these legal? XXX JH */
184 /* These don't change whether an object is nonzero or zero. */
185 return java_truthvalue_conversion (TREE_OPERAND (expr, 0));
188 /* Distribute the conversion into the arms of a COND_EXPR. */
190 (build3 (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
191 java_truthvalue_conversion (TREE_OPERAND (expr, 1)),
192 java_truthvalue_conversion (TREE_OPERAND (expr, 2))));
195 /* If this is widening the argument, we can ignore it. */
196 if (TYPE_PRECISION (TREE_TYPE (expr))
197 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
198 return java_truthvalue_conversion (TREE_OPERAND (expr, 0));
199 /* fall through to default */
202 return fold (build2 (NE_EXPR, boolean_type_node,
203 expr, boolean_false_node));
207 /* Save any stack slots that happen to be in the quick_stack into their
208 home virtual register slots.
210 The copy order is from low stack index to high, to support the invariant
211 that the expression for a slot may contain decls for stack slots with
212 higher (or the same) index, but not lower. */
215 flush_quick_stack (void)
217 int stack_index = stack_pointer;
218 tree prev, cur, next;
220 /* First reverse the quick_stack, and count the number of slots it has. */
221 for (cur = quick_stack, prev = NULL_TREE; cur != NULL_TREE; cur = next)
223 next = TREE_CHAIN (cur);
224 TREE_CHAIN (cur) = prev;
226 stack_index -= 1 + TYPE_IS_WIDE (TREE_TYPE (TREE_VALUE (cur)));
230 while (quick_stack != NULL_TREE)
233 tree node = quick_stack, type;
234 quick_stack = TREE_CHAIN (node);
235 TREE_CHAIN (node) = tree_list_free_list;
236 tree_list_free_list = node;
237 node = TREE_VALUE (node);
238 type = TREE_TYPE (node);
240 decl = find_stack_slot (stack_index, type);
242 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (node), decl, node));
243 stack_index += 1 + TYPE_IS_WIDE (type);
247 /* Push TYPE on the type stack.
248 Return true on success, 0 on overflow. */
251 push_type_0 (tree type)
254 type = promote_type (type);
255 n_words = 1 + TYPE_IS_WIDE (type);
256 if (stack_pointer + n_words > DECL_MAX_STACK (current_function_decl))
258 /* Allocate decl for this variable now, so we get a temporary that
259 survives the whole method. */
260 find_stack_slot (stack_pointer, type);
261 stack_type_map[stack_pointer++] = type;
263 while (--n_words >= 0)
264 stack_type_map[stack_pointer++] = TYPE_SECOND;
269 push_type (tree type)
271 if (! push_type_0 (type))
276 push_value (tree value)
278 tree type = TREE_TYPE (value);
279 if (TYPE_PRECISION (type) < 32 && INTEGRAL_TYPE_P (type))
281 type = promote_type (type);
282 value = convert (type, value);
285 if (tree_list_free_list == NULL_TREE)
286 quick_stack = tree_cons (NULL_TREE, value, quick_stack);
289 tree node = tree_list_free_list;
290 tree_list_free_list = TREE_CHAIN (tree_list_free_list);
291 TREE_VALUE (node) = value;
292 TREE_CHAIN (node) = quick_stack;
297 /* Pop a type from the type stack.
298 TYPE is the expected type. Return the actual type, which must be
300 On an error, *MESSAGEP is set to a freshly malloc'd error message. */
303 pop_type_0 (tree type, char **messagep)
308 if (TREE_CODE (type) == RECORD_TYPE)
309 type = promote_type (type);
310 n_words = 1 + TYPE_IS_WIDE (type);
311 if (stack_pointer < n_words)
313 *messagep = xstrdup ("stack underflow");
316 while (--n_words > 0)
318 if (stack_type_map[--stack_pointer] != void_type_node)
320 *messagep = xstrdup ("Invalid multi-word value on type stack");
324 t = stack_type_map[--stack_pointer];
325 if (type == NULL_TREE || t == type)
327 if (TREE_CODE (t) == TREE_LIST)
331 tree tt = TREE_PURPOSE (t);
332 if (! can_widen_reference_to (tt, type))
342 if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (t)
343 && TYPE_PRECISION (type) <= 32 && TYPE_PRECISION (t) <= 32)
345 if (TREE_CODE (type) == POINTER_TYPE && TREE_CODE (t) == POINTER_TYPE)
347 if (flag_new_verifier)
349 /* Since the verifier has already run, we know that any
350 types we see will be compatible. In BC mode, this fact
351 may be checked at runtime, but if that is so then we can
352 assume its truth here as well. So, we always succeed
353 here, with the expected type. */
358 if (type == ptr_type_node || type == object_ptr_type_node)
360 else if (t == ptr_type_node) /* Special case for null reference. */
362 /* This is a kludge, but matches what Sun's verifier does.
363 It can be tricked, but is safe as long as type errors
364 (i.e. interface method calls) are caught at run-time. */
365 else if (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (type))))
366 return object_ptr_type_node;
367 else if (can_widen_reference_to (t, type))
372 if (! flag_verify_invocations && flag_indirect_dispatch
373 && t == object_ptr_type_node)
375 if (type != ptr_type_node)
376 warning ("need to insert runtime check for %s",
377 xstrdup (lang_printable_name (type, 0)));
381 /* lang_printable_name uses a static buffer, so we must save the result
382 from calling it the first time. */
385 char *temp = xstrdup (lang_printable_name (type, 0));
386 /* If the stack contains a multi-word type, keep popping the stack until
387 the real type is found. */
388 while (t == void_type_node)
389 t = stack_type_map[--stack_pointer];
390 *messagep = concat ("expected type '", temp,
391 "' but stack contains '", lang_printable_name (t, 0),
398 /* Pop a type from the type stack.
399 TYPE is the expected type. Return the actual type, which must be
400 convertible to TYPE, otherwise call error. */
405 char *message = NULL;
406 type = pop_type_0 (type, &message);
409 error ("%s", message);
416 /* Return true if two type assertions are equal. */
419 type_assertion_eq (const void * k1_p, const void * k2_p)
421 type_assertion k1 = *(type_assertion *)k1_p;
422 type_assertion k2 = *(type_assertion *)k2_p;
423 return (k1.assertion_code == k2.assertion_code
425 && k1.op2 == k2.op2);
428 /* Hash a type assertion. */
431 type_assertion_hash (const void *p)
433 const type_assertion *k_p = p;
434 hashval_t hash = iterative_hash (&k_p->assertion_code, sizeof
435 k_p->assertion_code, 0);
436 hash = iterative_hash (&k_p->op1, sizeof k_p->op1, hash);
437 return iterative_hash (&k_p->op2, sizeof k_p->op2, hash);
440 /* Add an entry to the type assertion table for the given class.
441 CLASS is the class for which this assertion will be evaluated by the
442 runtime during loading/initialization.
443 ASSERTION_CODE is the 'opcode' or type of this assertion: see java-tree.h.
444 OP1 and OP2 are the operands. The tree type of these arguments may be
445 specific to each assertion_code. */
448 add_type_assertion (tree class, int assertion_code, tree op1, tree op2)
450 htab_t assertions_htab;
454 assertions_htab = TYPE_ASSERTIONS (class);
455 if (assertions_htab == NULL)
457 assertions_htab = htab_create_ggc (7, type_assertion_hash,
458 type_assertion_eq, NULL);
459 TYPE_ASSERTIONS (current_class) = assertions_htab;
462 as.assertion_code = assertion_code;
466 as_pp = htab_find_slot (assertions_htab, &as, INSERT);
468 /* Don't add the same assertion twice. */
472 *as_pp = ggc_alloc (sizeof (type_assertion));
473 **(type_assertion **)as_pp = as;
477 /* Return 1 if SOURCE_TYPE can be safely widened to TARGET_TYPE.
478 Handles array types and interfaces. */
481 can_widen_reference_to (tree source_type, tree target_type)
483 if (source_type == ptr_type_node || target_type == object_ptr_type_node)
486 /* Get rid of pointers */
487 if (TREE_CODE (source_type) == POINTER_TYPE)
488 source_type = TREE_TYPE (source_type);
489 if (TREE_CODE (target_type) == POINTER_TYPE)
490 target_type = TREE_TYPE (target_type);
492 if (source_type == target_type)
495 /* FIXME: This is very pessimistic, in that it checks everything,
496 even if we already know that the types are compatible. If we're
497 to support full Java class loader semantics, we need this.
498 However, we could do something more optimal. */
499 if (! flag_verify_invocations)
501 add_type_assertion (current_class, JV_ASSERT_TYPES_COMPATIBLE,
502 source_type, target_type);
505 warning ("assert: %s is assign compatible with %s",
506 xstrdup (lang_printable_name (target_type, 0)),
507 xstrdup (lang_printable_name (source_type, 0)));
508 /* Punt everything to runtime. */
512 if (TYPE_DUMMY (source_type) || TYPE_DUMMY (target_type))
518 if (TYPE_ARRAY_P (source_type) || TYPE_ARRAY_P (target_type))
520 HOST_WIDE_INT source_length, target_length;
521 if (TYPE_ARRAY_P (source_type) != TYPE_ARRAY_P (target_type))
523 /* An array implements Cloneable and Serializable. */
524 tree name = DECL_NAME (TYPE_NAME (target_type));
525 return (name == java_lang_cloneable_identifier_node
526 || name == java_io_serializable_identifier_node);
528 target_length = java_array_type_length (target_type);
529 if (target_length >= 0)
531 source_length = java_array_type_length (source_type);
532 if (source_length != target_length)
535 source_type = TYPE_ARRAY_ELEMENT (source_type);
536 target_type = TYPE_ARRAY_ELEMENT (target_type);
537 if (source_type == target_type)
539 if (TREE_CODE (source_type) != POINTER_TYPE
540 || TREE_CODE (target_type) != POINTER_TYPE)
542 return can_widen_reference_to (source_type, target_type);
546 int source_depth = class_depth (source_type);
547 int target_depth = class_depth (target_type);
549 if (TYPE_DUMMY (source_type) || TYPE_DUMMY (target_type))
552 warning ("assert: %s is assign compatible with %s",
553 xstrdup (lang_printable_name (target_type, 0)),
554 xstrdup (lang_printable_name (source_type, 0)));
558 /* class_depth can return a negative depth if an error occurred */
559 if (source_depth < 0 || target_depth < 0)
562 if (CLASS_INTERFACE (TYPE_NAME (target_type)))
564 /* target_type is OK if source_type or source_type ancestors
565 implement target_type. We handle multiple sub-interfaces */
566 tree binfo, base_binfo;
569 for (binfo = TYPE_BINFO (source_type), i = 0;
570 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
571 if (can_widen_reference_to
572 (BINFO_TYPE (base_binfo), target_type))
579 for ( ; source_depth > target_depth; source_depth--)
582 = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (source_type), 0));
584 return source_type == target_type;
590 pop_value (tree type)
592 type = pop_type (type);
595 tree node = quick_stack;
596 quick_stack = TREE_CHAIN (quick_stack);
597 TREE_CHAIN (node) = tree_list_free_list;
598 tree_list_free_list = node;
599 node = TREE_VALUE (node);
603 return find_stack_slot (stack_pointer, promote_type (type));
607 /* Pop and discard the top COUNT stack slots. */
610 java_stack_pop (int count)
616 if (stack_pointer == 0)
619 type = stack_type_map[stack_pointer - 1];
620 if (type == TYPE_SECOND)
623 if (stack_pointer == 1 || count <= 0)
626 type = stack_type_map[stack_pointer - 2];
628 val = pop_value (type);
633 /* Implement the 'swap' operator (to swap two top stack slots). */
636 java_stack_swap (void)
642 if (stack_pointer < 2
643 || (type1 = stack_type_map[stack_pointer - 1]) == TYPE_UNKNOWN
644 || (type2 = stack_type_map[stack_pointer - 2]) == TYPE_UNKNOWN
645 || type1 == TYPE_SECOND || type2 == TYPE_SECOND
646 || TYPE_IS_WIDE (type1) || TYPE_IS_WIDE (type2))
647 /* Bad stack swap. */
650 flush_quick_stack ();
651 decl1 = find_stack_slot (stack_pointer - 1, type1);
652 decl2 = find_stack_slot (stack_pointer - 2, type2);
653 temp = build_decl (VAR_DECL, NULL_TREE, type1);
654 java_add_local_var (temp);
655 java_add_stmt (build2 (MODIFY_EXPR, type1, temp, decl1));
656 java_add_stmt (build2 (MODIFY_EXPR, type2,
657 find_stack_slot (stack_pointer - 1, type2),
659 java_add_stmt (build2 (MODIFY_EXPR, type1,
660 find_stack_slot (stack_pointer - 2, type1),
662 stack_type_map[stack_pointer - 1] = type2;
663 stack_type_map[stack_pointer - 2] = type1;
667 java_stack_dup (int size, int offset)
669 int low_index = stack_pointer - size - offset;
672 error ("stack underflow - dup* operation");
674 flush_quick_stack ();
676 stack_pointer += size;
677 dst_index = stack_pointer;
679 for (dst_index = stack_pointer; --dst_index >= low_index; )
682 int src_index = dst_index - size;
683 if (src_index < low_index)
684 src_index = dst_index + size + offset;
685 type = stack_type_map [src_index];
686 if (type == TYPE_SECOND)
688 if (src_index <= low_index)
689 /* Dup operation splits 64-bit number. */
692 stack_type_map[dst_index] = type;
693 src_index--; dst_index--;
694 type = stack_type_map[src_index];
695 if (! TYPE_IS_WIDE (type))
698 else if (TYPE_IS_WIDE (type))
701 if (src_index != dst_index)
703 tree src_decl = find_stack_slot (src_index, type);
704 tree dst_decl = find_stack_slot (dst_index, type);
707 (build2 (MODIFY_EXPR, TREE_TYPE (dst_decl), dst_decl, src_decl));
708 stack_type_map[dst_index] = type;
713 /* Calls _Jv_Throw or _Jv_Sjlj_Throw. Discard the contents of the
717 build_java_athrow (tree node)
721 call = build3 (CALL_EXPR,
723 build_address_of (throw_node),
724 build_tree_list (NULL_TREE, node),
726 TREE_SIDE_EFFECTS (call) = 1;
727 java_add_stmt (call);
728 java_stack_pop (stack_pointer);
731 /* Implementation for jsr/ret */
734 build_java_jsr (int target_pc, int return_pc)
736 tree where = lookup_label (target_pc);
737 tree ret = lookup_label (return_pc);
738 tree ret_label = fold (build1 (ADDR_EXPR, return_address_type_node, ret));
739 push_value (ret_label);
740 flush_quick_stack ();
741 java_add_stmt (build1 (GOTO_EXPR, void_type_node, where));
743 /* Do not need to emit the label here. We noted the existence of the
744 label as a jump target in note_instructions; we'll emit the label
745 for real at the beginning of the expand_byte_code loop. */
749 build_java_ret (tree location)
751 java_add_stmt (build1 (GOTO_EXPR, void_type_node, location));
754 /* Implementation of operations on array: new, load, store, length */
757 decode_newarray_type (int atype)
761 case 4: return boolean_type_node;
762 case 5: return char_type_node;
763 case 6: return float_type_node;
764 case 7: return double_type_node;
765 case 8: return byte_type_node;
766 case 9: return short_type_node;
767 case 10: return int_type_node;
768 case 11: return long_type_node;
769 default: return NULL_TREE;
773 /* Map primitive type to the code used by OPCODE_newarray. */
776 encode_newarray_type (tree type)
778 if (type == boolean_type_node)
780 else if (type == char_type_node)
782 else if (type == float_type_node)
784 else if (type == double_type_node)
786 else if (type == byte_type_node)
788 else if (type == short_type_node)
790 else if (type == int_type_node)
792 else if (type == long_type_node)
798 /* Build a call to _Jv_ThrowBadArrayIndex(), the
799 ArrayIndexOfBoundsException exception handler. */
802 build_java_throw_out_of_bounds_exception (tree index)
804 tree node = build3 (CALL_EXPR, int_type_node,
805 build_address_of (soft_badarrayindex_node),
806 build_tree_list (NULL_TREE, index), NULL_TREE);
807 TREE_SIDE_EFFECTS (node) = 1; /* Allows expansion within ANDIF */
811 /* Return the length of an array. Doesn't perform any checking on the nature
812 or value of the array NODE. May be used to implement some bytecodes. */
815 build_java_array_length_access (tree node)
817 tree type = TREE_TYPE (node);
818 tree array_type = TREE_TYPE (type);
819 HOST_WIDE_INT length;
821 /* JVM spec: If the arrayref is null, the arraylength instruction
822 throws a NullPointerException. The only way we could get a node
823 of type ptr_type_node at this point is `aconst_null; arraylength'
824 or something equivalent. */
825 if (type == ptr_type_node)
826 return build3 (CALL_EXPR, int_type_node,
827 build_address_of (soft_nullpointer_node),
828 NULL_TREE, NULL_TREE);
830 if (!is_array_type_p (type))
832 /* With the new verifier, we will see an ordinary pointer type
833 here. In this case, we just use an arbitrary array type. */
834 array_type = build_java_array_type (object_ptr_type_node, -1);
835 type = promote_type (array_type);
838 length = java_array_type_length (type);
840 return build_int_cst (NULL_TREE, length);
842 node = build3 (COMPONENT_REF, int_type_node,
843 build_java_indirect_ref (array_type, node,
844 flag_check_references),
845 lookup_field (&array_type, get_identifier ("length")),
847 IS_ARRAY_LENGTH_ACCESS (node) = 1;
851 /* Optionally checks a reference against the NULL pointer. ARG1: the
852 expr, ARG2: we should check the reference. Don't generate extra
853 checks if we're not generating code. */
856 java_check_reference (tree expr, int check)
858 if (!flag_syntax_only && check)
860 expr = save_expr (expr);
861 expr = build3 (COND_EXPR, TREE_TYPE (expr),
862 build2 (EQ_EXPR, boolean_type_node,
863 expr, null_pointer_node),
864 build3 (CALL_EXPR, void_type_node,
865 build_address_of (soft_nullpointer_node),
866 NULL_TREE, NULL_TREE),
873 /* Reference an object: just like an INDIRECT_REF, but with checking. */
876 build_java_indirect_ref (tree type, tree expr, int check)
879 t = java_check_reference (expr, check);
880 t = convert (build_pointer_type (type), t);
881 return build1 (INDIRECT_REF, type, t);
884 /* Implement array indexing (either as l-value or r-value).
885 Returns a tree for ARRAY[INDEX], assume TYPE is the element type.
886 Optionally performs bounds checking and/or test to NULL.
887 At this point, ARRAY should have been verified as an array. */
890 build_java_arrayaccess (tree array, tree type, tree index)
892 tree node, throw = NULL_TREE;
895 tree array_type = TREE_TYPE (TREE_TYPE (array));
897 if (!is_array_type_p (TREE_TYPE (array)))
899 /* With the new verifier, we will see an ordinary pointer type
900 here. In this case, we just use the correct array type. */
901 array_type = build_java_array_type (type, -1);
904 if (flag_bounds_check)
907 * (unsigned jint) INDEX >= (unsigned jint) LEN
908 * && throw ArrayIndexOutOfBoundsException.
909 * Note this is equivalent to and more efficient than:
910 * INDEX < 0 || INDEX >= LEN && throw ... */
912 tree len = convert (unsigned_int_type_node,
913 build_java_array_length_access (array));
914 test = fold (build2 (GE_EXPR, boolean_type_node,
915 convert (unsigned_int_type_node, index),
917 if (! integer_zerop (test))
919 throw = build2 (TRUTH_ANDIF_EXPR, int_type_node, test,
920 build_java_throw_out_of_bounds_exception (index));
921 /* allows expansion within COMPOUND */
922 TREE_SIDE_EFFECTS( throw ) = 1;
926 /* If checking bounds, wrap the index expr with a COMPOUND_EXPR in order
927 to have the bounds check evaluated first. */
928 if (throw != NULL_TREE)
929 index = build2 (COMPOUND_EXPR, int_type_node, throw, index);
931 data_field = lookup_field (&array_type, get_identifier ("data"));
933 ref = build3 (COMPONENT_REF, TREE_TYPE (data_field),
934 build_java_indirect_ref (array_type, array,
935 flag_check_references),
936 data_field, NULL_TREE);
938 node = build4 (ARRAY_REF, type, ref, index, NULL_TREE, NULL_TREE);
942 /* Generate code to throw an ArrayStoreException if OBJECT is not assignable
943 (at runtime) to an element of ARRAY. A NOP_EXPR is returned if it can
944 determine that no check is required. */
947 build_java_arraystore_check (tree array, tree object)
949 tree check, element_type, source;
950 tree array_type_p = TREE_TYPE (array);
951 tree object_type = TYPE_NAME (TREE_TYPE (TREE_TYPE (object)));
953 if (! flag_verify_invocations)
955 /* With the new verifier, we don't track precise types. FIXME:
956 performance regression here. */
957 element_type = TYPE_NAME (object_type_node);
961 if (! is_array_type_p (array_type_p))
964 /* Get the TYPE_DECL for ARRAY's element type. */
966 = TYPE_NAME (TREE_TYPE (TREE_TYPE (TREE_TYPE (array_type_p))));
969 if (TREE_CODE (element_type) != TYPE_DECL
970 || TREE_CODE (object_type) != TYPE_DECL)
973 if (!flag_store_check)
974 return build1 (NOP_EXPR, array_type_p, array);
976 /* No check is needed if the element type is final. Also check that
977 element_type matches object_type, since in the bytecode
978 compilation case element_type may be the actual element type of
979 the array rather than its declared type. However, if we're doing
980 indirect dispatch, we can't do the `final' optimization. */
981 if (element_type == object_type
982 && ! flag_indirect_dispatch
983 && CLASS_FINAL (element_type))
984 return build1 (NOP_EXPR, array_type_p, array);
986 /* OBJECT might be wrapped by a SAVE_EXPR. */
987 if (TREE_CODE (object) == SAVE_EXPR)
988 source = TREE_OPERAND (object, 0);
992 /* Avoid the check if OBJECT was just loaded from the same array. */
993 if (TREE_CODE (source) == ARRAY_REF)
996 source = TREE_OPERAND (source, 0); /* COMPONENT_REF. */
997 source = TREE_OPERAND (source, 0); /* INDIRECT_REF. */
998 source = TREE_OPERAND (source, 0); /* Source array's DECL or SAVE_EXPR. */
999 if (TREE_CODE (source) == SAVE_EXPR)
1000 source = TREE_OPERAND (source, 0);
1003 if (TREE_CODE (target) == SAVE_EXPR)
1004 target = TREE_OPERAND (target, 0);
1006 if (source == target)
1007 return build1 (NOP_EXPR, array_type_p, array);
1010 /* Build an invocation of _Jv_CheckArrayStore */
1011 check = build3 (CALL_EXPR, void_type_node,
1012 build_address_of (soft_checkarraystore_node),
1013 tree_cons (NULL_TREE, array,
1014 build_tree_list (NULL_TREE, object)),
1016 TREE_SIDE_EFFECTS (check) = 1;
1021 /* Makes sure that INDEXED_TYPE is appropriate. If not, make it from
1022 ARRAY_NODE. This function is used to retrieve something less vague than
1023 a pointer type when indexing the first dimension of something like [[<t>.
1024 May return a corrected type, if necessary, otherwise INDEXED_TYPE is
1025 return unchanged. */
1028 build_java_check_indexed_type (tree array_node, tree indexed_type)
1032 /* We used to check to see if ARRAY_NODE really had array type.
1033 However, with the new verifier, this is not necessary, as we know
1034 that the object will be an array of the appropriate type. */
1036 if (flag_new_verifier)
1037 return indexed_type;
1039 if (!is_array_type_p (TREE_TYPE (array_node)))
1042 elt_type = (TYPE_ARRAY_ELEMENT (TREE_TYPE (TREE_TYPE (array_node))));
1044 if (indexed_type == ptr_type_node)
1045 return promote_type (elt_type);
1047 /* BYTE/BOOLEAN store and load are used for both type */
1048 if (indexed_type == byte_type_node && elt_type == boolean_type_node)
1049 return boolean_type_node;
1051 if (indexed_type != elt_type )
1054 return indexed_type;
1057 /* newarray triggers a call to _Jv_NewPrimArray. This function should be
1058 called with an integer code (the type of array to create), and the length
1059 of the array to create. */
1062 build_newarray (int atype_value, tree length)
1066 tree prim_type = decode_newarray_type (atype_value);
1068 = build_java_array_type (prim_type,
1069 host_integerp (length, 0) == INTEGER_CST
1070 ? tree_low_cst (length, 0) : -1);
1072 /* If compiling to native, pass a reference to the primitive type class
1073 and save the runtime some work. However, the bytecode generator
1074 expects to find the type_code int here. */
1075 if (flag_emit_class_files)
1076 type_arg = build_int_cst (NULL_TREE, atype_value);
1078 type_arg = build_class_ref (prim_type);
1080 return build3 (CALL_EXPR, promote_type (type),
1081 build_address_of (soft_newarray_node),
1082 tree_cons (NULL_TREE,
1084 build_tree_list (NULL_TREE, length)),
1088 /* Generates anewarray from a given CLASS_TYPE. Gets from the stack the size
1089 of the dimension. */
1092 build_anewarray (tree class_type, tree length)
1095 = build_java_array_type (class_type,
1096 host_integerp (length, 0)
1097 ? tree_low_cst (length, 0) : -1);
1099 return build3 (CALL_EXPR, promote_type (type),
1100 build_address_of (soft_anewarray_node),
1101 tree_cons (NULL_TREE, length,
1102 tree_cons (NULL_TREE, build_class_ref (class_type),
1103 build_tree_list (NULL_TREE,
1104 null_pointer_node))),
1108 /* Return a node the evaluates 'new TYPE[LENGTH]'. */
1111 build_new_array (tree type, tree length)
1113 if (JPRIMITIVE_TYPE_P (type))
1114 return build_newarray (encode_newarray_type (type), length);
1116 return build_anewarray (TREE_TYPE (type), length);
1119 /* Generates a call to _Jv_NewMultiArray. multianewarray expects a
1120 class pointer, a number of dimensions and the matching number of
1121 dimensions. The argument list is NULL terminated. */
1124 expand_java_multianewarray (tree class_type, int ndim)
1127 tree args = build_tree_list( NULL_TREE, null_pointer_node );
1129 for( i = 0; i < ndim; i++ )
1130 args = tree_cons (NULL_TREE, pop_value (int_type_node), args);
1132 push_value (build3 (CALL_EXPR,
1133 promote_type (class_type),
1134 build_address_of (soft_multianewarray_node),
1135 tree_cons (NULL_TREE, build_class_ref (class_type),
1136 tree_cons (NULL_TREE,
1137 build_int_cst (NULL_TREE, ndim),
1142 /* ARRAY[INDEX] <- RHS. build_java_check_indexed_type makes sure that
1143 ARRAY is an array type. May expand some bound checking and NULL
1144 pointer checking. RHS_TYPE_NODE we are going to store. In the case
1145 of the CHAR/BYTE/BOOLEAN SHORT, the type popped of the stack is an
1146 INT. In those cases, we make the conversion.
1148 if ARRAy is a reference type, the assignment is checked at run-time
1149 to make sure that the RHS can be assigned to the array element
1150 type. It is not necessary to generate this code if ARRAY is final. */
1153 expand_java_arraystore (tree rhs_type_node)
1155 tree rhs_node = pop_value ((INTEGRAL_TYPE_P (rhs_type_node)
1156 && TYPE_PRECISION (rhs_type_node) <= 32) ?
1157 int_type_node : rhs_type_node);
1158 tree index = pop_value (int_type_node);
1159 tree array_type, array;
1161 if (flag_new_verifier)
1163 /* If we're processing an `aaload' we might as well just pick
1165 if (TREE_CODE (rhs_type_node) == POINTER_TYPE)
1167 array_type = build_java_array_type (object_ptr_type_node, -1);
1168 rhs_type_node = object_ptr_type_node;
1171 array_type = build_java_array_type (rhs_type_node, -1);
1174 array_type = ptr_type_node;
1175 array = pop_value (array_type);
1176 if (flag_new_verifier)
1177 array = build1 (NOP_EXPR, promote_type (array_type), array);
1179 rhs_type_node = build_java_check_indexed_type (array, rhs_type_node);
1181 flush_quick_stack ();
1183 index = save_expr (index);
1184 array = save_expr (array);
1186 if (TREE_CODE (rhs_type_node) == POINTER_TYPE)
1188 tree check = build_java_arraystore_check (array, rhs_node);
1189 java_add_stmt (check);
1192 array = build_java_arrayaccess (array, rhs_type_node, index);
1193 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (array), array, rhs_node));
1196 /* Expand the evaluation of ARRAY[INDEX]. build_java_check_indexed_type makes
1197 sure that LHS is an array type. May expand some bound checking and NULL
1199 LHS_TYPE_NODE is the type of ARRAY[INDEX]. But in the case of CHAR/BYTE/
1200 BOOLEAN/SHORT, we push a promoted type back to the stack.
1204 expand_java_arrayload (tree lhs_type_node)
1207 tree index_node = pop_value (int_type_node);
1211 if (flag_new_verifier)
1213 /* If we're processing an `aaload' we might as well just pick
1215 if (TREE_CODE (lhs_type_node) == POINTER_TYPE)
1217 array_type = build_java_array_type (object_ptr_type_node, -1);
1218 lhs_type_node = object_ptr_type_node;
1221 array_type = build_java_array_type (lhs_type_node, -1);
1224 array_type = ptr_type_node;
1225 array_node = pop_value (array_type);
1226 if (flag_new_verifier)
1227 array_node = build1 (NOP_EXPR, promote_type (array_type), array_node);
1229 index_node = save_expr (index_node);
1230 array_node = save_expr (array_node);
1232 if (TREE_TYPE (array_node) == ptr_type_node)
1233 /* The only way we could get a node of type ptr_type_node at this
1234 point is `aconst_null; arraylength' or something equivalent, so
1235 unconditionally throw NullPointerException. */
1236 load_node = build3 (CALL_EXPR, lhs_type_node,
1237 build_address_of (soft_nullpointer_node),
1238 NULL_TREE, NULL_TREE);
1241 lhs_type_node = build_java_check_indexed_type (array_node,
1243 load_node = build_java_arrayaccess (array_node,
1247 if (INTEGRAL_TYPE_P (lhs_type_node) && TYPE_PRECISION (lhs_type_node) <= 32)
1248 load_node = fold (build1 (NOP_EXPR, int_type_node, load_node));
1249 push_value (load_node);
1252 /* Expands .length. Makes sure that we deal with and array and may expand
1253 a NULL check on the array object. */
1256 expand_java_array_length (void)
1258 tree array = pop_value (ptr_type_node);
1259 tree length = build_java_array_length_access (array);
1261 push_value (length);
1264 /* Emit code for the call to _Jv_Monitor{Enter,Exit}. CALL can be
1265 either soft_monitorenter_node or soft_monitorexit_node. */
1268 build_java_monitor (tree call, tree object)
1270 return build3 (CALL_EXPR,
1272 build_address_of (call),
1273 build_tree_list (NULL_TREE, object),
1277 /* Emit code for one of the PUSHC instructions. */
1280 expand_java_pushc (int ival, tree type)
1283 if (type == ptr_type_node && ival == 0)
1284 value = null_pointer_node;
1285 else if (type == int_type_node || type == long_type_node)
1286 value = build_int_cst (type, ival);
1287 else if (type == float_type_node || type == double_type_node)
1290 REAL_VALUE_FROM_INT (x, ival, 0, TYPE_MODE (type));
1291 value = build_real (type, x);
1300 expand_java_return (tree type)
1302 if (type == void_type_node)
1303 java_add_stmt (build1 (RETURN_EXPR, void_type_node, NULL));
1306 tree retval = pop_value (type);
1307 tree res = DECL_RESULT (current_function_decl);
1308 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, retval);
1310 /* Handle the situation where the native integer type is smaller
1311 than the JVM integer. It can happen for many cross compilers.
1312 The whole if expression just goes away if INT_TYPE_SIZE < 32
1314 if (INT_TYPE_SIZE < 32
1315 && (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (res)))
1316 < GET_MODE_SIZE (TYPE_MODE (type))))
1317 retval = build1(NOP_EXPR, TREE_TYPE(res), retval);
1319 TREE_SIDE_EFFECTS (retval) = 1;
1320 java_add_stmt (build1 (RETURN_EXPR, TREE_TYPE (retval), retval));
1325 expand_load_internal (int index, tree type, int pc)
1328 tree var = find_local_variable (index, type, pc);
1330 /* Now VAR is the VAR_DECL (or PARM_DECL) that we are going to push
1331 on the stack. If there is an assignment to this VAR_DECL between
1332 the stack push and the use, then the wrong code could be
1333 generated. To avoid this we create a new local and copy our
1334 value into it. Then we push this new local on the stack.
1335 Hopefully this all gets optimized out. */
1336 copy = build_decl (VAR_DECL, NULL_TREE, type);
1337 if (INTEGRAL_TYPE_P (type)
1338 && TREE_TYPE (copy) != TREE_TYPE (var))
1339 var = convert (type, var);
1340 java_add_local_var (copy);
1341 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (var), copy, var));
1347 build_address_of (tree value)
1349 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (value)), value);
1353 class_has_finalize_method (tree type)
1355 tree super = CLASSTYPE_SUPER (type);
1357 if (super == NULL_TREE)
1358 return false; /* Every class with a real finalizer inherits */
1359 /* from java.lang.Object. */
1361 return HAS_FINALIZER_P (type) || class_has_finalize_method (super);
1365 java_create_object (tree type)
1367 tree alloc_node = (class_has_finalize_method (type)
1369 : alloc_no_finalizer_node);
1371 return build (CALL_EXPR, promote_type (type),
1372 build_address_of (alloc_node),
1373 build_tree_list (NULL_TREE, build_class_ref (type)),
1378 expand_java_NEW (tree type)
1382 alloc_node = (class_has_finalize_method (type) ? alloc_object_node
1383 : alloc_no_finalizer_node);
1384 if (! CLASS_LOADED_P (type))
1385 load_class (type, 1);
1386 safe_layout_class (type);
1387 push_value (build3 (CALL_EXPR, promote_type (type),
1388 build_address_of (alloc_node),
1389 build_tree_list (NULL_TREE, build_class_ref (type)),
1393 /* This returns an expression which will extract the class of an
1397 build_get_class (tree value)
1399 tree class_field = lookup_field (&dtable_type, get_identifier ("class"));
1400 tree vtable_field = lookup_field (&object_type_node,
1401 get_identifier ("vtable"));
1402 tree tmp = build3 (COMPONENT_REF, dtable_ptr_type,
1403 build_java_indirect_ref (object_type_node, value,
1404 flag_check_references),
1405 vtable_field, NULL_TREE);
1406 return build3 (COMPONENT_REF, class_ptr_type,
1407 build1 (INDIRECT_REF, dtable_type, tmp),
1408 class_field, NULL_TREE);
1411 /* This builds the tree representation of the `instanceof' operator.
1412 It tries various tricks to optimize this in cases where types are
1416 build_instanceof (tree value, tree type)
1419 tree itype = TREE_TYPE (TREE_TYPE (soft_instanceof_node));
1420 tree valtype = TREE_TYPE (TREE_TYPE (value));
1421 tree valclass = TYPE_NAME (valtype);
1424 /* When compiling from bytecode, we need to ensure that TYPE has
1426 if (CLASS_P (type) && ! CLASS_LOADED_P (type))
1428 load_class (type, 1);
1429 safe_layout_class (type);
1430 if (! TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) == ERROR_MARK)
1431 return error_mark_node;
1433 klass = TYPE_NAME (type);
1435 if (type == object_type_node || inherits_from_p (valtype, type))
1437 /* Anything except `null' is an instance of Object. Likewise,
1438 if the object is known to be an instance of the class, then
1439 we only need to check for `null'. */
1440 expr = build2 (NE_EXPR, itype, value, null_pointer_node);
1442 else if (flag_verify_invocations
1443 && ! TYPE_ARRAY_P (type)
1444 && ! TYPE_ARRAY_P (valtype)
1445 && DECL_P (klass) && DECL_P (valclass)
1446 && ! CLASS_INTERFACE (valclass)
1447 && ! CLASS_INTERFACE (klass)
1448 && ! inherits_from_p (type, valtype)
1449 && (CLASS_FINAL (klass)
1450 || ! inherits_from_p (valtype, type)))
1452 /* The classes are from different branches of the derivation
1453 tree, so we immediately know the answer. */
1454 expr = boolean_false_node;
1456 else if (DECL_P (klass) && CLASS_FINAL (klass))
1458 tree save = save_expr (value);
1459 expr = build3 (COND_EXPR, itype,
1460 build2 (NE_EXPR, boolean_type_node,
1461 save, null_pointer_node),
1462 build2 (EQ_EXPR, itype,
1463 build_get_class (save),
1464 build_class_ref (type)),
1465 boolean_false_node);
1469 expr = build3 (CALL_EXPR, itype,
1470 build_address_of (soft_instanceof_node),
1471 tree_cons (NULL_TREE, value,
1472 build_tree_list (NULL_TREE,
1473 build_class_ref (type))),
1476 TREE_SIDE_EFFECTS (expr) = TREE_SIDE_EFFECTS (value);
1481 expand_java_INSTANCEOF (tree type)
1483 tree value = pop_value (object_ptr_type_node);
1484 value = build_instanceof (value, type);
1489 expand_java_CHECKCAST (tree type)
1491 tree value = pop_value (ptr_type_node);
1492 value = build3 (CALL_EXPR, promote_type (type),
1493 build_address_of (soft_checkcast_node),
1494 tree_cons (NULL_TREE, build_class_ref (type),
1495 build_tree_list (NULL_TREE, value)),
1501 expand_iinc (unsigned int local_var_index, int ival, int pc)
1503 tree local_var, res;
1504 tree constant_value;
1506 flush_quick_stack ();
1507 local_var = find_local_variable (local_var_index, int_type_node, pc);
1508 constant_value = build_int_cst (NULL_TREE, ival);
1509 res = fold (build2 (PLUS_EXPR, int_type_node, local_var, constant_value));
1510 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (local_var), local_var, res));
1511 update_aliases (local_var, local_var_index, pc);
1516 build_java_soft_divmod (enum tree_code op, tree type, tree op1, tree op2)
1519 tree arg1 = convert (type, op1);
1520 tree arg2 = convert (type, op2);
1522 if (type == int_type_node)
1526 case TRUNC_DIV_EXPR:
1527 call = soft_idiv_node;
1529 case TRUNC_MOD_EXPR:
1530 call = soft_irem_node;
1536 else if (type == long_type_node)
1540 case TRUNC_DIV_EXPR:
1541 call = soft_ldiv_node;
1543 case TRUNC_MOD_EXPR:
1544 call = soft_lrem_node;
1554 call = build3 (CALL_EXPR, type,
1555 build_address_of (call),
1556 tree_cons (NULL_TREE, arg1,
1557 build_tree_list (NULL_TREE, arg2)),
1564 build_java_binop (enum tree_code op, tree type, tree arg1, tree arg2)
1571 tree u_type = java_unsigned_type (type);
1572 arg1 = convert (u_type, arg1);
1573 arg1 = build_java_binop (RSHIFT_EXPR, u_type, arg1, arg2);
1574 return convert (type, arg1);
1578 mask = build_int_cst (NULL_TREE,
1579 TYPE_PRECISION (TREE_TYPE (arg1)) - 1);
1580 arg2 = fold (build2 (BIT_AND_EXPR, int_type_node, arg2, mask));
1583 case COMPARE_L_EXPR: /* arg1 > arg2 ? 1 : arg1 == arg2 ? 0 : -1 */
1584 case COMPARE_G_EXPR: /* arg1 < arg2 ? -1 : arg1 == arg2 ? 0 : 1 */
1585 arg1 = save_expr (arg1); arg2 = save_expr (arg2);
1587 tree ifexp1 = fold (build2 (op == COMPARE_L_EXPR ? GT_EXPR : LT_EXPR,
1588 boolean_type_node, arg1, arg2));
1589 tree ifexp2 = fold (build2 (EQ_EXPR, boolean_type_node, arg1, arg2));
1590 tree second_compare = fold (build3 (COND_EXPR, int_type_node,
1591 ifexp2, integer_zero_node,
1592 op == COMPARE_L_EXPR
1593 ? integer_minus_one_node
1594 : integer_one_node));
1595 return fold (build3 (COND_EXPR, int_type_node, ifexp1,
1596 op == COMPARE_L_EXPR ? integer_one_node
1597 : integer_minus_one_node,
1601 arg1 = save_expr (arg1); arg2 = save_expr (arg2);
1603 tree ifexp1 = fold (build2 (LT_EXPR, boolean_type_node, arg1, arg2));
1604 tree ifexp2 = fold (build2 (GT_EXPR, boolean_type_node, arg1, arg2));
1605 tree second_compare = fold (build3 (COND_EXPR, int_type_node,
1606 ifexp2, integer_one_node,
1607 integer_zero_node));
1608 return fold (build3 (COND_EXPR, int_type_node,
1609 ifexp1, integer_minus_one_node, second_compare));
1611 case TRUNC_DIV_EXPR:
1612 case TRUNC_MOD_EXPR:
1613 if (TREE_CODE (type) == REAL_TYPE
1614 && op == TRUNC_MOD_EXPR)
1617 if (type != double_type_node)
1619 arg1 = convert (double_type_node, arg1);
1620 arg2 = convert (double_type_node, arg2);
1622 call = build3 (CALL_EXPR, double_type_node,
1623 build_address_of (soft_fmod_node),
1624 tree_cons (NULL_TREE, arg1,
1625 build_tree_list (NULL_TREE, arg2)),
1627 if (type != double_type_node)
1628 call = convert (type, call);
1632 if (TREE_CODE (type) == INTEGER_TYPE
1633 && flag_use_divide_subroutine
1634 && ! flag_syntax_only)
1635 return build_java_soft_divmod (op, type, arg1, arg2);
1640 return fold (build2 (op, type, arg1, arg2));
1644 expand_java_binop (tree type, enum tree_code op)
1654 rtype = int_type_node;
1655 rarg = pop_value (rtype);
1658 rarg = pop_value (rtype);
1660 larg = pop_value (ltype);
1661 push_value (build_java_binop (op, type, larg, rarg));
1664 /* Lookup the field named NAME in *TYPEP or its super classes.
1665 If not found, return NULL_TREE.
1666 (If the *TYPEP is not found, or if the field reference is
1667 ambiguous, return error_mark_node.)
1668 If found, return the FIELD_DECL, and set *TYPEP to the
1669 class containing the field. */
1672 lookup_field (tree *typep, tree name)
1674 if (CLASS_P (*typep) && !CLASS_LOADED_P (*typep))
1676 load_class (*typep, 1);
1677 safe_layout_class (*typep);
1678 if (!TYPE_SIZE (*typep) || TREE_CODE (TYPE_SIZE (*typep)) == ERROR_MARK)
1679 return error_mark_node;
1683 tree field, binfo, base_binfo;
1687 for (field = TYPE_FIELDS (*typep); field; field = TREE_CHAIN (field))
1688 if (DECL_NAME (field) == name)
1691 /* Process implemented interfaces. */
1692 save_field = NULL_TREE;
1693 for (binfo = TYPE_BINFO (*typep), i = 0;
1694 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1696 tree t = BINFO_TYPE (base_binfo);
1697 if ((field = lookup_field (&t, name)))
1699 if (save_field == field)
1701 if (save_field == NULL_TREE)
1705 tree i1 = DECL_CONTEXT (save_field);
1706 tree i2 = DECL_CONTEXT (field);
1707 error ("reference %qs is ambiguous: appears in interface %qs and interface %qs",
1708 IDENTIFIER_POINTER (name),
1709 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (i1))),
1710 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (i2))));
1711 return error_mark_node;
1716 if (save_field != NULL_TREE)
1719 *typep = CLASSTYPE_SUPER (*typep);
1724 /* Look up the field named NAME in object SELF_VALUE,
1725 which has class SELF_CLASS (a non-handle RECORD_TYPE).
1726 SELF_VALUE is NULL_TREE if looking for a static field. */
1729 build_field_ref (tree self_value, tree self_class, tree name)
1731 tree base_class = self_class;
1732 tree field_decl = lookup_field (&base_class, name);
1733 if (field_decl == NULL_TREE)
1735 error ("field %qs not found", IDENTIFIER_POINTER (name));
1736 return error_mark_node;
1738 if (self_value == NULL_TREE)
1740 return build_static_field_ref (field_decl);
1744 int check = (flag_check_references
1745 && ! (DECL_P (self_value)
1746 && DECL_NAME (self_value) == this_identifier_node));
1748 tree base_type = promote_type (base_class);
1749 if (base_type != TREE_TYPE (self_value))
1750 self_value = fold (build1 (NOP_EXPR, base_type, self_value));
1751 if (! flag_syntax_only
1752 && (flag_indirect_dispatch
1753 /* DECL_FIELD_OFFSET == 0 if we have no reference for
1754 the field, perhaps because we couldn't find the class
1755 in which the field is defined.
1756 FIXME: We should investigate this. */
1757 || DECL_FIELD_OFFSET (field_decl) == 0))
1760 = build_int_cst (NULL_TREE, get_symbol_table_index
1761 (field_decl, &TYPE_OTABLE_METHODS (output_class)));
1763 = build4 (ARRAY_REF, integer_type_node,
1764 TYPE_OTABLE_DECL (output_class), otable_index,
1765 NULL_TREE, NULL_TREE);
1768 field_offset = fold (convert (sizetype, field_offset));
1770 = fold (build2 (PLUS_EXPR,
1771 build_pointer_type (TREE_TYPE (field_decl)),
1772 self_value, field_offset));
1773 return fold (build1 (INDIRECT_REF, TREE_TYPE (field_decl), address));
1776 self_value = build_java_indirect_ref (TREE_TYPE (TREE_TYPE (self_value)),
1778 return fold (build3 (COMPONENT_REF, TREE_TYPE (field_decl),
1779 self_value, field_decl, NULL_TREE));
1784 lookup_label (int pc)
1788 ASM_GENERATE_INTERNAL_LABEL(buf, "LJpc=", pc);
1789 name = get_identifier (buf);
1790 if (IDENTIFIER_LOCAL_VALUE (name))
1791 return IDENTIFIER_LOCAL_VALUE (name);
1794 /* The type of the address of a label is return_address_type_node. */
1795 tree decl = create_label_decl (name);
1796 LABEL_PC (decl) = pc;
1797 return pushdecl (decl);
1801 /* Generate a unique name for the purpose of loops and switches
1802 labels, and try-catch-finally blocks label or temporary variables. */
1805 generate_name (void)
1807 static int l_number = 0;
1809 ASM_GENERATE_INTERNAL_LABEL(buff, "LJv", l_number);
1811 return get_identifier (buff);
1815 create_label_decl (tree name)
1818 decl = build_decl (LABEL_DECL, name,
1819 TREE_TYPE (return_address_type_node));
1820 DECL_CONTEXT (decl) = current_function_decl;
1821 DECL_IGNORED_P (decl) = 1;
1825 /* This maps a bytecode offset (PC) to various flags. */
1826 char *instruction_bits;
1829 note_label (int current_pc ATTRIBUTE_UNUSED, int target_pc)
1831 lookup_label (target_pc);
1832 instruction_bits [target_pc] |= BCODE_JUMP_TARGET;
1835 /* Emit code to jump to TARGET_PC if VALUE1 CONDITION VALUE2,
1836 where CONDITION is one of one the compare operators. */
1839 expand_compare (enum tree_code condition, tree value1, tree value2,
1842 tree target = lookup_label (target_pc);
1843 tree cond = fold (build2 (condition, boolean_type_node, value1, value2));
1845 (build3 (COND_EXPR, void_type_node, java_truthvalue_conversion (cond),
1846 build1 (GOTO_EXPR, void_type_node, target),
1847 build_java_empty_stmt ()));
1850 /* Emit code for a TEST-type opcode. */
1853 expand_test (enum tree_code condition, tree type, int target_pc)
1855 tree value1, value2;
1856 flush_quick_stack ();
1857 value1 = pop_value (type);
1858 value2 = (type == ptr_type_node) ? null_pointer_node : integer_zero_node;
1859 expand_compare (condition, value1, value2, target_pc);
1862 /* Emit code for a COND-type opcode. */
1865 expand_cond (enum tree_code condition, tree type, int target_pc)
1867 tree value1, value2;
1868 flush_quick_stack ();
1869 /* note: pop values in opposite order */
1870 value2 = pop_value (type);
1871 value1 = pop_value (type);
1872 /* Maybe should check value1 and value2 for type compatibility ??? */
1873 expand_compare (condition, value1, value2, target_pc);
1877 expand_java_goto (int target_pc)
1879 tree target_label = lookup_label (target_pc);
1880 flush_quick_stack ();
1881 java_add_stmt (build1 (GOTO_EXPR, void_type_node, target_label));
1885 expand_java_switch (tree selector, int default_pc)
1887 tree switch_expr, x;
1889 flush_quick_stack ();
1890 switch_expr = build3 (SWITCH_EXPR, TREE_TYPE (selector), selector,
1891 NULL_TREE, NULL_TREE);
1892 java_add_stmt (switch_expr);
1894 x = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE, NULL_TREE,
1895 create_artificial_label ());
1896 append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1898 x = build1 (GOTO_EXPR, void_type_node, lookup_label (default_pc));
1899 append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1905 expand_java_add_case (tree switch_expr, int match, int target_pc)
1909 value = build_int_cst (TREE_TYPE (switch_expr), match);
1911 x = build3 (CASE_LABEL_EXPR, void_type_node, value, NULL_TREE,
1912 create_artificial_label ());
1913 append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1915 x = build1 (GOTO_EXPR, void_type_node, lookup_label (target_pc));
1916 append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1920 pop_arguments (tree arg_types)
1922 if (arg_types == end_params_node)
1924 if (TREE_CODE (arg_types) == TREE_LIST)
1926 tree tail = pop_arguments (TREE_CHAIN (arg_types));
1927 tree type = TREE_VALUE (arg_types);
1928 tree arg = pop_value (type);
1930 /* With the new verifier we simply cast each argument to its
1931 proper type. This is needed since we lose type information
1932 coming out of the verifier. We also have to do this with the
1933 old verifier when we pop an integer type that must be
1934 promoted for the function call. */
1935 if (flag_new_verifier && TREE_CODE (type) == POINTER_TYPE)
1936 arg = build1 (NOP_EXPR, type, arg);
1937 else if (targetm.calls.promote_prototypes (type)
1938 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
1939 && INTEGRAL_TYPE_P (type))
1940 arg = convert (integer_type_node, arg);
1941 return tree_cons (NULL_TREE, arg, tail);
1946 /* Attach to PTR (a block) the declaration found in ENTRY. */
1949 attach_init_test_initialization_flags (void **entry, void *ptr)
1951 tree block = (tree)ptr;
1952 struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
1954 if (block != error_mark_node)
1956 if (TREE_CODE (block) == BIND_EXPR)
1958 tree body = BIND_EXPR_BODY (block);
1959 TREE_CHAIN (ite->value) = BIND_EXPR_VARS (block);
1960 BIND_EXPR_VARS (block) = ite->value;
1961 body = build2 (COMPOUND_EXPR, void_type_node,
1962 build1 (DECL_EXPR, void_type_node, ite->value), body);
1963 BIND_EXPR_BODY (block) = body;
1967 tree body = BLOCK_SUBBLOCKS (block);
1968 TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
1969 BLOCK_EXPR_DECLS (block) = ite->value;
1970 body = build2 (COMPOUND_EXPR, void_type_node,
1971 build1 (DECL_EXPR, void_type_node, ite->value), body);
1972 BLOCK_SUBBLOCKS (block) = body;
1979 /* Build an expression to initialize the class CLAS.
1980 if EXPR is non-NULL, returns an expression to first call the initializer
1981 (if it is needed) and then calls EXPR. */
1984 build_class_init (tree clas, tree expr)
1988 /* An optimization: if CLAS is a superclass of the class we're
1989 compiling, we don't need to initialize it. However, if CLAS is
1990 an interface, it won't necessarily be initialized, even if we
1992 if ((! CLASS_INTERFACE (TYPE_NAME (clas))
1993 && inherits_from_p (current_class, clas))
1994 || current_class == clas)
1997 if (always_initialize_class_p)
1999 init = build3 (CALL_EXPR, void_type_node,
2000 build_address_of (soft_initclass_node),
2001 build_tree_list (NULL_TREE, build_class_ref (clas)),
2003 TREE_SIDE_EFFECTS (init) = 1;
2007 tree *init_test_decl;
2009 init_test_decl = java_treetreehash_new
2010 (DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl), clas);
2012 if (*init_test_decl == NULL)
2014 /* Build a declaration and mark it as a flag used to track
2015 static class initializations. */
2016 decl = build_decl (VAR_DECL, NULL_TREE,
2018 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
2019 LOCAL_CLASS_INITIALIZATION_FLAG (decl) = 1;
2020 DECL_CONTEXT (decl) = current_function_decl;
2021 DECL_FUNCTION_INIT_TEST_CLASS (decl) = clas;
2022 /* Tell the check-init code to ignore this decl when not
2023 optimizing class initialization. */
2024 if (!STATIC_CLASS_INIT_OPT_P ())
2025 DECL_BIT_INDEX (decl) = -1;
2026 DECL_INITIAL (decl) = boolean_false_node;
2027 /* Don't emit any symbolic debugging info for this decl. */
2028 DECL_IGNORED_P (decl) = 1;
2029 *init_test_decl = decl;
2032 init = build3 (CALL_EXPR, void_type_node,
2033 build_address_of (soft_initclass_node),
2034 build_tree_list (NULL_TREE, build_class_ref (clas)),
2036 TREE_SIDE_EFFECTS (init) = 1;
2037 init = build3 (COND_EXPR, void_type_node,
2038 build2 (EQ_EXPR, boolean_type_node,
2039 *init_test_decl, boolean_false_node),
2040 init, integer_zero_node);
2041 TREE_SIDE_EFFECTS (init) = 1;
2042 init = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init,
2043 build2 (MODIFY_EXPR, boolean_type_node,
2044 *init_test_decl, boolean_true_node));
2045 TREE_SIDE_EFFECTS (init) = 1;
2048 if (expr != NULL_TREE)
2050 expr = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init, expr);
2051 TREE_SIDE_EFFECTS (expr) = 1;
2058 build_known_method_ref (tree method, tree method_type ATTRIBUTE_UNUSED,
2059 tree self_type, tree method_signature ATTRIBUTE_UNUSED,
2060 tree arg_list ATTRIBUTE_UNUSED)
2063 if (is_compiled_class (self_type))
2065 /* With indirect dispatch we have to use indirect calls for all
2066 publicly visible methods or gcc will use PLT indirections
2067 to reach them. We also have to use indirect dispatch for all
2068 external methods. */
2069 if (! flag_indirect_dispatch
2070 || (! DECL_EXTERNAL (method) && ! TREE_PUBLIC (method)))
2072 make_decl_rtl (method);
2073 func = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (method)),
2079 = build_int_cst (NULL_TREE, get_symbol_table_index
2080 (method, &TYPE_ATABLE_METHODS (output_class)));
2082 = build4 (ARRAY_REF,
2083 TREE_TYPE (TREE_TYPE (TYPE_ATABLE_DECL (output_class))),
2084 TYPE_ATABLE_DECL (output_class), table_index,
2085 NULL_TREE, NULL_TREE);
2087 func = convert (method_ptr_type_node, func);
2091 /* We don't know whether the method has been (statically) compiled.
2092 Compile this code to get a reference to the method's code:
2094 SELF_TYPE->methods[METHOD_INDEX].ncode
2098 int method_index = 0;
2101 /* The method might actually be declared in some superclass, so
2102 we have to use its class context, not the caller's notion of
2103 where the method is. */
2104 self_type = DECL_CONTEXT (method);
2105 ref = build_class_ref (self_type);
2106 ref = build1 (INDIRECT_REF, class_type_node, ref);
2107 if (ncode_ident == NULL_TREE)
2108 ncode_ident = get_identifier ("ncode");
2109 if (methods_ident == NULL_TREE)
2110 methods_ident = get_identifier ("methods");
2111 ref = build3 (COMPONENT_REF, method_ptr_type_node, ref,
2112 lookup_field (&class_type_node, methods_ident),
2114 for (meth = TYPE_METHODS (self_type);
2115 ; meth = TREE_CHAIN (meth))
2119 if (meth == NULL_TREE)
2120 fatal_error ("method '%s' not found in class",
2121 IDENTIFIER_POINTER (DECL_NAME (method)));
2124 method_index *= int_size_in_bytes (method_type_node);
2125 ref = fold (build2 (PLUS_EXPR, method_ptr_type_node,
2126 ref, build_int_cst (NULL_TREE, method_index)));
2127 ref = build1 (INDIRECT_REF, method_type_node, ref);
2128 func = build3 (COMPONENT_REF, nativecode_ptr_type_node,
2129 ref, lookup_field (&method_type_node, ncode_ident),
2136 invoke_build_dtable (int is_invoke_interface, tree arg_list)
2138 tree dtable, objectref;
2140 TREE_VALUE (arg_list) = save_expr (TREE_VALUE (arg_list));
2142 /* If we're dealing with interfaces and if the objectref
2143 argument is an array then get the dispatch table of the class
2144 Object rather than the one from the objectref. */
2145 objectref = (is_invoke_interface
2146 && is_array_type_p (TREE_TYPE (TREE_VALUE (arg_list)))
2147 ? build_class_ref (object_type_node) : TREE_VALUE (arg_list));
2149 if (dtable_ident == NULL_TREE)
2150 dtable_ident = get_identifier ("vtable");
2151 dtable = build_java_indirect_ref (object_type_node, objectref,
2152 flag_check_references);
2153 dtable = build3 (COMPONENT_REF, dtable_ptr_type, dtable,
2154 lookup_field (&object_type_node, dtable_ident), NULL_TREE);
2159 /* Determine the index in SYMBOL_TABLE for a reference to the decl
2160 T. If this decl has not been seen before, it will be added to the
2161 [oa]table_methods. If it has, the existing table slot will be
2165 get_symbol_table_index (tree t, tree *symbol_table)
2170 if (*symbol_table == NULL_TREE)
2172 *symbol_table = build_tree_list (t, t);
2176 method_list = *symbol_table;
2180 tree value = TREE_VALUE (method_list);
2184 if (TREE_CHAIN (method_list) == NULL_TREE)
2187 method_list = TREE_CHAIN (method_list);
2190 TREE_CHAIN (method_list) = build_tree_list (t, t);
2195 build_invokevirtual (tree dtable, tree method)
2198 tree nativecode_ptr_ptr_type_node
2199 = build_pointer_type (nativecode_ptr_type_node);
2203 if (flag_indirect_dispatch)
2205 if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
2209 = build_int_cst (NULL_TREE, get_symbol_table_index
2210 (method, &TYPE_OTABLE_METHODS (output_class)));
2211 method_index = build4 (ARRAY_REF, integer_type_node,
2212 TYPE_OTABLE_DECL (output_class),
2213 otable_index, NULL_TREE, NULL_TREE);
2217 /* We fetch the DECL_VINDEX field directly here, rather than
2218 using get_method_index(). DECL_VINDEX is the true offset
2219 from the vtable base to a method, regrdless of any extra
2220 words inserted at the start of the vtable. */
2221 method_index = DECL_VINDEX (method);
2222 method_index = size_binop (MULT_EXPR, method_index,
2223 TYPE_SIZE_UNIT (nativecode_ptr_ptr_type_node));
2224 if (TARGET_VTABLE_USES_DESCRIPTORS)
2225 method_index = size_binop (MULT_EXPR, method_index,
2226 size_int (TARGET_VTABLE_USES_DESCRIPTORS));
2229 func = fold (build2 (PLUS_EXPR, nativecode_ptr_ptr_type_node, dtable,
2230 convert (nativecode_ptr_ptr_type_node, method_index)));
2232 if (TARGET_VTABLE_USES_DESCRIPTORS)
2233 func = build1 (NOP_EXPR, nativecode_ptr_type_node, func);
2235 func = build1 (INDIRECT_REF, nativecode_ptr_type_node, func);
2240 static GTY(()) tree class_ident;
2242 build_invokeinterface (tree dtable, tree method)
2248 /* We expand invokeinterface here. */
2250 if (class_ident == NULL_TREE)
2251 class_ident = get_identifier ("class");
2253 dtable = build_java_indirect_ref (dtable_type, dtable,
2254 flag_check_references);
2255 dtable = build3 (COMPONENT_REF, class_ptr_type, dtable,
2256 lookup_field (&dtable_type, class_ident), NULL_TREE);
2258 interface = DECL_CONTEXT (method);
2259 if (! CLASS_INTERFACE (TYPE_NAME (interface)))
2261 layout_class_methods (interface);
2263 if (flag_indirect_dispatch)
2266 = 2 * (get_symbol_table_index
2267 (method, &TYPE_ITABLE_METHODS (output_class)));
2269 = build4 (ARRAY_REF,
2270 TREE_TYPE (TREE_TYPE (TYPE_ITABLE_DECL (output_class))),
2271 TYPE_ITABLE_DECL (output_class),
2272 build_int_cst (NULL_TREE, itable_index-1),
2273 NULL_TREE, NULL_TREE);
2275 = build4 (ARRAY_REF,
2276 TREE_TYPE (TREE_TYPE (TYPE_ITABLE_DECL (output_class))),
2277 TYPE_ITABLE_DECL (output_class),
2278 build_int_cst (NULL_TREE, itable_index),
2279 NULL_TREE, NULL_TREE);
2280 interface = convert (class_ptr_type, interface);
2281 idx = convert (integer_type_node, idx);
2285 idx = build_int_cst (NULL_TREE,
2286 get_interface_method_index (method, interface));
2287 interface = build_class_ref (interface);
2290 lookup_arg = tree_cons (NULL_TREE, dtable,
2291 tree_cons (NULL_TREE, interface,
2292 build_tree_list (NULL_TREE, idx)));
2294 return build3 (CALL_EXPR, ptr_type_node,
2295 build_address_of (soft_lookupinterfacemethod_node),
2296 lookup_arg, NULL_TREE);
2299 /* Expand one of the invoke_* opcodes.
2300 OPCODE is the specific opcode.
2301 METHOD_REF_INDEX is an index into the constant pool.
2302 NARGS is the number of arguments, or -1 if not specified. */
2305 expand_invoke (int opcode, int method_ref_index, int nargs ATTRIBUTE_UNUSED)
2307 tree method_signature
2308 = COMPONENT_REF_SIGNATURE(¤t_jcf->cpool, method_ref_index);
2309 tree method_name = COMPONENT_REF_NAME (¤t_jcf->cpool,
2312 = get_class_constant (current_jcf,
2313 COMPONENT_REF_CLASS_INDEX(¤t_jcf->cpool,
2315 const char *const self_name
2316 = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (self_type)));
2317 tree call, func, method, arg_list, method_type;
2318 tree check = NULL_TREE;
2320 if (! CLASS_LOADED_P (self_type))
2322 load_class (self_type, 1);
2323 safe_layout_class (self_type);
2324 if (TREE_CODE (TYPE_SIZE (self_type)) == ERROR_MARK)
2325 fatal_error ("failed to find class '%s'", self_name);
2327 layout_class_methods (self_type);
2329 if (ID_INIT_P (method_name))
2330 method = lookup_java_constructor (self_type, method_signature);
2332 method = lookup_java_method (self_type, method_name, method_signature);
2334 /* We've found a method in an interface, but this isn't an interface
2336 if (opcode != OPCODE_invokeinterface
2338 && (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method)))))
2341 /* We've found a non-interface method but we are making an
2342 interface call. This can happen if the interface overrides a
2343 method in Object. */
2344 if (! flag_verify_invocations
2345 && opcode == OPCODE_invokeinterface
2347 && ! CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
2350 if (method == NULL_TREE)
2352 if (flag_verify_invocations || ! flag_indirect_dispatch)
2354 error ("class '%s' has no method named '%s' matching signature '%s'",
2356 IDENTIFIER_POINTER (method_name),
2357 IDENTIFIER_POINTER (method_signature));
2361 int flags = ACC_PUBLIC;
2362 if (opcode == OPCODE_invokestatic)
2363 flags |= ACC_STATIC;
2364 if (opcode == OPCODE_invokeinterface)
2366 flags |= ACC_INTERFACE | ACC_ABSTRACT;
2367 CLASS_INTERFACE (TYPE_NAME (self_type)) = 1;
2369 method = add_method (self_type, flags, method_name,
2371 DECL_ARTIFICIAL (method) = 1;
2372 METHOD_DUMMY (method) = 1;
2373 layout_class_method (self_type, NULL,
2378 /* Invoke static can't invoke static/abstract method */
2379 if (method != NULL_TREE)
2381 if (opcode == OPCODE_invokestatic)
2383 if (!METHOD_STATIC (method))
2385 error ("invokestatic on non static method");
2388 else if (METHOD_ABSTRACT (method))
2390 error ("invokestatic on abstract method");
2396 if (METHOD_STATIC (method))
2398 error ("invoke[non-static] on static method");
2404 if (method == NULL_TREE)
2406 /* If we got here, we emitted an error message above. So we
2407 just pop the arguments, push a properly-typed zero, and
2409 method_type = get_type_from_signature (method_signature);
2410 pop_arguments (TYPE_ARG_TYPES (method_type));
2411 if (opcode != OPCODE_invokestatic)
2412 pop_type (self_type);
2413 method_type = promote_type (TREE_TYPE (method_type));
2414 push_value (convert (method_type, integer_zero_node));
2418 method_type = TREE_TYPE (method);
2419 arg_list = pop_arguments (TYPE_ARG_TYPES (method_type));
2420 flush_quick_stack ();
2423 if (opcode == OPCODE_invokestatic)
2424 func = build_known_method_ref (method, method_type, self_type,
2425 method_signature, arg_list);
2426 else if (opcode == OPCODE_invokespecial
2427 || (opcode == OPCODE_invokevirtual
2428 && (METHOD_PRIVATE (method)
2429 || METHOD_FINAL (method)
2430 || CLASS_FINAL (TYPE_NAME (self_type)))))
2432 /* If the object for the method call is null, we throw an
2433 exception. We don't do this if the object is the current
2434 method's `this'. In other cases we just rely on an
2435 optimization pass to eliminate redundant checks. FIXME:
2436 Unfortunately there doesn't seem to be a way to determine
2437 what the current method is right now.
2438 We do omit the check if we're calling <init>. */
2439 /* We use a SAVE_EXPR here to make sure we only evaluate
2440 the new `self' expression once. */
2441 tree save_arg = save_expr (TREE_VALUE (arg_list));
2442 TREE_VALUE (arg_list) = save_arg;
2443 check = java_check_reference (save_arg, ! DECL_INIT_P (method));
2444 func = build_known_method_ref (method, method_type, self_type,
2445 method_signature, arg_list);
2449 tree dtable = invoke_build_dtable (opcode == OPCODE_invokeinterface,
2451 if (opcode == OPCODE_invokevirtual)
2452 func = build_invokevirtual (dtable, method);
2454 func = build_invokeinterface (dtable, method);
2457 if (TREE_CODE (func) == ADDR_EXPR)
2458 TREE_TYPE (func) = build_pointer_type (method_type);
2460 func = build1 (NOP_EXPR, build_pointer_type (method_type), func);
2462 call = build3 (CALL_EXPR, TREE_TYPE (method_type),
2463 func, arg_list, NULL_TREE);
2464 TREE_SIDE_EFFECTS (call) = 1;
2465 call = check_for_builtin (method, call);
2467 if (check != NULL_TREE)
2469 call = build2 (COMPOUND_EXPR, TREE_TYPE (call), check, call);
2470 TREE_SIDE_EFFECTS (call) = 1;
2473 if (TREE_CODE (TREE_TYPE (method_type)) == VOID_TYPE)
2474 java_add_stmt (call);
2478 flush_quick_stack ();
2482 /* Create a stub which will be put into the vtable but which will call
2486 build_jni_stub (tree method)
2488 tree jnifunc, call, args, body, lookup_arg, method_sig, arg_types;
2489 tree jni_func_type, tem;
2490 tree env_var, res_var = NULL_TREE, block;
2491 tree method_args, res_type;
2497 tree klass = DECL_CONTEXT (method);
2498 int from_class = ! CLASS_FROM_SOURCE_P (klass);
2499 klass = build_class_ref (klass);
2501 if (! METHOD_NATIVE (method) || ! flag_jni)
2504 DECL_ARTIFICIAL (method) = 1;
2505 DECL_EXTERNAL (method) = 0;
2507 env_var = build_decl (VAR_DECL, get_identifier ("env"), ptr_type_node);
2508 DECL_CONTEXT (env_var) = method;
2510 if (TREE_TYPE (TREE_TYPE (method)) != void_type_node)
2512 res_var = build_decl (VAR_DECL, get_identifier ("res"),
2513 TREE_TYPE (TREE_TYPE (method)));
2514 DECL_CONTEXT (res_var) = method;
2515 TREE_CHAIN (env_var) = res_var;
2518 meth_var = build_decl (VAR_DECL, get_identifier ("meth"), ptr_type_node);
2519 TREE_STATIC (meth_var) = 1;
2520 TREE_PUBLIC (meth_var) = 0;
2521 DECL_EXTERNAL (meth_var) = 0;
2522 DECL_CONTEXT (meth_var) = method;
2523 DECL_ARTIFICIAL (meth_var) = 1;
2524 DECL_INITIAL (meth_var) = null_pointer_node;
2525 TREE_USED (meth_var) = 1;
2526 chainon (env_var, meth_var);
2527 build_result_decl (method);
2529 /* One strange way that the front ends are different is that they
2530 store arguments differently. */
2532 method_args = DECL_ARGUMENTS (method);
2534 method_args = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (method));
2535 block = build_block (env_var, NULL_TREE, NULL_TREE,
2536 method_args, NULL_TREE);
2537 TREE_SIDE_EFFECTS (block) = 1;
2538 /* When compiling from source we don't set the type of the block,
2539 because that will prevent patch_return from ever being run. */
2541 TREE_TYPE (block) = TREE_TYPE (TREE_TYPE (method));
2543 /* Compute the local `env' by calling _Jv_GetJNIEnvNewFrame. */
2544 body = build2 (MODIFY_EXPR, ptr_type_node, env_var,
2545 build3 (CALL_EXPR, ptr_type_node,
2546 build_address_of (soft_getjnienvnewframe_node),
2547 build_tree_list (NULL_TREE, klass),
2549 CAN_COMPLETE_NORMALLY (body) = 1;
2551 /* All the arguments to this method become arguments to the
2552 underlying JNI function. If we had to wrap object arguments in a
2553 special way, we would do that here. */
2555 for (tem = method_args; tem != NULL_TREE; tem = TREE_CHAIN (tem))
2557 int arg_bits = TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (tem)));
2558 #ifdef PARM_BOUNDARY
2559 arg_bits = (((arg_bits + PARM_BOUNDARY - 1) / PARM_BOUNDARY)
2562 args_size += (arg_bits / BITS_PER_UNIT);
2564 args = tree_cons (NULL_TREE, tem, args);
2566 args = nreverse (args);
2567 arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
2569 /* For a static method the second argument is the class. For a
2570 non-static method the second argument is `this'; that is already
2571 available in the argument list. */
2572 if (METHOD_STATIC (method))
2574 args_size += int_size_in_bytes (TREE_TYPE (klass));
2575 args = tree_cons (NULL_TREE, klass, args);
2576 arg_types = tree_cons (NULL_TREE, object_ptr_type_node, arg_types);
2579 /* The JNIEnv structure is the first argument to the JNI function. */
2580 args_size += int_size_in_bytes (TREE_TYPE (env_var));
2581 args = tree_cons (NULL_TREE, env_var, args);
2582 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
2584 /* We call _Jv_LookupJNIMethod to find the actual underlying
2585 function pointer. _Jv_LookupJNIMethod will throw the appropriate
2586 exception if this function is not found at runtime. */
2587 tem = build_tree_list (NULL_TREE, build_int_cst (NULL_TREE, args_size));
2588 method_sig = build_java_signature (TREE_TYPE (method));
2589 lookup_arg = tree_cons (NULL_TREE,
2590 build_utf8_ref (unmangle_classname
2591 (IDENTIFIER_POINTER (method_sig),
2592 IDENTIFIER_LENGTH (method_sig))),
2594 tem = DECL_NAME (method);
2596 = tree_cons (NULL_TREE, klass,
2597 tree_cons (NULL_TREE, build_utf8_ref (tem), lookup_arg));
2599 tem = build_function_type (TREE_TYPE (TREE_TYPE (method)), arg_types);
2601 #ifdef MODIFY_JNI_METHOD_CALL
2602 tem = MODIFY_JNI_METHOD_CALL (tem);
2605 jni_func_type = build_pointer_type (tem);
2607 jnifunc = build3 (COND_EXPR, ptr_type_node,
2609 build2 (MODIFY_EXPR, ptr_type_node, meth_var,
2610 build3 (CALL_EXPR, ptr_type_node,
2612 (soft_lookupjnimethod_node),
2613 lookup_arg, NULL_TREE)));
2615 /* Now we make the actual JNI call via the resulting function
2617 call = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (method)),
2618 build1 (NOP_EXPR, jni_func_type, jnifunc),
2621 /* If the JNI call returned a result, capture it here. If we had to
2622 unwrap JNI object results, we would do that here. */
2623 if (res_var != NULL_TREE)
2624 call = build2 (MODIFY_EXPR, TREE_TYPE (TREE_TYPE (method)),
2627 TREE_SIDE_EFFECTS (call) = 1;
2628 CAN_COMPLETE_NORMALLY (call) = 1;
2630 body = build2 (COMPOUND_EXPR, void_type_node, body, call);
2631 TREE_SIDE_EFFECTS (body) = 1;
2633 /* Now free the environment we allocated. */
2634 call = build3 (CALL_EXPR, ptr_type_node,
2635 build_address_of (soft_jnipopsystemframe_node),
2636 build_tree_list (NULL_TREE, env_var),
2638 TREE_SIDE_EFFECTS (call) = 1;
2639 CAN_COMPLETE_NORMALLY (call) = 1;
2640 body = build2 (COMPOUND_EXPR, void_type_node, body, call);
2641 TREE_SIDE_EFFECTS (body) = 1;
2643 /* Finally, do the return. */
2644 res_type = void_type_node;
2645 if (res_var != NULL_TREE)
2648 if (! DECL_RESULT (method))
2650 /* Make sure we copy the result variable to the actual
2651 result. We use the type of the DECL_RESULT because it
2652 might be different from the return type of the function:
2653 it might be promoted. */
2654 drt = TREE_TYPE (DECL_RESULT (method));
2655 if (drt != TREE_TYPE (res_var))
2656 res_var = build1 (CONVERT_EXPR, drt, res_var);
2657 res_var = build2 (MODIFY_EXPR, drt, DECL_RESULT (method), res_var);
2658 TREE_SIDE_EFFECTS (res_var) = 1;
2661 body = build2 (COMPOUND_EXPR, void_type_node, body,
2662 build1 (RETURN_EXPR, res_type, res_var));
2663 TREE_SIDE_EFFECTS (body) = 1;
2665 bind = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (block),
2670 /* Expand an operation to extract from or store into a field.
2671 IS_STATIC is 1 iff the field is static.
2672 IS_PUTTING is 1 for putting into a field; 0 for getting from the field.
2673 FIELD_REF_INDEX is an index into the constant pool. */
2676 expand_java_field_op (int is_static, int is_putting, int field_ref_index)
2679 = get_class_constant (current_jcf,
2680 COMPONENT_REF_CLASS_INDEX (¤t_jcf->cpool,
2682 const char *self_name
2683 = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (self_type)));
2684 tree field_name = COMPONENT_REF_NAME (¤t_jcf->cpool, field_ref_index);
2685 tree field_signature = COMPONENT_REF_SIGNATURE (¤t_jcf->cpool,
2687 tree field_type = get_type_from_signature (field_signature);
2688 tree new_value = is_putting ? pop_value (field_type) : NULL_TREE;
2691 tree original_self_type = self_type;
2694 if (! CLASS_LOADED_P (self_type))
2695 load_class (self_type, 1);
2696 field_decl = lookup_field (&self_type, field_name);
2697 if (field_decl == error_mark_node)
2701 else if (field_decl == NULL_TREE)
2703 if (! flag_verify_invocations)
2705 int flags = ACC_PUBLIC;
2707 flags |= ACC_STATIC;
2708 self_type = original_self_type;
2709 field_decl = add_field (original_self_type, field_name,
2711 DECL_ARTIFICIAL (field_decl) = 1;
2712 DECL_IGNORED_P (field_decl) = 1;
2716 error ("missing field '%s' in '%s'",
2717 IDENTIFIER_POINTER (field_name), self_name);
2721 else if (build_java_signature (TREE_TYPE (field_decl)) != field_signature)
2723 error ("mismatching signature for field '%s' in '%s'",
2724 IDENTIFIER_POINTER (field_name), self_name);
2727 field_ref = is_static ? NULL_TREE : pop_value (self_type);
2731 push_value (convert (field_type, integer_zero_node));
2732 flush_quick_stack ();
2736 field_ref = build_field_ref (field_ref, self_type, field_name);
2738 field_ref = build_class_init (self_type, field_ref);
2741 flush_quick_stack ();
2742 if (FIELD_FINAL (field_decl))
2744 if (DECL_CONTEXT (field_decl) != current_class)
2745 error ("%Jassignment to final field '%D' not in field's class",
2746 field_decl, field_decl);
2747 else if (FIELD_STATIC (field_decl))
2749 if (!DECL_CLINIT_P (current_function_decl))
2750 warning ("%Jassignment to final static field %qD not in "
2751 "class initializer",
2752 field_decl, field_decl);
2756 tree cfndecl_name = DECL_NAME (current_function_decl);
2757 if (! DECL_CONSTRUCTOR_P (current_function_decl)
2758 && !ID_FINIT_P (cfndecl_name))
2759 warning ("%Jassignment to final field '%D' not in constructor",
2760 field_decl, field_decl);
2763 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (field_ref),
2764 field_ref, new_value));
2767 push_value (field_ref);
2771 load_type_state (tree label)
2774 tree vec = LABEL_TYPE_STATE (label);
2775 int cur_length = TREE_VEC_LENGTH (vec);
2776 stack_pointer = cur_length - DECL_MAX_LOCALS(current_function_decl);
2777 for (i = 0; i < cur_length; i++)
2778 type_map [i] = TREE_VEC_ELT (vec, i);
2781 /* Go over METHOD's bytecode and note instruction starts in
2782 instruction_bits[]. */
2785 note_instructions (JCF *jcf, tree method)
2788 unsigned char* byte_ops;
2789 long length = DECL_CODE_LENGTH (method);
2794 #undef RET /* Defined by config/i386/i386.h */
2796 #define BCODE byte_ops
2797 #define BYTE_type_node byte_type_node
2798 #define SHORT_type_node short_type_node
2799 #define INT_type_node int_type_node
2800 #define LONG_type_node long_type_node
2801 #define CHAR_type_node char_type_node
2802 #define PTR_type_node ptr_type_node
2803 #define FLOAT_type_node float_type_node
2804 #define DOUBLE_type_node double_type_node
2805 #define VOID_type_node void_type_node
2806 #define CONST_INDEX_1 (saw_index = 1, IMMEDIATE_u1)
2807 #define CONST_INDEX_2 (saw_index = 1, IMMEDIATE_u2)
2808 #define VAR_INDEX_1 (saw_index = 1, IMMEDIATE_u1)
2809 #define VAR_INDEX_2 (saw_index = 1, IMMEDIATE_u2)
2811 #define CHECK_PC_IN_RANGE(PC) ((void)1) /* Already handled by verifier. */
2813 JCF_SEEK (jcf, DECL_CODE_OFFSET (method));
2814 byte_ops = jcf->read_ptr;
2815 instruction_bits = xrealloc (instruction_bits, length + 1);
2816 memset (instruction_bits, 0, length + 1);
2818 /* This pass figures out which PC can be the targets of jumps. */
2819 for (PC = 0; PC < length;)
2821 int oldpc = PC; /* PC at instruction start. */
2822 instruction_bits [PC] |= BCODE_INSTRUCTION_START;
2823 switch (byte_ops[PC++])
2825 #define JAVAOP(OPNAME, OPCODE, OPKIND, OPERAND_TYPE, OPERAND_VALUE) \
2827 PRE_##OPKIND(OPERAND_TYPE, OPERAND_VALUE); \
2830 #define NOTE_LABEL(PC) note_label(oldpc, PC)
2832 #define PRE_PUSHC(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
2833 #define PRE_LOAD(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
2834 #define PRE_STORE(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
2835 #define PRE_STACK(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
2836 #define PRE_UNOP(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
2837 #define PRE_BINOP(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
2838 #define PRE_CONVERT(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
2839 #define PRE_CONVERT2(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
2841 #define PRE_SPECIAL(OPERAND_TYPE, INSTRUCTION) \
2842 PRE_SPECIAL_##INSTRUCTION(OPERAND_TYPE)
2843 #define PRE_SPECIAL_IINC(OPERAND_TYPE) \
2844 ((void) IMMEDIATE_u1, (void) IMMEDIATE_s1)
2845 #define PRE_SPECIAL_ENTER(IGNORE) /* nothing */
2846 #define PRE_SPECIAL_EXIT(IGNORE) /* nothing */
2847 #define PRE_SPECIAL_THROW(IGNORE) /* nothing */
2848 #define PRE_SPECIAL_BREAK(IGNORE) /* nothing */
2850 /* two forms of wide instructions */
2851 #define PRE_SPECIAL_WIDE(IGNORE) \
2853 int modified_opcode = IMMEDIATE_u1; \
2854 if (modified_opcode == OPCODE_iinc) \
2856 (void) IMMEDIATE_u2; /* indexbyte1 and indexbyte2 */ \
2857 (void) IMMEDIATE_s2; /* constbyte1 and constbyte2 */ \
2861 (void) IMMEDIATE_u2; /* indexbyte1 and indexbyte2 */ \
2865 #define PRE_IMPL(IGNORE1, IGNORE2) /* nothing */
2867 #define PRE_MONITOR(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
2869 #define PRE_RETURN(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
2870 #define PRE_ARRAY(OPERAND_TYPE, SUBOP) \
2871 PRE_ARRAY_##SUBOP(OPERAND_TYPE)
2872 #define PRE_ARRAY_LOAD(TYPE) /* nothing */
2873 #define PRE_ARRAY_STORE(TYPE) /* nothing */
2874 #define PRE_ARRAY_LENGTH(TYPE) /* nothing */
2875 #define PRE_ARRAY_NEW(TYPE) PRE_ARRAY_NEW_##TYPE
2876 #define PRE_ARRAY_NEW_NUM ((void) IMMEDIATE_u1)
2877 #define PRE_ARRAY_NEW_PTR ((void) IMMEDIATE_u2)
2878 #define PRE_ARRAY_NEW_MULTI ((void) IMMEDIATE_u2, (void) IMMEDIATE_u1)
2880 #define PRE_TEST(OPERAND_TYPE, OPERAND_VALUE) NOTE_LABEL (oldpc+IMMEDIATE_s2)
2881 #define PRE_COND(OPERAND_TYPE, OPERAND_VALUE) NOTE_LABEL (oldpc+IMMEDIATE_s2)
2882 #define PRE_BRANCH(OPERAND_TYPE, OPERAND_VALUE) \
2883 saw_index = 0; INT_temp = (OPERAND_VALUE); \
2884 if (!saw_index) NOTE_LABEL(oldpc + INT_temp);
2885 #define PRE_JSR(OPERAND_TYPE, OPERAND_VALUE) \
2886 saw_index = 0; INT_temp = (OPERAND_VALUE); \
2888 if (!saw_index) NOTE_LABEL(oldpc + INT_temp);
2890 #define PRE_RET(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE)
2892 #define PRE_SWITCH(OPERAND_TYPE, TABLE_OR_LOOKUP) \
2893 PC = (PC + 3) / 4 * 4; PRE_##TABLE_OR_LOOKUP##_SWITCH
2895 #define PRE_LOOKUP_SWITCH \
2896 { jint default_offset = IMMEDIATE_s4; jint npairs = IMMEDIATE_s4; \
2897 NOTE_LABEL (default_offset+oldpc); \
2899 while (--npairs >= 0) { \
2900 jint match ATTRIBUTE_UNUSED = IMMEDIATE_s4; \
2901 jint offset = IMMEDIATE_s4; \
2902 NOTE_LABEL (offset+oldpc); } \
2905 #define PRE_TABLE_SWITCH \
2906 { jint default_offset = IMMEDIATE_s4; \
2907 jint low = IMMEDIATE_s4; jint high = IMMEDIATE_s4; \
2908 NOTE_LABEL (default_offset+oldpc); \
2910 while (low++ <= high) { \
2911 jint offset = IMMEDIATE_s4; \
2912 NOTE_LABEL (offset+oldpc); } \
2915 #define PRE_FIELD(MAYBE_STATIC, PUT_OR_GET) (void)(IMMEDIATE_u2);
2916 #define PRE_OBJECT(MAYBE_STATIC, PUT_OR_GET) (void)(IMMEDIATE_u2);
2917 #define PRE_INVOKE(MAYBE_STATIC, IS_INTERFACE) \
2918 (void)(IMMEDIATE_u2); \
2919 PC += 2 * IS_INTERFACE /* for invokeinterface */;
2921 #include "javaop.def"
2928 expand_byte_code (JCF *jcf, tree method)
2932 const unsigned char *linenumber_pointer;
2933 int dead_code_index = -1;
2934 unsigned char* byte_ops;
2935 long length = DECL_CODE_LENGTH (method);
2938 JCF_SEEK (jcf, DECL_CODE_OFFSET (method));
2939 byte_ops = jcf->read_ptr;
2941 /* We make an initial pass of the line number table, to note
2942 which instructions have associated line number entries. */
2943 linenumber_pointer = linenumber_table;
2944 for (i = 0; i < linenumber_count; i++)
2946 int pc = GET_u2 (linenumber_pointer);
2947 linenumber_pointer += 4;
2949 warning ("invalid PC in line number table");
2952 if ((instruction_bits[pc] & BCODE_HAS_LINENUMBER) != 0)
2953 instruction_bits[pc] |= BCODE_HAS_MULTI_LINENUMBERS;
2954 instruction_bits[pc] |= BCODE_HAS_LINENUMBER;
2958 if (flag_new_verifier)
2960 if (! verify_jvm_instructions_new (jcf, byte_ops, length))
2965 if (! verify_jvm_instructions (jcf, byte_ops, length))
2969 promote_arguments ();
2971 /* Translate bytecodes. */
2972 linenumber_pointer = linenumber_table;
2973 for (PC = 0; PC < length;)
2975 if ((instruction_bits [PC] & BCODE_TARGET) != 0 || PC == 0)
2977 tree label = lookup_label (PC);
2978 flush_quick_stack ();
2979 if ((instruction_bits [PC] & BCODE_TARGET) != 0)
2980 java_add_stmt (build1 (LABEL_EXPR, void_type_node, label));
2981 if (LABEL_VERIFIED (label) || PC == 0)
2982 load_type_state (label);
2985 if (! (instruction_bits [PC] & BCODE_VERIFIED))
2987 if (dead_code_index == -1)
2989 /* This is the start of a region of unreachable bytecodes.
2990 They still need to be processed in order for EH ranges
2991 to get handled correctly. However, we can simply
2992 replace these bytecodes with nops. */
2993 dead_code_index = PC;
2996 /* Turn this bytecode into a nop. */
3001 if (dead_code_index != -1)
3003 /* We've just reached the end of a region of dead code. */
3005 warning ("unreachable bytecode from %d to before %d",
3006 dead_code_index, PC);
3007 dead_code_index = -1;
3011 /* Handle possible line number entry for this PC.
3013 This code handles out-of-order and multiple linenumbers per PC,
3014 but is optimized for the case of line numbers increasing
3015 monotonically with PC. */
3016 if ((instruction_bits[PC] & BCODE_HAS_LINENUMBER) != 0)
3018 if ((instruction_bits[PC] & BCODE_HAS_MULTI_LINENUMBERS) != 0
3019 || GET_u2 (linenumber_pointer) != PC)
3020 linenumber_pointer = linenumber_table;
3021 while (linenumber_pointer < linenumber_table + linenumber_count * 4)
3023 int pc = GET_u2 (linenumber_pointer);
3024 linenumber_pointer += 4;
3027 int line = GET_u2 (linenumber_pointer - 2);
3028 #ifdef USE_MAPPED_LOCATION
3029 input_location = linemap_line_start (&line_table, line, 1);
3031 input_location.line = line;
3033 if (!(instruction_bits[PC] & BCODE_HAS_MULTI_LINENUMBERS))
3038 maybe_pushlevels (PC);
3039 PC = process_jvm_instruction (PC, byte_ops, length);
3040 maybe_poplevels (PC);
3043 if (dead_code_index != -1)
3045 /* We've just reached the end of a region of dead code. */
3047 warning ("unreachable bytecode from %d to the end of the method",
3053 java_push_constant_from_pool (JCF *jcf, int index)
3056 if (JPOOL_TAG (jcf, index) == CONSTANT_String)
3059 name = get_name_constant (jcf, JPOOL_USHORT1 (jcf, index));
3060 index = alloc_name_constant (CONSTANT_String, name);
3061 c = build_ref_from_constant_pool (index);
3062 c = convert (promote_type (string_type_node), c);
3065 c = get_constant (jcf, index);
3070 process_jvm_instruction (int PC, const unsigned char* byte_ops,
3071 long length ATTRIBUTE_UNUSED)
3073 const char *opname; /* Temporary ??? */
3074 int oldpc = PC; /* PC at instruction start. */
3076 /* If the instruction is at the beginning of a exception handler,
3077 replace the top of the stack with the thrown object reference */
3078 if (instruction_bits [PC] & BCODE_EXCEPTION_TARGET)
3080 /* Note that the new verifier will not emit a type map at all
3081 for dead exception handlers. In this case we just ignore
3083 if (! flag_new_verifier || (instruction_bits[PC] & BCODE_VERIFIED) != 0)
3085 tree type = pop_type (promote_type (throwable_type_node));
3086 push_value (build_exception_object_ref (type));
3090 switch (byte_ops[PC++])
3092 #define JAVAOP(OPNAME, OPCODE, OPKIND, OPERAND_TYPE, OPERAND_VALUE) \
3095 OPKIND(OPERAND_TYPE, OPERAND_VALUE); \
3098 #define RET(OPERAND_TYPE, OPERAND_VALUE) \
3100 int saw_index = 0; \
3101 int index = OPERAND_VALUE; \
3103 (find_local_variable (index, return_address_type_node, oldpc)); \
3106 #define JSR(OPERAND_TYPE, OPERAND_VALUE) \
3108 /* OPERAND_VALUE may have side-effects on PC */ \
3109 int opvalue = OPERAND_VALUE; \
3110 build_java_jsr (oldpc + opvalue, PC); \
3113 /* Push a constant onto the stack. */
3114 #define PUSHC(OPERAND_TYPE, OPERAND_VALUE) \
3115 { int saw_index = 0; int ival = (OPERAND_VALUE); \
3116 if (saw_index) java_push_constant_from_pool (current_jcf, ival); \
3117 else expand_java_pushc (ival, OPERAND_TYPE##_type_node); }
3119 /* internal macro added for use by the WIDE case */
3120 #define LOAD_INTERNAL(OPTYPE, OPVALUE) \
3121 expand_load_internal (OPVALUE, type_map[OPVALUE], oldpc);
3123 /* Push local variable onto the opcode stack. */
3124 #define LOAD(OPERAND_TYPE, OPERAND_VALUE) \
3126 /* have to do this since OPERAND_VALUE may have side-effects */ \
3127 int opvalue = OPERAND_VALUE; \
3128 LOAD_INTERNAL(OPERAND_TYPE##_type_node, opvalue); \
3131 #define RETURN(OPERAND_TYPE, OPERAND_VALUE) \
3132 expand_java_return (OPERAND_TYPE##_type_node)
3134 #define REM_EXPR TRUNC_MOD_EXPR
3135 #define BINOP(OPERAND_TYPE, OPERAND_VALUE) \
3136 expand_java_binop (OPERAND_TYPE##_type_node, OPERAND_VALUE##_EXPR)
3138 #define FIELD(IS_STATIC, IS_PUT) \
3139 expand_java_field_op (IS_STATIC, IS_PUT, IMMEDIATE_u2)
3141 #define TEST(OPERAND_TYPE, CONDITION) \
3142 expand_test (CONDITION##_EXPR, OPERAND_TYPE##_type_node, oldpc+IMMEDIATE_s2)
3144 #define COND(OPERAND_TYPE, CONDITION) \
3145 expand_cond (CONDITION##_EXPR, OPERAND_TYPE##_type_node, oldpc+IMMEDIATE_s2)
3147 #define BRANCH(OPERAND_TYPE, OPERAND_VALUE) \
3148 BRANCH_##OPERAND_TYPE (OPERAND_VALUE)
3150 #define BRANCH_GOTO(OPERAND_VALUE) \
3151 expand_java_goto (oldpc + OPERAND_VALUE)
3153 #define BRANCH_CALL(OPERAND_VALUE) \
3154 expand_java_call (oldpc + OPERAND_VALUE, oldpc)
3157 #define BRANCH_RETURN(OPERAND_VALUE) \
3159 tree type = OPERAND_TYPE##_type_node; \
3160 tree value = find_local_variable (OPERAND_VALUE, type, oldpc); \
3161 expand_java_ret (value); \
3165 #define NOT_IMPL(OPERAND_TYPE, OPERAND_VALUE) \
3166 fprintf (stderr, "%3d: %s ", oldpc, opname); \
3167 fprintf (stderr, "(not implemented)\n")
3168 #define NOT_IMPL1(OPERAND_VALUE) \
3169 fprintf (stderr, "%3d: %s ", oldpc, opname); \
3170 fprintf (stderr, "(not implemented)\n")
3172 #define BRANCH_RETURN(OPERAND_VALUE) NOT_IMPL1(OPERAND_VALUE)
3174 #define STACK(SUBOP, COUNT) STACK_##SUBOP (COUNT)
3176 #define STACK_POP(COUNT) java_stack_pop (COUNT)
3178 #define STACK_SWAP(COUNT) java_stack_swap()
3180 #define STACK_DUP(COUNT) java_stack_dup (COUNT, 0)
3181 #define STACK_DUPx1(COUNT) java_stack_dup (COUNT, 1)
3182 #define STACK_DUPx2(COUNT) java_stack_dup (COUNT, 2)
3184 #define SWITCH(OPERAND_TYPE, TABLE_OR_LOOKUP) \
3185 PC = (PC + 3) / 4 * 4; TABLE_OR_LOOKUP##_SWITCH
3187 #define LOOKUP_SWITCH \
3188 { jint default_offset = IMMEDIATE_s4; jint npairs = IMMEDIATE_s4; \
3189 tree selector = pop_value (INT_type_node); \
3190 tree switch_expr = expand_java_switch (selector, oldpc + default_offset); \
3191 while (--npairs >= 0) \
3193 jint match = IMMEDIATE_s4; jint offset = IMMEDIATE_s4; \
3194 expand_java_add_case (switch_expr, match, oldpc + offset); \
3198 #define TABLE_SWITCH \
3199 { jint default_offset = IMMEDIATE_s4; \
3200 jint low = IMMEDIATE_s4; jint high = IMMEDIATE_s4; \
3201 tree selector = pop_value (INT_type_node); \
3202 tree switch_expr = expand_java_switch (selector, oldpc + default_offset); \
3203 for (; low <= high; low++) \
3205 jint offset = IMMEDIATE_s4; \
3206 expand_java_add_case (switch_expr, low, oldpc + offset); \
3210 #define INVOKE(MAYBE_STATIC, IS_INTERFACE) \
3211 { int opcode = byte_ops[PC-1]; \
3212 int method_ref_index = IMMEDIATE_u2; \
3214 if (IS_INTERFACE) { nargs = IMMEDIATE_u1; (void) IMMEDIATE_u1; } \
3216 expand_invoke (opcode, method_ref_index, nargs); \
3219 /* Handle new, checkcast, instanceof */
3220 #define OBJECT(TYPE, OP) \
3221 expand_java_##OP (get_class_constant (current_jcf, IMMEDIATE_u2))
3223 #define ARRAY(OPERAND_TYPE, SUBOP) ARRAY_##SUBOP(OPERAND_TYPE)
3225 #define ARRAY_LOAD(OPERAND_TYPE) \
3227 expand_java_arrayload( OPERAND_TYPE##_type_node ); \
3230 #define ARRAY_STORE(OPERAND_TYPE) \
3232 expand_java_arraystore( OPERAND_TYPE##_type_node ); \
3235 #define ARRAY_LENGTH(OPERAND_TYPE) expand_java_array_length();
3236 #define ARRAY_NEW(OPERAND_TYPE) ARRAY_NEW_##OPERAND_TYPE()
3237 #define ARRAY_NEW_PTR() \
3238 push_value (build_anewarray (get_class_constant (current_jcf, \
3240 pop_value (int_type_node)));
3241 #define ARRAY_NEW_NUM() \
3243 int atype = IMMEDIATE_u1; \
3244 push_value (build_newarray (atype, pop_value (int_type_node)));\
3246 #define ARRAY_NEW_MULTI() \
3248 tree class = get_class_constant (current_jcf, IMMEDIATE_u2 ); \
3249 int ndims = IMMEDIATE_u1; \
3250 expand_java_multianewarray( class, ndims ); \
3253 #define UNOP(OPERAND_TYPE, OPERAND_VALUE) \
3254 push_value (fold (build1 (NEGATE_EXPR, OPERAND_TYPE##_type_node, \
3255 pop_value (OPERAND_TYPE##_type_node))));
3257 #define CONVERT2(FROM_TYPE, TO_TYPE) \
3259 push_value (build1 (NOP_EXPR, int_type_node, \
3260 (convert (TO_TYPE##_type_node, \
3261 pop_value (FROM_TYPE##_type_node))))); \
3264 #define CONVERT(FROM_TYPE, TO_TYPE) \
3266 push_value (convert (TO_TYPE##_type_node, \
3267 pop_value (FROM_TYPE##_type_node))); \
3270 /* internal macro added for use by the WIDE case
3271 Added TREE_TYPE (decl) assignment, apbianco */
3272 #define STORE_INTERNAL(OPTYPE, OPVALUE) \
3275 int index = OPVALUE; \
3276 tree type = OPTYPE; \
3277 value = pop_value (type); \
3278 type = TREE_TYPE (value); \
3279 decl = find_local_variable (index, type, oldpc); \
3280 set_local_type (index, type); \
3281 java_add_stmt (build2 (MODIFY_EXPR, type, decl, value)); \
3282 update_aliases (decl, index, PC); \
3285 #define STORE(OPERAND_TYPE, OPERAND_VALUE) \
3287 /* have to do this since OPERAND_VALUE may have side-effects */ \
3288 int opvalue = OPERAND_VALUE; \
3289 STORE_INTERNAL(OPERAND_TYPE##_type_node, opvalue); \
3292 #define SPECIAL(OPERAND_TYPE, INSTRUCTION) \
3293 SPECIAL_##INSTRUCTION(OPERAND_TYPE)
3295 #define SPECIAL_ENTER(IGNORED) MONITOR_OPERATION (soft_monitorenter_node)
3296 #define SPECIAL_EXIT(IGNORED) MONITOR_OPERATION (soft_monitorexit_node)
3298 #define MONITOR_OPERATION(call) \
3300 tree o = pop_value (ptr_type_node); \
3302 flush_quick_stack (); \
3303 c = build_java_monitor (call, o); \
3304 TREE_SIDE_EFFECTS (c) = 1; \
3305 java_add_stmt (c); \
3308 #define SPECIAL_IINC(IGNORED) \
3310 unsigned int local_var_index = IMMEDIATE_u1; \
3311 int ival = IMMEDIATE_s1; \
3312 expand_iinc(local_var_index, ival, oldpc); \
3315 #define SPECIAL_WIDE(IGNORED) \
3317 int modified_opcode = IMMEDIATE_u1; \
3318 unsigned int local_var_index = IMMEDIATE_u2; \
3319 switch (modified_opcode) \
3323 int ival = IMMEDIATE_s2; \
3324 expand_iinc (local_var_index, ival, oldpc); \
3327 case OPCODE_iload: \
3328 case OPCODE_lload: \
3329 case OPCODE_fload: \
3330 case OPCODE_dload: \
3331 case OPCODE_aload: \
3333 /* duplicate code from LOAD macro */ \
3334 LOAD_INTERNAL(operand_type[modified_opcode], local_var_index); \
3337 case OPCODE_istore: \
3338 case OPCODE_lstore: \
3339 case OPCODE_fstore: \
3340 case OPCODE_dstore: \
3341 case OPCODE_astore: \
3343 STORE_INTERNAL(operand_type[modified_opcode], local_var_index); \
3347 error ("unrecogized wide sub-instruction"); \
3351 #define SPECIAL_THROW(IGNORED) \
3352 build_java_athrow (pop_value (throwable_type_node))
3354 #define SPECIAL_BREAK NOT_IMPL1
3355 #define IMPL NOT_IMPL
3357 #include "javaop.def"
3360 fprintf (stderr, "%3d: unknown(%3d)\n", oldpc, byte_ops[PC]);
3365 /* Return the opcode at PC in the code section pointed to by
3368 static unsigned char
3369 peek_opcode_at_pc (JCF *jcf, int code_offset, int pc)
3371 unsigned char opcode;
3372 long absolute_offset = (long)JCF_TELL (jcf);
3374 JCF_SEEK (jcf, code_offset);
3375 opcode = jcf->read_ptr [pc];
3376 JCF_SEEK (jcf, absolute_offset);
3380 /* Some bytecode compilers are emitting accurate LocalVariableTable
3381 attributes. Here's an example:
3386 Attribute "LocalVariableTable"
3387 slot #<n>: ... (PC: PC+1 length: L)
3389 This is accurate because the local in slot <n> really exists after
3390 the opcode at PC is executed, hence from PC+1 to PC+1+L.
3392 This procedure recognizes this situation and extends the live range
3393 of the local in SLOT to START_PC-1 or START_PC-2 (depending on the
3394 length of the store instruction.)
3396 This function is used by `give_name_to_locals' so that a local's
3397 DECL features a DECL_LOCAL_START_PC such that the first related
3398 store operation will use DECL as a destination, not a unrelated
3399 temporary created for the occasion.
3401 This function uses a global (instruction_bits) `note_instructions' should
3402 have allocated and filled properly. */
3405 maybe_adjust_start_pc (struct JCF *jcf, int code_offset,
3406 int start_pc, int slot)
3408 int first, index, opcode;
3417 /* Find last previous instruction and remember it */
3418 for (pc = start_pc-1; pc; pc--)
3419 if (instruction_bits [pc] & BCODE_INSTRUCTION_START)
3423 /* Retrieve the instruction, handle `wide'. */
3424 opcode = (int) peek_opcode_at_pc (jcf, code_offset, pc++);
3425 if (opcode == OPCODE_wide)
3428 opcode = (int) peek_opcode_at_pc (jcf, code_offset, pc++);
3433 case OPCODE_astore_0:
3434 case OPCODE_astore_1:
3435 case OPCODE_astore_2:
3436 case OPCODE_astore_3:
3437 first = OPCODE_astore_0;
3440 case OPCODE_istore_0:
3441 case OPCODE_istore_1:
3442 case OPCODE_istore_2:
3443 case OPCODE_istore_3:
3444 first = OPCODE_istore_0;
3447 case OPCODE_lstore_0:
3448 case OPCODE_lstore_1:
3449 case OPCODE_lstore_2:
3450 case OPCODE_lstore_3:
3451 first = OPCODE_lstore_0;
3454 case OPCODE_fstore_0:
3455 case OPCODE_fstore_1:
3456 case OPCODE_fstore_2:
3457 case OPCODE_fstore_3:
3458 first = OPCODE_fstore_0;
3461 case OPCODE_dstore_0:
3462 case OPCODE_dstore_1:
3463 case OPCODE_dstore_2:
3464 case OPCODE_dstore_3:
3465 first = OPCODE_dstore_0;
3473 index = peek_opcode_at_pc (jcf, code_offset, pc);
3476 int other = peek_opcode_at_pc (jcf, code_offset, ++pc);
3477 index = (other << 8) + index;
3482 /* Now we decide: first >0 means we have a <t>store_<n>, index >0
3483 means we have a <t>store. */
3484 if ((first > 0 && opcode - first == slot) || (index > 0 && index == slot))
3490 /* Force the (direct) sub-operands of NODE to be evaluated in left-to-right
3491 order, as specified by Java Language Specification.
3493 The problem is that while expand_expr will evaluate its sub-operands in
3494 left-to-right order, for variables it will just return an rtx (i.e.
3495 an lvalue) for the variable (rather than an rvalue). So it is possible
3496 that a later sub-operand will change the register, and when the
3497 actual operation is done, it will use the new value, when it should
3498 have used the original value.
3500 We fix this by using save_expr. This forces the sub-operand to be
3501 copied into a fresh virtual register,
3503 For method invocation, we modify the arguments so that a
3504 left-to-right order evaluation is performed. Saved expressions
3505 will, in CALL_EXPR order, be reused when the call will be expanded.
3509 force_evaluation_order (tree node)
3511 if (flag_syntax_only)
3513 if (TREE_CODE (node) == CALL_EXPR
3514 || TREE_CODE (node) == NEW_CLASS_EXPR
3515 || (TREE_CODE (node) == COMPOUND_EXPR
3516 && TREE_CODE (TREE_OPERAND (node, 0)) == CALL_EXPR
3517 && TREE_CODE (TREE_OPERAND (node, 1)) == SAVE_EXPR))
3523 /* Position arg properly, account for wrapped around ctors. */
3524 if (TREE_CODE (node) == COMPOUND_EXPR)
3525 arg = TREE_OPERAND (node, 0);
3527 arg = TREE_OPERAND (arg, 1);
3529 /* An empty argument list is ok, just ignore it. */
3533 /* Not having a list of arguments here is an error. */
3534 if (TREE_CODE (arg) != TREE_LIST)
3537 /* This reverses the evaluation order. This is a desired effect. */
3538 for (cmp = NULL_TREE; arg; arg = TREE_CHAIN (arg))
3540 tree saved = save_expr (force_evaluation_order (TREE_VALUE (arg)));
3541 cmp = (cmp == NULL_TREE ? saved :
3542 build2 (COMPOUND_EXPR, void_type_node, cmp, saved));
3543 TREE_VALUE (arg) = saved;
3546 if (cmp && TREE_CODE (cmp) == COMPOUND_EXPR)
3547 TREE_SIDE_EFFECTS (cmp) = 1;
3551 cmp = build2 (COMPOUND_EXPR, TREE_TYPE (node), cmp, node);
3552 if (TREE_TYPE (cmp) != void_type_node)
3553 cmp = save_expr (cmp);
3554 CAN_COMPLETE_NORMALLY (cmp) = CAN_COMPLETE_NORMALLY (node);
3555 TREE_SIDE_EFFECTS (cmp) = 1;
3562 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
3563 location where an expression or an identifier were encountered. It
3564 is necessary for languages where the frontend parser will handle
3565 recursively more than one file (Java is one of them). */
3568 build_expr_wfl (tree node,
3569 #ifdef USE_MAPPED_LOCATION
3570 source_location location
3572 const char *file, int line, int col
3578 #ifdef USE_MAPPED_LOCATION
3579 wfl = make_node (EXPR_WITH_FILE_LOCATION);
3580 SET_EXPR_LOCATION (wfl, location);
3582 static const char *last_file = 0;
3583 static tree last_filenode = NULL_TREE;
3585 wfl = make_node (EXPR_WITH_FILE_LOCATION);
3587 EXPR_WFL_SET_LINECOL (wfl, line, col);
3588 if (file != last_file)
3591 last_filenode = file ? get_identifier (file) : NULL_TREE;
3593 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
3595 EXPR_WFL_NODE (wfl) = node;
3599 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
3600 TREE_TYPE (wfl) = TREE_TYPE (node);
3606 #ifdef USE_MAPPED_LOCATION
3608 expr_add_location (tree node, source_location location, bool statement)
3612 /* FIXME. This optimization causes failures in code that expects an
3613 EXPR_WITH_FILE_LOCATION. E.g. in resolve_qualified_expression_name. */
3614 if (node && ! (statement && flag_emit_class_files))
3616 source_location node_loc = EXPR_LOCATION (node);
3617 if (node_loc == location || location == UNKNOWN_LOCATION)
3619 if (node_loc == UNKNOWN_LOCATION
3620 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (node))))
3622 SET_EXPR_LOCATION (node, location);
3627 wfl = make_node (EXPR_WITH_FILE_LOCATION);
3628 SET_EXPR_LOCATION (wfl, location);
3629 EXPR_WFL_NODE (wfl) = node;
3630 if (statement && debug_info_level != DINFO_LEVEL_NONE)
3631 EXPR_WFL_EMIT_LINE_NOTE (wfl) = 1;
3635 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
3636 TREE_TYPE (wfl) = TREE_TYPE (node);
3643 /* Build a node to represent empty statements and blocks. */
3646 build_java_empty_stmt (void)
3648 tree t = build_empty_stmt ();
3649 CAN_COMPLETE_NORMALLY (t) = 1;
3653 /* Promote all args of integral type before generating any code. */
3656 promote_arguments (void)
3660 for (arg = DECL_ARGUMENTS (current_function_decl), i = 0;
3661 arg != NULL_TREE; arg = TREE_CHAIN (arg), i++)
3663 tree arg_type = TREE_TYPE (arg);
3664 if (INTEGRAL_TYPE_P (arg_type)
3665 && TYPE_PRECISION (arg_type) < 32)
3667 tree copy = find_local_variable (i, integer_type_node, -1);
3668 java_add_stmt (build2 (MODIFY_EXPR, integer_type_node,
3670 fold_convert (integer_type_node, arg)));
3672 if (TYPE_IS_WIDE (arg_type))
3677 #include "gt-java-expr.h"