1 /* src/vm/jit/verify/typecheck.c - typechecking (part of bytecode verification)
3 Copyright (C) 1996-2005 R. Grafl, A. Krall, C. Kruegel, C. Oates,
4 R. Obermaisser, M. Platter, M. Probst, S. Ring, E. Steiner,
5 C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich, J. Wenninger,
6 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., 59 Temple Place - Suite 330, Boston, MA
25 Contact: cacao@complang.tuwien.ac.at
27 Authors: Edwin Steiner
29 Changes: Christian Thalinger
31 $Id: typecheck.c 4332 2006-01-21 20:22:16Z edwin $
37 What's the purpose of the `typechecker`?
38 ----------------------------------------
40 The typechecker analyses (the intermediate repr. of) the bytecode of
41 each method and ensures that for each instruction the values on the
42 stack and in local variables are of the correct type whenever the
43 instruction is executed.
45 type checking is a mandatory part of bytecode verification.
48 How does the typechecker work?
49 ------------------------------
51 The JVM stack and the local variables are not statically typed, so the
52 typechecker has to *infer* the static types of stack slots and local
53 variables at each point of the method. The JVM spec imposes a lot of
54 restrictions on the bytecode in order to guarantee that this is always
57 Basically the typechecker solves the data flow equations of the method.
58 This is done in the usual way for a forward data flow analysis: Starting
59 from the entry point of the method the typechecker follows the CFG and
60 records the type of each stack slot and local variable at each point[1].
61 When two or more control flow paths merge at a point, the union of the
62 types for each slot/variable is taken. The algorithm continues to follow
63 all possible paths[2] until the recorded types do not change anymore (ie.
64 the equations have been solved).
66 If the solution has been reached and the resulting types are valid for
67 all instructions, then type checking terminates with success, otherwise
68 an exception is thrown.
71 Why is this code so damn complicated?
72 -------------------------------------
74 Short answer: The devil's in the details.
76 While the basic operation of the typechecker is no big deal, there are
77 many properties of Java bytecode which make type checking hard. Some of
78 them are not even addressed in the JVM spec. Some problems and their
81 *) Finding a good representation of the union of two reference types is
82 difficult because of multiple inheritance of interfaces.
84 Solution: The typeinfo system can represent such "merged" types by a
85 list of proper subclasses of a class. Example:
87 typeclass=java.lang.Object merged={ InterfaceA, InterfaceB }
89 represents the result of merging two interface types "InterfaceA"
92 *) When the code of a method is verified, there may still be unresolved
93 references to classes/methods/fields in the code, which we may not force
94 to be resolved eagerly. (A similar problem arises because of the special
95 checks for protected members.)
97 Solution: The typeinfo system knows how to deal with unresolved
98 class references. Whenever a check has to be performed for an
99 unresolved type, the type is annotated with constraints representing
100 the check. Later, when the type is resolved, the constraints are
101 checked. (See the constrain_unresolved_... and the resolve_...
104 *) The boundaries of jsr subroutines are not well-defined. For a given
105 instruction it may be impossible to tell whether it is part of a
106 subroutine, or to which subroutine it belongs.
108 Solution: The typechecker implements a method developed by
109 Alessandro Coglio[4] which treats each returnAddress as a distinct
110 type that is not merged with other returnAddresses. This way, when a
111 RET instruction is reached, we know exactly which types to propagate
112 to which return target among the possible targets of the RET. The
113 downside of this method is, that for each slot/variable we must
114 store not just one type, but one type *for each possible use of the
115 returnAddresses* that currently are in a slot/variable.[5]
117 *) Checks for uninitialized object instances are hard because after the
118 invocation of <init> on an uninitialized object *all* slots/variables
119 referring to this object (and exactly those slots/variables) must be
120 marked as initialized.
122 Solution: The JVM spec describes a solution, which has been
123 implemented in this typechecker.
128 [1] Actually only the types of slots/variables at the start of each
129 basic block are remembered. Within a basic block the algorithm only keeps
130 the types of the slots/variables for the "current" instruction which is
133 [2] Actually the algorithm iterates through the basic block list until
134 there are no more changes. Theoretically it would be wise to sort the
135 basic blocks topologically beforehand, but the number of average/max
136 iterations observed is so low, that this was not deemed necessary.
138 [3] This is similar to a method proposed by: Alessandro Coglio et al., A
139 Formal Specification of Java Class Loading, Technical Report, Kestrel
140 Institute April 2000, revised July 2000
141 http://www.kestrel.edu/home/people/coglio/loading.pdf
142 An important difference is that Coglio's subtype constraints are checked
143 after loading, while our constraints are checked when the field/method
144 is accessed for the first time, so we can guarantee lexically correct
147 [4] Alessandro Coglio, Simple Verification Technique for Complex Java
148 Bytecode Subroutines, 4th ECOOP Workshop on Formal Techniques for
149 Java-like Programs, June 2002
150 http://www.kestrel.edu/home/people/coglio/ftjp02.pdf
152 [5] This is a major source of code complexity. The main data structures
153 dealing with this are the "typevector set" and the typestack. The
154 "typevector set" is a set of alternative typevectors, such that each
155 typevector specifies the types of the local variables for a single
156 combination of returnAddresses used. Thus we support full polymorphism
157 of subroutines over the types of local variables. The typestack,
158 however, does not support polymorphism, both for historical and JVM-spec
159 reasons. A slot of the typestack may, however, contain multiple
160 alternative returnAddresses, which is realized by a linked list hanging
161 of the typeinfo of the stack slot.
169 #include "vm/types.h"
170 #include "vm/global.h"
172 #ifdef ENABLE_VERIFIER
174 #include "mm/memory.h"
175 #include "toolbox/logging.h"
176 #include "native/native.h"
177 #include "vm/builtin.h"
178 #include "vm/jit/patcher.h"
179 #include "vm/loader.h"
180 #include "vm/options.h"
181 #include "vm/jit/jit.h"
182 #include "vm/jit/stack.h"
183 #include "vm/access.h"
184 #include "vm/resolve.h"
187 /****************************************************************************/
189 /****************************************************************************/
191 #ifdef TYPECHECK_DEBUG
192 #define TYPECHECK_ASSERT(cond) assert(cond)
194 #define TYPECHECK_ASSERT(cond)
197 #ifdef TYPECHECK_VERBOSE_OPT
198 bool typecheckverbose = false;
199 #define DOLOG(action) do { if (typecheckverbose) {action;} } while(0)
201 #define DOLOG(action)
204 #ifdef TYPECHECK_VERBOSE
205 #define TYPECHECK_VERBOSE_IMPORTANT
206 #define LOG(str) DOLOG(log_text(str))
207 #define LOG1(str,a) DOLOG(dolog(str,a))
208 #define LOG2(str,a,b) DOLOG(dolog(str,a,b))
209 #define LOG3(str,a,b,c) DOLOG(dolog(str,a,b,c))
210 #define LOGIF(cond,str) DOLOG(do {if (cond) log_text(str);} while(0))
211 #ifdef TYPEINFO_DEBUG
212 #define LOGINFO(info) DOLOG(do {typeinfo_print_short(get_logfile(),(info));log_plain("\n");} while(0))
214 #define LOGINFO(info)
215 #define typevectorset_print(x,y,z)
217 #define LOGFLUSH DOLOG(fflush(get_logfile()))
218 #define LOGNL DOLOG(log_plain("\n"))
219 #define LOGSTR(str) DOLOG(log_plain(str))
220 #define LOGSTR1(str,a) DOLOG(dolog_plain(str,a))
221 #define LOGSTR2(str,a,b) DOLOG(dolog_plain(str,a,b))
222 #define LOGSTR3(str,a,b,c) DOLOG(dolog_plain(str,a,b,c))
223 #define LOGSTRu(utf) DOLOG(log_plain_utf(utf))
224 #define LOGNAME(c) DOLOG(do {log_plain_utf(IS_CLASSREF(c) ? c.ref->name : c.cls->name);} while(0))
228 #define LOG2(str,a,b)
229 #define LOG3(str,a,b,c)
230 #define LOGIF(cond,str)
231 #define LOGINFO(info)
235 #define LOGSTR1(str,a)
236 #define LOGSTR2(str,a,b)
237 #define LOGSTR3(str,a,b,c)
242 #ifdef TYPECHECK_VERBOSE_IMPORTANT
243 #define LOGimp(str) DOLOG(log_text(str))
244 #define LOGimpSTR(str) DOLOG(log_plain(str))
245 #define LOGimpSTRu(utf) DOLOG(log_plain_utf(utf))
248 #define LOGimpSTR(str)
249 #define LOGimpSTRu(utf)
252 #if defined(TYPECHECK_VERBOSE) || defined(TYPECHECK_VERBOSE_IMPORTANT)
258 typestack_print(FILE *file,stackptr stack)
260 #ifdef TYPEINFO_DEBUG
262 /*fprintf(file,"<%p>",stack);*/
263 typeinfo_print_stacktype(file,stack->type,&(stack->typeinfo));
265 if (stack) fprintf(file," ");
272 typestate_print(FILE *file,stackptr instack,typevector *localset,int size)
274 fprintf(file,"Stack: ");
275 typestack_print(file,instack);
276 fprintf(file," Locals:");
277 typevectorset_print(file,localset,size);
282 /****************************************************************************/
284 /****************************************************************************/
286 #ifdef TYPECHECK_DEBUG
287 /*#define TYPECHECK_STATISTICS*/
290 #ifdef TYPECHECK_STATISTICS
291 #define STAT_ITERATIONS 10
292 #define STAT_BLOCKS 10
293 #define STAT_LOCALS 16
295 static int stat_typechecked = 0;
296 static int stat_typechecked_jsr = 0;
297 static int stat_methods_with_handlers = 0;
298 static int stat_methods_maythrow = 0;
299 static int stat_iterations[STAT_ITERATIONS+1] = { 0 };
300 static int stat_reached = 0;
301 static int stat_copied = 0;
302 static int stat_merged = 0;
303 static int stat_merging_changed = 0;
304 static int stat_backwards = 0;
305 static int stat_blocks[STAT_BLOCKS+1] = { 0 };
306 static int stat_locals[STAT_LOCALS+1] = { 0 };
307 static int stat_ins = 0;
308 static int stat_ins_maythrow = 0;
309 static int stat_ins_stack = 0;
310 static int stat_ins_field = 0;
311 static int stat_ins_field_unresolved = 0;
312 static int stat_ins_field_uninitialized = 0;
313 static int stat_ins_invoke = 0;
314 static int stat_ins_invoke_unresolved = 0;
315 static int stat_ins_primload = 0;
316 static int stat_ins_aload = 0;
317 static int stat_ins_builtin = 0;
318 static int stat_ins_builtin_gen = 0;
319 static int stat_ins_branch = 0;
320 static int stat_ins_switch = 0;
321 static int stat_ins_primitive_return = 0;
322 static int stat_ins_areturn = 0;
323 static int stat_ins_areturn_unresolved = 0;
324 static int stat_ins_athrow = 0;
325 static int stat_ins_athrow_unresolved = 0;
326 static int stat_ins_unchecked = 0;
327 static int stat_handlers_reached = 0;
328 static int stat_savedstack = 0;
330 #define TYPECHECK_MARK(var) ((var) = true)
331 #define TYPECHECK_COUNT(cnt) (cnt)++
332 #define TYPECHECK_COUNTIF(cond,cnt) do{if(cond) (cnt)++;} while(0)
333 #define TYPECHECK_COUNT_FREQ(array,val,limit) \
335 if ((val) < (limit)) (array)[val]++; \
336 else (array)[limit]++; \
339 static void print_freq(FILE *file,int *array,int limit)
342 for (i=0; i<limit; ++i)
343 fprintf(file," %3d: %8d\n",i,array[i]);
344 fprintf(file," >=%3d: %8d\n",limit,array[limit]);
347 void typecheck_print_statistics(FILE *file) {
348 fprintf(file,"typechecked methods: %8d\n",stat_typechecked);
349 fprintf(file," with JSR : %8d\n",stat_typechecked_jsr);
350 fprintf(file," with handler(s): %8d\n",stat_methods_with_handlers);
351 fprintf(file," with throw(s) : %8d\n",stat_methods_maythrow);
352 fprintf(file,"reached blocks : %8d\n",stat_reached);
353 fprintf(file,"copied states : %8d\n",stat_copied);
354 fprintf(file,"merged states : %8d\n",stat_merged);
355 fprintf(file,"merging changed : %8d\n",stat_merging_changed);
356 fprintf(file,"backwards branches : %8d\n",stat_backwards);
357 fprintf(file,"handlers reached : %8d\n",stat_handlers_reached);
358 fprintf(file,"saved stack (times): %8d\n",stat_savedstack);
359 fprintf(file,"instructions : %8d\n",stat_ins);
360 fprintf(file," stack : %8d\n",stat_ins_stack);
361 fprintf(file," field access : %8d\n",stat_ins_field);
362 fprintf(file," (unresolved) : %8d\n",stat_ins_field_unresolved);
363 fprintf(file," (uninit.) : %8d\n",stat_ins_field_uninitialized);
364 fprintf(file," invocations : %8d\n",stat_ins_invoke);
365 fprintf(file," (unresolved) : %8d\n",stat_ins_invoke_unresolved);
366 fprintf(file," load primitive : (currently not counted) %8d\n",stat_ins_primload);
367 fprintf(file," load address : %8d\n",stat_ins_aload);
368 fprintf(file," builtins : %8d\n",stat_ins_builtin);
369 fprintf(file," generic : %8d\n",stat_ins_builtin_gen);
370 fprintf(file," branches : %8d\n",stat_ins_branch);
371 fprintf(file," switches : %8d\n",stat_ins_switch);
372 fprintf(file," prim. return : %8d\n",stat_ins_primitive_return);
373 fprintf(file," areturn : %8d\n",stat_ins_areturn);
374 fprintf(file," (unresolved) : %8d\n",stat_ins_areturn_unresolved);
375 fprintf(file," athrow : %8d\n",stat_ins_athrow);
376 fprintf(file," (unresolved) : %8d\n",stat_ins_athrow_unresolved);
377 fprintf(file," unchecked : %8d\n",stat_ins_unchecked);
378 fprintf(file," maythrow : %8d\n",stat_ins_maythrow);
379 fprintf(file,"iterations used:\n");
380 print_freq(file,stat_iterations,STAT_ITERATIONS);
381 fprintf(file,"basic blocks per method / 10:\n");
382 print_freq(file,stat_blocks,STAT_BLOCKS);
383 fprintf(file,"locals:\n");
384 print_freq(file,stat_locals,STAT_LOCALS);
389 #define TYPECHECK_COUNT(cnt)
390 #define TYPECHECK_MARK(var)
391 #define TYPECHECK_COUNTIF(cond,cnt)
392 #define TYPECHECK_COUNT_FREQ(array,val,limit)
395 /****************************************************************************/
396 /* MACROS FOR THROWING EXCEPTIONS */
397 /****************************************************************************/
399 #define TYPECHECK_VERIFYERROR_ret(m,msg,retval) \
401 *exceptionptr = new_verifyerror((m), (msg)); \
405 #define TYPECHECK_VERIFYERROR_main(msg) TYPECHECK_VERIFYERROR_ret(state.m,(msg),NULL)
406 #define TYPECHECK_VERIFYERROR_bool(msg) TYPECHECK_VERIFYERROR_ret(state->m,(msg),false)
408 /****************************************************************************/
409 /* MACROS FOR STACK SLOT TYPE CHECKING */
410 /****************************************************************************/
412 #define TYPECHECK_CHECK_TYPE(sp,tp,msg) \
414 if ((sp)->type != (tp)) { \
415 *exceptionptr = new_verifyerror(state->m, (msg)); \
420 #define TYPECHECK_INT(sp) TYPECHECK_CHECK_TYPE(sp,TYPE_INT,"Expected to find integer on stack")
421 #define TYPECHECK_LNG(sp) TYPECHECK_CHECK_TYPE(sp,TYPE_LNG,"Expected to find long on stack")
422 #define TYPECHECK_FLT(sp) TYPECHECK_CHECK_TYPE(sp,TYPE_FLT,"Expected to find float on stack")
423 #define TYPECHECK_DBL(sp) TYPECHECK_CHECK_TYPE(sp,TYPE_DBL,"Expected to find double on stack")
424 #define TYPECHECK_ADR(sp) TYPECHECK_CHECK_TYPE(sp,TYPE_ADR,"Expected to find object on stack")
426 /****************************************************************************/
427 /* VERIFIER STATE STRUCT */
428 /****************************************************************************/
430 /* verifier_state - This structure keeps the current state of the */
431 /* bytecode verifier for passing it between verifier functions. */
433 typedef struct verifier_state {
434 stackptr curstack; /* input stack top for current instruction */
435 instruction *iptr; /* pointer to current instruction */
436 basicblock *bptr; /* pointer to current basic block */
438 methodinfo *m; /* the current method */
439 codegendata *cd; /* codegendata for current method */
440 registerdata *rd; /* registerdata for current method */
442 s4 numlocals; /* number of local variables */
443 s4 validlocals; /* number of Java-accessible locals */
444 void *localbuf; /* local variable types for each block start */
445 typevector *localset; /* typevector set for local variables */
446 typedescriptor returntype; /* return type of the current method */
448 stackptr savedstackbuf; /* buffer for saving the stack */
449 stackptr savedstack; /* saved instack of current block */
451 exceptiontable **handlers; /* active exception handlers */
452 stackelement excstack; /* instack for exception handlers */
454 bool repeat; /* if true, blocks are iterated over again */
455 bool initmethod; /* true if this is an "<init>" method */
456 bool jsrencountered; /* true if we there was a JSR */
458 #ifdef TYPECHECK_STATISTICS
459 bool stat_maythrow; /* at least one instruction may throw */
463 /****************************************************************************/
464 /* TYPESTACK MACROS AND FUNCTIONS */
466 /* These macros and functions act on the 'type stack', which is a shorthand */
467 /* for the types of the stackslots of the current stack. The type of a */
468 /* stack slot is usually described by a TYPE_* constant and -- for TYPE_ADR */
469 /* -- by the typeinfo of the slot. The only thing that makes the type stack */
470 /* more complicated are returnAddresses of local subroutines, because a */
471 /* single stack slot may contain a set of more than one possible return */
472 /* address. This is handled by 'return address sets'. A return address set */
473 /* is kept as a linked list dangling off the typeinfo of the stack slot. */
474 /****************************************************************************/
476 #define TYPESTACK_IS_RETURNADDRESS(sptr) \
477 TYPE_IS_RETURNADDRESS((sptr)->type,(sptr)->typeinfo)
479 #define TYPESTACK_RETURNADDRESSSET(sptr) \
480 ((typeinfo_retaddr_set*)TYPEINFO_RETURNADDRESS((sptr)->typeinfo))
482 #define RETURNADDRESSSET_SEEK(set,pos) \
483 do {int i; for (i=pos;i--;) set=set->alt;} while(0)
485 /* typestack_copy **************************************************************
487 Copy the types on the given stack to the destination stack.
489 This function does a straight forward copy except for returnAddress types.
490 For returnAddress slots only the return addresses corresponding to
491 typevectors in the SELECTED set are copied.
494 state............current verifier state
495 y................stack with types to copy
496 selected.........set of selected typevectors
499 *dst.............the destination stack
502 true.............success
503 false............an exception has been thrown
505 *******************************************************************************/
508 typestack_copy(verifier_state *state,stackptr dst,stackptr y,typevector *selected)
511 typeinfo_retaddr_set *sety;
512 typeinfo_retaddr_set *new;
513 typeinfo_retaddr_set **next;
516 for (;dst; dst=dst->prev, y=y->prev) {
517 /* XXX only check the following two in debug mode? */
519 *exceptionptr = new_verifyerror(state->m,"Stack depth mismatch");
522 if (dst->type != y->type) {
523 *exceptionptr = new_verifyerror(state->m,"Stack type mismatch");
526 LOG3("copy %p -> %p (type %d)",y,dst,dst->type);
527 if (dst->type == TYPE_ADDRESS) {
528 if (TYPEINFO_IS_PRIMITIVE(y->typeinfo)) {
529 /* We copy the returnAddresses from the selected
532 LOG("copying returnAddress");
533 sety = TYPESTACK_RETURNADDRESSSET(y);
535 for (k=0,sel=selected; sel; sel=sel->alt) {
536 LOG1("selected k=%d",sel->k);
541 *next = DNEW(typeinfo_retaddr_set);
542 (*next)->addr = sety->addr;
543 next = &((*next)->alt);
546 TYPEINFO_INIT_RETURNADDRESS(dst->typeinfo,new);
549 TYPEINFO_CLONE(y->typeinfo,dst->typeinfo);
554 *exceptionptr = new_verifyerror(state->m,"Stack depth mismatch");
560 /* typestack_put_retaddr *******************************************************
562 Put a returnAddress into a stack slot.
564 The stack slot receives a set of return addresses with as many members as
565 there are typevectors in the local variable set.
568 retaddr..........the returnAddress to set (a basicblock *)
569 loc..............the local variable typevector set
572 *dst.............the destination stack slot
574 *******************************************************************************/
577 typestack_put_retaddr(stackptr dst,void *retaddr,typevector *loc)
579 TYPECHECK_ASSERT(dst->type == TYPE_ADDRESS);
581 TYPEINFO_INIT_RETURNADDRESS(dst->typeinfo,NULL);
582 for (;loc; loc=loc->alt) {
583 typeinfo_retaddr_set *set = DNEW(typeinfo_retaddr_set);
585 set->alt = TYPESTACK_RETURNADDRESSSET(dst);
586 TYPEINFO_INIT_RETURNADDRESS(dst->typeinfo,set);
590 /* typestack_collapse **********************************************************
592 Collapse the given stack by shortening all return address sets to a single
596 *dst.............the destination stack to collapse
598 *******************************************************************************/
601 typestack_collapse(stackptr dst)
603 for (; dst; dst = dst->prev) {
604 if (TYPESTACK_IS_RETURNADDRESS(dst))
605 TYPESTACK_RETURNADDRESSSET(dst)->alt = NULL;
609 /* typestack_merge *************************************************************
611 Merge the types on one stack into the destination stack.
614 state............current state of the verifier
615 dst..............the destination stack
616 y................the second stack
619 *dst.............receives the result of the stack merge
622 typecheck_TRUE...*dst has been modified
623 typecheck_FALSE..*dst has not been modified
624 typecheck_FAIL...an exception has been thrown
626 *******************************************************************************/
628 static typecheck_result
629 typestack_merge(verifier_state *state,stackptr dst,stackptr y)
632 bool changed = false;
634 for (; dst; dst = dst->prev, y=y->prev) {
636 *exceptionptr = new_verifyerror(state->m,"Stack depth mismatch");
637 return typecheck_FAIL;
639 if (dst->type != y->type) {
640 *exceptionptr = new_verifyerror(state->m,"Stack type mismatch");
641 return typecheck_FAIL;
643 if (dst->type == TYPE_ADDRESS) {
644 if (TYPEINFO_IS_PRIMITIVE(dst->typeinfo)) {
645 /* dst has returnAddress type */
646 if (!TYPEINFO_IS_PRIMITIVE(y->typeinfo)) {
647 *exceptionptr = new_verifyerror(state->m,"Merging returnAddress with reference");
648 return typecheck_FAIL;
652 /* dst has reference type */
653 if (TYPEINFO_IS_PRIMITIVE(y->typeinfo)) {
654 *exceptionptr = new_verifyerror(state->m,"Merging reference with returnAddress");
655 return typecheck_FAIL;
657 r = typeinfo_merge(state->m,&(dst->typeinfo),&(y->typeinfo));
658 if (r == typecheck_FAIL)
665 *exceptionptr = new_verifyerror(state->m,"Stack depth mismatch");
666 return typecheck_FAIL;
671 /* typestack_add ***************************************************************
673 Add the return addresses in the given stack at a given k-index to the
674 corresponding return address sets in the destination stack.
677 dst..............the destination stack
678 y................the second stack
679 ky...............the k-index which should be selected from the Y stack
682 *dst.............receives the result of adding the addresses
684 *******************************************************************************/
687 typestack_add(stackptr dst,stackptr y,int ky)
689 typeinfo_retaddr_set *setd;
690 typeinfo_retaddr_set *sety;
692 for (; dst; dst = dst->prev, y=y->prev) {
693 if (TYPESTACK_IS_RETURNADDRESS(dst)) {
694 setd = TYPESTACK_RETURNADDRESSSET(dst);
695 sety = TYPESTACK_RETURNADDRESSSET(y);
696 RETURNADDRESSSET_SEEK(sety,ky);
699 setd->alt = DNEW(typeinfo_retaddr_set);
700 setd->alt->addr = sety->addr;
701 setd->alt->alt = NULL;
706 /* typestack_separable_with ****************************************************
708 This function answers the question: If variant 'kb' of typestack 'b' is
709 added to typestack 'a', will the result be separable?
711 A typestack is called 'separable' if it has at least one slot of type
712 returnAddress that contains at least two different return addresses.
713 (ie. a RET using the value in this slot could go to more than one target)
716 a................the first typestack
717 b................the second typestack
718 kb...............the k-index of the variant that should be selected
722 true.............the result would be separable
723 false............the result would not be separable
726 'a' and 'b' are assumed to have passed typestack_canmerge!
728 *******************************************************************************/
731 typestack_separable_with(stackptr a,stackptr b,int kb)
733 typeinfo_retaddr_set *seta;
734 typeinfo_retaddr_set *setb;
736 for (; a; a = a->prev, b = b->prev) {
738 if (TYPESTACK_IS_RETURNADDRESS(a)) {
739 TYPECHECK_ASSERT(TYPESTACK_IS_RETURNADDRESS(b));
740 seta = TYPESTACK_RETURNADDRESSSET(a);
741 setb = TYPESTACK_RETURNADDRESSSET(b);
742 RETURNADDRESSSET_SEEK(setb,kb);
744 for (;seta;seta=seta->alt)
745 if (seta->addr != setb->addr) return true;
748 TYPECHECK_ASSERT(!b);
752 /* typestack_separable_from ****************************************************
754 This function answers the question: Is variant 'ka' of typestack 'a'
755 separable from variant 'kb' of typestack 'b'?
757 Two variants of typestacks are called 'separable' from each other, if there
758 is at least one slot for which the variants contain different return addresses.
759 (ie. a RET using the value in this slot would go to one target in the first
760 variant and to another target in the second variant)
763 a................the first typestack
764 ka...............the k-index of the variant that should be selected
766 b................the second typestack
767 kb...............the k-index of the variant that should be selected
771 true.............the variants are separable
772 false............the variants are not separable
775 'a' and 'b' are assumed to have passed typestack_canmerge!
777 *******************************************************************************/
780 typestack_separable_from(stackptr a,int ka,stackptr b,int kb)
782 typeinfo_retaddr_set *seta;
783 typeinfo_retaddr_set *setb;
785 for (; a; a = a->prev, b = b->prev) {
787 if (TYPESTACK_IS_RETURNADDRESS(a)) {
788 TYPECHECK_ASSERT(TYPESTACK_IS_RETURNADDRESS(b));
789 seta = TYPESTACK_RETURNADDRESSSET(a);
790 setb = TYPESTACK_RETURNADDRESSSET(b);
791 RETURNADDRESSSET_SEEK(seta,ka);
792 RETURNADDRESSSET_SEEK(setb,kb);
794 if (seta->addr != setb->addr) return true;
797 TYPECHECK_ASSERT(!b);
801 /****************************************************************************/
802 /* TYPESTATE FUNCTIONS */
804 /* These functions act on the 'type state', which comprises: */
805 /* - the types of the stack slots of the current stack */
806 /* - the set of type vectors describing the local variables */
807 /****************************************************************************/
809 /* typestate_merge *************************************************************
811 Merge the types of one state into the destination state.
814 state............current state of the verifier
815 deststack........the destination stack
816 destloc..........the destination set of local variable typevectors
817 ystack...........the second stack
818 yloc.............the second set of local variable typevectors
821 *deststack.......receives the result of the stack merge
822 *destloc.........receives the result of the local variable merge
825 typecheck_TRUE...destination state has been modified
826 typecheck_FALSE..destination state has not been modified
827 typecheck_FAIL...an exception has been thrown
829 *******************************************************************************/
831 static typecheck_result
832 typestate_merge(verifier_state *state,
833 stackptr deststack,typevector *destloc,
834 stackptr ystack,typevector *yloc)
836 typevector *dvec,*yvec;
838 bool changed = false;
842 LOGSTR("dstack: "); DOLOG(typestack_print(get_logfile(),deststack)); LOGNL;
843 LOGSTR("ystack: "); DOLOG(typestack_print(get_logfile(),ystack)); LOGNL;
844 LOGSTR("dloc : "); DOLOG(typevectorset_print(get_logfile(),destloc,state->numlocals)); LOGNL;
845 LOGSTR("yloc : "); DOLOG(typevectorset_print(get_logfile(),yloc,state->numlocals)); LOGNL;
848 /* The stack is always merged. If there are returnAddresses on
849 * the stack they are ignored in this step. */
851 r = typestack_merge(state,deststack,ystack);
852 if (r == typecheck_FAIL)
856 /* If there have not been any JSRs we just have a single typevector merge */
857 if (!state->jsrencountered) {
858 r = typevector_merge(state->m,destloc,yloc,state->numlocals);
859 if (r == typecheck_FAIL)
864 for (yvec=yloc; yvec; yvec=yvec->alt) {
867 /* Check if the typestates (deststack,destloc) will be
868 * separable when (ystack,yvec) is added. */
870 if (!typestack_separable_with(deststack,ystack,ky)
871 && !typevectorset_separable_with(destloc,yvec,state->numlocals))
873 /* No, the resulting set won't be separable, thus we
874 * may merge all states in (deststack,destloc) and
877 typestack_collapse(deststack);
878 if (typevectorset_collapse(state->m,destloc,state->numlocals) == typecheck_FAIL)
879 return typecheck_FAIL;
880 if (typevector_merge(state->m,destloc,yvec,state->numlocals) == typecheck_FAIL)
881 return typecheck_FAIL;
884 /* Yes, the resulting set will be separable. Thus we check
885 * if we may merge (ystack,yvec) with a single state in
886 * (deststack,destloc). */
888 for (dvec=destloc,kd=0; dvec; dvec=dvec->alt, kd++) {
889 if (!typestack_separable_from(ystack,ky,deststack,kd)
890 && !typevector_separable_from(yvec,dvec,state->numlocals))
892 /* The typestate (ystack,yvec) is not separable from
893 * (deststack,dvec) by any returnAddress. Thus we may
894 * merge the states. */
896 r = typevector_merge(state->m,dvec,yvec,state->numlocals);
897 if (r == typecheck_FAIL)
905 /* The typestate (ystack,yvec) is separable from all typestates
906 * (deststack,destloc). Thus we must add this state to the
909 typestack_add(deststack,ystack,ky);
910 typevectorset_add(destloc,yvec,state->numlocals);
919 LOGSTR("dstack: "); DOLOG(typestack_print(get_logfile(),deststack)); LOGNL;
920 LOGSTR("dloc : "); DOLOG(typevectorset_print(get_logfile(),destloc,state->numlocals)); LOGNL;
926 /* typestate_reach *************************************************************
928 Reach a destination block and propagate stack and local variable types
931 state............current state of the verifier
932 destblock........destination basic block
933 ystack...........stack to propagate
934 yloc.............set of local variable typevectors to propagate
937 state->repeat....set to true if the verifier must iterate again
938 over the basic blocks
941 true.............success
942 false............an exception has been thrown
944 *******************************************************************************/
947 typestate_reach(verifier_state *state,
948 basicblock *destblock,
949 stackptr ystack,typevector *yloc)
953 bool changed = false;
956 LOG1("reaching block L%03d",destblock->debug_nr);
957 TYPECHECK_COUNT(stat_reached);
959 destidx = destblock - state->cd->method->basicblocks;
960 destloc = MGET_TYPEVECTOR(state->localbuf,destidx,state->numlocals);
962 /* When branching backwards we have to check for uninitialized objects */
964 if (destblock <= state->bptr) {
968 /* XXX FIXME FOR INLINING */
971 TYPECHECK_COUNT(stat_backwards);
973 for (sp = ystack; sp; sp=sp->prev)
974 if (sp->type == TYPE_ADR &&
975 TYPEINFO_IS_NEWOBJECT(sp->typeinfo)) {
976 /*printf("current: %d, dest: %d\n", state->bptr->debug_nr, destblock->debug_nr);*/
977 *exceptionptr = new_verifyerror(state->m,"Branching backwards with uninitialized object on stack");
981 for (i=0; i<state->numlocals; ++i)
982 if (yloc->td[i].type == TYPE_ADR &&
983 TYPEINFO_IS_NEWOBJECT(yloc->td[i].info)) {
984 *exceptionptr = new_verifyerror(state->m,"Branching backwards with uninitialized object in local variable");
990 if (destblock->flags == BBTYPECHECK_UNDEF) {
991 /* The destblock has never been reached before */
993 TYPECHECK_COUNT(stat_copied);
994 LOG1("block (index %04d) reached first time",destidx);
996 if (!typestack_copy(state,destblock->instack,ystack,yloc))
998 typevectorset_copy_inplace(yloc,destloc,state->numlocals);
1002 /* The destblock has already been reached before */
1004 TYPECHECK_COUNT(stat_merged);
1005 LOG1("block (index %04d) reached before",destidx);
1007 r = typestate_merge(state,destblock->instack,destloc,ystack,yloc);
1008 if (r == typecheck_FAIL)
1011 TYPECHECK_COUNTIF(changed,stat_merging_changed);
1016 destblock->flags = BBTYPECHECK_REACHED;
1017 if (destblock <= state->bptr) {
1019 state->repeat = true;
1025 /* typestate_ret ***************************************************************
1027 Reach the destinations of a RET instruction.
1030 state............current state of the verifier
1031 retindex.........index of local variable containing the returnAddress
1034 state->repeat....set to true if the verifier must iterate again
1035 over the basic blocks
1038 true.............success
1039 false............an exception has been thrown
1041 *******************************************************************************/
1044 typestate_ret(verifier_state *state,int retindex)
1047 typevector *selected;
1048 basicblock *destblock;
1050 for (yvec=state->localset; yvec; ) {
1051 if (!TYPEDESC_IS_RETURNADDRESS(yvec->td[retindex])) {
1052 *exceptionptr = new_verifyerror(state->m,"Illegal instruction: RET on non-returnAddress");
1056 destblock = (basicblock*) TYPEINFO_RETURNADDRESS(yvec->td[retindex].info);
1058 selected = typevectorset_select(&yvec,retindex,destblock);
1060 if (!typestate_reach(state,destblock,state->curstack,selected))
1066 /* typestate_save_instack ******************************************************
1068 Save the input stack of the current basic block in the "savedstackbuf"
1069 of the verifier state.
1071 This function must be called before an instruction modifies a stack slot
1072 that happens to be part of the instack of the current block. In such
1073 cases the instack of the block must be saved, and restored at the end
1074 of the analysis of this basic block, so that the instack again reflects
1075 the *input* to this basic block (and does not randomly contain types
1076 that appear within the block).
1079 state............current state of the verifier
1081 *******************************************************************************/
1084 typestate_save_instack(verifier_state *state)
1090 LOG("saving input stack types");
1091 if (!state->savedstackbuf) {
1092 LOG("allocating savedstack buffer");
1093 state->savedstackbuf = DMNEW(stackelement, state->cd->maxstack);
1094 state->savedstackbuf->prev = NULL;
1095 for (i = 1; i < state->cd->maxstack; ++i)
1096 state->savedstackbuf[i].prev = state->savedstackbuf+(i-1);
1098 sp = state->savedstack = state->bptr->instack;
1099 dest = state->bptr->instack = state->savedstackbuf + (state->bptr->indepth-1);
1101 for(; sp; sp=sp->prev, dest=dest->prev) {
1102 dest->type = sp->type;
1103 TYPEINFO_COPY(sp->typeinfo,dest->typeinfo);
1107 /* typestate_restore_instack ***************************************************
1109 Restore the input stack of the current basic block that has been previously
1110 saved by `typestate_save_instack`.
1113 state............current state of the verifier
1115 *******************************************************************************/
1118 typestate_restore_instack(verifier_state *state)
1123 TYPECHECK_COUNT(stat_savedstack);
1124 LOG("restoring saved instack");
1126 sp = state->bptr->instack;
1127 dest = state->savedstack;
1128 for(; sp; sp=sp->prev, dest=dest->prev) {
1129 dest->type = sp->type;
1130 TYPEINFO_COPY(sp->typeinfo,dest->typeinfo);
1133 state->bptr->instack = state->savedstack;
1134 state->savedstack = NULL;
1137 /****************************************************************************/
1139 /****************************************************************************/
1141 #define COPYTYPE(source,dest) \
1142 {if ((source)->type == TYPE_ADR) \
1143 TYPEINFO_COPY((source)->typeinfo,(dest)->typeinfo);}
1145 #define ISBUILTIN(v) (bte->fp == (functionptr) (v))
1147 /* verify_invocation ***********************************************************
1149 Verify an ICMD_INVOKE* instruction.
1152 state............the current state of the verifier
1155 true.............successful verification,
1156 false............an exception has been thrown.
1158 *******************************************************************************/
1161 verify_invocation(verifier_state *state)
1163 unresolved_method *um; /* struct describing the called method */
1164 constant_FMIref *mref; /* reference to the called method */
1165 methoddesc *md; /* descriptor of the called method */
1166 bool specialmethod; /* true if a <...> method is called */
1167 int opcode; /* invocation opcode */
1168 bool callinginit; /* true if <init> is called */
1170 classref_or_classinfo initclass;
1172 stackelement *stack; /* temporary stack pointer */
1173 stackelement *dst; /* result stack of the invocation */
1174 int i; /* counter */
1175 u1 rtype; /* return type of called method */
1177 um = (unresolved_method *) state->iptr[0].target;
1178 mref = um->methodref;
1179 md = mref->parseddesc.md;
1180 specialmethod = (mref->name->text[0] == '<');
1181 opcode = state->iptr[0].opc;
1182 dst = state->iptr->dst;
1184 /* prevent compiler warnings */
1188 /* check whether we are calling <init> */
1190 callinginit = (opcode == ICMD_INVOKESPECIAL && mref->name == utf_init);
1191 if (specialmethod && !callinginit)
1192 TYPECHECK_VERIFYERROR_bool("Invalid invocation of special method");
1194 /* allocate parameters if necessary */
1197 if (!descriptor_params_from_paramtypes(md,
1198 (opcode == ICMD_INVOKESTATIC) ? ACC_STATIC : ACC_NONE))
1201 /* check parameter types */
1203 stack = state->curstack;
1204 i = md->paramcount; /* number of parameters including 'this'*/
1207 td = md->paramtypes + i;
1208 if (stack->type != td->type)
1209 TYPECHECK_VERIFYERROR_bool("Parameter type mismatch in method invocation");
1210 if (stack->type == TYPE_ADR) {
1211 LOGINFO(&(stack->typeinfo));
1212 if (i==0 && callinginit)
1214 /* first argument to <init> method */
1215 if (!TYPEINFO_IS_NEWOBJECT(stack->typeinfo))
1216 TYPECHECK_VERIFYERROR_bool("Calling <init> on initialized object");
1218 /* get the address of the NEW instruction */
1219 LOGINFO(&(stack->typeinfo));
1220 ins = (instruction*)TYPEINFO_NEWOBJECT_INSTRUCTION(stack->typeinfo);
1222 initclass = CLASSREF_OR_CLASSINFO(ins[-1].target);
1224 initclass.cls = state->m->class;
1225 LOGSTR("class: "); LOGNAME(initclass); LOGNL;
1229 /* non-adress argument. if this is the first argument and we are */
1230 /* invoking an instance method, this is an error. */
1231 if (i==0 && opcode != ICMD_INVOKESTATIC) {
1232 TYPECHECK_VERIFYERROR_bool("Parameter type mismatch for 'this' argument");
1238 stack = stack->prev;
1241 LOG("checking return type");
1242 rtype = md->returntype.type;
1243 if (rtype != TYPE_VOID) {
1244 if (rtype != dst->type)
1245 TYPECHECK_VERIFYERROR_bool("Return type mismatch in method invocation");
1246 if (!typeinfo_init_from_typedesc(&(md->returntype),NULL,&(dst->typeinfo)))
1251 LOG("replacing uninitialized object");
1252 /* replace uninitialized object type on stack */
1255 if (stack->type == TYPE_ADR
1256 && TYPEINFO_IS_NEWOBJECT(stack->typeinfo)
1257 && TYPEINFO_NEWOBJECT_INSTRUCTION(stack->typeinfo) == ins)
1259 LOG("replacing uninitialized type on stack");
1261 /* If this stackslot is in the instack of
1262 * this basic block we must save the type(s)
1263 * we are going to replace.
1265 if (stack <= state->bptr->instack && !state->savedstack)
1266 typestate_save_instack(state);
1268 if (!typeinfo_init_class(&(stack->typeinfo),initclass))
1271 stack = stack->prev;
1273 /* replace uninitialized object type in locals */
1274 if (!typevectorset_init_object(state->localset,ins,initclass,state->numlocals))
1277 /* initializing the 'this' reference? */
1280 TYPECHECK_ASSERT(state->initmethod);
1281 /* { we are initializing the 'this' reference } */
1282 /* must be <init> of current class or direct superclass */
1283 /* the current class is linked, so must be its superclass. thus we can be */
1284 /* sure that resolving will be trivial. */
1285 if (!resolve_classref(state->m,mref->classref,resolveLazy,false,true,&cls))
1286 return false; /* exception */
1288 /* if lazy resolving did not succeed, it's not one of the allowed classes */
1289 /* otherwise we check it directly */
1290 if (cls == NULL || (cls != state->m->class && cls != state->m->class->super.cls)) {
1291 TYPECHECK_VERIFYERROR_bool("<init> calling <init> of the wrong class");
1294 /* set our marker variable to type int */
1295 LOG("setting <init> marker");
1296 typevectorset_store(state->localset,state->numlocals-1,TYPE_INT,NULL);
1299 /* { we are initializing an instance created with NEW } */
1300 if ((IS_CLASSREF(initclass) ? initclass.ref->name : initclass.cls->name) != mref->classref->name) {
1301 TYPECHECK_VERIFYERROR_bool("wrong <init> called for uninitialized reference");
1306 /* record subtype constraints for parameters */
1308 if (!constrain_unresolved_method(um,state->m->class,state->m,state->iptr,state->curstack))
1309 return false; /* XXX maybe wrap exception */
1311 /* try to resolve the method lazily */
1313 if (!resolve_method(um,resolveLazy,(methodinfo **) &(state->iptr[0].val.a)))
1319 /* verify_generic_builtin ******************************************************
1321 Verify the call of a generic builtin method.
1324 state............the current state of the verifier
1327 true.............successful verification,
1328 false............an exception has been thrown.
1330 *******************************************************************************/
1333 verify_generic_builtin(verifier_state *state)
1335 builtintable_entry *bte;
1341 TYPECHECK_COUNT(stat_ins_builtin_gen);
1343 bte = (builtintable_entry *) state->iptr[0].val.a;
1347 /* check the types of the arguments on the stack */
1349 sp = state->curstack;
1350 for (i--; i >= 0; i--) {
1351 if (sp->type != md->paramtypes[i].type) {
1352 TYPECHECK_VERIFYERROR_bool("parameter type mismatch for builtin method");
1355 #ifdef TYPECHECK_DEBUG
1356 /* generic builtins may only take primitive types and java.lang.Object references */
1357 if (sp->type == TYPE_ADR && md->paramtypes[i].classref->name != utf_java_lang_Object) {
1358 *exceptionptr = new_internalerror("generic builtin method with non-generic reference parameter");
1366 /* check the return type */
1368 rtype = md->returntype.type;
1369 if (rtype != TYPE_VOID) {
1372 dst = state->iptr->dst;
1373 if (rtype != dst->type)
1374 TYPECHECK_VERIFYERROR_bool("Return type mismatch in generic builtin invocation");
1375 if (!typeinfo_init_from_typedesc(&(md->returntype),NULL,&(dst->typeinfo)))
1382 /* verify_builtin **************************************************************
1384 Verify the call of a builtin method.
1387 state............the current state of the verifier
1390 true.............successful verification,
1391 false............an exception has been thrown.
1393 *******************************************************************************/
1396 verify_builtin(verifier_state *state)
1398 builtintable_entry *bte;
1399 classref_or_classinfo cls;
1400 stackptr dst; /* output stack of current instruction */
1402 bte = (builtintable_entry *) state->iptr[0].val.a;
1403 dst = state->iptr->dst;
1405 /* XXX this is an ugly if-chain but twisti did not want a function */
1406 /* pointer in builtintable_entry for this, so here you go.. ;) */
1408 if (ISBUILTIN(BUILTIN_new)) {
1409 if (state->iptr[-1].opc != ICMD_ACONST)
1410 TYPECHECK_VERIFYERROR_bool("illegal instruction: builtin_new without class");
1411 cls.any = state->iptr[-1].target;
1412 TYPEINFO_INIT_NEWOBJECT(dst->typeinfo,state->iptr);
1414 else if (ISBUILTIN(BUILTIN_newarray_boolean)) {
1415 TYPECHECK_INT(state->curstack);
1416 TYPEINFO_INIT_PRIMITIVE_ARRAY(dst->typeinfo,ARRAYTYPE_BOOLEAN);
1418 else if (ISBUILTIN(BUILTIN_newarray_char)) {
1419 TYPECHECK_INT(state->curstack);
1420 TYPEINFO_INIT_PRIMITIVE_ARRAY(dst->typeinfo,ARRAYTYPE_CHAR);
1422 else if (ISBUILTIN(BUILTIN_newarray_float)) {
1423 TYPECHECK_INT(state->curstack);
1424 TYPEINFO_INIT_PRIMITIVE_ARRAY(dst->typeinfo,ARRAYTYPE_FLOAT);
1426 else if (ISBUILTIN(BUILTIN_newarray_double)) {
1427 TYPECHECK_INT(state->curstack);
1428 TYPEINFO_INIT_PRIMITIVE_ARRAY(dst->typeinfo,ARRAYTYPE_DOUBLE);
1430 else if (ISBUILTIN(BUILTIN_newarray_byte)) {
1431 TYPECHECK_INT(state->curstack);
1432 TYPEINFO_INIT_PRIMITIVE_ARRAY(dst->typeinfo,ARRAYTYPE_BYTE);
1434 else if (ISBUILTIN(BUILTIN_newarray_short)) {
1435 TYPECHECK_INT(state->curstack);
1436 TYPEINFO_INIT_PRIMITIVE_ARRAY(dst->typeinfo,ARRAYTYPE_SHORT);
1438 else if (ISBUILTIN(BUILTIN_newarray_int)) {
1439 TYPECHECK_INT(state->curstack);
1440 TYPEINFO_INIT_PRIMITIVE_ARRAY(dst->typeinfo,ARRAYTYPE_INT);
1442 else if (ISBUILTIN(BUILTIN_newarray_long)) {
1443 TYPECHECK_INT(state->curstack);
1444 TYPEINFO_INIT_PRIMITIVE_ARRAY(dst->typeinfo,ARRAYTYPE_LONG);
1446 else if (ISBUILTIN(BUILTIN_newarray))
1448 TYPECHECK_INT(state->curstack->prev);
1449 if (state->iptr[-1].opc != ICMD_ACONST || !state->iptr[-1].target)
1450 TYPECHECK_VERIFYERROR_bool("illegal instruction: builtin_newarray without class");
1451 /* XXX check that it is an array class(ref) */
1452 typeinfo_init_class(&(dst->typeinfo),CLASSREF_OR_CLASSINFO(state->iptr[-1].target));
1454 else if (ISBUILTIN(BUILTIN_arrayinstanceof))
1456 TYPECHECK_ADR(state->curstack->prev);
1457 if (state->iptr[-1].opc != ICMD_ACONST)
1458 TYPECHECK_VERIFYERROR_bool("illegal instruction: builtin_arrayinstanceof without class");
1459 /* XXX check that it is an array class(ref) */
1462 return verify_generic_builtin(state);
1467 /* verify_multianewarray *******************************************************
1469 Verify a MULTIANEWARRAY instruction.
1472 state............the current state of the verifier
1475 true.............successful verification,
1476 false............an exception has been thrown.
1478 *******************************************************************************/
1481 verify_multianewarray(verifier_state *state)
1484 classinfo *arrayclass;
1485 arraydescriptor *desc;
1488 /* check the array lengths on the stack */
1489 i = state->iptr[0].op1;
1491 TYPECHECK_VERIFYERROR_bool("Illegal dimension argument");
1493 sp = state->curstack;
1496 TYPECHECK_VERIFYERROR_bool("Unable to pop operand off an empty stack");
1501 /* check array descriptor */
1502 if (state->iptr[0].val.a != NULL) {
1503 /* the array class reference has already been resolved */
1504 arrayclass = (classinfo *) state->iptr[0].val.a;
1506 TYPECHECK_VERIFYERROR_bool("MULTIANEWARRAY with unlinked class");
1507 if ((desc = arrayclass->vftbl->arraydesc) == NULL)
1508 TYPECHECK_VERIFYERROR_bool("MULTIANEWARRAY with non-array class");
1509 if (desc->dimension < state->iptr[0].op1)
1510 TYPECHECK_VERIFYERROR_bool("MULTIANEWARRAY dimension to high");
1512 /* set the array type of the result */
1513 typeinfo_init_classinfo(&(state->iptr->dst->typeinfo), arrayclass);
1517 constant_classref *cr;
1519 /* the array class reference is still unresolved */
1520 /* check that the reference indicates an array class of correct dimension */
1521 cr = (constant_classref *) state->iptr[0].target;
1526 /* { the dimension of the array class == i } */
1528 TYPECHECK_VERIFYERROR_bool("MULTIANEWARRAY with non-array class");
1529 if (i < state->iptr[0].op1)
1530 TYPECHECK_VERIFYERROR_bool("MULTIANEWARRAY dimension to high");
1532 /* set the array type of the result */
1533 if (!typeinfo_init_class(&(state->iptr->dst->typeinfo),CLASSREF_OR_CLASSINFO(state->iptr[0].target)))
1541 /* verify_basic_block **********************************************************
1543 Perform bytecode verification of a basic block.
1546 state............the current state of the verifier
1549 true.............successful verification,
1550 false............an exception has been thrown.
1552 *******************************************************************************/
1555 verify_basic_block(verifier_state *state)
1557 int opcode; /* current opcode */
1558 int len; /* for counting instructions, etc. */
1559 bool superblockend; /* true if no fallthrough to next block */
1560 basicblock *tbptr; /* temporary for target block */
1561 stackptr dst; /* output stack of current instruction */
1562 basicblock **tptr; /* pointer into target list of switch instr. */
1563 classinfo *cls; /* temporary */
1564 bool maythrow; /* true if this instruction may throw */
1566 unresolved_field *uf; /* for field accesses */
1567 fieldinfo **fieldinfop; /* for field accesses */
1572 LOGSTR1("\n---- BLOCK %04d ------------------------------------------------\n",state->bptr->debug_nr);
1575 superblockend = false;
1576 state->bptr->flags = BBFINISHED;
1577 b_index = state->bptr - state->m->basicblocks;
1579 /* init stack at the start of this block */
1580 state->curstack = state->bptr->instack;
1582 /* prevent compiler warnings */
1586 /* determine the active exception handlers for this block */
1587 /* XXX could use a faster algorithm with sorted lists or */
1590 for (i = 0; i < state->cd->exceptiontablelength; ++i) {
1591 if ((state->cd->exceptiontable[i].start <= state->bptr) && (state->cd->exceptiontable[i].end > state->bptr)) {
1592 LOG1("active handler L%03d", state->cd->exceptiontable[i].handler->debug_nr);
1593 state->handlers[len++] = state->cd->exceptiontable + i;
1596 state->handlers[len] = NULL;
1598 /* init variable types at the start of this block */
1599 typevectorset_copy_inplace(MGET_TYPEVECTOR(state->localbuf,b_index,state->numlocals),
1600 state->localset,state->numlocals);
1602 /* XXX FIXME FOR INLINING */
1604 if (state->handlers[0])
1605 for (i=0; i<state->numlocals; ++i)
1606 if (state->localset->td[i].type == TYPE_ADR
1607 && TYPEINFO_IS_NEWOBJECT(state->localset->td[i].info)) {
1608 /* XXX we do not check this for the uninitialized 'this' instance in */
1609 /* <init> methods. Otherwise there are problems with try blocks in */
1610 /* <init>. The spec seems to indicate that we should perform the test*/
1611 /* in all cases, but this fails with real code. */
1612 /* Example: org/eclipse/ui/internal/PerspectiveBarNewContributionItem*/
1613 /* of eclipse 3.0.2 */
1614 if (TYPEINFO_NEWOBJECT_INSTRUCTION(state->localset->td[i].info) != NULL) {
1615 /*show_icmd_method(state->m, state->cd, state->rd);*/
1616 printf("Uninitialized variable: %d, block: %d\n", i, state->bptr->debug_nr);
1617 TYPECHECK_VERIFYERROR_bool("Uninitialized object in local variable inside try block");
1621 DOLOG(typestate_print(get_logfile(),state->curstack,state->localset,state->numlocals));
1624 /* loop over the instructions */
1625 len = state->bptr->icount;
1626 state->iptr = state->bptr->iinstr;
1627 while (--len >= 0) {
1628 TYPECHECK_COUNT(stat_ins);
1630 DOLOG(typestate_print(get_logfile(),state->curstack,state->localset,state->numlocals));
1633 DOLOG(show_icmd(state->iptr,false)); LOGNL; LOGFLUSH;
1635 opcode = state->iptr->opc;
1636 myclass = state->iptr->method->class;
1637 dst = state->iptr->dst;
1642 /****************************************/
1643 /* STACK MANIPULATIONS */
1645 /* We just need to copy the typeinfo */
1646 /* for slots containing addresses. */
1648 /* CAUTION: We assume that the destination stack
1649 * slots were continuously allocated in
1650 * memory! (The current implementation in
1655 TYPECHECK_COUNT(stat_ins_stack);
1656 COPYTYPE(state->curstack,dst);
1660 TYPECHECK_COUNT(stat_ins_stack);
1661 COPYTYPE(state->curstack,dst);
1662 COPYTYPE(state->curstack,dst-2);
1663 COPYTYPE(state->curstack->prev,dst-1);
1667 TYPECHECK_COUNT(stat_ins_stack);
1668 COPYTYPE(state->curstack,dst);
1669 COPYTYPE(state->curstack,dst-3);
1670 COPYTYPE(state->curstack->prev,dst-1);
1671 COPYTYPE(state->curstack->prev->prev,dst-2);
1675 TYPECHECK_COUNT(stat_ins_stack);
1676 COPYTYPE(state->curstack,dst);
1677 COPYTYPE(state->curstack->prev,dst-1);
1681 TYPECHECK_COUNT(stat_ins_stack);
1682 COPYTYPE(state->curstack,dst);
1683 COPYTYPE(state->curstack->prev,dst-1);
1684 COPYTYPE(state->curstack,dst-3);
1685 COPYTYPE(state->curstack->prev,dst-4);
1686 COPYTYPE(state->curstack->prev->prev,dst-2);
1690 TYPECHECK_COUNT(stat_ins_stack);
1691 COPYTYPE(state->curstack,dst);
1692 COPYTYPE(state->curstack->prev,dst-1);
1693 COPYTYPE(state->curstack,dst-4);
1694 COPYTYPE(state->curstack->prev,dst-5);
1695 COPYTYPE(state->curstack->prev->prev,dst-2);
1696 COPYTYPE(state->curstack->prev->prev->prev,dst-3);
1700 TYPECHECK_COUNT(stat_ins_stack);
1701 COPYTYPE(state->curstack,dst-1);
1702 COPYTYPE(state->curstack->prev,dst);
1705 /****************************************/
1706 /* PRIMITIVE VARIABLE ACCESS */
1708 case ICMD_ILOAD: if (!typevectorset_checktype(state->localset,state->iptr->op1,TYPE_INT))
1709 TYPECHECK_VERIFYERROR_bool("Local variable type mismatch");
1711 case ICMD_IINC: if (!typevectorset_checktype(state->localset,state->iptr->op1,TYPE_INT))
1712 TYPECHECK_VERIFYERROR_bool("Local variable type mismatch");
1714 case ICMD_FLOAD: if (!typevectorset_checktype(state->localset,state->iptr->op1,TYPE_FLOAT))
1715 TYPECHECK_VERIFYERROR_bool("Local variable type mismatch");
1717 case ICMD_LLOAD: if (!typevectorset_checktype(state->localset,state->iptr->op1,TYPE_LONG))
1718 TYPECHECK_VERIFYERROR_bool("Local variable type mismatch");
1720 case ICMD_DLOAD: if (!typevectorset_checktype(state->localset,state->iptr->op1,TYPE_DOUBLE))
1721 TYPECHECK_VERIFYERROR_bool("Local variable type mismatch");
1724 case ICMD_ISTORE: typevectorset_store(state->localset,state->iptr->op1,TYPE_INT,NULL); break;
1725 case ICMD_FSTORE: typevectorset_store(state->localset,state->iptr->op1,TYPE_FLOAT,NULL); break;
1726 case ICMD_LSTORE: typevectorset_store_twoword(state->localset,state->iptr->op1,TYPE_LONG); break;
1727 case ICMD_DSTORE: typevectorset_store_twoword(state->localset,state->iptr->op1,TYPE_DOUBLE); break;
1729 /****************************************/
1730 /* LOADING ADDRESS FROM VARIABLE */
1733 TYPECHECK_COUNT(stat_ins_aload);
1735 /* loading a returnAddress is not allowed */
1736 if (state->jsrencountered) {
1737 if (!typevectorset_checkreference(state->localset,state->iptr->op1)) {
1738 TYPECHECK_VERIFYERROR_bool("illegal instruction: ALOAD loading non-reference");
1740 if (typevectorset_copymergedtype(state->m,state->localset,state->iptr->op1,&(dst->typeinfo)) == -1)
1744 if (!TYPEDESC_IS_REFERENCE(state->localset->td[state->iptr->op1])) {
1745 TYPECHECK_VERIFYERROR_bool("illegal instruction: ALOAD loading non-reference");
1747 TYPEINFO_COPY(state->localset->td[state->iptr->op1].info,dst->typeinfo);
1751 /****************************************/
1752 /* STORING ADDRESS TO VARIABLE */
1755 if (state->handlers[0] && TYPEINFO_IS_NEWOBJECT(state->curstack->typeinfo)) {
1756 TYPECHECK_VERIFYERROR_bool("Storing uninitialized object in local variable inside try block");
1759 if (TYPESTACK_IS_RETURNADDRESS(state->curstack)) {
1760 typevectorset_store_retaddr(state->localset,state->iptr->op1,&(state->curstack->typeinfo));
1763 typevectorset_store(state->localset,state->iptr->op1,TYPE_ADDRESS,
1764 &(state->curstack->typeinfo));
1768 /****************************************/
1769 /* LOADING ADDRESS FROM ARRAY */
1772 if (!TYPEINFO_MAYBE_ARRAY_OF_REFS(state->curstack->prev->typeinfo))
1773 TYPECHECK_VERIFYERROR_bool("illegal instruction: AALOAD on non-reference array");
1775 if (!typeinfo_init_component(&state->curstack->prev->typeinfo,&dst->typeinfo))
1780 /****************************************/
1783 case ICMD_PUTFIELDCONST:
1784 case ICMD_PUTSTATICCONST:
1785 TYPECHECK_COUNT(stat_ins_field);
1787 uf = INSTRUCTION_PUTCONST_FIELDREF(state->iptr);
1788 fieldinfop = INSTRUCTION_PUTCONST_FIELDINFO_PTR(state->iptr);
1790 goto fieldaccess_tail;
1793 case ICMD_PUTSTATIC:
1794 TYPECHECK_COUNT(stat_ins_field);
1796 uf = (unresolved_field *) state->iptr[0].target;
1797 fieldinfop = (fieldinfo **) &(state->iptr[0].val.a);
1799 goto fieldaccess_tail;
1802 case ICMD_GETSTATIC:
1803 TYPECHECK_COUNT(stat_ins_field);
1805 uf = (unresolved_field *) state->iptr[0].target;
1806 fieldinfop = (fieldinfo **) &(state->iptr[0].val.a);
1808 /* the result is pushed on the stack */
1809 if (dst->type == TYPE_ADR) {
1810 if (!typeinfo_init_from_typedesc(uf->fieldref->parseddesc.fd,NULL,&(dst->typeinfo)))
1815 /* record the subtype constraints for this field access */
1816 if (!constrain_unresolved_field(uf,state->m->class,state->m,state->iptr,state->curstack))
1817 return false; /* XXX maybe wrap exception? */
1819 /* try to resolve the field reference */
1820 if (!resolve_field(uf,resolveLazy,fieldinfop))
1823 TYPECHECK_COUNTIF(!*fieldinfop,stat_ins_field_unresolved);
1824 TYPECHECK_COUNTIF(*fieldinfop && !(*fieldinfop)->class->initialized,stat_ins_field_uninitialized);
1829 /****************************************/
1830 /* PRIMITIVE ARRAY ACCESS */
1832 case ICMD_ARRAYLENGTH:
1833 if (!TYPEINFO_MAYBE_ARRAY(state->curstack->typeinfo)
1834 && state->curstack->typeinfo.typeclass.cls != pseudo_class_Arraystub)
1835 TYPECHECK_VERIFYERROR_bool("illegal instruction: ARRAYLENGTH on non-array");
1840 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo,ARRAYTYPE_BOOLEAN)
1841 && !TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo,ARRAYTYPE_BYTE))
1842 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1846 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo,ARRAYTYPE_CHAR))
1847 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1851 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo,ARRAYTYPE_DOUBLE))
1852 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1856 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo,ARRAYTYPE_FLOAT))
1857 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1861 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo,ARRAYTYPE_INT))
1862 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1866 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo,ARRAYTYPE_SHORT))
1867 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1871 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo,ARRAYTYPE_LONG))
1872 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1877 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->prev->typeinfo,ARRAYTYPE_BOOLEAN)
1878 && !TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->prev->typeinfo,ARRAYTYPE_BYTE))
1879 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1883 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->prev->typeinfo,ARRAYTYPE_CHAR))
1884 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1888 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->prev->typeinfo,ARRAYTYPE_DOUBLE))
1889 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1893 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->prev->typeinfo,ARRAYTYPE_FLOAT))
1894 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1898 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->prev->typeinfo,ARRAYTYPE_INT))
1899 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1903 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->prev->typeinfo,ARRAYTYPE_SHORT))
1904 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1908 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->prev->typeinfo,ARRAYTYPE_LONG))
1909 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1914 /* we just check the basic input types and that the */
1915 /* destination is an array of references. Assignability to */
1916 /* the actual array must be checked at runtime, each time the */
1917 /* instruction is performed. (See builtin_canstore.) */
1918 TYPECHECK_ADR(state->curstack);
1919 TYPECHECK_INT(state->curstack->prev);
1920 TYPECHECK_ADR(state->curstack->prev->prev);
1921 if (!TYPEINFO_MAYBE_ARRAY_OF_REFS(state->curstack->prev->prev->typeinfo))
1922 TYPECHECK_VERIFYERROR_bool("illegal instruction: AASTORE to non-reference array");
1926 case ICMD_IASTORECONST:
1927 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo, ARRAYTYPE_INT))
1928 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1932 case ICMD_LASTORECONST:
1933 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo, ARRAYTYPE_LONG))
1934 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1938 case ICMD_BASTORECONST:
1939 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo, ARRAYTYPE_BOOLEAN)
1940 && !TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo, ARRAYTYPE_BYTE))
1941 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1945 case ICMD_CASTORECONST:
1946 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo, ARRAYTYPE_CHAR))
1947 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1951 case ICMD_SASTORECONST:
1952 if (!TYPEINFO_MAYBE_PRIMITIVE_ARRAY(state->curstack->prev->typeinfo, ARRAYTYPE_SHORT))
1953 TYPECHECK_VERIFYERROR_bool("Array type mismatch");
1957 /****************************************/
1958 /* ADDRESS CONSTANTS */
1961 if (state->iptr->target) {
1962 /* a java.lang.Class reference */
1963 TYPEINFO_INIT_JAVA_LANG_CLASS(dst->typeinfo,(constant_classref *)state->iptr->target);
1966 if (state->iptr->val.a == NULL)
1967 TYPEINFO_INIT_NULLTYPE(dst->typeinfo);
1969 /* string constant (or constant for builtin function) */
1970 typeinfo_init_classinfo(&(dst->typeinfo),class_java_lang_String);
1975 /****************************************/
1976 /* CHECKCAST AND INSTANCEOF */
1978 case ICMD_CHECKCAST:
1979 TYPECHECK_ADR(state->curstack);
1980 /* returnAddress is not allowed */
1981 if (!TYPEINFO_IS_REFERENCE(state->curstack->typeinfo))
1982 TYPECHECK_VERIFYERROR_bool("Illegal instruction: CHECKCAST on non-reference");
1984 cls = (classinfo *) state->iptr[0].val.a;
1986 typeinfo_init_classinfo(&(dst->typeinfo),cls);
1988 if (!typeinfo_init_class(&(dst->typeinfo),CLASSREF_OR_CLASSINFO(state->iptr[0].target)))
1993 case ICMD_INSTANCEOF:
1994 TYPECHECK_ADR(state->curstack);
1995 /* returnAddress is not allowed */
1996 if (!TYPEINFO_IS_REFERENCE(state->curstack->typeinfo))
1997 TYPECHECK_VERIFYERROR_bool("Illegal instruction: INSTANCEOF on non-reference");
2000 /****************************************/
2001 /* BRANCH INSTRUCTIONS */
2004 superblockend = true;
2007 case ICMD_IFNONNULL:
2014 case ICMD_IF_ICMPEQ:
2015 case ICMD_IF_ICMPNE:
2016 case ICMD_IF_ICMPLT:
2017 case ICMD_IF_ICMPGE:
2018 case ICMD_IF_ICMPGT:
2019 case ICMD_IF_ICMPLE:
2020 case ICMD_IF_ACMPEQ:
2021 case ICMD_IF_ACMPNE:
2028 case ICMD_IF_LCMPEQ:
2029 case ICMD_IF_LCMPNE:
2030 case ICMD_IF_LCMPLT:
2031 case ICMD_IF_LCMPGE:
2032 case ICMD_IF_LCMPGT:
2033 case ICMD_IF_LCMPLE:
2034 TYPECHECK_COUNT(stat_ins_branch);
2035 tbptr = (basicblock *) state->iptr->target;
2037 /* propagate stack and variables to the target block */
2038 if (!typestate_reach(state,tbptr,dst,state->localset))
2042 /****************************************/
2045 case ICMD_TABLESWITCH:
2046 TYPECHECK_COUNT(stat_ins_switch);
2048 s4 *s4ptr = state->iptr->val.a;
2049 s4ptr++; /* skip default */
2050 i = *s4ptr++; /* low */
2051 i = *s4ptr++ - i + 2; /* +1 for default target */
2053 goto switch_instruction_tail;
2055 case ICMD_LOOKUPSWITCH:
2056 TYPECHECK_COUNT(stat_ins_switch);
2058 s4 *s4ptr = state->iptr->val.a;
2059 s4ptr++; /* skip default */
2060 i = *s4ptr++ + 1; /* count +1 for default */
2062 switch_instruction_tail:
2063 tptr = (basicblock **)state->iptr->target;
2067 LOG2("target %d is block %04d",(tptr-(basicblock **)state->iptr->target)-1,tbptr->debug_nr);
2068 if (!typestate_reach(state,tbptr,dst,state->localset))
2072 superblockend = true;
2075 /****************************************/
2076 /* ADDRESS RETURNS AND THROW */
2079 TYPECHECK_COUNT(stat_ins_athrow);
2080 r = typeinfo_is_assignable_to_class(&state->curstack->typeinfo,
2081 CLASSREF_OR_CLASSINFO(class_java_lang_Throwable));
2082 if (r == typecheck_FALSE)
2083 TYPECHECK_VERIFYERROR_bool("illegal instruction: ATHROW on non-Throwable");
2084 if (r == typecheck_FAIL)
2086 if (r == typecheck_MAYBE) {
2087 /* the check has to be postponed. we need a patcher */
2088 TYPECHECK_COUNT(stat_ins_athrow_unresolved);
2089 state->iptr->val.a = create_unresolved_class(
2091 /* XXX make this more efficient, use class_java_lang_Throwable
2093 class_get_classref(state->m->class,utf_java_lang_Throwable),
2094 &state->curstack->typeinfo);
2096 superblockend = true;
2101 TYPECHECK_COUNT(stat_ins_areturn);
2102 if (!TYPEINFO_IS_REFERENCE(state->curstack->typeinfo))
2103 TYPECHECK_VERIFYERROR_bool("illegal instruction: ARETURN on non-reference");
2105 if (state->returntype.type != TYPE_ADDRESS
2106 || (r = typeinfo_is_assignable(&state->curstack->typeinfo,&(state->returntype.info)))
2108 TYPECHECK_VERIFYERROR_bool("Return type mismatch");
2109 if (r == typecheck_FAIL)
2111 if (r == typecheck_MAYBE) {
2112 /* the check has to be postponed, we need a patcher */
2113 TYPECHECK_COUNT(stat_ins_areturn_unresolved);
2114 state->iptr->val.a = create_unresolved_class(
2116 state->m->parseddesc->returntype.classref,
2117 &state->curstack->typeinfo);
2121 /****************************************/
2122 /* PRIMITIVE RETURNS */
2125 if (state->returntype.type != TYPE_INT) TYPECHECK_VERIFYERROR_bool("Return type mismatch");
2129 if (state->returntype.type != TYPE_LONG) TYPECHECK_VERIFYERROR_bool("Return type mismatch");
2133 if (state->returntype.type != TYPE_FLOAT) TYPECHECK_VERIFYERROR_bool("Return type mismatch");
2137 if (state->returntype.type != TYPE_DOUBLE) TYPECHECK_VERIFYERROR_bool("Return type mismatch");
2141 if (state->returntype.type != TYPE_VOID) TYPECHECK_VERIFYERROR_bool("Return type mismatch");
2143 TYPECHECK_COUNT(stat_ins_primitive_return);
2145 if (state->initmethod && state->m->class != class_java_lang_Object) {
2146 /* Check if the 'this' instance has been initialized. */
2147 LOG("Checking <init> marker");
2148 if (!typevectorset_checktype(state->localset,state->numlocals-1,TYPE_INT))
2149 TYPECHECK_VERIFYERROR_bool("<init> method does not initialize 'this'");
2152 superblockend = true;
2156 /****************************************/
2157 /* SUBROUTINE INSTRUCTIONS */
2161 state->jsrencountered = true;
2163 /* This is a dirty hack. It is needed
2164 * because of the special handling of
2165 * ICMD_JSR in stack.c
2167 dst = (stackptr) state->iptr->val.a;
2169 tbptr = (basicblock *) state->iptr->target;
2170 if (state->bptr + 1 == (state->m->basicblocks + state->m->basicblockcount + 1))
2171 TYPECHECK_VERIFYERROR_bool("Illegal instruction: JSR at end of bytecode");
2172 typestack_put_retaddr(dst,state->bptr+1,state->localset);
2173 if (!typestate_reach(state,tbptr,dst,state->localset))
2176 superblockend = true;
2180 /* check returnAddress variable */
2181 if (!typevectorset_checkretaddr(state->localset,state->iptr->op1))
2182 TYPECHECK_VERIFYERROR_bool("illegal instruction: RET using non-returnAddress variable");
2184 if (!typestate_ret(state,state->iptr->op1))
2187 superblockend = true;
2190 /****************************************/
2193 case ICMD_INVOKEVIRTUAL:
2194 case ICMD_INVOKESPECIAL:
2195 case ICMD_INVOKESTATIC:
2196 case ICMD_INVOKEINTERFACE:
2197 TYPECHECK_COUNT(stat_ins_invoke);
2198 if (!verify_invocation(state))
2200 TYPECHECK_COUNTIF(!state->iptr[0].val.a,stat_ins_invoke_unresolved);
2204 /****************************************/
2205 /* MULTIANEWARRAY */
2207 case ICMD_MULTIANEWARRAY:
2208 if (!verify_multianewarray(state))
2213 /****************************************/
2217 TYPECHECK_COUNT(stat_ins_builtin);
2218 if (!verify_builtin(state))
2223 /****************************************/
2224 /* SIMPLE EXCEPTION THROWING TESTS */
2226 case ICMD_CHECKNULL:
2227 /* CHECKNULL just requires that the stack top
2228 * is an address. This is checked in stack.c */
2232 /****************************************/
2233 /* INSTRUCTIONS WHICH SHOULD HAVE BEEN */
2234 /* REPLACED BY OTHER OPCODES */
2236 #ifdef TYPECHECK_DEBUG
2239 case ICMD_ANEWARRAY:
2240 case ICMD_MONITORENTER:
2241 case ICMD_MONITOREXIT:
2242 LOG2("ICMD %d at %d\n", state->iptr->opc, (int)(state->iptr-state->bptr->iinstr));
2243 LOG("Should have been converted to builtin function call.");
2244 TYPECHECK_ASSERT(false);
2247 case ICMD_READONLY_ARG:
2248 case ICMD_CLEAR_ARGREN:
2249 LOG2("ICMD %d at %d\n", state->iptr->opc, (int)(state->iptr-state->bptr->iinstr));
2250 LOG("Should have been replaced in stack.c.");
2251 TYPECHECK_ASSERT(false);
2255 /****************************************/
2256 /* UNCHECKED OPERATIONS */
2258 /*********************************************
2259 * Instructions below...
2260 * *) don't operate on local variables,
2261 * *) don't operate on references,
2262 * *) don't operate on returnAddresses,
2263 * *) don't affect control flow (except
2264 * by throwing exceptions).
2266 * (These instructions are typechecked in
2268 ********************************************/
2270 /* Instructions which may throw a runtime exception: */
2280 /* Instructions which never throw a runtime exception: */
2281 #if defined(TYPECHECK_DEBUG) || defined(TYPECHECK_STATISTICS)
2291 case ICMD_IFEQ_ICONST:
2292 case ICMD_IFNE_ICONST:
2293 case ICMD_IFLT_ICONST:
2294 case ICMD_IFGE_ICONST:
2295 case ICMD_IFGT_ICONST:
2296 case ICMD_IFLE_ICONST:
2297 case ICMD_ELSE_ICONST:
2323 case ICMD_IADDCONST:
2324 case ICMD_ISUBCONST:
2325 case ICMD_IMULCONST:
2326 case ICMD_IANDCONST:
2328 case ICMD_IXORCONST:
2329 case ICMD_ISHLCONST:
2330 case ICMD_ISHRCONST:
2331 case ICMD_IUSHRCONST:
2333 case ICMD_LADDCONST:
2334 case ICMD_LSUBCONST:
2335 case ICMD_LMULCONST:
2336 case ICMD_LANDCONST:
2338 case ICMD_LXORCONST:
2339 case ICMD_LSHLCONST:
2340 case ICMD_LSHRCONST:
2341 case ICMD_LUSHRCONST:
2358 case ICMD_INT2SHORT:
2361 case ICMD_LCMPCONST:
2381 /*XXX What shall we do with the following ?*/
2382 case ICMD_AASTORECONST:
2383 TYPECHECK_COUNT(stat_ins_unchecked);
2386 /****************************************/
2389 LOG2("ICMD %d at %d\n", state->iptr->opc, (int)(state->iptr-state->bptr->iinstr));
2390 TYPECHECK_VERIFYERROR_bool("Missing ICMD code during typecheck");
2394 /* the output of this instruction becomes the current stack */
2395 state->curstack = dst;
2397 /* reach exception handlers for this instruction */
2399 TYPECHECK_COUNT(stat_ins_maythrow);
2400 TYPECHECK_MARK(state->stat_maythrow);
2401 LOG("reaching exception handlers");
2403 while (state->handlers[i]) {
2404 TYPECHECK_COUNT(stat_handlers_reached);
2405 if (state->handlers[i]->catchtype.any)
2406 state->excstack.typeinfo.typeclass = state->handlers[i]->catchtype;
2408 state->excstack.typeinfo.typeclass.cls = class_java_lang_Throwable;
2409 if (!typestate_reach(state,
2410 state->handlers[i]->handler,
2411 &(state->excstack),state->localset))
2417 LOG("next instruction");
2419 } /* while instructions */
2421 LOG("instructions done");
2422 LOGSTR("RESULT=> ");
2423 DOLOG(typestate_print(get_logfile(),state->curstack,state->localset,state->numlocals));
2426 /* propagate stack and variables to the following block */
2427 if (!superblockend) {
2428 LOG("reaching following block");
2429 tbptr = state->bptr + 1;
2430 while (tbptr->flags == BBDELETED) {
2432 #ifdef TYPECHECK_DEBUG
2433 /* this must be checked in parse.c */
2434 if ((tbptr->debug_nr) >= state->m->basicblockcount)
2435 TYPECHECK_VERIFYERROR_bool("Control flow falls off the last block");
2438 if (!typestate_reach(state,tbptr,dst,state->localset))
2442 /* We may have to restore the types of the instack slots. They
2443 * have been saved if an <init> call inside the block has
2444 * modified the instack types. (see INVOKESPECIAL) */
2446 if (state->savedstack)
2447 typestate_restore_instack(state);
2452 /* verify_init_locals **********************************************************
2454 Initialize the local variables in the verifier state.
2457 state............the current state of the verifier
2460 true.............success,
2461 false............an exception has been thrown.
2463 *******************************************************************************/
2466 verify_init_locals(verifier_state *state)
2472 /* initialize the variable types of the first block */
2473 /* to the types of the arguments */
2475 lset = MGET_TYPEVECTOR(state->localbuf,0,state->numlocals);
2479 i = state->validlocals;
2481 /* allocate parameter descriptors if necessary */
2483 if (!state->m->parseddesc->params)
2484 if (!descriptor_params_from_paramtypes(state->m->parseddesc,state->m->flags))
2487 /* if this is an instance method initialize the "this" ref type */
2489 if (!(state->m->flags & ACC_STATIC)) {
2491 TYPECHECK_VERIFYERROR_bool("Not enough local variables for method arguments");
2492 td->type = TYPE_ADDRESS;
2493 if (state->initmethod)
2494 TYPEINFO_INIT_NEWOBJECT(td->info,NULL);
2496 typeinfo_init_classinfo(&(td->info), state->m->class);
2501 LOG("'this' argument set.\n");
2503 /* the rest of the arguments and the return type */
2505 i = typedescriptors_init_from_methoddesc(td, state->m->parseddesc,
2507 true, /* two word types use two slots */
2508 (td - lset->td), /* skip 'this' pointer */
2509 &state->returntype);
2514 /* variables not used for arguments are initialized to TYPE_VOID */
2516 i = state->numlocals - (td - lset->td);
2518 td->type = TYPE_VOID;
2522 LOG("Arguments set.\n");
2526 /* typecheck_init_flags ********************************************************
2528 Initialize the basic block flags for the following CFG traversal.
2531 state............the current state of the verifier
2533 *******************************************************************************/
2536 typecheck_init_flags(verifier_state *state)
2541 /* set all BBFINISHED blocks to BBTYPECHECK_UNDEF. */
2543 i = state->m->basicblockcount;
2544 block = state->m->basicblocks;
2548 #ifdef TYPECHECK_DEBUG
2549 /* check for invalid flags */
2550 if (block->flags != BBFINISHED && block->flags != BBDELETED && block->flags != BBUNDEF)
2552 /*show_icmd_method(state->cd->method,state->cd,state->rd);*/
2553 LOGSTR1("block flags: %d\n",block->flags); LOGFLUSH;
2554 TYPECHECK_ASSERT(false);
2558 if (block->flags >= BBFINISHED) {
2559 block->flags = BBTYPECHECK_UNDEF;
2564 /* the first block is always reached */
2566 if (state->m->basicblockcount && state->m->basicblocks[0].flags == BBTYPECHECK_UNDEF)
2567 state->m->basicblocks[0].flags = BBTYPECHECK_REACHED;
2570 /* typecheck_reset_flags *******************************************************
2572 Reset the flags of basic blocks we have not reached.
2575 state............the current state of the verifier
2577 *******************************************************************************/
2580 typecheck_reset_flags(verifier_state *state)
2584 /* check for invalid flags at exit */
2586 #ifdef TYPECHECK_DEBUG
2587 for (i=0; i<state->m->basicblockcount; ++i) {
2588 if (state->m->basicblocks[i].flags != BBDELETED
2589 && state->m->basicblocks[i].flags != BBUNDEF
2590 && state->m->basicblocks[i].flags != BBFINISHED
2591 && state->m->basicblocks[i].flags != BBTYPECHECK_UNDEF) /* typecheck may never reach
2592 * some exception handlers,
2595 LOG2("block L%03d has invalid flags after typecheck: %d",
2596 state->m->basicblocks[i].debug_nr,state->m->basicblocks[i].flags);
2597 TYPECHECK_ASSERT(false);
2602 /* Reset blocks we never reached */
2604 for (i=0; i<state->m->basicblockcount; ++i) {
2605 if (state->m->basicblocks[i].flags == BBTYPECHECK_UNDEF)
2606 state->m->basicblocks[i].flags = BBFINISHED;
2610 /****************************************************************************/
2612 /* This is the main function of the bytecode verifier. It is called */
2613 /* directly after analyse_stack. */
2616 /* meth.............the method to verify */
2617 /* cdata............codegendata for the method */
2618 /* rdata............registerdata for the method */
2621 /* m................successful verification */
2622 /* NULL.............an exception has been thrown */
2625 /* Bytecode verification has not been tested with inlining and */
2626 /* probably does not work correctly with inlining. */
2627 /****************************************************************************/
2629 #define MAXPARAMS 255
2631 methodinfo *typecheck(methodinfo *meth, codegendata *cdata, registerdata *rdata)
2633 verifier_state state; /* current state of the verifier */
2634 int i; /* temporary counter */
2636 /* collect statistics */
2638 #ifdef TYPECHECK_STATISTICS
2639 int count_iterations = 0;
2640 TYPECHECK_COUNT(stat_typechecked);
2641 TYPECHECK_COUNT_FREQ(stat_locals,cdata->maxlocals,STAT_LOCALS);
2642 TYPECHECK_COUNT_FREQ(stat_blocks,cdata->method->basicblockcount/10,STAT_BLOCKS);
2643 TYPECHECK_COUNTIF(cdata->method->exceptiontablelength != 0,stat_methods_with_handlers);
2644 state.stat_maythrow = false;
2647 /* some logging on entry */
2649 LOGSTR("\n==============================================================================\n");
2650 /*DOLOG( show_icmd_method(cdata->method,cdata,rdata));*/
2651 LOGSTR("\n==============================================================================\n");
2652 LOGimpSTR("Entering typecheck: ");
2653 LOGimpSTRu(cdata->method->name);
2655 LOGimpSTRu(cdata->method->descriptor);
2656 LOGimpSTR(" (class ");
2657 LOGimpSTRu(cdata->method->class->name);
2661 /* initialize the verifier state */
2663 state.savedstackbuf = NULL;
2664 state.savedstack = NULL;
2665 state.jsrencountered = false;
2670 /* check if this method is an instance initializer method */
2672 state.initmethod = (state.m->name == utf_init);
2674 /* initialize the basic block flags for the following CFG traversal */
2676 typecheck_init_flags(&state);
2678 /* number of local variables */
2680 /* In <init> methods we use an extra local variable to indicate whether */
2681 /* the 'this' reference has been initialized. */
2682 /* TYPE_VOID...means 'this' has not been initialized, */
2683 /* TYPE_INT....means 'this' has been initialized. */
2684 state.numlocals = state.cd->maxlocals;
2685 state.validlocals = state.numlocals;
2686 if (state.initmethod) state.numlocals++;
2688 /* allocate the buffers for local variables */
2690 state.localbuf = DMNEW_TYPEVECTOR(state.m->basicblockcount+1, state.numlocals);
2691 state.localset = MGET_TYPEVECTOR(state.localbuf,state.m->basicblockcount,state.numlocals);
2693 LOG("Variable buffer allocated.\n");
2695 /* allocate the buffer of active exception handlers */
2697 state.handlers = DMNEW(exceptiontable*, state.cd->exceptiontablelength + 1);
2699 /* initialized local variables of first block */
2701 if (!verify_init_locals(&state))
2704 /* initialize the input stack of exception handlers */
2706 state.excstack.prev = NULL;
2707 state.excstack.type = TYPE_ADR;
2708 typeinfo_init_classinfo(&(state.excstack.typeinfo),
2709 class_java_lang_Throwable); /* changed later */
2711 LOG("Exception handler stacks set.\n");
2713 /* loop while there are still blocks to be checked */
2715 TYPECHECK_COUNT(count_iterations);
2717 state.repeat = false;
2719 i = state.m->basicblockcount;
2720 state.bptr = state.m->basicblocks;
2723 LOGSTR1("---- BLOCK %04d, ",state.bptr->debug_nr);
2724 LOGSTR1("blockflags: %d\n",state.bptr->flags);
2727 /* verify reached block */
2728 if (state.bptr->flags == BBTYPECHECK_REACHED) {
2729 if (!verify_basic_block(&state))
2733 } /* while blocks */
2735 LOGIF(state.repeat,"state.repeat == true");
2736 } while (state.repeat);
2740 #ifdef TYPECHECK_STATISTICS
2741 LOG1("Typechecker did %4d iterations",count_iterations);
2742 TYPECHECK_COUNT_FREQ(stat_iterations,count_iterations,STAT_ITERATIONS);
2743 TYPECHECK_COUNTIF(state.jsrencountered,stat_typechecked_jsr);
2744 TYPECHECK_COUNTIF(state.stat_maythrow,stat_methods_maythrow);
2747 /* reset the flags of blocks we haven't reached */
2749 typecheck_reset_flags(&state);
2751 /* just return methodinfo* to indicate everything was ok */
2752 LOGimp("exiting typecheck");
2756 #endif /* ENABLE_VERIFIER */
2759 * These are local overrides for various environment variables in Emacs.
2760 * Please do not remove this and leave it at the end of the file, where
2761 * Emacs will automagically detect them.
2762 * ---------------------------------------------------------------------
2765 * indent-tabs-mode: t
2769 * vim:noexpandtab:sw=4:ts=4: