1 /* src/vm/jit/parse.c - parser for JavaVM to intermediate code translation
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
29 Changes: Carolyn Oates
34 $Id: parse.c 4600 2006-03-14 23:00:44Z edwin $
46 #include "mm/memory.h"
47 #include "native/native.h"
48 #include "toolbox/logging.h"
49 #include "vm/builtin.h"
50 #include "vm/exceptions.h"
51 #include "vm/global.h"
52 #include "vm/linker.h"
53 #include "vm/loader.h"
54 #include "vm/resolve.h"
55 #include "vm/options.h"
56 #include "vm/statistics.h"
57 #include "vm/stringlocal.h"
58 #include "vm/jit/asmpart.h"
59 #include "vm/jit/jit.h"
60 #include "vm/jit/parse.h"
61 #include "vm/jit/patcher.h"
62 #include "vm/jit/loop/loop.h"
64 /*******************************************************************************
66 function 'parse' scans the JavaVM code and generates intermediate code
68 During parsing the block index table is used to store at bit pos 0
69 a flag which marks basic block starts and at position 1 to 31 the
70 intermediate instruction index. After parsing the block index table
71 is scanned, for marked positions a block is generated and the block
72 number is stored in the block index table.
74 *******************************************************************************/
76 static exceptiontable * fillextable(methodinfo *m,
77 exceptiontable *extable,
78 exceptiontable *raw_extable,
79 int exceptiontablelength,
82 int b_count, p, src, insertBlock;
84 if (exceptiontablelength == 0)
87 b_count = *block_count;
89 for (src = exceptiontablelength-1; src >=0; src--) {
90 p = raw_extable[src].startpc;
95 p = raw_extable[src].endpc; /* see JVM Spec 4.7.3 */
96 if (p <= raw_extable[src].startpc) {
97 *exceptionptr = new_verifyerror(m,
98 "Invalid exception handler range");
102 if (p >m->jcodelength) {
103 *exceptionptr = new_verifyerror(m,
104 "Invalid exception handler end is after code end");
108 if (p<m->jcodelength) insertBlock=1; else insertBlock=0;
110 bound_check_exclusive(p);
111 /* if (p < m->jcodelength) block_insert(p); */
115 p = raw_extable[src].handlerpc;
116 extable->handlerpc = p;
120 extable->catchtype = raw_extable[src].catchtype;
121 extable->next = NULL;
122 extable->down = &extable[1];
126 *block_count = b_count;
127 return extable; /*&extable[i];*/ /* return the next free xtable* */
132 methodinfo *parse(methodinfo *m, codegendata *cd)
134 int p; /* java instruction counter */
135 int nextp; /* start of next java instruction */
136 int opcode; /* java opcode */
137 int i; /* temporary for different uses (ctrs)*/
138 int ipc = 0; /* intermediate instruction counter */
139 int b_count = 0; /* basic block counter */
140 int s_count = 0; /* stack element counter */
141 bool blockend = false; /* true if basic block end has been reached */
142 bool iswide = false; /* true if last instruction was a wide*/
143 instruction *iptr; /* current ptr into instruction array */
144 int gp; /* global java instruction counter */
146 int firstlocal = 0; /* first local variable of method */
147 exceptiontable* nextex; /* points next free entry in extable */
148 u1 *instructionstart; /* 1 for pcs which are valid instr. starts */
150 constant_classref *cr;
151 constant_classref *compr;
153 builtintable_entry *bte;
159 u2 skipBasicBlockChange;
161 /* allocate instruction array and block index table */
163 /* 1 additional for end ipc */
164 m->basicblockindex = DMNEW(s4, m->jcodelength + 1);
165 memset(m->basicblockindex, 0, sizeof(s4) * (m->jcodelength + 1));
167 instructionstart = DMNEW(u1, m->jcodelength + 1);
168 memset(instructionstart, 0, sizeof(u1) * (m->jcodelength + 1));
170 /* 1 additional for TRACEBUILTIN and 4 for MONITORENTER/EXIT */
171 /* additional MONITOREXITS are reached by branches which are 3 bytes */
173 iptr = m->instructions = DMNEW(instruction, m->jcodelength + 5);
175 /* Zero the intermediate instructions array so we don't have any
176 * invalid pointers in it if we cannot finish analyse_stack(). */
178 memset(iptr, 0, sizeof(instruction) * (m->jcodelength + 5));
180 /* compute branch targets of exception table */
182 nextex = fillextable(m,
183 &(cd->exceptiontable[cd->exceptiontablelength-1]), m->exceptiontable,
184 m->exceptiontablelength, &b_count);
187 s_count = 1 + m->exceptiontablelength; /* initialize stack element counter */
189 #if defined(USE_THREADS)
190 if (checksync && (m->flags & ACC_SYNCHRONIZED)) {
191 m->isleafmethod = false;
195 /* scan all java instructions */
199 if (m->linenumbercount == 0) {
202 linepcchange = m->linenumbers[0].start_pc;
205 skipBasicBlockChange=0;
206 for (p = 0, gp = 0; p < m->jcodelength; gp += (nextp - p), p = nextp) {
208 /* mark this position as a valid instruction start */
210 instructionstart[gp] = 1;
211 if (linepcchange==p) {
212 if (m->linenumbercount > lineindex) {
213 currentline = m->linenumbers[lineindex].line_number;
215 if (lineindex < m->linenumbercount)
216 linepcchange = m->linenumbers[lineindex].start_pc;
221 /* fetch next opcode */
223 opcode = code_get_u1(p, m);
225 if (!skipBasicBlockChange) {
226 m->basicblockindex[gp] |= (ipc << 1); /*store intermed cnt*/
227 } else skipBasicBlockChange=0;
229 /* some compilers put a JAVA_NOP after a blockend instruction */
231 if ((opcode != JAVA_NOP) && (blockend == true)) {
232 /* start new block */
238 nextp = p + jcommandsize[opcode]; /* compute next instruction start */
240 if (nextp > m->jcodelength) {
241 *exceptionptr = new_verifyerror(m,
242 "Unexpected end of bytecode");
246 s_count += stackreq[opcode]; /* compute stack element count */
251 /* pushing constants onto the stack p */
254 LOADCONST_I(code_get_s1(p+1,m));
258 LOADCONST_I(code_get_s2(p+1,m));
262 i = code_get_u1(p + 1, m);
263 goto pushconstantitem;
267 i = code_get_u2(p + 1, m);
271 if (i >= m->class->cpcount) {
272 *exceptionptr = new_verifyerror(m,
273 "Attempt to access constant outside range");
277 switch (m->class->cptags[i]) {
278 case CONSTANT_Integer:
279 LOADCONST_I(((constant_integer *) (m->class->cpinfos[i]))->value);
282 LOADCONST_L(((constant_long *) (m->class->cpinfos[i]))->value);
285 LOADCONST_F(((constant_float *) (m->class->cpinfos[i]))->value);
287 case CONSTANT_Double:
288 LOADCONST_D(((constant_double *) (m->class->cpinfos[i]))->value);
290 case CONSTANT_String:
291 LOADCONST_A(literalstring_new((utf *) (m->class->cpinfos[i])));
294 cr = (constant_classref *) (m->class->cpinfos[i]);
296 if (!resolve_classref(m, cr, resolveLazy, true,
300 /* if not resolved, c == NULL */
302 LOADCONST_A_CLASS(c, cr);
305 *exceptionptr = new_verifyerror(m,
306 "Invalid constant type to push");
311 case JAVA_ACONST_NULL:
322 LOADCONST_I(opcode - JAVA_ICONST_0);
327 LOADCONST_L(opcode - JAVA_LCONST_0);
333 LOADCONST_F(opcode - JAVA_FCONST_0);
338 LOADCONST_D(opcode - JAVA_DCONST_0);
341 /* loading variables onto the stack */
349 i = code_get_u1(p + 1,m);
351 i = code_get_u2(p + 1,m);
355 OP1LOAD(opcode, i + firstlocal);
362 OP1LOAD(ICMD_ILOAD, opcode - JAVA_ILOAD_0 + firstlocal);
369 OP1LOAD(ICMD_LLOAD, opcode - JAVA_LLOAD_0 + firstlocal);
376 OP1LOAD(ICMD_FLOAD, opcode - JAVA_FLOAD_0 + firstlocal);
383 OP1LOAD(ICMD_DLOAD, opcode - JAVA_DLOAD_0 + firstlocal);
390 OP1LOAD(ICMD_ALOAD, opcode - JAVA_ALOAD_0 + firstlocal);
393 /* storing stack values into local variables */
401 i = code_get_u1(p + 1,m);
403 i = code_get_u2(p + 1,m);
407 OP1STORE(opcode, i + firstlocal);
414 OP1STORE(ICMD_ISTORE, opcode - JAVA_ISTORE_0 + firstlocal);
421 OP1STORE(ICMD_LSTORE, opcode - JAVA_LSTORE_0 + firstlocal);
428 OP1STORE(ICMD_FSTORE, opcode - JAVA_FSTORE_0 + firstlocal);
435 OP1STORE(ICMD_DSTORE, opcode - JAVA_DSTORE_0 + firstlocal);
442 OP1STORE(ICMD_ASTORE, opcode - JAVA_ASTORE_0 + firstlocal);
450 i = code_get_u1(p + 1,m);
451 v = code_get_s1(p + 2,m);
454 i = code_get_u2(p + 1,m);
455 v = code_get_s2(p + 3,m);
459 INDEX_ONEWORD(i + firstlocal);
460 OP2I(opcode, i + firstlocal, v);
464 /* wider index for loading, storing and incrementing */
471 /* managing arrays ****************************************************/
474 switch (code_get_s1(p + 1, m)) {
476 bte = builtintable_get_internal(BUILTIN_newarray_boolean);
479 bte = builtintable_get_internal(BUILTIN_newarray_char);
482 bte = builtintable_get_internal(BUILTIN_newarray_float);
485 bte = builtintable_get_internal(BUILTIN_newarray_double);
488 bte = builtintable_get_internal(BUILTIN_newarray_byte);
491 bte = builtintable_get_internal(BUILTIN_newarray_short);
494 bte = builtintable_get_internal(BUILTIN_newarray_int);
497 bte = builtintable_get_internal(BUILTIN_newarray_long);
500 *exceptionptr = new_verifyerror(m,
501 "Invalid array-type to create");
504 BUILTIN(bte, true, NULL, currentline);
508 i = code_get_u2(p + 1, m);
509 compr = (constant_classref *) class_getconstant(m->class, i, CONSTANT_Class);
513 if (!(cr = class_get_classref_multiarray_of(1, compr)))
516 if (!resolve_classref(m, cr, resolveLazy, true, true, &c))
519 LOADCONST_A_BUILTIN(c, cr);
520 bte = builtintable_get_internal(BUILTIN_newarray);
521 BUILTIN(bte, true, NULL, currentline);
525 case JAVA_MULTIANEWARRAY:
526 m->isleafmethod = false;
527 i = code_get_u2(p + 1, m);
529 s4 v = code_get_u1(p + 3, m);
531 cr = (constant_classref *) class_getconstant(m->class, i, CONSTANT_Class);
535 if (!resolve_classref(m, cr, resolveLazy, true, true, &c))
538 /* if unresolved, c == NULL */
539 OP2AT(opcode, v, c, cr, currentline);
561 i = p + code_get_s2(p + 1,m);
570 i = p + code_get_s4(p + 1,m);
579 i = code_get_u1(p + 1,m);
581 i = code_get_u2(p + 1,m);
587 OP1LOAD(opcode, i + firstlocal);
597 /* zero val.a so no patcher is inserted */
598 /* the type checker may set this later */
605 /* zero val.a so no patcher is inserted */
606 /* the type checker may set this later */
612 /* table jumps ********************************************************/
614 case JAVA_LOOKUPSWITCH:
621 nextp = ALIGN((p + 1), 4);
623 if (nextp + 8 > m->jcodelength) {
624 *exceptionptr = new_verifyerror(m,
625 "Unexpected end of bytecode");
629 tablep = (s4 *) (m->jcode + nextp);
631 OP2A(opcode, 0, tablep, currentline);
635 j = p + code_get_s4(nextp, m);
636 *tablep = j; /* restore for little endian */
642 /* number of pairs */
644 num = code_get_u4(nextp, m);
649 if (nextp + 8 * num > m->jcodelength) {
650 *exceptionptr = new_verifyerror(m,
651 "Unexpected end of bytecode");
655 for (i = 0; i < num; i++) {
658 j = code_get_s4(nextp, m);
659 *tablep = j; /* restore for little endian */
663 /* check if the lookup table is sorted correctly */
665 if (i && (j <= prevvalue)) {
666 *exceptionptr = new_verifyerror(m, "Unsorted lookup switch");
673 j = p + code_get_s4(nextp,m);
674 *tablep = j; /* restore for little endian */
685 case JAVA_TABLESWITCH:
691 nextp = ALIGN((p + 1), 4);
692 if (nextp + 12 > m->jcodelength) {
693 *exceptionptr = new_verifyerror(m,
694 "Unexpected end of bytecode");
698 tablep = (s4 *) (m->jcode + nextp);
700 OP2A(opcode, 0, tablep, currentline);
704 j = p + code_get_s4(nextp, m);
705 *tablep = j; /* restore for little endian */
713 j = code_get_s4(nextp, m);
714 *tablep = j; /* restore for little endian */
720 num = code_get_s4(nextp, m);
721 *tablep = num; /* restore for little endian */
725 num -= j; /* difference of upper - lower */
728 *exceptionptr = new_verifyerror(m,
729 "invalid TABLESWITCH: upper bound < lower bound");
733 if (nextp + 4 * (num + 1) > m->jcodelength) {
734 *exceptionptr = new_verifyerror(m,
735 "Unexpected end of bytecode");
739 for (i = 0; i <= num; i++) {
740 j = p + code_get_s4(nextp,m);
741 *tablep = j; /* restore for little endian */
752 /* load and store of object fields ************************************/
756 m->isleafmethod = false;
765 unresolved_field *uf;
768 i = code_get_u2(p + 1, m);
769 fr = class_getconstant(m->class, i,
774 OP2A_NOINC(opcode, fr->parseddesc.fd->type, fr, currentline);
776 if (!(uf = create_unresolved_field(m->class,
781 /* store unresolved_field pointer */
785 /* only with -noverify, otherwise the typechecker does this */
788 if (!resolve_field(uf, resolveLazy, &fi))
801 /* method invocation **************************************************/
803 case JAVA_INVOKESTATIC:
804 i = code_get_u2(p + 1, m);
808 unresolved_method *um;
811 m->isleafmethod = false;
813 mr = class_getconstant(m->class, i,
818 md = mr->parseddesc.md;
821 if (!descriptor_params_from_paramtypes(md, ACC_STATIC))
824 OP2A_NOINC(opcode, 0, mr, currentline);
826 um = create_unresolved_method(m->class,
832 /* store the unresolved_method pointer */
836 /* only with -noverify, otherwise the typechecker does this */
839 if (!resolve_method(um, resolveLazy, &mi))
851 case JAVA_INVOKESPECIAL:
852 case JAVA_INVOKEVIRTUAL:
856 unresolved_method *um;
859 m->isleafmethod = false;
861 i = code_get_u2(p + 1, m);
862 mr = class_getconstant(m->class, i,
867 md = mr->parseddesc.md;
870 if (!descriptor_params_from_paramtypes(md, 0))
873 OP2A_NOINC(opcode, 0, mr, currentline);
875 um = create_unresolved_method(m->class,
881 /* store the unresolved_method* */
885 /* only with -noverify, otherwise the typechecker does this */
888 if (!resolve_method(um, resolveLazy, &mi))
900 case JAVA_INVOKEINTERFACE:
901 i = code_get_u2(p + 1, m);
905 unresolved_method *um;
908 m->isleafmethod = false;
910 mr = class_getconstant(m->class, i,
911 CONSTANT_InterfaceMethodref);
915 md = mr->parseddesc.md;
918 if (!descriptor_params_from_paramtypes(md, 0))
921 OP2A_NOINC(opcode, 0, mr, currentline);
923 um = create_unresolved_method(m->class,
929 /* store the unresolved_method* */
933 /* only with -noverify, otherwise the typechecker does this */
936 if (!resolve_method(um, resolveLazy, &mi))
948 /* miscellaneous object operations ************************************/
951 i = code_get_u2(p + 1, m);
952 cr = (constant_classref *) class_getconstant(m->class, i, CONSTANT_Class);
956 if (!resolve_classref(m, cr, resolveLazy, true, true,
960 LOADCONST_A_BUILTIN(c, cr);
961 bte = builtintable_get_internal(BUILTIN_new);
962 BUILTIN(bte, true, NULL, currentline);
967 i = code_get_u2(p + 1, m);
968 cr = (constant_classref *) class_getconstant(m->class, i, CONSTANT_Class);
972 if (!resolve_classref(m, cr, resolveLazy, true,
976 if (cr->name->text[0] == '[') {
977 /* array type cast-check */
978 OP2AT(opcode, 0, c, cr, currentline);
979 m->isleafmethod = false;
982 /* object type cast-check */
983 OP2AT(opcode, 1, c, cr, currentline);
987 case JAVA_INSTANCEOF:
988 i = code_get_u2(p + 1,m);
989 cr = (constant_classref *) class_getconstant(m->class, i, CONSTANT_Class);
993 if (!resolve_classref(m, cr, resolveLazy, true, true, &c))
996 if (cr->name->text[0] == '[') {
997 /* array type cast-check */
998 LOADCONST_A_BUILTIN(c, cr);
999 bte = builtintable_get_internal(BUILTIN_arrayinstanceof);
1000 BUILTIN(bte, false, NULL, currentline);
1004 /* object type cast-check */
1005 OP2AT(opcode, 1, c, cr, currentline);
1009 case JAVA_MONITORENTER:
1010 #if defined(USE_THREADS)
1013 bte = builtintable_get_internal(BUILTIN_monitorenter);
1014 BUILTIN(bte, false, NULL, currentline);
1023 case JAVA_MONITOREXIT:
1024 #if defined(USE_THREADS)
1026 bte = builtintable_get_internal(BUILTIN_monitorexit);
1027 BUILTIN(bte, false, NULL, currentline);
1035 /* any other basic operation ******************************************/
1038 #if !SUPPORT_DIVISION
1039 bte = builtintable_get_internal(BUILTIN_idiv);
1040 OP2A(opcode, bte->md->paramcount, bte, currentline);
1041 m->isleafmethod = false;
1048 #if !SUPPORT_DIVISION
1049 bte = builtintable_get_internal(BUILTIN_irem);
1050 OP2A(opcode, bte->md->paramcount, bte, currentline);
1051 m->isleafmethod = false;
1058 #if !(SUPPORT_DIVISION && SUPPORT_LONG && SUPPORT_LONG_DIV)
1059 bte = builtintable_get_internal(BUILTIN_ldiv);
1060 OP2A(opcode, bte->md->paramcount, bte, currentline);
1061 m->isleafmethod = false;
1068 #if !(SUPPORT_DIVISION && SUPPORT_LONG && SUPPORT_LONG_DIV)
1069 bte = builtintable_get_internal(BUILTIN_lrem);
1070 OP2A(opcode, bte->md->paramcount, bte, currentline);
1071 m->isleafmethod = false;
1078 #if defined(__I386__)
1081 bte = builtintable_get_internal(BUILTIN_frem);
1082 BUILTIN(bte, false, NULL, currentline);
1087 #if defined(__I386__)
1090 bte = builtintable_get_internal(BUILTIN_drem);
1091 BUILTIN(bte, false, NULL, currentline);
1096 #if defined(__ALPHA__)
1098 bte = builtintable_get_internal(BUILTIN_f2i);
1099 BUILTIN(bte, false, NULL, currentline);
1108 #if defined(__ALPHA__)
1110 bte = builtintable_get_internal(BUILTIN_f2l);
1111 BUILTIN(bte, false, NULL, currentline);
1120 #if defined(__ALPHA__)
1122 bte = builtintable_get_internal(BUILTIN_d2i);
1123 BUILTIN(bte, false, NULL, currentline);
1132 #if defined(__ALPHA__)
1134 bte = builtintable_get_internal(BUILTIN_d2l);
1135 BUILTIN(bte, false, NULL, currentline);
1143 case JAVA_BREAKPOINT:
1145 new_verifyerror(m, "Quick instructions shouldn't appear yet.");
1148 case 186: /* unused opcode */
1203 new_verifyerror(m,"Illegal opcode %d at instr %d\n",
1214 /* If WIDE was used correctly, iswide should have been reset by now. */
1215 if (iswide && opcode != JAVA_WIDE) {
1216 *exceptionptr = new_verifyerror(m,
1217 "Illegal instruction: WIDE before incompatible opcode");
1223 if (p != m->jcodelength) {
1224 printf("p (%d) != m->jcodelength (%d)\n",p,m->jcodelength);
1225 *exceptionptr = new_verifyerror(m,
1226 "Command-sequence crosses code-boundary");
1231 *exceptionptr = new_verifyerror(m, "Falling off the end of the code");
1235 /* adjust block count if target 0 is not first intermediate instruction */
1237 if (!m->basicblockindex[0] || (m->basicblockindex[0] > 1))
1240 /* copy local to method variables */
1242 m->instructioncount = ipc;
1243 m->basicblockcount = b_count;
1244 m->stackcount = s_count + m->basicblockcount * m->maxstack;
1246 /* allocate stack table */
1248 m->stack = DMNEW(stackelement, m->stackcount);
1253 bptr = m->basicblocks = DMNEW(basicblock, b_count + 1); /* one more for end ipc */
1258 /* additional block if target 0 is not first intermediate instruction */
1260 if (!m->basicblockindex[0] || (m->basicblockindex[0] > 1)) {
1261 bptr->iinstr = m->instructions;
1264 bptr->type = BBTYPE_STD;
1265 bptr->branchrefs = NULL;
1266 bptr->pre_count = 0;
1267 bptr->debug_nr = m->c_debug_nr++;
1270 (bptr - 1)->next = bptr;
1273 /* allocate blocks */
1275 for (p = 0; p < m->jcodelength; p++) {
1276 /* for (p = 0; p < m->jcodelength; p++) { */
1277 if (m->basicblockindex[p] & 1) {
1278 /* Check if this block starts at the beginning of an */
1281 if (!instructionstart[p]) {
1282 *exceptionptr = new_verifyerror(m,
1283 "Branch into middle of instruction");
1287 /* allocate the block */
1288 bptr->iinstr = m->instructions + (m->basicblockindex[p] >> 1);
1289 bptr->debug_nr = m->c_debug_nr++;
1291 (bptr - 1)->icount = bptr->iinstr - (bptr - 1)->iinstr;
1295 bptr->type = BBTYPE_STD;
1296 bptr->branchrefs = NULL;
1297 m->basicblockindex[p] = b_count;
1298 bptr->pre_count = 0;
1301 (bptr - 1)->next = bptr;
1305 /* allocate additional block at end */
1307 bptr->instack = bptr->outstack = NULL;
1308 bptr->indepth = bptr->outdepth = 0;
1309 bptr->iinstr = NULL;
1310 (bptr - 1)->icount = (m->instructions + m->instructioncount) - (bptr - 1)->iinstr;
1315 bptr->type = BBTYPE_STD;
1316 bptr->branchrefs = NULL;
1317 bptr->pre_count = 0;
1318 bptr->debug_nr = m->c_debug_nr++;
1319 (bptr - 1)->next = bptr;
1322 if (cd->exceptiontablelength > 0) {
1323 cd->exceptiontable[cd->exceptiontablelength - 1].down = NULL;
1326 for (i = 0; i < cd->exceptiontablelength; ++i) {
1327 p = cd->exceptiontable[i].startpc;
1328 cd->exceptiontable[i].start = m->basicblocks + m->basicblockindex[p];
1330 p = cd->exceptiontable[i].endpc;
1331 cd->exceptiontable[i].end = (p == m->jcodelength) ? (m->basicblocks + m->basicblockcount /*+ 1*/) : (m->basicblocks + m->basicblockindex[p]);
1333 p = cd->exceptiontable[i].handlerpc;
1334 cd->exceptiontable[i].handler = m->basicblocks + m->basicblockindex[p];
1338 /* just return methodinfo* to signal everything was ok */
1345 * These are local overrides for various environment variables in Emacs.
1346 * Please do not remove this and leave it at the end of the file, where
1347 * Emacs will automagically detect them.
1348 * ---------------------------------------------------------------------
1351 * indent-tabs-mode: t
1355 * vim:noexpandtab:sw=4:ts=4: