1 /* src/vm/jit/stack.c - stack analysis
3 Copyright (C) 1996-2005, 2006, 2007 R. Grafl, A. Krall, C. Kruegel,
4 C. Oates, R. Obermaisser, M. Platter, M. Probst, S. Ring,
5 E. Steiner, C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich,
6 J. Wenninger, Institut f. Computersprachen - TU Wien
8 This file is part of CACAO.
10 This program is free software; you can redistribute it and/or
11 modify it under the terms of the GNU General Public License as
12 published by the Free Software Foundation; either version 2, or (at
13 your option) any later version.
15 This program is distributed in the hope that it will be useful, but
16 WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software
22 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
38 #include "mm/memory.h"
40 #include "native/native.h"
42 #include "toolbox/logging.h"
44 #include "vm/global.h"
45 #include "vm/builtin.h"
46 #include "vm/stringlocal.h"
49 #include "vm/jit/abi.h"
50 #include "vm/jit/cfg.h"
51 #include "vm/jit/codegen-common.h"
52 #include "vm/jit/parse.h"
53 #include "vm/jit/show.h"
55 #if defined(ENABLE_DISASSEMBLER)
56 # include "vm/jit/disass.h"
59 #include "vm/jit/jit.h"
60 #include "vm/jit/stack.h"
63 #if defined(ENABLE_SSA)
64 # include "vm/jit/optimizing/lsra.h"
65 # include "vm/jit/optimizing/ssa.h"
66 #elif defined(ENABLE_LSRA)
67 # include "vm/jit/allocator/lsra.h"
71 #include "vmcore/options.h"
72 #include "vm/resolve.h"
74 #if defined(ENABLE_STATISTICS)
75 # include "vmcore/statistics.h"
78 /*#define STACK_VERBOSE*/
81 /* macro for saving #ifdefs ***************************************************/
83 #if defined(ENABLE_STATISTICS)
84 #define STATISTICS_STACKDEPTH_DISTRIBUTION(distr) \
87 if (stackdepth >= 10) \
88 count_store_depth[10]++; \
90 count_store_depth[stackdepth]++; \
93 #else /* !defined(ENABLE_STATISTICS) */
94 #define STATISTICS_STACKDEPTH_DISTRIBUTION(distr)
98 #define MIN(a,b) (((a) < (b)) ? (a) : (b))
101 /* For returnAddresses we use a field of the typeinfo to store from which */
102 /* subroutine the returnAddress will return, if used. */
103 /* XXX It would be nicer to use typeinfo.typeclass, but the verifier seems */
104 /* to need it initialised to NULL. This should be investigated. */
106 #if defined(ENABLE_VERIFIER)
107 #define SBRSTART typeinfo.elementclass.any
111 /* stackdata_t *****************************************************************
113 This struct holds internal data during stack analysis.
115 *******************************************************************************/
117 typedef struct stackdata_t stackdata_t;
120 basicblock *bptr; /* the current basic block being analysed */
121 stackptr new; /* next free stackelement */
122 s4 vartop; /* next free variable index */
123 s4 localcount; /* number of locals (at the start of var) */
124 s4 varcount; /* maximum number of variables expected */
125 s4 varsallocated; /* total number of variables allocated */
126 s4 maxlocals; /* max. number of Java locals */
127 varinfo *var; /* variable array (same as jd->var) */
128 s4 *javalocals; /* map from Java locals to jd->var indices */
129 methodinfo *m; /* the method being analysed */
130 jitdata *jd; /* current jitdata */
131 basicblock *last_real_block; /* the last block before the empty one */
132 bool repeat; /* if true, iterate the analysis again */
133 exception_entry **handlers; /* exception handlers for the current block */
134 exception_entry *extableend; /* points to the last exception entry */
135 stackelement exstack; /* instack for exception handlers */
139 /* macros for allocating/releasing variable indices *****************/
141 #define GET_NEW_INDEX(sd, new_varindex) \
143 assert((sd).vartop < (sd).varcount); \
144 (new_varindex) = ((sd).vartop)++; \
147 /* Not implemented now - could be used to reuse varindices. */
148 /* Pay attention to not release a localvar once implementing it! */
149 #define RELEASE_INDEX(sd, varindex)
151 #define GET_NEW_VAR(sd, newvarindex, newtype) \
153 GET_NEW_INDEX((sd), (newvarindex)); \
154 (sd).var[newvarindex].type = (newtype); \
158 /* macros for querying variable properties **************************/
160 #define IS_INOUT(sp) \
161 (sd.var[(sp)->varnum].flags & INOUT)
163 #define IS_PREALLOC(sp) \
164 (sd.var[(sp)->varnum].flags & PREALLOC)
166 #define IS_TEMPVAR(sp) \
167 ( ((sp)->varnum >= sd.localcount) \
168 && !(sd.var[(sp)->varnum].flags & (INOUT | PREALLOC)) )
171 #define IS_LOCALVAR_SD(sd, sp) \
172 ((sp)->varnum < (sd).localcount)
174 #define IS_LOCALVAR(sp) \
175 IS_LOCALVAR_SD(sd, (sp))
178 /* macros for setting variable properties ****************************/
180 #define SET_TEMPVAR(sp) \
182 if (IS_LOCALVAR((sp))) { \
183 stack_change_to_tempvar(&sd, (sp), iptr); \
185 sd.var[(sp)->varnum].flags &= ~(INOUT | PREALLOC); \
188 #define SET_PREALLOC(sp) \
190 assert(!IS_LOCALVAR((sp))); \
191 sd.var[(sp)->varnum].flags |= PREALLOC; \
195 /* macros for source operands ***************************************/
198 (iptr->s1.varindex = -1)
200 #define USE_S1(type1) \
203 CHECK_BASIC_TYPE(type1, curstack->type); \
204 iptr->s1.varindex = curstack->varnum; \
210 iptr->s1.varindex = curstack->varnum; \
213 #define USE_S1_S2(type1, type2) \
216 CHECK_BASIC_TYPE(type1, curstack->prev->type); \
217 CHECK_BASIC_TYPE(type2, curstack->type); \
218 iptr->sx.s23.s2.varindex = curstack->varnum; \
219 iptr->s1.varindex = curstack->prev->varnum; \
222 #define USE_S1_S2_ANY_ANY \
225 iptr->sx.s23.s2.varindex = curstack->varnum; \
226 iptr->s1.varindex = curstack->prev->varnum; \
229 #define USE_S1_S2_S3(type1, type2, type3) \
232 CHECK_BASIC_TYPE(type1, curstack->prev->prev->type); \
233 CHECK_BASIC_TYPE(type2, curstack->prev->type); \
234 CHECK_BASIC_TYPE(type3, curstack->type); \
235 iptr->sx.s23.s3.varindex = curstack->varnum; \
236 iptr->sx.s23.s2.varindex = curstack->prev->varnum; \
237 iptr->s1.varindex = curstack->prev->prev->varnum; \
240 /* The POPANY macro does NOT check stackdepth, or set stackdepth! */
243 if (curstack->varkind == UNDEFVAR) \
244 curstack->varkind = TEMPVAR; \
245 curstack = curstack->prev; \
248 #define POP_S1(type1) \
251 if (curstack->varkind == UNDEFVAR) \
252 curstack->varkind = TEMPVAR; \
253 curstack = curstack->prev; \
259 if (curstack->varkind == UNDEFVAR) \
260 curstack->varkind = TEMPVAR; \
261 curstack = curstack->prev; \
264 #define POP_S1_S2(type1, type2) \
266 USE_S1_S2(type1, type2); \
267 if (curstack->varkind == UNDEFVAR) \
268 curstack->varkind = TEMPVAR; \
269 if (curstack->prev->varkind == UNDEFVAR) \
270 curstack->prev->varkind = TEMPVAR; \
271 curstack = curstack->prev->prev; \
274 #define POP_S1_S2_ANY_ANY \
277 if (curstack->varkind == UNDEFVAR) \
278 curstack->varkind = TEMPVAR; \
279 if (curstack->prev->varkind == UNDEFVAR) \
280 curstack->prev->varkind = TEMPVAR; \
281 curstack = curstack->prev->prev; \
284 #define POP_S1_S2_S3(type1, type2, type3) \
286 USE_S1_S2_S3(type1, type2, type3); \
287 if (curstack->varkind == UNDEFVAR) \
288 curstack->varkind = TEMPVAR; \
289 if (curstack->prev->varkind == UNDEFVAR) \
290 curstack->prev->varkind = TEMPVAR; \
291 if (curstack->prev->prev->varkind == UNDEFVAR) \
292 curstack->prev->prev->varkind = TEMPVAR; \
293 curstack = curstack->prev->prev->prev; \
300 /* macros for setting the destination operand ***********************/
303 (iptr->dst.varindex = -1)
305 #define DST(typed, index) \
307 NEWSTACKn((typed),(index)); \
308 curstack->creator = iptr; \
309 iptr->dst.varindex = (index); \
312 #define DST_LOCALVAR(typed, index) \
314 NEWSTACK((typed), LOCALVAR, (index)); \
315 curstack->creator = iptr; \
316 iptr->dst.varindex = (index); \
320 /* macro for propagating constant values ****************************/
322 #if defined(ENABLE_VERIFIER)
323 #define COPY_VAL_AND_TYPE_VAR(sv, dv) \
325 if (((dv)->type = (sv)->type) == TYPE_RET) { \
326 (dv)->vv = (sv)->vv; \
327 (dv)->SBRSTART = (sv)->SBRSTART; \
331 #define COPY_VAL_AND_TYPE_VAR(sv, dv) \
333 (dv)->type = (sv)->type; \
334 if (((dv)->type = (sv)->type) == TYPE_RET) { \
335 (dv)->vv = (sv)->vv; \
340 #define COPY_VAL_AND_TYPE(sd, sindex, dindex) \
341 COPY_VAL_AND_TYPE_VAR((sd).var + (sindex), (sd).var + (dindex))
344 /* stack modelling macros *******************************************/
346 #define OP0_1(typed) \
349 GET_NEW_VAR(sd, new_index, (typed)); \
350 DST((typed), new_index); \
361 #define OP1_BRANCH(type1) \
367 #define OP1_1(type1, typed) \
370 GET_NEW_VAR(sd, new_index, (typed)); \
371 DST(typed, new_index); \
374 #define OP2_1(type1, type2, typed) \
376 POP_S1_S2(type1, type2); \
377 GET_NEW_VAR(sd, new_index, (typed)); \
378 DST(typed, new_index); \
393 #define OP1_0(type1) \
400 #define OP2_0(type1, type2) \
402 POP_S1_S2(type1, type2); \
407 #define OP2_BRANCH(type1, type2) \
409 POP_S1_S2(type1, type2); \
413 #define OP2_0_ANY_ANY \
420 #define OP3_0(type1, type2, type3) \
422 POP_S1_S2_S3(type1, type2, type3); \
427 #define LOAD(type1, index) \
429 DST_LOCALVAR(type1, index); \
433 #define STORE(type1, index) \
440 /* macros for DUP elimination ***************************************/
442 /* XXX replace NEW_VAR with NEW_INDEX */
443 #define DUP_SLOT(sp) \
445 GET_NEW_VAR(sd, new_index, (sp)->type); \
446 COPY_VAL_AND_TYPE(sd, (sp)->varnum, new_index); \
447 NEWSTACK((sp)->type, TEMPVAR, new_index); \
450 /* does not check input stackdepth */
451 #define MOVE_UP(sp) \
453 iptr->opc = ICMD_MOVE; \
454 iptr->s1.varindex = (sp)->varnum; \
456 curstack->creator = iptr; \
457 iptr->dst.varindex = curstack->varnum; \
461 /* does not check input stackdepth */
462 #define COPY_UP(sp) \
465 iptr->opc = ICMD_COPY; \
466 iptr->s1.varindex = (sp)->varnum; \
468 curstack->creator = iptr; \
469 iptr->dst.varindex = curstack->varnum; \
473 #define COPY_DOWN(s, d) \
476 iptr->opc = ICMD_COPY; \
477 iptr->s1.varindex = (s)->varnum; \
478 iptr->dst.varindex = (d)->varnum; \
479 (d)->creator = iptr; \
482 #define MOVE_TO_TEMP(sp) \
484 GET_NEW_INDEX(sd, new_index); \
485 iptr->opc = ICMD_MOVE; \
486 iptr->s1.varindex = (sp)->varnum; \
487 iptr->dst.varindex = new_index; \
488 COPY_VAL_AND_TYPE(sd, (sp)->varnum, new_index); \
489 (sp)->varnum = new_index; \
490 (sp)->varkind = TEMPVAR; \
493 /* macros for branching / reaching basic blocks *********************/
495 #define BRANCH_TARGET(bt, tempbptr) \
497 tempbptr = (bt).block; \
498 tempbptr = stack_mark_reached(&sd, tempbptr, curstack, \
500 if (tempbptr == NULL) \
502 (bt).block = tempbptr; \
505 #define BRANCH(tempbptr) \
506 BRANCH_TARGET(iptr->dst, tempbptr)
509 /* forward declarations *******************************************************/
511 static void stack_create_invars(stackdata_t *sd, basicblock *b,
512 stackptr curstack, int stackdepth);
513 static void stack_create_invars_from_outvars(stackdata_t *sd, basicblock *b);
515 #if defined(STACK_VERBOSE)
516 static void stack_verbose_show_varinfo(stackdata_t *sd, varinfo *v);
517 static void stack_verbose_show_variable(stackdata_t *sd, s4 index);
518 static void stack_verbose_show_block(stackdata_t *sd, basicblock *bptr);
519 static void stack_verbose_block_enter(stackdata_t *sd, bool reanalyse);
520 static void stack_verbose_block_exit(stackdata_t *sd, bool superblockend);
521 static void stack_verbose_show_state(stackdata_t *sd, instruction *iptr,
526 /* stack_init ******************************************************************
528 Initialized the stack analysis subsystem (called by jit_init).
530 *******************************************************************************/
532 bool stack_init(void)
538 /* stack_grow_variable_array ***************************************************
540 Grow the variable array so the given number of additional variables fits in.
541 The number is added to `varcount`, which is the maximum number of variables
542 we expect to need at this point. The actual number of variables
543 (`varsallocated`) may be larger than that, in order to avoid too many
547 sd...........stack analysis data
548 num..........number of additional variables
550 *******************************************************************************/
552 static void stack_grow_variable_array(stackdata_t *sd, s4 num)
558 if (sd->varcount + num > sd->varsallocated) {
559 newsize = 2*sd->varsallocated + num;
561 sd->var = DMREALLOC(sd->var, varinfo, sd->varsallocated, newsize);
562 MZERO(sd->var + sd->varsallocated, varinfo, (newsize - sd->varsallocated));
563 sd->varsallocated = newsize;
564 sd->jd->var = sd->var;
568 sd->jd->varcount += num;
570 assert(sd->varcount <= sd->varsallocated);
574 /* stack_append_block **********************************************************
576 Append the given block after the last real block of the method (before
577 the pseudo-block at the end).
580 sd...........stack analysis data
581 b............the block to append
583 *******************************************************************************/
585 static void stack_append_block(stackdata_t *sd, basicblock *b)
587 #if defined(STACK_VERBOSE)
588 printf("APPENDING BLOCK L%0d\n", b->nr);
591 b->next = sd->last_real_block->next;
592 sd->last_real_block->next = b;
593 sd->last_real_block = b;
594 b->nr = sd->jd->basicblockcount++;
595 b->next->nr = b->nr + 1;
599 /* stack_clone_block ***********************************************************
601 Create a copy of the given block and insert it at the end of the method.
603 CAUTION: This function does not copy the any variables or the instruction
604 list. It _does_, however, reserve space for the block's invars in the
608 sd...........stack analysis data
609 b............the block to clone
612 a pointer to the copy
614 *******************************************************************************/
616 static basicblock * stack_clone_block(stackdata_t *sd, basicblock *b)
620 clone = DNEW(basicblock);
623 clone->iinstr = NULL;
624 clone->inlocals = NULL;
625 clone->javalocals = NULL;
626 clone->invars = NULL;
628 clone->original = (b->original) ? b->original : b;
629 clone->copied_to = clone->original->copied_to;
630 clone->original->copied_to = clone;
632 clone->flags = BBREACHED;
634 stack_append_block(sd, clone);
636 /* reserve space for the invars of the clone */
638 stack_grow_variable_array(sd, b->indepth);
640 #if defined(STACK_VERBOSE)
641 printf("cloning block L%03d ------> L%03d\n", b->nr, clone->nr);
648 /* stack_create_locals *********************************************************
650 Create the local variables for the start of the given basic block.
653 sd...........stack analysis data
654 b............block to create the locals for
656 *******************************************************************************/
658 static void stack_create_locals(stackdata_t *sd, basicblock *b)
664 /* copy the current state of the local variables */
665 /* (one extra local is needed by the verifier) */
667 dv = DMNEW(varinfo, sd->localcount + VERIFIER_EXTRA_LOCALS);
669 for (i=0; i<sd->localcount; ++i)
672 /* the current map from java locals to cacao variables */
674 jl = DMNEW(s4, sd->maxlocals);
676 MCOPY(jl, sd->javalocals, s4, sd->maxlocals);
680 /* stack_merge_locals **********************************************************
682 Merge local variables at the beginning of the given basic block.
685 sd...........stack analysis data
686 b............the block that is reached
688 *******************************************************************************/
690 static void stack_merge_locals(stackdata_t *sd, basicblock *b)
696 /* If a javalocal is mapped to different cacao locals along the */
697 /* incoming control-flow edges, it becomes undefined. */
699 for (i=0; i<sd->maxlocals; ++i) {
700 if (b->javalocals[i] != UNUSED && b->javalocals[i] != sd->javalocals[i]) {
701 b->javalocals[i] = UNUSED;
702 if (b->flags >= BBFINISHED)
703 b->flags = BBTYPECHECK_REACHED;
704 if (b->nr <= sd->bptr->nr)
709 #if defined(ENABLE_VERIFIER)
711 for (i=0; i<sd->localcount; ++i) {
712 dv = b->inlocals + i;
714 if ((sv->type == TYPE_RET && dv->type == TYPE_RET)
715 && (sv->SBRSTART != dv->SBRSTART))
717 #if defined(STACK_VERBOSE)
718 printf("JSR MISMATCH: setting variable %d to VOID\n", i);
720 dv->type = TYPE_VOID;
721 if (b->flags >= BBFINISHED)
722 b->flags = BBTYPECHECK_REACHED;
723 sd->repeat = true; /* This is very rare, so just repeat */
727 #endif /* defined(ENABLE_VERIFIER) */
731 /* stack_create_invars *********************************************************
733 Create the invars for the given basic block. Also make a copy of the locals.
736 sd...........stack analysis data
737 b............block to create the invars for
738 curstack.....current stack top
739 stackdepth...current stack depth
741 This function creates STACKDEPTH invars and sets their types to the
742 types to the types of the corresponding slot in the current stack.
744 *******************************************************************************/
746 static void stack_create_invars(stackdata_t *sd, basicblock *b,
747 stackptr curstack, int stackdepth)
755 assert(sd->vartop + stackdepth <= sd->varcount);
757 b->indepth = stackdepth;
758 b->invars = DMNEW(s4, stackdepth);
760 /* allocate the variable indices */
761 index = (sd->vartop += stackdepth);
764 for (sp = curstack; i--; sp = sp->prev) {
765 b->invars[i] = --index;
766 dv = sd->var + index;
767 sv = sd->var + sp->varnum;
769 COPY_VAL_AND_TYPE_VAR(sv, dv);
772 stack_create_locals(sd, b);
776 /* stack_create_invars_from_outvars ********************************************
778 Create the invars for the given basic block. Also make a copy of the locals.
779 Types are propagated from the outvars of the current block.
782 sd...........stack analysis data
783 b............block to create the invars for
785 *******************************************************************************/
787 static void stack_create_invars_from_outvars(stackdata_t *sd, basicblock *b)
793 n = sd->bptr->outdepth;
794 assert(sd->vartop + n <= sd->varcount);
797 b->invars = DMNEW(s4, n);
800 dv = sd->var + sd->vartop;
802 /* allocate the invars */
804 for (i=0; i<n; ++i, ++dv) {
805 sv = sd->var + sd->bptr->outvars[i];
806 b->invars[i] = sd->vartop++;
808 COPY_VAL_AND_TYPE_VAR(sv, dv);
812 stack_create_locals(sd, b);
816 /* stack_check_invars **********************************************************
818 Check the current stack against the invars of the given basic block.
819 Depth and types must match.
822 sd...........stack analysis data
823 b............block which invars to check against
824 curstack.....current stack top
825 stackdepth...current stack depth
829 NULL.........a VerifyError has been thrown
831 *******************************************************************************/
833 static basicblock * stack_check_invars(stackdata_t *sd, basicblock *b,
834 stackptr curstack, int stackdepth)
843 #if defined(STACK_VERBOSE)
844 printf("stack_check_invars(L%03d)\n", b->nr);
847 /* find original of b */
852 #if defined(STACK_VERBOSE)
853 printf("original is L%03d\n", orig->nr);
858 #if defined(ENABLE_VERIFIER)
859 if (i != stackdepth) {
860 exceptions_throw_verifyerror(sd->m, "Stack depth mismatch");
868 #if defined(STACK_VERBOSE)
869 printf("checking against ");
870 stack_verbose_show_block(sd, b); printf("\n");
874 for (i = orig->indepth; i--; sp = sp->prev) {
875 dv = sd->var + b->invars[i];
876 sv = sd->var + sp->varnum;
878 #if defined(ENABLE_VERIFIER)
879 if (dv->type != sp->type) {
880 exceptions_throw_verifyerror_for_stack(sd->m, dv->type);
885 if (sp->type == TYPE_RET) {
886 #if defined(ENABLE_VERIFIER)
887 if (dv->SBRSTART != sv->SBRSTART) {
888 exceptions_throw_verifyerror(sd->m, "Mismatched stack types");
892 if (dv->vv.retaddr != sv->vv.retaddr) {
894 /* don't break! have to check the remaining stackslots */
900 for (i=0; i<sd->localcount; ++i) {
901 dv = b->inlocals + i;
903 if (sv->type == TYPE_RET && dv->type == TYPE_RET) {
905 #if defined(ENABLE_VERIFIER)
906 (sv->SBRSTART == dv->SBRSTART) &&
908 (sv->vv.retaddr != dv->vv.retaddr))
918 /* XXX cascading collapse? */
920 stack_merge_locals(sd, b);
922 #if defined(STACK_VERBOSE)
923 printf("------> using L%03d\n", b->nr);
927 } while ((b = b->copied_to) != NULL);
929 b = stack_clone_block(sd, orig);
933 stack_create_invars(sd, b, curstack, stackdepth);
938 /* stack_check_invars_from_outvars *********************************************
940 Check the outvars of the current block against the invars of the given block.
941 Depth and types must match.
944 sd...........stack analysis data
945 b............block which invars to check against
949 NULL.........a VerifyError has been thrown
951 *******************************************************************************/
953 static basicblock * stack_check_invars_from_outvars(stackdata_t *sd, basicblock *b)
961 #if defined(STACK_VERBOSE)
962 printf("stack_check_invars_from_outvars(L%03d)\n", b->nr);
965 /* find original of b */
970 #if defined(STACK_VERBOSE)
971 printf("original is L%03d\n", orig->nr);
975 n = sd->bptr->outdepth;
977 #if defined(ENABLE_VERIFIER)
979 exceptions_throw_verifyerror(sd->m, "Stack depth mismatch");
987 #if defined(STACK_VERBOSE)
988 printf("checking against ");
989 stack_verbose_show_block(sd, b); printf("\n");
993 dv = sd->var + b->invars[0];
995 for (i=0; i<n; ++i, ++dv) {
996 sv = sd->var + sd->bptr->outvars[i];
998 #if defined(ENABLE_VERIFIER)
999 if (sv->type != dv->type) {
1000 exceptions_throw_verifyerror_for_stack(sd->m, dv->type);
1005 if (dv->type == TYPE_RET) {
1006 #if defined(ENABLE_VERIFIER)
1007 if (sv->SBRSTART != dv->SBRSTART) {
1008 exceptions_throw_verifyerror(sd->m, "Mismatched stack types");
1012 if (sv->vv.retaddr != dv->vv.retaddr) {
1014 /* don't break! have to check the remaining stackslots */
1021 for (i=0; i<sd->localcount; ++i) {
1022 dv = b->inlocals + i;
1025 #if defined(ENABLE_VERIFIER)
1026 (sv->SBRSTART == dv->SBRSTART) &&
1028 (sv->type == TYPE_RET && dv->type == TYPE_RET))
1030 if (sv->vv.retaddr != dv->vv.retaddr) {
1039 /* XXX cascading collapse? */
1041 stack_merge_locals(sd, b);
1043 #if defined(STACK_VERBOSE)
1044 printf("------> using L%03d\n", b->nr);
1048 } while ((b = b->copied_to) != NULL);
1050 b = stack_clone_block(sd, orig);
1054 stack_create_invars_from_outvars(sd, b);
1059 /* stack_create_instack ********************************************************
1061 Create the instack of the current basic block.
1064 sd...........stack analysis data
1067 the current stack top at the start of the basic block.
1069 *******************************************************************************/
1071 static stackptr stack_create_instack(stackdata_t *sd)
1077 if ((depth = sd->bptr->indepth) == 0)
1080 sp = (sd->new += depth);
1084 index = sd->bptr->invars[depth];
1086 sp->type = sd->var[index].type;
1090 sp->varkind = STACKVAR;
1094 /* return the top of the created stack */
1099 /* stack_mark_reached **********************************************************
1101 Mark the given block reached and propagate the current stack and locals to
1102 it. This function specializes the target block, if necessary, and returns
1103 a pointer to the specialized target.
1106 sd...........stack analysis data
1107 b............the block to reach
1108 curstack.....the current stack top
1109 stackdepth...the current stack depth
1112 a pointer to (a specialized version of) the target
1113 NULL.........a VerifyError has been thrown
1115 *******************************************************************************/
1117 static basicblock *stack_mark_reached(stackdata_t *sd, basicblock *b, stackptr curstack, int stackdepth)
1121 #if defined(STACK_VERBOSE)
1122 printf("stack_mark_reached(L%03d from L%03d)\n", b->nr, sd->bptr->nr);
1125 /* mark targets of backward branches */
1127 if (b->nr <= sd->bptr->nr)
1128 b->bitflags |= BBFLAG_REPLACEMENT;
1130 if (b->flags < BBREACHED) {
1131 /* b is reached for the first time. Create its invars. */
1133 #if defined(STACK_VERBOSE)
1134 printf("reached L%03d for the first time\n", b->nr);
1137 stack_create_invars(sd, b, curstack, stackdepth);
1139 b->flags = BBREACHED;
1144 /* b has been reached before. Check that its invars match. */
1146 return stack_check_invars(sd, b, curstack, stackdepth);
1151 /* stack_mark_reached_from_outvars *********************************************
1153 Mark the given block reached and propagate the outvars of the current block
1154 and the current locals to it. This function specializes the target block,
1155 if necessary, and returns a pointer to the specialized target.
1158 sd...........stack analysis data
1159 b............the block to reach
1162 a pointer to (a specialized version of) the target
1163 NULL.........a VerifyError has been thrown
1165 *******************************************************************************/
1167 static basicblock *stack_mark_reached_from_outvars(stackdata_t *sd, basicblock *b)
1171 #if defined(STACK_VERBOSE)
1172 printf("stack_mark_reached_from_outvars(L%03d from L%03d)\n", b->nr, sd->bptr->nr);
1175 /* mark targets of backward branches */
1177 if (b->nr <= sd->bptr->nr)
1178 b->bitflags |= BBFLAG_REPLACEMENT;
1180 if (b->flags < BBREACHED) {
1181 /* b is reached for the first time. Create its invars. */
1183 #if defined(STACK_VERBOSE)
1184 printf("reached L%03d for the first time\n", b->nr);
1187 stack_create_invars_from_outvars(sd, b);
1189 b->flags = BBREACHED;
1194 /* b has been reached before. Check that its invars match. */
1196 return stack_check_invars_from_outvars(sd, b);
1201 /* stack_reach_next_block ******************************************************
1203 Mark the following block reached and propagate the outvars of the
1204 current block and the current locals to it. This function
1205 specializes the target block, if necessary, and returns a pointer
1206 to the specialized target.
1209 sd...........stack analysis data
1212 a pointer to (a specialized version of) the following block
1213 NULL.........a VerifyError has been thrown
1215 *******************************************************************************/
1217 static bool stack_reach_next_block(stackdata_t *sd)
1222 tbptr = (sd->bptr->original) ? sd->bptr->original : sd->bptr;
1223 tbptr = stack_mark_reached_from_outvars(sd, tbptr->next);
1228 if (tbptr != sd->bptr->next) {
1229 #if defined(STACK_VERBOSE)
1230 printf("NEXT IS NON-CONSEQUITIVE L%03d\n", tbptr->nr);
1232 iptr = sd->bptr->iinstr + sd->bptr->icount - 1;
1233 assert(iptr->opc == ICMD_NOP);
1234 iptr->opc = ICMD_GOTO;
1235 iptr->dst.block = tbptr;
1237 if (tbptr->flags < BBFINISHED)
1238 sd->repeat = true; /* XXX check if we really need to repeat */
1245 /* stack_reach_handlers ********************************************************
1247 Reach the exception handlers for the current block.
1250 sd...........stack analysis data
1253 true.........everything ok
1254 false........a VerifyError has been thrown
1256 *******************************************************************************/
1258 static bool stack_reach_handlers(stackdata_t *sd)
1263 #if defined(STACK_VERBOSE)
1264 printf("reaching exception handlers...\n");
1267 for (i=0; sd->handlers[i]; ++i) {
1268 tbptr = sd->handlers[i]->handler;
1270 tbptr->type = BBTYPE_EXH;
1271 tbptr->predecessorcount = CFG_UNKNOWN_PREDECESSORS;
1273 /* reach (and specialize) the handler block */
1275 tbptr = stack_mark_reached(sd, tbptr, &(sd->exstack), 1);
1280 sd->handlers[i]->handler = tbptr;
1287 /* stack_reanalyse_block ******************************************************
1289 Re-analyse the current block. This is called if either the block itself
1290 has already been analysed before, or the current block is a clone of an
1291 already analysed block, and this clone is reached for the first time.
1292 In the latter case, this function does all that is necessary for fully
1293 cloning the block (cloning the instruction list and variables, etc.).
1296 sd...........stack analysis data
1299 true.........everything ok
1300 false........a VerifyError has been thrown
1302 *******************************************************************************/
1304 #define RELOCATE(index) \
1306 if ((index) >= blockvarstart) \
1307 (index) += blockvarshift; \
1308 else if ((index) >= invarstart) \
1309 (index) += invarshift; \
1312 bool stack_reanalyse_block(stackdata_t *sd)
1324 branch_target_t *table;
1325 lookup_target_t *lookup;
1327 bool cloneinstructions;
1328 exception_entry *ex;
1330 #if defined(STACK_VERBOSE)
1331 stack_verbose_block_enter(sd, true);
1338 assert(orig != NULL);
1340 /* clone the instruction list */
1342 cloneinstructions = true;
1344 assert(orig->iinstr);
1346 iptr = DMNEW(instruction, len + 1);
1348 MCOPY(iptr, orig->iinstr, instruction, len);
1349 iptr[len].opc = ICMD_NOP;
1351 iptr[len].flags.bits = 0;
1355 /* reserve space for the clone's block variables */
1357 stack_grow_variable_array(sd, orig->varcount);
1359 /* we already have the invars set */
1361 assert(b->indepth == orig->indepth);
1363 /* calculate relocation shifts for invars and block variables */
1365 if (orig->indepth) {
1366 invarstart = orig->invars[0];
1367 invarshift = b->invars[0] - invarstart;
1370 invarstart = INT_MAX;
1373 blockvarstart = orig->varstart;
1374 blockvarshift = sd->vartop - blockvarstart;
1376 /* copy block variables */
1378 b->varstart = sd->vartop;
1379 b->varcount = orig->varcount;
1380 sd->vartop += b->varcount;
1381 MCOPY(sd->var + b->varstart, sd->var + orig->varstart, varinfo, b->varcount);
1385 b->outdepth = orig->outdepth;
1386 b->outvars = DMNEW(s4, orig->outdepth);
1387 MCOPY(b->outvars, orig->outvars, s4, orig->outdepth);
1389 /* clone exception handlers */
1391 for (i=0; sd->handlers[i]; ++i) {
1392 ex = DNEW(exception_entry);
1393 ex->handler = sd->handlers[i]->handler;
1395 ex->end = b; /* XXX hack, see end of stack_analyse */
1396 ex->catchtype = sd->handlers[i]->catchtype;
1399 assert(sd->extableend->down == NULL);
1400 sd->extableend->down = ex;
1401 sd->extableend = ex;
1402 sd->jd->exceptiontablelength++;
1404 sd->handlers[i] = ex;
1408 cloneinstructions = false;
1411 invarstart = sd->vartop;
1412 blockvarstart = sd->vartop;
1417 /* find exception handlers for the cloned block */
1419 ex = sd->jd->exceptiontable;
1420 for (; ex != NULL; ex = ex->down) {
1421 /* XXX the cloned exception handlers have identical */
1422 /* start end end blocks. */
1423 if ((ex->start == b) && (ex->end == b)) {
1424 sd->handlers[len++] = ex;
1427 sd->handlers[len] = NULL;
1430 #if defined(STACK_VERBOSE)
1431 printf("invarstart = %d, blockvarstart = %d\n", invarstart, blockvarstart);
1432 printf("invarshift = %d, blockvarshift = %d\n", invarshift, blockvarshift);
1435 /* mark block as finished */
1437 b->flags = BBFINISHED;
1439 /* initialize locals at the start of this block */
1442 MCOPY(sd->var, b->inlocals, varinfo, sd->localcount);
1444 MCOPY(sd->javalocals, b->javalocals, s4, sd->maxlocals);
1446 /* reach exception handlers for this block */
1448 if (!stack_reach_handlers(sd))
1451 superblockend = false;
1453 for (len = b->icount; len--; iptr++) {
1454 #if defined(STACK_VERBOSE)
1455 show_icmd(sd->jd, iptr, false, SHOW_STACK);
1459 switch (iptr->opc) {
1461 varindex = iptr->s1.varindex;
1463 #if defined(ENABLE_VERIFIER)
1464 if (sd->var[varindex].type != TYPE_RET) {
1465 exceptions_throw_verifyerror(sd->m, "RET with non-returnAddress value");
1470 iptr->dst.block = stack_mark_reached_from_outvars(sd, sd->var[varindex].vv.retaddr);
1471 superblockend = true;
1475 iptr->sx.s23.s3.jsrtarget.block = stack_mark_reached_from_outvars(sd, iptr->sx.s23.s3.jsrtarget.block);
1476 RELOCATE(iptr->dst.varindex);
1477 superblockend = true;
1481 superblockend = true;
1484 case ICMD_CHECKNULL:
1485 case ICMD_PUTSTATICCONST:
1493 iptr->dst.block = stack_mark_reached_from_outvars(sd, iptr->dst.block);
1494 superblockend = true;
1497 /* pop 0 push 1 const */
1505 /* pop 0 push 1 load */
1512 RELOCATE(iptr->dst.varindex);
1525 RELOCATE(iptr->sx.s23.s2.varindex);
1526 RELOCATE(iptr->s1.varindex);
1527 RELOCATE(iptr->dst.varindex);
1540 RELOCATE(iptr->sx.s23.s3.varindex);
1541 RELOCATE(iptr->sx.s23.s2.varindex);
1542 RELOCATE(iptr->s1.varindex);
1545 /* pop 1 push 0 store */
1552 RELOCATE(iptr->s1.varindex);
1554 varindex = iptr->dst.varindex;
1555 COPY_VAL_AND_TYPE(*sd, iptr->s1.varindex, varindex);
1556 i = iptr->sx.s23.s3.javaindex;
1557 if (iptr->flags.bits & INS_FLAG_RETADDR) {
1558 iptr->sx.s23.s2.retaddrnr =
1559 JAVALOCAL_FROM_RETADDR(sd->var[varindex].vv.retaddr->nr);
1560 sd->javalocals[i] = iptr->sx.s23.s2.retaddrnr;
1563 sd->javalocals[i] = varindex;
1564 if (iptr->flags.bits & INS_FLAG_KILL_PREV)
1565 sd->javalocals[i-1] = UNUSED;
1566 if (iptr->flags.bits & INS_FLAG_KILL_NEXT)
1567 sd->javalocals[i+1] = UNUSED;
1578 RELOCATE(iptr->s1.varindex);
1579 superblockend = true;
1582 case ICMD_PUTSTATIC:
1583 case ICMD_PUTFIELDCONST:
1585 RELOCATE(iptr->s1.varindex);
1588 /* pop 1 push 0 branch */
1591 case ICMD_IFNONNULL:
1606 RELOCATE(iptr->s1.varindex);
1607 iptr->dst.block = stack_mark_reached_from_outvars(sd, iptr->dst.block);
1610 /* pop 1 push 0 table branch */
1612 case ICMD_TABLESWITCH:
1613 i = iptr->sx.s23.s3.tablehigh - iptr->sx.s23.s2.tablelow + 1 + 1;
1615 if (cloneinstructions) {
1616 table = DMNEW(branch_target_t, i);
1617 MCOPY(table, iptr->dst.table, branch_target_t, i);
1618 iptr->dst.table = table;
1621 table = iptr->dst.table;
1624 RELOCATE(iptr->s1.varindex);
1626 table->block = stack_mark_reached_from_outvars(sd, table->block);
1629 superblockend = true;
1632 case ICMD_LOOKUPSWITCH:
1633 i = iptr->sx.s23.s2.lookupcount;
1634 if (cloneinstructions) {
1635 lookup = DMNEW(lookup_target_t, i);
1636 MCOPY(lookup, iptr->dst.lookup, lookup_target_t, i);
1637 iptr->dst.lookup = lookup;
1640 lookup = iptr->dst.lookup;
1642 RELOCATE(iptr->s1.varindex);
1644 lookup->target.block = stack_mark_reached_from_outvars(sd, lookup->target.block);
1647 iptr->sx.s23.s3.lookupdefault.block = stack_mark_reached_from_outvars(sd, iptr->sx.s23.s3.lookupdefault.block);
1648 superblockend = true;
1651 case ICMD_MONITORENTER:
1652 case ICMD_MONITOREXIT:
1653 RELOCATE(iptr->s1.varindex);
1656 /* pop 2 push 0 branch */
1658 case ICMD_IF_ICMPEQ:
1659 case ICMD_IF_ICMPNE:
1660 case ICMD_IF_ICMPLT:
1661 case ICMD_IF_ICMPGE:
1662 case ICMD_IF_ICMPGT:
1663 case ICMD_IF_ICMPLE:
1665 case ICMD_IF_LCMPEQ:
1666 case ICMD_IF_LCMPNE:
1667 case ICMD_IF_LCMPLT:
1668 case ICMD_IF_LCMPGE:
1669 case ICMD_IF_LCMPGT:
1670 case ICMD_IF_LCMPLE:
1672 case ICMD_IF_ACMPEQ:
1673 case ICMD_IF_ACMPNE:
1674 RELOCATE(iptr->sx.s23.s2.varindex);
1675 RELOCATE(iptr->s1.varindex);
1676 iptr->dst.block = stack_mark_reached_from_outvars(sd, iptr->dst.block);
1682 case ICMD_IASTORECONST:
1683 case ICMD_LASTORECONST:
1684 case ICMD_AASTORECONST:
1685 case ICMD_BASTORECONST:
1686 case ICMD_CASTORECONST:
1687 case ICMD_SASTORECONST:
1689 RELOCATE(iptr->sx.s23.s2.varindex);
1690 RELOCATE(iptr->s1.varindex);
1693 /* pop 0 push 1 copy */
1697 RELOCATE(iptr->dst.varindex);
1698 RELOCATE(iptr->s1.varindex);
1699 COPY_VAL_AND_TYPE(*sd, iptr->s1.varindex, iptr->dst.varindex);
1741 RELOCATE(iptr->sx.s23.s2.varindex);
1742 RELOCATE(iptr->s1.varindex);
1743 RELOCATE(iptr->dst.varindex);
1748 case ICMD_CHECKCAST:
1749 case ICMD_ARRAYLENGTH:
1750 case ICMD_INSTANCEOF:
1752 case ICMD_ANEWARRAY:
1754 case ICMD_IADDCONST:
1755 case ICMD_ISUBCONST:
1756 case ICMD_IMULCONST:
1760 case ICMD_IANDCONST:
1762 case ICMD_IXORCONST:
1763 case ICMD_ISHLCONST:
1764 case ICMD_ISHRCONST:
1765 case ICMD_IUSHRCONST:
1766 case ICMD_LADDCONST:
1767 case ICMD_LSUBCONST:
1768 case ICMD_LMULCONST:
1772 case ICMD_LANDCONST:
1774 case ICMD_LXORCONST:
1775 case ICMD_LSHLCONST:
1776 case ICMD_LSHRCONST:
1777 case ICMD_LUSHRCONST:
1781 case ICMD_INT2SHORT:
1797 RELOCATE(iptr->s1.varindex);
1798 RELOCATE(iptr->dst.varindex);
1803 case ICMD_GETSTATIC:
1805 RELOCATE(iptr->dst.varindex);
1808 /* pop many push any */
1810 case ICMD_INVOKESTATIC:
1811 case ICMD_INVOKESPECIAL:
1812 case ICMD_INVOKEVIRTUAL:
1813 case ICMD_INVOKEINTERFACE:
1815 case ICMD_MULTIANEWARRAY:
1816 i = iptr->s1.argcount;
1817 if (cloneinstructions) {
1818 argp = DMNEW(s4, i);
1819 MCOPY(argp, iptr->sx.s23.s2.args, s4, i);
1820 iptr->sx.s23.s2.args = argp;
1823 argp = iptr->sx.s23.s2.args;
1830 RELOCATE(iptr->dst.varindex);
1834 exceptions_throw_internalerror("Unknown ICMD %d during stack re-analysis",
1839 #if defined(STACK_VERBOSE)
1840 show_icmd(sd->jd, iptr, false, SHOW_STACK);
1845 /* relocate outvars */
1847 for (i=0; i<b->outdepth; ++i) {
1848 RELOCATE(b->outvars[i]);
1851 #if defined(STACK_VERBOSE)
1852 stack_verbose_block_exit(sd, superblockend);
1855 /* propagate to the next block */
1858 if (!stack_reach_next_block(sd))
1865 /* stack_change_to_tempvar *****************************************************
1867 Change the given stackslot to a TEMPVAR. This includes creating a new
1868 temporary variable and changing the dst.varindex of the creator of the
1869 stacklot to the new variable index. If this stackslot has been passed
1870 through ICMDs between the point of its creation and the current point,
1871 then the variable index is also changed in these ICMDs.
1874 sd...........stack analysis data
1875 sp...........stackslot to change
1876 ilimit.......instruction up to which to look for ICMDs passing-through
1877 the stackslot (exclusive). This may point exactly after the
1878 last instruction, in which case the search is done to the
1881 *******************************************************************************/
1883 static void stack_change_to_tempvar(stackdata_t *sd, stackptr sp,
1884 instruction *ilimit)
1892 oldindex = sp->varnum;
1894 /* create a new temporary variable */
1896 GET_NEW_VAR(*sd, newindex, sp->type);
1898 sd->var[newindex].flags = sp->flags;
1900 /* change the stackslot */
1902 sp->varnum = newindex;
1903 sp->varkind = TEMPVAR;
1905 /* change the dst.varindex of the stackslot's creator */
1908 sp->creator->dst.varindex = newindex;
1910 /* handle ICMDs this stackslot passed through, if any */
1912 if (sp->flags & PASSTHROUGH) {
1913 iptr = (sp->creator) ? (sp->creator + 1) : sd->bptr->iinstr;
1915 /* assert that the limit points to an ICMD, or after the last one */
1917 assert(ilimit >= sd->bptr->iinstr);
1918 assert(ilimit <= sd->bptr->iinstr + sd->bptr->icount);
1920 /* find the stackdepth under sp plus one */
1921 /* Note: This number is usually known when this function is called, */
1922 /* but calculating it here is less error-prone and should not be */
1923 /* a performance problem. */
1925 for (depth = 0; sp != NULL; sp = sp->prev)
1928 /* iterate over all instructions in the range and replace */
1930 for (; iptr < ilimit; ++iptr) {
1931 switch (iptr->opc) {
1932 case ICMD_INVOKESTATIC:
1933 case ICMD_INVOKESPECIAL:
1934 case ICMD_INVOKEVIRTUAL:
1935 case ICMD_INVOKEINTERFACE:
1937 i = iptr->s1.argcount - depth;
1938 if (iptr->sx.s23.s2.args[i] == oldindex) {
1939 iptr->sx.s23.s2.args[i] = newindex;
1942 /* IMPORTANT: If any ICMD sets the PASSTHROUGH flag of a */
1943 /* stackslot, it must be added in this switch! */
1950 /* stack_init_javalocals *******************************************************
1952 Initialize the mapping from Java locals to cacao variables at method entry.
1955 sd...........stack analysis data
1957 *******************************************************************************/
1959 static void stack_init_javalocals(stackdata_t *sd)
1968 jl = DMNEW(s4, sd->maxlocals);
1969 jd->basicblocks[0].javalocals = jl;
1971 for (i=0; i<sd->maxlocals; ++i)
1974 md = jd->m->parseddesc;
1976 for (i=0; i<md->paramcount; ++i) {
1977 type = md->paramtypes[i].type;
1978 jl[j] = jd->local_map[5*j + type];
1980 if (IS_2_WORD_TYPE(type))
1986 /* stack_analyse ***************************************************************
1988 Analyse_stack uses the intermediate code created by parse.c to
1989 build a model of the JVM operand stack for the current method.
1991 The following checks are performed:
1992 - check for operand stack underflow (before each instruction)
1993 - check for operand stack overflow (after[1] each instruction)
1994 - check for matching stack depth at merging points
1995 - check for matching basic types[2] at merging points
1996 - check basic types for instruction input (except for BUILTIN*
1997 opcodes, INVOKE* opcodes and MULTIANEWARRAY)
1999 [1]) Checking this after the instruction should be ok. parse.c
2000 counts the number of required stack slots in such a way that it is
2001 only vital that we don't exceed `maxstack` at basic block
2004 [2]) 'basic types' means the distinction between INT, LONG, FLOAT,
2005 DOUBLE and ADDRESS types. Subtypes of INT and different ADDRESS
2006 types are not discerned.
2008 *******************************************************************************/
2010 bool stack_analyse(jitdata *jd)
2012 methodinfo *m; /* method being analyzed */
2017 stackptr curstack; /* current stack top */
2019 int opcode; /* opcode of current instruction */
2022 int type; /* operand type */
2023 int len; /* # of instructions after the current one */
2024 bool superblockend; /* if true, no fallthrough to next block */
2025 bool deadcode; /* true if no live code has been reached */
2026 instruction *iptr; /* the current instruction */
2028 basicblock *original;
2029 exception_entry *ex;
2031 stackptr *last_store_boundary;
2032 stackptr coalescing_boundary;
2034 stackptr src1, src2, src3, src4, dst1, dst2;
2036 branch_target_t *table;
2037 lookup_target_t *lookup;
2038 #if defined(ENABLE_VERIFIER)
2039 int expectedtype; /* used by CHECK_BASIC_TYPE */
2041 builtintable_entry *bte;
2043 constant_FMIref *fmiref;
2044 #if defined(ENABLE_STATISTICS)
2045 int iteration_count; /* number of iterations of analysis */
2047 int new_index; /* used to get a new var index with GET_NEW_INDEX*/
2049 #if defined(STACK_VERBOSE)
2050 show_method(jd, SHOW_PARSE);
2053 /* get required compiler data - initialization */
2059 /* initialize the stackdata_t struct */
2063 sd.varcount = jd->varcount;
2064 sd.vartop = jd->vartop;
2065 sd.localcount = jd->localcount;
2067 sd.varsallocated = sd.varcount;
2068 sd.maxlocals = m->maxlocals;
2069 sd.javalocals = DMNEW(s4, sd.maxlocals);
2070 sd.handlers = DMNEW(exception_entry *, jd->exceptiontablelength + 1);
2072 /* prepare the variable for exception handler stacks */
2073 /* (has been reserved by STACK_EXTRA_VARS, or VERIFIER_EXTRA_VARS) */
2075 sd.exstack.type = TYPE_ADR;
2076 sd.exstack.prev = NULL;
2077 sd.exstack.varnum = sd.localcount;
2078 sd.var[sd.exstack.varnum].type = TYPE_ADR;
2080 #if defined(ENABLE_STATISTICS)
2081 iteration_count = 0;
2084 /* find the last real basic block */
2086 sd.last_real_block = NULL;
2087 tbptr = jd->basicblocks;
2088 while (tbptr->next) {
2089 sd.last_real_block = tbptr;
2090 tbptr = tbptr->next;
2092 assert(sd.last_real_block);
2094 /* find the last exception handler */
2096 if (jd->exceptiontablelength)
2097 sd.extableend = jd->exceptiontable + jd->exceptiontablelength - 1;
2099 sd.extableend = NULL;
2101 /* init jd->interface_map */
2103 jd->maxinterfaces = m->maxstack;
2104 jd->interface_map = DMNEW(interface_info, m->maxstack * 5);
2105 for (i = 0; i < m->maxstack * 5; i++)
2106 jd->interface_map[i].flags = UNUSED;
2108 last_store_boundary = DMNEW(stackptr, m->maxlocals);
2110 /* initialize flags and invars (none) of first block */
2112 jd->basicblocks[0].flags = BBREACHED;
2113 jd->basicblocks[0].invars = NULL;
2114 jd->basicblocks[0].indepth = 0;
2115 jd->basicblocks[0].inlocals =
2116 DMNEW(varinfo, jd->localcount + VERIFIER_EXTRA_LOCALS);
2117 MCOPY(jd->basicblocks[0].inlocals, jd->var, varinfo,
2118 jd->localcount + VERIFIER_EXTRA_LOCALS);
2120 /* initialize java local mapping of first block */
2122 stack_init_javalocals(&sd);
2124 /* stack analysis loop (until fixpoint reached) **************************/
2127 #if defined(ENABLE_STATISTICS)
2131 /* initialize loop over basic blocks */
2133 sd.bptr = jd->basicblocks;
2134 superblockend = true;
2140 /* iterate over basic blocks *****************************************/
2142 for (; sd.bptr; sd.bptr = sd.bptr->next) {
2144 if (sd.bptr->flags == BBDELETED) {
2145 /* This block has been deleted - do nothing. */
2150 if (sd.bptr->flags == BBTYPECHECK_REACHED) {
2151 /* re-analyse a block because its input changed */
2155 if (!stack_reanalyse_block(&sd))
2158 superblockend = true; /* XXX */
2162 if (superblockend && (sd.bptr->flags < BBREACHED)) {
2163 /* This block has not been reached so far, and we
2164 don't fall into it, so we'll have to iterate
2171 if (sd.bptr->flags > BBREACHED) {
2172 /* This block is already finished. */
2174 superblockend = true;
2178 if (sd.bptr->original && sd.bptr->original->flags < BBFINISHED) {
2179 /* This block is a clone and the original has not been
2180 analysed, yet. Analyse it on the next
2184 /* XXX superblockend? */
2188 /* This block has to be analysed now. */
2192 /* XXX The rest of this block is still indented one level too */
2193 /* much in order to avoid a giant diff by changing that. */
2195 /* We know that sd.bptr->flags == BBREACHED. */
2196 /* This block has been reached before. */
2198 assert(sd.bptr->flags == BBREACHED);
2199 stackdepth = sd.bptr->indepth;
2201 /* find exception handlers for this block */
2203 /* determine the active exception handlers for this block */
2204 /* XXX could use a faster algorithm with sorted lists or */
2207 original = (sd.bptr->original) ? sd.bptr->original : sd.bptr;
2210 ex = jd->exceptiontable;
2211 for (; ex != NULL; ex = ex->down) {
2212 if ((ex->start <= original) && (ex->end > original)) {
2213 sd.handlers[len++] = ex;
2216 sd.handlers[len] = NULL;
2219 /* reanalyse cloned block */
2221 if (sd.bptr->original) {
2222 if (!stack_reanalyse_block(&sd))
2227 /* reset the new pointer for allocating stackslots */
2231 /* create the instack of this block */
2233 curstack = stack_create_instack(&sd);
2235 /* initialize locals at the start of this block */
2237 if (sd.bptr->inlocals)
2238 MCOPY(sd.var, sd.bptr->inlocals, varinfo, sd.localcount);
2240 MCOPY(sd.javalocals, sd.bptr->javalocals, s4, sd.maxlocals);
2242 /* set up local variables for analyzing this block */
2244 superblockend = false;
2245 len = sd.bptr->icount;
2246 iptr = sd.bptr->iinstr;
2248 /* mark the block as analysed */
2250 sd.bptr->flags = BBFINISHED;
2252 /* reset variables for dependency checking */
2254 coalescing_boundary = sd.new;
2255 for( i = 0; i < m->maxlocals; i++)
2256 last_store_boundary[i] = sd.new;
2258 /* remember the start of this block's variables */
2260 sd.bptr->varstart = sd.vartop;
2262 #if defined(STACK_VERBOSE)
2263 stack_verbose_block_enter(&sd, false);
2266 /* reach exception handlers for this block */
2268 if (!stack_reach_handlers(&sd))
2271 /* iterate over ICMDs ****************************************/
2273 while (--len >= 0) {
2275 #if defined(STACK_VERBOSE)
2276 stack_verbose_show_state(&sd, iptr, curstack);
2279 /* fetch the current opcode */
2283 /* automatically replace some ICMDs with builtins */
2285 bte = builtintable_get_automatic(opcode);
2287 if ((bte != NULL) && (bte->opcode == opcode)) {
2288 iptr->opc = ICMD_BUILTIN;
2289 iptr->flags.bits &= INS_FLAG_ID_MASK;
2290 iptr->sx.s23.s3.bte = bte;
2291 /* iptr->line is already set */
2292 code_unflag_leafmethod(code);
2296 /* main opcode switch *************************************/
2308 case ICMD_CHECKNULL:
2309 coalescing_boundary = sd.new;
2310 COUNT(count_check_null);
2313 iptr->dst.varindex = iptr->s1.varindex;
2317 varindex = iptr->s1.varindex =
2318 jd->local_map[iptr->s1.varindex * 5 + TYPE_ADR];
2320 #if defined(ENABLE_VERIFIER)
2321 if (sd.var[varindex].type != TYPE_RET) {
2322 exceptions_throw_verifyerror(m, "RET with non-returnAddress value");
2329 iptr->dst.block = stack_mark_reached(&sd, sd.var[varindex].vv.retaddr, curstack, stackdepth);
2330 superblockend = true;
2334 COUNT(count_pcmd_return);
2337 superblockend = true;
2338 sd.jd->returncount++;
2339 sd.jd->returnblock = sd.bptr;
2343 /* pop 0 push 1 const */
2345 /************************** ICONST OPTIMIZATIONS **************************/
2348 COUNT(count_pcmd_load);
2352 switch (iptr[1].opc) {
2354 iptr->opc = ICMD_IADDCONST;
2358 iptr[1].opc = ICMD_NOP;
2359 OP1_1(TYPE_INT, TYPE_INT);
2360 COUNT(count_pcmd_op);
2364 iptr->opc = ICMD_ISUBCONST;
2365 goto icmd_iconst_tail;
2366 #if SUPPORT_CONST_MUL
2368 iptr->opc = ICMD_IMULCONST;
2369 goto icmd_iconst_tail;
2370 #else /* SUPPORT_CONST_MUL */
2372 if (iptr->sx.val.i == 0x00000002)
2374 else if (iptr->sx.val.i == 0x00000004)
2376 else if (iptr->sx.val.i == 0x00000008)
2378 else if (iptr->sx.val.i == 0x00000010)
2380 else if (iptr->sx.val.i == 0x00000020)
2382 else if (iptr->sx.val.i == 0x00000040)
2384 else if (iptr->sx.val.i == 0x00000080)
2386 else if (iptr->sx.val.i == 0x00000100)
2388 else if (iptr->sx.val.i == 0x00000200)
2390 else if (iptr->sx.val.i == 0x00000400)
2391 iptr->sx.val.i = 10;
2392 else if (iptr->sx.val.i == 0x00000800)
2393 iptr->sx.val.i = 11;
2394 else if (iptr->sx.val.i == 0x00001000)
2395 iptr->sx.val.i = 12;
2396 else if (iptr->sx.val.i == 0x00002000)
2397 iptr->sx.val.i = 13;
2398 else if (iptr->sx.val.i == 0x00004000)
2399 iptr->sx.val.i = 14;
2400 else if (iptr->sx.val.i == 0x00008000)
2401 iptr->sx.val.i = 15;
2402 else if (iptr->sx.val.i == 0x00010000)
2403 iptr->sx.val.i = 16;
2404 else if (iptr->sx.val.i == 0x00020000)
2405 iptr->sx.val.i = 17;
2406 else if (iptr->sx.val.i == 0x00040000)
2407 iptr->sx.val.i = 18;
2408 else if (iptr->sx.val.i == 0x00080000)
2409 iptr->sx.val.i = 19;
2410 else if (iptr->sx.val.i == 0x00100000)
2411 iptr->sx.val.i = 20;
2412 else if (iptr->sx.val.i == 0x00200000)
2413 iptr->sx.val.i = 21;
2414 else if (iptr->sx.val.i == 0x00400000)
2415 iptr->sx.val.i = 22;
2416 else if (iptr->sx.val.i == 0x00800000)
2417 iptr->sx.val.i = 23;
2418 else if (iptr->sx.val.i == 0x01000000)
2419 iptr->sx.val.i = 24;
2420 else if (iptr->sx.val.i == 0x02000000)
2421 iptr->sx.val.i = 25;
2422 else if (iptr->sx.val.i == 0x04000000)
2423 iptr->sx.val.i = 26;
2424 else if (iptr->sx.val.i == 0x08000000)
2425 iptr->sx.val.i = 27;
2426 else if (iptr->sx.val.i == 0x10000000)
2427 iptr->sx.val.i = 28;
2428 else if (iptr->sx.val.i == 0x20000000)
2429 iptr->sx.val.i = 29;
2430 else if (iptr->sx.val.i == 0x40000000)
2431 iptr->sx.val.i = 30;
2432 else if (iptr->sx.val.i == 0x80000000)
2433 iptr->sx.val.i = 31;
2437 iptr->opc = ICMD_IMULPOW2;
2438 goto icmd_iconst_tail;
2439 #endif /* SUPPORT_CONST_MUL */
2441 if (iptr->sx.val.i == 0x00000002)
2443 else if (iptr->sx.val.i == 0x00000004)
2445 else if (iptr->sx.val.i == 0x00000008)
2447 else if (iptr->sx.val.i == 0x00000010)
2449 else if (iptr->sx.val.i == 0x00000020)
2451 else if (iptr->sx.val.i == 0x00000040)
2453 else if (iptr->sx.val.i == 0x00000080)
2455 else if (iptr->sx.val.i == 0x00000100)
2457 else if (iptr->sx.val.i == 0x00000200)
2459 else if (iptr->sx.val.i == 0x00000400)
2460 iptr->sx.val.i = 10;
2461 else if (iptr->sx.val.i == 0x00000800)
2462 iptr->sx.val.i = 11;
2463 else if (iptr->sx.val.i == 0x00001000)
2464 iptr->sx.val.i = 12;
2465 else if (iptr->sx.val.i == 0x00002000)
2466 iptr->sx.val.i = 13;
2467 else if (iptr->sx.val.i == 0x00004000)
2468 iptr->sx.val.i = 14;
2469 else if (iptr->sx.val.i == 0x00008000)
2470 iptr->sx.val.i = 15;
2471 else if (iptr->sx.val.i == 0x00010000)
2472 iptr->sx.val.i = 16;
2473 else if (iptr->sx.val.i == 0x00020000)
2474 iptr->sx.val.i = 17;
2475 else if (iptr->sx.val.i == 0x00040000)
2476 iptr->sx.val.i = 18;
2477 else if (iptr->sx.val.i == 0x00080000)
2478 iptr->sx.val.i = 19;
2479 else if (iptr->sx.val.i == 0x00100000)
2480 iptr->sx.val.i = 20;
2481 else if (iptr->sx.val.i == 0x00200000)
2482 iptr->sx.val.i = 21;
2483 else if (iptr->sx.val.i == 0x00400000)
2484 iptr->sx.val.i = 22;
2485 else if (iptr->sx.val.i == 0x00800000)
2486 iptr->sx.val.i = 23;
2487 else if (iptr->sx.val.i == 0x01000000)
2488 iptr->sx.val.i = 24;
2489 else if (iptr->sx.val.i == 0x02000000)
2490 iptr->sx.val.i = 25;
2491 else if (iptr->sx.val.i == 0x04000000)
2492 iptr->sx.val.i = 26;
2493 else if (iptr->sx.val.i == 0x08000000)
2494 iptr->sx.val.i = 27;
2495 else if (iptr->sx.val.i == 0x10000000)
2496 iptr->sx.val.i = 28;
2497 else if (iptr->sx.val.i == 0x20000000)
2498 iptr->sx.val.i = 29;
2499 else if (iptr->sx.val.i == 0x40000000)
2500 iptr->sx.val.i = 30;
2501 else if (iptr->sx.val.i == 0x80000000)
2502 iptr->sx.val.i = 31;
2506 iptr->opc = ICMD_IDIVPOW2;
2507 goto icmd_iconst_tail;
2510 /*log_text("stack.c: ICMD_ICONST/ICMD_IREM");*/
2511 if ((iptr->sx.val.i == 0x00000002) ||
2512 (iptr->sx.val.i == 0x00000004) ||
2513 (iptr->sx.val.i == 0x00000008) ||
2514 (iptr->sx.val.i == 0x00000010) ||
2515 (iptr->sx.val.i == 0x00000020) ||
2516 (iptr->sx.val.i == 0x00000040) ||
2517 (iptr->sx.val.i == 0x00000080) ||
2518 (iptr->sx.val.i == 0x00000100) ||
2519 (iptr->sx.val.i == 0x00000200) ||
2520 (iptr->sx.val.i == 0x00000400) ||
2521 (iptr->sx.val.i == 0x00000800) ||
2522 (iptr->sx.val.i == 0x00001000) ||
2523 (iptr->sx.val.i == 0x00002000) ||
2524 (iptr->sx.val.i == 0x00004000) ||
2525 (iptr->sx.val.i == 0x00008000) ||
2526 (iptr->sx.val.i == 0x00010000) ||
2527 (iptr->sx.val.i == 0x00020000) ||
2528 (iptr->sx.val.i == 0x00040000) ||
2529 (iptr->sx.val.i == 0x00080000) ||
2530 (iptr->sx.val.i == 0x00100000) ||
2531 (iptr->sx.val.i == 0x00200000) ||
2532 (iptr->sx.val.i == 0x00400000) ||
2533 (iptr->sx.val.i == 0x00800000) ||
2534 (iptr->sx.val.i == 0x01000000) ||
2535 (iptr->sx.val.i == 0x02000000) ||
2536 (iptr->sx.val.i == 0x04000000) ||
2537 (iptr->sx.val.i == 0x08000000) ||
2538 (iptr->sx.val.i == 0x10000000) ||
2539 (iptr->sx.val.i == 0x20000000) ||
2540 (iptr->sx.val.i == 0x40000000) ||
2541 (iptr->sx.val.i == 0x80000000))
2543 iptr->opc = ICMD_IREMPOW2;
2544 iptr->sx.val.i -= 1;
2545 goto icmd_iconst_tail;
2548 #if SUPPORT_CONST_LOGICAL
2550 iptr->opc = ICMD_IANDCONST;
2551 goto icmd_iconst_tail;
2554 iptr->opc = ICMD_IORCONST;
2555 goto icmd_iconst_tail;
2558 iptr->opc = ICMD_IXORCONST;
2559 goto icmd_iconst_tail;
2561 #endif /* SUPPORT_CONST_LOGICAL */
2563 iptr->opc = ICMD_ISHLCONST;
2564 goto icmd_iconst_tail;
2567 iptr->opc = ICMD_ISHRCONST;
2568 goto icmd_iconst_tail;
2571 iptr->opc = ICMD_IUSHRCONST;
2572 goto icmd_iconst_tail;
2573 #if SUPPORT_LONG_SHIFT
2575 iptr->opc = ICMD_LSHLCONST;
2576 goto icmd_lconst_tail;
2579 iptr->opc = ICMD_LSHRCONST;
2580 goto icmd_lconst_tail;
2583 iptr->opc = ICMD_LUSHRCONST;
2584 goto icmd_lconst_tail;
2585 #endif /* SUPPORT_LONG_SHIFT */
2586 case ICMD_IF_ICMPEQ:
2587 iptr[1].opc = ICMD_IFEQ;
2591 /* set the constant for the following icmd */
2592 iptr[1].sx.val.i = iptr->sx.val.i;
2594 /* this instruction becomes a nop */
2595 iptr->opc = ICMD_NOP;
2598 case ICMD_IF_ICMPLT:
2599 iptr[1].opc = ICMD_IFLT;
2600 goto icmd_if_icmp_tail;
2602 case ICMD_IF_ICMPLE:
2603 iptr[1].opc = ICMD_IFLE;
2604 goto icmd_if_icmp_tail;
2606 case ICMD_IF_ICMPNE:
2607 iptr[1].opc = ICMD_IFNE;
2608 goto icmd_if_icmp_tail;
2610 case ICMD_IF_ICMPGT:
2611 iptr[1].opc = ICMD_IFGT;
2612 goto icmd_if_icmp_tail;
2614 case ICMD_IF_ICMPGE:
2615 iptr[1].opc = ICMD_IFGE;
2616 goto icmd_if_icmp_tail;
2618 #if SUPPORT_CONST_STORE
2623 # if SUPPORT_CONST_STORE_ZERO_ONLY
2624 if (iptr->sx.val.i != 0)
2627 switch (iptr[1].opc) {
2629 iptr->opc = ICMD_IASTORECONST;
2630 iptr->flags.bits |= INS_FLAG_CHECK;
2633 iptr->opc = ICMD_BASTORECONST;
2634 iptr->flags.bits |= INS_FLAG_CHECK;
2637 iptr->opc = ICMD_CASTORECONST;
2638 iptr->flags.bits |= INS_FLAG_CHECK;
2641 iptr->opc = ICMD_SASTORECONST;
2642 iptr->flags.bits |= INS_FLAG_CHECK;
2646 iptr[1].opc = ICMD_NOP;
2648 /* copy the constant to s3 */
2649 /* XXX constval -> astoreconstval? */
2650 iptr->sx.s23.s3.constval = iptr->sx.val.i;
2651 OP2_0(TYPE_ADR, TYPE_INT);
2652 COUNT(count_pcmd_op);
2655 case ICMD_PUTSTATIC:
2657 # if SUPPORT_CONST_STORE_ZERO_ONLY
2658 if (iptr->sx.val.i != 0)
2661 /* XXX check field type? */
2663 /* copy the constant to s2 */
2664 /* XXX constval -> fieldconstval? */
2665 iptr->sx.s23.s2.constval = iptr->sx.val.i;
2668 /* set the field reference (s3) */
2669 if (iptr[1].flags.bits & INS_FLAG_UNRESOLVED) {
2670 iptr->sx.s23.s3.uf = iptr[1].sx.s23.s3.uf;
2671 iptr->flags.bits |= INS_FLAG_UNRESOLVED;
2672 fmiref = iptr->sx.s23.s3.uf->fieldref;
2675 fmiref = iptr[1].sx.s23.s3.fmiref;
2676 iptr->sx.s23.s3.fmiref = fmiref;
2679 #if defined(ENABLE_VERIFIER)
2680 expectedtype = fmiref->parseddesc.fd->type;
2681 switch (iptr[0].opc) {
2683 if (expectedtype != TYPE_INT)
2684 goto throw_stack_type_error;
2687 if (expectedtype != TYPE_LNG)
2688 goto throw_stack_type_error;
2691 if (expectedtype != TYPE_ADR)
2692 goto throw_stack_type_error;
2697 #endif /* defined(ENABLE_VERIFIER) */
2699 switch (iptr[1].opc) {
2700 case ICMD_PUTSTATIC:
2701 iptr->opc = ICMD_PUTSTATICCONST;
2705 iptr->opc = ICMD_PUTFIELDCONST;
2710 iptr[1].opc = ICMD_NOP;
2711 COUNT(count_pcmd_op);
2713 #endif /* SUPPORT_CONST_STORE */
2719 /* if we get here, the ICONST has been optimized */
2723 /* normal case of an unoptimized ICONST */
2727 /************************** LCONST OPTIMIZATIONS **************************/
2730 COUNT(count_pcmd_load);
2734 /* switch depending on the following instruction */
2736 switch (iptr[1].opc) {
2737 #if SUPPORT_LONG_ADD
2739 iptr->opc = ICMD_LADDCONST;
2743 /* instruction of type LONG -> LONG */
2744 iptr[1].opc = ICMD_NOP;
2745 OP1_1(TYPE_LNG, TYPE_LNG);
2746 COUNT(count_pcmd_op);
2750 iptr->opc = ICMD_LSUBCONST;
2751 goto icmd_lconst_tail;
2753 #endif /* SUPPORT_LONG_ADD */
2754 #if SUPPORT_LONG_MUL && SUPPORT_CONST_MUL
2756 iptr->opc = ICMD_LMULCONST;
2757 goto icmd_lconst_tail;
2758 #else /* SUPPORT_LONG_MUL && SUPPORT_CONST_MUL */
2759 # if SUPPORT_LONG_SHIFT
2761 if (iptr->sx.val.l == 0x00000002)
2763 else if (iptr->sx.val.l == 0x00000004)
2765 else if (iptr->sx.val.l == 0x00000008)
2767 else if (iptr->sx.val.l == 0x00000010)
2769 else if (iptr->sx.val.l == 0x00000020)
2771 else if (iptr->sx.val.l == 0x00000040)
2773 else if (iptr->sx.val.l == 0x00000080)
2775 else if (iptr->sx.val.l == 0x00000100)
2777 else if (iptr->sx.val.l == 0x00000200)
2779 else if (iptr->sx.val.l == 0x00000400)
2780 iptr->sx.val.i = 10;
2781 else if (iptr->sx.val.l == 0x00000800)
2782 iptr->sx.val.i = 11;
2783 else if (iptr->sx.val.l == 0x00001000)
2784 iptr->sx.val.i = 12;
2785 else if (iptr->sx.val.l == 0x00002000)
2786 iptr->sx.val.i = 13;
2787 else if (iptr->sx.val.l == 0x00004000)
2788 iptr->sx.val.i = 14;
2789 else if (iptr->sx.val.l == 0x00008000)
2790 iptr->sx.val.i = 15;
2791 else if (iptr->sx.val.l == 0x00010000)
2792 iptr->sx.val.i = 16;
2793 else if (iptr->sx.val.l == 0x00020000)
2794 iptr->sx.val.i = 17;
2795 else if (iptr->sx.val.l == 0x00040000)
2796 iptr->sx.val.i = 18;
2797 else if (iptr->sx.val.l == 0x00080000)
2798 iptr->sx.val.i = 19;
2799 else if (iptr->sx.val.l == 0x00100000)
2800 iptr->sx.val.i = 20;
2801 else if (iptr->sx.val.l == 0x00200000)
2802 iptr->sx.val.i = 21;
2803 else if (iptr->sx.val.l == 0x00400000)
2804 iptr->sx.val.i = 22;
2805 else if (iptr->sx.val.l == 0x00800000)
2806 iptr->sx.val.i = 23;
2807 else if (iptr->sx.val.l == 0x01000000)
2808 iptr->sx.val.i = 24;
2809 else if (iptr->sx.val.l == 0x02000000)
2810 iptr->sx.val.i = 25;
2811 else if (iptr->sx.val.l == 0x04000000)
2812 iptr->sx.val.i = 26;
2813 else if (iptr->sx.val.l == 0x08000000)
2814 iptr->sx.val.i = 27;
2815 else if (iptr->sx.val.l == 0x10000000)
2816 iptr->sx.val.i = 28;
2817 else if (iptr->sx.val.l == 0x20000000)
2818 iptr->sx.val.i = 29;
2819 else if (iptr->sx.val.l == 0x40000000)
2820 iptr->sx.val.i = 30;
2821 else if (iptr->sx.val.l == 0x80000000)
2822 iptr->sx.val.i = 31;
2826 iptr->opc = ICMD_LMULPOW2;
2827 goto icmd_lconst_tail;
2828 # endif /* SUPPORT_LONG_SHIFT */
2829 #endif /* SUPPORT_LONG_MUL && SUPPORT_CONST_MUL */
2830 #if SUPPORT_LONG_DIV_POW2
2832 if (iptr->sx.val.l == 0x00000002)
2834 else if (iptr->sx.val.l == 0x00000004)
2836 else if (iptr->sx.val.l == 0x00000008)
2838 else if (iptr->sx.val.l == 0x00000010)
2840 else if (iptr->sx.val.l == 0x00000020)
2842 else if (iptr->sx.val.l == 0x00000040)
2844 else if (iptr->sx.val.l == 0x00000080)
2846 else if (iptr->sx.val.l == 0x00000100)
2848 else if (iptr->sx.val.l == 0x00000200)
2850 else if (iptr->sx.val.l == 0x00000400)
2851 iptr->sx.val.i = 10;
2852 else if (iptr->sx.val.l == 0x00000800)
2853 iptr->sx.val.i = 11;
2854 else if (iptr->sx.val.l == 0x00001000)
2855 iptr->sx.val.i = 12;
2856 else if (iptr->sx.val.l == 0x00002000)
2857 iptr->sx.val.i = 13;
2858 else if (iptr->sx.val.l == 0x00004000)
2859 iptr->sx.val.i = 14;
2860 else if (iptr->sx.val.l == 0x00008000)
2861 iptr->sx.val.i = 15;
2862 else if (iptr->sx.val.l == 0x00010000)
2863 iptr->sx.val.i = 16;
2864 else if (iptr->sx.val.l == 0x00020000)
2865 iptr->sx.val.i = 17;
2866 else if (iptr->sx.val.l == 0x00040000)
2867 iptr->sx.val.i = 18;
2868 else if (iptr->sx.val.l == 0x00080000)
2869 iptr->sx.val.i = 19;
2870 else if (iptr->sx.val.l == 0x00100000)
2871 iptr->sx.val.i = 20;
2872 else if (iptr->sx.val.l == 0x00200000)
2873 iptr->sx.val.i = 21;
2874 else if (iptr->sx.val.l == 0x00400000)
2875 iptr->sx.val.i = 22;
2876 else if (iptr->sx.val.l == 0x00800000)
2877 iptr->sx.val.i = 23;
2878 else if (iptr->sx.val.l == 0x01000000)
2879 iptr->sx.val.i = 24;
2880 else if (iptr->sx.val.l == 0x02000000)
2881 iptr->sx.val.i = 25;
2882 else if (iptr->sx.val.l == 0x04000000)
2883 iptr->sx.val.i = 26;
2884 else if (iptr->sx.val.l == 0x08000000)
2885 iptr->sx.val.i = 27;
2886 else if (iptr->sx.val.l == 0x10000000)
2887 iptr->sx.val.i = 28;
2888 else if (iptr->sx.val.l == 0x20000000)
2889 iptr->sx.val.i = 29;
2890 else if (iptr->sx.val.l == 0x40000000)
2891 iptr->sx.val.i = 30;
2892 else if (iptr->sx.val.l == 0x80000000)
2893 iptr->sx.val.i = 31;
2897 iptr->opc = ICMD_LDIVPOW2;
2898 goto icmd_lconst_tail;
2899 #endif /* SUPPORT_LONG_DIV_POW2 */
2901 #if SUPPORT_LONG_REM_POW2
2903 if ((iptr->sx.val.l == 0x00000002) ||
2904 (iptr->sx.val.l == 0x00000004) ||
2905 (iptr->sx.val.l == 0x00000008) ||
2906 (iptr->sx.val.l == 0x00000010) ||
2907 (iptr->sx.val.l == 0x00000020) ||
2908 (iptr->sx.val.l == 0x00000040) ||
2909 (iptr->sx.val.l == 0x00000080) ||
2910 (iptr->sx.val.l == 0x00000100) ||
2911 (iptr->sx.val.l == 0x00000200) ||
2912 (iptr->sx.val.l == 0x00000400) ||
2913 (iptr->sx.val.l == 0x00000800) ||
2914 (iptr->sx.val.l == 0x00001000) ||
2915 (iptr->sx.val.l == 0x00002000) ||
2916 (iptr->sx.val.l == 0x00004000) ||
2917 (iptr->sx.val.l == 0x00008000) ||
2918 (iptr->sx.val.l == 0x00010000) ||
2919 (iptr->sx.val.l == 0x00020000) ||
2920 (iptr->sx.val.l == 0x00040000) ||
2921 (iptr->sx.val.l == 0x00080000) ||
2922 (iptr->sx.val.l == 0x00100000) ||
2923 (iptr->sx.val.l == 0x00200000) ||
2924 (iptr->sx.val.l == 0x00400000) ||
2925 (iptr->sx.val.l == 0x00800000) ||
2926 (iptr->sx.val.l == 0x01000000) ||
2927 (iptr->sx.val.l == 0x02000000) ||
2928 (iptr->sx.val.l == 0x04000000) ||
2929 (iptr->sx.val.l == 0x08000000) ||
2930 (iptr->sx.val.l == 0x10000000) ||
2931 (iptr->sx.val.l == 0x20000000) ||
2932 (iptr->sx.val.l == 0x40000000) ||
2933 (iptr->sx.val.l == 0x80000000))
2935 iptr->opc = ICMD_LREMPOW2;
2936 iptr->sx.val.l -= 1;
2937 goto icmd_lconst_tail;
2940 #endif /* SUPPORT_LONG_REM_POW2 */
2942 #if SUPPORT_LONG_LOGICAL && SUPPORT_CONST_LOGICAL
2945 iptr->opc = ICMD_LANDCONST;
2946 goto icmd_lconst_tail;
2949 iptr->opc = ICMD_LORCONST;
2950 goto icmd_lconst_tail;
2953 iptr->opc = ICMD_LXORCONST;
2954 goto icmd_lconst_tail;
2955 #endif /* SUPPORT_LONG_LOGICAL && SUPPORT_CONST_LOGICAL */
2957 #if SUPPORT_LONG_CMP_CONST
2959 if ((len <= 1) || (iptr[2].sx.val.i != 0))
2962 /* switch on the instruction after LCONST - LCMP */
2964 switch (iptr[2].opc) {
2966 iptr->opc = ICMD_IF_LEQ;
2969 icmd_lconst_lcmp_tail:
2970 /* convert LCONST, LCMP, IFXX to IF_LXX */
2971 iptr->dst.block = iptr[2].dst.block;
2972 iptr[1].opc = ICMD_NOP;
2973 iptr[2].opc = ICMD_NOP;
2975 OP1_BRANCH(TYPE_LNG);
2977 COUNT(count_pcmd_bra);
2978 COUNT(count_pcmd_op);
2982 iptr->opc = ICMD_IF_LNE;
2983 goto icmd_lconst_lcmp_tail;
2986 iptr->opc = ICMD_IF_LLT;
2987 goto icmd_lconst_lcmp_tail;
2990 iptr->opc = ICMD_IF_LGT;
2991 goto icmd_lconst_lcmp_tail;
2994 iptr->opc = ICMD_IF_LLE;
2995 goto icmd_lconst_lcmp_tail;
2998 iptr->opc = ICMD_IF_LGE;
2999 goto icmd_lconst_lcmp_tail;
3003 } /* end switch on opcode after LCONST - LCMP */
3005 #endif /* SUPPORT_LONG_CMP_CONST */
3007 #if SUPPORT_CONST_STORE
3009 # if SUPPORT_CONST_STORE_ZERO_ONLY
3010 if (iptr->sx.val.l != 0)
3013 #if SIZEOF_VOID_P == 4
3014 /* the constant must fit into a ptrint */
3015 if (iptr->sx.val.l < -0x80000000L || iptr->sx.val.l >= 0x80000000L)
3018 /* move the constant to s3 */
3019 iptr->sx.s23.s3.constval = iptr->sx.val.l;
3021 iptr->opc = ICMD_LASTORECONST;
3022 iptr->flags.bits |= INS_FLAG_CHECK;
3023 OP2_0(TYPE_ADR, TYPE_INT);
3025 iptr[1].opc = ICMD_NOP;
3026 COUNT(count_pcmd_op);
3029 case ICMD_PUTSTATIC:
3031 # if SUPPORT_CONST_STORE_ZERO_ONLY
3032 if (iptr->sx.val.l != 0)
3035 #if SIZEOF_VOID_P == 4
3036 /* the constant must fit into a ptrint */
3037 if (iptr->sx.val.l < -0x80000000L || iptr->sx.val.l >= 0x80000000L)
3040 /* XXX check field type? */
3042 /* copy the constant to s2 */
3043 /* XXX constval -> fieldconstval? */
3044 iptr->sx.s23.s2.constval = iptr->sx.val.l;
3048 #endif /* SUPPORT_CONST_STORE */
3052 } /* end switch opcode after LCONST */
3054 /* if we get here, the LCONST has been optimized */
3058 /* the normal case of an unoptimized LCONST */
3062 /************************ END OF LCONST OPTIMIZATIONS *********************/
3065 COUNT(count_pcmd_load);
3070 COUNT(count_pcmd_load);
3074 /************************** ACONST OPTIMIZATIONS **************************/
3077 coalescing_boundary = sd.new;
3078 COUNT(count_pcmd_load);
3079 #if SUPPORT_CONST_STORE
3080 /* We can only optimize if the ACONST is resolved
3081 * and there is an instruction after it. */
3083 if ((len == 0) || (iptr->flags.bits & INS_FLAG_UNRESOLVED))
3086 switch (iptr[1].opc) {
3088 /* We can only optimize for NULL values
3089 * here because otherwise a checkcast is
3091 if (iptr->sx.val.anyptr != NULL)
3094 /* copy the constant (NULL) to s3 */
3095 iptr->sx.s23.s3.constval = 0;
3096 iptr->opc = ICMD_AASTORECONST;
3097 iptr->flags.bits |= INS_FLAG_CHECK;
3098 OP2_0(TYPE_ADR, TYPE_INT);
3100 iptr[1].opc = ICMD_NOP;
3101 COUNT(count_pcmd_op);
3104 case ICMD_PUTSTATIC:
3106 # if SUPPORT_CONST_STORE_ZERO_ONLY
3107 if (iptr->sx.val.anyptr != NULL)
3110 /* XXX check field type? */
3111 /* copy the constant to s2 */
3112 /* XXX constval -> fieldconstval? */
3113 iptr->sx.s23.s2.constval = (ptrint) iptr->sx.val.anyptr;
3121 /* if we get here the ACONST has been optimized */
3125 #endif /* SUPPORT_CONST_STORE */
3130 /* pop 0 push 1 load */
3137 COUNT(count_load_instruction);
3138 type = opcode - ICMD_ILOAD;
3140 varindex = iptr->s1.varindex =
3141 jd->local_map[iptr->s1.varindex * 5 + type];
3143 #if defined(ENABLE_VERIFIER)
3144 if (sd.var[varindex].type == TYPE_RET) {
3145 exceptions_throw_verifyerror(m, "forbidden load of returnAddress");
3149 LOAD(type, varindex);
3158 coalescing_boundary = sd.new;
3159 iptr->flags.bits |= INS_FLAG_CHECK;
3160 COUNT(count_check_null);
3161 COUNT(count_check_bound);
3162 COUNT(count_pcmd_mem);
3163 OP2_1(TYPE_ADR, TYPE_INT, opcode - ICMD_IALOAD);
3170 coalescing_boundary = sd.new;
3171 iptr->flags.bits |= INS_FLAG_CHECK;
3172 COUNT(count_check_null);
3173 COUNT(count_check_bound);
3174 COUNT(count_pcmd_mem);
3175 OP2_1(TYPE_ADR, TYPE_INT, TYPE_INT);
3178 /* pop 0 push 0 iinc */
3181 STATISTICS_STACKDEPTH_DISTRIBUTION(count_store_depth);
3182 last_store_boundary[iptr->s1.varindex] = sd.new;
3185 jd->local_map[iptr->s1.varindex * 5 + TYPE_INT];
3190 if ((copy->varkind == LOCALVAR) &&
3191 (copy->varnum == iptr->s1.varindex))
3193 assert(IS_LOCALVAR(copy));
3200 iptr->dst.varindex = iptr->s1.varindex;
3203 /* pop 1 push 0 store */
3212 type = opcode - ICMD_ISTORE;
3213 javaindex = iptr->dst.varindex;
3214 varindex = iptr->dst.varindex =
3215 jd->local_map[javaindex * 5 + type];
3217 COPY_VAL_AND_TYPE(sd, curstack->varnum, varindex);
3219 iptr->sx.s23.s3.javaindex = javaindex;
3221 if (curstack->type == TYPE_RET) {
3222 iptr->flags.bits |= INS_FLAG_RETADDR;
3223 iptr->sx.s23.s2.retaddrnr =
3224 JAVALOCAL_FROM_RETADDR(sd.var[varindex].vv.retaddr->nr);
3225 sd.javalocals[javaindex] = iptr->sx.s23.s2.retaddrnr;
3228 sd.javalocals[javaindex] = varindex;
3230 /* invalidate the following javalocal for 2-word types */
3232 if (IS_2_WORD_TYPE(type)) {
3233 sd.javalocals[javaindex+1] = UNUSED;
3234 iptr->flags.bits |= INS_FLAG_KILL_NEXT;
3237 /* invalidate 2-word types if second half was overwritten */
3239 if (javaindex > 0 && (i = sd.javalocals[javaindex-1]) >= 0) {
3240 if (IS_2_WORD_TYPE(sd.var[i].type)) {
3241 sd.javalocals[javaindex-1] = UNUSED;
3242 iptr->flags.bits |= INS_FLAG_KILL_PREV;
3246 #if defined(ENABLE_STATISTICS)
3249 i = sd.new - curstack;
3251 count_store_length[20]++;
3253 count_store_length[i]++;
3256 count_store_depth[10]++;
3258 count_store_depth[i]++;
3262 /* check for conflicts as described in Figure 5.2 */
3264 copy = curstack->prev;
3267 if ((copy->varkind == LOCALVAR) &&
3268 (copy->varnum == varindex))
3270 copy->varkind = TEMPVAR;
3271 assert(IS_LOCALVAR(copy));
3278 /* if the variable is already coalesced, don't bother */
3280 /* We do not need to check against INOUT, as invars */
3281 /* are always before the coalescing boundary. */
3283 if (curstack->varkind == LOCALVAR)
3286 /* there is no STORE Lj while curstack is live */
3288 if (curstack < last_store_boundary[javaindex])
3289 goto assume_conflict;
3291 /* curstack must be after the coalescing boundary */
3293 if (curstack < coalescing_boundary)
3294 goto assume_conflict;
3296 /* there is no DEF LOCALVAR(varindex) while curstack is live */
3298 copy = sd.new; /* most recent stackslot created + 1 */
3299 while (--copy > curstack) {
3300 if (copy->varkind == LOCALVAR && copy->varnum == varindex)
3301 goto assume_conflict;
3304 /* coalesce the temporary variable with Lj */
3305 assert((curstack->varkind == TEMPVAR)
3306 || (curstack->varkind == UNDEFVAR));
3307 assert(!IS_LOCALVAR(curstack)); /* XXX correct? */
3308 assert(!IS_INOUT(curstack));
3309 assert(!IS_PREALLOC(curstack));
3311 assert(curstack->creator);
3312 assert(curstack->creator->dst.varindex == curstack->varnum);
3313 assert(!(curstack->flags & PASSTHROUGH));
3314 RELEASE_INDEX(sd, curstack);
3315 curstack->varkind = LOCALVAR;
3316 curstack->varnum = varindex;
3317 curstack->creator->dst.varindex = varindex;
3320 /* revert the coalescing, if it has been done earlier */
3322 if ((curstack->varkind == LOCALVAR)
3323 && (curstack->varnum == varindex))
3325 assert(IS_LOCALVAR(curstack));
3326 SET_TEMPVAR(curstack);
3329 /* remember the stack boundary at this store */
3331 last_store_boundary[javaindex] = sd.new;
3333 if (opcode == ICMD_ASTORE && curstack->type == TYPE_RET)
3334 STORE(TYPE_RET, varindex);
3336 STORE(opcode - ICMD_ISTORE, varindex);
3342 coalescing_boundary = sd.new;
3343 iptr->flags.bits |= INS_FLAG_CHECK;
3344 COUNT(count_check_null);
3345 COUNT(count_check_bound);
3346 COUNT(count_pcmd_mem);
3348 bte = builtintable_get_internal(BUILTIN_FAST_canstore);
3351 if (md->memuse > rd->memuse)
3352 rd->memuse = md->memuse;
3353 if (md->argintreguse > rd->argintreguse)
3354 rd->argintreguse = md->argintreguse;
3355 /* XXX non-leaf method? */
3357 /* make all stack variables saved */
3361 sd.var[copy->varnum].flags |= SAVEDVAR;
3362 /* in case copy->varnum is/will be a LOCALVAR */
3363 /* once and set back to a non LOCALVAR */
3364 /* the correct SAVEDVAR flag has to be */
3365 /* remembered in copy->flags, too */
3366 copy->flags |= SAVEDVAR;
3370 OP3_0(TYPE_ADR, TYPE_INT, TYPE_ADR);
3377 coalescing_boundary = sd.new;
3378 iptr->flags.bits |= INS_FLAG_CHECK;
3379 COUNT(count_check_null);
3380 COUNT(count_check_bound);
3381 COUNT(count_pcmd_mem);
3382 OP3_0(TYPE_ADR, TYPE_INT, opcode - ICMD_IASTORE);
3389 coalescing_boundary = sd.new;
3390 iptr->flags.bits |= INS_FLAG_CHECK;
3391 COUNT(count_check_null);
3392 COUNT(count_check_bound);
3393 COUNT(count_pcmd_mem);
3394 OP3_0(TYPE_ADR, TYPE_INT, TYPE_INT);
3400 #ifdef ENABLE_VERIFIER
3403 if (IS_2_WORD_TYPE(curstack->type))
3404 goto throw_stack_category_error;
3415 coalescing_boundary = sd.new;
3416 /* Assert here that no LOCAL or INOUTS get */
3417 /* preallocated, since tha macros are not */
3418 /* available in md-abi.c! */
3419 if (IS_TEMPVAR(curstack))
3420 md_return_alloc(jd, curstack);
3421 COUNT(count_pcmd_return);
3422 OP1_0(opcode - ICMD_IRETURN);
3423 superblockend = true;
3424 sd.jd->returncount++;
3425 sd.jd->returnblock = sd.bptr;
3429 coalescing_boundary = sd.new;
3430 COUNT(count_check_null);
3432 curstack = NULL; stackdepth = 0;
3433 superblockend = true;
3436 case ICMD_PUTSTATIC:
3437 coalescing_boundary = sd.new;
3438 COUNT(count_pcmd_mem);
3439 INSTRUCTION_GET_FIELDREF(iptr, fmiref);
3440 OP1_0(fmiref->parseddesc.fd->type);
3443 /* pop 1 push 0 branch */
3446 case ICMD_IFNONNULL:
3447 COUNT(count_pcmd_bra);
3448 OP1_BRANCH(TYPE_ADR);
3458 COUNT(count_pcmd_bra);
3459 /* iptr->sx.val.i is set implicitly in parse by
3460 clearing the memory or from IF_ICMPxx
3463 OP1_BRANCH(TYPE_INT);
3464 /* iptr->sx.val.i = 0; */
3468 /* pop 0 push 0 branch */
3471 COUNT(count_pcmd_bra);
3474 superblockend = true;
3477 /* pop 1 push 0 table branch */
3479 case ICMD_TABLESWITCH:
3480 COUNT(count_pcmd_table);
3481 OP1_BRANCH(TYPE_INT);
3483 table = iptr->dst.table;
3484 BRANCH_TARGET(*table, tbptr);
3487 i = iptr->sx.s23.s3.tablehigh
3488 - iptr->sx.s23.s2.tablelow + 1;
3491 BRANCH_TARGET(*table, tbptr);
3494 superblockend = true;
3497 /* pop 1 push 0 table branch */
3499 case ICMD_LOOKUPSWITCH:
3500 COUNT(count_pcmd_table);
3501 OP1_BRANCH(TYPE_INT);
3503 BRANCH_TARGET(iptr->sx.s23.s3.lookupdefault, tbptr);
3505 lookup = iptr->dst.lookup;
3507 i = iptr->sx.s23.s2.lookupcount;
3510 BRANCH_TARGET(lookup->target, tbptr);
3513 superblockend = true;
3516 case ICMD_MONITORENTER:
3517 case ICMD_MONITOREXIT:
3518 coalescing_boundary = sd.new;
3519 COUNT(count_check_null);
3523 /* pop 2 push 0 branch */
3525 case ICMD_IF_ICMPEQ:
3526 case ICMD_IF_ICMPNE:
3527 case ICMD_IF_ICMPLT:
3528 case ICMD_IF_ICMPGE:
3529 case ICMD_IF_ICMPGT:
3530 case ICMD_IF_ICMPLE:
3531 COUNT(count_pcmd_bra);
3532 OP2_BRANCH(TYPE_INT, TYPE_INT);
3536 case ICMD_IF_ACMPEQ:
3537 case ICMD_IF_ACMPNE:
3538 COUNT(count_pcmd_bra);
3539 OP2_BRANCH(TYPE_ADR, TYPE_ADR);
3546 coalescing_boundary = sd.new;
3547 COUNT(count_check_null);
3548 COUNT(count_pcmd_mem);
3549 INSTRUCTION_GET_FIELDREF(iptr, fmiref);
3550 OP2_0(TYPE_ADR, fmiref->parseddesc.fd->type);
3555 if (!IS_2_WORD_TYPE(curstack->type)) {
3557 #ifdef ENABLE_VERIFIER
3560 if (IS_2_WORD_TYPE(curstack->prev->type))
3561 goto throw_stack_category_error;
3564 OP2_0_ANY_ANY; /* pop two slots */
3567 iptr->opc = ICMD_POP;
3568 OP1_0_ANY; /* pop one (two-word) slot */
3572 /* pop 0 push 1 dup */
3575 #ifdef ENABLE_VERIFIER
3578 if (IS_2_WORD_TYPE(curstack->type))
3579 goto throw_stack_category_error;
3582 COUNT(count_dup_instruction);
3588 coalescing_boundary = sd.new - 1;
3593 if (IS_2_WORD_TYPE(curstack->type)) {
3595 iptr->opc = ICMD_DUP;
3600 /* ..., ????, cat1 */
3601 #ifdef ENABLE_VERIFIER
3603 if (IS_2_WORD_TYPE(curstack->prev->type))
3604 goto throw_stack_category_error;
3607 src1 = curstack->prev;
3610 COPY_UP(src1); iptr++; len--;
3613 coalescing_boundary = sd.new;
3617 /* pop 2 push 3 dup */
3620 #ifdef ENABLE_VERIFIER
3623 if (IS_2_WORD_TYPE(curstack->type) ||
3624 IS_2_WORD_TYPE(curstack->prev->type))
3625 goto throw_stack_category_error;
3630 src1 = curstack->prev;
3635 /* move non-temporary sources out of the way */
3636 if (!IS_TEMPVAR(src2)) {
3637 MOVE_TO_TEMP(src2); iptr++; len--;
3640 DUP_SLOT(src2); dst1 = curstack; stackdepth++;
3642 MOVE_UP(src1); iptr++; len--;
3643 MOVE_UP(src2); iptr++; len--;
3645 COPY_DOWN(curstack, dst1);
3647 coalescing_boundary = sd.new;
3652 if (IS_2_WORD_TYPE(curstack->type)) {
3653 /* ..., ????, cat2 */
3654 #ifdef ENABLE_VERIFIER
3656 if (IS_2_WORD_TYPE(curstack->prev->type))
3657 goto throw_stack_category_error;
3660 iptr->opc = ICMD_DUP_X1;
3664 /* ..., ????, cat1 */
3665 #ifdef ENABLE_VERIFIER
3668 if (IS_2_WORD_TYPE(curstack->prev->type)
3669 || IS_2_WORD_TYPE(curstack->prev->prev->type))
3670 goto throw_stack_category_error;
3675 src1 = curstack->prev->prev;
3676 src2 = curstack->prev;
3678 POPANY; POPANY; POPANY;
3681 /* move non-temporary sources out of the way */
3682 if (!IS_TEMPVAR(src2)) {
3683 MOVE_TO_TEMP(src2); iptr++; len--;
3685 if (!IS_TEMPVAR(src3)) {
3686 MOVE_TO_TEMP(src3); iptr++; len--;
3689 DUP_SLOT(src2); dst1 = curstack; stackdepth++;
3690 DUP_SLOT(src3); dst2 = curstack; stackdepth++;
3692 MOVE_UP(src1); iptr++; len--;
3693 MOVE_UP(src2); iptr++; len--;
3694 MOVE_UP(src3); iptr++; len--;
3696 COPY_DOWN(curstack, dst2); iptr++; len--;
3697 COPY_DOWN(curstack->prev, dst1);
3699 coalescing_boundary = sd.new;
3703 /* pop 3 push 4 dup */
3707 if (IS_2_WORD_TYPE(curstack->prev->type)) {
3708 /* ..., cat2, ???? */
3709 #ifdef ENABLE_VERIFIER
3711 if (IS_2_WORD_TYPE(curstack->type))
3712 goto throw_stack_category_error;
3715 iptr->opc = ICMD_DUP_X1;
3719 /* ..., cat1, ???? */
3720 #ifdef ENABLE_VERIFIER
3723 if (IS_2_WORD_TYPE(curstack->type)
3724 || IS_2_WORD_TYPE(curstack->prev->prev->type))
3725 goto throw_stack_category_error;
3729 src1 = curstack->prev->prev;
3730 src2 = curstack->prev;
3732 POPANY; POPANY; POPANY;
3735 /* move non-temporary sources out of the way */
3736 if (!IS_TEMPVAR(src2)) {
3737 MOVE_TO_TEMP(src2); iptr++; len--;
3739 if (!IS_TEMPVAR(src3)) {
3740 MOVE_TO_TEMP(src3); iptr++; len--;
3743 DUP_SLOT(src3); dst1 = curstack; stackdepth++;
3745 MOVE_UP(src1); iptr++; len--;
3746 MOVE_UP(src2); iptr++; len--;
3747 MOVE_UP(src3); iptr++; len--;
3749 COPY_DOWN(curstack, dst1);
3751 coalescing_boundary = sd.new;
3757 if (IS_2_WORD_TYPE(curstack->type)) {
3758 /* ..., ????, cat2 */
3759 if (IS_2_WORD_TYPE(curstack->prev->type)) {
3760 /* ..., cat2, cat2 */
3761 iptr->opc = ICMD_DUP_X1;
3765 /* ..., cat1, cat2 */
3766 #ifdef ENABLE_VERIFIER
3769 if (IS_2_WORD_TYPE(curstack->prev->prev->type))
3770 goto throw_stack_category_error;
3773 iptr->opc = ICMD_DUP_X2;
3779 /* ..., ????, ????, cat1 */
3781 if (IS_2_WORD_TYPE(curstack->prev->prev->type)) {
3782 /* ..., cat2, ????, cat1 */
3783 #ifdef ENABLE_VERIFIER
3785 if (IS_2_WORD_TYPE(curstack->prev->type))
3786 goto throw_stack_category_error;
3789 iptr->opc = ICMD_DUP2_X1;
3793 /* ..., cat1, ????, cat1 */
3794 #ifdef ENABLE_VERIFIER
3797 if (IS_2_WORD_TYPE(curstack->prev->type)
3798 || IS_2_WORD_TYPE(curstack->prev->prev->prev->type))
3799 goto throw_stack_category_error;
3803 src1 = curstack->prev->prev->prev;
3804 src2 = curstack->prev->prev;
3805 src3 = curstack->prev;
3807 POPANY; POPANY; POPANY; POPANY;
3810 /* move non-temporary sources out of the way */
3811 if (!IS_TEMPVAR(src2)) {
3812 MOVE_TO_TEMP(src2); iptr++; len--;
3814 if (!IS_TEMPVAR(src3)) {
3815 MOVE_TO_TEMP(src3); iptr++; len--;
3817 if (!IS_TEMPVAR(src4)) {
3818 MOVE_TO_TEMP(src4); iptr++; len--;
3821 DUP_SLOT(src3); dst1 = curstack; stackdepth++;
3822 DUP_SLOT(src4); dst2 = curstack; stackdepth++;
3824 MOVE_UP(src1); iptr++; len--;
3825 MOVE_UP(src2); iptr++; len--;
3826 MOVE_UP(src3); iptr++; len--;
3827 MOVE_UP(src4); iptr++; len--;
3829 COPY_DOWN(curstack, dst2); iptr++; len--;
3830 COPY_DOWN(curstack->prev, dst1);
3832 coalescing_boundary = sd.new;
3836 /* pop 2 push 2 swap */
3839 #ifdef ENABLE_VERIFIER
3842 if (IS_2_WORD_TYPE(curstack->type)
3843 || IS_2_WORD_TYPE(curstack->prev->type))
3844 goto throw_stack_category_error;
3848 src1 = curstack->prev;
3853 /* move non-temporary sources out of the way */
3854 if (!IS_TEMPVAR(src1)) {
3855 MOVE_TO_TEMP(src1); iptr++; len--;
3858 MOVE_UP(src2); iptr++; len--;
3861 coalescing_boundary = sd.new;
3868 coalescing_boundary = sd.new;
3869 #if !SUPPORT_DIVISION
3870 bte = iptr->sx.s23.s3.bte;
3873 if (md->memuse > rd->memuse)
3874 rd->memuse = md->memuse;
3875 if (md->argintreguse > rd->argintreguse)
3876 rd->argintreguse = md->argintreguse;
3878 /* make all stack variables saved */
3882 sd.var[copy->varnum].flags |= SAVEDVAR;
3883 copy->flags |= SAVEDVAR;
3888 #endif /* !SUPPORT_DIVISION */
3899 COUNT(count_pcmd_op);
3900 OP2_1(TYPE_INT, TYPE_INT, TYPE_INT);
3905 coalescing_boundary = sd.new;
3906 #if !(SUPPORT_DIVISION && SUPPORT_LONG && SUPPORT_LONG_DIV)
3907 bte = iptr->sx.s23.s3.bte;
3910 if (md->memuse > rd->memuse)
3911 rd->memuse = md->memuse;
3912 if (md->argintreguse > rd->argintreguse)
3913 rd->argintreguse = md->argintreguse;
3914 /* XXX non-leaf method? */
3916 /* make all stack variables saved */
3920 sd.var[copy->varnum].flags |= SAVEDVAR;
3921 copy->flags |= SAVEDVAR;
3926 #endif /* !(SUPPORT_DIVISION && SUPPORT_LONG && SUPPORT_LONG_DIV) */
3931 #if SUPPORT_LONG_LOGICAL
3935 #endif /* SUPPORT_LONG_LOGICAL */
3936 COUNT(count_pcmd_op);
3937 OP2_1(TYPE_LNG, TYPE_LNG, TYPE_LNG);
3943 COUNT(count_pcmd_op);
3944 OP2_1(TYPE_LNG, TYPE_INT, TYPE_LNG);
3952 COUNT(count_pcmd_op);
3953 OP2_1(TYPE_FLT, TYPE_FLT, TYPE_FLT);
3961 COUNT(count_pcmd_op);
3962 OP2_1(TYPE_DBL, TYPE_DBL, TYPE_DBL);
3966 COUNT(count_pcmd_op);
3967 #if SUPPORT_LONG_CMP_CONST
3968 if ((len == 0) || (iptr[1].sx.val.i != 0))
3971 switch (iptr[1].opc) {
3973 iptr->opc = ICMD_IF_LCMPEQ;
3975 iptr->dst.block = iptr[1].dst.block;
3976 iptr[1].opc = ICMD_NOP;
3978 OP2_BRANCH(TYPE_LNG, TYPE_LNG);
3981 COUNT(count_pcmd_bra);
3984 iptr->opc = ICMD_IF_LCMPNE;
3985 goto icmd_lcmp_if_tail;
3987 iptr->opc = ICMD_IF_LCMPLT;
3988 goto icmd_lcmp_if_tail;
3990 iptr->opc = ICMD_IF_LCMPGT;
3991 goto icmd_lcmp_if_tail;
3993 iptr->opc = ICMD_IF_LCMPLE;
3994 goto icmd_lcmp_if_tail;
3996 iptr->opc = ICMD_IF_LCMPGE;
3997 goto icmd_lcmp_if_tail;
4003 #endif /* SUPPORT_LONG_CMP_CONST */
4004 OP2_1(TYPE_LNG, TYPE_LNG, TYPE_INT);
4009 COUNT(count_pcmd_op);
4010 OP2_1(TYPE_FLT, TYPE_FLT, TYPE_INT);
4015 COUNT(count_pcmd_op);
4016 OP2_1(TYPE_DBL, TYPE_DBL, TYPE_INT);
4024 case ICMD_INT2SHORT:
4025 COUNT(count_pcmd_op);
4026 OP1_1(TYPE_INT, TYPE_INT);
4029 COUNT(count_pcmd_op);
4030 OP1_1(TYPE_LNG, TYPE_LNG);
4033 COUNT(count_pcmd_op);
4034 OP1_1(TYPE_FLT, TYPE_FLT);
4037 COUNT(count_pcmd_op);
4038 OP1_1(TYPE_DBL, TYPE_DBL);
4042 COUNT(count_pcmd_op);
4043 OP1_1(TYPE_INT, TYPE_LNG);
4046 COUNT(count_pcmd_op);
4047 OP1_1(TYPE_INT, TYPE_FLT);
4050 COUNT(count_pcmd_op);
4051 OP1_1(TYPE_INT, TYPE_DBL);
4054 COUNT(count_pcmd_op);
4055 OP1_1(TYPE_LNG, TYPE_INT);
4058 COUNT(count_pcmd_op);
4059 OP1_1(TYPE_LNG, TYPE_FLT);
4062 COUNT(count_pcmd_op);
4063 OP1_1(TYPE_LNG, TYPE_DBL);
4066 COUNT(count_pcmd_op);
4067 OP1_1(TYPE_FLT, TYPE_INT);
4070 COUNT(count_pcmd_op);
4071 OP1_1(TYPE_FLT, TYPE_LNG);
4074 COUNT(count_pcmd_op);
4075 OP1_1(TYPE_FLT, TYPE_DBL);
4078 COUNT(count_pcmd_op);
4079 OP1_1(TYPE_DBL, TYPE_INT);
4082 COUNT(count_pcmd_op);
4083 OP1_1(TYPE_DBL, TYPE_LNG);
4086 COUNT(count_pcmd_op);
4087 OP1_1(TYPE_DBL, TYPE_FLT);
4090 case ICMD_CHECKCAST:
4091 coalescing_boundary = sd.new;
4092 if (iptr->flags.bits & INS_FLAG_ARRAY) {
4093 /* array type cast-check */
4095 bte = builtintable_get_internal(BUILTIN_arraycheckcast);
4098 if (md->memuse > rd->memuse)
4099 rd->memuse = md->memuse;
4100 if (md->argintreguse > rd->argintreguse)
4101 rd->argintreguse = md->argintreguse;
4103 /* make all stack variables saved */
4107 sd.var[copy->varnum].flags |= SAVEDVAR;
4108 copy->flags |= SAVEDVAR;
4112 OP1_1(TYPE_ADR, TYPE_ADR);
4115 case ICMD_INSTANCEOF:
4116 case ICMD_ARRAYLENGTH:
4117 coalescing_boundary = sd.new;
4118 OP1_1(TYPE_ADR, TYPE_INT);
4122 case ICMD_ANEWARRAY:
4123 coalescing_boundary = sd.new;
4124 OP1_1(TYPE_INT, TYPE_ADR);
4128 coalescing_boundary = sd.new;
4129 COUNT(count_check_null);
4130 COUNT(count_pcmd_mem);
4131 INSTRUCTION_GET_FIELDREF(iptr, fmiref);
4132 OP1_1(TYPE_ADR, fmiref->parseddesc.fd->type);
4137 case ICMD_GETSTATIC:
4138 coalescing_boundary = sd.new;
4139 COUNT(count_pcmd_mem);
4140 INSTRUCTION_GET_FIELDREF(iptr, fmiref);
4141 OP0_1(fmiref->parseddesc.fd->type);
4145 coalescing_boundary = sd.new;
4152 tbptr = iptr->sx.s23.s3.jsrtarget.block;
4153 tbptr->type = BBTYPE_SBR;
4155 assert(sd.bptr->next); /* XXX exception */
4156 sd.var[curstack->varnum].vv.retaddr = sd.bptr->next;
4157 #if defined(ENABLE_VERIFIER)
4158 sd.var[curstack->varnum].SBRSTART = (void*) tbptr;
4161 tbptr = stack_mark_reached(&sd, tbptr, curstack, stackdepth);
4165 iptr->sx.s23.s3.jsrtarget.block = tbptr;
4167 /* We need to check for overflow right here because
4168 * the pushed value is poped afterwards */
4171 superblockend = true;
4172 /* XXX should not be marked as interface, as it does not need to be */
4173 /* allocated. Same for the invar of the target. */
4176 /* pop many push any */
4180 bte = iptr->sx.s23.s3.bte;
4184 case ICMD_INVOKESTATIC:
4185 case ICMD_INVOKESPECIAL:
4186 case ICMD_INVOKEVIRTUAL:
4187 case ICMD_INVOKEINTERFACE:
4188 COUNT(count_pcmd_met);
4190 /* Check for functions to replace with builtin
4193 if (builtintable_replace_function(iptr))
4196 INSTRUCTION_GET_METHODDESC(iptr, md);
4197 /* XXX resurrect this COUNT? */
4198 /* if (lm->flags & ACC_STATIC) */
4199 /* {COUNT(count_check_null);} */
4203 coalescing_boundary = sd.new;
4207 if (md->memuse > rd->memuse)
4208 rd->memuse = md->memuse;
4209 if (md->argintreguse > rd->argintreguse)
4210 rd->argintreguse = md->argintreguse;
4211 if (md->argfltreguse > rd->argfltreguse)
4212 rd->argfltreguse = md->argfltreguse;
4216 iptr->s1.argcount = stackdepth;
4217 iptr->sx.s23.s2.args = DMNEW(s4, stackdepth);
4220 for (i-- ; i >= 0; i--) {
4221 iptr->sx.s23.s2.args[i] = copy->varnum;
4223 /* do not change STACKVARs or LOCALVARS to ARGVAR*/
4224 /* -> won't help anyway */
4225 if (!(IS_INOUT(copy) || IS_LOCALVAR(copy))) {
4227 #if defined(SUPPORT_PASS_FLOATARGS_IN_INTREGS)
4228 /* If we pass float arguments in integer argument registers, we
4229 * are not allowed to precolor them here. Floats have to be moved
4230 * to this regs explicitly in codegen().
4231 * Only arguments that are passed by stack anyway can be precolored
4232 * (michi 2005/07/24) */
4233 if (!(sd.var[copy->varnum].flags & SAVEDVAR) &&
4234 (!IS_FLT_DBL_TYPE(copy->type)
4235 || md->params[i].inmemory)) {
4237 if (!(sd.var[copy->varnum].flags & SAVEDVAR)) {
4242 if (md->params[i].inmemory) {
4243 sd.var[copy->varnum].vv.regoff =
4244 md->params[i].regoff;
4245 sd.var[copy->varnum].flags |=
4249 if (IS_FLT_DBL_TYPE(copy->type)) {
4250 #if defined(SUPPORT_PASS_FLOATARGS_IN_INTREGS)
4251 assert(0); /* XXX is this assert ok? */
4253 sd.var[copy->varnum].vv.regoff =
4254 md->params[i].regoff;
4255 #endif /* SUPPORT_PASS_FLOATARGS_IN_INTREGS */
4258 #if defined(SUPPORT_COMBINE_INTEGER_REGISTERS)
4259 if (IS_2_WORD_TYPE(copy->type))
4260 sd.var[copy->varnum].vv.regoff =
4261 PACK_REGS(GET_LOW_REG(md->params[i].regoff),
4262 GET_HIGH_REG(md->params[i].regoff));
4265 #endif /* SUPPORT_COMBINE_INTEGER_REGISTERS */
4266 sd.var[copy->varnum].vv.regoff =
4267 md->params[i].regoff;
4275 /* deal with live-through stack slots "under" the */
4281 iptr->sx.s23.s2.args[i++] = copy->varnum;
4282 sd.var[copy->varnum].flags |= SAVEDVAR;
4283 copy->flags |= SAVEDVAR | PASSTHROUGH;
4287 /* pop the arguments */
4296 /* push the return value */
4298 if (md->returntype.type != TYPE_VOID) {
4299 GET_NEW_VAR(sd, new_index, md->returntype.type);
4300 DST(md->returntype.type, new_index);
4305 case ICMD_MULTIANEWARRAY:
4306 coalescing_boundary = sd.new;
4307 if (rd->argintreguse < MIN(3, INT_ARG_CNT))
4308 rd->argintreguse = MIN(3, INT_ARG_CNT);
4310 i = iptr->s1.argcount;
4314 iptr->sx.s23.s2.args = DMNEW(s4, i);
4316 #if defined(SPECIALMEMUSE)
4317 # if defined(__DARWIN__)
4318 if (rd->memuse < (i + INT_ARG_CNT +LA_SIZE_IN_POINTERS))
4319 rd->memuse = i + LA_SIZE_IN_POINTERS + INT_ARG_CNT;
4321 if (rd->memuse < (i + LA_SIZE_IN_POINTERS + 3))
4322 rd->memuse = i + LA_SIZE_IN_POINTERS + 3;
4325 # if defined(__I386__)
4326 if (rd->memuse < i + 3)
4327 rd->memuse = i + 3; /* n integer args spilled on stack */
4328 # elif defined(__MIPS__) && SIZEOF_VOID_P == 4
4329 if (rd->memuse < i + 2)
4330 rd->memuse = i + 2; /* 4*4 bytes callee save space */
4333 rd->memuse = i; /* n integer args spilled on stack */
4334 # endif /* defined(__I386__) */
4338 /* check INT type here? Currently typecheck does this. */
4339 iptr->sx.s23.s2.args[i] = copy->varnum;
4340 if (!(sd.var[copy->varnum].flags & SAVEDVAR)
4341 && (!IS_INOUT(copy))
4342 && (!IS_LOCALVAR(copy)) ) {
4343 copy->varkind = ARGVAR;
4344 sd.var[copy->varnum].flags |=
4345 INMEMORY & PREALLOC;
4346 #if defined(SPECIALMEMUSE)
4347 # if defined(__DARWIN__)
4348 sd.var[copy->varnum].vv.regoff = i +
4349 LA_SIZE_IN_POINTERS + INT_ARG_CNT;
4351 sd.var[copy->varnum].vv.regoff = i +
4352 LA_SIZE_IN_POINTERS + 3;
4355 # if defined(__I386__)
4356 sd.var[copy->varnum].vv.regoff = i + 3;
4357 # elif defined(__MIPS__) && SIZEOF_VOID_P == 4
4358 sd.var[copy->varnum].vv.regoff = i + 2;
4360 sd.var[copy->varnum].vv.regoff = i;
4361 # endif /* defined(__I386__) */
4362 #endif /* defined(SPECIALMEMUSE) */
4367 sd.var[copy->varnum].flags |= SAVEDVAR;
4368 copy->flags |= SAVEDVAR;
4372 i = iptr->s1.argcount;
4377 GET_NEW_VAR(sd, new_index, TYPE_ADR);
4378 DST(TYPE_ADR, new_index);
4383 exceptions_throw_internalerror("Unknown ICMD %d during stack analysis",
4390 } /* while instructions */
4392 /* show state after last instruction */
4394 #if defined(STACK_VERBOSE)
4395 stack_verbose_show_state(&sd, NULL, curstack);
4398 /* stack slots at basic block end become interfaces */
4400 sd.bptr->outdepth = stackdepth;
4401 sd.bptr->outvars = DMNEW(s4, stackdepth);
4404 for (copy = curstack; copy; i--, copy = copy->prev) {
4407 /* with the new vars rd->interfaces will be removed */
4408 /* and all in and outvars have to be STACKVARS! */
4409 /* in the moment i.e. SWAP with in and out vars can */
4410 /* create an unresolvable conflict */
4415 v = sd.var + copy->varnum;
4418 /* do not allocate variables for returnAddresses */
4420 if (type != TYPE_RET) {
4421 if (jd->interface_map[i*5 + type].flags == UNUSED) {
4422 /* no interface var until now for this depth and */
4424 jd->interface_map[i*5 + type].flags = v->flags;
4427 jd->interface_map[i*5 + type].flags |= v->flags;
4431 sd.bptr->outvars[i] = copy->varnum;
4434 /* check if interface slots at basic block begin must be saved */
4436 for (i=0; i<sd.bptr->indepth; ++i) {
4437 varinfo *v = sd.var + sd.bptr->invars[i];
4441 if (type != TYPE_RET) {
4442 if (jd->interface_map[i*5 + type].flags == UNUSED) {
4443 /* no interface var until now for this depth and */
4445 jd->interface_map[i*5 + type].flags = v->flags;
4448 jd->interface_map[i*5 + type].flags |= v->flags;
4453 /* store the number of this block's variables */
4455 sd.bptr->varcount = sd.vartop - sd.bptr->varstart;
4457 #if defined(STACK_VERBOSE)
4458 stack_verbose_block_exit(&sd, superblockend);
4461 /* reach the following block, if any */
4464 if (!stack_reach_next_block(&sd))
4469 } while (sd.repeat && !deadcode);
4471 /* reset locals of TYPE_RET|VOID to TYPE_ADR */
4473 /* A local variable may be used as both a returnAddress and a reference */
4474 /* type variable, as we do not split variables between these types when */
4475 /* renaming locals. While returnAddresses have been eliminated now, we */
4476 /* must assume that the variable is still used as TYPE_ADR. */
4477 /* The only way that a local can be TYPE_VOID at this point, is that it */
4478 /* was a TYPE_RET variable for which incompatible returnAddresses were */
4479 /* merged. Thus we must treat TYPE_VOID in the same way as TYPE_RET */
4481 /* XXX: It would be nice to remove otherwise unused returnAddress */
4482 /* variables from the local variable array, so they are not */
4483 /* allocated by simplereg. (For LSRA this is not needed). */
4485 for (i=0; i<sd.localcount; ++i) {
4486 if (sd.var[i].type == TYPE_RET || sd.var[i].type == TYPE_VOID)
4487 sd.var[i].type = TYPE_ADR;
4490 /* mark temporaries of TYPE_RET as PREALLOC to avoid allocation */
4492 for (i=sd.localcount; i<sd.vartop; ++i) {
4493 if (sd.var[i].type == TYPE_RET)
4494 sd.var[i].flags |= PREALLOC;
4497 /* XXX hack to fix up the ranges of the cloned single-block handlers */
4499 ex = jd->exceptiontable;
4500 for (; ex != NULL; ex = ex->down) {
4501 if (ex->start == ex->end) {
4502 assert(ex->end->next);
4503 ex->end = ex->end->next;
4507 /* store number of created variables */
4509 jd->vartop = sd.vartop;
4511 /* gather statistics *****************************************************/
4513 #if defined(ENABLE_STATISTICS)
4515 if (jd->basicblockcount > count_max_basic_blocks)
4516 count_max_basic_blocks = jd->basicblockcount;
4517 count_basic_blocks += jd->basicblockcount;
4518 if (jd->instructioncount > count_max_javainstr)
4519 count_max_javainstr = jd->instructioncount;
4520 count_javainstr += jd->instructioncount;
4521 if (jd->stackcount > count_upper_bound_new_stack)
4522 count_upper_bound_new_stack = jd->stackcount;
4523 if ((sd.new - jd->stack) > count_max_new_stack)
4524 count_max_new_stack = (sd.new - jd->stack);
4526 sd.bptr = jd->basicblocks;
4527 for (; sd.bptr; sd.bptr = sd.bptr->next) {
4528 if (sd.bptr->flags > BBREACHED) {
4529 if (sd.bptr->indepth >= 10)
4530 count_block_stack[10]++;
4532 count_block_stack[sd.bptr->indepth]++;
4533 len = sd.bptr->icount;
4535 count_block_size_distribution[len]++;
4537 count_block_size_distribution[10]++;
4539 count_block_size_distribution[11]++;
4541 count_block_size_distribution[12]++;
4543 count_block_size_distribution[13]++;
4545 count_block_size_distribution[14]++;
4547 count_block_size_distribution[15]++;
4549 count_block_size_distribution[16]++;
4551 count_block_size_distribution[17]++;
4555 if (iteration_count == 1)
4556 count_analyse_iterations[0]++;
4557 else if (iteration_count == 2)
4558 count_analyse_iterations[1]++;
4559 else if (iteration_count == 3)
4560 count_analyse_iterations[2]++;
4561 else if (iteration_count == 4)
4562 count_analyse_iterations[3]++;
4564 count_analyse_iterations[4]++;
4566 if (jd->basicblockcount <= 5)
4567 count_method_bb_distribution[0]++;
4568 else if (jd->basicblockcount <= 10)
4569 count_method_bb_distribution[1]++;
4570 else if (jd->basicblockcount <= 15)
4571 count_method_bb_distribution[2]++;
4572 else if (jd->basicblockcount <= 20)
4573 count_method_bb_distribution[3]++;
4574 else if (jd->basicblockcount <= 30)
4575 count_method_bb_distribution[4]++;
4576 else if (jd->basicblockcount <= 40)
4577 count_method_bb_distribution[5]++;
4578 else if (jd->basicblockcount <= 50)
4579 count_method_bb_distribution[6]++;
4580 else if (jd->basicblockcount <= 75)
4581 count_method_bb_distribution[7]++;
4583 count_method_bb_distribution[8]++;
4585 #endif /* defined(ENABLE_STATISTICS) */
4587 /* everything's ok *******************************************************/
4591 /* goto labels for throwing verifier exceptions **************************/
4593 #if defined(ENABLE_VERIFIER)
4595 throw_stack_underflow:
4596 exceptions_throw_verifyerror(m, "Unable to pop operand off an empty stack");
4599 throw_stack_overflow:
4600 exceptions_throw_verifyerror(m, "Stack size too large");
4603 throw_stack_type_error:
4604 exceptions_throw_verifyerror_for_stack(m, expectedtype);
4607 throw_stack_category_error:
4608 exceptions_throw_verifyerror(m, "Attempt to split long or double on the stack");
4615 /* stack_javalocals_store ******************************************************
4617 Model the effect of a ?STORE instruction upon the given javalocals array.
4620 iptr.............the ?STORE instruction
4621 javalocals.......the javalocals array to modify
4623 *******************************************************************************/
4625 void stack_javalocals_store(instruction *iptr, s4 *javalocals)
4627 s4 varindex; /* index into the jd->var array */
4628 s4 javaindex; /* java local index */
4630 varindex = iptr->dst.varindex;
4631 javaindex = iptr->sx.s23.s3.javaindex;
4633 if (javaindex != UNUSED) {
4634 assert(javaindex >= 0);
4635 if (iptr->flags.bits & INS_FLAG_RETADDR)
4636 javalocals[javaindex] = iptr->sx.s23.s2.retaddrnr;
4638 javalocals[javaindex] = varindex;
4640 if (iptr->flags.bits & INS_FLAG_KILL_PREV)
4641 javalocals[javaindex-1] = UNUSED;
4643 if (iptr->flags.bits & INS_FLAG_KILL_NEXT)
4644 javalocals[javaindex+1] = UNUSED;
4649 /* functions for verbose stack analysis output ********************************/
4651 #if defined(STACK_VERBOSE)
4652 static void stack_verbose_show_varinfo(stackdata_t *sd, varinfo *v)
4654 printf("%c", show_jit_type_letters[v->type]);
4655 if (v->type == TYPE_RET) {
4656 printf("{L%03d}", v->vv.retaddr->nr);
4657 #if defined(ENABLE_VERIFIER)
4658 printf("{start=L%03d}", ((basicblock *)v->SBRSTART)->nr);
4664 static void stack_verbose_show_variable(stackdata_t *sd, s4 index)
4666 assert(index >= 0 && index < sd->vartop);
4667 stack_verbose_show_varinfo(sd, sd->var + index);
4671 static void stack_verbose_show_block(stackdata_t *sd, basicblock *bptr)
4675 printf("L%03d type:%d in:%d [", bptr->nr, bptr->type, bptr->indepth);
4677 for (i=0; i<bptr->indepth; ++i) {
4680 stack_verbose_show_variable(sd, bptr->invars[i]);
4685 printf("] javalocals ");
4686 show_javalocals_array(sd->jd, sd->javalocals, sd->maxlocals, SHOW_STACK);
4687 printf(" inlocals [");
4688 if (bptr->inlocals) {
4689 for (i=0; i<sd->localcount; ++i) {
4692 stack_verbose_show_varinfo(sd, bptr->inlocals + i);
4697 printf("] out:%d [", bptr->outdepth);
4698 if (bptr->outvars) {
4699 for (i=0; i<bptr->outdepth; ++i) {
4702 stack_verbose_show_variable(sd, bptr->outvars[i]);
4710 printf(" (clone of L%03d)", bptr->original->nr);
4712 basicblock *b = bptr->copied_to;
4714 printf(" (copied to ");
4715 for (; b; b = b->copied_to)
4716 printf("L%03d ", b->nr);
4723 static void stack_verbose_block_enter(stackdata_t *sd, bool reanalyse)
4727 printf("======================================== STACK %sANALYSE BLOCK ",
4728 (reanalyse) ? ((sd->bptr->iinstr == NULL) ? "CLONE-" : "RE-") : "");
4729 stack_verbose_show_block(sd, sd->bptr);
4732 if (sd->handlers[0]) {
4733 printf("HANDLERS: ");
4734 for (i=0; sd->handlers[i]; ++i) {
4735 printf("L%03d ", sd->handlers[i]->handler->nr);
4743 static void stack_verbose_block_exit(stackdata_t *sd, bool superblockend)
4745 printf("%s ", (superblockend) ? "SUPERBLOCKEND" : "END");
4746 stack_verbose_show_block(sd, sd->bptr);
4750 static void stack_verbose_show_state(stackdata_t *sd, instruction *iptr, stackptr curstack)
4758 printf(" javalocals ");
4759 show_javalocals_array(sd->jd, sd->javalocals, sd->maxlocals, SHOW_STACK);
4762 for(i = 0, sp = curstack; sp; sp = sp->prev)
4766 stack = MNEW(stackptr, depth);
4767 for(sp = curstack; sp; sp = sp->prev)
4770 for(i=0; i<depth; ++i) {
4774 v = &(sd->var[sp->varnum]);
4776 if (v->flags & INOUT)
4778 if (v->flags & PREALLOC)
4780 printf("%d:%c", sp->varnum, show_jit_type_letters[sp->type]);
4781 if (v->type == TYPE_RET) {
4782 printf("(L%03d)", v->vv.retaddr->nr);
4787 show_icmd(sd->jd, iptr, false, SHOW_PARSE);
4794 * These are local overrides for various environment variables in Emacs.
4795 * Please do not remove this and leave it at the end of the file, where
4796 * Emacs will automagically detect them.
4797 * ---------------------------------------------------------------------
4800 * indent-tabs-mode: t
4804 * vim:noexpandtab:sw=4:ts=4: