/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*-
* Verify that the code within a method block doesn't exploit any
* security holes.
*/
/*
Exported function:
jboolean
VerifyClass(JNIEnv *env, jclass cb, char *message_buffer,
jint buffer_length)
jboolean
VerifyClassForMajorVersion(JNIEnv *env, jclass cb, char *message_buffer,
jint buffer_length, jint major_version)
This file now only uses the standard JNI and the following VM functions
exported in jvm.h:
JVM_FindClassFromClass
JVM_IsInterface
JVM_GetClassNameUTF
JVM_GetClassCPEntriesCount
JVM_GetClassCPTypes
JVM_GetClassFieldsCount
JVM_GetClassMethodsCount
JVM_GetFieldIxModifiers
JVM_GetMethodIxModifiers
JVM_GetMethodIxExceptionTableLength
JVM_GetMethodIxLocalsCount
JVM_GetMethodIxArgsSize
JVM_GetMethodIxMaxStack
JVM_GetMethodIxNameUTF
JVM_GetMethodIxSignatureUTF
JVM_GetMethodIxExceptionsCount
JVM_GetMethodIxExceptionIndexes
JVM_GetMethodIxByteCodeLength
JVM_GetMethodIxByteCode
JVM_GetMethodIxExceptionTableEntry
JVM_IsConstructorIx
JVM_GetCPClassNameUTF
JVM_GetCPFieldNameUTF
JVM_GetCPMethodNameUTF
JVM_GetCPFieldSignatureUTF
JVM_GetCPMethodSignatureUTF
JVM_GetCPFieldClassNameUTF
JVM_GetCPMethodClassNameUTF
JVM_GetCPFieldModifiers
JVM_GetCPMethodModifiers
JVM_ReleaseUTF
JVM_IsSameClassPackage
*/
#include <string.h>
#include <setjmp.h>
#include <assert.h>
#include <limits.h>
#include <stdlib.h>
#include "jni.h"
#include "jvm.h"
#include "classfile_constants.h"
#include "opcodes.in_out"
/* align byte code */
#ifndef ALIGN_UP
#endif /* ALIGN_UP */
#ifdef DEBUG
int verify_verbose = 0;
#endif
enum {
to super() */
/* The following three are only used within array types.
* Normally, we use ITEM_Integer, instead. */
};
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
((unsigned)1 << ((i) % BITS_PER_INT)))
((unsigned)1 << ((i) % BITS_PER_INT)))
typedef unsigned int fullinfo_type;
typedef unsigned int *bitvector;
/* JVM_OPC_invokespecial calls to <init> need to be treated special */
/* A hash mechanism used by the verifier.
* Maps class names to unique 16 bit integers.
*/
/* The buckets are managed as a 256 by 256 matrix. We allocate an entire
* row (256 buckets) at a time to minimize fragmentation. Rows are
* allocated on demand so that we don't waste too much space.
*/
typedef struct hash_bucket_type {
char *name;
unsigned int hash;
unsigned short ID;
unsigned short next;
typedef struct {
unsigned short *table;
int entries_used;
/*
* There are currently two types of resources that we need to keep
* track of (in addition to the CCalloc pool).
*/
enum {
};
typedef struct alloc_stack_type {
void *ptr;
int kind;
/* The context type encapsulates the current invocation of the byte
* code verifier.
*/
struct context_type {
/* buffers etc. */
char *message;
had a chance to free */
/* Store up to ALLOC_STACK_SIZE number of handles to allocated memory
blocks here, to save mallocs. */
int alloc_stack_top;
/* these fields are per class */
unsigned char *constant_types;
/* these fields are per method */
/* these fields are per field */
int field_index;
/* Used by the space allocator */
char *CCfree_ptr;
int CCfree_size;
/* Jump here on any error. */
#ifdef DEBUG
/* keep track of how many global refs are allocated. */
int n_globalrefs;
#endif
};
struct stack_info_type {
int stack_size;
};
struct register_info_type {
};
struct mask_type {
int entry;
int *modifies;
};
typedef unsigned short flag_type;
struct instruction_data_type {
union {
int i; /* operand to the opcode */
int *ip;
};
struct handler_info_type {
};
struct stack_item_type {
};
int** code_lengths, unsigned char*** code);
int code_length, unsigned char* code);
unsigned char** code);
static void initialize_exception_table(context_type *);
static void verify_constant_pool_type(context_type *, int, unsigned);
static void initialize_dataflow(context_type *);
unsigned int from_inumber,
unsigned int inumber,
unsigned int to_inumber, stack_info_type *);
unsigned int to_inumber,
unsigned int to_inumber,
fullinfo_type b);
static void CCout_of_memory (context_type *);
/* Because we can longjmp any time, we need to be very careful about
* remembering what needs to be freed. */
static int signature_to_args_size(const char *method_signature);
#ifdef DEBUG
#endif
{
class_hash->table = (unsigned short *)
calloc(HASH_TABLE_SIZE, sizeof(unsigned short));
if (class_hash->buckets == 0 ||
class_hash->table == 0)
class_hash->entries_used = 0;
}
{
int i;
/* 4296677: bucket index starts from 1. */
#ifdef DEBUG
context->n_globalrefs--;
#endif
}
}
if (class_hash->buckets) {
for (i=0;i<MAX_HASH_ENTRIES / HASH_ROW_SIZE; i++) {
if (class_hash->buckets[i] == 0)
break;
}
}
}
static hash_bucket_type *
{
if (i >= MAX_HASH_ENTRIES)
}
is no overflow. */
return GET_BUCKET(class_hash, i);
}
static unsigned int
class_hash_fun(const char *s)
{
int i;
unsigned raw_hash;
for (raw_hash = 0; (i = *s) != '\0'; ++s)
return raw_hash;
}
/*
* Find a class using the defining loader of the current class
* and return a local reference to it.
*/
{
if (cb == 0)
return cb;
}
/*
* Find a class using the defining loader of the current class
* and return a global reference to it.
*/
{
if (global == 0)
#ifdef DEBUG
context->n_globalrefs++;
#endif
return global;
}
/*
* Return a unique ID given a local class reference. The loadable
* flag is true if the defining class loader of context->class
* is known to be capable of loading the class.
*/
static unsigned short
{
unsigned int hash;
unsigned short *pID;
while (*pID) {
/*
* There is an unresolved entry with our name
* so we're forced to load it in case it matches us.
*/
}
/*
* It's already in the table. Update the loadable
* state if it's known and then we're done.
*/
goto done;
}
}
}
#ifdef DEBUG
context->n_globalrefs++;
#endif
done:
return *pID;
}
/*
* Return a unique ID given a class name from the constant pool.
* All classes are lazily loaded from the defining loader of
* context->class.
*/
static unsigned short
{
unsigned short *pID;
while (*pID) {
goto done;
}
}
if (force_load) {
/*
* We found at least one matching named entry for a class that
* was not known to be loadable through the defining class loader
* of context->class. We must load our named class and update
* the hash table in case one these entries matches our class.
*/
return id;
}
done:
return *pID;
}
static const char *
{
}
static jclass
{
}
}
static fullinfo_type
{
return MAKE_FULLINFO(ITEM_Object, 0,
}
static fullinfo_type
{
return MAKE_FULLINFO(ITEM_Object, 0,
}
static fullinfo_type
{
return MAKE_FULLINFO(ITEM_Object, 0,
}
/* RETURNS
* 1: on success chosen to be consistent with previous VerifyClass
* 0: verify error
* 2: out of memory
* 3: class format error
*
* Called by verify_class. Verify the code of each of the methods
* in a class. Note that this function apparently can't be JNICALL,
* because if it is the dynamic linker doesn't appear to be able to
* find it on Win32.
*/
#define CC_VerifyError 0
{
int i;
int num_methods;
int* code_lengths;
unsigned char** code;
#ifdef DEBUG
#endif
calls CCerror */
/* Don't call CCerror or anything that can call it above the setjmp! */
context->constant_types = (unsigned char *)
if (context->constant_types == 0)
if (context->constant_types == 0)
if (super != 0) {
int i = 0;
while(super != 0) {
i++;
}
super = 0;
/* Can't go on context heap since it survives more than
one method */
if (gptr == 0) {
}
while(super != 0) {
}
*gptr = 0;
} else {
context->superclass_info = 0;
}
/* Look at each method */
for (i = num_methods - 1; i >= 0; --i)
} else {
}
/* Cleanup */
while(context->allocated_memory)
#ifdef DEBUG
GlobalContext = 0;
#endif
if (context->exceptions)
if (context->constant_types)
if (context->superclasses)
#ifdef DEBUG
/* Make sure all global refs created in the verifier are freed */
#endif
return result;
}
{
static int warned = 0;
if (!warned) {
warned = 1;
}
}
static void
{
if ( ((access_bits & JVM_ACC_PUBLIC) != 0) &&
}
}
/**
* We read all of the class's methods' code because it is possible that
* the verification of one method could resulting in linking further
* down the stack (due to class loading), which could end up rewriting
* some of the bytecode of methods we haven't verified yet. Since we
* don't want to see the rewritten bytecode, cache all the code and
* operate only on that.
*/
static void
int** lengths_addr, unsigned char*** code_addr)
{
int* lengths;
unsigned char** code;
int i;
*(lengths_addr) = lengths;
for (i = 0; i < num_methods; ++i) {
if (lengths[i] > 0) {
} else {
}
}
}
static void
{
int i;
for (i = 0; i < num_methods; ++i) {
}
}
}
/* Verify the code of one method */
static void
int code_length, unsigned char* code)
{
int *code_data;
int instruction_count;
int i, offset;
unsigned int inumber;
/* not much to do for abstract and native methods */
return;
}
/* CCerror can give method-specific info once this is set */
#ifdef DEBUG
if (verify_verbose) {
const char *methodname =
const char *signature =
}
#endif
if (((access_bits & JVM_ACC_PUBLIC) != 0) &&
}
/* Run through the code. Mark the start of each instruction, and give
* the instruction a number */
if (length <= 0)
if (next_offset > code_length)
" starting at offset %d", offset);
while (++offset < next_offset)
}
instruction_count = i; /* number of instructions in code */
/* Allocate a structure to hold info about each instruction. */
/* Initialize the heap, and other info in the context structure. */
NEW(struct handler_info_type,
if (instruction_count == 0)
/* This also sets up this_data->operand. It also makes the
* xload_x and xstore_x instructions look like the generic form. */
}
/* make sure exception table is reasonable. */
/* Set up first instruction, and start of exception handlers. */
/* Run data flow analysis on the instructions. */
/* verify checked exceptions, if any */
context->exceptions = (unsigned short *)
if (context->exceptions == 0)
for (i = 0; i < nexceptions; i++) {
/* Make sure the constant pool item is JVM_CONSTANT_Class */
}
context->exceptions = 0;
}
/* Look at a single instruction, and verify its operands. Also, for
* simplicity, move the operand into the ->operand field.
* Make sure that branches don't go into the middle of nowhere.
*/
{
unsigned char *p = (unsigned char *)&n;
return (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3];
}
static void
{
int var;
/*
* Set the ip fields to 0 not the i fields because the ip fields
* are 64 bits on 64 bit architectures, the i field is only 32
*/
switch (opcode) {
case JVM_OPC_jsr:
/* instruction of ret statement */
/* FALLTHROUGH */
case JVM_OPC_ifnull: case JVM_OPC_ifnonnull:
case JVM_OPC_if_acmpeq: case JVM_OPC_if_acmpne:
case JVM_OPC_goto: {
/* Set the ->operand to be the instruction number of the target. */
break;
}
case JVM_OPC_jsr_w:
/* instruction of ret statement */
/* FALLTHROUGH */
case JVM_OPC_goto_w: {
/* Set the ->operand to be the instruction number of the target. */
break;
}
case JVM_OPC_tableswitch:
case JVM_OPC_lookupswitch: {
/* Set the ->operand to be a table of possible instruction targets. */
int *lptr;
int *saved_operand;
int keys;
int k, delta;
/* 4639449, 4647081: Padding bytes must be zero. */
if (*bptr != 0) {
}
}
if (opcode == JVM_OPC_tableswitch) {
delta = 1;
} else {
delta = 2;
/* Make sure that the tableswitch items are sorted */
}
}
}
}
break;
}
case JVM_OPC_ldc: {
/* Make sure the constant pool item is the right type. */
(1 << JVM_CONSTANT_String);
}
(1 << JVM_CONSTANT_MethodType);
}
break;
}
case JVM_OPC_ldc_w: {
/* Make sure the constant pool item is the right type. */
(1 << JVM_CONSTANT_String);
}
(1 << JVM_CONSTANT_MethodType);
}
break;
}
case JVM_OPC_ldc2_w: {
/* Make sure the constant pool item is the right type. */
break;
}
case JVM_OPC_getfield: case JVM_OPC_putfield:
case JVM_OPC_getstatic: case JVM_OPC_putstatic: {
/* Make sure the constant pool item is the right type. */
break;
}
case JVM_OPC_invokevirtual:
case JVM_OPC_invokespecial:
case JVM_OPC_invokestatic:
case JVM_OPC_invokedynamic:
case JVM_OPC_invokeinterface: {
/* Make sure the constant pool item is the right type. */
const char *methodname;
? 1 << JVM_CONSTANT_NameAndType
: 1 << JVM_CONSTANT_Methodref);
/* Make sure the constant pool item is the right type. */
if (is_invokedynamic)
else
if (is_constructor) {
if (opcode != JVM_OPC_invokespecial) {
"Must call initializers using invokespecial");
}
} else {
if (is_internal) {
}
if (opcode == JVM_OPC_invokespecial
while(super != 0) {
if (clazz_info == new_info) {
not_found = 0;
break;
}
}
/* The optimizer make cause this to happen on local code */
if (not_found) {
#ifdef BROKEN_JAVAC
if (has_loader)
#endif /* BROKEN_JAVAC */
"Illegal use of nonvirtual function call");
}
}
}
if (opcode == JVM_OPC_invokeinterface) {
unsigned int args1;
unsigned int args2;
const char *signature =
"Inconsistent args_size for invokeinterface");
}
"Fourth operand byte of invokeinterface must be zero");
}
} else if (opcode == JVM_OPC_invokedynamic) {
"Third and fourth operand bytes of invokedynamic must be zero");
}
} else if (opcode == JVM_OPC_invokevirtual
|| opcode == JVM_OPC_invokespecial)
break;
}
case JVM_OPC_instanceof:
case JVM_OPC_checkcast:
case JVM_OPC_new:
case JVM_OPC_anewarray:
case JVM_OPC_multianewarray: {
/* Make sure the constant pool item is a class */
switch(opcode) {
case JVM_OPC_anewarray:
break;
case JVM_OPC_new:
if (WITH_ZERO_EXTRA_INFO(target) !=
MAKE_FULLINFO(ITEM_Object, 0, 0))
/* operand gets set to the "unitialized object". operand2 gets
* set to what the value will be after it's initialized. */
break;
case JVM_OPC_multianewarray:
|| (this_idata->operand2.i == 0))
break;
default:
}
break;
}
case JVM_OPC_newarray: {
/* Cache the result of the JVM_OPC_newarray into the operand slot */
case JVM_T_INT:
case JVM_T_LONG:
case JVM_T_FLOAT:
case JVM_T_DOUBLE:
case JVM_T_BYTE: case JVM_T_BOOLEAN:
case JVM_T_CHAR:
case JVM_T_SHORT:
default:
full_info = 0; /* Keep lint happy */
}
break;
}
/* Fudge iload_x, aload_x, etc to look like their generic cousin. */
goto check_local_variable;
goto check_local_variable;
goto check_local_variable;
goto check_local_variable2;
goto check_local_variable2;
goto check_local_variable;
goto check_local_variable;
goto check_local_variable;
goto check_local_variable2;
goto check_local_variable2;
case JVM_OPC_wide:
switch(this_idata->opcode) {
case JVM_OPC_lload: case JVM_OPC_dload:
case JVM_OPC_lstore: case JVM_OPC_dstore:
goto check_local_variable2;
default:
goto check_local_variable;
}
case JVM_OPC_iinc: /* the increment amount doesn't matter */
case JVM_OPC_ret:
/* Make sure that the variable number isn't illegal. */
break;
/* Make sure that the variable number isn't illegal. */
break;
default:
if (opcode > JVM_OPC_MAX)
break;
} /* of switch */
}
static void
{
} else {
}
int access;
/* 4734966: JVM_GetCPFieldModifiers() or JVM_GetCPMethodModifiers() only
searches the referenced field or method in calledClass. The following
while loop is added to search up the superclass chain to make this
specified in VM spec 5.4.3. */
do {
} else {
}
if (access != -1) {
break;
}
} while (calledClass != 0);
if (access == -1) {
} else if (access & JVM_ACC_PROTECTED) {
}
}
}
static jboolean
if (fptr == 0)
return JNI_FALSE;
if (*fptr == clazz_info)
return JNI_TRUE;
}
return JNI_FALSE;
}
/* Look through each item on the exception table. Each of the fields must
* refer to a legal instruction.
*/
static void
{
if (max_stack_size < 1 && i > 0) {
// If the method contains exception handlers, it must have room
// on the expression stack for the exception that the VM could push
}
for (; --i >= 0; handler_info++) {
i, &einfo);
}
if (!((einfo.handler_pc > 0) &&
}
/* einfo.end_pc may point to one byte beyond the end of bytecodes. */
const char *classname;
/* Constant pool entry type has been checked in format checker */
if (!isAssignableTo(context,
} else {
}
}
}
/* Given a pointer to an instruction, return its length. Use the table
* opcode_length[] which is automatically built.
*/
{
switch (instruction) {
case JVM_OPC_tableswitch: {
int index;
return -1; /* do not read pass the end */
}
return -1; /* illegal */
} else {
}
}
case JVM_OPC_lookupswitch: {
int npairs;
return -1; /* do not read pass the end */
/* There can't be more than 64K labels because of the limit
* on per-method byte code length.
*/
return -1;
else
}
case JVM_OPC_wide:
return -1; /* do not read pass the end */
switch(iptr[1]) {
case JVM_OPC_ret:
case JVM_OPC_iload: case JVM_OPC_istore:
case JVM_OPC_fload: case JVM_OPC_fstore:
case JVM_OPC_aload: case JVM_OPC_astore:
case JVM_OPC_lload: case JVM_OPC_lstore:
case JVM_OPC_dload: case JVM_OPC_dstore:
return 4;
case JVM_OPC_iinc:
return 6;
default:
return -1;
}
default: {
/* A length of 0 indicates an error. */
}
}
}
/* Given the target of a branch, make sure that it's a legal target. */
static jboolean
{
}
/* Make sure that an element of the constant pool really is of the indicated
* type.
*/
static void
{
unsigned type;
}
static void
{
const char *p;
const char *signature;
/* Initialize the function entry, since we know everything about it. */
/* A non static method. If this is an <init> method, the first
* argument is an uninitialized object. Otherwise it is an object of
* the given class type. java.lang.Object.<init> is special since
* we don't call its superclass <init> method.
*/
} else {
}
}
/* Fill in each of the arguments into the registers. */
switch (fieldchar) {
case 'D': case 'L':
break;
default:
break;
}
}
p++; /* skip over right parenthesis */
if (*p == 'V') {
} else {
}
/* Indicate that we need to look at the first instruction. */
}
/* Run the data flow analysis, as long as there are things to change. */
static void
unsigned int inumber;
/* Run through the loop, until there is nothing left to do. */
while (work_to_do) {
if (this_idata->changed) {
#ifdef DEBUG
if (verify_verbose) {
}
#endif
/* Make sure the registers and flags are appropriate */
/* Make sure the stack can deal with this instruction */
/* Update the registers and flags */
/* Update the stack. */
#ifdef DEBUG
if (verify_verbose) {
}
#endif
/* Add the new stack and register information to any
* instructions that can follow this instruction. */
}
}
}
}
/* Make sure that the registers contain a legitimate value for the given
* instruction.
*/
static void
{
int type;
switch (opcode) {
default:
return;
case JVM_OPC_iload: case JVM_OPC_iinc:
type = ITEM_Integer; break;
case JVM_OPC_fload:
type = ITEM_Float; break;
case JVM_OPC_aload:
type = ITEM_Object; break;
case JVM_OPC_ret:
type = ITEM_ReturnAddress; break;
case JVM_OPC_lload:
case JVM_OPC_dload:
}
if (!double_word) {
/* Make sure we don't have an illegal register or one with wrong type */
if (operand >= register_count) {
"Accessing value from uninitialized register %d", operand);
}
/* the register is obviously of the given type */
return;
/* address type stuff be used on all arrays */
return;
operand);
/* alternatively
(GET_ITEM_TYPE(reg) == ITEM_ReturnAddress)
&& (opcode == JVM_OPC_iload)
&& (type == ITEM_Object || type == ITEM_Integer)
but this never occurs
*/
return;
} else if (WITH_ZERO_EXTRA_INFO(reg) ==
MAKE_FULLINFO(ITEM_NewObject, 0, 0) &&
type == ITEM_Object) {
return;
} else {
}
} else {
/* Make sure we don't have an illegal register or one with wrong type */
"Accessing value from uninitialized register pair %d/%d",
} else {
return;
} else {
}
}
}
}
/* Make sure the flags contain legitimate values for this instruction.
*/
static void
{
switch (opcode) {
case JVM_OPC_return:
/* We need a constructor, but we aren't guaranteed it's called */
/* fall through */
case JVM_OPC_ireturn: case JVM_OPC_lreturn:
/* This method cannot exit normally */
default:
break; /* nothing to do. */
}
}
/* Make sure that the top of the stack contains reasonable values for the
* given instruction. The post-pop values of the stack and its size are
* returned in *new_stack_info.
*/
static void
{
char *stack_operands, *p;
switch(opcode) {
default:
/* For most instructions, we just use a built-in table */
break;
case JVM_OPC_putstatic: case JVM_OPC_putfield: {
/* The top thing on the stack depends on the signature of
* the object. */
const char *signature =
operand);
#ifdef DEBUG
if (verify_verbose) {
}
#endif
if (opcode == JVM_OPC_putfield)
*ip = '\0';
break;
}
case JVM_OPC_invokevirtual: case JVM_OPC_invokespecial:
case JVM_OPC_invokeinit: /* invokespecial call to <init> */
case JVM_OPC_invokedynamic:
case JVM_OPC_invokestatic: case JVM_OPC_invokeinterface: {
/* The top stuff on the stack depends on the method signature */
const char *signature =
operand);
const char *p;
#ifdef DEBUG
if (verify_verbose) {
}
#endif
if (opcode != JVM_OPC_invokestatic &&
/* First, push the object */
}
*ip = 0;
break;
}
case JVM_OPC_multianewarray: {
/* Count can't be larger than 255. So can't overflow buffer */
break;
}
} /* of switch */
/* Run through the list of operands >>backwards<< */
p > stack_operands;
int type = *--p;
*--stack_extra_info = top_type;
switch (type) {
case 'I':
break;
case 'F':
break;
case 'A': /* object or array */
&& (GET_INDIRECTION(top_type) == 0)) {
/* The thing isn't an object or an array. Let's see if it's
* one of the special cases */
if ( (WITH_ZERO_EXTRA_INFO(top_type) ==
MAKE_FULLINFO(ITEM_ReturnAddress, 0, 0))
&& (opcode == JVM_OPC_astore))
break;
break;
/* The 2nd edition VM of the specification allows field
* initializations before the superclass initializer,
* if the field is defined within the current class.
*/
&& (opcode == JVM_OPC_putfield)) {
/* Note: This relies on the fact that
* JVM_GetCPFieldModifiers retrieves only local fields,
* and does not respect inheritance.
*/
if (access_bits != -1) {
context->currentclass_info ) {
break;
}
}
}
}
break;
case '@': { /* unitialized object, for call to <init> */
"Expecting to find unitialized object on stack");
break;
}
case 'O': /* object, not array */
if (WITH_ZERO_EXTRA_INFO(top_type) !=
MAKE_FULLINFO(ITEM_Object, 0, 0))
break;
case 'a': /* integer, object, or array */
&& (GET_INDIRECTION(top_type) == 0))
"Expecting to find object, array, or int on stack");
break;
case 'D': /* double */
break;
case 'L': /* long */
break;
case ']': /* array of some type */
if (top_type == NULL_FULLINFO) {
/* do nothing */
} else switch(p[-1]) {
case 'I': /* array of integers */
"Expecting to find array of ints on stack");
break;
case 'L': /* array of longs */
"Expecting to find array of longs on stack");
break;
case 'F': /* array of floats */
"Expecting to find array of floats on stack");
break;
case 'D': /* array of doubles */
"Expecting to find array of doubles on stack");
break;
case 'A': { /* array of addresses (arrays or objects) */
if ((indirection == 0) ||
((indirection == 1) &&
"Expecting to find array of objects or arrays "
"on stack");
break;
}
case 'B': /* array of bytes */
"Expecting to find array of bytes on stack");
break;
case 'C': /* array of characters */
"Expecting to find array of chars on stack");
break;
case 'S': /* array of shorts */
"Expecting to find array of shorts on stack");
break;
case '?': /* any type of array is okay */
if (GET_INDIRECTION(top_type) == 0)
"Expecting to find array on stack");
break;
default:
break;
}
p -= 2; /* skip over [ <char> */
break;
case '1': case '2': case '3': case '4': /* stack swapping */
size = 2;
p -= 2;
} else {
"Attempt to split long or double on the stack");
}
} else {
p--; /* ignore */
}
break;
case '+': /* these should have been caught. */
default:
}
stack_size -= size;
}
/* For many of the opcodes that had an "A" in their field, we really
* need to go back and do a little bit more accurate testing. We can, of
* course, assume that the minimal type checking has already been done.
*/
switch (opcode) {
default: break;
case JVM_OPC_aastore: { /* array index object */
&& (GET_INDIRECTION(object_type) == 0)) {
}
&& (GET_INDIRECTION(target_type) == 0)) {
}
break;
}
case JVM_OPC_putfield:
case JVM_OPC_getfield:
case JVM_OPC_putstatic: {
if (!isAssignableTo
(context,
"Incompatible type for getting or setting field");
}
if (this_idata->protected &&
context->currentclass_info)) {
}
}
if (!isAssignableTo(context,
}
}
break;
}
case JVM_OPC_athrow:
context->throwable_info)) {
}
break;
case JVM_OPC_aaload: { /* array index */
/* We need to pass the information to the stack updater */
break;
}
case JVM_OPC_invokevirtual: case JVM_OPC_invokespecial:
case JVM_OPC_invokeinit:
case JVM_OPC_invokedynamic:
case JVM_OPC_invokeinterface: case JVM_OPC_invokestatic: {
const char *signature =
operand);
int item;
const char *p;
if (opcode == JVM_OPC_invokestatic ||
opcode == JVM_OPC_invokedynamic) {
item = 0;
} else if (opcode == JVM_OPC_invokeinit) {
/* We better be calling the appropriate init. Find the
* inumber of the "JVM_OPC_new" instruction", and figure
* out what the type really is.
*/
if (target_type != init_type) {
}
if (this_idata->protected
context->currentclass_info)) {
}
} else {
/* We better be calling super() or this(). */
}
}
item = 1;
} else {
"Incompatible object argument for function call");
}
if (opcode == JVM_OPC_invokespecial
context->currentclass_info)) {
/* Make sure object argument is assignment compatible to current class */
"Incompatible object argument for invokespecial");
}
if (this_idata->protected
context->currentclass_info)) {
/* This is ugly. Special dispensation. Arrays pretend to
implement public Object clone() even though they don't */
const char *utfName =
this_idata->operand.i);
(GET_INDIRECTION(object_type) > 0) &&
is_clone) {
} else {
}
}
item = 1;
}
if (!isAssignableTo(context,
}
}
break;
}
case JVM_OPC_return:
break;
case JVM_OPC_dreturn: case JVM_OPC_areturn: {
}
break;
}
case JVM_OPC_new: {
/* Make sure that nothing on the stack already looks like what
* we want to create. I can't image how this could possibly happen
* but we should test for it anyway, since if it could happen, the
* result would be an unitialized object being able to masquerade
* as an initialized one.
*/
"Uninitialized object on stack at creating point");
}
}
/* Info for update_registers */
break;
}
}
}
/* We've already determined that the instruction is legal. Perform the
* operation on the registers, and return the updated results in
* new_register_count_p and new_registers.
*/
static void
{
/* Use these as default new values. */
int i;
/* Remember, we've already verified the type at the top of the stack. */
switch (opcode) {
default: break;
goto continue_store;
case JVM_OPC_lstore: case JVM_OPC_dstore:
goto continue_store;
/* We have a modification to the registers. Copy them if needed. */
if ( max_operand < register_count
&& ((access == ACCESS_SINGLE) ||
/* No changes have been made to the registers. */
break;
for (i = 0; i < register_count; i++)
new_registers[i] = registers[i];
for (i = register_count; i < new_register_count; i++)
if (access == ACCESS_DOUBLE)
break;
}
case JVM_OPC_iinc: case JVM_OPC_ret:
break;
case JVM_OPC_lload: case JVM_OPC_dload:
break;
case JVM_OPC_jsr: case JVM_OPC_jsr_w:
for (i = 0; i < new_mask_count; i++)
break;
case JVM_OPC_invokeinit:
case JVM_OPC_new: {
/* For invokeinit, an uninitialized object has been initialized.
* For new, all previous occurrences of an uninitialized object
* from the same instruction must be made bogus.
* We find all occurrences of swap_table[0] in the registers, and
* replace them with swap_table[1];
*/
int i;
for (i = 0; i < register_count; i++) {
if (new_registers[i] == from) {
/* Found a match */
break;
}
}
if (i < register_count) { /* We broke out loop for match */
/* We have to change registers, and possibly a mask */
int k;
register_count * sizeof(registers[0]));
for ( ; i < register_count; i++) {
if (new_registers[i] == from) {
new_registers[i] = to;
for (k = 0; k < new_mask_count; k++) {
if (!copied_mask) {
}
}
}
}
}
}
break;
}
} /* of switch */
int i, j;
for (i = 0; i < new_mask_count; i++) {
((access == ACCESS_DOUBLE) &&
for (j = i; j < new_mask_count; j++) {
if (access == ACCESS_DOUBLE)
}
break;
}
}
}
}
/* We've already determined that the instruction is legal, and have updated
* the registers. Update the flags, too.
*/
static void
{
/* Set the "we've done a constructor" flag */
}
*new_or_flags = or_flags;
}
/* We've already determined that the instruction is legal. Perform the
* operation on the stack;
*
* new_stack_size_p and new_stack_p point to the results after the pops have
* already been done. Do the pushes, and then put the results back there.
*/
static void
{
char *stack_results;
/* We need to look at all those opcodes in which either we can't tell the
* value pushed onto the stack from the opcode, or in which the value
* pushed onto the stack is an object or array. For the latter, we need
* to make sure that full_info is set to the right value.
*/
switch(opcode) {
default:
break;
/* Look to constant pool to determine correct result. */
switch (type_table[operand]) {
case JVM_CONSTANT_Integer:
stack_results = "I"; break;
case JVM_CONSTANT_Float:
stack_results = "F"; break;
case JVM_CONSTANT_Double:
stack_results = "D"; break;
case JVM_CONSTANT_Long:
stack_results = "L"; break;
case JVM_CONSTANT_String:
stack_results = "A";
break;
case JVM_CONSTANT_Class:
stack_results = "A";
break;
case JVM_CONSTANT_MethodType:
stack_results = "A";
switch (type_table[operand]) {
case JVM_CONSTANT_MethodType:
"java/lang/invoke/MethodType");
break;
default: //JVM_CONSTANT_MethodHandle
"java/lang/invoke/MethodHandle");
break;
}
break;
default:
}
break;
}
case JVM_OPC_getstatic: case JVM_OPC_getfield: {
/* Look to signature to determine correct result. */
operand);
#ifdef DEBUG
if (verify_verbose) {
}
#endif
break;
}
case JVM_OPC_invokevirtual: case JVM_OPC_invokespecial:
case JVM_OPC_invokeinit:
case JVM_OPC_invokedynamic:
case JVM_OPC_invokestatic: case JVM_OPC_invokeinterface: {
/* Look to signature to determine correct result. */
operand);
const char *result_signature;
if (result_signature++ == NULL) {
}
if (result_signature[0] == JVM_SIGNATURE_VOID) {
stack_results = "";
} else {
&full_info);
}
break;
}
case JVM_OPC_aconst_null:
break;
case JVM_OPC_new:
case JVM_OPC_checkcast:
case JVM_OPC_newarray:
case JVM_OPC_anewarray:
case JVM_OPC_multianewarray:
/* Conveniently, this result type is stored here */
break;
case JVM_OPC_aaload:
/* pop_stack() saved value for us. */
break;
case JVM_OPC_aload:
/* The register hasn't been modified, so we can use its value. */
break;
} /* of switch */
for (p = stack_results; *p != 0; p++) {
int type = *p;
switch (type) {
case 'I':
case 'F':
case 'D':
stack_size++; break;
case 'L':
stack_size++; break;
case 'R':
break;
case '1': case '2': case '3': case '4': {
/* Get the info saved in the swap_table */
stack_size++; p++;
}
break;
}
case 'A':
/* full_info should have the appropriate value. */
break;
default:
} /* switch type */
stack_size++;
} /* outer for loop */
if (opcode == JVM_OPC_invokeinit) {
/* If there are any instances of "from" on the stack, we need to
* replace it with "to", since calling <init> initializes all versions
* of the object, obviously. */
break;
}
}
}
}
/* We've performed an instruction, and determined the new registers and stack
* value. Look at all of the possibly subsequent instructions, and merge
* this stack value into theirs.
*/
static void
{
int handler_info_length =
int successors_count;
int i;
switch (opcode) {
default:
successors_count = 1;
break;
case JVM_OPC_ifnull: case JVM_OPC_ifnonnull:
case JVM_OPC_if_acmpeq: case JVM_OPC_if_acmpne:
successors_count = 2;
break;
case JVM_OPC_jsr: case JVM_OPC_jsr_w:
/* FALLTHROUGH */
case JVM_OPC_goto: case JVM_OPC_goto_w:
successors_count = 1;
break;
case JVM_OPC_athrow:
/* The testing for the returns is handled in pop_stack() */
successors_count = 0;
break;
case JVM_OPC_ret: {
/* This is slightly slow, but good enough for a seldom used instruction.
* The EXTRA_ITEM_INFO of the ITEM_ReturnAddress indicates the
* address of the first instruction of the subroutine. We can return
* to 1 after any instruction that jsr's to that instruction.
*/
count++;
}
*ptr++ = i + 1;
}
}
successors_count = *successors++;
break;
}
case JVM_OPC_tableswitch:
case JVM_OPC_lookupswitch:
successors_count = *successors++;
break;
}
#ifdef DEBUG
if (verify_verbose) {
for (i = handler_info_length; --i >= 0; handler_info++)
for (i = 0; i < successors_count; i++)
}
#endif
for (i = handler_info_length; --i >= 0; handler_info++) {
if (opcode != JVM_OPC_invokeinit) {
& this_idata->and_flags),
| this_idata->or_flags),
JNI_TRUE);
} else {
/* We need to be a little bit more careful with this
* instruction. Things could either be in the state before
* the instruction or in the state afterwards */
JNI_TRUE);
}
}
}
for (i = 0; i < successors_count; i++) {
}
}
/* We have a new set of registers and stack values for a given instruction.
* Merge this new set into the values that are already there.
*/
static void
unsigned int from_inumber, unsigned int to_inumber,
{
#ifdef DEBUG
#endif
#ifdef DEBUG
if (verify_verbose) {
}
#endif
/* All uninitialized objects are set to "bogus" when jsr and
* ret are executed. Thus uninitialized objects can't propagate
* into or out of a subroutine.
*/
int i;
/* This check only succeeds for hand-contrived code.
* Efficiency is not an issue.
*/
}
}
break;
}
}
for (i = 0; i < new_register_count; i++) {
/* This check only succeeds for hand-contrived code.
* Efficiency is not an issue.
*/
for (i = 0; i < new_register_count; i++) {
fullinfo_type t = new_registers[i];
t : MAKE_FULLINFO(ITEM_Bogus, 0, 0);
}
break;
}
}
}
/* Returning from a subroutine is somewhat ugly. The actual thing
* that needs to get merged into the new instruction is a joining
* of info from the ret instruction with stuff in the jsr instruction
*/
}
/* We don't want to handle the returned-to instruction until
* we've dealt with the jsr instruction. When we get to the
* jsr instruction (if ever), we'll re-mark the ret instruction
*/
;
} else {
int *return_mask;
int i;
/* Make sure the place we're returning from is legal! */
for (i = new_mask_count; --i >= 0; )
break;
if (i < 0)
/* pop the masks down to the indicated one. Remember the mask
* we're popping off. */
new_mask_count = i;
for (i = 0; i < max_registers; i++) {
if (IS_BIT_SET(return_mask, i))
new_set[i] = i < new_register_count ?
else
new_set[i] = i < register_count ?
}
}
} else {
}
#ifdef DEBUG
}
}
#endif
}
static void
{
if (stack_size == UNKNOWN_STACK_SIZE) {
/* First time at this instruction. Just copy. */
} else if (new_stack_size != stack_size) {
} else {
break;
}
}
if (change) {
break;
}
}
}
}
}
}
}
static void
{
} else {
/* See if we've got new information on the register set. */
int i, j;
if (register_count > new_register_count) {
/* Any register larger than new_register_count is now bogus */
}
for (i = 0; i < register_count; i++) {
if ((i < new_register_count)
break;
}
}
if (copy) {
/* We need a copy. So do it. */
for (j = 0; j < i; j++)
for (j = i; j < register_count; j++) {
if (i >= new_register_count)
else
new_registers[j],
}
/* Some of the end items might now be bogus. This step isn't
* necessary, but it may save work later. */
while ( register_count > 0
}
if (mask_count > 0) {
/* If the target instruction already has a sequence of masks, then
* we need to merge new_masks into it. We want the entries on
* the mask to be the longest common substring of the two.
* (e.g. a->b->d merged with a->c->d should give a->d)
* The bits set in the mask should be the or of the corresponding
* entries in each of the original masks.
*/
int i, j, k;
int matches = 0;
for (i = 0; i < mask_count; i++) {
/* We have a match */
matches++;
/* See if new_mask has bits set for "entry" that
* weren't set for mask. If so, need to copy. */
!copy_needed && k >= 0;
k--)
last_match = j;
break;
}
}
}
/* We need to make a copy for the new item, since either the
* size has decreased, or new bits are set. */
for (i = 0; i < matches; i++) {
}
matches = 0;
last_match = -1;
for (i = 0; i < mask_count; i++) {
matches++;
last_match = j;
break;
}
}
}
}
}
}
}
static void
unsigned int to_inumber,
{
/* Set this_idata->and_flags &= new_and_flags
this_idata->or_flags |= new_or_flags
*/
}
}
/* Make a copy of a stack */
static stack_item_type *
{
int length;
/* Find the length */
if (length > 0) {
}
return new_stack;
} else {
return NULL;
}
}
static mask_type *
{
int i;
for (i = 0; i < mask_count; i++) {
}
return result;
}
static mask_type *
{
int i;
for (i = 0; i < mask_count; i++) {
}
return result;
}
/* We create our own storage manager, since we malloc lots of little items,
* and I don't want to keep trace of when they become free. I sure wish that
* we had heaps, and I could just free the heap when done.
*/
int poolPad;
};
/* Initialize the context's heap. */
{
/* Set context->CCroot to 0 if new == 0 to tell CCdestroy to lay off */
if (new == 0) {
}
}
/* Reuse all the space that we have in the context's heap. */
{
}
/* Destroy the context's heap. */
{
while (this) {
}
/* These two aren't necessary. But can't hurt either */
context->CCfree_ptr = 0;
}
/* Allocate an object of the given size from the context's heap. */
static void *
{
register char *p;
/* Round CC to the size of a pointer */
if (new == 0) {
}
} else {
if (new == 0) {
}
}
}
}
p = context->CCfree_ptr;
if (zero)
return p;
}
/* Get the class associated with a particular field or method or class in the
* constant pool. If is_field is true, we've got a field or method. If
* false, we've got a class.
*/
static fullinfo_type
{
const char *classname;
switch (kind) {
case JVM_CONSTANT_Class:
cp_index);
break;
case JVM_CONSTANT_Methodref:
cp_index);
break;
case JVM_CONSTANT_Fieldref:
cp_index);
break;
default:
}
if (classname[0] == JVM_SIGNATURE_ARRAY) {
/* This make recursively call us, in case of a class array */
} else {
}
return result;
}
static int
{
const char *name = 0;
const char *signature = 0;
int n = 0;
"(class: %s, method: %s signature: %s) ",
"(class: %s, field: %s) ",
} else {
}
return n;
}
static void
{
int n = print_CCerror_info(context);
if (n >= 0 && n < context->message_buf_len) {
}
}
static void
{
int n = print_CCerror_info(context);
}
static void
{
int n = print_CCerror_info(context);
if (n >= 0 && n < context->message_buf_len) {
}
}
static char
{
const char *p = *signature_p;
char result;
int array_depth = 0;
for (;;) {
switch(*p++) {
default:
result = 0;
break;
case JVM_SIGNATURE_BOOLEAN: case JVM_SIGNATURE_BYTE:
full_info = (array_depth > 0)
? MAKE_FULLINFO(ITEM_Byte, 0, 0)
: MAKE_FULLINFO(ITEM_Integer, 0, 0);
result = 'I';
break;
case JVM_SIGNATURE_CHAR:
full_info = (array_depth > 0)
? MAKE_FULLINFO(ITEM_Char, 0, 0)
: MAKE_FULLINFO(ITEM_Integer, 0, 0);
result = 'I';
break;
case JVM_SIGNATURE_SHORT:
full_info = (array_depth > 0)
? MAKE_FULLINFO(ITEM_Short, 0, 0)
: MAKE_FULLINFO(ITEM_Integer, 0, 0);
result = 'I';
break;
case JVM_SIGNATURE_INT:
result = 'I';
break;
case JVM_SIGNATURE_FLOAT:
result = 'F';
break;
case JVM_SIGNATURE_DOUBLE:
result = 'D';
break;
case JVM_SIGNATURE_LONG:
result = 'L';
break;
case JVM_SIGNATURE_ARRAY:
array_depth++;
continue; /* only time we ever do the loop > 1 */
case JVM_SIGNATURE_CLASS: {
int length;
/* Signature must have ';' after the class name.
* If it does not, return 0 and ITEM_Bogus in full_info. */
result = 0;
break;
}
}
result = 'A';
p = finish + 1;
if (buffer != buffer_space)
break;
}
} /* end of switch */
break;
}
*signature_p = p;
if (array_depth == 0 || result == 0) {
/* either not an array, or result is bogus */
*full_info_p = full_info;
return result;
} else {
if (array_depth > MAX_ARRAY_DIMENSIONS)
return 'A';
}
}
/* Given an array type, create the type that has one less level of
* indirection.
*/
static fullinfo_type
{
if (array_info == NULL_FULLINFO) {
return NULL_FULLINFO;
} else {
if ( (indirection == 0)
type = ITEM_Integer;
}
}
/* See if we can assign an object of the "from" type to an object
* of the "to" type.
*/
{
}
/* Given two fullinfo_type's, find their lowest common denominator. If
* the assignable_p argument is non-null, we're really just calling to find
* out if "<target> := <value>" is a legitimate assignment.
*
* runtime will do the full checking.
*/
static fullinfo_type
{
/* If they're identical, clearly just return what we've got */
return value;
}
/* Both must be either arrays or objects to go further */
return MAKE_FULLINFO(ITEM_Bogus, 0, 0);
return MAKE_FULLINFO(ITEM_Bogus, 0, 0);
/* If either is NULL, return the other. */
if (value == NULL_FULLINFO)
return target;
else if (target == NULL_FULLINFO)
return value;
return target;
/* Minor hack. For assignments, Interface := Object, return Interface
* rather than Object, so that isAssignableTo() will get the right
* result. */
MAKE_FULLINFO(ITEM_Object, 0, 0))) {
target);
if (is_interface)
return target;
}
return value;
}
* Moreover, the types are not identical.
* The result must either be Object, or an array of some object type.
*/
return target;
}
return value;
}
/* First, if either item's base type isn't ITEM_Object, promote it up
* to an object or array of object. If either is elemental, we can
* punt.
*/
if (dimen_value == 0)
return MAKE_FULLINFO(ITEM_Bogus, 0, 0);
dimen_value--;
}
if (dimen_target == 0)
return MAKE_FULLINFO(ITEM_Bogus, 0, 0);
dimen_target--;
}
/* Both are now objects or arrays of some sort of object type */
if (dimen_value == dimen_target) {
/* Arrays of the same dimension. Merge their base types. */
/* bogus in, bogus out */
return result_base;
} else {
/* Arrays of different sizes. If the smaller dimension array's base
* of the two */
if (dimen_value < dimen_target) {
return value;
}
return MAKE_Object_ARRAY(dimen_value);
} else {
return target;
}
return MAKE_Object_ARRAY(dimen_target);
}
}
} else {
/* Let's get the classes corresponding to each of these. Treat
if (cb_target == 0)
return MAKE_FULLINFO(ITEM_Bogus, 0, 0);
if (cb_value == 0)
return MAKE_FULLINFO(ITEM_Bogus, 0, 0);
return context->object_info;
/* If this is for assignment of target := value, we just need to see if
* cb_target is a superclass of cb_value. Save ourselves a lot of
* work.
*/
if (for_assignment) {
while (cb_super_value != 0) {
return target;
}
}
return context->object_info;
}
/* Find out whether cb_value or cb_target is deeper in the class
* tree by moving both toward the root, and seeing who gets there
* first. */
while((cb_super_value != 0) &&
(cb_super_target != 0)) {
/* Optimization. If either hits the other when going up looking
* for a parent, then might as well return the parent immediately */
return target;
}
return value;
}
}
/* At most one of the following two while clauses will be executed.
* Bring the deeper of cb_target and cb_value to the depth of the
* shallower one.
*/
while (cb_super_value != 0) {
/* cb_value is deeper */
}
while (cb_super_target != 0) {
/* cb_target is deeper */
}
/* Walk both up, maintaining equal depth, until a join is found. We
* know that we will find one. */
}
return result_info;
} /* both items are classes */
}
/* Given a fullinfo_type corresponding to an Object, return the jclass
* of that type.
*
* This function always returns a global reference!
*/
static jclass
{
}
{
switch (kind) {
case VM_STRING_UTF:
break;
case VM_MALLOC_BLK:
break;
}
}
{
alloc_stack_type *p;
if (ptr == 0)
else {
/* Otherwise we have to malloc */
p = malloc(sizeof(alloc_stack_type));
if (p == 0) {
/* Make sure we clean up. */
}
}
context->allocated_memory = p;
}
{
p >= context->alloc_stack)
else
free(p);
}
{
const char *p;
int args_size = 0;
for (p = method_signature; *p != JVM_SIGNATURE_ENDFUNC; p++) {
switch (*p) {
case JVM_SIGNATURE_BOOLEAN:
case JVM_SIGNATURE_BYTE:
case JVM_SIGNATURE_CHAR:
case JVM_SIGNATURE_SHORT:
case JVM_SIGNATURE_INT:
case JVM_SIGNATURE_FLOAT:
args_size += 1;
break;
case JVM_SIGNATURE_CLASS:
args_size += 1;
while (*p != JVM_SIGNATURE_ENDCLASS) p++;
break;
case JVM_SIGNATURE_ARRAY:
args_size += 1;
while ((*p == JVM_SIGNATURE_ARRAY)) p++;
/* If an array of classes, skip over class name, too. */
if (*p == JVM_SIGNATURE_CLASS) {
while (*p != JVM_SIGNATURE_ENDCLASS)
p++;
}
break;
case JVM_SIGNATURE_DOUBLE:
case JVM_SIGNATURE_LONG:
args_size += 2;
break;
case JVM_SIGNATURE_FUNC: /* ignore initial (, if given */
break;
default:
/* Indicate an error. */
return 0;
}
}
return args_size;
}
#ifdef DEBUG
/* Below are for debugging. */
static void
{
} else {
}
}
static void
{
if (register_count == UNKNOWN_REGISTER_COUNT) {
} else {
int i, j;
for (i = 0; i < register_count; i++)
for (i = 0; i < mask_count; i++) {
for (j = 0;
j++)
if (IS_BIT_SET(modifies, j)) {
separator = ",";
}
}
}
}
static void
{
}
}
static void
{
int i;
for (i = indirection; i-- > 0; )
switch (GET_ITEM_TYPE(type)) {
case ITEM_Integer:
case ITEM_Float:
case ITEM_Double:
case ITEM_Double_2:
case ITEM_Long:
case ITEM_Long_2:
case ITEM_ReturnAddress:
case ITEM_Object:
if (!verbose) {
} else {
if (extra == 0) {
} else {
}
}
break;
case ITEM_Char:
case ITEM_Short:
case ITEM_Byte:
case ITEM_NewObject:
if (!verbose) {
} else {
}
break;
case ITEM_InitObject:
break;
default:
}
for (i = indirection; i-- > 0; )
}
static void
{
}
static void
{
}
#endif /*DEBUG*/