1 /* vm/jit/stack.h - stack analysis header
3 Copyright (C) 1996-2005, 2006 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
25 Contact: cacao@cacaojvm.org
27 Authors: Christian Thalinger
29 Changes: Christian Ullrich
31 $Id: stack.h 4683 2006-03-23 00:30:30Z edwin $
43 #include "vm/exceptions.h"
44 #include "vm/global.h"
45 #include "vm/jit/jit.h"
46 #include "vm/jit/reg.h"
49 /* macros used internally by analyse_stack ************************************/
51 #if defined(ENABLE_LSRA)
52 # define INC_LIFETIMES(a) { m->maxlifetimes += (a); }
54 # define INC_LIFETIMES(a)
57 /* convenient abbreviations */
58 #define CURKIND curstack->varkind
59 #define CURTYPE curstack->type
62 /*--------------------------------------------------*/
63 /* STACK DEPTH CHECKING */
64 /*--------------------------------------------------*/
66 #if defined(ENABLE_VERIFIER)
67 #define CHECK_STACK_DEPTH(depthA,depthB) \
69 if ((depthA) != (depthB)) \
70 goto throw_stack_depth_error; \
72 #else /* !ENABLE_VERIFIER */
73 #define CHECK_STACK_DEPTH(depthA,depthB)
74 #endif /* ENABLE_VERIFIER */
76 /*--------------------------------------------------*/
77 /* BASIC TYPE CHECKING */
78 /*--------------------------------------------------*/
80 /* XXX would be nice if we did not have to pass the expected type */
82 #if defined(ENABLE_VERIFIER)
83 #define CHECK_BASIC_TYPE(expected,actual) \
85 if ((actual) != (expected)) { \
86 expectedtype = (expected); \
87 goto throw_stack_type_error; \
90 #else /* !ENABLE_VERIFIER */
91 #define CHECK_BASIC_TYPE(expected,actual)
92 #endif /* ENABLE_VERIFIER */
94 /*--------------------------------------------------*/
95 /* STACK UNDERFLOW/OVERFLOW CHECKS */
96 /*--------------------------------------------------*/
98 /* underflow checks */
100 #if defined(ENABLE_VERIFIER)
101 #define REQUIRE(num) \
103 if (stackdepth < (num)) \
104 goto throw_stack_underflow; \
106 #else /* !ENABLE_VERIFIER */
108 #endif /* ENABLE_VERIFIER */
110 #define REQUIRE_1 REQUIRE(1)
111 #define REQUIRE_2 REQUIRE(2)
112 #define REQUIRE_3 REQUIRE(3)
113 #define REQUIRE_4 REQUIRE(4)
117 /* We allow ACONST instructions inserted as arguments to builtin
118 * functions to exceed the maximum stack depth. Maybe we should check
119 * against maximum stack depth only at block boundaries?
122 /* XXX we should find a way to remove the opc/op1 check */
123 #if defined(ENABLE_VERIFIER)
124 #define CHECKOVERFLOW \
126 if (stackdepth > m->maxstack) \
127 if (iptr[0].opc != ICMD_ACONST || iptr[0].op1 == 0) \
128 goto throw_stack_overflow; \
130 #else /* !ENABLE_VERIFIER */
131 #define CHECKOVERFLOW
132 #endif /* ENABLE_VERIFIER */
134 /*--------------------------------------------------*/
135 /* ALLOCATING STACK SLOTS */
136 /*--------------------------------------------------*/
138 #define NEWSTACK_(s,v,n) \
140 new->prev = curstack; \
143 new->varkind = (v); \
150 /* Initialize regoff, so -sia can show regnames even before reg.inc */
151 /* regs[rd->intregargnum has to be set for this */
152 /* new->regoff = (IS_FLT_DBL_TYPE(s))?-1:rd->intreg_argnum; }*/
154 #define NEWSTACK(s,v,n) { NEWSTACK_(s,v,n); INC_LIFETIMES(1); }
156 #define NEWSTACKn(s,n) NEWSTACK(s,UNDEFVAR,n)
157 #define NEWSTACK0(s) NEWSTACK(s,UNDEFVAR,0)
159 /* allocate the input stack for an exception handler */
160 #define NEWXSTACK {NEWSTACK(TYPE_ADR,STACKVAR,0);curstack=0;}
163 /*--------------------------------------------------*/
164 /* STACK MANIPULATION */
165 /*--------------------------------------------------*/
167 /* resetting to an empty operand stack */
176 /* set the output stack of the current instruction */
178 #define SETDST iptr->dst = curstack;
181 /* The following macros do NOT check stackdepth, set stackdepth or iptr->dst */
185 CHECK_BASIC_TYPE((s),curstack->type); \
186 if (curstack->varkind == UNDEFVAR) \
187 curstack->varkind = TEMPVAR; \
188 curstack = curstack->prev; \
193 if (curstack->varkind == UNDEFVAR) \
194 curstack->varkind = TEMPVAR; \
195 curstack = curstack->prev; \
198 /* Do not copy Interface Stackslots over DUPx, Swaps! */
202 (d)->type = (s)->type; \
203 if ( (s)->varkind != STACKVAR) { \
204 (d)->varkind = (s)->varkind; \
205 (d)->varnum = (s)->varnum; \
207 (d)->varkind = TEMPVAR; \
213 /*--------------------------------------------------*/
214 /* STACK OPERATIONS MODELING */
215 /*--------------------------------------------------*/
217 /* The following macros are used to model the stack manipulations of
218 * different kinds of instructions.
220 * These macros check the input stackdepth and they set the output
221 * stackdepth and the output stack of the instruction (iptr->dst).
223 * These macros do *not* check for stack overflows!
226 #define PUSHCONST(s){NEWSTACKn(s,stackdepth);SETDST;stackdepth++;}
227 #define LOAD(s,v,n) {NEWSTACK(s,v,n);SETDST;stackdepth++;}
228 #define STORE(s) {REQUIRE_1;POP(s);SETDST;stackdepth--;}
248 NEWSTACKn(s, stackdepth); \
257 NEWSTACKn(d, stackdepth - 1);\
270 #define OPTT2_0(t,b) \
284 NEWSTACKn(s, stackdepth - 2); \
289 #define OP2IAT_1(s) \
294 NEWSTACKn(s, stackdepth - 2); \
304 NEWSTACKn(s, stackdepth - 2); \
309 #define OPTT2_1(s,d) \
314 NEWSTACKn(d, stackdepth - 2); \
324 NEWSTACKn(s, stackdepth - 2); \
325 NEWSTACKn(s, stackdepth - 1); \
329 #define OP3TIA_0(s) \
353 while(--(i) >= 0) { \
359 /* Do not copy Interface Stackslots over DUP! */
360 #define DUP {REQUIRE_1; \
361 if (CURKIND != STACKVAR) { \
362 NEWSTACK(CURTYPE,CURKIND,curstack->varnum); \
364 NEWSTACK(CURTYPE, TEMPVAR, stackdepth); \
366 SETDST; stackdepth++; INC_LIFETIMES(1);}
367 #define SWAP {REQUIRE_2;COPY(curstack,new);POPANY;COPY(curstack,new+1);POPANY;\
368 new[0].prev=curstack;new[1].prev=new;\
369 curstack=new+1;new+=2;SETDST;}
370 #define DUP_X1 {REQUIRE_2;COPY(curstack,new);COPY(curstack,new+2);POPANY;\
371 COPY(curstack,new+1);POPANY;new[0].prev=curstack;\
372 new[1].prev=new;new[2].prev=new+1;\
373 curstack=new+2;new+=3;SETDST;stackdepth++; INC_LIFETIMES(3);}
374 #define DUP2_X1 {REQUIRE_3;COPY(curstack,new+1);COPY(curstack,new+4);POPANY;\
375 COPY(curstack,new);COPY(curstack,new+3);POPANY;\
376 COPY(curstack,new+2);POPANY;new[0].prev=curstack;\
377 new[1].prev=new;new[2].prev=new+1;\
378 new[3].prev=new+2;new[4].prev=new+3;\
379 curstack=new+4;new+=5;SETDST;stackdepth+=2; INC_LIFETIMES(5);}
380 #define DUP_X2 {REQUIRE_3;COPY(curstack,new);COPY(curstack,new+3);POPANY;\
381 COPY(curstack,new+2);POPANY;COPY(curstack,new+1);POPANY;\
382 new[0].prev=curstack;new[1].prev=new;\
383 new[2].prev=new+1;new[3].prev=new+2;\
384 curstack=new+3;new+=4;SETDST;stackdepth++; INC_LIFETIMES(4);}
385 #define DUP2_X2 {REQUIRE_4;COPY(curstack,new+1);COPY(curstack,new+5);POPANY;\
386 COPY(curstack,new);COPY(curstack,new+4);POPANY;\
387 COPY(curstack,new+3);POPANY;COPY(curstack,new+2);POPANY;\
388 new[0].prev=curstack;new[1].prev=new;\
389 new[2].prev=new+1;new[3].prev=new+2;\
390 new[4].prev=new+3;new[5].prev=new+4;\
391 curstack=new+5;new+=6;SETDST;stackdepth+=2; INC_LIFETIMES(6);}
394 /*--------------------------------------------------*/
395 /* MACROS FOR HANDLING BASIC BLOCKS */
396 /*--------------------------------------------------*/
398 /* COPYCURSTACK makes a copy of the current operand stack (curstack)
399 * and returns it in the variable copy.
401 * This macro is used to propagate the operand stack from one basic
402 * block to another. The destination block receives the copy as its
405 #define COPYCURSTACK(copy) {\
418 copy->varkind=STACKVAR;\
429 /* MARKREACHED marks the destination block <b> as reached. If this
430 * block has been reached before we check if stack depth and types
431 * match. Otherwise the destination block receives a copy of the
432 * current stack as its input stack.
434 * b...destination block
438 #define MARKREACHED(b,c) \
441 (b)->bitflags |= BBFLAG_REPLACEMENT; \
442 if ((b)->flags < BBREACHED) { \
444 (b)->flags = BBREACHED; \
445 (b)->instack = (c); \
446 (b)->indepth = stackdepth; \
448 stackptr s = curstack; \
449 stackptr t = (b)->instack; \
450 CHECK_STACK_DEPTH((b)->indepth, stackdepth); \
452 CHECK_BASIC_TYPE(s->type,t->type); \
460 /* function prototypes ********************************************************/
462 bool stack_init(void);
464 methodinfo *analyse_stack(methodinfo *m, codegendata *cd, registerdata *rd);
466 void stack_print(codegendata *cd, stackptr s);
467 void show_icmd_method(methodinfo *m, codegendata *cd, registerdata *rd);
468 void show_icmd_block(methodinfo *m, codegendata *cd, basicblock *bptr);
469 void show_icmd(instruction *iptr, bool deadcode);
471 /* machine dependent return value handling function */
472 void md_return_alloc(methodinfo *m, registerdata *rd, s4 return_type,
475 #endif /* _STACK_H */
479 * These are local overrides for various environment variables in Emacs.
480 * Please do not remove this and leave it at the end of the file, where
481 * Emacs will automagically detect them.
482 * ---------------------------------------------------------------------
485 * indent-tabs-mode: t
489 * vim:noexpandtab:sw=4:ts=4: