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 5024 2006-06-10 14:53:54Z 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 */
77 /*--------------------------------------------------*/
78 /* BASIC TYPE CHECKING */
79 /*--------------------------------------------------*/
81 /* XXX would be nice if we did not have to pass the expected type */
83 #if defined(ENABLE_VERIFIER)
84 #define CHECK_BASIC_TYPE(expected,actual) \
86 if ((actual) != (expected)) { \
87 expectedtype = (expected); \
88 goto throw_stack_type_error; \
91 #else /* !ENABLE_VERIFIER */
92 #define CHECK_BASIC_TYPE(expected,actual)
93 #endif /* ENABLE_VERIFIER */
95 /*--------------------------------------------------*/
96 /* STACK UNDERFLOW/OVERFLOW CHECKS */
97 /*--------------------------------------------------*/
99 /* underflow checks */
101 #if defined(ENABLE_VERIFIER)
102 #define REQUIRE(num) \
104 if (stackdepth < (num)) \
105 goto throw_stack_underflow; \
107 #else /* !ENABLE_VERIFIER */
109 #endif /* ENABLE_VERIFIER */
111 #define REQUIRE_1 REQUIRE(1)
112 #define REQUIRE_2 REQUIRE(2)
113 #define REQUIRE_3 REQUIRE(3)
114 #define REQUIRE_4 REQUIRE(4)
118 /* We allow ACONST instructions inserted as arguments to builtin
119 * functions to exceed the maximum stack depth. Maybe we should check
120 * against maximum stack depth only at block boundaries?
123 /* XXX we should find a way to remove the opc/op1 check */
124 #if defined(ENABLE_VERIFIER)
125 #define NEW_CHECKOVERFLOW \
127 if (stackdepth > m->maxstack) \
128 if ((iptr->opc != ICMD_ACONST) || !(iptr->flags.bits & INS_FLAG_NOCHECK)) \
129 goto throw_stack_overflow; \
131 #else /* !ENABLE_VERIFIER */
132 #define NEW_CHECKOVERFLOW
133 #endif /* ENABLE_VERIFIER */
135 /* XXX we should find a way to remove the opc/op1 check */
136 #if defined(ENABLE_VERIFIER)
137 #define CHECKOVERFLOW \
139 if (stackdepth > m->maxstack) \
140 if ((iptr[0].opc != ICMD_ACONST) || (iptr[0].op1 == 0)) \
141 goto throw_stack_overflow; \
143 #else /* !ENABLE_VERIFIER */
144 #define CHECKOVERFLOW
145 #endif /* ENABLE_VERIFIER */
147 /*--------------------------------------------------*/
148 /* ALLOCATING STACK SLOTS */
149 /*--------------------------------------------------*/
151 #define NEWSTACK_(s,v,n) \
153 new->prev = curstack; \
156 new->varkind = (v); \
163 /* Initialize regoff, so -sia can show regnames even before reg.inc */
164 /* regs[rd->intregargnum has to be set for this */
165 /* new->regoff = (IS_FLT_DBL_TYPE(s))?-1:rd->intreg_argnum; }*/
167 #define NEWSTACK(s,v,n) do { NEWSTACK_(s,v,n); INC_LIFETIMES(1); } while (0)
169 #define NEWSTACKn(s,n) NEWSTACK(s,UNDEFVAR,n)
170 #define NEWSTACK0(s) NEWSTACK(s,UNDEFVAR,0)
172 /* allocate the input stack for an exception handler */
173 #define NEWXSTACK {NEWSTACK(TYPE_ADR,STACKVAR,0);curstack=0;}
176 /*--------------------------------------------------*/
177 /* STACK MANIPULATION */
178 /*--------------------------------------------------*/
180 /* resetting to an empty operand stack */
189 /* set the output stack of the current instruction */
191 #define SETDST iptr->dst = curstack;
194 /* The following macros do NOT check stackdepth, set stackdepth or iptr->dst */
198 CHECK_BASIC_TYPE((s),curstack->type); \
199 if (curstack->varkind == UNDEFVAR) \
200 curstack->varkind = TEMPVAR; \
201 curstack = curstack->prev; \
206 if (curstack->varkind == UNDEFVAR) \
207 curstack->varkind = TEMPVAR; \
208 curstack = curstack->prev; \
211 /* Do not copy Interface Stackslots over DUPx, Swaps! */
215 (d)->type = (s)->type; \
216 if ( (s)->varkind != STACKVAR) { \
217 (d)->varkind = (s)->varkind; \
218 (d)->varnum = (s)->varnum; \
220 (d)->varkind = TEMPVAR; \
226 /*--------------------------------------------------*/
227 /* STACK OPERATIONS MODELING */
228 /*--------------------------------------------------*/
230 /* The following macros are used to model the stack manipulations of
231 * different kinds of instructions.
233 * These macros check the input stackdepth and they set the output
234 * stackdepth and the output stack of the instruction (iptr->dst).
236 * These macros do *not* check for stack overflows!
239 #define PUSHCONST(s){NEWSTACKn(s,stackdepth);SETDST;stackdepth++;}
240 #define LOAD(s,v,n) {NEWSTACK(s,v,n);SETDST;stackdepth++;}
241 #define STORE(s) {REQUIRE_1;POP(s);SETDST;stackdepth--;}
261 NEWSTACKn(s, stackdepth); \
270 NEWSTACKn(d, stackdepth - 1);\
283 #define OPTT2_0(t,b) \
297 NEWSTACKn(s, stackdepth - 2); \
302 #define OP2IAT_1(s) \
307 NEWSTACKn(s, stackdepth - 2); \
317 NEWSTACKn(s, stackdepth - 2); \
322 #define OPTT2_1(s,d) \
327 NEWSTACKn(d, stackdepth - 2); \
337 NEWSTACKn(s, stackdepth - 2); \
338 NEWSTACKn(s, stackdepth - 1); \
342 #define OP3TIA_0(s) \
366 while(--(i) >= 0) { \
372 /* Do not copy Interface Stackslots over DUP! */
373 #define DUP {REQUIRE_1; \
374 if (CURKIND != STACKVAR) { \
375 NEWSTACK(CURTYPE,CURKIND,curstack->varnum); \
377 NEWSTACK(CURTYPE, TEMPVAR, stackdepth); \
379 SETDST; stackdepth++; INC_LIFETIMES(1);}
380 #define SWAP {REQUIRE_2;COPY(curstack,new);POPANY;COPY(curstack,new+1);POPANY;\
381 new[0].prev=curstack;new[1].prev=new;\
382 curstack=new+1;new+=2;SETDST;}
383 #define DUP_X1 {REQUIRE_2;COPY(curstack,new);COPY(curstack,new+2);POPANY;\
384 COPY(curstack,new+1);POPANY;new[0].prev=curstack;\
385 new[1].prev=new;new[2].prev=new+1;\
386 curstack=new+2;new+=3;SETDST;stackdepth++; INC_LIFETIMES(3);}
387 #define DUP2_X1 {REQUIRE_3;COPY(curstack,new+1);COPY(curstack,new+4);POPANY;\
388 COPY(curstack,new);COPY(curstack,new+3);POPANY;\
389 COPY(curstack,new+2);POPANY;new[0].prev=curstack;\
390 new[1].prev=new;new[2].prev=new+1;\
391 new[3].prev=new+2;new[4].prev=new+3;\
392 curstack=new+4;new+=5;SETDST;stackdepth+=2; INC_LIFETIMES(5);}
393 #define DUP_X2 {REQUIRE_3;COPY(curstack,new);COPY(curstack,new+3);POPANY;\
394 COPY(curstack,new+2);POPANY;COPY(curstack,new+1);POPANY;\
395 new[0].prev=curstack;new[1].prev=new;\
396 new[2].prev=new+1;new[3].prev=new+2;\
397 curstack=new+3;new+=4;SETDST;stackdepth++; INC_LIFETIMES(4);}
398 #define DUP2_X2 {REQUIRE_4;COPY(curstack,new+1);COPY(curstack,new+5);POPANY;\
399 COPY(curstack,new);COPY(curstack,new+4);POPANY;\
400 COPY(curstack,new+3);POPANY;COPY(curstack,new+2);POPANY;\
401 new[0].prev=curstack;new[1].prev=new;\
402 new[2].prev=new+1;new[3].prev=new+2;\
403 new[4].prev=new+3;new[5].prev=new+4;\
404 curstack=new+5;new+=6;SETDST;stackdepth+=2; INC_LIFETIMES(6);}
407 /*--------------------------------------------------*/
408 /* MACROS FOR HANDLING BASIC BLOCKS */
409 /*--------------------------------------------------*/
411 /* COPYCURSTACK makes a copy of the current operand stack (curstack)
412 * and returns it in the variable copy.
414 * This macro is used to propagate the operand stack from one basic
415 * block to another. The destination block receives the copy as its
418 #define COPYCURSTACK(copy) {\
431 copy->varkind=STACKVAR;\
442 /* MARKREACHED marks the destination block <b> as reached. If this
443 * block has been reached before we check if stack depth and types
444 * match. Otherwise the destination block receives a copy of the
445 * current stack as its input stack.
447 * b...destination block
451 #define MARKREACHED(b,c) \
454 (b)->bitflags |= BBFLAG_REPLACEMENT; \
455 if ((b)->flags < BBREACHED) { \
457 (b)->flags = BBREACHED; \
458 (b)->instack = (c); \
459 (b)->indepth = stackdepth; \
461 stackptr s = curstack; \
462 stackptr t = (b)->instack; \
463 CHECK_STACK_DEPTH((b)->indepth, stackdepth); \
465 CHECK_BASIC_TYPE(s->type,t->type); \
473 /* function prototypes ********************************************************/
475 bool stack_init(void);
477 bool stack_analyse(jitdata *jd);
479 /* machine dependent return value handling function */
480 void md_return_alloc(methodinfo *m, registerdata *rd, s4 return_type,
483 #endif /* _STACK_H */
487 * These are local overrides for various environment variables in Emacs.
488 * Please do not remove this and leave it at the end of the file, where
489 * Emacs will automagically detect them.
490 * ---------------------------------------------------------------------
493 * indent-tabs-mode: t
497 * vim:noexpandtab:sw=4:ts=4: