1 /* Process expressions for the GNU compiler for the Java(TM) language.
2 Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
3 2005, 2006, 2007, 2008, 2010 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>.
21 Java and all Java-based marks are trademarks or registered trademarks
22 of Sun Microsystems, Inc. in the United States and other countries.
23 The Free Software Foundation is independent of Sun Microsystems, Inc. */
25 /* Hacked by Per Bothner <bothner@cygnus.com> February 1996. */
29 #include "coretypes.h"
32 #include "java-tree.h"
34 #include "java-opcodes.h"
36 #include "java-except.h"
40 #include "tree-iterator.h"
43 static void flush_quick_stack (void);
44 static void push_value (tree);
45 static tree pop_value (tree);
46 static void java_stack_swap (void);
47 static void java_stack_dup (int, int);
48 static void build_java_athrow (tree);
49 static void build_java_jsr (int, int);
50 static void build_java_ret (tree);
51 static void expand_java_multianewarray (tree, int);
52 static void expand_java_arraystore (tree);
53 static void expand_java_arrayload (tree);
54 static void expand_java_array_length (void);
55 static tree build_java_monitor (tree, tree);
56 static void expand_java_pushc (int, tree);
57 static void expand_java_return (tree);
58 static void expand_load_internal (int, tree, int);
59 static void expand_java_NEW (tree);
60 static void expand_java_INSTANCEOF (tree);
61 static void expand_java_CHECKCAST (tree);
62 static void expand_iinc (unsigned int, int, int);
63 static void expand_java_binop (tree, enum tree_code);
64 static void note_label (int, int);
65 static void expand_compare (enum tree_code, tree, tree, int);
66 static void expand_test (enum tree_code, tree, int);
67 static void expand_cond (enum tree_code, tree, int);
68 static void expand_java_goto (int);
69 static tree expand_java_switch (tree, int);
70 static void expand_java_add_case (tree, int, int);
71 static VEC(tree,gc) *pop_arguments (tree);
72 static void expand_invoke (int, int, int);
73 static void expand_java_field_op (int, int, int);
74 static void java_push_constant_from_pool (struct JCF *, int);
75 static void java_stack_pop (int);
76 static tree build_java_throw_out_of_bounds_exception (tree);
77 static tree build_java_check_indexed_type (tree, tree);
78 static unsigned char peek_opcode_at_pc (struct JCF *, int, int);
79 static void promote_arguments (void);
80 static void cache_cpool_data_ref (void);
82 static GTY(()) tree operand_type[59];
84 static GTY(()) tree methods_ident;
85 static GTY(()) tree ncode_ident;
86 tree dtable_ident = NULL_TREE;
88 /* Set to nonzero value in order to emit class initialization code
89 before static field references. */
90 int always_initialize_class_p = 0;
92 /* We store the stack state in two places:
93 Within a basic block, we use the quick_stack, which is a VEC of expression
95 This is the top part of the stack; below that we use find_stack_slot.
96 At the end of a basic block, the quick_stack must be flushed
97 to the stack slot array (as handled by find_stack_slot).
98 Using quick_stack generates better code (especially when
99 compiled without optimization), because we do not have to
100 explicitly store and load trees to temporary variables.
102 If a variable is on the quick stack, it means the value of variable
103 when the quick stack was last flushed. Conceptually, flush_quick_stack
104 saves all the quick_stack elements in parallel. However, that is
105 complicated, so it actually saves them (i.e. copies each stack value
106 to is home virtual register) from low indexes. This allows a quick_stack
107 element at index i (counting from the bottom of stack the) to references
108 slot virtuals for register that are >= i, but not those that are deeper.
109 This convention makes most operations easier. For example iadd works
110 even when the stack contains (reg[0], reg[1]): It results in the
111 stack containing (reg[0]+reg[1]), which is OK. However, some stack
112 operations are more complicated. For example dup given a stack
113 containing (reg[0]) would yield (reg[0], reg[0]), which would violate
114 the convention, since stack value 1 would refer to a register with
115 lower index (reg[0]), which flush_quick_stack does not safely handle.
116 So dup cannot just add an extra element to the quick_stack, but iadd can.
119 static GTY(()) VEC(tree,gc) *quick_stack;
121 /* The physical memory page size used in this computer. See
122 build_field_ref(). */
123 static GTY(()) tree page_size;
125 /* The stack pointer of the Java virtual machine.
126 This does include the size of the quick_stack. */
130 const unsigned char *linenumber_table;
131 int linenumber_count;
133 /* Largest pc so far in this method that has been passed to lookup_label. */
134 int highest_label_pc_this_method = -1;
136 /* Base value for this method to add to pc to get generated label. */
137 int start_label_pc_this_method = 0;
140 init_expr_processing (void)
142 operand_type[21] = operand_type[54] = int_type_node;
143 operand_type[22] = operand_type[55] = long_type_node;
144 operand_type[23] = operand_type[56] = float_type_node;
145 operand_type[24] = operand_type[57] = double_type_node;
146 operand_type[25] = operand_type[58] = ptr_type_node;
150 java_truthvalue_conversion (tree expr)
152 /* It is simpler and generates better code to have only TRUTH_*_EXPR
153 or comparison expressions as truth values at this level.
155 This function should normally be identity for Java. */
157 switch (TREE_CODE (expr))
159 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
160 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
161 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
162 case ORDERED_EXPR: case UNORDERED_EXPR:
163 case TRUTH_ANDIF_EXPR:
164 case TRUTH_ORIF_EXPR:
173 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
176 return real_zerop (expr) ? boolean_false_node : boolean_true_node;
178 /* are these legal? XXX JH */
182 /* These don't change whether an object is nonzero or zero. */
183 return java_truthvalue_conversion (TREE_OPERAND (expr, 0));
186 /* Distribute the conversion into the arms of a COND_EXPR. */
187 return fold_build3 (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
188 java_truthvalue_conversion (TREE_OPERAND (expr, 1)),
189 java_truthvalue_conversion (TREE_OPERAND (expr, 2)));
192 /* If this is widening the argument, we can ignore it. */
193 if (TYPE_PRECISION (TREE_TYPE (expr))
194 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
195 return java_truthvalue_conversion (TREE_OPERAND (expr, 0));
196 /* fall through to default */
199 return fold_build2 (NE_EXPR, boolean_type_node,
200 expr, boolean_false_node);
204 /* Save any stack slots that happen to be in the quick_stack into their
205 home virtual register slots.
207 The copy order is from low stack index to high, to support the invariant
208 that the expression for a slot may contain decls for stack slots with
209 higher (or the same) index, but not lower. */
212 flush_quick_stack (void)
214 int stack_index = stack_pointer;
218 /* Count the number of slots the quick stack is holding. */
219 for (ix = 0; VEC_iterate(tree, quick_stack, ix, t); ix++)
220 stack_index -= 1 + TYPE_IS_WIDE (TREE_TYPE (t));
222 for (ix = 0; VEC_iterate(tree, quick_stack, ix, t); ix++)
224 tree decl, type = TREE_TYPE (t);
226 decl = find_stack_slot (stack_index, type);
228 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (t), decl, t));
229 stack_index += 1 + TYPE_IS_WIDE (type);
232 VEC_truncate (tree, quick_stack, 0);
235 /* Push TYPE on the type stack.
236 Return true on success, 0 on overflow. */
239 push_type_0 (tree type)
242 type = promote_type (type);
243 n_words = 1 + TYPE_IS_WIDE (type);
244 if (stack_pointer + n_words > DECL_MAX_STACK (current_function_decl))
246 /* Allocate decl for this variable now, so we get a temporary that
247 survives the whole method. */
248 find_stack_slot (stack_pointer, type);
249 stack_type_map[stack_pointer++] = type;
251 while (--n_words >= 0)
252 stack_type_map[stack_pointer++] = TYPE_SECOND;
257 push_type (tree type)
259 int r = push_type_0 (type);
264 push_value (tree value)
266 tree type = TREE_TYPE (value);
267 if (TYPE_PRECISION (type) < 32 && INTEGRAL_TYPE_P (type))
269 type = promote_type (type);
270 value = convert (type, value);
273 VEC_safe_push (tree, gc, quick_stack, value);
275 /* If the value has a side effect, then we need to evaluate it
276 whether or not the result is used. If the value ends up on the
277 quick stack and is then popped, this won't happen -- so we flush
278 the quick stack. It is safest to simply always flush, though,
279 since TREE_SIDE_EFFECTS doesn't capture COMPONENT_REF, and for
280 the latter we may need to strip conversions. */
281 flush_quick_stack ();
284 /* Pop a type from the type stack.
285 TYPE is the expected type. Return the actual type, which must be
287 On an error, *MESSAGEP is set to a freshly malloc'd error message. */
290 pop_type_0 (tree type, char **messagep)
295 if (TREE_CODE (type) == RECORD_TYPE)
296 type = promote_type (type);
297 n_words = 1 + TYPE_IS_WIDE (type);
298 if (stack_pointer < n_words)
300 *messagep = xstrdup ("stack underflow");
303 while (--n_words > 0)
305 if (stack_type_map[--stack_pointer] != void_type_node)
307 *messagep = xstrdup ("Invalid multi-word value on type stack");
311 t = stack_type_map[--stack_pointer];
312 if (type == NULL_TREE || t == type)
314 if (TREE_CODE (t) == TREE_LIST)
318 tree tt = TREE_PURPOSE (t);
319 if (! can_widen_reference_to (tt, type))
329 if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (t)
330 && TYPE_PRECISION (type) <= 32 && TYPE_PRECISION (t) <= 32)
332 if (TREE_CODE (type) == POINTER_TYPE && TREE_CODE (t) == POINTER_TYPE)
334 /* If the expected type we've been passed is object or ptr
335 (i.e. void*), the caller needs to know the real type. */
336 if (type == ptr_type_node || type == object_ptr_type_node)
339 /* Since the verifier has already run, we know that any
340 types we see will be compatible. In BC mode, this fact
341 may be checked at runtime, but if that is so then we can
342 assume its truth here as well. So, we always succeed
343 here, with the expected type. */
347 if (! flag_verify_invocations && flag_indirect_dispatch
348 && t == object_ptr_type_node)
350 if (type != ptr_type_node)
351 warning (0, "need to insert runtime check for %s",
352 xstrdup (lang_printable_name (type, 0)));
356 /* lang_printable_name uses a static buffer, so we must save the result
357 from calling it the first time. */
360 char *temp = xstrdup (lang_printable_name (type, 0));
361 /* If the stack contains a multi-word type, keep popping the stack until
362 the real type is found. */
363 while (t == void_type_node)
364 t = stack_type_map[--stack_pointer];
365 *messagep = concat ("expected type '", temp,
366 "' but stack contains '", lang_printable_name (t, 0),
373 /* Pop a type from the type stack.
374 TYPE is the expected type. Return the actual type, which must be
375 convertible to TYPE, otherwise call error. */
380 char *message = NULL;
381 type = pop_type_0 (type, &message);
384 error ("%s", message);
391 /* Return true if two type assertions are equal. */
394 type_assertion_eq (const void * k1_p, const void * k2_p)
396 const type_assertion k1 = *(const type_assertion *)k1_p;
397 const type_assertion k2 = *(const type_assertion *)k2_p;
398 return (k1.assertion_code == k2.assertion_code
400 && k1.op2 == k2.op2);
403 /* Hash a type assertion. */
406 type_assertion_hash (const void *p)
408 const type_assertion *k_p = (const type_assertion *) p;
409 hashval_t hash = iterative_hash (&k_p->assertion_code, sizeof
410 k_p->assertion_code, 0);
412 switch (k_p->assertion_code)
414 case JV_ASSERT_TYPES_COMPATIBLE:
415 hash = iterative_hash (&TYPE_UID (k_p->op2), sizeof TYPE_UID (k_p->op2),
419 case JV_ASSERT_IS_INSTANTIABLE:
420 hash = iterative_hash (&TYPE_UID (k_p->op1), sizeof TYPE_UID (k_p->op1),
424 case JV_ASSERT_END_OF_TABLE:
434 /* Add an entry to the type assertion table for the given class.
435 KLASS is the class for which this assertion will be evaluated by the
436 runtime during loading/initialization.
437 ASSERTION_CODE is the 'opcode' or type of this assertion: see java-tree.h.
438 OP1 and OP2 are the operands. The tree type of these arguments may be
439 specific to each assertion_code. */
442 add_type_assertion (tree klass, int assertion_code, tree op1, tree op2)
444 htab_t assertions_htab;
448 assertions_htab = TYPE_ASSERTIONS (klass);
449 if (assertions_htab == NULL)
451 assertions_htab = htab_create_ggc (7, type_assertion_hash,
452 type_assertion_eq, NULL);
453 TYPE_ASSERTIONS (current_class) = assertions_htab;
456 as.assertion_code = assertion_code;
460 as_pp = htab_find_slot (assertions_htab, &as, INSERT);
462 /* Don't add the same assertion twice. */
466 *as_pp = ggc_alloc (sizeof (type_assertion));
467 **(type_assertion **)as_pp = as;
471 /* Return 1 if SOURCE_TYPE can be safely widened to TARGET_TYPE.
472 Handles array types and interfaces. */
475 can_widen_reference_to (tree source_type, tree target_type)
477 if (source_type == ptr_type_node || target_type == object_ptr_type_node)
480 /* Get rid of pointers */
481 if (TREE_CODE (source_type) == POINTER_TYPE)
482 source_type = TREE_TYPE (source_type);
483 if (TREE_CODE (target_type) == POINTER_TYPE)
484 target_type = TREE_TYPE (target_type);
486 if (source_type == target_type)
489 /* FIXME: This is very pessimistic, in that it checks everything,
490 even if we already know that the types are compatible. If we're
491 to support full Java class loader semantics, we need this.
492 However, we could do something more optimal. */
493 if (! flag_verify_invocations)
495 add_type_assertion (current_class, JV_ASSERT_TYPES_COMPATIBLE,
496 source_type, target_type);
499 warning (0, "assert: %s is assign compatible with %s",
500 xstrdup (lang_printable_name (target_type, 0)),
501 xstrdup (lang_printable_name (source_type, 0)));
502 /* Punt everything to runtime. */
506 if (TYPE_DUMMY (source_type) || TYPE_DUMMY (target_type))
512 if (TYPE_ARRAY_P (source_type) || TYPE_ARRAY_P (target_type))
514 HOST_WIDE_INT source_length, target_length;
515 if (TYPE_ARRAY_P (source_type) != TYPE_ARRAY_P (target_type))
517 /* An array implements Cloneable and Serializable. */
518 tree name = DECL_NAME (TYPE_NAME (target_type));
519 return (name == java_lang_cloneable_identifier_node
520 || name == java_io_serializable_identifier_node);
522 target_length = java_array_type_length (target_type);
523 if (target_length >= 0)
525 source_length = java_array_type_length (source_type);
526 if (source_length != target_length)
529 source_type = TYPE_ARRAY_ELEMENT (source_type);
530 target_type = TYPE_ARRAY_ELEMENT (target_type);
531 if (source_type == target_type)
533 if (TREE_CODE (source_type) != POINTER_TYPE
534 || TREE_CODE (target_type) != POINTER_TYPE)
536 return can_widen_reference_to (source_type, target_type);
540 int source_depth = class_depth (source_type);
541 int target_depth = class_depth (target_type);
543 if (TYPE_DUMMY (source_type) || TYPE_DUMMY (target_type))
546 warning (0, "assert: %s is assign compatible with %s",
547 xstrdup (lang_printable_name (target_type, 0)),
548 xstrdup (lang_printable_name (source_type, 0)));
552 /* class_depth can return a negative depth if an error occurred */
553 if (source_depth < 0 || target_depth < 0)
556 if (CLASS_INTERFACE (TYPE_NAME (target_type)))
558 /* target_type is OK if source_type or source_type ancestors
559 implement target_type. We handle multiple sub-interfaces */
560 tree binfo, base_binfo;
563 for (binfo = TYPE_BINFO (source_type), i = 0;
564 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
565 if (can_widen_reference_to
566 (BINFO_TYPE (base_binfo), target_type))
573 for ( ; source_depth > target_depth; source_depth--)
576 = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (source_type), 0));
578 return source_type == target_type;
584 pop_value (tree type)
586 type = pop_type (type);
587 if (VEC_length (tree, quick_stack) != 0)
588 return VEC_pop (tree, quick_stack);
590 return find_stack_slot (stack_pointer, promote_type (type));
594 /* Pop and discard the top COUNT stack slots. */
597 java_stack_pop (int count)
603 gcc_assert (stack_pointer != 0);
605 type = stack_type_map[stack_pointer - 1];
606 if (type == TYPE_SECOND)
609 gcc_assert (stack_pointer != 1 && count > 0);
611 type = stack_type_map[stack_pointer - 2];
618 /* Implement the 'swap' operator (to swap two top stack slots). */
621 java_stack_swap (void)
627 if (stack_pointer < 2
628 || (type1 = stack_type_map[stack_pointer - 1]) == TYPE_SECOND
629 || (type2 = stack_type_map[stack_pointer - 2]) == TYPE_SECOND
630 || TYPE_IS_WIDE (type1) || TYPE_IS_WIDE (type2))
631 /* Bad stack swap. */
633 /* Bad stack swap. */
635 flush_quick_stack ();
636 decl1 = find_stack_slot (stack_pointer - 1, type1);
637 decl2 = find_stack_slot (stack_pointer - 2, type2);
638 temp = build_decl (input_location, VAR_DECL, NULL_TREE, type1);
639 java_add_local_var (temp);
640 java_add_stmt (build2 (MODIFY_EXPR, type1, temp, decl1));
641 java_add_stmt (build2 (MODIFY_EXPR, type2,
642 find_stack_slot (stack_pointer - 1, type2),
644 java_add_stmt (build2 (MODIFY_EXPR, type1,
645 find_stack_slot (stack_pointer - 2, type1),
647 stack_type_map[stack_pointer - 1] = type2;
648 stack_type_map[stack_pointer - 2] = type1;
652 java_stack_dup (int size, int offset)
654 int low_index = stack_pointer - size - offset;
657 error ("stack underflow - dup* operation");
659 flush_quick_stack ();
661 stack_pointer += size;
662 dst_index = stack_pointer;
664 for (dst_index = stack_pointer; --dst_index >= low_index; )
667 int src_index = dst_index - size;
668 if (src_index < low_index)
669 src_index = dst_index + size + offset;
670 type = stack_type_map [src_index];
671 if (type == TYPE_SECOND)
673 /* Dup operation splits 64-bit number. */
674 gcc_assert (src_index > low_index);
676 stack_type_map[dst_index] = type;
677 src_index--; dst_index--;
678 type = stack_type_map[src_index];
679 gcc_assert (TYPE_IS_WIDE (type));
682 gcc_assert (! TYPE_IS_WIDE (type));
684 if (src_index != dst_index)
686 tree src_decl = find_stack_slot (src_index, type);
687 tree dst_decl = find_stack_slot (dst_index, type);
690 (build2 (MODIFY_EXPR, TREE_TYPE (dst_decl), dst_decl, src_decl));
691 stack_type_map[dst_index] = type;
696 /* Calls _Jv_Throw or _Jv_Sjlj_Throw. Discard the contents of the
700 build_java_athrow (tree node)
704 call = build_call_nary (void_type_node,
705 build_address_of (throw_node),
707 TREE_SIDE_EFFECTS (call) = 1;
708 java_add_stmt (call);
709 java_stack_pop (stack_pointer);
712 /* Implementation for jsr/ret */
715 build_java_jsr (int target_pc, int return_pc)
717 tree where = lookup_label (target_pc);
718 tree ret = lookup_label (return_pc);
719 tree ret_label = fold_build1 (ADDR_EXPR, return_address_type_node, ret);
720 push_value (ret_label);
721 flush_quick_stack ();
722 java_add_stmt (build1 (GOTO_EXPR, void_type_node, where));
724 /* Do not need to emit the label here. We noted the existence of the
725 label as a jump target in note_instructions; we'll emit the label
726 for real at the beginning of the expand_byte_code loop. */
730 build_java_ret (tree location)
732 java_add_stmt (build1 (GOTO_EXPR, void_type_node, location));
735 /* Implementation of operations on array: new, load, store, length */
738 decode_newarray_type (int atype)
742 case 4: return boolean_type_node;
743 case 5: return char_type_node;
744 case 6: return float_type_node;
745 case 7: return double_type_node;
746 case 8: return byte_type_node;
747 case 9: return short_type_node;
748 case 10: return int_type_node;
749 case 11: return long_type_node;
750 default: return NULL_TREE;
754 /* Map primitive type to the code used by OPCODE_newarray. */
757 encode_newarray_type (tree type)
759 if (type == boolean_type_node)
761 else if (type == char_type_node)
763 else if (type == float_type_node)
765 else if (type == double_type_node)
767 else if (type == byte_type_node)
769 else if (type == short_type_node)
771 else if (type == int_type_node)
773 else if (type == long_type_node)
779 /* Build a call to _Jv_ThrowBadArrayIndex(), the
780 ArrayIndexOfBoundsException exception handler. */
783 build_java_throw_out_of_bounds_exception (tree index)
787 /* We need to build a COMPOUND_EXPR because _Jv_ThrowBadArrayIndex()
788 has void return type. We cannot just set the type of the CALL_EXPR below
789 to int_type_node because we would lose it during gimplification. */
790 gcc_assert (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (soft_badarrayindex_node))));
791 node = build_call_nary (void_type_node,
792 build_address_of (soft_badarrayindex_node),
794 TREE_SIDE_EFFECTS (node) = 1;
796 node = build2 (COMPOUND_EXPR, int_type_node, node, integer_zero_node);
797 TREE_SIDE_EFFECTS (node) = 1; /* Allows expansion within ANDIF */
802 /* Return the length of an array. Doesn't perform any checking on the nature
803 or value of the array NODE. May be used to implement some bytecodes. */
806 build_java_array_length_access (tree node)
808 tree type = TREE_TYPE (node);
809 tree array_type = TREE_TYPE (type);
810 HOST_WIDE_INT length;
812 if (!is_array_type_p (type))
814 /* With the new verifier, we will see an ordinary pointer type
815 here. In this case, we just use an arbitrary array type. */
816 array_type = build_java_array_type (object_ptr_type_node, -1);
817 type = promote_type (array_type);
820 length = java_array_type_length (type);
822 return build_int_cst (NULL_TREE, length);
824 node = build3 (COMPONENT_REF, int_type_node,
825 build_java_indirect_ref (array_type, node,
826 flag_check_references),
827 lookup_field (&array_type, get_identifier ("length")),
829 IS_ARRAY_LENGTH_ACCESS (node) = 1;
833 /* Optionally checks a reference against the NULL pointer. ARG1: the
834 expr, ARG2: we should check the reference. Don't generate extra
835 checks if we're not generating code. */
838 java_check_reference (tree expr, int check)
840 if (!flag_syntax_only && check)
842 expr = save_expr (expr);
843 expr = build3 (COND_EXPR, TREE_TYPE (expr),
844 build2 (EQ_EXPR, boolean_type_node,
845 expr, null_pointer_node),
846 build_call_nary (void_type_node,
847 build_address_of (soft_nullpointer_node),
855 /* Reference an object: just like an INDIRECT_REF, but with checking. */
858 build_java_indirect_ref (tree type, tree expr, int check)
861 t = java_check_reference (expr, check);
862 t = convert (build_pointer_type (type), t);
863 return build1 (INDIRECT_REF, type, t);
866 /* Implement array indexing (either as l-value or r-value).
867 Returns a tree for ARRAY[INDEX], assume TYPE is the element type.
868 Optionally performs bounds checking and/or test to NULL.
869 At this point, ARRAY should have been verified as an array. */
872 build_java_arrayaccess (tree array, tree type, tree index)
874 tree node, throw_expr = NULL_TREE;
877 tree array_type = TREE_TYPE (TREE_TYPE (array));
878 tree size_exp = fold_convert (sizetype, size_in_bytes (type));
880 if (!is_array_type_p (TREE_TYPE (array)))
882 /* With the new verifier, we will see an ordinary pointer type
883 here. In this case, we just use the correct array type. */
884 array_type = build_java_array_type (type, -1);
887 if (flag_bounds_check)
890 * (unsigned jint) INDEX >= (unsigned jint) LEN
891 * && throw ArrayIndexOutOfBoundsException.
892 * Note this is equivalent to and more efficient than:
893 * INDEX < 0 || INDEX >= LEN && throw ... */
895 tree len = convert (unsigned_int_type_node,
896 build_java_array_length_access (array));
897 test = fold_build2 (GE_EXPR, boolean_type_node,
898 convert (unsigned_int_type_node, index),
900 if (! integer_zerop (test))
903 = build2 (TRUTH_ANDIF_EXPR, int_type_node, test,
904 build_java_throw_out_of_bounds_exception (index));
905 /* allows expansion within COMPOUND */
906 TREE_SIDE_EFFECTS( throw_expr ) = 1;
910 /* If checking bounds, wrap the index expr with a COMPOUND_EXPR in order
911 to have the bounds check evaluated first. */
912 if (throw_expr != NULL_TREE)
913 index = build2 (COMPOUND_EXPR, int_type_node, throw_expr, index);
915 data_field = lookup_field (&array_type, get_identifier ("data"));
917 ref = build3 (COMPONENT_REF, TREE_TYPE (data_field),
918 build_java_indirect_ref (array_type, array,
919 flag_check_references),
920 data_field, NULL_TREE);
922 /* Take the address of the data field and convert it to a pointer to
924 node = build1 (NOP_EXPR, build_pointer_type (type), build_address_of (ref));
926 /* Multiply the index by the size of an element to obtain a byte
927 offset. Convert the result to a pointer to the element type. */
928 index = build2 (MULT_EXPR, sizetype,
929 fold_convert (sizetype, index),
932 /* Sum the byte offset and the address of the data field. */
933 node = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (node), node, index);
937 *((&array->data) + index*size_exp)
940 return build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (node)), node);
943 /* Generate code to throw an ArrayStoreException if OBJECT is not assignable
944 (at runtime) to an element of ARRAY. A NOP_EXPR is returned if it can
945 determine that no check is required. */
948 build_java_arraystore_check (tree array, tree object)
950 tree check, element_type, source;
951 tree array_type_p = TREE_TYPE (array);
952 tree object_type = TYPE_NAME (TREE_TYPE (TREE_TYPE (object)));
954 if (! flag_verify_invocations)
956 /* With the new verifier, we don't track precise types. FIXME:
957 performance regression here. */
958 element_type = TYPE_NAME (object_type_node);
962 gcc_assert (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 gcc_assert (TREE_CODE (element_type) == TYPE_DECL
970 && TREE_CODE (object_type) == TYPE_DECL);
972 if (!flag_store_check)
973 return build1 (NOP_EXPR, array_type_p, array);
975 /* No check is needed if the element type is final. Also check that
976 element_type matches object_type, since in the bytecode
977 compilation case element_type may be the actual element type of
978 the array rather than its declared type. However, if we're doing
979 indirect dispatch, we can't do the `final' optimization. */
980 if (element_type == object_type
981 && ! flag_indirect_dispatch
982 && CLASS_FINAL (element_type))
983 return build1 (NOP_EXPR, array_type_p, array);
985 /* OBJECT might be wrapped by a SAVE_EXPR. */
986 if (TREE_CODE (object) == SAVE_EXPR)
987 source = TREE_OPERAND (object, 0);
991 /* Avoid the check if OBJECT was just loaded from the same array. */
992 if (TREE_CODE (source) == ARRAY_REF)
995 source = TREE_OPERAND (source, 0); /* COMPONENT_REF. */
996 source = TREE_OPERAND (source, 0); /* INDIRECT_REF. */
997 source = TREE_OPERAND (source, 0); /* Source array's DECL or SAVE_EXPR. */
998 if (TREE_CODE (source) == SAVE_EXPR)
999 source = TREE_OPERAND (source, 0);
1002 if (TREE_CODE (target) == SAVE_EXPR)
1003 target = TREE_OPERAND (target, 0);
1005 if (source == target)
1006 return build1 (NOP_EXPR, array_type_p, array);
1009 /* Build an invocation of _Jv_CheckArrayStore */
1010 check = build_call_nary (void_type_node,
1011 build_address_of (soft_checkarraystore_node),
1013 TREE_SIDE_EFFECTS (check) = 1;
1018 /* Makes sure that INDEXED_TYPE is appropriate. If not, make it from
1019 ARRAY_NODE. This function is used to retrieve something less vague than
1020 a pointer type when indexing the first dimension of something like [[<t>.
1021 May return a corrected type, if necessary, otherwise INDEXED_TYPE is
1022 return unchanged. */
1025 build_java_check_indexed_type (tree array_node ATTRIBUTE_UNUSED,
1028 /* We used to check to see if ARRAY_NODE really had array type.
1029 However, with the new verifier, this is not necessary, as we know
1030 that the object will be an array of the appropriate type. */
1032 return indexed_type;
1035 /* newarray triggers a call to _Jv_NewPrimArray. This function should be
1036 called with an integer code (the type of array to create), and the length
1037 of the array to create. */
1040 build_newarray (int atype_value, tree length)
1044 tree prim_type = decode_newarray_type (atype_value);
1046 = build_java_array_type (prim_type,
1047 host_integerp (length, 0) == INTEGER_CST
1048 ? tree_low_cst (length, 0) : -1);
1050 /* Pass a reference to the primitive type class and save the runtime
1052 type_arg = build_class_ref (prim_type);
1054 return build_call_nary (promote_type (type),
1055 build_address_of (soft_newarray_node),
1056 2, type_arg, length);
1059 /* Generates anewarray from a given CLASS_TYPE. Gets from the stack the size
1060 of the dimension. */
1063 build_anewarray (tree class_type, tree length)
1066 = build_java_array_type (class_type,
1067 host_integerp (length, 0)
1068 ? tree_low_cst (length, 0) : -1);
1070 return build_call_nary (promote_type (type),
1071 build_address_of (soft_anewarray_node),
1074 build_class_ref (class_type),
1078 /* Return a node the evaluates 'new TYPE[LENGTH]'. */
1081 build_new_array (tree type, tree length)
1083 if (JPRIMITIVE_TYPE_P (type))
1084 return build_newarray (encode_newarray_type (type), length);
1086 return build_anewarray (TREE_TYPE (type), length);
1089 /* Generates a call to _Jv_NewMultiArray. multianewarray expects a
1090 class pointer, a number of dimensions and the matching number of
1091 dimensions. The argument list is NULL terminated. */
1094 expand_java_multianewarray (tree class_type, int ndim)
1097 VEC(tree,gc) *args = NULL;
1099 VEC_safe_grow (tree, gc, args, 3 + ndim);
1101 VEC_replace (tree, args, 0, build_class_ref (class_type));
1102 VEC_replace (tree, args, 1, build_int_cst (NULL_TREE, ndim));
1104 for(i = ndim - 1; i >= 0; i-- )
1105 VEC_replace (tree, args, (unsigned)(2 + i), pop_value (int_type_node));
1107 VEC_replace (tree, args, 2 + ndim, null_pointer_node);
1109 push_value (build_call_vec (promote_type (class_type),
1110 build_address_of (soft_multianewarray_node),
1114 /* ARRAY[INDEX] <- RHS. build_java_check_indexed_type makes sure that
1115 ARRAY is an array type. May expand some bound checking and NULL
1116 pointer checking. RHS_TYPE_NODE we are going to store. In the case
1117 of the CHAR/BYTE/BOOLEAN SHORT, the type popped of the stack is an
1118 INT. In those cases, we make the conversion.
1120 if ARRAy is a reference type, the assignment is checked at run-time
1121 to make sure that the RHS can be assigned to the array element
1122 type. It is not necessary to generate this code if ARRAY is final. */
1125 expand_java_arraystore (tree rhs_type_node)
1127 tree rhs_node = pop_value ((INTEGRAL_TYPE_P (rhs_type_node)
1128 && TYPE_PRECISION (rhs_type_node) <= 32) ?
1129 int_type_node : rhs_type_node);
1130 tree index = pop_value (int_type_node);
1131 tree array_type, array, temp, access;
1133 /* If we're processing an `aaload' we might as well just pick
1135 if (TREE_CODE (rhs_type_node) == POINTER_TYPE)
1137 array_type = build_java_array_type (object_ptr_type_node, -1);
1138 rhs_type_node = object_ptr_type_node;
1141 array_type = build_java_array_type (rhs_type_node, -1);
1143 array = pop_value (array_type);
1144 array = build1 (NOP_EXPR, promote_type (array_type), array);
1146 rhs_type_node = build_java_check_indexed_type (array, rhs_type_node);
1148 flush_quick_stack ();
1150 index = save_expr (index);
1151 array = save_expr (array);
1153 /* We want to perform the bounds check (done by
1154 build_java_arrayaccess) before the type check (done by
1155 build_java_arraystore_check). So, we call build_java_arrayaccess
1156 -- which returns an ARRAY_REF lvalue -- and we then generate code
1157 to stash the address of that lvalue in a temp. Then we call
1158 build_java_arraystore_check, and finally we generate a
1159 MODIFY_EXPR to set the array element. */
1161 access = build_java_arrayaccess (array, rhs_type_node, index);
1162 temp = build_decl (input_location, VAR_DECL, NULL_TREE,
1163 build_pointer_type (TREE_TYPE (access)));
1164 java_add_local_var (temp);
1165 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (temp),
1167 build_fold_addr_expr (access)));
1169 if (TREE_CODE (rhs_type_node) == POINTER_TYPE)
1171 tree check = build_java_arraystore_check (array, rhs_node);
1172 java_add_stmt (check);
1175 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (access),
1176 build1 (INDIRECT_REF, TREE_TYPE (access), temp),
1180 /* Expand the evaluation of ARRAY[INDEX]. build_java_check_indexed_type makes
1181 sure that LHS is an array type. May expand some bound checking and NULL
1183 LHS_TYPE_NODE is the type of ARRAY[INDEX]. But in the case of CHAR/BYTE/
1184 BOOLEAN/SHORT, we push a promoted type back to the stack.
1188 expand_java_arrayload (tree lhs_type_node)
1191 tree index_node = pop_value (int_type_node);
1195 /* If we're processing an `aaload' we might as well just pick
1197 if (TREE_CODE (lhs_type_node) == POINTER_TYPE)
1199 array_type = build_java_array_type (object_ptr_type_node, -1);
1200 lhs_type_node = object_ptr_type_node;
1203 array_type = build_java_array_type (lhs_type_node, -1);
1204 array_node = pop_value (array_type);
1205 array_node = build1 (NOP_EXPR, promote_type (array_type), array_node);
1207 index_node = save_expr (index_node);
1208 array_node = save_expr (array_node);
1210 lhs_type_node = build_java_check_indexed_type (array_node,
1212 load_node = build_java_arrayaccess (array_node,
1215 if (INTEGRAL_TYPE_P (lhs_type_node) && TYPE_PRECISION (lhs_type_node) <= 32)
1216 load_node = fold_build1 (NOP_EXPR, int_type_node, load_node);
1217 push_value (load_node);
1220 /* Expands .length. Makes sure that we deal with and array and may expand
1221 a NULL check on the array object. */
1224 expand_java_array_length (void)
1226 tree array = pop_value (ptr_type_node);
1227 tree length = build_java_array_length_access (array);
1229 push_value (length);
1232 /* Emit code for the call to _Jv_Monitor{Enter,Exit}. CALL can be
1233 either soft_monitorenter_node or soft_monitorexit_node. */
1236 build_java_monitor (tree call, tree object)
1238 return build_call_nary (void_type_node,
1239 build_address_of (call),
1243 /* Emit code for one of the PUSHC instructions. */
1246 expand_java_pushc (int ival, tree type)
1249 if (type == ptr_type_node && ival == 0)
1250 value = null_pointer_node;
1251 else if (type == int_type_node || type == long_type_node)
1252 value = build_int_cst (type, ival);
1253 else if (type == float_type_node || type == double_type_node)
1256 REAL_VALUE_FROM_INT (x, ival, 0, TYPE_MODE (type));
1257 value = build_real (type, x);
1266 expand_java_return (tree type)
1268 if (type == void_type_node)
1269 java_add_stmt (build1 (RETURN_EXPR, void_type_node, NULL));
1272 tree retval = pop_value (type);
1273 tree res = DECL_RESULT (current_function_decl);
1274 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, retval);
1276 /* Handle the situation where the native integer type is smaller
1277 than the JVM integer. It can happen for many cross compilers.
1278 The whole if expression just goes away if INT_TYPE_SIZE < 32
1280 if (INT_TYPE_SIZE < 32
1281 && (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (res)))
1282 < GET_MODE_SIZE (TYPE_MODE (type))))
1283 retval = build1(NOP_EXPR, TREE_TYPE(res), retval);
1285 TREE_SIDE_EFFECTS (retval) = 1;
1286 java_add_stmt (build1 (RETURN_EXPR, void_type_node, retval));
1291 expand_load_internal (int index, tree type, int pc)
1294 tree var = find_local_variable (index, type, pc);
1296 /* Now VAR is the VAR_DECL (or PARM_DECL) that we are going to push
1297 on the stack. If there is an assignment to this VAR_DECL between
1298 the stack push and the use, then the wrong code could be
1299 generated. To avoid this we create a new local and copy our
1300 value into it. Then we push this new local on the stack.
1301 Hopefully this all gets optimized out. */
1302 copy = build_decl (input_location, VAR_DECL, NULL_TREE, type);
1303 if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
1304 && TREE_TYPE (copy) != TREE_TYPE (var))
1305 var = convert (type, var);
1306 java_add_local_var (copy);
1307 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (var), copy, var));
1313 build_address_of (tree value)
1315 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (value)), value);
1319 class_has_finalize_method (tree type)
1321 tree super = CLASSTYPE_SUPER (type);
1323 if (super == NULL_TREE)
1324 return false; /* Every class with a real finalizer inherits */
1325 /* from java.lang.Object. */
1327 return HAS_FINALIZER_P (type) || class_has_finalize_method (super);
1331 java_create_object (tree type)
1333 tree alloc_node = (class_has_finalize_method (type)
1335 : alloc_no_finalizer_node);
1337 return build_call_nary (promote_type (type),
1338 build_address_of (alloc_node),
1339 1, build_class_ref (type));
1343 expand_java_NEW (tree type)
1347 alloc_node = (class_has_finalize_method (type) ? alloc_object_node
1348 : alloc_no_finalizer_node);
1349 if (! CLASS_LOADED_P (type))
1350 load_class (type, 1);
1351 safe_layout_class (type);
1352 push_value (build_call_nary (promote_type (type),
1353 build_address_of (alloc_node),
1354 1, build_class_ref (type)));
1357 /* This returns an expression which will extract the class of an
1361 build_get_class (tree value)
1363 tree class_field = lookup_field (&dtable_type, get_identifier ("class"));
1364 tree vtable_field = lookup_field (&object_type_node,
1365 get_identifier ("vtable"));
1366 tree tmp = build3 (COMPONENT_REF, dtable_ptr_type,
1367 build_java_indirect_ref (object_type_node, value,
1368 flag_check_references),
1369 vtable_field, NULL_TREE);
1370 return build3 (COMPONENT_REF, class_ptr_type,
1371 build1 (INDIRECT_REF, dtable_type, tmp),
1372 class_field, NULL_TREE);
1375 /* This builds the tree representation of the `instanceof' operator.
1376 It tries various tricks to optimize this in cases where types are
1380 build_instanceof (tree value, tree type)
1383 tree itype = TREE_TYPE (TREE_TYPE (soft_instanceof_node));
1384 tree valtype = TREE_TYPE (TREE_TYPE (value));
1385 tree valclass = TYPE_NAME (valtype);
1388 /* When compiling from bytecode, we need to ensure that TYPE has
1390 if (CLASS_P (type) && ! CLASS_LOADED_P (type))
1392 load_class (type, 1);
1393 safe_layout_class (type);
1394 if (! TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) == ERROR_MARK)
1395 return error_mark_node;
1397 klass = TYPE_NAME (type);
1399 if (type == object_type_node || inherits_from_p (valtype, type))
1401 /* Anything except `null' is an instance of Object. Likewise,
1402 if the object is known to be an instance of the class, then
1403 we only need to check for `null'. */
1404 expr = build2 (NE_EXPR, itype, value, null_pointer_node);
1406 else if (flag_verify_invocations
1407 && ! TYPE_ARRAY_P (type)
1408 && ! TYPE_ARRAY_P (valtype)
1409 && DECL_P (klass) && DECL_P (valclass)
1410 && ! CLASS_INTERFACE (valclass)
1411 && ! CLASS_INTERFACE (klass)
1412 && ! inherits_from_p (type, valtype)
1413 && (CLASS_FINAL (klass)
1414 || ! inherits_from_p (valtype, type)))
1416 /* The classes are from different branches of the derivation
1417 tree, so we immediately know the answer. */
1418 expr = boolean_false_node;
1420 else if (DECL_P (klass) && CLASS_FINAL (klass))
1422 tree save = save_expr (value);
1423 expr = build3 (COND_EXPR, itype,
1424 build2 (NE_EXPR, boolean_type_node,
1425 save, null_pointer_node),
1426 build2 (EQ_EXPR, itype,
1427 build_get_class (save),
1428 build_class_ref (type)),
1429 boolean_false_node);
1433 expr = build_call_nary (itype,
1434 build_address_of (soft_instanceof_node),
1435 2, value, build_class_ref (type));
1437 TREE_SIDE_EFFECTS (expr) = TREE_SIDE_EFFECTS (value);
1442 expand_java_INSTANCEOF (tree type)
1444 tree value = pop_value (object_ptr_type_node);
1445 value = build_instanceof (value, type);
1450 expand_java_CHECKCAST (tree type)
1452 tree value = pop_value (ptr_type_node);
1453 value = build_call_nary (promote_type (type),
1454 build_address_of (soft_checkcast_node),
1455 2, build_class_ref (type), value);
1460 expand_iinc (unsigned int local_var_index, int ival, int pc)
1462 tree local_var, res;
1463 tree constant_value;
1465 flush_quick_stack ();
1466 local_var = find_local_variable (local_var_index, int_type_node, pc);
1467 constant_value = build_int_cst (NULL_TREE, ival);
1468 res = fold_build2 (PLUS_EXPR, int_type_node, local_var, constant_value);
1469 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (local_var), local_var, res));
1474 build_java_soft_divmod (enum tree_code op, tree type, tree op1, tree op2)
1477 tree arg1 = convert (type, op1);
1478 tree arg2 = convert (type, op2);
1480 if (type == int_type_node)
1484 case TRUNC_DIV_EXPR:
1485 call = soft_idiv_node;
1487 case TRUNC_MOD_EXPR:
1488 call = soft_irem_node;
1494 else if (type == long_type_node)
1498 case TRUNC_DIV_EXPR:
1499 call = soft_ldiv_node;
1501 case TRUNC_MOD_EXPR:
1502 call = soft_lrem_node;
1510 call = build_call_nary (type, build_address_of (call), 2, arg1, arg2);
1515 build_java_binop (enum tree_code op, tree type, tree arg1, tree arg2)
1522 tree u_type = unsigned_type_for (type);
1523 arg1 = convert (u_type, arg1);
1524 arg1 = build_java_binop (RSHIFT_EXPR, u_type, arg1, arg2);
1525 return convert (type, arg1);
1529 mask = build_int_cst (NULL_TREE,
1530 TYPE_PRECISION (TREE_TYPE (arg1)) - 1);
1531 arg2 = fold_build2 (BIT_AND_EXPR, int_type_node, arg2, mask);
1534 case COMPARE_L_EXPR: /* arg1 > arg2 ? 1 : arg1 == arg2 ? 0 : -1 */
1535 case COMPARE_G_EXPR: /* arg1 < arg2 ? -1 : arg1 == arg2 ? 0 : 1 */
1536 arg1 = save_expr (arg1); arg2 = save_expr (arg2);
1538 tree ifexp1 = fold_build2 (op == COMPARE_L_EXPR ? GT_EXPR : LT_EXPR,
1539 boolean_type_node, arg1, arg2);
1540 tree ifexp2 = fold_build2 (EQ_EXPR, boolean_type_node, arg1, arg2);
1541 tree second_compare = fold_build3 (COND_EXPR, int_type_node,
1542 ifexp2, integer_zero_node,
1543 op == COMPARE_L_EXPR
1544 ? integer_minus_one_node
1545 : integer_one_node);
1546 return fold_build3 (COND_EXPR, int_type_node, ifexp1,
1547 op == COMPARE_L_EXPR ? integer_one_node
1548 : integer_minus_one_node,
1552 arg1 = save_expr (arg1); arg2 = save_expr (arg2);
1554 tree ifexp1 = fold_build2 (LT_EXPR, boolean_type_node, arg1, arg2);
1555 tree ifexp2 = fold_build2 (GT_EXPR, boolean_type_node, arg1, arg2);
1556 tree second_compare = fold_build3 (COND_EXPR, int_type_node,
1557 ifexp2, integer_one_node,
1559 return fold_build3 (COND_EXPR, int_type_node,
1560 ifexp1, integer_minus_one_node, second_compare);
1562 case TRUNC_DIV_EXPR:
1563 case TRUNC_MOD_EXPR:
1564 if (TREE_CODE (type) == REAL_TYPE
1565 && op == TRUNC_MOD_EXPR)
1568 if (type != double_type_node)
1570 arg1 = convert (double_type_node, arg1);
1571 arg2 = convert (double_type_node, arg2);
1573 call = build_call_nary (double_type_node,
1574 build_address_of (soft_fmod_node),
1576 if (type != double_type_node)
1577 call = convert (type, call);
1581 if (TREE_CODE (type) == INTEGER_TYPE
1582 && flag_use_divide_subroutine
1583 && ! flag_syntax_only)
1584 return build_java_soft_divmod (op, type, arg1, arg2);
1589 return fold_build2 (op, type, arg1, arg2);
1593 expand_java_binop (tree type, enum tree_code op)
1603 rtype = int_type_node;
1604 rarg = pop_value (rtype);
1607 rarg = pop_value (rtype);
1609 larg = pop_value (ltype);
1610 push_value (build_java_binop (op, type, larg, rarg));
1613 /* Lookup the field named NAME in *TYPEP or its super classes.
1614 If not found, return NULL_TREE.
1615 (If the *TYPEP is not found, or if the field reference is
1616 ambiguous, return error_mark_node.)
1617 If found, return the FIELD_DECL, and set *TYPEP to the
1618 class containing the field. */
1621 lookup_field (tree *typep, tree name)
1623 if (CLASS_P (*typep) && !CLASS_LOADED_P (*typep))
1625 load_class (*typep, 1);
1626 safe_layout_class (*typep);
1627 if (!TYPE_SIZE (*typep) || TREE_CODE (TYPE_SIZE (*typep)) == ERROR_MARK)
1628 return error_mark_node;
1632 tree field, binfo, base_binfo;
1636 for (field = TYPE_FIELDS (*typep); field; field = TREE_CHAIN (field))
1637 if (DECL_NAME (field) == name)
1640 /* Process implemented interfaces. */
1641 save_field = NULL_TREE;
1642 for (binfo = TYPE_BINFO (*typep), i = 0;
1643 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1645 tree t = BINFO_TYPE (base_binfo);
1646 if ((field = lookup_field (&t, name)))
1648 if (save_field == field)
1650 if (save_field == NULL_TREE)
1654 tree i1 = DECL_CONTEXT (save_field);
1655 tree i2 = DECL_CONTEXT (field);
1656 error ("reference %qs is ambiguous: appears in interface %qs and interface %qs",
1657 IDENTIFIER_POINTER (name),
1658 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (i1))),
1659 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (i2))));
1660 return error_mark_node;
1665 if (save_field != NULL_TREE)
1668 *typep = CLASSTYPE_SUPER (*typep);
1673 /* Look up the field named NAME in object SELF_VALUE,
1674 which has class SELF_CLASS (a non-handle RECORD_TYPE).
1675 SELF_VALUE is NULL_TREE if looking for a static field. */
1678 build_field_ref (tree self_value, tree self_class, tree name)
1680 tree base_class = self_class;
1681 tree field_decl = lookup_field (&base_class, name);
1682 if (field_decl == NULL_TREE)
1684 error ("field %qs not found", IDENTIFIER_POINTER (name));
1685 return error_mark_node;
1687 if (self_value == NULL_TREE)
1689 return build_static_field_ref (field_decl);
1693 tree base_type = promote_type (base_class);
1695 /* CHECK is true if self_value is not the this pointer. */
1696 int check = (! (DECL_P (self_value)
1697 && DECL_NAME (self_value) == this_identifier_node));
1699 /* Determine whether a field offset from NULL will lie within
1700 Page 0: this is necessary on those GNU/Linux/BSD systems that
1701 trap SEGV to generate NullPointerExceptions.
1703 We assume that Page 0 will be mapped with NOPERM, and that
1704 memory may be allocated from any other page, so only field
1705 offsets < pagesize are guaranteed to trap. We also assume
1706 the smallest page size we'll encounter is 4k bytes. */
1707 if (! flag_syntax_only && check && ! flag_check_references
1708 && ! flag_indirect_dispatch)
1710 tree field_offset = byte_position (field_decl);
1712 page_size = size_int (4096);
1713 check = ! INT_CST_LT_UNSIGNED (field_offset, page_size);
1716 if (base_type != TREE_TYPE (self_value))
1717 self_value = fold_build1 (NOP_EXPR, base_type, self_value);
1718 if (! flag_syntax_only && flag_indirect_dispatch)
1721 = build_int_cst (NULL_TREE, get_symbol_table_index
1722 (field_decl, NULL_TREE,
1723 &TYPE_OTABLE_METHODS (output_class)));
1725 = build4 (ARRAY_REF, integer_type_node,
1726 TYPE_OTABLE_DECL (output_class), otable_index,
1727 NULL_TREE, NULL_TREE);
1730 if (DECL_CONTEXT (field_decl) != output_class)
1732 = build3 (COND_EXPR, TREE_TYPE (field_offset),
1733 build2 (EQ_EXPR, boolean_type_node,
1734 field_offset, integer_zero_node),
1735 build_call_nary (void_type_node,
1736 build_address_of (soft_nosuchfield_node),
1740 field_offset = fold (convert (sizetype, field_offset));
1741 self_value = java_check_reference (self_value, check);
1743 = fold_build2 (POINTER_PLUS_EXPR,
1744 TREE_TYPE (self_value),
1745 self_value, field_offset);
1746 address = fold_convert (build_pointer_type (TREE_TYPE (field_decl)),
1748 return fold_build1 (INDIRECT_REF, TREE_TYPE (field_decl), address);
1751 self_value = build_java_indirect_ref (TREE_TYPE (TREE_TYPE (self_value)),
1753 return fold_build3 (COMPONENT_REF, TREE_TYPE (field_decl),
1754 self_value, field_decl, NULL_TREE);
1759 lookup_label (int pc)
1763 if (pc > highest_label_pc_this_method)
1764 highest_label_pc_this_method = pc;
1765 ASM_GENERATE_INTERNAL_LABEL(buf, "LJpc=", start_label_pc_this_method + pc);
1766 name = get_identifier (buf);
1767 if (IDENTIFIER_LOCAL_VALUE (name))
1768 return IDENTIFIER_LOCAL_VALUE (name);
1771 /* The type of the address of a label is return_address_type_node. */
1772 tree decl = create_label_decl (name);
1773 return pushdecl (decl);
1777 /* Generate a unique name for the purpose of loops and switches
1778 labels, and try-catch-finally blocks label or temporary variables. */
1781 generate_name (void)
1783 static int l_number = 0;
1785 ASM_GENERATE_INTERNAL_LABEL(buff, "LJv", l_number);
1787 return get_identifier (buff);
1791 create_label_decl (tree name)
1794 decl = build_decl (input_location, LABEL_DECL, name,
1795 TREE_TYPE (return_address_type_node));
1796 DECL_CONTEXT (decl) = current_function_decl;
1797 DECL_IGNORED_P (decl) = 1;
1801 /* This maps a bytecode offset (PC) to various flags. */
1802 char *instruction_bits;
1804 /* This is a vector of type states for the current method. It is
1805 indexed by PC. Each element is a tree vector holding the type
1806 state at that PC. We only note type states at basic block
1808 VEC(tree, gc) *type_states;
1811 note_label (int current_pc ATTRIBUTE_UNUSED, int target_pc)
1813 lookup_label (target_pc);
1814 instruction_bits [target_pc] |= BCODE_JUMP_TARGET;
1817 /* Emit code to jump to TARGET_PC if VALUE1 CONDITION VALUE2,
1818 where CONDITION is one of one the compare operators. */
1821 expand_compare (enum tree_code condition, tree value1, tree value2,
1824 tree target = lookup_label (target_pc);
1825 tree cond = fold_build2 (condition, boolean_type_node, value1, value2);
1827 (build3 (COND_EXPR, void_type_node, java_truthvalue_conversion (cond),
1828 build1 (GOTO_EXPR, void_type_node, target),
1829 build_java_empty_stmt ()));
1832 /* Emit code for a TEST-type opcode. */
1835 expand_test (enum tree_code condition, tree type, int target_pc)
1837 tree value1, value2;
1838 flush_quick_stack ();
1839 value1 = pop_value (type);
1840 value2 = (type == ptr_type_node) ? null_pointer_node : integer_zero_node;
1841 expand_compare (condition, value1, value2, target_pc);
1844 /* Emit code for a COND-type opcode. */
1847 expand_cond (enum tree_code condition, tree type, int target_pc)
1849 tree value1, value2;
1850 flush_quick_stack ();
1851 /* note: pop values in opposite order */
1852 value2 = pop_value (type);
1853 value1 = pop_value (type);
1854 /* Maybe should check value1 and value2 for type compatibility ??? */
1855 expand_compare (condition, value1, value2, target_pc);
1859 expand_java_goto (int target_pc)
1861 tree target_label = lookup_label (target_pc);
1862 flush_quick_stack ();
1863 java_add_stmt (build1 (GOTO_EXPR, void_type_node, target_label));
1867 expand_java_switch (tree selector, int default_pc)
1869 tree switch_expr, x;
1871 flush_quick_stack ();
1872 switch_expr = build3 (SWITCH_EXPR, TREE_TYPE (selector), selector,
1873 NULL_TREE, NULL_TREE);
1874 java_add_stmt (switch_expr);
1876 x = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE, NULL_TREE,
1877 create_artificial_label (input_location));
1878 append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1880 x = build1 (GOTO_EXPR, void_type_node, lookup_label (default_pc));
1881 append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1887 expand_java_add_case (tree switch_expr, int match, int target_pc)
1891 value = build_int_cst (TREE_TYPE (switch_expr), match);
1893 x = build3 (CASE_LABEL_EXPR, void_type_node, value, NULL_TREE,
1894 create_artificial_label (input_location));
1895 append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1897 x = build1 (GOTO_EXPR, void_type_node, lookup_label (target_pc));
1898 append_to_statement_list (x, &SWITCH_BODY (switch_expr));
1901 static VEC(tree,gc) *
1902 pop_arguments (tree method_type)
1904 function_args_iterator fnai;
1906 VEC(tree,gc) *args = NULL;
1909 FOREACH_FUNCTION_ARGS (method_type, type, fnai)
1911 /* XXX: leaky abstraction. */
1912 if (type == void_type_node)
1915 VEC_safe_push (tree, gc, args, type);
1918 arity = VEC_length (tree, args);
1922 tree arg = pop_value (VEC_index (tree, args, arity));
1924 /* We simply cast each argument to its proper type. This is
1925 needed since we lose type information coming out of the
1926 verifier. We also have to do this when we pop an integer
1927 type that must be promoted for the function call. */
1928 if (TREE_CODE (type) == POINTER_TYPE)
1929 arg = build1 (NOP_EXPR, type, arg);
1930 else if (targetm.calls.promote_prototypes (type)
1931 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
1932 && INTEGRAL_TYPE_P (type))
1933 arg = convert (integer_type_node, arg);
1935 VEC_replace (tree, args, arity, arg);
1941 /* Attach to PTR (a block) the declaration found in ENTRY. */
1944 attach_init_test_initialization_flags (void **entry, void *ptr)
1946 tree block = (tree)ptr;
1947 struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
1949 if (block != error_mark_node)
1951 if (TREE_CODE (block) == BIND_EXPR)
1953 tree body = BIND_EXPR_BODY (block);
1954 TREE_CHAIN (ite->value) = BIND_EXPR_VARS (block);
1955 BIND_EXPR_VARS (block) = ite->value;
1956 body = build2 (COMPOUND_EXPR, void_type_node,
1957 build1 (DECL_EXPR, void_type_node, ite->value), body);
1958 BIND_EXPR_BODY (block) = body;
1962 tree body = BLOCK_SUBBLOCKS (block);
1963 TREE_CHAIN (ite->value) = BLOCK_EXPR_DECLS (block);
1964 BLOCK_EXPR_DECLS (block) = ite->value;
1965 body = build2 (COMPOUND_EXPR, void_type_node,
1966 build1 (DECL_EXPR, void_type_node, ite->value), body);
1967 BLOCK_SUBBLOCKS (block) = body;
1974 /* Build an expression to initialize the class CLAS.
1975 if EXPR is non-NULL, returns an expression to first call the initializer
1976 (if it is needed) and then calls EXPR. */
1979 build_class_init (tree clas, tree expr)
1983 /* An optimization: if CLAS is a superclass of the class we're
1984 compiling, we don't need to initialize it. However, if CLAS is
1985 an interface, it won't necessarily be initialized, even if we
1987 if ((! CLASS_INTERFACE (TYPE_NAME (clas))
1988 && inherits_from_p (current_class, clas))
1989 || current_class == clas)
1992 if (always_initialize_class_p)
1994 init = build_call_nary (void_type_node,
1995 build_address_of (soft_initclass_node),
1996 1, build_class_ref (clas));
1997 TREE_SIDE_EFFECTS (init) = 1;
2001 tree *init_test_decl;
2003 init_test_decl = java_treetreehash_new
2004 (DECL_FUNCTION_INIT_TEST_TABLE (current_function_decl), clas);
2006 if (*init_test_decl == NULL)
2008 /* Build a declaration and mark it as a flag used to track
2009 static class initializations. */
2010 decl = build_decl (input_location, VAR_DECL, NULL_TREE,
2012 MAYBE_CREATE_VAR_LANG_DECL_SPECIFIC (decl);
2013 DECL_CONTEXT (decl) = current_function_decl;
2014 DECL_INITIAL (decl) = boolean_false_node;
2015 /* Don't emit any symbolic debugging info for this decl. */
2016 DECL_IGNORED_P (decl) = 1;
2017 *init_test_decl = decl;
2020 init = build_call_nary (void_type_node,
2021 build_address_of (soft_initclass_node),
2022 1, build_class_ref (clas));
2023 TREE_SIDE_EFFECTS (init) = 1;
2024 init = build3 (COND_EXPR, void_type_node,
2025 build2 (EQ_EXPR, boolean_type_node,
2026 *init_test_decl, boolean_false_node),
2027 init, integer_zero_node);
2028 TREE_SIDE_EFFECTS (init) = 1;
2029 init = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init,
2030 build2 (MODIFY_EXPR, boolean_type_node,
2031 *init_test_decl, boolean_true_node));
2032 TREE_SIDE_EFFECTS (init) = 1;
2035 if (expr != NULL_TREE)
2037 expr = build2 (COMPOUND_EXPR, TREE_TYPE (expr), init, expr);
2038 TREE_SIDE_EFFECTS (expr) = 1;
2046 /* Rewrite expensive calls that require stack unwinding at runtime to
2047 cheaper alternatives. The logic here performs these
2050 java.lang.Class.forName("foo") -> java.lang.Class.forName("foo", class$)
2051 java.lang.Class.getClassLoader() -> java.lang.Class.getClassLoader(class$)
2057 const char *classname;
2059 const char *signature;
2060 const char *new_classname;
2061 const char *new_signature;
2063 void (*rewrite_arglist) (VEC(tree,gc) **);
2066 /* Add __builtin_return_address(0) to the end of an arglist. */
2070 rewrite_arglist_getcaller (VEC(tree,gc) **arglist)
2073 = build_call_expr (built_in_decls[BUILT_IN_RETURN_ADDRESS],
2074 1, integer_zero_node);
2076 DECL_UNINLINABLE (current_function_decl) = 1;
2078 VEC_safe_push (tree, gc, *arglist, retaddr);
2081 /* Add this.class to the end of an arglist. */
2084 rewrite_arglist_getclass (VEC(tree,gc) **arglist)
2086 VEC_safe_push (tree, gc, *arglist, build_class_ref (output_class));
2089 static rewrite_rule rules[] =
2090 {{"java.lang.Class", "getClassLoader", "()Ljava/lang/ClassLoader;",
2091 "java.lang.Class", "(Ljava/lang/Class;)Ljava/lang/ClassLoader;",
2092 ACC_FINAL|ACC_PRIVATE, rewrite_arglist_getclass},
2094 {"java.lang.Class", "forName", "(Ljava/lang/String;)Ljava/lang/Class;",
2095 "java.lang.Class", "(Ljava/lang/String;Ljava/lang/Class;)Ljava/lang/Class;",
2096 ACC_FINAL|ACC_PRIVATE|ACC_STATIC, rewrite_arglist_getclass},
2098 {"gnu.classpath.VMStackWalker", "getCallingClass", "()Ljava/lang/Class;",
2099 "gnu.classpath.VMStackWalker", "(Lgnu/gcj/RawData;)Ljava/lang/Class;",
2100 ACC_FINAL|ACC_PRIVATE|ACC_STATIC, rewrite_arglist_getcaller},
2102 {"gnu.classpath.VMStackWalker", "getCallingClassLoader",
2103 "()Ljava/lang/ClassLoader;",
2104 "gnu.classpath.VMStackWalker", "(Lgnu/gcj/RawData;)Ljava/lang/ClassLoader;",
2105 ACC_FINAL|ACC_PRIVATE|ACC_STATIC, rewrite_arglist_getcaller},
2107 {"gnu.java.lang.VMCPStringBuilder", "toString", "([CII)Ljava/lang/String;",
2108 "java.lang.String", "([CII)Ljava/lang/String;",
2109 ACC_FINAL|ACC_PRIVATE|ACC_STATIC, NULL},
2111 {NULL, NULL, NULL, NULL, NULL, 0, NULL}};
2113 /* True if this method is special, i.e. it's a private method that
2114 should be exported from a DSO. */
2117 special_method_p (tree candidate_method)
2119 tree context = DECL_NAME (TYPE_NAME (DECL_CONTEXT (candidate_method)));
2120 tree method = DECL_NAME (candidate_method);
2123 for (p = rules; p->classname; p++)
2125 if (get_identifier (p->classname) == context
2126 && get_identifier (p->method) == method)
2132 /* Scan the rules list for replacements for *METHOD_P and replace the
2133 args accordingly. If the rewrite results in an access to a private
2134 method, update SPECIAL.*/
2137 maybe_rewrite_invocation (tree *method_p, VEC(tree,gc) **arg_list_p,
2138 tree *method_signature_p, tree *special)
2140 tree context = DECL_NAME (TYPE_NAME (DECL_CONTEXT (*method_p)));
2142 *special = NULL_TREE;
2144 for (p = rules; p->classname; p++)
2146 if (get_identifier (p->classname) == context)
2148 tree method = DECL_NAME (*method_p);
2149 if (get_identifier (p->method) == method
2150 && get_identifier (p->signature) == *method_signature_p)
2153 tree destination_class
2154 = lookup_class (get_identifier (p->new_classname));
2155 gcc_assert (destination_class);
2157 = lookup_java_method (destination_class,
2159 get_identifier (p->new_signature));
2160 if (! maybe_method && ! flag_verify_invocations)
2163 = add_method (destination_class, p->flags,
2164 method, get_identifier (p->new_signature));
2165 DECL_EXTERNAL (maybe_method) = 1;
2167 *method_p = maybe_method;
2168 gcc_assert (*method_p);
2169 if (p->rewrite_arglist)
2170 p->rewrite_arglist (arg_list_p);
2171 *method_signature_p = get_identifier (p->new_signature);
2172 *special = integer_one_node;
2183 build_known_method_ref (tree method, tree method_type ATTRIBUTE_UNUSED,
2184 tree self_type, tree method_signature ATTRIBUTE_UNUSED,
2185 VEC(tree,gc) *arg_list ATTRIBUTE_UNUSED, tree special)
2188 if (is_compiled_class (self_type))
2190 /* With indirect dispatch we have to use indirect calls for all
2191 publicly visible methods or gcc will use PLT indirections
2192 to reach them. We also have to use indirect dispatch for all
2193 external methods. */
2194 if (! flag_indirect_dispatch
2195 || (! DECL_EXTERNAL (method) && ! TREE_PUBLIC (method)))
2197 func = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (method)),
2203 = build_int_cst (NULL_TREE,
2204 (get_symbol_table_index
2206 &TYPE_ATABLE_METHODS (output_class))));
2208 = build4 (ARRAY_REF,
2209 TREE_TYPE (TREE_TYPE (TYPE_ATABLE_DECL (output_class))),
2210 TYPE_ATABLE_DECL (output_class), table_index,
2211 NULL_TREE, NULL_TREE);
2213 func = convert (method_ptr_type_node, func);
2217 /* We don't know whether the method has been (statically) compiled.
2218 Compile this code to get a reference to the method's code:
2220 SELF_TYPE->methods[METHOD_INDEX].ncode
2224 int method_index = 0;
2227 /* The method might actually be declared in some superclass, so
2228 we have to use its class context, not the caller's notion of
2229 where the method is. */
2230 self_type = DECL_CONTEXT (method);
2231 ref = build_class_ref (self_type);
2232 ref = build1 (INDIRECT_REF, class_type_node, ref);
2233 if (ncode_ident == NULL_TREE)
2234 ncode_ident = get_identifier ("ncode");
2235 if (methods_ident == NULL_TREE)
2236 methods_ident = get_identifier ("methods");
2237 ref = build3 (COMPONENT_REF, method_ptr_type_node, ref,
2238 lookup_field (&class_type_node, methods_ident),
2240 for (meth = TYPE_METHODS (self_type);
2241 ; meth = TREE_CHAIN (meth))
2245 if (meth == NULL_TREE)
2246 fatal_error ("method '%s' not found in class",
2247 IDENTIFIER_POINTER (DECL_NAME (method)));
2250 method_index *= int_size_in_bytes (method_type_node);
2251 ref = fold_build2 (POINTER_PLUS_EXPR, method_ptr_type_node,
2252 ref, size_int (method_index));
2253 ref = build1 (INDIRECT_REF, method_type_node, ref);
2254 func = build3 (COMPONENT_REF, nativecode_ptr_type_node,
2255 ref, lookup_field (&method_type_node, ncode_ident),
2262 invoke_build_dtable (int is_invoke_interface, VEC(tree,gc) *arg_list)
2264 tree dtable, objectref;
2265 tree saved = save_expr (VEC_index (tree, arg_list, 0));
2267 VEC_replace (tree, arg_list, 0, saved);
2269 /* If we're dealing with interfaces and if the objectref
2270 argument is an array then get the dispatch table of the class
2271 Object rather than the one from the objectref. */
2272 objectref = (is_invoke_interface
2273 && is_array_type_p (TREE_TYPE (saved))
2274 ? build_class_ref (object_type_node) : saved);
2276 if (dtable_ident == NULL_TREE)
2277 dtable_ident = get_identifier ("vtable");
2278 dtable = build_java_indirect_ref (object_type_node, objectref,
2279 flag_check_references);
2280 dtable = build3 (COMPONENT_REF, dtable_ptr_type, dtable,
2281 lookup_field (&object_type_node, dtable_ident), NULL_TREE);
2286 /* Determine the index in SYMBOL_TABLE for a reference to the decl
2287 T. If this decl has not been seen before, it will be added to the
2288 [oa]table_methods. If it has, the existing table slot will be
2292 get_symbol_table_index (tree t, tree special,
2293 VEC(method_entry,gc) **symbol_table)
2298 for (i = 0; VEC_iterate (method_entry, *symbol_table, i, e); i++)
2299 if (t == e->method && special == e->special)
2302 e = VEC_safe_push (method_entry, gc, *symbol_table, NULL);
2304 e->special = special;
2311 build_invokevirtual (tree dtable, tree method, tree special)
2314 tree nativecode_ptr_ptr_type_node
2315 = build_pointer_type (nativecode_ptr_type_node);
2319 if (flag_indirect_dispatch)
2321 gcc_assert (! CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))));
2324 = build_int_cst (NULL_TREE, get_symbol_table_index
2326 &TYPE_OTABLE_METHODS (output_class)));
2327 method_index = build4 (ARRAY_REF, integer_type_node,
2328 TYPE_OTABLE_DECL (output_class),
2329 otable_index, NULL_TREE, NULL_TREE);
2333 /* We fetch the DECL_VINDEX field directly here, rather than
2334 using get_method_index(). DECL_VINDEX is the true offset
2335 from the vtable base to a method, regrdless of any extra
2336 words inserted at the start of the vtable. */
2337 method_index = DECL_VINDEX (method);
2338 method_index = size_binop (MULT_EXPR, method_index,
2339 TYPE_SIZE_UNIT (nativecode_ptr_ptr_type_node));
2340 if (TARGET_VTABLE_USES_DESCRIPTORS)
2341 method_index = size_binop (MULT_EXPR, method_index,
2342 size_int (TARGET_VTABLE_USES_DESCRIPTORS));
2345 func = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (dtable), dtable,
2346 convert (sizetype, method_index));
2348 if (TARGET_VTABLE_USES_DESCRIPTORS)
2349 func = build1 (NOP_EXPR, nativecode_ptr_type_node, func);
2352 func = fold_convert (nativecode_ptr_ptr_type_node, func);
2353 func = build1 (INDIRECT_REF, nativecode_ptr_type_node, func);
2359 static GTY(()) tree class_ident;
2361 build_invokeinterface (tree dtable, tree method)
2366 /* We expand invokeinterface here. */
2368 if (class_ident == NULL_TREE)
2369 class_ident = get_identifier ("class");
2371 dtable = build_java_indirect_ref (dtable_type, dtable,
2372 flag_check_references);
2373 dtable = build3 (COMPONENT_REF, class_ptr_type, dtable,
2374 lookup_field (&dtable_type, class_ident), NULL_TREE);
2376 interface = DECL_CONTEXT (method);
2377 gcc_assert (CLASS_INTERFACE (TYPE_NAME (interface)));
2378 layout_class_methods (interface);
2380 if (flag_indirect_dispatch)
2383 = 2 * (get_symbol_table_index
2384 (method, NULL_TREE, &TYPE_ITABLE_METHODS (output_class)));
2386 = build4 (ARRAY_REF,
2387 TREE_TYPE (TREE_TYPE (TYPE_ITABLE_DECL (output_class))),
2388 TYPE_ITABLE_DECL (output_class),
2389 build_int_cst (NULL_TREE, itable_index-1),
2390 NULL_TREE, NULL_TREE);
2392 = build4 (ARRAY_REF,
2393 TREE_TYPE (TREE_TYPE (TYPE_ITABLE_DECL (output_class))),
2394 TYPE_ITABLE_DECL (output_class),
2395 build_int_cst (NULL_TREE, itable_index),
2396 NULL_TREE, NULL_TREE);
2397 interface = convert (class_ptr_type, interface);
2398 idx = convert (integer_type_node, idx);
2402 idx = build_int_cst (NULL_TREE,
2403 get_interface_method_index (method, interface));
2404 interface = build_class_ref (interface);
2407 return build_call_nary (ptr_type_node,
2408 build_address_of (soft_lookupinterfacemethod_node),
2409 3, dtable, interface, idx);
2412 /* Expand one of the invoke_* opcodes.
2413 OPCODE is the specific opcode.
2414 METHOD_REF_INDEX is an index into the constant pool.
2415 NARGS is the number of arguments, or -1 if not specified. */
2418 expand_invoke (int opcode, int method_ref_index, int nargs ATTRIBUTE_UNUSED)
2420 tree method_signature
2421 = COMPONENT_REF_SIGNATURE(¤t_jcf->cpool, method_ref_index);
2422 tree method_name = COMPONENT_REF_NAME (¤t_jcf->cpool,
2425 = get_class_constant (current_jcf,
2426 COMPONENT_REF_CLASS_INDEX(¤t_jcf->cpool,
2428 const char *const self_name
2429 = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (self_type)));
2430 tree call, func, method, method_type;
2431 VEC(tree,gc) *arg_list;
2432 tree check = NULL_TREE;
2434 tree special = NULL_TREE;
2436 if (! CLASS_LOADED_P (self_type))
2438 load_class (self_type, 1);
2439 safe_layout_class (self_type);
2440 if (TREE_CODE (TYPE_SIZE (self_type)) == ERROR_MARK)
2441 fatal_error ("failed to find class '%s'", self_name);
2443 layout_class_methods (self_type);
2445 if (ID_INIT_P (method_name))
2446 method = lookup_java_constructor (self_type, method_signature);
2448 method = lookup_java_method (self_type, method_name, method_signature);
2450 /* We've found a method in a class other than the one in which it
2451 was wanted. This can happen if, for instance, we're trying to
2452 compile invokespecial super.equals().
2453 FIXME: This is a kludge. Rather than nullifying the result, we
2454 should change lookup_java_method() so that it doesn't search the
2455 superclass chain when we're BC-compiling. */
2456 if (! flag_verify_invocations
2458 && ! TYPE_ARRAY_P (self_type)
2459 && self_type != DECL_CONTEXT (method))
2462 /* We've found a method in an interface, but this isn't an interface
2464 if (opcode != OPCODE_invokeinterface
2466 && (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method)))))
2469 /* We've found a non-interface method but we are making an
2470 interface call. This can happen if the interface overrides a
2471 method in Object. */
2472 if (! flag_verify_invocations
2473 && opcode == OPCODE_invokeinterface
2475 && ! CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
2478 if (method == NULL_TREE)
2480 if (flag_verify_invocations || ! flag_indirect_dispatch)
2482 error ("class '%s' has no method named '%s' matching signature '%s'",
2484 IDENTIFIER_POINTER (method_name),
2485 IDENTIFIER_POINTER (method_signature));
2489 int flags = ACC_PUBLIC;
2490 if (opcode == OPCODE_invokestatic)
2491 flags |= ACC_STATIC;
2492 if (opcode == OPCODE_invokeinterface)
2494 flags |= ACC_INTERFACE | ACC_ABSTRACT;
2495 CLASS_INTERFACE (TYPE_NAME (self_type)) = 1;
2497 method = add_method (self_type, flags, method_name,
2499 DECL_ARTIFICIAL (method) = 1;
2500 METHOD_DUMMY (method) = 1;
2501 layout_class_method (self_type, NULL,
2506 /* Invoke static can't invoke static/abstract method */
2507 if (method != NULL_TREE)
2509 if (opcode == OPCODE_invokestatic)
2511 if (!METHOD_STATIC (method))
2513 error ("invokestatic on non static method");
2516 else if (METHOD_ABSTRACT (method))
2518 error ("invokestatic on abstract method");
2524 if (METHOD_STATIC (method))
2526 error ("invoke[non-static] on static method");
2532 if (method == NULL_TREE)
2534 /* If we got here, we emitted an error message above. So we
2535 just pop the arguments, push a properly-typed zero, and
2537 method_type = get_type_from_signature (method_signature);
2538 pop_arguments (method_type);
2539 if (opcode != OPCODE_invokestatic)
2540 pop_type (self_type);
2541 method_type = promote_type (TREE_TYPE (method_type));
2542 push_value (convert (method_type, integer_zero_node));
2546 method_type = TREE_TYPE (method);
2547 arg_list = pop_arguments (method_type);
2548 flush_quick_stack ();
2550 maybe_rewrite_invocation (&method, &arg_list, &method_signature,
2554 if (opcode == OPCODE_invokestatic)
2555 func = build_known_method_ref (method, method_type, self_type,
2556 method_signature, arg_list, special);
2557 else if (opcode == OPCODE_invokespecial
2558 || (opcode == OPCODE_invokevirtual
2559 && (METHOD_PRIVATE (method)
2560 || METHOD_FINAL (method)
2561 || CLASS_FINAL (TYPE_NAME (self_type)))))
2563 /* If the object for the method call is null, we throw an
2564 exception. We don't do this if the object is the current
2565 method's `this'. In other cases we just rely on an
2566 optimization pass to eliminate redundant checks. FIXME:
2567 Unfortunately there doesn't seem to be a way to determine
2568 what the current method is right now.
2569 We do omit the check if we're calling <init>. */
2570 /* We use a SAVE_EXPR here to make sure we only evaluate
2571 the new `self' expression once. */
2572 tree save_arg = save_expr (VEC_index (tree, arg_list, 0));
2573 VEC_replace (tree, arg_list, 0, save_arg);
2574 check = java_check_reference (save_arg, ! DECL_INIT_P (method));
2575 func = build_known_method_ref (method, method_type, self_type,
2576 method_signature, arg_list, special);
2580 tree dtable = invoke_build_dtable (opcode == OPCODE_invokeinterface,
2582 if (opcode == OPCODE_invokevirtual)
2583 func = build_invokevirtual (dtable, method, special);
2585 func = build_invokeinterface (dtable, method);
2588 if (TREE_CODE (func) == ADDR_EXPR)
2589 TREE_TYPE (func) = build_pointer_type (method_type);
2591 func = build1 (NOP_EXPR, build_pointer_type (method_type), func);
2593 call = build_call_vec (TREE_TYPE (method_type), func, arg_list);
2594 TREE_SIDE_EFFECTS (call) = 1;
2595 call = check_for_builtin (method, call);
2597 if (check != NULL_TREE)
2599 call = build2 (COMPOUND_EXPR, TREE_TYPE (call), check, call);
2600 TREE_SIDE_EFFECTS (call) = 1;
2603 if (TREE_CODE (TREE_TYPE (method_type)) == VOID_TYPE)
2604 java_add_stmt (call);
2608 flush_quick_stack ();
2612 /* Create a stub which will be put into the vtable but which will call
2616 build_jni_stub (tree method)
2618 tree jnifunc, call, body, method_sig, arg_types;
2619 tree jniarg0, jniarg1, jniarg2, jniarg3;
2620 tree jni_func_type, tem;
2621 tree env_var, res_var = NULL_TREE, block;
2625 VEC(tree,gc) *args = NULL;
2628 tree klass = DECL_CONTEXT (method);
2629 klass = build_class_ref (klass);
2631 gcc_assert (METHOD_NATIVE (method) && flag_jni);
2633 DECL_ARTIFICIAL (method) = 1;
2634 DECL_EXTERNAL (method) = 0;
2636 env_var = build_decl (input_location,
2637 VAR_DECL, get_identifier ("env"), ptr_type_node);
2638 DECL_CONTEXT (env_var) = method;
2640 if (TREE_TYPE (TREE_TYPE (method)) != void_type_node)
2642 res_var = build_decl (input_location, VAR_DECL, get_identifier ("res"),
2643 TREE_TYPE (TREE_TYPE (method)));
2644 DECL_CONTEXT (res_var) = method;
2645 TREE_CHAIN (env_var) = res_var;
2648 method_args = DECL_ARGUMENTS (method);
2649 block = build_block (env_var, NULL_TREE, method_args, NULL_TREE);
2650 TREE_SIDE_EFFECTS (block) = 1;
2651 TREE_TYPE (block) = TREE_TYPE (TREE_TYPE (method));
2653 /* Compute the local `env' by calling _Jv_GetJNIEnvNewFrame. */
2654 body = build2 (MODIFY_EXPR, ptr_type_node, env_var,
2655 build_call_nary (ptr_type_node,
2656 build_address_of (soft_getjnienvnewframe_node),
2659 /* The JNIEnv structure is the first argument to the JNI function. */
2660 args_size += int_size_in_bytes (TREE_TYPE (env_var));
2661 VEC_safe_push (tree, gc, args, env_var);
2663 /* For a static method the second argument is the class. For a
2664 non-static method the second argument is `this'; that is already
2665 available in the argument list. */
2666 if (METHOD_STATIC (method))
2668 args_size += int_size_in_bytes (TREE_TYPE (klass));
2669 VEC_safe_push (tree, gc, args, klass);
2672 /* All the arguments to this method become arguments to the
2673 underlying JNI function. If we had to wrap object arguments in a
2674 special way, we would do that here. */
2675 for (tem = method_args; tem != NULL_TREE; tem = TREE_CHAIN (tem))
2677 int arg_bits = TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (tem)));
2678 #ifdef PARM_BOUNDARY
2679 arg_bits = (((arg_bits + PARM_BOUNDARY - 1) / PARM_BOUNDARY)
2682 args_size += (arg_bits / BITS_PER_UNIT);
2684 VEC_safe_push (tree, gc, args, tem);
2686 arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
2688 /* Argument types for static methods and the JNIEnv structure.
2689 FIXME: Write and use build_function_type_vec to avoid this. */
2690 if (METHOD_STATIC (method))
2691 arg_types = tree_cons (NULL_TREE, object_ptr_type_node, arg_types);
2692 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
2694 /* We call _Jv_LookupJNIMethod to find the actual underlying
2695 function pointer. _Jv_LookupJNIMethod will throw the appropriate
2696 exception if this function is not found at runtime. */
2697 method_sig = build_java_signature (TREE_TYPE (method));
2699 jniarg1 = build_utf8_ref (DECL_NAME (method));
2700 jniarg2 = build_utf8_ref (unmangle_classname
2701 (IDENTIFIER_POINTER (method_sig),
2702 IDENTIFIER_LENGTH (method_sig)));
2703 jniarg3 = build_int_cst (NULL_TREE, args_size);
2705 tem = build_function_type (TREE_TYPE (TREE_TYPE (method)), arg_types);
2707 #ifdef MODIFY_JNI_METHOD_CALL
2708 tem = MODIFY_JNI_METHOD_CALL (tem);
2711 jni_func_type = build_pointer_type (tem);
2713 /* Use the actual function type, rather than a generic pointer type,
2714 such that this decl keeps the actual pointer type from being
2715 garbage-collected. If it is, we end up using canonical types
2716 with different uids for equivalent function types, and this in
2717 turn causes utf8 identifiers and output order to vary. */
2718 meth_var = build_decl (input_location,
2719 VAR_DECL, get_identifier ("meth"), jni_func_type);
2720 TREE_STATIC (meth_var) = 1;
2721 TREE_PUBLIC (meth_var) = 0;
2722 DECL_EXTERNAL (meth_var) = 0;
2723 DECL_CONTEXT (meth_var) = method;
2724 DECL_ARTIFICIAL (meth_var) = 1;
2725 DECL_INITIAL (meth_var) = null_pointer_node;
2726 TREE_USED (meth_var) = 1;
2727 chainon (env_var, meth_var);
2728 build_result_decl (method);
2730 jnifunc = build3 (COND_EXPR, jni_func_type,
2731 build2 (NE_EXPR, boolean_type_node,
2732 meth_var, build_int_cst (TREE_TYPE (meth_var), 0)),
2734 build2 (MODIFY_EXPR, jni_func_type, meth_var,
2736 (NOP_EXPR, jni_func_type,
2737 build_call_nary (ptr_type_node,
2739 (soft_lookupjnimethod_node),
2742 jniarg2, jniarg3))));
2744 /* Now we make the actual JNI call via the resulting function
2746 call = build_call_vec (TREE_TYPE (TREE_TYPE (method)), jnifunc, args);
2748 /* If the JNI call returned a result, capture it here. If we had to
2749 unwrap JNI object results, we would do that here. */
2750 if (res_var != NULL_TREE)
2752 /* If the call returns an object, it may return a JNI weak
2753 reference, in which case we must unwrap it. */
2754 if (! JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_TYPE (method))))
2755 call = build_call_nary (TREE_TYPE (TREE_TYPE (method)),
2756 build_address_of (soft_unwrapjni_node),
2758 call = build2 (MODIFY_EXPR, TREE_TYPE (TREE_TYPE (method)),
2762 TREE_SIDE_EFFECTS (call) = 1;
2764 body = build2 (COMPOUND_EXPR, void_type_node, body, call);
2765 TREE_SIDE_EFFECTS (body) = 1;
2767 /* Now free the environment we allocated. */
2768 call = build_call_nary (ptr_type_node,
2769 build_address_of (soft_jnipopsystemframe_node),
2771 TREE_SIDE_EFFECTS (call) = 1;
2772 body = build2 (COMPOUND_EXPR, void_type_node, body, call);
2773 TREE_SIDE_EFFECTS (body) = 1;
2775 /* Finally, do the return. */
2776 if (res_var != NULL_TREE)
2779 gcc_assert (DECL_RESULT (method));
2780 /* Make sure we copy the result variable to the actual
2781 result. We use the type of the DECL_RESULT because it
2782 might be different from the return type of the function:
2783 it might be promoted. */
2784 drt = TREE_TYPE (DECL_RESULT (method));
2785 if (drt != TREE_TYPE (res_var))
2786 res_var = build1 (CONVERT_EXPR, drt, res_var);
2787 res_var = build2 (MODIFY_EXPR, drt, DECL_RESULT (method), res_var);
2788 TREE_SIDE_EFFECTS (res_var) = 1;
2791 body = build2 (COMPOUND_EXPR, void_type_node, body,
2792 build1 (RETURN_EXPR, void_type_node, res_var));
2793 TREE_SIDE_EFFECTS (body) = 1;
2795 /* Prepend class initialization for static methods reachable from
2797 if (METHOD_STATIC (method)
2798 && (! METHOD_PRIVATE (method)
2799 || INNER_CLASS_P (DECL_CONTEXT (method))))
2801 tree init = build_call_expr (soft_initclass_node, 1,
2803 body = build2 (COMPOUND_EXPR, void_type_node, init, body);
2804 TREE_SIDE_EFFECTS (body) = 1;
2807 bind = build3 (BIND_EXPR, void_type_node, BLOCK_VARS (block),
2813 /* Given lvalue EXP, return a volatile expression that references the
2817 java_modify_addr_for_volatile (tree exp)
2819 tree exp_type = TREE_TYPE (exp);
2821 = build_qualified_type (exp_type,
2822 TYPE_QUALS (exp_type) | TYPE_QUAL_VOLATILE);
2823 tree addr = build_fold_addr_expr (exp);
2824 v_type = build_pointer_type (v_type);
2825 addr = fold_convert (v_type, addr);
2826 exp = build_fold_indirect_ref (addr);
2831 /* Expand an operation to extract from or store into a field.
2832 IS_STATIC is 1 iff the field is static.
2833 IS_PUTTING is 1 for putting into a field; 0 for getting from the field.
2834 FIELD_REF_INDEX is an index into the constant pool. */
2837 expand_java_field_op (int is_static, int is_putting, int field_ref_index)
2840 = get_class_constant (current_jcf,
2841 COMPONENT_REF_CLASS_INDEX (¤t_jcf->cpool,
2843 const char *self_name
2844 = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (self_type)));
2845 tree field_name = COMPONENT_REF_NAME (¤t_jcf->cpool, field_ref_index);
2846 tree field_signature = COMPONENT_REF_SIGNATURE (¤t_jcf->cpool,
2848 tree field_type = get_type_from_signature (field_signature);
2849 tree new_value = is_putting ? pop_value (field_type) : NULL_TREE;
2852 tree original_self_type = self_type;
2856 if (! CLASS_LOADED_P (self_type))
2857 load_class (self_type, 1);
2858 field_decl = lookup_field (&self_type, field_name);
2859 if (field_decl == error_mark_node)
2863 else if (field_decl == NULL_TREE)
2865 if (! flag_verify_invocations)
2867 int flags = ACC_PUBLIC;
2869 flags |= ACC_STATIC;
2870 self_type = original_self_type;
2871 field_decl = add_field (original_self_type, field_name,
2873 DECL_ARTIFICIAL (field_decl) = 1;
2874 DECL_IGNORED_P (field_decl) = 1;
2876 /* FIXME: We should be pessimistic about volatility. We
2877 don't know one way or another, but this is safe.
2878 However, doing this has bad effects on code quality. We
2879 need to look at better ways to do this. */
2880 TREE_THIS_VOLATILE (field_decl) = 1;
2885 error ("missing field '%s' in '%s'",
2886 IDENTIFIER_POINTER (field_name), self_name);
2890 else if (build_java_signature (TREE_TYPE (field_decl)) != field_signature)
2892 error ("mismatching signature for field '%s' in '%s'",
2893 IDENTIFIER_POINTER (field_name), self_name);
2896 field_ref = is_static ? NULL_TREE : pop_value (self_type);
2900 push_value (convert (field_type, integer_zero_node));
2901 flush_quick_stack ();
2905 field_ref = build_field_ref (field_ref, self_type, field_name);
2907 && ! flag_indirect_dispatch)
2909 tree context = DECL_CONTEXT (field_ref);
2910 if (context != self_type && CLASS_INTERFACE (TYPE_NAME (context)))
2911 field_ref = build_class_init (context, field_ref);
2913 field_ref = build_class_init (self_type, field_ref);
2917 flush_quick_stack ();
2918 if (FIELD_FINAL (field_decl))
2920 if (DECL_CONTEXT (field_decl) != current_class)
2921 error ("assignment to final field %q+D not in field's class",
2923 /* We used to check for assignments to final fields not
2924 occurring in the class initializer or in a constructor
2925 here. However, this constraint doesn't seem to be
2926 enforced by the JVM. */
2929 if (TREE_THIS_VOLATILE (field_decl))
2930 field_ref = java_modify_addr_for_volatile (field_ref);
2932 modify_expr = build2 (MODIFY_EXPR, TREE_TYPE (field_ref),
2933 field_ref, new_value);
2935 if (TREE_THIS_VOLATILE (field_decl))
2937 (build_call_expr (built_in_decls[BUILT_IN_SYNCHRONIZE], 0));
2939 java_add_stmt (modify_expr);
2943 tree temp = build_decl (input_location,
2944 VAR_DECL, NULL_TREE, TREE_TYPE (field_ref));
2945 java_add_local_var (temp);
2947 if (TREE_THIS_VOLATILE (field_decl))
2948 field_ref = java_modify_addr_for_volatile (field_ref);
2951 = build2 (MODIFY_EXPR, TREE_TYPE (field_ref), temp, field_ref);
2952 java_add_stmt (modify_expr);
2954 if (TREE_THIS_VOLATILE (field_decl))
2956 (build_call_expr (built_in_decls[BUILT_IN_SYNCHRONIZE], 0));
2960 TREE_THIS_VOLATILE (field_ref) = TREE_THIS_VOLATILE (field_decl);
2964 load_type_state (int pc)
2967 tree vec = VEC_index (tree, type_states, pc);
2968 int cur_length = TREE_VEC_LENGTH (vec);
2969 stack_pointer = cur_length - DECL_MAX_LOCALS(current_function_decl);
2970 for (i = 0; i < cur_length; i++)
2971 type_map [i] = TREE_VEC_ELT (vec, i);
2974 /* Go over METHOD's bytecode and note instruction starts in
2975 instruction_bits[]. */
2978 note_instructions (JCF *jcf, tree method)
2981 unsigned char* byte_ops;
2982 long length = DECL_CODE_LENGTH (method);
2987 #undef RET /* Defined by config/i386/i386.h */
2989 #define BCODE byte_ops
2990 #define BYTE_type_node byte_type_node
2991 #define SHORT_type_node short_type_node
2992 #define INT_type_node int_type_node
2993 #define LONG_type_node long_type_node
2994 #define CHAR_type_node char_type_node
2995 #define PTR_type_node ptr_type_node
2996 #define FLOAT_type_node float_type_node
2997 #define DOUBLE_type_node double_type_node
2998 #define VOID_type_node void_type_node
2999 #define CONST_INDEX_1 (saw_index = 1, IMMEDIATE_u1)
3000 #define CONST_INDEX_2 (saw_index = 1, IMMEDIATE_u2)
3001 #define VAR_INDEX_1 (saw_index = 1, IMMEDIATE_u1)
3002 #define VAR_INDEX_2 (saw_index = 1, IMMEDIATE_u2)
3004 #define CHECK_PC_IN_RANGE(PC) ((void)1) /* Already handled by verifier. */
3006 JCF_SEEK (jcf, DECL_CODE_OFFSET (method));
3007 byte_ops = jcf->read_ptr;
3008 instruction_bits = XRESIZEVAR (char, instruction_bits, length + 1);
3009 memset (instruction_bits, 0, length + 1);
3010 type_states = VEC_alloc (tree, gc, length + 1);
3011 VEC_safe_grow_cleared (tree, gc, type_states, length + 1);
3013 /* This pass figures out which PC can be the targets of jumps. */
3014 for (PC = 0; PC < length;)
3016 int oldpc = PC; /* PC at instruction start. */
3017 instruction_bits [PC] |= BCODE_INSTRUCTION_START;
3018 switch (byte_ops[PC++])
3020 #define JAVAOP(OPNAME, OPCODE, OPKIND, OPERAND_TYPE, OPERAND_VALUE) \
3022 PRE_##OPKIND(OPERAND_TYPE, OPERAND_VALUE); \
3025 #define NOTE_LABEL(PC) note_label(oldpc, PC)
3027 #define PRE_PUSHC(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
3028 #define PRE_LOAD(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
3029 #define PRE_STORE(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE);
3030 #define PRE_STACK(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3031 #define PRE_UNOP(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3032 #define PRE_BINOP(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3033 #define PRE_CONVERT(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3034 #define PRE_CONVERT2(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3036 #define PRE_SPECIAL(OPERAND_TYPE, INSTRUCTION) \
3037 PRE_SPECIAL_##INSTRUCTION(OPERAND_TYPE)
3038 #define PRE_SPECIAL_IINC(OPERAND_TYPE) \
3039 ((void) IMMEDIATE_u1, (void) IMMEDIATE_s1)
3040 #define PRE_SPECIAL_ENTER(IGNORE) /* nothing */
3041 #define PRE_SPECIAL_EXIT(IGNORE) /* nothing */
3042 #define PRE_SPECIAL_THROW(IGNORE) /* nothing */
3043 #define PRE_SPECIAL_BREAK(IGNORE) /* nothing */
3045 /* two forms of wide instructions */
3046 #define PRE_SPECIAL_WIDE(IGNORE) \
3048 int modified_opcode = IMMEDIATE_u1; \
3049 if (modified_opcode == OPCODE_iinc) \
3051 (void) IMMEDIATE_u2; /* indexbyte1 and indexbyte2 */ \
3052 (void) IMMEDIATE_s2; /* constbyte1 and constbyte2 */ \
3056 (void) IMMEDIATE_u2; /* indexbyte1 and indexbyte2 */ \
3060 #define PRE_IMPL(IGNORE1, IGNORE2) /* nothing */
3062 #define PRE_MONITOR(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3064 #define PRE_RETURN(OPERAND_TYPE, OPERAND_VALUE) /* nothing */
3065 #define PRE_ARRAY(OPERAND_TYPE, SUBOP) \
3066 PRE_ARRAY_##SUBOP(OPERAND_TYPE)
3067 #define PRE_ARRAY_LOAD(TYPE) /* nothing */
3068 #define PRE_ARRAY_STORE(TYPE) /* nothing */
3069 #define PRE_ARRAY_LENGTH(TYPE) /* nothing */
3070 #define PRE_ARRAY_NEW(TYPE) PRE_ARRAY_NEW_##TYPE
3071 #define PRE_ARRAY_NEW_NUM ((void) IMMEDIATE_u1)
3072 #define PRE_ARRAY_NEW_PTR ((void) IMMEDIATE_u2)
3073 #define PRE_ARRAY_NEW_MULTI ((void) IMMEDIATE_u2, (void) IMMEDIATE_u1)
3075 #define PRE_TEST(OPERAND_TYPE, OPERAND_VALUE) NOTE_LABEL (oldpc+IMMEDIATE_s2)
3076 #define PRE_COND(OPERAND_TYPE, OPERAND_VALUE) NOTE_LABEL (oldpc+IMMEDIATE_s2)
3077 #define PRE_BRANCH(OPERAND_TYPE, OPERAND_VALUE) \
3078 saw_index = 0; INT_temp = (OPERAND_VALUE); \
3079 if (!saw_index) NOTE_LABEL(oldpc + INT_temp);
3080 #define PRE_JSR(OPERAND_TYPE, OPERAND_VALUE) \
3081 saw_index = 0; INT_temp = (OPERAND_VALUE); \
3083 if (!saw_index) NOTE_LABEL(oldpc + INT_temp);
3085 #define PRE_RET(OPERAND_TYPE, OPERAND_VALUE) (void)(OPERAND_VALUE)
3087 #define PRE_SWITCH(OPERAND_TYPE, TABLE_OR_LOOKUP) \
3088 PC = (PC + 3) / 4 * 4; PRE_##TABLE_OR_LOOKUP##_SWITCH
3090 #define PRE_LOOKUP_SWITCH \
3091 { jint default_offset = IMMEDIATE_s4; jint npairs = IMMEDIATE_s4; \
3092 NOTE_LABEL (default_offset+oldpc); \
3094 while (--npairs >= 0) { \
3095 jint match ATTRIBUTE_UNUSED = IMMEDIATE_s4; \
3096 jint offset = IMMEDIATE_s4; \
3097 NOTE_LABEL (offset+oldpc); } \
3100 #define PRE_TABLE_SWITCH \
3101 { jint default_offset = IMMEDIATE_s4; \
3102 jint low = IMMEDIATE_s4; jint high = IMMEDIATE_s4; \
3103 NOTE_LABEL (default_offset+oldpc); \
3105 while (low++ <= high) { \
3106 jint offset = IMMEDIATE_s4; \
3107 NOTE_LABEL (offset+oldpc); } \
3110 #define PRE_FIELD(MAYBE_STATIC, PUT_OR_GET) (void)(IMMEDIATE_u2);
3111 #define PRE_OBJECT(MAYBE_STATIC, PUT_OR_GET) (void)(IMMEDIATE_u2);
3112 #define PRE_INVOKE(MAYBE_STATIC, IS_INTERFACE) \
3113 (void)(IMMEDIATE_u2); \
3114 PC += 2 * IS_INTERFACE /* for invokeinterface */;
3116 #include "javaop.def"
3123 expand_byte_code (JCF *jcf, tree method)
3127 const unsigned char *linenumber_pointer;
3128 int dead_code_index = -1;
3129 unsigned char* byte_ops;
3130 long length = DECL_CODE_LENGTH (method);
3131 location_t max_location = input_location;
3134 JCF_SEEK (jcf, DECL_CODE_OFFSET (method));
3135 byte_ops = jcf->read_ptr;
3137 /* We make an initial pass of the line number table, to note
3138 which instructions have associated line number entries. */
3139 linenumber_pointer = linenumber_table;
3140 for (i = 0; i < linenumber_count; i++)
3142 int pc = GET_u2 (linenumber_pointer);
3143 linenumber_pointer += 4;
3145 warning (0, "invalid PC in line number table");
3148 if ((instruction_bits[pc] & BCODE_HAS_LINENUMBER) != 0)
3149 instruction_bits[pc] |= BCODE_HAS_MULTI_LINENUMBERS;
3150 instruction_bits[pc] |= BCODE_HAS_LINENUMBER;
3154 if (! verify_jvm_instructions_new (jcf, byte_ops, length))
3157 promote_arguments ();
3158 cache_this_class_ref (method);
3159 cache_cpool_data_ref ();
3161 /* Translate bytecodes. */
3162 linenumber_pointer = linenumber_table;
3163 for (PC = 0; PC < length;)
3165 if ((instruction_bits [PC] & BCODE_TARGET) != 0 || PC == 0)
3167 tree label = lookup_label (PC);
3168 flush_quick_stack ();
3169 if ((instruction_bits [PC] & BCODE_TARGET) != 0)
3170 java_add_stmt (build1 (LABEL_EXPR, void_type_node, label));
3171 if ((instruction_bits[PC] & BCODE_VERIFIED) != 0)
3172 load_type_state (PC);
3175 if (! (instruction_bits [PC] & BCODE_VERIFIED))
3177 if (dead_code_index == -1)
3179 /* This is the start of a region of unreachable bytecodes.
3180 They still need to be processed in order for EH ranges
3181 to get handled correctly. However, we can simply
3182 replace these bytecodes with nops. */
3183 dead_code_index = PC;
3186 /* Turn this bytecode into a nop. */
3191 if (dead_code_index != -1)
3193 /* We've just reached the end of a region of dead code. */
3195 warning (0, "unreachable bytecode from %d to before %d",
3196 dead_code_index, PC);
3197 dead_code_index = -1;
3201 /* Handle possible line number entry for this PC.
3203 This code handles out-of-order and multiple linenumbers per PC,
3204 but is optimized for the case of line numbers increasing
3205 monotonically with PC. */
3206 if ((instruction_bits[PC] & BCODE_HAS_LINENUMBER) != 0)
3208 if ((instruction_bits[PC] & BCODE_HAS_MULTI_LINENUMBERS) != 0
3209 || GET_u2 (linenumber_pointer) != PC)
3210 linenumber_pointer = linenumber_table;
3211 while (linenumber_pointer < linenumber_table + linenumber_count * 4)
3213 int pc = GET_u2 (linenumber_pointer);
3214 linenumber_pointer += 4;
3217 int line = GET_u2 (linenumber_pointer - 2);
3218 input_location = linemap_line_start (line_table, line, 1);
3219 if (input_location > max_location)
3220 max_location = input_location;
3221 if (!(instruction_bits[PC] & BCODE_HAS_MULTI_LINENUMBERS))
3226 maybe_pushlevels (PC);
3227 PC = process_jvm_instruction (PC, byte_ops, length);
3228 maybe_poplevels (PC);
3231 uncache_this_class_ref (method);
3233 if (dead_code_index != -1)
3235 /* We've just reached the end of a region of dead code. */
3237 warning (0, "unreachable bytecode from %d to the end of the method",
3241 DECL_FUNCTION_LAST_LINE (method) = max_location;
3245 java_push_constant_from_pool (JCF *jcf, int index)
3248 if (JPOOL_TAG (jcf, index) == CONSTANT_String)
3251 name = get_name_constant (jcf, JPOOL_USHORT1 (jcf, index));
3252 index = alloc_name_constant (CONSTANT_String, name);
3253 c = build_ref_from_constant_pool (index);
3254 c = convert (promote_type (string_type_node), c);
3256 else if (JPOOL_TAG (jcf, index) == CONSTANT_Class
3257 || JPOOL_TAG (jcf, index) == CONSTANT_ResolvedClass)
3259 tree record = get_class_constant (jcf, index);
3260 c = build_class_ref (record);
3263 c = get_constant (jcf, index);
3268 process_jvm_instruction (int PC, const unsigned char* byte_ops,
3269 long length ATTRIBUTE_UNUSED)
3271 const char *opname; /* Temporary ??? */
3272 int oldpc = PC; /* PC at instruction start. */
3274 /* If the instruction is at the beginning of an exception handler,
3275 replace the top of the stack with the thrown object reference. */
3276 if (instruction_bits [PC] & BCODE_EXCEPTION_TARGET)
3278 /* Note that the verifier will not emit a type map at all for
3279 dead exception handlers. In this case we just ignore the
3281 if ((instruction_bits[PC] & BCODE_VERIFIED) != 0)
3283 tree type = pop_type (promote_type (throwable_type_node));
3284 push_value (build_exception_object_ref (type));
3288 switch (byte_ops[PC++])
3290 #define JAVAOP(OPNAME, OPCODE, OPKIND, OPERAND_TYPE, OPERAND_VALUE) \
3293 OPKIND(OPERAND_TYPE, OPERAND_VALUE); \
3296 #define RET(OPERAND_TYPE, OPERAND_VALUE) \
3298 int saw_index = 0; \
3299 int index = OPERAND_VALUE; \
3300 (void) saw_index; /* Avoid set but not used warning. */ \
3302 (find_local_variable (index, return_address_type_node, oldpc)); \
3305 #define JSR(OPERAND_TYPE, OPERAND_VALUE) \
3307 /* OPERAND_VALUE may have side-effects on PC */ \
3308 int opvalue = OPERAND_VALUE; \
3309 build_java_jsr (oldpc + opvalue, PC); \
3312 /* Push a constant onto the stack. */
3313 #define PUSHC(OPERAND_TYPE, OPERAND_VALUE) \
3314 { int saw_index = 0; int ival = (OPERAND_VALUE); \
3315 if (saw_index) java_push_constant_from_pool (current_jcf, ival); \
3316 else expand_java_pushc (ival, OPERAND_TYPE##_type_node); }
3318 /* internal macro added for use by the WIDE case */
3319 #define LOAD_INTERNAL(OPTYPE, OPVALUE) \
3320 expand_load_internal (OPVALUE, type_map[OPVALUE], oldpc);
3322 /* Push local variable onto the opcode stack. */
3323 #define LOAD(OPERAND_TYPE, OPERAND_VALUE) \
3325 /* have to do this since OPERAND_VALUE may have side-effects */ \
3326 int opvalue = OPERAND_VALUE; \
3327 LOAD_INTERNAL(OPERAND_TYPE##_type_node, opvalue); \
3330 #define RETURN(OPERAND_TYPE, OPERAND_VALUE) \
3331 expand_java_return (OPERAND_TYPE##_type_node)
3333 #define REM_EXPR TRUNC_MOD_EXPR
3334 #define BINOP(OPERAND_TYPE, OPERAND_VALUE) \
3335 expand_java_binop (OPERAND_TYPE##_type_node, OPERAND_VALUE##_EXPR)
3337 #define FIELD(IS_STATIC, IS_PUT) \
3338 expand_java_field_op (IS_STATIC, IS_PUT, IMMEDIATE_u2)
3340 #define TEST(OPERAND_TYPE, CONDITION) \
3341 expand_test (CONDITION##_EXPR, OPERAND_TYPE##_type_node, oldpc+IMMEDIATE_s2)
3343 #define COND(OPERAND_TYPE, CONDITION) \
3344 expand_cond (CONDITION##_EXPR, OPERAND_TYPE##_type_node, oldpc+IMMEDIATE_s2)
3346 #define BRANCH(OPERAND_TYPE, OPERAND_VALUE) \
3347 BRANCH_##OPERAND_TYPE (OPERAND_VALUE)
3349 #define BRANCH_GOTO(OPERAND_VALUE) \
3350 expand_java_goto (oldpc + OPERAND_VALUE)
3352 #define BRANCH_CALL(OPERAND_VALUE) \
3353 expand_java_call (oldpc + OPERAND_VALUE, oldpc)
3356 #define BRANCH_RETURN(OPERAND_VALUE) \
3358 tree type = OPERAND_TYPE##_type_node; \
3359 tree value = find_local_variable (OPERAND_VALUE, type, oldpc); \
3360 expand_java_ret (value); \
3364 #define NOT_IMPL(OPERAND_TYPE, OPERAND_VALUE) \
3365 fprintf (stderr, "%3d: %s ", oldpc, opname); \
3366 fprintf (stderr, "(not implemented)\n")
3367 #define NOT_IMPL1(OPERAND_VALUE) \
3368 fprintf (stderr, "%3d: %s ", oldpc, opname); \
3369 fprintf (stderr, "(not implemented)\n")
3371 #define BRANCH_RETURN(OPERAND_VALUE) NOT_IMPL1(OPERAND_VALUE)
3373 #define STACK(SUBOP, COUNT) STACK_##SUBOP (COUNT)
3375 #define STACK_POP(COUNT) java_stack_pop (COUNT)
3377 #define STACK_SWAP(COUNT) java_stack_swap()
3379 #define STACK_DUP(COUNT) java_stack_dup (COUNT, 0)
3380 #define STACK_DUPx1(COUNT) java_stack_dup (COUNT, 1)
3381 #define STACK_DUPx2(COUNT) java_stack_dup (COUNT, 2)
3383 #define SWITCH(OPERAND_TYPE, TABLE_OR_LOOKUP) \
3384 PC = (PC + 3) / 4 * 4; TABLE_OR_LOOKUP##_SWITCH
3386 #define LOOKUP_SWITCH \
3387 { jint default_offset = IMMEDIATE_s4; jint npairs = IMMEDIATE_s4; \
3388 tree selector = pop_value (INT_type_node); \
3389 tree switch_expr = expand_java_switch (selector, oldpc + default_offset); \
3390 while (--npairs >= 0) \
3392 jint match = IMMEDIATE_s4; jint offset = IMMEDIATE_s4; \
3393 expand_java_add_case (switch_expr, match, oldpc + offset); \
3397 #define TABLE_SWITCH \
3398 { jint default_offset = IMMEDIATE_s4; \
3399 jint low = IMMEDIATE_s4; jint high = IMMEDIATE_s4; \
3400 tree selector = pop_value (INT_type_node); \
3401 tree switch_expr = expand_java_switch (selector, oldpc + default_offset); \
3402 for (; low <= high; low++) \
3404 jint offset = IMMEDIATE_s4; \
3405 expand_java_add_case (switch_expr, low, oldpc + offset); \
3409 #define INVOKE(MAYBE_STATIC, IS_INTERFACE) \
3410 { int opcode = byte_ops[PC-1]; \
3411 int method_ref_index = IMMEDIATE_u2; \
3413 if (IS_INTERFACE) { nargs = IMMEDIATE_u1; (void) IMMEDIATE_u1; } \
3415 expand_invoke (opcode, method_ref_index, nargs); \
3418 /* Handle new, checkcast, instanceof */
3419 #define OBJECT(TYPE, OP) \
3420 expand_java_##OP (get_class_constant (current_jcf, IMMEDIATE_u2))
3422 #define ARRAY(OPERAND_TYPE, SUBOP) ARRAY_##SUBOP(OPERAND_TYPE)
3424 #define ARRAY_LOAD(OPERAND_TYPE) \
3426 expand_java_arrayload( OPERAND_TYPE##_type_node ); \
3429 #define ARRAY_STORE(OPERAND_TYPE) \
3431 expand_java_arraystore( OPERAND_TYPE##_type_node ); \
3434 #define ARRAY_LENGTH(OPERAND_TYPE) expand_java_array_length();
3435 #define ARRAY_NEW(OPERAND_TYPE) ARRAY_NEW_##OPERAND_TYPE()
3436 #define ARRAY_NEW_PTR() \
3437 push_value (build_anewarray (get_class_constant (current_jcf, \
3439 pop_value (int_type_node)));
3440 #define ARRAY_NEW_NUM() \
3442 int atype = IMMEDIATE_u1; \
3443 push_value (build_newarray (atype, pop_value (int_type_node)));\
3445 #define ARRAY_NEW_MULTI() \
3447 tree klass = get_class_constant (current_jcf, IMMEDIATE_u2 ); \
3448 int ndims = IMMEDIATE_u1; \
3449 expand_java_multianewarray( klass, ndims ); \
3452 #define UNOP(OPERAND_TYPE, OPERAND_VALUE) \
3453 push_value (fold_build1 (NEGATE_EXPR, OPERAND_TYPE##_type_node, \
3454 pop_value (OPERAND_TYPE##_type_node)));
3456 #define CONVERT2(FROM_TYPE, TO_TYPE) \
3458 push_value (build1 (NOP_EXPR, int_type_node, \
3459 (convert (TO_TYPE##_type_node, \
3460 pop_value (FROM_TYPE##_type_node))))); \
3463 #define CONVERT(FROM_TYPE, TO_TYPE) \
3465 push_value (convert (TO_TYPE##_type_node, \
3466 pop_value (FROM_TYPE##_type_node))); \
3469 /* internal macro added for use by the WIDE case
3470 Added TREE_TYPE (decl) assignment, apbianco */
3471 #define STORE_INTERNAL(OPTYPE, OPVALUE) \
3474 int index = OPVALUE; \
3475 tree type = OPTYPE; \
3476 value = pop_value (type); \
3477 type = TREE_TYPE (value); \
3478 decl = find_local_variable (index, type, oldpc); \
3479 set_local_type (index, type); \
3480 java_add_stmt (build2 (MODIFY_EXPR, type, decl, value)); \
3483 #define STORE(OPERAND_TYPE, OPERAND_VALUE) \
3485 /* have to do this since OPERAND_VALUE may have side-effects */ \
3486 int opvalue = OPERAND_VALUE; \
3487 STORE_INTERNAL(OPERAND_TYPE##_type_node, opvalue); \
3490 #define SPECIAL(OPERAND_TYPE, INSTRUCTION) \
3491 SPECIAL_##INSTRUCTION(OPERAND_TYPE)
3493 #define SPECIAL_ENTER(IGNORED) MONITOR_OPERATION (soft_monitorenter_node)
3494 #define SPECIAL_EXIT(IGNORED) MONITOR_OPERATION (soft_monitorexit_node)
3496 #define MONITOR_OPERATION(call) \
3498 tree o = pop_value (ptr_type_node); \
3500 flush_quick_stack (); \
3501 c = build_java_monitor (call, o); \
3502 TREE_SIDE_EFFECTS (c) = 1; \
3503 java_add_stmt (c); \
3506 #define SPECIAL_IINC(IGNORED) \
3508 unsigned int local_var_index = IMMEDIATE_u1; \
3509 int ival = IMMEDIATE_s1; \
3510 expand_iinc(local_var_index, ival, oldpc); \
3513 #define SPECIAL_WIDE(IGNORED) \
3515 int modified_opcode = IMMEDIATE_u1; \
3516 unsigned int local_var_index = IMMEDIATE_u2; \
3517 switch (modified_opcode) \
3521 int ival = IMMEDIATE_s2; \
3522 expand_iinc (local_var_index, ival, oldpc); \
3525 case OPCODE_iload: \
3526 case OPCODE_lload: \
3527 case OPCODE_fload: \
3528 case OPCODE_dload: \
3529 case OPCODE_aload: \
3531 /* duplicate code from LOAD macro */ \
3532 LOAD_INTERNAL(operand_type[modified_opcode], local_var_index); \
3535 case OPCODE_istore: \
3536 case OPCODE_lstore: \
3537 case OPCODE_fstore: \
3538 case OPCODE_dstore: \
3539 case OPCODE_astore: \
3541 STORE_INTERNAL(operand_type[modified_opcode], local_var_index); \
3545 error ("unrecogized wide sub-instruction"); \
3549 #define SPECIAL_THROW(IGNORED) \
3550 build_java_athrow (pop_value (throwable_type_node))
3552 #define SPECIAL_BREAK NOT_IMPL1
3553 #define IMPL NOT_IMPL
3555 #include "javaop.def"
3558 fprintf (stderr, "%3d: unknown(%3d)\n", oldpc, byte_ops[PC]);
3563 /* Return the opcode at PC in the code section pointed to by
3566 static unsigned char
3567 peek_opcode_at_pc (JCF *jcf, int code_offset, int pc)
3569 unsigned char opcode;
3570 long absolute_offset = (long)JCF_TELL (jcf);
3572 JCF_SEEK (jcf, code_offset);
3573 opcode = jcf->read_ptr [pc];
3574 JCF_SEEK (jcf, absolute_offset);
3578 /* Some bytecode compilers are emitting accurate LocalVariableTable
3579 attributes. Here's an example:
3584 Attribute "LocalVariableTable"
3585 slot #<n>: ... (PC: PC+1 length: L)
3587 This is accurate because the local in slot <n> really exists after
3588 the opcode at PC is executed, hence from PC+1 to PC+1+L.
3590 This procedure recognizes this situation and extends the live range
3591 of the local in SLOT to START_PC-1 or START_PC-2 (depending on the
3592 length of the store instruction.)
3594 This function is used by `give_name_to_locals' so that a local's
3595 DECL features a DECL_LOCAL_START_PC such that the first related
3596 store operation will use DECL as a destination, not an unrelated
3597 temporary created for the occasion.
3599 This function uses a global (instruction_bits) `note_instructions' should
3600 have allocated and filled properly. */
3603 maybe_adjust_start_pc (struct JCF *jcf, int code_offset,
3604 int start_pc, int slot)
3606 int first, index, opcode;
3615 /* Find last previous instruction and remember it */
3616 for (pc = start_pc-1; pc; pc--)
3617 if (instruction_bits [pc] & BCODE_INSTRUCTION_START)
3621 /* Retrieve the instruction, handle `wide'. */
3622 opcode = (int) peek_opcode_at_pc (jcf, code_offset, pc++);
3623 if (opcode == OPCODE_wide)
3626 opcode = (int) peek_opcode_at_pc (jcf, code_offset, pc++);
3631 case OPCODE_astore_0:
3632 case OPCODE_astore_1:
3633 case OPCODE_astore_2:
3634 case OPCODE_astore_3:
3635 first = OPCODE_astore_0;
3638 case OPCODE_istore_0:
3639 case OPCODE_istore_1:
3640 case OPCODE_istore_2:
3641 case OPCODE_istore_3:
3642 first = OPCODE_istore_0;
3645 case OPCODE_lstore_0:
3646 case OPCODE_lstore_1:
3647 case OPCODE_lstore_2:
3648 case OPCODE_lstore_3:
3649 first = OPCODE_lstore_0;
3652 case OPCODE_fstore_0:
3653 case OPCODE_fstore_1:
3654 case OPCODE_fstore_2:
3655 case OPCODE_fstore_3:
3656 first = OPCODE_fstore_0;
3659 case OPCODE_dstore_0:
3660 case OPCODE_dstore_1:
3661 case OPCODE_dstore_2:
3662 case OPCODE_dstore_3:
3663 first = OPCODE_dstore_0;
3671 index = peek_opcode_at_pc (jcf, code_offset, pc);
3674 int other = peek_opcode_at_pc (jcf, code_offset, ++pc);
3675 index = (other << 8) + index;
3680 /* Now we decide: first >0 means we have a <t>store_<n>, index >0
3681 means we have a <t>store. */
3682 if ((first > 0 && opcode - first == slot) || (index > 0 && index == slot))
3688 /* Force the (direct) sub-operands of NODE to be evaluated in left-to-right
3689 order, as specified by Java Language Specification.
3691 The problem is that while expand_expr will evaluate its sub-operands in
3692 left-to-right order, for variables it will just return an rtx (i.e.
3693 an lvalue) for the variable (rather than an rvalue). So it is possible
3694 that a later sub-operand will change the register, and when the
3695 actual operation is done, it will use the new value, when it should
3696 have used the original value.
3698 We fix this by using save_expr. This forces the sub-operand to be
3699 copied into a fresh virtual register,
3701 For method invocation, we modify the arguments so that a
3702 left-to-right order evaluation is performed. Saved expressions
3703 will, in CALL_EXPR order, be reused when the call will be expanded.
3705 We also promote outgoing args if needed. */
3708 force_evaluation_order (tree node)
3710 if (flag_syntax_only)
3712 if (TREE_CODE (node) == CALL_EXPR
3713 || (TREE_CODE (node) == COMPOUND_EXPR
3714 && TREE_CODE (TREE_OPERAND (node, 0)) == CALL_EXPR
3715 && TREE_CODE (TREE_OPERAND (node, 1)) == SAVE_EXPR))
3720 /* Account for wrapped around ctors. */
3721 if (TREE_CODE (node) == COMPOUND_EXPR)
3722 call = TREE_OPERAND (node, 0);
3726 nargs = call_expr_nargs (call);
3728 /* This reverses the evaluation order. This is a desired effect. */
3729 for (i = 0, cmp = NULL_TREE; i < nargs; i++)
3731 tree arg = CALL_EXPR_ARG (call, i);
3732 /* Promote types smaller than integer. This is required by
3734 tree type = TREE_TYPE (arg);
3736 if (targetm.calls.promote_prototypes (type)
3737 && INTEGRAL_TYPE_P (type)
3738 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type),
3739 TYPE_SIZE (integer_type_node)))
3740 arg = fold_convert (integer_type_node, arg);
3742 saved = save_expr (force_evaluation_order (arg));
3743 cmp = (cmp == NULL_TREE ? saved :
3744 build2 (COMPOUND_EXPR, void_type_node, cmp, saved));
3746 CALL_EXPR_ARG (call, i) = saved;
3749 if (cmp && TREE_CODE (cmp) == COMPOUND_EXPR)
3750 TREE_SIDE_EFFECTS (cmp) = 1;
3754 cmp = build2 (COMPOUND_EXPR, TREE_TYPE (node), cmp, node);
3755 if (TREE_TYPE (cmp) != void_type_node)
3756 cmp = save_expr (cmp);
3757 TREE_SIDE_EFFECTS (cmp) = 1;
3764 /* Build a node to represent empty statements and blocks. */
3767 build_java_empty_stmt (void)
3769 tree t = build_empty_stmt (input_location);
3773 /* Promote all args of integral type before generating any code. */
3776 promote_arguments (void)
3780 for (arg = DECL_ARGUMENTS (current_function_decl), i = 0;
3781 arg != NULL_TREE; arg = TREE_CHAIN (arg), i++)
3783 tree arg_type = TREE_TYPE (arg);
3784 if (INTEGRAL_TYPE_P (arg_type)
3785 && TYPE_PRECISION (arg_type) < 32)
3787 tree copy = find_local_variable (i, integer_type_node, -1);
3788 java_add_stmt (build2 (MODIFY_EXPR, integer_type_node,
3790 fold_convert (integer_type_node, arg)));
3792 if (TYPE_IS_WIDE (arg_type))
3797 /* Create a local variable that points to the constant pool. */
3800 cache_cpool_data_ref (void)
3805 tree d = build_constant_data_ref (flag_indirect_classes);
3806 tree cpool_ptr = build_decl (input_location, VAR_DECL, NULL_TREE,
3807 build_pointer_type (TREE_TYPE (d)));
3808 java_add_local_var (cpool_ptr);
3809 TREE_CONSTANT (cpool_ptr) = 1;
3811 java_add_stmt (build2 (MODIFY_EXPR, TREE_TYPE (cpool_ptr),
3812 cpool_ptr, build_address_of (d)));
3813 cpool = build1 (INDIRECT_REF, TREE_TYPE (d), cpool_ptr);
3814 TREE_THIS_NOTRAP (cpool) = 1;
3815 TYPE_CPOOL_DATA_REF (output_class) = cpool;
3819 #include "gt-java-expr.h"