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
32 $Id: stack.h 5442 2006-09-09 14:45:55Z edwin $
44 #include "vm/exceptions.h"
45 #include "vm/global.h"
46 #include "vm/jit/jit.h"
47 #include "vm/jit/reg.h"
50 /* macros used internally by analyse_stack ************************************/
52 /* convenient abbreviations */
53 #define CURKIND curstack->varkind
54 #define CURTYPE curstack->type
57 /*--------------------------------------------------*/
58 /* STACK DEPTH CHECKING */
59 /*--------------------------------------------------*/
61 #if defined(ENABLE_VERIFIER)
62 #define CHECK_STACK_DEPTH(depthA,depthB) \
64 if ((depthA) != (depthB)) \
65 goto throw_stack_depth_error; \
67 #else /* !ENABLE_VERIFIER */
68 #define CHECK_STACK_DEPTH(depthA,depthB)
69 #endif /* ENABLE_VERIFIER */
72 /*--------------------------------------------------*/
73 /* BASIC TYPE CHECKING */
74 /*--------------------------------------------------*/
76 /* XXX would be nice if we did not have to pass the expected type */
78 #if defined(ENABLE_VERIFIER)
79 #define CHECK_BASIC_TYPE(expected,actual) \
81 if ((actual) != (expected)) { \
82 expectedtype = (expected); \
83 goto throw_stack_type_error; \
86 #else /* !ENABLE_VERIFIER */
87 #define CHECK_BASIC_TYPE(expected,actual)
88 #endif /* ENABLE_VERIFIER */
90 /*--------------------------------------------------*/
91 /* STACK UNDERFLOW/OVERFLOW CHECKS */
92 /*--------------------------------------------------*/
94 /* underflow checks */
96 #if defined(ENABLE_VERIFIER)
97 #define REQUIRE(num) \
99 if (stackdepth < (num)) \
100 goto throw_stack_underflow; \
102 #else /* !ENABLE_VERIFIER */
104 #endif /* ENABLE_VERIFIER */
108 /* We allow ACONST instructions inserted as arguments to builtin
109 * functions to exceed the maximum stack depth. Maybe we should check
110 * against maximum stack depth only at block boundaries?
113 /* XXX we should find a way to remove the opc/op1 check */
114 #if defined(ENABLE_VERIFIER)
115 #define CHECKOVERFLOW \
117 if (stackdepth > m->maxstack) \
118 if ((iptr->opc != ICMD_ACONST) || INSTRUCTION_MUST_CHECK(iptr))\
119 goto throw_stack_overflow; \
121 #else /* !ENABLE_VERIFIER */
122 #define CHECKOVERFLOW
123 #endif /* ENABLE_VERIFIER */
125 /*--------------------------------------------------*/
126 /* ALLOCATING STACK SLOTS */
127 /*--------------------------------------------------*/
129 #define NEWSTACK(s,v,n) \
131 sd.new->prev = curstack; \
132 sd.new->type = (s); \
134 sd.new->varkind = (v); \
135 sd.new->varnum = (n); \
137 sd.var[(n)].type = (s); \
138 sd.var[(n)].flags = 0; \
142 /* Initialize regoff, so -sia can show regnames even before reg.inc */
143 /* regs[rd->intregargnum] has to be set for this */
144 /* new->regoff = (IS_FLT_DBL_TYPE(s))?-1:rd->intreg_argnum; } */
146 #define NEWSTACKn(s,n) NEWSTACK(s,UNDEFVAR,n)
147 #define NEWSTACK0(s) NEWSTACK(s,UNDEFVAR,0)
150 /*--------------------------------------------------*/
151 /* MACROS FOR HANDLING BASIC BLOCKS */
152 /*--------------------------------------------------*/
154 /* COPYCURSTACK makes a copy of the current operand stack (curstack)
155 * and returns it in the variable copy.
157 * This macro is used to propagate the operand stack from one basic
158 * block to another. The destination block receives the copy as its
161 #define COPYCURSTACK(sd, copy) { \
165 (sd).new += stackdepth; \
168 GET_NEW_VAR(sd, new_index, s->type); \
170 copy->prev = copy-1; \
171 copy->creator = NULL; \
172 copy->type = s->type; \
174 copy->varkind = STACKVAR; \
175 copy->varnum = new_index; \
176 (sd).var[new_index].flags = OUTVAR; \
187 /* external macros ************************************************************/
189 #define BLOCK_OF(index) \
190 (jd->new_basicblocks + jd->new_basicblockindex[index])
193 /* function prototypes ********************************************************/
195 bool stack_init(void);
197 bool new_stack_analyse(jitdata *jd);
199 #endif /* _STACK_H */
203 * These are local overrides for various environment variables in Emacs.
204 * Please do not remove this and leave it at the end of the file, where
205 * Emacs will automagically detect them.
206 * ---------------------------------------------------------------------
209 * indent-tabs-mode: t
213 * vim:noexpandtab:sw=4:ts=4: