PROCESSOR WITH ACCELERATED ARRAY ACCESS BOUNDS CHECKING

Abstract: An array boundary checking apparatus is configured to verify that a referenced element of an information array is within a maximum array size boundary value and a minimum array size boundary value. The array boundary checking apparatus of the invention includes an associative memory element that stores and retrieves a plurality of array bound values. Each one of the plurality of array bound values is associated with one of the plurality of array access instructions. An input section simultaneously compares the array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction. An output section is configured to provide as an array bounds output values one of the plurality of array bound values stored in one of the plurality of memory locations of the associated memory element. A first comparison element compares the value of the referenced element and the maximum array index boundary value and provides a maximum violation signal if the value of the element is greater than the maximum array size boundary value. A second comparison element compares the value of the element and the minimum array size boundary value and provides a minimum violation signal if the value of the element is less than the minimum array bounds value. Either a maximum violation signal or a minimum violation signal results in an exception.

Description: PROCESSOR WITH ACCELERATED ARRAY ACCESS BOUNDS CHECKING REFERENCE TO Appendix I A portion of the disclosure of this patent document including Appendix I, The JAVA Virtual Machine Specification and Appendix A thereto, contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the U.S. Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever. BACKGROUND OF THE INVENTION Field of the Invention The present invention relates generally to computer systems and, in particular, to an enhanced processor and computer system including array access bounds checking. Discussion of Related Art Many individuals and organizations in the computer and communications industries tout the Internet as the fastest growing market on the planet. In the 1990s, the number of users of the Internet appears to be growing exponentially with no end in sight. In June of 1995, an estimated 6,642,000 hosts were connected to the Internet; this represented an increase from an estimated 4,852,000 hosts in January, 1995. The number of hosts appears to be growing at around 75% per year. Among the hosts, there were approximately 120,000 networks and over 27,000 web servers. The number of web servers appears to be approximately doubling every 53 days. In July 1995, with over 1,000,000 active Internet users, over 12,505 usenet news groups, and over 10,000,000 usenet readers, the Internet appears to be destined to explode into a very large market for a wide variety of information and multimedia services. In addition, to the public carrier network or Internet, many corporations and other businesses are shifting their internal information systems onto an intranet as a way of more effectively sharing information within a corporate or private network. The basic infrastructure for an intranet is an internal network connecting servers and desktops, which may or may not be connected to the Internet through a firewall. These intranets provide services to desktops via standard open network protocols which are well established in the industry. Intranets provide many benefits to the enterprises which employ them, such as simplified internal information management and improved internal communication using the browser paradigm. Integrating Internet technologies with a company' s enterprise infrastructure and legacy systems also leverages existing technology investment for the party employing an intranet. As discussed above, intranets and the Internet are closely related, with intranets being used for internal and secure communications within the business and the Internet being used for external transactions between the business and the outside world. For the purposes of this document, the term "networks" includes both the Internet and intranets. However, the distinction between the Internet and an intranet should be born in mind where applicable. In 1990, programmers at Sun Microsystems wrote a universal programming language. This language was eventually named the JAVA programming language. (JAVA is a trademark of Sun Microsystems of Mountain View, CA.) The JAVA programming language resulted from programming efforts which initially were intended to be coded in the C++ programming language; therefore, the JAVA programming language has many commonalities with the C++ programming language. However, the JAVA programming language is a simple, object-oriented, distributed, interpreted yet high performance, robust yet safe, secure, dynamic, architecture neutral, portable, and multi-threaded language. The JAVA programming language has emerged as the programming language of choice for the Internet as many large hardware and software companies have licensed it from Sun Microsystems. The JAVA programming language and environment is designed to solve a number of problems in modern programming practice. The JAVA programming language omits many rarely used, poorly understood, and confusing features of the C++ programming language. These omitted features primarily consist of operator overloading, multiple inheritance, and extensive automatic coercions. The JAVA programming language includes automatic garbage collection that simplifies the task of programming because it is no longer necessary to allocated and free memory as in the C programming language. The JAVA programming language restricts the use of the pointers defined in the C programming language, and instead has true arrays in which array bounds are explicitly checked, thereby eliminating vulnerability to many viruses and nasty bugs. The JAVA programming language includes objective-C interfaces and specific exception handlers. The JAVA programming language has an extensive library of routines for coping easily with TCP/IP protocol (Transmission Control Protocol based on Internet protocol) , HTTP (Hypertext Transfer Protocol) and FTP (File Transfer Protocol) . The JAVA programming language is intended to be used in networked/distributed environments. The JAVA programming language enabled the construction of virus-free, tamper-free systems. The authentication techniques are based on public-key encryption. Many computer system applications utilize arrays. An array is an arrangement of information in one or more dimensions, e.g., a list, a table, or a multidimensional arrangement of data. In computer systems that implement specific instructions for arrays, an iterative comparison process typically is required to match a specific array access instruction to the associated array. It is then necessary to check the size of the array to verify that it is within acceptable bounds that can be handled by the defined architecture of the computer system. Array bounds checking results in a more robust system since an array access instruction has access only to those data elements defined by the array and no access to adjacent data is possible. This results in fewer bugs and improved system security. However, the step-by-step comparison and verification required for array bounds checking, which typically requires at least one cycle per step, consumes valuable processing time until a verification occurs. What is needed is an apparatus and method to implement array access and to accelerate bounds checking, thereby significantly reducing the time required to retrieve array information and verify its size relative to conventional systems. SUMMARY OF THE INVENTION The present invention utilizes a fully associative memory, such as a content addressable memory, to implement array access bounds checking and to accelerate array access bounds checking, thereby significantly reducing the time required to retrieve array information and verify its size relative to conventional systems. One embodiment of the present invention provides an array boundary checking apparatus that is configured to verify that each access of an information array is within a maximum array size boundary value and a minimum array size boundary value, typically zero. The apparatus includes an associative memory element that stores and retrieves a plurality of array size values. Each pair of the array size values is associated with one of a plurality of array access instructions. Each array access instruction is used to references elements within an array. The associative memory element includes a first memory section, a second memory section, an input section and an output section. The first memory section includes a first plurality of memory locations configured to receive and store a plurality of array reference entries. Each one of the first plurality of memory locations is configured to store one of the plurality of array reference entries. Each one of the plurality of array reference entries corresponds to one of the plurality of array access instructions. The second memory section includes a second plurality of memory locations configured to receive and store a plurality of array size values. Each one of the second plurality of memory locations is configured to store one pair of the array size values and is associated with one of the first plurality of memory locations. Each one of the plurality of array size values is associated with one of the plurality of array access instructions. According to the principles of the invention, the input section is coupled to the first memory section and configured to receive an array access instruction identifier. The input section simultaneously compares the array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction. The output section, which is coupled to the second memory section, is configured to provide, as an array size output value, one pair of the plurality of array size values stored in one of the second plurality of memory locations which is associated with one of the first plurality of memory locations which stores one of the plurality of array reference entries that matches the array access instruction identifier. A first comparison element compares the value of the referenced element and the maximum array size boundary value and provides an maximum violation signal if the value of the element is greater than the array size boundary value. A second comparison element compares the value of the element and the minimum array size boundary value and provides an minimum violation signal if the value of the element is less than the array size boundary value. Either a maximum violation signal or a minimum violation signal results in an exception. Another embodiment of the invention provides a computer system that includes a software translator, an execution unit, an array access processor, and an associative memory element as described above. In this embodiment of the invention, the translation unit is configured to receive and translate a software program and, in accordance therewith, to provide a plurality of translated software instructions and associated instruction identifiers. Each one of the translated software instructions corresponds to one of the instruction identifiers. The translated instructions include a plurality of array access instructions. In this embodiment of the invention, the execution unit is configured to receive and execute translated instructions, The execution unit is further configured to respond to an exception output signal generated by the associative memory element and exception element by executing a sequence of translated instructions that define an array access bounds exception subroutine. These and other features and advantages of the present invention will be apparent from the Figures as discussed in the Detailed Description of the Invention BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a block diagram of one embodiment of virtual machine hardware processor that utilizes the bounds check unit of this invention. Figure 2 is an process flow diagram for generation of virtual machine instructions that are used in one embodiment of this invention. Figure 3 illustrates an instruction pipeline implemented in the hardware processor of Figure 1. Figure 4A is an illustration of the one embodiment of the logical organization of a stack structure where each method frame includes a local variable storage area, an environment storage area, and an operand stack utilized by the hardware processor of Figure 1. Figure 4B is an illustration of an alternative embodiment of the logical organization of a stack structure where each method frame includes a local variable storage area and an operand stack on the stack, and an environment storage area for the method frame is included on a separate execution environment stack. Figure 4C is an illustration of an alternative embodiment of the stack management unit for the stack and execution environment stack of Figure 4B. Figure 4D is an illustration of one embodiment of the local variables look-aside cache in the stack management unit of Figure 1. Figure 5 illustrates several possible add-ons to the hardware processor of Figure 1. Figure 6A shows a computer system that includes a translation unit, an array access processor, an array bounds checking element that includes an associative memory device, and an execution unit in accordance with the principles of the invention. Figure 6B shows a typical array instruction used with the computer system of Figure 6A or Figure 6C. Figure 6C shows a computer system for operating with, and including portions of, the virtual machine hardware processor of Figure 1 according to the principles of the invention. These and other features and advantages of the present invention will be apparent from the Figures as explained in the Detailed Description of the Invention. Like or similar features are designated by the same reference numeral (s) throughout the drawings and the Detailed Description of the Invention. DETAILED DESCRIPTION OF THE INVENTION Figure 1 illustrates one embodiment of a virtual machine instruction hardware processor 100, hereinafter hardware processor 100, that includes a bounds check unit 147 in accordance with the present invention, and that directly executes virtual machine instructions that are processor architecture independent . The performance of hardware processor 100 in executing JAVA virtual machine instructions is much better than high-end CPUs, such as the Intel PENTIUM microprocessor or the Sun Microsystems ULTRASPARC processor, (ULTRASPARC is a trademark of Sun Microsystems of Mountain View, CA. , and PENTIUM is a trademark of Intel Corp. of Sunnyvale, CA.) interpreting the same virtual machine instructions with a software JAVA interpreter. or with a JAVA just-in-time compiler; is low cost; and exhibits low power consumption. As a result, hardware processor 100 is well suited for portable applications. Hardware processor 100 provides similar advantages for other virtual machine stack-based architectures as well as for virtual machines utilizing features such as garbage collection, thread synchronization, etc. In view of these characteristics, a system based on hardware processor 100 presents attractive price for performance characteristics, if not the best overall performance, as compared with alternative virtual machine execution environments including software interpreters and just-in-time compilers. Nonetheless, the present invention is not limited to virtual machine hardware processor embodiments, and encompasses any suitable stack-based, or non-stack-based machine implementations, including implementations emulating the JAVA virtual machine as a software interpreter, compiling JAVA virtual machine instructions (either in batch or just-in-time) to machine instruction native to a particular hardware processor, or providing hardware implementing the JAVA virtual machine in microcode, directly in silicon, or in some combination thereof. Regarding price for performance characteristics, hardware processor 100 has the advantage that the 250 Kilobytes to 500 Kilobytes (Kbytes) of memory storage, e.g., read-only memory or random access memory, typically required by a software interpreter, is eliminated. A simulation of hardware processor 100 showed that hardware processor 100 executes virtual machine instructions twenty times faster than a software interpreter running on a PENTIUM processor clocked at the same clock rate as hardware processor 100, and executing the same virtual machine instructions. Another simulation of hardware processor 100 showed that hardware processor 100 executes virtual machine instructions five times faster than a just-in-time compiler running on a PENTIUM processor running at the same clock rate as hardware processor 100, and executing the same virtual machine instructions. In environments in which the expense of the memory required for a software virtual machine instruction interpreter is prohibitive, hardware processor 100 is advantageous. These applications include, for example, an Internet chip for network appliances, a cellular telephone processor, other telecommunications integrated circuits, or other low-power, low-cost applications such as embedded processors, and portable devices. Bounds check unit 147 of this invention provides a high speed hardware circuit for checking each access to an array to assure that the access is not outside the bounds of the array. The use of a hardware circuit, as described more completely below, eliminates multiple processor cycles that would normally be associated with array bounds checking. Prior to considering bounds check unit 137 in further detail, one embodiment of a hardware processor that includes this invention is described to provide a background for implementation of bounds check unit 137 in a hardware virtual machine implementation. As used in herein, a virtual machine is an abstract computing machine that, like a real computing machine, has an instruction set and uses various memory areas. A virtual machine specification defines a set of processor architecture independent virtual machine instructions that are executed by a virtual machine implementation, e.g., hardware processor 100. Each virtual machine instruction defines a specific operation that is to be performed. The virtual computing machine need not understand the computer language that is used to generate virtual machine instructions or the underlying implementation of the virtual machine. Only a particular file format for virtual machine instructions needs to be understood. In an exemplary embodiment, the virtual machine instructions are JAVA virtual machine instructions. Each JAVA virtual machine instruction includes one or more bytecodes that encode instruction identifying information, operands, and any other required information. Appendix I, which is incorporated herein by reference in its entirety, includes an illustrative set of the JAVA virtual machine instructions. The particular set of virtual machine instructions utilized is not an essential aspect of this invention. In view of the virtual machine instructions in Appendix I and this disclosure, those of skill in the art can modify the invention for a particular set of virtual machine instructions, or for changes to the JAVA virtual machine specification. A JAVA compiler JAVAC, (Fig. 2) that is executing on a computer platform, converts an application 201 written in the JAVA computer language to an architecture neutral object file format encoding a compiled instruction sequence 203, according to the JAVA Virtual Machine Specification, that includes a compiled instruction set. However, for this invention, only a source of virtual machine instructions and related information is needed. The method or technique used to generate the source of virtual machine instructions and related information is not essential to this invention. Compiled instruction sequence 203 is executable on hardware processor 100 as well as on any computer platform that implements the JAVA virtual machine using, for example, a software interpreter or just-in- time compiler. However, as described above, hardware processor 100 provides significant performance advantages over the software implementations . In this embodiment, hardware processor 100 (Fig. 1) processes the JAVA virtual machine instructions, which include bytecodes. Hardware processor 100, as explained more completely below, executes directly most of the bytecodes. However, execution of some of the bytecodes is implemented via microcode. One strategy for selecting virtual machine instructions that are executed directly by hardware processor 100 is described herein by way of an example. Thirty percent of the JAVA virtual machine instructions are pure hardware translations; instructions implemented in this manner include constant loading and simple stack operations. The next 50% of the virtual machine instructions are implemented mostly, but not entirely, in hardware and require some firmware assistance; these include stack based operations and array instructions. The next 10% of the JAVA virtual machine instructions are implemented in hardware, but require significant firmware support as well; these include function invocation and function return. The remaining 10% of the JAVA virtual machine instructions are not supported in hardware, but rather are supported by a firmware trap and/or microcode; these include functions such as exception handlers. Herein, firmware means microcode stored in ROM that when executed controls the operations of hardware processor 100. In one embodiment, hardware processor 100 includes an I/O bus and memory interface unit 110, an instruction cache unit 120 including instruction cache 125, an instruction decode unit 130, a unified execution unit 140, a stack management unit 150 including stack cache 155, a data cache unit 160 including a data cache 165, and program counter and trap control logic 170. Each of these units is described more completely below. Also, as illustrated in Figure 1, each unit includes several elements . For clarity and to avoid distracting from the invention, the interconnections between elements within a unit are not shown in Figure 1. However, in view of the following description, those of skill in the art will understand the interconnections and cooperation between the elements in a unit and between the various units. The pipeline stages implemented using the units illustrated in Figure 1 include fetch, decode, execute, and write-back stages. If desired, extra stages for memory access or exception resolution are provided in hardware processor 100. Figure 3 is an illustration of a four stage pipeline for execution of instructions in the exemplary embodiment of processor 100. In fetch stage 301, a virtual machine instruction is fetched and placed in instruction buffer 124 (Fig. 1) . The virtual machine instruction is fetched from one of (i) a fixed size cache line from instruction cache 125 or (ii) external memory. With regard to fetching, aside from instructions tableswitch and lookupswitch, (See Appendix I.) each virtual machine instruction is between one and five bytes long. Thus, to keep things simple, at least forty bits are required to guarantee that all of a given instruction is contained in the fetch. Another alternative is to always fetch a predetermined number of bytes, for example, four bytes, starting with the opcode. This is sufficient for 95% of JAVA virtual machine instructions (See Appendix I) . For an instruction requiring more than three bytes of operands, another cycle in the front end must be tolerated if four bytes are fetched. In this case, the instruction execution can be started with the first operands fetched even if the full set of operands is not yet available. In decode stage 302 (Fig. 3) , the virtual machine instruction at the front of instruction buffer 124 (Fig. 1) is decoded and instruction folding is performed if possible. Stack cache 155 is accessed only if needed by the virtual machine instruction. Register OPTOP, that contains a pointer OPTOP to a top of a stack 400 (Fig. 4) , is also updated in decode stage 302 (Fig. 3) . Herein, for convenience, the value in a register and the register are assigned the same reference numeral. Further, in the following discussion, use of a register to store a pointer is illustrative only of one embodiment . Depending on the specific implementation of the invention, the pointer may be implemented using hardware register, a hardware counter, a software counter, a software pointer, or other equivalent embodiments known to those of skill in the art. The particular implementation selected is not essential to the invention, and typically is made based on a price to performance trade-off. In execute stage 303, the virtual machine instruction is executed for one or more cycles. Typically, in execute stage 303, an ALU in integer unit 142 (Fig. 1) is used either to do an arithmetic computation or to calculate the address of a load or store from data cache unit (DCU) 160. If necessary, traps are prioritized and taken at the end of execute stage 303 (Fig. 3) . For control flow instructions, the branch address is calculated in execute stage 303, as well as the condition upon which the branch is dependent . Cache stage 304 is a non-pipelined stage. Data cache 165 (Fig. 1) is accessed if needed during execution stage 303 (Fig. 3) . The reason that stage 304 is non-pipelined is because hardware processor 100 is a stack-based machine. Thus, the instruction following a load is almost always dependent on the value returned by the load. Consequently, in this embodiment, the pipeline is held for one cycle for a data cache access. This reduces the pipeline stages, and the die area taken by the pipeline for the extra registers and bypasses. Write-back stage 305 is the last stage in the pipeline. In stage 305, the calculated data is written back to stack cache 155. Hardware processor 100, in this embodiment, directly implements a stack 400 (Fig. 4A) that supports the JAVA virtual machine stack-based architecture (See Appendix I) . Sixty-four entries on stack 400 are contained on stack cache 155 in stack management unit 150. Some entries in stack 400 may be duplicated on stack cache 150. Operations on data are performed through stack cache 155. Stack 400 of hardware processor 100 is primarily used as a repository of information for methods. At any point in time, hardware processor 100 is executing a single method. Each method has memory space, i.e., a method frame on stack 400, allocated for a set of local variables, an operand stack, and an execution environment structure. A new method frame, e.g., method frame two 410, is allocated by hardware processor 100 upon a method invocation in execution stage 303 (Fig. 3) and becomes the current frame, i.e., the frame of the current method. Current frame 410 (Fig. 4A) , as well as the other method frames, may contain a part of or all of the following six entities, depending on various method invoking situations: Object reference; Incoming arguments; Local variables; Invoker's method context; Operand stack; and Return value from method. In Figure 4A, object reference, incoming arguments, and local variables are included in arguments and local variables area 421. The invoker's method context is included in execution environment 422, sometimes called frame state, that in turn includes: a return program counter value 431 that is the address of the virtual machine instruction, e.g., JAVA opcode, next to the method invoke instruction; a return frame 432 that is the location of the calling method's frame; a return constant pool pointer 433 that is a pointer to the calling method's constant pool table; a current method vector 434 that is the base address of the current method's vector table; and a current monitor address 435 that is the address of the current method's monitor. The object reference is an indirect pointer to an object-storage representing the object being targeted for the method invocation. JAVA compiler JAVAC (See Fig. 2.) generates an instruction to push this pointer onto operand stack 423 prior to generating an invoke instruction. This object reference is accessible as local variable zero during the execution of the method. This indirect pointer is not available for a static method invocation as there is no target-object defined for a static method invocation. The list of incoming arguments transfers information from the calling method to the invoked method. Like the object reference, the incoming arguments are pushed onto stack 400 by JAVA compiler generated instructions and may be accessed as local variables. JAVA compiler JAVAC (See Fig. 2.) statically generates a list of arguments for current method 410 (Fig. 4A) , and hardware processor 100 determines the number of arguments from the list. When the object reference is present in the frame for a non-static method invocation, the first argument is accessible as local variable one. For a static method invocation, the first argument becomes local variable zero. For 64-bit arguments, as well as 64-bit entities in general,, the upper 32-bits, i.e., the 32 most significant bits, of a 64-bit entity are placed on the upper location of stack 400, i.e., pushed on the stack last. For example, when a 64-bit entity is on the top of stack 400, the upper 32-bit portion of the 64-bit entity is on the top of the stack, and the lower 32-bit portion of the 64-bit entity is in the storage location immediately adjacent to the top of stack 400. The local variable area on stack 400 (Fig. 4A) for current method 410 represents temporary variable storage space which is allocated and remains effective during invocation of method 410. JAVA compiler JAVAC (Fig. 2) statically determines the required number of local variables and hardware processor 100 allocates temporary variable storage space accordingly. When a method is executing on hardware processor 100, the local variables typically reside in stack cache 155 and are addressed as offsets from pointer VARS (Figs. 1 and 4A) , which points to the position of the local variable zero. Instructions are provided to load the values of local variables onto operand stack 423 and store values from operand stack into local variables area 421. The information in execution environment 422 includes the invoker's method context. When a new frame is built for the current method, hardware processor 100 pushes the invoker's method context onto newly allocated frame 410, and later utilizes the information to restore the invoker's method context before returning. Pointer FRAME (Figs. 1 and 4A) is a pointer to the execution environment of the current method. In the exemplary embodiment, each register in register set 144 (Fig. 1) is 32-bits wide. Operand stack 423 is allocated to support the execution of the virtual machine instructions within the current method. Program counter register PC (Fig. 1) contains the address of the next instruction, e.g., opcode, to be executed. Locations on operand stack 423 (Fig. 4A) are used to store the operands of virtual machine instructions, providing both source and target storage locations for instruction execution. The size of operand stack 423 is statically determined by JAVA compiler JAVAC (Fig. 2) and hardware processor 100 allocates space for operand stack 423 accordingly. Register OPTOP (Figs. 1 and 4A) holds a pointer to a top of operand stack 423. The invoked method may return its execution result onto the invoker's top of stack, so that the invoker can access the return value with operand stack references. The return value is placed on the area where an object reference or an argument is pushed before a method invocation. Simulation results on the JAVA virtual machine indicate that method invocation consumes a significant portion of the execution time (20-40%) . Given this attractive target for accelerating execution of virtual machine instructions, hardware support for method invocation is included in hardware processor 100, as described more completely below. The beginning of the stack frame of a newly invoked method, i.e., the object reference and the arguments passed by the caller, are already stored on stack 400 since the object reference and the incoming arguments come from the top of the stack of the caller. As explained above, following these items on stack 400, the local variables are loaded and then the execution environment is loaded. One way to speed up this process is for hardware processor 100 to load the needed local variables and execution environment in the background and indicate what has been loaded so far, e.g., simple one bit scoreboarding. Hardware processor 100 tries to execute the bytecodes of the called method as soon as possible, even though stack 400 is not completely loaded. If accesses are made to variables already loaded, overlapping of execution with loading of stack 400 is achieved, otherwise a hardware interlock occurs and hardware processor 100 just waits for the variable or variables to be loaded. Figure 4B illustrates another way to accelerate method invocation. Instead of storing the entire method frame in stack 400, the execution environment of each method frame is stored separately from the local variable area and the operand stack of the method frame. Thus, in this embodiment, stack 400B contains modified method frames, e.g. modified method frame 410B having only local variable area 421 and operand stack 423. Execution environment 422 of the method frame is stored in an execution environment memory 440. Storing the execution environment in execution environment memory 440 reduces the amount of data in stack cache 155. Therefore, the size of stack cache 155 can be reduced. Furthermore, execution environment memory 440 and stack cache 155 can be accessed simultaneously. Thus, method invocation can be accelerated by loading or storing the execution environment in parallel with loading or storing data onto stack 400B. In one embodiment of stack management unit 150, the memory architecture of execution environment memory 440 is also a stack. As modified method frames are pushed onto stack 400b through stack cache 155, corresponding execution environments are pushed onto execution environment memory 440. For example, since modified method frames 0 to 2 , as shown in Figure 4B, are in stack 400B, execution environments (EE) 0 to 2, respectively, are stored in execution environment memory circuit 440. To further enhance method invocation, an execution environment cache can be added to improve the speed of saving and retrieving the execution environment during method invocation. The architecture described more completely below for stack cache 155, dribbler manager unit 151, and stack control unit 152 for caching stack 400, can also be applied to caching execution environment memory 440. Figure 4C illustrates an embodiment of stack management unit 150 modified to support both stack 400b and execution environment memory 440. Specifically, the embodiment of stack management unit 150 in Figure 4C adds an execution environment stack cache 450, an execution environment dribble manager unit 460, and an execution environment stack control unit 470. Typically, execution dribble manager unit 460 transfers an entire execution environment between execution environment cache 450 and execution environment memory 440 during a spill operation or a fill operation. I/O Bus and Memory Interface Unit I/O bus and memory interface unit 110 (Fig. 1) , sometimes called interface unit 110, implements an interface between hardware processor 100 and a memory hierarchy which in an exemplary embodiment includes external memory and may optionally include memory storage and/or interfaces on the same die as hardware processor 100. In this embodiment, I/O controller 111 interfaces with external I/O devices and memory controller 112 interfaces with external memory. Herein, external memory means memory external to hardware processor 100. However, external memory either may be included on the same die as hardware processor 100, may be external to the die containing hardware processor 100, or may include both on- and off-die portions. In another embodiment, requests to I/O devices go through memory controller 112 which maintains an address map of the entire system including hardware processor 100. On the memory bus of this embodiment, hardware processor 100 is the only master and does not have to arbitrate to use the memory bus. Hence, alternatives for the input/output bus that interfaces with I/O bus and memory interface unit 110 include supporting memory-mapped schemes, providing direct support for PCI, PCMCIA, or other standard busses . Fast graphics (w/ VIS or other technology) may optionally be included on the die with hardware processor 100. I/O bus and memory interface unit 110 generates read and write requests to external memory. Specifically, interface unit 110 provides an interface for instruction cache and data cache controllers 121 and 161 to the external memory. Interface unit 110 includes arbitration logic for internal requests from instruction cache controller 121 and data cache controller 161 to access external memory and in response to a request initiates either a read or a write request on the memory bus to the external memory. A request from data cache controller 121 is always treated as higher priority relative to a request from instruction cache controller 161. Interface unit 110 provides an acknowledgment signal to the requesting instruction cache controller 121, or data cache controller 161 on read cycles so that the requesting controller can latch the data. On write cycles, the acknowledgment signal from interface unit 110 is used for flow control so that the requesting instruction cache controller 121 or data cache controller 161 does not generate a new request when there is one pending. Interface unit 110 also handles errors generated on the memory bus to the external memory. Instruction Cache Unit Instruction cache unit (ICU) 120 (Fig. 1) fetches virtual machine instructions from instruction cache 125 and provides the instructions to instruction decode unit 130. In this embodiment, upon a instruction cache hit, instruction cache controller 121, in one cycle, transfers an instruction from instruction cache 125 to instruction buffer 124 where the instruction is held until integer execution unit IEU, that is described more completely below, is ready to process the instruction. This separates the rest of pipeline 300 (Fig. 3) in hardware processor 100 from fetch stage 301. If it is undesirable to incur the complexity of supporting an instruction-buffer type of arrangement, a temporary one instruction register is sufficient for most purposes. However, instruction fetching, caching, and buffering should provide sufficient instruction bandwidth to support instruction folding as described below. The front end of hardware processor 100 is largely separate from the rest of hardware processor 100. Ideally, one instruction per cycle is delivered to the execution pipeline. The instructions are aligned on an arbitrary eight-bit boundary by byte aligner circuit 122 in response to a signal from instruction decode unit 130. Thus, the front end of hardware processor 100 efficiently deals with fetching from any byte position. Also, hardware processor 100 deals with the problems of instructions that span multiple cache lines of cache 125. In this case, since the opcode is the first bytecode, the design is able to tolerate an extra cycle of fetch latency for the operands. Thus, a very simple de-coupling between the fetching and execution of the bytecodes is possible. In case of an instruction cache miss, instruction cache controller 121 generates an external memory request for the missed instruction to I/O bus and memory interface unit 110. If instruction buffer 124 is empty, or nearly empty, when there is an instruction cache miss, instruction decode unit 130 is stalled, i.e., pipeline 300 is stalled. Specifically, instruction cache controller 121 generates a stall signal upon a cache miss which is used along with an instruction buffer empty signal to determine whether to stall pipeline 300. Instruction cache 125 can be invalidated to accommodate self-modifying code, e.g., instruction cache controller 121 can invalidate a particular line in instruction cache 125. Thus, instruction cache controller 121 determines the next instruction to be fetched, i.e., which instruction in instruction cache 125 needs to accessed, and generates address, data and control signals for data and tag RAMs in instruction cache 125. On a cache hit, four bytes of data are fetched from instruction cache 125 in a single cycle, and a maximum of four bytes can be written into instruction buffer 124. Byte aligner circuit 122 aligns the data out of the instruction cache RAM and feeds the aligned data to instruction buffer 124. As explained more completely below, the first two bytes in instruction buffer 124 are decoded to determine the length of the virtual machine instruction. Instruction buffer 124 tracks the valid instructions in the queue and updates the entries, as explained more completely below. Instruction cache controller 121 also provides the data path and control for handling instruction cache misses. On an instruction cache miss, instruction cache controller 121 generates a cache fill request to I/O bus and memory interface unit 110. On receiving data from external memory, instruction cache controller 121 writes the data into instruction cache 125 and the data are also bypassed into instruction buffer 124. Data are bypassed to instruction buffer 124 as soon as the data are available from external memory, and before the completion of the cache fill. Instruction cache controller 121 continues fetching sequential data until instruction buffer 124 is full or a branch or trap has taken place. In one embodiment, instruction buffer 124 is considered full if there are more than eight bytes of valid entries in buffer 124. Thus, typically, eight bytes of data are written into instruction cache 125 from external memory in response to the cache fill request sent to interface unit 110 by instruction cache unit 120. If there is a branch or trap taken while processing an instruction cache miss, only after the completion of the miss processing is the trap or branch executed. When an error is generated during an instruction cache fill transaction, a fault indication is generated and stored into instruction buffer 124 along with the virtual machine instruction, i.e., a fault bit is set. The line is not written into instruction cache 125. Thus, the erroneous cache fill transaction acts like a non-cacheable transaction except that a fault bit is set. When the instruction is decoded, a trap is taken. Instruction cache controller 121 also services non-cacheable instruction reads. An instruction cache enable (ICE) bit, in a processor status register in register set 144, is used to define whether a load can be cached. If the instruction cache enable bit is cleared, instruction cache unit 120 treats all loads as non-cacheable loads. Instruction cache controller 121 issues a non-cacheable request to interface unit 110 for non-cacheable instructions. When the data are available on a cache fill bus for the non-cacheable instruction, the data are bypassed into instruction buffer 124 and are not written into instruction cache 125. In this embodiment, instruction cache 125 is a direct-mapped, eight-byte line size cache. Instruction cache 125 has a single cycle latency. The cache size is configurable to OK, IK, 2K, 4K, 8K and 16K byte sizes where K means kilo. The default size is 4K bytes. Each line has a cache tag entry associated with the line. Each cache tag contains a twenty bit address tag field and one valid bit for the default 4K byte size. Instruction buffer 124, which, in an exemplary embodiment, is a twelve-byte deep first-in, first-out (FIFO) buffer, de-links fetch stage 301 (Fig. 3) from the rest of pipeline 300 for performance reasons. Each instruction in buffer 124 (Fig. 1) has an associated valid bit and an error bit. When the valid bit is set, the instruction associated with that valid bit is a valid instruction. When the error bit is set, the fetch of the instruction associated with that error bit was an erroneous transaction. Instruction buffer 124 includes an instruction buffer control circuit (not shown) that generates signals to pass data to and from instruction buffer 124 and that keeps track of the valid entries in instruction buffer 124, i.e., those with valid bits set . In an exemplary embodiment, four bytes can be received into instruction buffer 124 in a given cycle. Up to five bytes, representing up to two virtual machine instructions, can be read out of instruction buffer 124 in a given cycle. Alternative embodiments, particularly those providing folding of multi-byte virtual machine instructions and/or those providing folding of more than two virtual machine instructions, provide higher input and output bandwidth. Persons of ordinary skill in the art will recognize a variety of suitable instruction buffer designs including, for example, alignment logic, circular buffer design, etc. When a branch or trap is taken, all the entries in instruction buffer 124 are nullified and the branch/trap data moves to the top of instruction buffer 124. In the embodiment of Figure 1, a unified execution unit 140 is shown. However, in another embodiment, instruction decode unit 120, integer unit 142, and stack management unit 150 are considered a single integer execution unit, and floating point execution unit 143 is a separate optional unit. In still other embodiments, the various elements in the execution unit may be implemented using the execution unit of another processor. In general the various elements included in the various units of Figure 1 are exemplary only of one embodiment. Each unit could be implemented with all or some of the elements shown. Again, the decision is largely dependent upon a price vs. performance trade- off. Instruction Decode Unit As explained above, virtual machine instructions are decoded in decode stage 302 (Fig. 3) of pipeline 300. In an exemplary embodiment, two bytes, that can correspond to two virtual machine instructions, are fetched from instruction buffer 124 (Fig. 1) . The two bytes are decoded in parallel to determine if the two bytes correspond to two virtual machine instructions, e.g., a first load top of stack instruction and a second add top two stack entries instruction, that can be folded into a single equivalent operation. Folding refers to supplying a single equivalent operation corresponding to two or more virtual machine instructions. In an exemplary hardware processor 100 embodiment, a single-byte first instruction can be folded with a second instruction. However, alternative embodiments provide folding of more than two virtual machine instructions, e.g., two to four virtual machine instructions, and of multi-byte virtual machine instructions, though at the cost of instruction decoder complexity and increased instruction bandwidth. See U.S. Patent Application Serial No. 08/xxx,xxx, entitled "INSTRUCTION FOLDING FOR A STACK-BASED MACHINE" naming Marc Tremblay and James Michael O'Connor as inventors, assigned to the assignee of this application, and filed on even date herewith with Attorney Docket No. SP2036, which is incorporated herein by reference in its entirety. In the exemplary processor 100 embodiment, if the first byte, which corresponds to the first virtual machine instruction, is a multi-byte instruction, the first and second instructions are not folded. An optional current object loader folder 132 exploits instruction folding, such as that described above, and in greater detail in U.S. Patent Application Serial No. 08/xxx,xxx, entitled "INSTRUCTION FOLDING FOR A STACK-BASED MACHINE" naming Marc Tremblay and James Michael O'Connor as inventors, assigned to the assignee of this application, and filed on even date herewith with Attorney Docket No. SP2036, which is incorporated herein by reference in its entirety, in virtual machine instruction sequences which simulation results have shown to be particularly frequent and therefore a desirable target for optimization. In particular, method invocations typically load an object reference for the corresponding object onto the operand stack and fetch a field from the object. Instruction folding allow this extremely common virtual machine instruction sequence to be executed using an equivalent folded operation. Quick variants are not part of the virtual machine instruction set (See Chapter 3 of Appendix I) , and are invisible outside of a JAVA virtual machine implementation. However, inside a virtual machine implementation, quick variants have proven to be an effective optimization. (See Appendix A in Appendix I; which is an integral part of this specification.) Supporting writes for updates of various instructions to quick variants in a non-quick to quick translator cache 131 changes the normal virtual machine instruction to a quick virtual machine instruction to take advantage of the large benefits bought from the quick variants. In particular, as described in more detail in U.S. Patent Application Serial No. 08/xxx,xxx, entitled "NON-QUICK INSTRUCTION ACCELERATOR AND METHOD OF IMPLEMENTING SAME" naming Marc Tremblay and James Michael O'Connor as inventors, assigned to the assignee of this application, and filed on even date herewith with Attorney Docket No. SP2039, which is incorporated herein by reference in its entirety, when the information required to initiate execution of an instruction has been assembled for the first time, the information is stored in a cache along with the value of program counter PC as tag in non-quick to quick translator cache 131 and the instruction is identified as a quick-variant. In one embodiment, this is done with self-modifying code. Upon a subsequent call of that instruction, instruction decode unit 130 detects that the instruction is identified as a quick-variant and simply retrieves the information needed to initiate execution of the instruction from non-quick to quick translator cache 131. Non-quick to quick translator cache is an optional feature of hardware processor 100. With regard to branching, a very short pipe with quick branch resolution is sufficient for most implementations. However, an appropriate simple branch prediction mechanism can alternatively be introduced, e.g., branch predictor circuit 133. Implementations for branch predictor circuit 133 include branching based on opcode, branching based on offset, or branching based on a two-bit counter mechanism. The JAVA virtual machine specification defines an instruction invokβnonvirtual, opcode 183, which, upon execution, invokes methods. The opcode is followed by an index byte one and an index byte two. (See Appendix I. ) Operand stack 423 contains a reference to an object and some number of arguments when this instruction is executed. Index bytes one and two are used to generate an index into the constant pool of the current class. The item in the constant pool at that index points to a complete method signature and class. Signatures are defined in Appendix I and that description is incorporated herein by reference. The method signature, a short, unique identifier for each method, is looked up in a method table of the class indicated. The result of the lookup is a method block that indicates the type of method and the number of arguments for the method. The object reference and arguments are popped off this method's stack and become initial values of the local variables of the new method. The execution then resumes with the first instruction of the new method. Upon execution, instructions invokevirtual, opcode 182, and invokestatic, opcode 184, invoke processes similar to that just described. In each case, a pointer is used to lookup a method block. A method argument cache 134, that also is an optional feature of hardware processor 100, is used, in a first embodiment, to store the method block of a method for use after the first call to the method, along with the pointer to the method block as a tag. Instruction decode unit 130 uses index bytes one and two to generate the pointer and then uses the pointer to retrieve the method block for that pointer in cache 134. This permits building the stack frame for the newly invoked method more rapidly in the background in subsequent invocations of the method. Alternative embodiments may use a program counter or method identifier as a reference into cache 134. If there is a cache miss, the instruction is executed in the normal fashion and cache 134 is updated accordingly. The particular process used to determine which cache entry is overwritten is not an essential aspect of this invention. A least-recently used criterion could be implemented, for example. In an alternative embodiment, method argument cache 134 is used to store the pointer to the method block, for use after the first call to the method, along with the value of program counter PC of the method as a tag. Instruction decode unit 130 uses the value of program counter PC to access cache 134. If the value of program counter PC is equal to one of the tags in cache 134, cache 134 supplies the pointer stored with that tag to instruction decode unit 130. Instruction decode unit 139 uses the supplied pointer to retrieve the method block for the method. In view of these two embodiments, other alternative embodiments will be apparent to those of skill in the art. Wide index forwarder 136, which is an optional element of hardware processor 100, is a specific embodiment of instruction folding for instruction wide. Wide index forwarder 136 handles an opcode encoding an extension of an index operand for an immediately subsequent virtual machine instruction. In this way, wide index forwarder 136 allows instruction decode unit 130 to provide indices into local variable storage 421 when the number of local variables exceeds that addressable with a single byte index without incurring a separate execution cycle for instruction wide. Aspects of instruction decoder 135, particularly instruction folding, non-quick to quick translator cache 131, current object loader folder 132, branch predictor 133, method argument cache 134, and wide index forwarder 136 are also useful in implementations that utilize a software interpreter or just-in-time compiler, since these elements can be used to accelerate the operation of the software interpreter or just-in-time compiler. In such an implementation, typically, the virtual machine instructions are translated to an instruction for the processor executing the interpreter or compiler, e.g., any one of a Sun processor, a DEC processor, an Intel processor, or a Motorola processor, for example, and the operation of the elements is modified to support execution on that processor. The translation from the virtual machine instruction to the other processor instruction can be done either with a translator in a ROM or a simple software translator. For additional examples of dual instruction set processors, see U.S. Patent Application Serial No. 08/xxx,xxx, entitled "A PROCESSOR FOR EXECUTING INSTRUCTION SETS RECEIVED FROM A NETWORK OR FROM A LOCAL MEMORY" naming Marc Tremblay and James Michael O'Connor as inventors, assigned to the assignee of this application, and filed on even date herewith with Attorney Docket No. SP2042, which is incorporated herein by reference in its entirety Integer Execution Unit Integer execution unit IEU, that includes instruction decode unit 130, integer unit 142, and stack management unit 150, is responsible for the execution of all the virtual machine instructions except the floating point related instructions. The floating point related instructions are executed in floating point unit 143. Integer execution unit IEU interacts at the front end with instructions cache unit 120 to fetch instructions, with floating point unit (FPU) 143 to execute floating point instructions, and finally with data cache unit (DCU) 160 to execute load and store related instructions. Integer execution unit IEU also contains microcode ROM 149 which contains instructions to execute certain virtual machine instructions associated with integer operations. Integer execution unit IEU includes a cached portion of stack 400, i.e., stack cache 155. Stack cache 155 provides fast storage for operand stack and local variable entries associated with a current method, e.g., operand stack 423 and local variable storage 421 entries. Although, stack cache 155 may provide sufficient storage for all operand stack and local variable entries associated with a current method, depending on the number of operand stack and local variable entries, less than all of local variable entries or less than all of both local variable entries and operand stack entries may be represented in stack cache 155. Similarly, additional entries, e.g., operand stack and or local variable entries for a calling method, may be represented in stack cache 155 if space allows. Stack cache 155 is a sixty-four entry thirty-two- bit wide array of registers that is physically implemented as a register file in one embodiment. Stack cache 155 has three read ports, two of which are dedicated to integer execution unit IEU and one to dribble manager unit 151. Stack cache 155 also has two write ports, one dedicated to integer execution unit IEU and one to dribble manager unit 151. Integer unit 142 maintains the various pointers which are used to access variables, such as local variables, and operand stack values, in stack cache 155. Integer unit 142 also maintains pointers to detect whether a stack cache hit has taken place . Runtime exceptions are caught and dealt with by exception handlers that are implemented using information in microcode ROM 149 and circuit 170. Integer unit 142 contains a 32-bit ALU to support arithmetic operations. The operations supported by the ALU include: add, subtract, shift, and, or, exclusive or, compare, greater than, less than, and bypass. The ALU is also used to determine the address of conditional branches while a separate comparator determines the outcome of the branch instruction. The most common set of instructions which executes cleanly through the pipeline is the group of ALU instructions. The ALU instructions read the operands from the top of stack 400 in decode stage 302 and use the ALU in execution stage 303 to compute the result. The result is written back to stack 400 in write-back stage 305.. There are two levels of bypass which may be needed if consecutive ALU operations are accessing stack cache 155. Since the stack cache ports are 32-bits wide in this embodiment, double precision and long data operations take two cycles. A shifter is also present as part of the ALU. If the operands are not available for the instruction in decode stage 302, or at a maximum at the beginning of execution stage 303, an interlock holds the pipeline stages before execution stage 303. The instruction cache unit interface of integer execution unit IEU is a valid/accept interface, where instruction cache unit 120 delivers instructions to integer decode unit 130 in fixed fields along with valid bits. Instruction decoder 135 responds by signaling how much byte aligner circuit 122 needs to shift, or how many bytes instruction decode unit 130 could consume in decode stage 302. The instruction cache unit interface also signals to instruction cache unit 120 the branch mis-predict condition, and the branch address in execution stage 303. Traps, when taken, are also similarly indicated to instruction cache unit 120. Instruction cache unit 120 can hold integer unit 142 by not asserting any of the valid bits to instruction decode unit 130. Instruction decode unit 130 can hold instruction cache unit 120 by not asserting the shift signal to byte aligner circuit 122. The data cache interface of integer execution unit IEU also is a valid-accept interface, where integer unit 142 signals, in execution stage 303, a load or store operation along with its attributes, e.g., non-cached, special stores etc., to data cache controller 161 in data cache unit 160. Data cache unit 160 can return the data on a load, and control integer unit 142 using a data control unit hold signal. On a data cache hit, data cache unit 160 returns the requested data, and then releases the pipeline. On store operations, integer unit 142 also supplies the data along with the address in execution stage 303. Data cache unit 165 can hold the pipeline in cache stage 304 if data cache unit 165 is busy, e.g., doing a line fill etc. Floating point operations are dealt with specially by integer execution unit IEU. Instruction decoder 135 fetches and decodes floating point unit 143 related instructions. Instruction decoder 135 sends the floating point operation operands for execution to floating point unit 142 in decode state 302. While floating point unit 143 is busy executing the floating point operation, integer unit 142 halts the pipeline and waits until floating point unit 143 signals to integer unit 142 that the result is available. A floating point ready signal from floating point unit 143 indicates that execution stage 303 of the floating point operation has concluded. In response to the floating point ready signal, the result is written back into stack cache 155 by integer unit 142. Floating point load and stores are entirely handled by integer execution unit IEU, since the operands for both floating point unit 143 and integer unit 142 are found in stack cache 155. Stack Management Unit A stack management unit 150 stores information, and provides operands to execution unit 140. Stack management unit 150 also takes care of overflow and underflow conditions of stack cache 155. In one embodiment, stack management unit 150 includes stack cache 155 that, as described above, is a three read port, two write port register file in one embodiment; a stack control unit 152 which provides the necessary control signals for two read ports and one write port that are used to retrieve operands for execution unit 140 and for storing data back from a write-back register or data cache 165 into stack cache 155; and a dribble manager 151 which speculatively dribbles data in and out of stack cache 155 into memory whenever there is an overflow or underflow in stack cache 155. In the exemplary embodiment of Figure 1, memory includes data cache 165 and any memory storage interfaced by memory interface unit 110. In general, memory includes any suitable memory hierarchy including caches, addressable read/write memory storage, secondary storage, etc. Dribble manager 151 also provides the necessary control signals for a single read port and a single write port of stack cache 155 which are used exclusively for background dribbling purposes. In one embodiment, stack cache 155 is managed as a circular buffer which ensures that the stack grows and shrinks in a predictable manner to avoid overflows or overwrites . The saving and restoring of values to and from data cache 165 is controlled by dribbler manager 151 using high- and low-water marks, in one embodiment. Stack management unit 150 provides execution unit 140 with two 32-bit operands in a given cycle. Stack management unit 150 can store a single 32-bit result in a given cycle. Dribble manager 151 handles spills and fills of stack cache 155 by speculatively dribbling the data in and out of stack cache 155 from and to data cache 165. Dribble manager 151 generates a pipeline stall signal to stall the pipeline when a stack overflow or underflow condition is detected. Dribble manager 151 also keeps track of requests sent to data cache unit 160. A single request to data cache unit 160 is a 32-bit consecutive load or store request. The hardware organization of stack cache 155 is such that, except for long operands (long integers and double precision floating-point numbers) , implicit operand fetches for opcodes do not add latency to the execution of the opcodes. The number of entries in operand stack 423 (Fig. 4A) and local variable storage 422 that are maintained in stack cache 155 represents a hardware/performance tradeoff . At least a few operand stack 423 and local variable storage 422 entries are required to get good performance. In the exemplary embodiment of Figure 1, at least the top three entries of operand stack 423 and the first four local variable storage 422 entries are preferably represented in stack cache 155. One key function provided by stack cache 155 (Fig.l) is to emulate a register file where access to the top two registers is always possible without extra cycles. A small hardware stack is sufficient if the proper intelligence is provided to load/store values from/to memory in the background, therefore preparing stack cache 155 for incoming virtual machine instructions. As indicated above, all items on stack 400 (regardless of size) are placed into a 32-bit word. This tends to waste space if many small data items are used, but it also keeps things relatively simple and free of lots of tagging or muxing. An entry in stack 400 thus represents a value and not a number of bytes. Long integer and double precision floating¬ point numbers require two entries. To keep the number of read and write ports low, two cycles to read two long integers or two double precision floating point numbers are required. The mechanism for filling and spilling the operand stack from stack cache 155 out to memory by dribble manager 151 can assume one of several alternative forms. One register at a time can be filled or spilled, or a block of several registers filled or spilled at once. A simple scoreboarded method is appropriate for stack management . In its simplest form, a single bit indicates if the register in stack cache 155 is currently valid. In addition, some embodiments of stack cache 155 use a single bit to indicate whether the data content of the register is saved to stack 400, i.e., whether the register is dirty. In one embodiment, a high-water mark/low-water mark heuristic determines when entries are saved to and restored from stack 400, respectively (Fig. 4A) . Alternatively, when the top-of-the-stack becomes close to bottom 401 of stack cache 155 by a fixed, or alternatively, a programmable number of entries, the hardware starts loading registers from stack 400 into stack cache 155. For other embodiments of stack management unit 150 and dribble manager unit 151 see U.S. Patent Application Serial No. 08/xxx,xxx, entitled "METHODS AND APPARATI FOR STACK CACHING" naming Marc Tremblay and James Michael O'Connor as inventors, assigned to the assignee of this application, and filed on even date herewith with Attorney Docket No. SP2037, which is incorporated herein by reference in its entirety, and see also U.S. Patent Application Serial No. 08/xxx,xxx, entitled "STACK CACHING USING MULTIPLE MEMORY CIRCUITS" naming Marc Tremblay and James Michael O'Connor as inventors, assigned to the assignee of this application, and filed on even date herewith with Attorney Docket No. SP2038, which also is incorporated herein by reference in its entirety. In one embodiment, stack management unit 150 also includes an optional local variable look-aside cache 153. Cache 153 is most important in applications where both the local variables and operand stack 423 (Fig. 4A) for a method are not located on stack cache 155. In such instances when cache 153 is not included in hardware processor 100, there is a miss on stack cache 155 when a local variable is accessed, and execution unit 140 accesses data cache unit 160, which in turn slows down execution. In contrast, with cache 153, the local variable is retrieved from cache 153 and there is no delay in execution. One embodiment of local variable look-aside cache 153 is illustrated in Figure 4D for method 0 to 2 on stack 400. Local variables zero to M, where M is an integer, for method 0 are stored in plane 421A_0 of cache 153 and plane 421A_0 is accessed when method number 402 is zero. Local variables zero to N, where N is an integer, for method 1 are stored in plane 421A_1 of cache 153 and plane 421A_1 is accessed when method number 402 is one. Local variables zero to P, where P is an integer, for method 1 are stored in plane 421A_2 of cache 153 and plane 421A_2 is accessed when method number 402 is two. Notice that the various planes of cache 153 may be different sizes. When a new method is invoked, e.g, method 2, a new plane 421A_2 in cache 153 is loaded with the local variables for that method, and method number register 402, which in one embodiment is a counter, is changed, e.g., incremented, to point to the plane of cache 153 containing the local variables for the new method. Notice that the local variables are ordered within a plane of cache 153 so that cache 153 is effectively a direct-mapped cache. Thus, when a local variable is needed for the current method, the variable is accessed directly from the most recent plane in cache 153, i.e., the plane identified by method number 402. When the current method returns, e.g., method 2, method number register 402 is changed, e.g., decremented, to point at previous plane 421A-1 of cache 153. Cache 153 can be made as wide and as deep as necessary. Data Cache Unit Data cache unit 160 (DCU) manages all requests for data in data cache 165. Data cache requests can come from dribbling manager 151 or execution unit 140. Data cache controller 161 arbitrates between these requests giving priority to the execution unit requests. In response to a request, data cache controller 161 generates address, data and control signals for the data and tags RAMs in data cache 165. For a data cache hit, data cache controller 161 reorders the data RAM output to provide the right data. Data cache controller 161 also generates requests to I/O bus and memory interface unit 110 in case of data cache misses, and in case of non-cacheable loads and stores. Data cache controller 161 provides the data path and control logic for processing non¬ cacheable requests, and the data path and data path control functions for handling cache misses. For data cache hits, data cache unit 160 returns data to execution unit 140 in one cycle for loads. Data cache unit 160 also takes one cycle for write hits. In case of a cache miss, data cache unit 160 stalls the pipeline until the requested data is available from the external memory. For both non- cacheable loads and stores, data cache 161 is bypassed and requests are sent to I/O bus and memory interface unit 110. Non-aligned loads and stores to data cache 165 trap in software. Data cache 165 is a two-way set associative, write back, write allocate, 16-byte line cache. The cache size is configurable to 0, 1, 2, 4, 8, 16 Kbyte sizes. The default size is 8 Kbytes. Each line has a cache tag store entry associated with the line. On a cache miss, 16 bytes of data are written into cache 165 from external memory. Each data cache tag contains a 20-bit address tag field, one valid bit, and one dirty bit. Each cache tag is also associated with a least recently used bit that is used for replacement policy. To support multiple cache sizes, the width of the tag fields also can be varied. If a cache enable bit in processor service register is not set, loads and stores are treated like non-cacheable instructions by data cache controller 161. A single sixteen-byte write back buffer is provided for writing back dirty cache lines which need to be replaced. Data cache unit 160 can provide a maximum of four bytes on a read and a maximum of four bytes of data can be written into cache 161 in a single cycle. Diagnostic reads and writes can be done on the caches. Memory Allocation Accelerator In one embodiment, data cache unit 165 includes a memory allocation accelerator 166. Typically, when a new object is created, fields for the object are fetched from external memory, stored in data cache 165 and then the field is cleared to zero. This is a time consuming process that is eliminated by memory allocation accelerator 166. When a new object is created, no fields are retrieved from external memory. Rather, memory allocation accelerator 160 simply stores a line of zeros in data cache 165 and marks that line of data cache 165 as dirty. Memory allocation accelerator 166 is particularly advantageous with a write-back cache. Since memory allocation accelerator 166 eliminates the external memory access each time a new object is created, the performance of hardware processor 100 is enhanced. Floating Point Unit Floating point unit (FPU) 143 includes a microcode sequencer, input/output section with input/output registers, a floating point adder, i.e., an ALU, and a floating point multiply/divide unit. The microcode sequencer controls the microcode flow and microcode branches. The input/output section provides the control for input/output data transactions, and provides the input data loading and output data unloading registers. These registers also provide intermediate result storage. The floating point adder-ALU includes the combinatorial logic used to perform the floating point adds, floating point subtracts, and conversion operations. The floating point multiply/divide unit contains the hardware for performing multiply/divide and remainder. Floating point unit 143 is organized as a microcoded engine with a 32-bit data path. This data path is often reused many times during the computation of the result. Double precision operations require approximately two to four times the number of cycles as single precision operations. The floating point ready signal is asserted one-cycle prior to the completion of a given floating point operation. This allows integer unit 142 to read the floating point unit output registers without any wasted interface cycles. Thus, output data is available for reading one cycle after the floating point ready signal is asserted. Execution Unit Accelerators Since the JAVA Virtual Machine Specification of Appendix I is hardware independent, the virtual machine instructions are not optimized for a particular general type of processor, e.g., a complex instruction set computer (CISC) processor, or a reduced instruction set computer (RISC) processor. In fact, some virtual machine instructions have a CISC nature and others a RISC nature. This dual nature complicates the operation and optimization of hardware processor 100. For example, the JAVA virtual machine specification defines opcode 171 for an instruction lookupswitch, which is a traditional switch statement. The datastream to instruction cache unit 120 includes an opcode 171, identifying the N-way switch statement, that is followed zero to three bytes of padding. The number of bytes of padding is selected so that first operand byte begins at an address that is a multiple of four. Following the padding bytes in the datastream are a series of pairs of signed four-byte quantities. The first pair is special. A first operand in the first pair is the default offset for the switch statement that is used when the argument, referred to as an integer key, or alternatively, a current match value, of the switch statement is not equal to any of the values of the matches in the switch statement. The second operand in the first pair defines the number of pairs that follow in the datastream. Each subsequent operand pair in the datastream has a first operand that is a match value, and a second operand that is an offset. If the integer key is equal to one of the match values, the offset in the pair is added to the address of the switch statement to define the address to which execution branches. Conversely, if the integer key is unequal to any of the match values, the default offset in the first pair is added to the address of the switch statement to define the address to which execution branches. Direct execution of this virtual machine instruction requires many cycles. To enhance the performance of hardware processor 100, a look-up switch accelerator 145 is included in hardware processor 100. Look-up switch accelerator 145 includes an associative memory which stores information associated with one or more lookup switch statements. For each lookup switch statement, i.e., each instruction lookupswitch, this information includes a lookup switch identifier value, i.e., the program counter value associated with the lookup switch statement, a plurality of match values and a corresponding plurality of jump offset values. Lookup switch accelerator 145 determines whether a current instruction received by hardware processor 100 corresponds to a lookup switch statement stored in the associative memory. Lookup switch accelerator 145 further determines whether a current match value associated with the current instruction corresponds with one of the match values stored in the associative memory. Lookup switch accelerator 145 accesses a jump offset value from the associative memory when the current instruction corresponds to a lookup switch statement stored in the memory and the current match value corresponds with one of the match values stored in the memory wherein the accessed jump offset value corresponds with the current match value. Lookup switch accelerator 145 further includes circuitry for retrieving match and jump offset values associated with a current lookup switch statement when the associative memory does not already contain the match and jump offset values associated with the current lookup switch statement. Lookup switch accelerator 145 is described in more detail in U.S. Patent Application Serial No. 08/xxx,xxx, entitled "LOOK-UP SWITCH ACCELERATOR AND METHOD OF OPERATING SAME" naming Marc Tremblay and James Michael O'Connor as inventors, assigned to the assignee of this application, and filed on even date herewith with Attorney Docket No. SP2040, which is incorporated herein by reference in its entirety. In the process of initiating execution of a method of an object, execution unit 140 accesses a method vector to retrieve one of the method pointers in the method vector, i.e., one level of indirection. Execution unit 140 then uses the accessed method pointer to access a corresponding method, i.e., a second level of indirection. To reduce the levels of indirection within execution unit 140, each object is provided with a dedicated copy of each of the methods to be accessed by the object. Execution unit 140 then accesses the methods using a single level of indirection. That is, each method is directly accessed by a pointer which is derived from the object. This eliminates a level of indirection which was previously introduced by the method pointers. By reducing the levels of indirection, the operation of execution unit 140 can be accelerated. The acceleration of execution unit 140 by reducing the levels of indirection experienced by execution unit 140 is described in more detail in U.S. Patent Application Serial No. 08/xxx,xxx, entitled "REPLICATING CODE TO ELIMINATE A LEVEL OF INDIRECTION DURING EXECUTION OF AN OBJECT ORIENTED COMPUTER PROGRAM" naming Marc Tremblay and James Michael O'Connor as inventors, assigned to the assignee of this application, and filed on even date herewith with Attorney Docket No. SP2043, which is incorporated herein by reference in its entirety. Getfield-putfield Accelerator Other specific functional units and various translation lookaside buffer (TLB) types of structures may optionally be included in hardware processor 100 to accelerate accesses to the constant pool. For example, the JAVA virtual machine specification defines an instruction putfield, opcode 181, that upon execution sets a field in an object and an instruction getfield, opcode 180, that upon execution fetches a field from an object. In both of these instructions, the opcode is followed by an index byte one and an index byte two. Operand stack 423 contains a reference to an object followed by a value for instruction putfield, but only a reference to an object for instruction getfield. Index bytes one and two are used to generate an index into the constant pool of the current class. The item in the constant pool at that index is a field reference to a class name and a field name. The item is resolved to a field block pointer which has both the field width, in bytes, and the field offset, in bytes. An optional getfield- putfield accelerator 146 in execution unit 140 stores the field block pointer for instruction getfield or instruction putfield in a cache, for use after the first invocation of the instruction, along with the index used to identify the item in the constant pool that was resolved into the field block pointer as a tag. Subsequently, execution unit 140 uses index bytes one and two to generate the index and supplies the index to getfield-putfield accelerator 146. If the index matches one of the indexes stored as a tag, i.e., there is a hit, the field block pointer associated with that tag is retrieved and used by execution unit 140. Conversely, if a match is not found, execution unit 140 performs the operations described above. Getfield-putfield accelerator 146 is implemented without using self¬ modifying code that was used in one embodiment of the quick instruction translation described above. In one embodiment, getfield-putfield accelerator 146 includes an associative memory that has a first section that holds the indices that function as tags, and a second section that holds the field block pointers. When an index is applied through an input section to the first section of the associative memory, and there is a match with one of the stored indices, the field block pointer associated with the stored index that matched in input index is output from the second section of the associative memory. Bounds Check Unit Bounds check unit 147 (Fig. 1) in execution unit 140 is an optional hardware circuit that checks each access to an element of an array to determine whether the access is to a location within the array. When the access is to a location outside the array, bounds check unit 147 issues an active array bound exception signal to execution unit 140. In response to the active array bound exception signal, execution unit 140 initiates execution of an exception handler stored in microcode ROM 141 that in handles the out of bounds array access. In one embodiment, bounds check unit 147 includes an associative memory element in which is stored a array identifier for an array, e.g., a program counter value, and a maximum value and a minimum value for the array. When an array is accessed, i.e, the array identifier for that array is applied to the associative memory element, and assuming the array is represented in the associative memory element, the stored minimum value is a first input signal to a first comparator element, sometimes called a comparison element, and the stored maximum value is a first input signal to a second comparator element, sometimes also called a comparison element. A second input signal to the first and second comparator elements is the value associated with the access of the array's element. If the value associated with the access of the array's element is less than or equal to the stored maximum value and greater than or equal to the stored minimum value, neither comparator element generates an output signal. However, if either of these conditions is false, the appropriate comparator element generates the active array bound exception signal. A more detailed description of one embodiment of bounds check unit 147 is provided below. The JAVA Virtual Machine Specification defines that certain instructions can cause certain exceptions. The checks for these exception conditions are implemented, and a hardware/software mechanism for dealing with them is provided in hardware processor 100 by information in microcode ROM 149 and program counter and trap control logic 170. The alternatives include having a trap vector style or a single trap target and pushing the trap type on the stack so that the dedicated trap handler routine determines the appropriate action. No external cache is required for the architecture of hardware processor 100. No translation lookaside buffers need be supported. Figure 5 illustrates several possible add-ons to hardware processor 100 to create a unique system. Circuits supporting any of the eight functions shown, i.e., NTSC encoder 501, MPEG 502, Ethernet controller 503, VIS 504, ISDN 505, I/O controller 506, ATM assembly/reassembly 507, and radio link 508 can be integrated into the same chip as hardware processor 100 of this invention. Figure 6A shows a computer system 600 that includes a translation unit 610, an array access processor 612, an associative memory element 614, and an execution unit 616. Translation unit 610 receives software program information 609, e.g., JAVA virtual machine instructions, and translates program information 609 into translated instructions that include array access instructions on bus 611 and array access instruction identifiers on bus 613, each of which corresponds to one of the translated instructions. Each array access instruction references an element within the array. Translation unit 610 can be a ROM that converts virtual machine instructions to native instructions for a particular computer architecture; a software program that converts virtual machine instructions to native instructions for a particular computer architecture; or simply an instruction decoder if no translation of the incoming instructions is required. In one embodiment, translation unit 610 determines which array access instructions will be frequently utilized. For example, utilizing profile feedback, translation unit 610 identifies those array access instructions for which the dynamic execution count is high enough to provide performance benefits by loading these statement identifiers and their corresponding boundaries to an associative memory. In another embodiment, the appropriate array information for each array is stored in the associative memory when the array is created, and when the associate memory becomes full, an appropriate replacement policy is implemented. When an array is created, array access processor 612 receives an array definition instruction on bus 611 and an array access instruction identifier on bus 613 of the translated software instructions. Array access processor 612 utilizes this information to generate an array reference entry ARRAYi 615 and minimum and maximum array size values MINi 617A and MAXi 617B, respectively, associated with that array reference entry ARRAYi 615 that are all stored in associative memory element 614. In one embodiment, array access processor 612 is simply instructions that are executed by execution unit 616 to load the identifier, and minimum and maximum array size values into associative memory element 614. These instructions could be microcode or provided by translation unit 610. Associative memory element 614 is configured to verify that when an element in an array is accessed, the element is within a maximum array size value MAXi 617B and a minimum array size value MINi 617A, typically zero, for that array. In the example discussed below and illustrated in Figure 6A, the array bounds checking apparatus responds to the following array access instruction: load_array [ARRAY3] [ELEM26] as shown in Figure 6B. Returning to Figure 6A, associative memory element 614 includes: a first memory section 618A; a second memory section 618B that may be viewed as divided into a minimum value section 62OA and a maximum value section 620B; an input section 622; and an output section 624. First memory section 618A includes a first plurality of memory locations configured to receive and store a plurality of array reference entries ARRAYi 615, where i = 1 through N. Each one of the plurality of array reference entries corresponds to one of the plurality of array access instructions of the translated software instructions that can be provided by translation unit 610. Second memory section 618B includes a second plurality of memory locations configured to receive and store the minimum array size values MiNi 617A and maximum array size values MAXi 617B. Each one of the second plurality of memory locations in second memory section 618B is configured to store one set of minimum and maximum array size values 617A and 617B associated with each one of the plurality of memory locations of ARRAYi 615 first memory section 618A. Hence, each one of the sets of array size values is associated with one of the plurality of array access instructions of the translated software instructions. Input section 622, which is coupled to first memory section 618A, is configured to receive an array access instruction identifier on bus 613 for a translated software instruction and to simultaneously compare array access instruction identifier 613 with at least a portion of each of the array reference entries ARRAYi 615 stored in first memory section 618A. Each array access instruction identifier 613 identifies a unique array access instruction of the translated software instructions. Output section 624, which is coupled to second memory section 618B, is configured to provide, a minimum array size output value 630 and a maximum array size output value 621, one of the sets of array size values (MiNi 617A, MAXi 617B) stored in one of the second plurality of memory locations in second memory section 618B which is associated with one of the plurality of memory locations which stores one of the plurality of array reference entries ARRAYi 615 that matches the array access instruction identifier, on bus 613, of the translated software instructions. Maximum array size output value 621 and value 619 of the referenced element are compared by a comparator 626 to provide a maximum violation signal on maximum violation signal line 628 if value 619 of the referenced element is greater than maximum array size output value 621. Similarly, minimum array size output value 630, typically zero, is compared with value 619 of the referenced element by a comparator 632 to provide a minimum violation signal on minimum violation signal line 634 if the value 619 of the referenced element is less than minimum array size output value 630. Generation of either a maximum violation signal on line 628 or a minimum violation signal on line 634 results in generation of an exception output signal on line 636 by OR gate 638. Thus, in the Figure 6A and 6B example, array access instruction "load_array [ARRAY3] [ELEM26] " (see Fig. 6B) references element 26 in an array associated with array reference entry ARRAY3. Typically, the value on the top of the stack is loaded in element 26 of array three. If element 26 were outside the bounds of array three, information in memory could be overwritten if bounds checking were not employed. Row 690 in associative memory element 614 is associated with array reference entry ARRAY3. Input section 622 provides a match between the associated array access instruction identifier ARRAY3 on bus 613 and array reference entry ARRAY3. The match causes value MIN3 , which is zero in this example, and value MAX3, which is ninety-nine in this example, that are associated with array reference entry ARRAY3, to be provided on lines 630 and 621, respectively, via output section 624. MAX3 value ninety-nine is then compared with the value twenty-six (see Fig. 6B) to verify that the referenced element is less than the established maximum boundary value for the referenced array. Similarly, MIN3 value zero is compared with value twenty-six to verify that the referenced element is greater than the established minimum boundary value for the referenced array. Since the value twenty-six is within the established boundaries, an exception signal is not generated on line 636 (Fig. 6A) . Those skilled in the art will appreciate that a variety of logic functions, in addition to those described above, can be utilized to verify the boundaries and generate an exception signal . Use of compare functions 626 and 632 and OR gate 638 is meant to be illustrative only and not limiting of the invention. In one embodiment, execution unit 616 is configured to respond to the exception output signal on line 636 by executing a sequence of translated instructions that define an array access boundary exception subroutine. Figure 6C shows a computer system 600C similar to computer system 600 of Figure 6A. In the embodiment of the invention shown in Figure 6C, array access processor 612, associative memory element 614, comparators 626 and 632 and OR gate 638 comprise bounds check unit 147 of Figure 1. In this embodiment of the invention, instruction cache 125 (Figs. 1 and 6c) transmit software program information 609 to instruction decoder 135 (Figs. 1 and 6c) which fulfills the function of translation unit 610 in Figure 6A. As with computer system 600, in computer system 600C, instruction decoder 135 (Figs. 1 and 6c) determines, as part of its setup procedure, which array access instructions will be frequently utilized and identifies those array access instructions for which the dynamic execution count is high enough to provide performance results by loading these statement identifiers and their corresponding boundaries into an associative memory. Array access processor 612 then receives the array access instructions 611, and array access instruction identifiers 613 of the translated software instructions and selectively outputs an array reference entry ARRAYi 615 and minimum and maximum array size values MINi 617A and MAXi 617B respectively, associated with the array reference entry ARRAYi 615 for loading into unit 147. In this embodiment of the invention, the operation of array access processor 612, associative memory device 614, comparator 626, comparator 632, and OR gate 638 are all identical to the operation of like numbered units shown in Figure 6A and discussed in more detail above. In the embodiment of the invention shown in Figure 6C, the exception output signal of OR gate 638 on line 636 is coupled to integer unit 142 of execution unit 140 (Figs. 1 and 6c) . Integer unit 142 is configured to respond to an exception output signal on line 636 by executing a sequence of translated instructions that define an array access boundary exception subroutine. Those of ordinary skill in the art would be enabled by this disclosure to add to or modify the embodiment of the present invention in various ways as needed and still be within the scope and spirit of various aspects of the present invention. Accordingly, various changes and modifications which are obvious to a person skilled in the art to which the invention pertains are deemed to lie within the spirit and scope of the invention. APPENDIX I The JAVA Virtual Machine Specification © 1993, 1994, 1995 Sun Microsystems, Inc. 2550 Garcia Avenue, Mountain View, California 94043-1100 U.S.A. All rights reserved. This BETA quality release and related documentation are protected by copyright and distributed under licenses restricting its use, copying, distribution, and decompilation. No part of this release or related documentation may be reproduced in any form by any means without prior written authorization of Sun and its licensors, if any. Portions of this product may be derived from the UNIX ® and Berkeley 4.3 BSD systems, licensed from UNIX System Laboratories, Inc. and the University of California, respectively. Third-party font software in this release is protected by copyright and licensed from Sun's Font Suppliers. RESTRICTED RIGHTS LEGEND: Use, duplication, or disclosure by the United States Government is subject to the restrictions set forth in DFARS 252.227-7013 (c) (1) (ii) and FAR 52.227-19. The release described in this manual may be protected by one or more U.S. patents, foreign patents, or pending applications. TRADEMARKS Sun, Sun Microsystems, Sun Microsystems Computer Corporation, the Sun logo, the Sun Microsystems Computer Corporation logo, WebRunner, JAVA, FirstPerson and the FirstPerson logo and agent are trademarks or registered trademarks of Sun Microsystems, Inc. The "Duke" character is a trademark of Sun Microsystems, Inc. and Copyright (c) 1992-1995 Sun Microsystems, Inc. All Rights Reserved. UNIX ® is a registered trademark in the United States and other countries, exclusively licensed through X/Open Company, Ltd. OPEN LOOK is a registered trademark of Novell, Inc. All other product names mentioned herein are the trademarks of their respective owners. All SPARC trademarks, including the SCD Compliant Logo, are trademarks or registered trademarks of SPARC International, Inc. SPARCstation, SPARCserver, SPARCengine, SPARCworks, and SPARCompiler are licensed exclusively to Sun Microsystems, Inc. Products bearing SPARC trademarks are based upon an architecture developed by Sun Microsystems, Inc. The OPEN LOOK ® and Sun™ Graphical User Interfaces were developed by Sun Microsystems, Inc. for its users and licensees. Sun acknowledges the pioneering efforts of Xerox in researching and developing the concept of visual or graphical user interfaces for the computer industry. Sun holds a non-exclusive license from Xerox to the Xerox Graphical User Interface, which license also covers Sun's licensees who implement OPEN LOOK GUIs and otherwise comply with Sun's written license agreements . X Window System is a trademark and product of the Massachusetts Institute of Technology. THIS PUBLICATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT. THIS PUBLICATION COULD INCLUDE TECHNICAL INACCURACIES OR TYPOGRAPHICAL ERRORS. CHANGES ARE PERIODICALLY ADDED TO THE INFORMATION HEREIN; THESE CHANGES WILL BE INCORPORATED IN NEW EDITIONS OF THE PUBLICATION. SUN MICROSYSTEMS, INC. MAY MAKE IMPROVEMENTS AND/OR CHANGES IN THE PRODUCT (S) AND/OR THE PROGRAM (S) DESCRIBED IN THIS PUBLICATION AT ANY TIME. Preface This document describes version 1.0 of the JAVA Virtual Machine and its instruction set . We have written this document to act as a specification for both compiler writers, who wish to target the machine, and as a specification for others who may wish to implement a compliant JAVA Virtual Machine. The JAVA Virtual Machine is an imaginary machine that is implemented by emulating it in software on a real machine. Code for the JAVA Virtual Machine is stored in .class files, each of which contains the code for at most one public class. Simple and efficient emulations of the JAVA Virtual Machine are possible because the machine's format is compact and efficient bytecodes. Implementations whose native code speed approximates that of compiled C are also possible, by translating the bytecodes to machine code, although Sun has not released such implementations at this time. The rest of this document is structured as follows : Chapter 1 describes the architecture of the JAVA Virtual Machine; Chapter 2 describes the .class file format; Chapter 3 describes the bytecodes; and Appendix A contains some instructions generatedinternally by Sun's implementation of the JAVA Virtual Machine. While not strictly part of the specification we describe these here so that this specification can serve as a reference for our implementation. As more implementations of the JAVA Virtual Machine become available, we may remove Appendix A from future releases. Sun will license the JAVA Virtual Machine trademark and logo for use with compliant implementations of this specification. If you are considering constructing your own implementation of the JAVA Virtual Machine please contact us, at the email address below, so that we can work together to insure 100% compatibility of your implementation. Send comments on this specification or questions about implementing the JAVA Virtual Machine to our electronic mail address:JAVA@JAVA.sun.com. 1. JAVA Virtual Machine Architecture 1.1 Supported Data Types The virtual machine data types include the basic data types of the JAVA language: byte // l-byte signed 2's complement integer short // 2-byte signed 2's complement integer int // 4-byte signed 2's complement integer long // 8-byte signed 2's complement integer float // 4-byte IEEE 754 single-precision float double // 8-byte IEEE 754 double-precision float char // 2-byte unsigned Unicode character Nearly all JAVA type checking is done at compile time. Data of the primitive types shown above need not be tagged by the hardware to allow execution of JAVA. Instead, the bytecodes that operate on primitive values indicate the types of the operands so that, for example, the iadd, ladd, fadd, and dadd instructions each add two numbers, whose types are int, long, float, and double, respectively The virtual machine doesn't have separate instructions for boolean types. Instead, integer instructions, including integer returns, are used to operate on boolean values; byte arrays are used for arrays of boolean. The virtual machine specifies that floating point be done in IEEE 754 format, with support for gradual underflow. Older computer architectures that do not have support for IEEE format may run JAVA numeric programs very slowly. Other virtual machine data types include: object // 4-byte reference to a JAVA object returnAddress // 4 bytes, used with jsr/ret/jsr_w/ret_w instructions Note: JAVA arrays are treated as objects. This specification does not require any particular internal structure for objects. In our implementation an object reference is to a handle, which is a pair of pointers: one to a method table for the object, and the other to the data allocated for the object. Other implementations may use inline caching, rather than method table dispatch; such methods are likely to be faster on hardware that is emerging between now and the year 2000. Programs represented by JAVA Virtual Machine bytecodes are expected to maintain proper type discipline and an implementation may refuse to execute a bytecode program that appears to violate such type discipline. While the JAVA Virtual Machines would appear to be limited by the bytecode deόnition to running on a 32-bit address space machine, it is possible to build a version of the JAVA Virtual Machine that automatically translates the bytecodes into a 64-bit form. A description of this transformation is beyond the scope of the JAVA Virtual Machine Specification. 1.2 Registers At any point the virtual machine is executing the code of a single method, and the pc register contains the address of the next bytecode to be executed. Each method has memory space allocated for it to hold: a set of local variables, referenced by a vars register; an operand stack, referenced by an optop register; and a execution environment structure, referenced by a frame register. All of this space can be allocated at once, since the size of the local variables and operand stack are known at compile time, and the size of the execution environment structure is well-known to the interpreter. All of these registers are 32 bits wide. 1.3 Local Variables Each JAVA method uses a fixed-sized set of local variables . They are addressed as word offsets from the vars register. Local variables are all 32 bits wide. Long integers and double precision floats are considered to take up two local variables but are addressed by the index of the first local variable. (For example, a local variable with index containing a double precision float actually occupies storage at indices n and n+l.) The virtual machine specification does not require 64-bit values in local variables to be 64-bit aligned. Implementors are free to decide the appropriate way to divide long integers and double precision floats into two words. Instructions are provided to load the values of local variables onto the operand stack and store values from the operand stack into local variables. 1.4 The Operand Stack The machine instructions all take operands from an operand stack, operate on them, and return results to the stack. We chose a stack organization so that it would be easy to emulate the machine efficiently on machines with few or irregular registers such as the Intel 486 microprocessor. The operand stack is 32 bits wide. It is used to pass parameters to methods and receive method results, as well as to supply parameters for operations and save operation results. For example, execution of instruction iadd adds two integers together. It expects that the two integers are the top two words on the operand stack, and were pushed there by previous instructions. Both integers are popped from the stack, added, and their sum pushed back onto the operand stack. Subcomputations may be nested on the operand stack, and result in a single operand that can be used by the nesting computation. Each primitive data type has specialized instructions that know how to operate on operands of that type. Each operand requires a single location on the stack, except for long and double operands, which require two locations. Operands must be operated on by operators appropriate to their type. It is illegal, for example, to push two integers and then treat them as a long. This restriction is enforced, in the Sun implementation, by the bytecode verifier. However, a small number of operations (the dup opcodes and swap) operate on runtime data areas as raw values of a given width without regard to type. In our description of the virtual machine instructions below, the effect of an instruction's execution on the operand stack is represented textually, with the stack growing from left to right, and each 32-bit word separately represented. Thus: Stack: ... , valuel, value2 => ... , value3 shows an operation that begins by having value2 on top of the stack with valuel just beneath it. As a result of the execution of the instruction, valuel and value2 are popped from the stack and replaced by value3 , which has been calculated by the instruction. The remainder of the stack, represented by an ellipsis, is unaffected by the instruction's execution. The types long and double take two 32-bit words on the operand stack: Stack: ... => ..., value-wordl, alue-word2 This specification does not say how the two words are selected from the 64-bit long or double value; it is only necessary that a particular implementation be internally consistent. 1.5 Execution Environment The information contained in the execution environment is used to do dynamic linking, normal method returns, and exception propagation. 1.5.1 Dynamic Linking The execution environment contains references to the interpreter symbol table for the current method and current class, in support of dynamic linking of the method code. The class file code for a method refers to methods to be called and variables to be accessed symbolically. Dynamic linking translates these symbolic method calls into actual method calls, loading classes as necessary to resolve as-yet-undefined symbols, and translates variable accesses into appropriate offsets in storage structures associated with the runtime location of these variables. This late binding of the methods and variables makes changes in other classes that a method uses less likely to break this code. 1.5.2 Normal Method Returns If execution of the current method completes normally, then a value is returned to the calling method. This occurs when the calling method executes a return instruction appropriate to the return type. The execution environment is used in this case to restore the registers of the caller, with the program counter of the caller appropriately incremented to skip the method call instruction. Execution then continues in the calling method's execution environment. 1.5.3 Exception and Error Propagation An exceptional condition, known in JAVA as an Error or Exception, which are subclasses of Throwable, may arise in a program because of : a dynamic linkage failure, such as a failure to find a needed class file; a run-time error, such as a reference through a null pointer; an asynchronous event, such as is thrown by Thread.stop, from another thread; and the program using a throw statement. When an exception occurs: A list of catch clauses associated with the current method is examined. Each catch clause describes the instruction range for which it is active, describes the type of exception that it is to handle, and has the address of the code to handle it. An exception matches a catch clause if the instruction that caused the exception is in the appropriate instruction range, and the exception type is a subtype of the type of exception that the catch clause handles. If a matching catch clause is found, the system branches to the specified handler. If no handler is found, the process is repeated until all the nested catch clauses of the current method have been exhausted. The order of the catch clauses in the list is important. The virtual machine execution continues at the first matching catch clause. Because JAVA code is structured, it is always possible to sort all the exception handlers for one method into a single list that, for any possible program counter value, can be searched in linear order to find the proper (innermost containing applicable) exception handler for an exception occurring at that program counter value. If there is no matching catch clause then the current method is said to have as its outcome the uncaught exception. The execution state of the method that called this method is restored from the execution environment, and the propagation of the exception continues, as though the exception had just occurred in this caller. 1.5.4 Additional Information The execution environment may be extended with additional implementation-specified information, such as debugging information. 1.6 Garbage Collected Heap The JAVA heap is the runtime data area from which class instances (objects) are allocated. The JAVA language is designed to be garbage collected - it does not give the programmer the ability to deallocate objects explicitly. The JAVA language does not presuppose any particular kind of garbage collection; various algorithms may be used depending on system requirements. 1.7 Method Area The method area is analogous to the store for compiled code in conventional languages or the text segment in a UNIX process. It stores method code (compiled JAVA code) and symbol tables. In the current JAVA implementation, method code is not part of the garbage-collected heap, although this is planned for a future release. 1.8 The JAVA Instruction Set An instruction in the JAVA instruction set consists of a one-byte opcode specifying the operation to be performed, and zero or more operands supplying parameters or data that will be used by the operation. Many instructions have no operands and consist only of an opcode. The inner loop of the virtual machine execution is effectively: do { fetch an opcode byte execute an action depending on the value of the opcode } while (there is more to do) ; The number and size of the additional operands is determined by the opcode. If an additional operand is more than one byte in size, then it is stored in big-endian order - high order byte first. For example, a 16-bit parameter is stored as two bytes whose value is : first_byte * 256 + second_byte The bytecode instruction stream is only byte-aligned, with the exception being the tableswitch and lookupswitch instructions, which force alignment to a 4-byte boundary within their instructions. These decisions keep the virtual machine code for a compiled JAVA program compact and reflect a conscious bias in favor of compactness at some possible cost in performance. 1.9 Limitations The per-class constant pool has a maximum of 65535 entries. This acts as an internal limit on the total complexity of a single class. The amount of code per method is limited to 65535 bytes by the sizes of the indices in the code in the exception table, the line number table, and the local variable table. Besides this limit, the only other limitation of note is that the number of words of arguments in a method call is limited to 255. 2. Class File Format This chapter documents the JAVA class (.class) file format. Each class file contains the compiled version of either a JAVA class or a JAVA interface. Compliant JAVA interpreters must be capable of dealing with all class files that conform to the following specification. A JAVA class file consists of a stream of 8-bit bytes. All 16-bit and 32-bit quantities are constructed by reading in two or four 8-bit bytes, respectively. The bytes are joined together in network (big-endian) order, where the high bytes come first. This format is supported by the JAVA JAVA.io.Datalnput and JAVA.io.DataOutput interfaces, and classes such as JAVA. io.DatalnputStream and JAVA.io.DataOutputStream. The class file format is described here using a structure notation. Successive fields in the structure appear in the external representation without padding or alignment. Variable size arrays, often of variable sized elements, are called tables and are commonplace in these structures. The types ul, u2, and u4 mean an unsigned one-, two-, or four-byte quantity, respectively, which are read by method such as readUnsignedByte, readUnsignedShort and readint of the JAVA. io.Datalnput interface. 2.1 Format The following pseudo-structure gives a top-level description of the format of a class file: ClassFile { u4 magic; u2 minor_version; u2 major_version; u2 constant_pool_count; cp_info constant_pool [constant_pool_count - 1] ; u2 access_flags; u2 this_class; u2 super_class; u2 interfaces_count; u2 interfaces [interfaces_count] ; u2 fields_count; field_info fields [fields_count] ; u2 methods_count; method_info methods [methods_count] ; u2 attributes_count; attribute_info attributes [attribute_count] ; } magic This field must have the value OxCAFEBABE. minor_version, ma or_version These fields contain the version number of the JAVA compiler that produced this class file. An implementation of the virtual machine will normally support some range of minor version numbers 0-n of a particular major version number. If the minor version number is incremented the new code won't run on the old virtual machines, but it is possible to make a new virtual machine which can run versions up to n+l . A change of the major version number indicates a major incompatible change, one that requires a different virtual machine that may not support the old major version in any way. The current major version number is 45; the current minor version number is 3. constant_pool_count This field indicates the number of entries in the constant pool in the class file. constant_pool The constant pool is a table of values. These values are the various string constants, class names, field names, and others that are referred to by the class structure or by the code. constant_pool [0] is always unused by the compiler, and may be used by an implementation for any purpose. Each of the constant_pool entries 1 through constant_pool_count-l is a variable-length entry, whose format is given by the first "tag" byte, as described in section 2.3. access_flags This field contains a mask of up to sixteen modifiers used with class, method, and field declarations. The same encoding is used on similar fields in field_info and method_info as described below. Here is the encoding: Flag Name Value Meaning Used By ACC_PU LIC 0x0001 Visible to everyone Class, Method, Variable ACC_PRIVATE 0x0002 Visible only to the Method, defining class Variable ACC_PROTECTED 0x0004 Visible to subclasses Method, Variable ACC_STATIC 0x0008 Variable or method is Method, static Variable ACC_FINAL 0x0010 No further subclassing, Class, overriding, or assignment Method, after initialization Variable ACC SYNCHRONIZED 0x0020 Wrap use in monitor lock Method ACC VOLATILE 0x0040 Can't cache Variable ACC ΓRANSIENT 0x0080 Not to be written or read Variable by a persistent object manager ACC_NATIVE 0x0100 Implemented in a language Method other than JAVA ACC INTERFACE 0x0200 Is an interface Class ACC_ABSTRACT 0x0400 No body provided Class, Method this class This field is an index into the constant pool; constant_pool [this_class] must be a CONSTANT_class. super_class This field is an index into the constant pool. If the value of super_class is nonzero, then constant_pool [super_class] must be a class, and gives the index of this class's superclass in the constant pool. If the value of super_class is zero, then the class being defined must be JAVA.lang.Object, and it has no superclass. interfaceβ_count This field gives the number of interfaces that this class implements. interfaces Each value in this table is an index into the constant pool. If a table value is nonzero (interfaces [i] != 0, where 0 <= i <interfaces_count) , then constant_pool [interfaces [i] ] must be an interface that this class implements. fields_count This field gives the number of instance variables, both static and dynamic, defined by this class. The fields table includes only those variables that are defined explicitly by this class. It does not include those instance variables that are accessible from this class but are inherited from superclasses. fields Each value in this table is a more complete description of a field in the class. See section 2.4 for more information on the field_info structure. methods_count This field indicates the number of methods, both static and dynamic, defined by this class. This table only includes those methods that are explicitly defined by this class. It does not include inherited methods. methods Each value in this table is a more complete description of a method in the class. See section 2.5 for more information on the method_info structure. attributes_count This field indicates the number of additional attributes about this class. attributes A class can have any number of optional attributes associated with it. Currently, the only class attribute recognized is the "SourceFile" attribute, which indicates the name of the source file from which this class file was compiled. See section 2.6 for more information on the attribute info structure. 2.2 Signatures A signature is a string representing a type of a method, field or array. The field signature represents the value of an argument to a function or the value of a variable. It is a series of bytes generated by the following grammar: <field_signature> : := <field_type> <field_type> =<base_type> j <object_type> ] <array_type> <base_type> = B|C|D|F|I|J|S|Z <object_type> = L<fullclassname>; <array_type> = [<optional_sizexfield_type> <optional_size> ::= [0-9] The meaning of the base types is as follows : B byte signed byte C char character D double double precision IEEE float F float single precision IEEE float I int integer J long long integer L<fullclassname>; ... an object of the given class S short signed short Z boolean true or false [<field sig> ... array A return-type signature represents the return value from a method. It is a series of bytes in the following grammar: <re urn_signature> : := <field_type> | V The character V indicates that the method returns no value. Otherwise, the signature indicates the type of the return value. An argument signature represents an argument passed to a method: <argument_signature> ::= <field_type> A method signature represents the arguments that the method expects, and the value that it returns. <method_signature> : := (<arguments_signature>) <return_signature> <arguments_signature> ::= <argument_signature>* 2.3 Constant Pool Each item in the constant pool begins with a 1-byte tag: . The table below lists the valid tags and their values. Constant Type Value CONSTANT Class 7 CONSTANT Fieldref 9 CONSTANT Methodref 10 CONSTANT InterfaceMethodref 11 CONSTANT String 8 CONSTANT Integer 3 CONSTANT Float 4 CONSTANT Long 5 CONSTANT Double 6 CONSTANT NameAndType 12 CONSTANT Utf8 1 CONSTANT Unicode 2 Each tag byte is then followed by one or more bytes giving more information about the specific constant. 2.3.1 CONSTANT Class CONSTANT_Class is used to represent a class or an interface. CONSTANT_Class_info { ul tag; u2 name_index; } tag The tag will have the value CONSTANT_Class name_index constant_pool [name_index] is a CONSTANT_Utf8 giving the string name of the class. Because arrays are objects, the opcodes anewarray and multianewarray can reference array "classes" via CONSTANT_Class items in the constant pool . In this case, the name of the class is its signature. For example, the class name for int[] [] is [[I The class name for Thread[] is " [LJAVA.lang.Thread; " 2.3.2 CONSTANT_{Fieldref,Methodref, InterfaceMethodref} Fields, methods, and interface methods are represented by similar structures. CONSTANT_Fieldref_info { ul tag; u2 class_index; u2 name_and_type_index; } CONSTANT_Methodref_info { ul tag; u2 class_index; u2 name_and_type_index; } CONSTANT_InterfaceMethodref_info { ul tag; u2 class_index; u2 name_and_type_index; } tag The tag will have the value CONSTANT_Fieldref, CONSTANT_Methodref, or CONSTANT_InterfaceMethodref . clasβ_index constant_pool [class_index] will be an entry of type CONSTANT_Class giving the name of the class or interface containing the field or method. For CONSTANT_Fieldref and CONSTANT_Methodref, the CONSTANT Class item must be an actual class . For CONSTANT_InterfaceMethodref, the item must be an interface which purports to implement the given method. name_and_type_index constant_pool [name_and_type_index] will be an entry of type CONSTANT_NameAndType . This constant pool entry indicates the name and signature of the field or method. 2.3.3 CONSTANT_String CONSTANT_String is used to represent constant objects of the built-in type String. CONSTANT_String_info { ul tag; u2 string_index; } tag The tag will have the value CONSTANT_String string_index constant_pool [string_index] is a CONSTANTJ tf8 string giving the value to which the String object is initialized. 2.3.4 CONSTANT_Integer and CONSTANT_Float CONSTANT_Integer andCONSTANT_Float represent four-byte constants. CONSTANT_Integer_info { ul tag; u4 bytes; } CONSTANT_Float_info { ul tag; u4 bytes; } tag The tag will have the value CONSTANT_Integer or CONSTANT Float bytes For integers, the four bytes are the integer value. For floats, they are the IEEE 754 standard representation of the floating point value . These bytes are in network (high byte first) order. 2 .3 . 5 CONSTANT_Long and CONSTANT Double CONSTANT_Long andCONSTANT_Double represent eight-byte constants. CONSTANT_Long_info { ul tag; u4 high_bytes; u4 low_bytes; } CONSTANT_Double_info { ul tag; u4 high_bytes; u4 low_bytes; } All eight-byte constants take up two spots in the constant pool. If this is the n th item in the constant pool, then the next item will be numbered n+2. tag The tag will have the value CONSTANT_Long or CONSTANT_Double. high_bytes- low_bytes For CONSTANT_Long, the 64-bit value is (high_bytes << 32) +low_bytes. For CONSTANT_Double, the 64-bit value,high_bytes and low_bytes together represent the standard IEEE 754 representation of the double-precision floating point number. 2.3.6 CONSTANT_NameAndType CONSTANT_NameAndType is used to represent a field or method, without indicating which class it belongs to. CONSTANT_NameAndType_info { ul tag; u2 name_index; u2 signature_index; } tag The tag will have the valueCONSTANT_NameAndType. name_index constant_pool [name_index] is a CONSTANTJUtf8 string giving the name of the field or method. signature_index constant_pool [signature_index] is a CONSTANT_Utf8 string giving the signature of the field or method. 2.3.7 CONSTANT_ϋtf8 and CONSTANT_ϋnicode CONSTANT_Utf8 andCONSTANT_Unicode are used to represent constant string values. C0NSTANT_Utf8 strings are "encoded" so that strings containing only non-null ASCII characters, can be represented using only one byte per character, but characters of up to 16 bits can be represented: All characters in the range 0x0001 to 0x007F are represented by a single byte: +-+-+-+-+-+-+-+-+ |0|7bits of data I +-+-+-+-+-+-+-+-+ The null character (0x0000) and characters in the range 0x0080 to 0x07FF are represented by a pair of two bytes: +-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+ !11110I 5 bitst I 1110I 6 bits | +-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+ Characters in the range 0x0800 to OxFFFF are represented by three bytes : +-+-+-+-+- +-+-+- + +- +-+-+- +-+- +-+- + +-+-+-+-+- +- +-+-+ | 1 | 1 | 1 | 0 | 4 bits | | l | o | 6 bits | | l | 0 | 6 bits | +-+-+-+-+-+-+-+-+ + - + - +- + - H H-+-+-+ +-+-+-+-+-+-+-+-+ There are two differences between this format and the "standard" UTF-8 format. First, the null byte (0x00) is encoded in two-byte format rather than one-byte, so that our strings never have embedded nulls. Second, only the one-byte, two-byte, and three-byte formats are used. We do not recognize the longer formats . CONSTANT_Utf8_info { ul tag; u2 length; ul bytes [length] ; } CONSTANT_Unicode_info { ul tag; u2 length; u2 bytes [length] ; } tag The tag will have the value CONSTANT_Utf8 or CONSTANT_Unicode. length The number of bytes in the string. These strings are not null terminated. bytes The actual bytes of the string. 2.4 Fields The information for each field immediately follows the field_count field in the class file. Each field is described by a variable length field_info structure. The format of this structure is as follows: field_info { u2 access_flags; u2 name_index; u2 signature_index; u2 attributes_count; attribute_info attributes [attribute_count] ; } access_flags This is a set of sixteen flags used by classes, methods, and fields to describe various properties and how they many be accessed by methods in other classes. See the table "Access Flags" which indicates the meaning of the bits in this field. The possible fields that can be set for a field are ACC_PUBLIC, ACC_PRIVATE, ACC_PROTECTED, ACC_STATIC, ACC_FINAL, ACC_VOLATILE, and ACC_TRANSIENT. At most one of ACC_PUBLIC, ACC_PROTECTED, and ACC_PRIVATE can be set for any method. name_index constant_pool [name_index] is a CONSTANT_Utf8 string which is the name of the field. βignature_index constant_pool [signature_index] is a CONSTANT_Utf8 string which is the signature of the field. See the section "Signatures" for more information on signatures. attributes_count This value indicates the number of additional attributes about this field. attributes A field can have any number of optional attributes associated with it. Currently, the only field attribute recognized is the "ConstantValue" attribute, which indicates that this field is a static numeric constant, and indicates the constant value of that field. Any other attributes are skipped. 2.5 Methods The information for each method immediately follows the method_count field in the class file. Each method is described by a variable length method_info structure. The structure has the following format: method_info { u2 access_flags; u2 name_index; u2 signature_index; u2 attributes_count; attribute_info attributes [attribute_count] ; } access flags This is a set of sixteen flags used by classes, methods, and fields to describe various properties and how they many be accessed by methods in other classes. See the table "Access Flags" which gives the various bits in this field. The possible fields that can be set for a method are ACC_PUBLIC, ACC_PRIVATE, ACC_PROTECTED, ACC_STATIC, ACC_FINAL, ACC_SYNCHRONIZED, ACC_NATIVE, and ACC_ABSTRACT. At most one of ACC_PUBLIC, ACC_PROTECTED, and ACCJPRIVATE can be set for any method. name_index constant_pool [name_index] is a CONSTANT_Utf8 string giving the name of the method. signature_index constant__pool [signature_index] is a CONSTANT_Utf8 string giving the signature of the field. See the section "Signatures" for more information on signatures. attributes_count This value indicates the number of additional attributes about this field, attributes A field can have any number of optional attributes associated with it. Each attribute has a name, and other additional information. Currently, the only field attributes recognized are the "Code" and "Exceptions" attributes, which describe the bytecodes that are executed to perform this method, and the JAVA Exceptions which are declared to result from the execution of the method, respectively. Any other attributes are skipped. 2.6 Attributes Attributes are used at several different places in the class format. All attributes have the following format : GenericAttribute_info { u2 attribute_name; u4 attribute_length; ul info [attribute_length] ; } The attribute_name is a 16-bit index into the class's constant pool; the value of constant_pool [attribute_name] is a CONSTANT_Utf8 string giving the name of the attribute. The field attribute_length indicates the length of the subsequent information in bytes. This length does not include the six bytes of the attribute_name and attribute_length. In the following text, whenever we allow attributes, we give the name of the attributes that are currently understood. In the future, more attributes will be added. Class file readers are expected to skip over and ignore the information in any attribute they do not understand. 2.6.1 SourceFile The "SourceFile" attribute has the following format : SourceFile_attribute { u2 attribute name index; u4 attribute_length; u2 sourcefile_index; } attribute_name_index constant_pool [attribute_name_index] is the C0NSTANT_Utf8 string "SourceFile". attribute_length The length of a SourceFile_attribute must be 2. sourcefile_index constant_pool [sourcefile_index] is a CONSTANT_Utf8 string giving the source file from which this class file was compiled. 2.6.2 ConstantValue The "ConstantValue" attribute has the following format : ConstantValue_attribute { u2 attribute_name_index; u4 attribute_length; u2 constantvalue_index; } attribute_name_index constant_pool [attribute_name_index] is the CONSTANT_Utf8 string "ConstantValue". attribute_length The length of a ConstantValue_attribute must be 2. constantvalue index constant_pool [constantvalue_index] gives the constant value for this field. The constant pool entry must be of a type appropriate to the field, as shown by the following table: long CONSTANTJLong float CONSTANT Float double CONSTANT Double int, short, char, byte, boolean CONSTANT_Integer 2.6.3 Code The "Code" attribute has the following format: Code_attribute { u2 attribute_name_index; u4 attribute_length; u2 max_stack; u2 max_locals; u4 code_length; ul code [code_length] ; u2 exception_table_length; { u2 start_pc; u2 end_pc; u2 handler_pc; u2 catch_type; } exception_table [exception_table_length] ; u2 attributes_count; attribute_info attributes [attribute_count] ; } attribute_name_index constant_pool [attribute_name_index] is the CONSTANT_Utf8 string "Code". attribute_length This field indicates the total length of the "Code" attribute, excluding the initial six bytes. max_βtack Maximum number of entries on the operand stack that will be used during execution of this method. See the other chapters in this spec for more information on the operand stack. max_locals Number of local variable slots used by this method. See the other chapters in this spec for more information on the local variables. code_length The number of bytes in the virtual machine code for this method. code These are the actual bytes of the virtual machine code that implement the method. When read into memory, if the first byte of code is aligned onto a multiple-of-four boundary the tableswitch and tablelookup opcode entries will be aligned; see their description for more information on alignment requirements. exception_tab1e_length The number of entries in the following exception table. exception_table Each entry in the exception table describes one exception handler in the code. start_pc, end_pc The two fieldsstart_pc and end_pc indicate the ranges in the code at which the exception handler is active. The values of both fields are offsets from the start of the code. start_pc is inclusive .end_pc is exclusive . handler_pc This field indicates the starting address of the exception handler. The value of the field is an offset from the start of the code. catch_type If catch_type is nonzero, then constant_pool [catch_type] will be the class of exceptions that this exception handler is designated to catch. This exception handler should only be called if the thrown exception is an instance of the given class. If catch_type is zero, this exception handler should be called for all exceptions. attributes_count This field indicates the number of additional attributes about code. The "Code" attribute can itself have attributes. attributes A "Code" attribute can have any number of optional attributes associated with it. Each attribute has a name, and other additional information. Currently, the only code attributes defined are the "LineNumberTable" and "LocalVariableTable, " both of which contain debugging information. 2.6.4 Exceptions Table This table is used by compilers which indicate which Exceptions a method is declared to throw: Exceptions_attribute { u2 attribute_name_index; u4 attribute_length; u2 number_of_exceptions; u2 exception_index_table [number_of_ex- ceptions] ; } attribute_name index constant_pool [attribute_name_index] will be the CONSTANT_Utf8 string "Exceptions". attribute_length This field indicates the total length of the Exceptions_attribute, excluding the initial six bytes. number_of_excoptions This field indicates the number of entries in the following exception index table. exception_index_table Each value in this table is an index into the constant pool . For each table element (exception_index_table [i] != 0, where 0 <= i <number_of_exceptions) , then constant_pool [exception_index+table [i] ] is a Exception that this class is declared to throw. 2.6.5 LineNumber able This attribute is used by debuggers and the exception handler to determine which part of the virtual machine code corresponds to a given location in the source. The LineNumberTable_attribute has the following format : LineNumberTable_attribute { u2 attribute_name_index; u4 attribute_length; u2 line_number_table_length; { u2 start_pc; u2 line_number; } line_number_table [line_ number_table_length] ; } attribute_name_index constant_pool [attribute_name_index] will be the CONSTANT_Utf8 string "LineNumberTable" . attribute_length This field indicates the total length of the LineNumberTable_attribute, excluding the initial six bytes. line_number_table_length This field indicates the number of entries in the following line number table. 1ine_number_table Each entry in the line number table indicates that the line number in the source file changes at a given point in the code. start_pc This field indicates the place in the code at which the code for a new line in the source begins. source__pc <<SHOULD THAT BEstart_pc?>> is an offset from the beginning of the code. line_number The line number that begins at the given location in the file. 2.6.6 LocalVariableTable This attribute is used by debuggers to determine the value of a given local variable during the dynamic execution of a method. The format of the LocalVariableTable_attribute is as follows : LocalVariableTable_attribute { u2 attribute_name_index; u4 attribute_length; u2 local_variable_table_length; { u2 start_pc; u2 length; u2 name_index; u2 signature_index; u2 slot; } local_variable_table [local_ variable_table_length] ; } attribute_name_index constant_pool [attribute_name_index] will be the CONSTANT Jtfθ string "LocalVariableTable". attribute_lβngth This field indicates the total length of the LineNumberTable_attribute, excluding the initial six bytes. local_variable_table_length This field indicates the number of entries in the following local variable table. local variable table Each entry in the local variable table indicates a code range during which a local variable has a value. It also indicates where on the stack the value of that variable can be found. start_pc, length The given local variable will have a value at the code between start_pc andstart_pc + length. The two values are both offsets from the beginning of the code. na e index, signature_index constant_pool [name_index] and constant_pool [signature_index] are CONSTANT_Utf8 strings giving the name and signature of the local variable. slot The given variable will be the slot th local variable in the method's frame. 3. The Virtual Machine Instruction Set 3.1 Format for the Instructions JAVA Virtual Machine instructions are represented in this document by an entry of the following form. instruction name Short description of the instruction Syntax: opcode=number operandl operand2 Stack: .... , valuel, value2 =»■ ... , value3 A longer description that explains the functions of the instruction and indicates any exceptions that might be thrown during execution. Each line in the syntax table represents a single 8-bit byte. Operations of the JAVA Virtual Machine most often take their operands from the stack and put their results back on the stack. As a convention, the descriptions do not usually mention when the stack is the source or destination of an operation, but will always mention when it is not. For instance, instruction iload has the short description "Load integer from local variable." Implicitly, the integer is loaded onto the stack. Instruction iadd is described as "Integer add"; both its source and destination are the stack. Instructions that do not affect the control flow of a computation may be assumed to always advance the virtual machine program counter to the opcode of the following instruction. Only instructions that do affect control flow will explicitly mention the effect they have on the program counter. 3.2 Pushing Constants onto the Stack bipush Push one-byte signed integer Syntax: bipush=16 bytel Stack: ...=> ..., value bytel is interpreted as a signed 8-bitvalue. This value is expanded to an integer and pushed onto the operand stack. sipush Push two-byte signed integer Syntax: sipush=17 bytel byte2 Stack: ...=> ... , item bytel and byte2 are assembled into a signed 16-bit value. This value is expanded to an integer and pushed onto the operand stack. ldcl Push item from constant pool Syntax: ldcl=18 indexbytel Stack: ... => item indexbytel is used as an unsigned 8-bit index into the constant pool of the current class. The item at that index is resolved and pushed onto the stack. If a String is being pushed and there isn't enough memory to allocate space for it then an OutOfMemoryError is thrown. Note: A String push results in a reference to an object. ldc2 Push item from constant pool Syntax: ldc2=19 indexbytel indexbyte2 Stack: ...=> ... , item indexbytel and indexbyte2 are used to construct an unsigned 16-bit index into the constant pool of the current class. The item at that index is resolved and pushed onto the stack. If a String is being pushed and there isn't enough memory to allocate space for it then an OutOfMemoryError is thrown. Note: A String push results in a reference to an object . ldc2w Push long or double from constant pool Syntax: ldc2w=20 indexbytel indexbyte2 Stack: ...=> ... , constant-wordl, constant-word2 indexbytel and indexbyte2 are used to construct an unsigned 16-bit index into the constant pool of the current class. The two-word constant that index is resolved and pushed onto the stack. aeonst_null Push null object reference Syntax: aconst null=l Stack: ...=> ...,null Push the null object reference onto the stack. iconst_ml Push integer constant -1 Syntax: iconst ml=2 Stack: ...=> ... , 1 Push the integer -1 onto the stack. iconst_<n> Push integer constant Syntax: iconst ,<n> Stack: ...=> ... , <n> Forms : iconst_0 = 3, iconst_l = 4, iconst_2 = 5, iconst 3 = 6, iconst 4 = 7, iconst 5 = 8 Push the integer <n> onto the stack. lconst_<l> Push long integer constant Syntax: Iconst <1> Stack: ...=> ... , <l>-wordl, <l>-word2 Forms: lconst_0 = 9, lconst_l = 10 Push the long integer <1> onto the stack. fconst_<f> Push single float Syntax: fconst <f> Stack: ...=> ... , <f> Forms: fconst_0 = 11, fconst_l = 12, fconst_2 = 13 Push the single-precision floating point number <f> onto the stack. dconst_<d> Push double float Syntax: dconst <d> Stack: ...=> ..., <d>- ordl, <d>-word2 Forms: dconst_0 = 14, dconst_l = 15 Push the double-precision floating point number <d> onto the stack. 3.3 Loading Local Variables Onto the Stack lload Load integer from local variable Syntax: iload=21 vindex Stac : ... => ... , value The value of the local variable at vindex in the current JAVA frame is pushed onto the operand stack. iload_<n> Load integer from local variable Syntax: iload <n> Stack: ...=> ..., value Forms: iload_0 = 26, iload_l = 27,iload_2 = 28, iload_3 = 29 The value of the local variable at <n> in the current JAVA frame is pushed onto the operand stack. This instruction is the same as iload with a vindex of <n>, except that the operand <n> is implicit iload Load long integer from local variable Syntax: iload = 22 vindex Stack: ... => ... , value-wordl, value-work2 The value of the local variables at vindex and vindex+1 in the current JAVA frame is pushed onto the operand stack. lload_<n> Load long integer from local variable Syntax: iload <n> Stack: => , value-wordl, value-word2 Forms: lload_0 = 30, lload_l = 31, lload_2 = 32, lload_3 = 33 The value of the local variables at <n> and <n>+l in the current JAVA frame is pushed onto the operand stack. This instruction is the same as Iload with a vindex of <n>, except that the operand <n> is implicit fload Load single float from local variable Syntax: fload = 23 vindex Stack: ...=> ..., value The value of the local variable at vindex in the current JAVA frame is pushed onto the opera and stack. fload_<n> Load single float from local variable Syntax: fload <n> Stack: ... => ... ,value Forms: fload_0 = 34, fload_l = 35, fload_2 = 36, fload_3 = 37 The value of the local variable at <n> in the current JAVA frame is pushed onto the operand stack. This instruction is the same as fload with a vindex of <n>, except that the operand <n> is implicit dload Load double float from local variable Syntax: dload = 24 vindex Stack: ...=> ..., value-wordl, value-word2 The value of the local variables at vindex and vindex+1 in the current JAVA frame is pushed onto the operand stack. dload_<n> Load double float from local variable Syntax: dload <n> Stack: ...=> ..., value-wordl, value-word2 Forms: dload_0 = 38, dload_l = 39, dload_2 = 40, dload_3 = 41 The value of the local variables at <n> and <n>+l in the current JAVA frame is pushed onto the operand stack. This instruction is the same as dload with a vindex of <n>, except that the operand <n> is implicit aload Load object reference from local variable Syntax: aload = 25 vindex Stack: ...=> ..., value The value of the local variable at vindex in the current JAVA frame is pushed onto the operand stack. aload_<n> Load object reference from local variable Syntax: aload <n> Stack: ...=> ..., value Forms: aload_0 = 42,aload_l = 43, aload_2 = 44, aload_3 = 45 The value of the local variable at <n> in the current JAVA frame is pushed onto the operand stack. This instruction is the same as aload with a vindex of <n>, except that the operand <n> is implicit 3.4 Storing Stack Values into Local Variables istore Store integer into local variable Syntax: istore = 54 vindex Stack: ... , value => ... value must be an integer. Local variable vindex in the current JAVA frame is set to value. istore_<n> Store integer into local variable Syntax: istore <n> Stack: ..., value => ... Forms: istore_0 = 59, istore_l = 60, istore_2 = 61, istore_3 = 62 value must be an integer. Local variable <n> in the current JAVA frame is set to value. This instruction is the same as istore with a vindex of <n>, except that the operand <n> is implicit Istore Store long integer into local variable Syntax: Istore = 55 vindex Stack: ..., value-wordl, value-word2 => ... value must be a long integer. Local variables vindex+1 in the current JAVA frame are set to value. lstore_<n> Store long integer into local variable Syntax: Istore <n> Stack: ..., value-wordl, value-word2 ■> Forms: lstore_0 = 63, lstore_l = 64, lstore_2 = 65, lstore_3 = 66 value must be a long integer. Local variables <n> and <n>+l in the current JAVA frame are set to value. This instruction is the same as Istore with a vindex of <n>, except that the operand <n> is implicit. fstore Store single float into local variable Syntax: fstore =56 vindex Stack: ..., value => ... value must be a single-precision floating point number. Local variable vindex in the current JAVA frame is set to value. fstore_<n> Store single float into local variable Syntax: fstore <n> Stack: ..., value => ... Forms: fstore_0 = 67, fstore_l = 68, fstore_2 = 69, fstore_3 = 70 value must be a single-precision floating point number. Local variable <n> in the current JAVA frame is set to value. This instruction is the same as fstore with a vindex of <n>, except that the operand <n> is implicit dstore Store double float into local variable Syntax: dstore = 57 vindex Stack: ..., value-wordl, value-word2 => ... value must be a double-precision floating point number. Local variables vindex and vindex+1 in the current JAVA frame are set to value. dstore_<n> Store double float into local variable Syntax: dstore <n> Stack: ... , value-wordl, value-word2 => ... Forms: dstore_0 = 71, dstore_l = 72, dstore_2 = 73, dstore_3 = 74 value must be a double-precision floating point number. Local variables <n> and <n>+l in the current JAVA frame are set to value. This instruction is the same as dstore with a vindex of <n>, except that the operand <n> is implicit, astore Store object reference into local variable Syntax: astore = 58 vindex Stack: ...» value => ... value must be a return address or a reference to an object. Local variable vindex in the current JAVA frame is set to value. astore_<n> Store object reference into local variable Syntax: astore <n> Stack: ..., value ■> ... Forms: astore_0 = 75, astore_l = 76, astore_2 = 77, astore_3 = 78 value must be a return address or a reference to an object. Local variable <n> in the current JAVA frame is set to value. This instruction is the same as astore with a vindex of <n>, except that the operand <n> is implicit iinc Increment local variable by constant Syntax: iinc = 132 vindex const Stack: no change Local variable vindex in the current JAVA frame must contain an integer. Its value is incremented by the value const, where const is treated as a signed 8-bit quantity. 3.5 Wider index for Loading, Storing and Incrementing wide Wider index for accessing local variables in load, store and increment. Syntax: wide = 196 vindex2 Stack: no change This bytecode must precede one of the following bytecodes: iload, Iload, fload, dload, aload, istore, Istore, fstore, dstore, astore, iinc. The vindex of the following bytecode and vindex2 from this bytecode are assembled into an unsigned 16-bit index to a local variable in the current JAVA frame. The following bytecode operates as normal except for the use of this wider index. 3.6 Managing Arrays newarray Allocate new array Syntax: newarray = 188 atype Stack: ..., size => result size must be an integer. It represents the number of elements in the new array. type is an internal code that indicates the type of array to allocate. Possible values for atype are as follows: T_BOOLEAN 4 T_CHAR 5 T_FLOAT 6 T_DOUBLE 7 T_BYTE 8 T_SHORT 9 T_INT 10 T LONG 11 A new array of atype, capable of holding size elements, is allocated, and result is a reference to this new object. Allocation of an array large enough to contain size items of atype is attempted.. All elements of the array are initialized to zero. If size is less than zero, a NegativeArraySizeException is thrown. If there is not enough memory to allocate the array, anOutOfMemoryError is thrown. anewarray Allocate new array of references to objects Syntax: anewarray = 189 indexbytel indexbyte2 Stack: ..., size => result size must be an integer. It represents the number of elements in the new array. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item at that index is resolved. The resulting entry must be a class. A new array of the indicated class type and capable of holding size elements is allocated, and result is a reference to this new object. Allocation of an array large enough to contain size items of the given class type is attempted. All elements of the array are initialized to null. If size is less than zero, a NegativeArraySizeException is thrown. If there is not enough memory to allocate the array, an OutOfMemoryError is thrown. anewarray is used to create a single dimension of an array of object references. For example, to create new Thread[7] the following code is used: bipush 7 anewarray <Class "JAVA.lang.Thread"> anewarray can also be used to create the first dimension of a multi-dimensional array. For example, the following array declaration: new int [6] [] is created with the following code: bipush 6 anewarray <Class "[I"> See CONSTANT_Class in the "Class File Format" chapter for information on array class names. multianewarray Allocate new multi-dimensional array Syntax: multianewarray = 197 indexbytel indexbyte2 dimensions Stack: ..., sizel size2...sizen => result Each size must be an integer. Each represents the number of elements in a dimension of the array. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item at that index is resolved. The resulting entry must be an array class of one or more dimensions. dimensions has the following aspects: It must be an integer ≥ 1. It represents the number of dimensions being created. It must be ≤ the number of dimensions of the array class. It represents the number of elements that are popped off the stack. All must be integers greater than or equal to zero. These are used as the sizes of the dimension. For example, to create new int [6] [3] [] the following code is used: bipush 6 bipush 3 multianewarray <Class " [[[I"> 2 If any of the size arguments on the stack is less than zero, a NegativeArraySizeException is thrown. If there is not enough memory to allocate the array, an OutOfMemoryError is thrown. The result is a reference to the new array object. Note: It is more efficient to use newarray or anewarray when creating a single dimension. See CONSTANT_Class in the "Class File Format" chapter for information on array class names. array1ength Get length of array Syntax: arraylength = 190 Stack: ... , objectref => ... , length objectref must be a reference to an array object. The length of the array is determined and replaces objectref on the top of the stack. If the objectref is null, a NullPointerException is thrown. iaload Load integer from array Syntax: iaload = 46 Stack: ... , arrayref, index « ... , value arrayref must be a reference to an array of integers.index must be an integer. The integer value at position number index in the array is retrieved and pushed onto the top of the stack. If arrayref is null a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. Iaload Load long integer from array Syntax: laoad = 47 Stack: ..., arrayref, index => ..., value-wordl, value-word2 arrayref must be a reference to an array of long integers. index must be an integer. The long integer value at position number index in the array is retrieved and pushed onto the top of the stack. If arrayref is null a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. faload Load single float from array Syntax: faload = 48 Stack: ... , arrayref, index * > ... , value arrayref must be a reference to an array of single-precision floating point numbers. index must be an integer. The single-precision floating point number value at position number index in the array is retrieved and pushed onto the top of the stack. If arrayref is null a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. daload Load double float from array Syntax: daload = 49 Stack: ..., arrayref, index -=> ..., value-wordl, value-word2 arrayref must be a reference to an array of double-precision floating point numbers. index must be an integer. The double-precision floating point number value at position number index in the array is retrieved and pushed onto the top of the stack. If arrayref is null a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. aaload Load object reference from array Syn ax: aaload = 50 Stack: ... , arrayref, index «-> ... , value arrayref must be a reference to an array of references to objects. index must be an integer. The object reference at position number index in the array is retrieved and pushed onto the top of the stack. If arrayref is null a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. baload Load signed byte from array. Syntax: baload = 51 Stack: ..., arrayref, index => ..., value arrayref must be a reference to an array of signed bytes. index must be an integer. The signed byte value at position number index in the array is retrieved, expanded to an integer, and pushed onto the top of the stack. If arrayref is null a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. caload Load character from array Syntax: caload = 52 Stack: ..., arrayref, index => ..., alue arrayref must be a reference to an array of characters. index must be an integer. The character value at position number index in the array is retrieved, zero-extended to an integer, and pushed onto the top of the stack. If arrayref is null a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. saload Load short from array Syntax: saload = 53 Stack: ..., arrayref, index => ..., value arrayref must be a reference to an array of short integers, index must be an integer. The ;signed short integer value at position number index in the array is retrieved, expanded to an integer, and pushed onto the top of the stack. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. iastore Store into integer array Syntax: iastore = 79 Stack: ..., arrayref, index, value => ... arrayref must be a .reference to an array of integers, index must be an integer, and value an integer. The integer value is stored at position index in the array. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. Iastore Store into long integer array Syntax: Iastore = 80 Stack: ..., arrayref, index, value-wordl, value-word2 « ... arrayref must be a reference to an array of long integers, index must be an integer, and value a long integer. The long integer value is stored at position index in the array. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of the array, an ArraylndexOutOfBoundsException is thrown. fastore Store into single float array Syntax: fastore = 81 Stack: ..., arrayref, index, value ■> ... arrayref must be an array of single-precision floating point numbers, index must be an integer, and value a single-precision floating point number. The single float value is stored at position index in the array. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. dastore Store into double float array Syntax: dastore = 82 Stack: ..., arrayref, index, value-wordl, value-word2=> ... arrayref must be a reference to an array of double-precision floating point numbers, index must be an integer, and value a double-precision floating point number. The double float value is stored at position index in the array. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. aastore Store into object reference array Syntax: aastore = 83 Stack: ..., arrayref, index, value = ... arrayref must be a reference to an array of references to objects, index must be an integer, and value a reference to an object. The object reference value is stored at position index in the array. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of the array, an ArraylndexOutOfBoundsException is thrown. The actual type of value must be conformable with the actual type of the elements of the array. For example, it is legal to store an instance of class Thread in an array of class Object, but not vice versa. An ArraystoreException is thrown if an attempt is made to store an incompatible object reference. bastore Store into signed byte array Syntax: bastore = 84 Stack: ..., arrayref, index, value => ... arrayref must be a reference to an array of signed bytes, index must be an integer, and value an integer. The integer value is stored at position index in the array. If value is too large to be a signed byte, it is truncated. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. castore Store into character array Syntax: castore = 85 Stack: ..., arrayref, index, value «-> ... arrayref must be an array of characters, index must be an integer, and value an integer. The integer value is stored at position index in the array. If value is too large to be a character, it is truncated. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of [the array an ArraylndexOutOfBoundsException is thrown. sastore Store into short array Syntax: sastore = 86 Stack: ..., array, index, value => ... arrayref must be an array of shorts, index must be an integer, and value an integer. The integer value is stored at position index in the array. If value is too large to be an short, it is truncated. If arrayref is null, a NullPointerException is thrown. If index is not within the bounds of the array an ArraylndexOutOfBoundsException is thrown. 3.7 Stack Instructions nop Do nothing Syntax: Stack: no change Do nothing. pop Pop top stack word Syntax: pop = 87 Stack: ... , any => ... Pop the top word from the stack, pop2 Pop top two stack words Syntax: pop2 = 89 Stack: ...» any2, anyl => ... Pop the top two words from the stack dup Duplicate top stack word Syntax: dup = 89 Stack: ..., any => ..., any,any Duplicate the top word on the stack, dup2 Duplicate top two stack words Syntax: dup2 = 92 Stack: ... , any2,anyl => ... , any2, any1,any2, anyl Duplicate the top two words on the stack. dup xl Duplicate top stack word and put two down Syntax: dup xl = 90 Stack: ..., any2, anyl =>..., anyl, any2, anyl Duplicate the top word on the stack and insert the copy two words down in the stack. dup2_xl Duplicate top two stack words and put two down Syntax: dup xl a 93 Stack: ..., any3, any2, anyl ■> ..., any2, anyl, any3, any2, anyl Duplicate the top two words on the stack and insert the copies two words down in the stack. dup x2 Duplicate top stack word and put three down Syntax: dup x2 = 91 Stack: ..., any3, any2, anyl => ..., anyl, any3, any2, anyl Duplicate the top word on the stack and insert the copy three words down in the stack. dup2_x2 Duplicate top two stack words and put three down Syntax: dup2 x2 = 94 Stack: ..., any4, any3, any2, anyl => ..., any2, anyl, any4, any3, any2, anyl Duplicate the top two words on the stack and insert the copies three words down in the stack. swap Swap top two stack words Syntax: swap = 95 Stack: ..., any2, anyl => ..., any2, anyl Swap the top two elements on the stack. 3.8 Arithmetic Instructions iadd Integer add Syntax: iadd = 96 Stack: ..., valuel, value2 => ..., result valuel and value 2 must be integers. The values are added and are replaced on the stack by their integer sum. Iadd Long integer add Syntax: Iadd = 97 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must be long integers. The values are added and are replaced on the stack by their long integer sum. fadd Single floats add Syntax: fadd - 98 Stack: ..., valuel, value2 => ..., result valuel and value 2 must be single-precision floating point numbers. The values are added and are replaced on the stack by their single-precision floating point sum. dadd Double floats add Syntax: dadd = 99 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must be double-precision floating point numbers. The values are added and are replaced on the stack by their double-precision floating point sum. isub Integer subtract Syntax: isub = 100 Stack: ...» valuel, value2 => ... , result valuel and value 2 must be integers. value2 is subtracted from valuel, and both values are replaced on the stack by their integer difference. Isub Long integer subtract Syntax: Isub = 101 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, resul -word2 valuel and value 2 must be long integers . value2 is subtracted from valuel, and both values are replaced on the stack by their long integer difference. Single float subtract Syntax: fsub = 102 Stack: ..., valuel, value2 => ..., result valuel and value 2 must be single-precision floating point numbers. value2 is subtracted from valuel, and both values are replaced on the stack by their single-precision floating point difference. dsub Double float subtract Syntax: dsub = 103 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must be double-precision floating point numbers. value2 is subtracted from valuel, and both values are replaced on the stack by their double-precision floating point difference. imul Integer multiply Syntax: imul = 104 Stack: ..., valuel, value2 => ..., result valuel and value 2 must be integers. Both values are replaced on the stack by their integer product. Imul Long integer multiply Syntax: imul « 105 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must be long integers. Both values are replaced on the stack by their long integer product. fmul Single float multiply Syntax: fmul m 106 Stack: ..., valuel, value2 => ..., result valuel and value 2 must be single-precision floating point numbers. Both values are replaced on the stack by their single-precision floating point product. dmul Double float multiply Syntax: dmul = 107 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must be double-precision floating point numbers. Both values are replaced on the stack by their double-precision floating point product. idiv Integer divide Syntax: idiv a 108 Stack: ..., valuel, value2 => ..., result valuel and value 2 must be integers, valuel is divided by value2, and both values are replaced on the stack by their integer quotient . The result is truncated to the nearest integer that is between it and 0. An attempt to divide by zero results in a "/ by zero" ArithmeticException being thrown. Idiv Long integer divide Syntax: Idiv = 109 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 «> ..., result-wordl, result-word2 valuel and value 2 must be long integers, valuel is divided by value2, and both values are replaced on the stack by their long integer quotient. The result is truncated to the nearest integer that is between it and 0. An attempt to divide by zero results in a "/ by zero" ArithmeticException being thrown. fdiv Single float divide Syntax: fdiv = 110 Stack: ... , valuel, value2 => ... , result valuel and value 2 must be single-precision floating point numbers, valuel is divided by value2, and both values are replaced on the stack by their single-precision floating point quotient. Divide by zero results in the quotient being NaN. ddiv Double float divide Syntax: ddiv - 111 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must be double-precision floating point numbers, valuel is divided by value2, and both values are replaced on the stack by their double-precision floating point quotient. Divide by zero results in the quotient being NaN. Integer remainder Syntax: irem = 112 Stack: ..., valuel, value2 => ..., result valuel and value 2 must both be integers . valuel is divided by value2, and both values are replaced on the stack by their integer remainder. An attempt to divide by zero results in a "/ by zero" ArithmeticException being thrown. Irem Long integer remainder Syntax: Irem = 113 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must both be long integers. valuel is divided by value2, and both values are replaced on the stack by their long integer remainder. An attempt to divide by zero results in a "/ by zero" ArithmeticException being thrown. frem Single float remainder Syntax: frem = 114 Stack: ..., valuel, value2 => ..., result valuel and value 2 must both be single-precision floating point numbers, valuel is divided by value2, and the quotient is truncated to an integer, and then multiplied by value2. The product is subtracted from valuel. The result, as a single-precision floating point number, replaces both values on the stack. result = valuel - (integral_part (valuel/value2) *value2) , where integral_part () rounds to the nearest integer, with a tie going to the even number. An attempt to divide by zero results in NaN. dre Double float remainder Syntax: drem = 115 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must both be double-precision floating point numbers. valuel is divided by value2, and the quotient is truncated to an integer, and then multiplied by value2. The product is subtracted from valuel. The result, as a double-precision floating point number, replaces both values on the stack. result = valuel - (integral_part (valuel/value2) * value2) , where integral_part () rounds to the nearest integer, with a tie going to the even number. An attempt to divide by zero results in NaN. Integer negate Syntax: ineg = 116 Stack: ..., value ■> ..., result value must be an integer. It is replaced on the stack by its arithmetic negation. Ineg Long integer negate Syntax: Ineg = 117 Stack: ... , value-wordl, value-word2 => ... , result-wordl, result-word2 value must be a long integer. It is replaced on the stack by its arithmetic negation. fneg Single float negate Syntax: fneg = 118 Stack: ..., value=> ..., result value must be a single-precision floating point number. It is replaced on the stack by its arithmetic negation. dneg Double float negate Syntax: dneg = 119 Stack: ... , value-wordl, value-word2 => ... , result-wordl, result-word2 value must be a double-precision floating point number. It is replaced on the stack by its arithmetic negation. 3.9 Logical Instructions ishl Integer shift left Syntax: ishl = 120 Stack: ... , aluel, value2 => ... , result valuel and value 2 must be integers. valuel is shifted left by the amount indicated by the low five bits of value2. The integer result replaces both values on the stack. ishr Integer arithmetic shift right Syntax: ishr = 122 Stack: ..., valuel, value2 => ..., result valuel and value 2 must be integers. valuel is shifted right arithmetically (with sign extension) by the amount indicated by the low five bits of value2. The integer result replaces both values on the stack. iushr Integer logical shift right Syntax: iushr = 124 Stack: ... , valuel, value2 => ... , result valuel and value 2 must be integers. valuel is shifted right logically (with no sign extension) by the amount indicated by the low five bits of value2. The integer result replaces both values on the stack. Ishl Long integer shift left Syntax: Ishl = 121 Stack: ..., valuel-wordl, valuel-word2, value2 => ... , result-wordl, result-word2 valuel must be a long integer and value 2 must be an integer, valuel is shifted left by the amount indicated by the low six bits of value2. The long integer result replaces both values on the stack. Ishr Long integer arithmetic shift right Syntax: Ishr = 123 Stack: ..., valuel-wordl, valuel-word2, value2 => ..., result-wordl, result-word2 valuel must be a long integer and value 2 must be an integer, valuel is shifted right arithmetically (with sign extension) by the amount indicated by the low six bits of value2. The long integer result replaces both values on the stack. Iushr Long integer logical shift right Syntax: Iushr = 125 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel must be a long integer and value 2 must be an integer. valuel is shifted right logically (with no sign extension) by the amount indicated by the low six bits of value2. The long integer result replaces both values on the stack. iand Integer boolean AND Syntax: iand = 126 Stack: ..., valuel, value2 => ..., result valuel and value 2 must both be integers. They are replaced on the stack by their bitwise logical and (conjunction) . land Long integer boolean AND Syntax: land = 127 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must both be long integers. They are replaced on the stack by their bitwise logical and (conjunction) . ior Integer boolean OR Syntax: Stack: ..., valuel, value2 => ..., result valuel and value 2 must both be integers. They are replaced on the stack by their bitwise logical or (disjunction) . lor Long integer boolean OR Syntax: lor 129 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 «> ..., result-wordl, result-word2 valuel and value 2 must both be long integers. They are replaced on the stack by their bitwise logical or (disjunction) . ixor Integer boolean XOR Syntax: ixor = 130 Stack: ..., valuel, value2 => ..., result valuel and value 2 must both be integers. They are replaced on the stack by their bitwise exclusive or (exclusive disjunction) . Ixor Long integer boolean XOR Syntax: Ixor = 131 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-word2 => ..., result-wordl, result-word2 valuel and value 2 must both be long integers, They are replaced on the stack by their bitwise exclusive or (exclusive disjunction) . 3.10 Conversion Operations i21 Integer to long integer conversion Syntax: i21 - 133 Stack: ..., value => ..., result-wordl, result-word2 value must be an integer. It is converted to a long integer. The result replaces value on the stack i2f Integer to single float Syntax: i2f = 134 Stack: ..., value => ..., result value must be an integer. It is converted to a single-precision floating point number. The result replaces value on the stack. i2d Integer to double float Syntax: i2d = 135 Stack: ... , value => ... , result-wordl, result-word2 value must be an integer. It is converted to a double-precision floating point number. The result replaces value on the stack. 12i Long integer to integer Syntax: 12i = 136 Stack: ..., value-wordl, value-word2 => ..., result value must be a long integer. It is converted to an integer by taking the low-order 32 bits. The result replaces value on the stack. 12f Long integer to single float Syntax: 12f = 137 Stack: ..., value-wordl, value-word2 => ..., result value must be a long integer. It is converted to a single-precision floating point number. The result replaces value on the stack. 12d Long integer to double float Syntax: 12d = 138 Stack: ... , value-wordl, value-word2 => ... , result-wordl, result-word2 value must be a long integer. It is converted to a double-precision floating point number. The result replaces value on the stack. f2i Single float to integer Syntax: f2i = 139 Stack: ..., value => ...» result value must be a single-precision floating point number. It is converted to an integer. The result replaces value on the stack. f21 Single float to long integer Syntax: f21 = 140 Stack: ..., value => ..., result-wordl, result-word2 value must be a single-precision floating point number. It is converted to a long integer. The result replaces value on the stack. f2d Single float to double float Syntax: £2d = 141 Stack: ... , value «> ... , result-wordl, result-word2 value must be a single-precision floating point number. It is converted to a double-precision floating point number. The result replaces value on the stack. d2i Double float to integer Syntax: 2di = 142 Stack: ... , value-wordl, value-word2 => ... , result value must be a double-precision floating point number. It is converted to an integer. The result replaces value on the stack. d21 Double float to long integer Syntax: d21 143 Stack: ... , value-wordl, value-word2 => ... , result-wordl, result-word2 value must be a double-precision floating point number. It is converted to a long integer. The result replaces value on the stack. d2f Double float to single float Syntax: 2df 144 Stack: ..., value-wordl, value-word2 => ..., result value must be a double-precision floating point number. It is converted to a single-precision floating point number. If overflow occurs, the result must be infinity with the same sign as value. The result replaces value on the stack. int2byte Integer to signed byte Syntax: int2byte = 157 Stack: ..., value => ..., result value must be an integer. It is truncated to a signed 8-bit result, then sign extended to an integer, The result replaces value on the stack. int2char Integer to char Syntax: int2char = 146 Stack: ..., value => ..., result value must be an integer. It is truncated to an unsigned 16-bit result, then zero extended to an integer. The result replaces value on the stack. int2short Integer to short Syntax: int2short = 147 Stack: ..., value ■> ..., result value must be an integer. It is truncated to a signed 16-bit result, then sign extended to an integer. The result replaces value on the stack. 3.11 Control Transfer Instructions ifeg Branch if equal to 0 Syntax: ifeq = 153 branchbytel branchbyte2 Stack: ..., value => ... value must be an integer. It is popped from the stack. If value is zero, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following the ifeq. ifnull Branch if null Syntax: ifnull = 198 branchbytel branchbyte2 Stack: ..., value => ... value must be a reference to an object. It is popped from the stack. If value is null, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following the ifnull . iflt Branch if less than 0 Syntax: iflt 155 branchbytel branchbyte2 Stack: ... , value => ... value must be an integer. It is popped from the stack. If value is less than zero, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following the iflt. ifle Branch if less than or equal to 0 Syntax: ifle=158 branchbytel branchbyte2 Stack: ..., value => ... value must be an integer. It is popped from the stack. If value is less than or equal to zero, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following the ifle. ifne Branch if not equal to 0 Syntax: ifne=154 branchbytel branchbyte2 Stack: ..., value => ... value must be an integer. It is popped from the stack. If value is not equal to zero, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following the ifne. ifnonnull Branch if not null Syntax: ifnonnull=199 branchbytel branchbyte2 Stack: ..., value => ... value must be a reference to an object. It is popped from the stack. If value is notnull, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following the ifnonnull . ifgt Branch if greater than 0 Syntax: ifft=157 branchbytel branchbyte2 Stack: ..., value => ... value must be an integer. It is popped from the stack. If value is greater than zero, branchbytel and branchbyte2 are used to construct a signed 16-bit offset . Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following the ifgt. ifge Branch if greater than or equal to 0 Syntax: ifge=156 branchbytel branchbyte2 Stack: ..., value => ... value must be an integer. It is popped from the stack. If value is greater than or equal to zero, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following instruction ifge. if_icmpeq Branch if integers equal Syntax: if icmpeq=159 branchbytel branchbyte2 Stack: ... , valuel, value2 => ... valuel and value2 must be integers. They are both popped from the stack. If valuel is equal to value2, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following instruction if_icmpeq. if_icmpne Branch if integers not equal Synta : if_icmpne=160 branchbytel branchbyte2 Stack: ... , valuel, value2 «> ... valuel and value2 must be integers. They are both popped from the stack. If valuel is not equal to value2, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following instruction if_icmpne. if_icmplt Branch if integer less than Syntax: if_icmplt=161 branchbytel branchbyte2 Stack: ... , valuel, value2 => ... valuel and value2 must be integers. They are both popped from the stack. If valuel is less than value2, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following instruction if icmplt. if icmpgt Branch if integer greater than Syntax: if icmpgt=163 branchbytel branchbyte2 Stack: ..., valuel, value2 => ... valuel and value2 must be integers They are both popped from the stack. If valuel is greater than value2, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following instruction if_icmpgt. if_icmple Branch if integer less than or equal to Syntax: if icmple=164 branchbytel branchbyte2 Stack: ..., valuel, value2 => ... valuel and value2 must be integers. They are both popped from the stack. If valuel is less than or equal to value2, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following instruction if icmple. if_icmpge Branch if integer greater than or equal to Syntax: Stack: ... , valuel, value2 => ... valuel and value2 must be integers. They are both popped from the stack. If valuel is greater than or equal to value2, branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following instruction if_icmpge. lcmp Long integer compare Syntax: lcmp=148 Stack: ..., valuel-wordl, valuel-word2,value2-wordl, value2-wordl => ..., result valuel and value2 must be long integers. They are both popped from the stack and compared. If valuel is greater than value2, the integer valuel is pushed onto the stack. If valuel is equal to value2, the value 0 is pushed onto the stack. If valuel is less than value2, the value -1 is pushed onto the stack. fcmpl Single float compare ( 1 on NaN) Syntax: fcmpl=149 Stack: ... , valuel, value2=> ... ,result valuel and value2 must be single-precision floating point numbers. They are both popped from the stack and compared. If valuel is greater than value2, the integer value 1 is pushed onto the stack. If valuel is equal to value2, the value 0 is pushed onto the stack. If valuel is less than value2, the value -1 is pushed onto the stack. If either valuel or value2 is NaN, the value -1 is pushed onto the stack. fcmpg Single float compare (1 on NaN) Syntax: fcmpg=150 Stack: ..., aluel, value2=> ..., result valuel and value2 must be single-precision floating point numbers. They are both popped from the stack and compared. If valuel is greater than value2, the integer value 1 is pushed onto the stack. If valuel is equal to value2, the value 0 is pushed onto the stack. If valuel is less than value2, the value -1 is pushed onto the stack. If either valuel or value2 is NaN, the value 1 is pushed onto the stack. dcmpl Double float compare (-1 on NaN) Syntax: dcmpl-151 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-wordl=> ... , result valuel and value2 must be double-precision floating point numbers. They are both popped from the stack and compared. If valuel is greater than value2, the integer value 1 is pushed onto the stack. If valuel is equal to value2, the value 0 is pushed onto the stack. If valuel is less than value2, the value 1 is pushed onto the stack. If either valuel or value2 is NaN, the value 1 is pushed onto the stack. dcmpg Double float compare (1 on NaN) Syntax: dcmpg=152 Stack: ..., valuel-wordl, valuel-word2, value2-wordl, value2-wordl => ..., result valuel and value2 must be double-precision floating point numbers. They are both popped from the stack and compared. If valuel is greater than value2, the integer value 1 is pushed onto the stack. If valuel is equal to value2, the value 0 is pushed onto the stack. If valuel is less than value2, the value -1 is pushed onto the stack. If either valuel or value2 is NaN, the value 1 is pushed onto the stack. if acmpeq Branch if object references are equal Syntax: Stack: ...,valuel,value2 => ... valuel and value2 must be references to objects. They are both popped from the stack. If the objects referenced are not the same, branchbytel and branchbyte2 are used to construct a signed 16-bit offset . Execution proceeds at that offset from the Address of this instruction. Otherwise execution proceeds at the instruction following the if_acmpeq. if_acmpne Branch if object references not equal Syntax: Stack: ..., valuel, value2 => ... valuel and value2 must be references to objects They are both popped from the stack. If the objects referenced are not the same, branchbytel and branchbyte2 are used to construct a signed 16-bit offset . Execution proceeds at that offset from the address of this instruction. Otherwise execution proceeds at the instruction following instruction if_acmpne. goto Branch always Syntax: goto=167 branchbytel branchbyte2 Stack: no change branchbytel and branchbyte2 are used to construct a signed 16-bit offset. Execution proceeds at that offset from the address of this instruction. goto_w Branch always (wide index) Syntax: Stack: no change branchbytel, branchbyte2, branchbyte3, and branchbyte4 are used to construct a signed 32-bit offset. Execution proceeds at that offset from the address of this instruction. J BT Jump subroutine Syntax : j sr=168 branchbytel branchbyte2 Stack: ...=> ..., return-address branchbytel and branchbyte2 are used to construct a signed 16-bit offset. The address of the instruction immediately following the jsr is pushed onto the stack. Execution proceeds at the offset from the address of this instruction. jsr_w Jump subroutine (wide index) Syntax: Stack: ...=> ..., return-address branchbytel, branchbyte2, brancbbyte3, and branchbyte4 are used to construct a signed 32-bit offset. The address of the instruction immediately following the jsr_w is pushed onto the stack. Execution proceeds at the offset from the address of this instruction. ret Return from subroutine Syntax: ret=169 vindex Stack: no change Local variable vindex in the current JAVA frame must contain a return address. The contents of the local variable are written into the pc. Note that jsr pushes the address onto the stack, and ret gets it out of a local variable. This asymmetry is intentional. ret w Return from subroutine (wide index) Syntax: ret w=209 vindexbytel vindexbyte2 Stack: no change vindexbytel and vindexbyte2 are assembled into an unsigned 16-bit index to a local variable in the current JAVA frame. That local variable must contain a return address. The contents of the local variable are written into the pc. See the ret instruction for more information. 3.12 Function Return ireturn Return integer from function Synta : ireturn=172 Stack: ..., value => [empty] value must be an integer. The value value is pushed onto the stack of the previous execution environment . Any other values on the operand stack are discarded. The interpreter then returns control to its caller. Ireturn Return long integer from function Syntax: lreturn=173 Stack: ..., value-wordl, value-word2 => [empty] value must be a long integer. The value value is pushed onto the stack of the previous execution environment. Any other values on the operand stack are discarded. The interpreter then returns control to its caller. freturn Return single float from function Syntax: freturn=174 Stack: ..., value=> [empty] value must be a single-precision floating point number. The value value is pushed onto the stack of the previous execution environment . Any other values on the operand stack are discarded. The interpreter then returns control to its caller. dreturn Return double float from function Syntax: dreturn=175 Stack: ..., value-wordl, value-word2 => [empty] value must be a double-precision floating point number. The value value is pushed onto the stack of the previous execution environment. Any other values on the operand stack are discarded. The interpreter then returns control to its caller. areturn Return object reference from function Syntax: areturn=176 Stack: ..., value => [empty] value must be a reference to an object. The value value is pushed onto the stack of the previous execution environment . Any other values on the operand stack are discarded. The interpreter then returns control to its caller. return Return (void) from procedure Syntax: return=177 Stack: ...=> [empty] All values on the operand stack are discarded. The interpreter then returns control to its caller. breakpoint Stop and pass control to breakpoint handler Syntax: breakpoint=202 Stack: no change 3.13 Table Jumping tableswitch Access jump table by index and jump Syntax: low4 highl high2 high3 high4 jump offsets... Stack: ... , index=> ... tableswitch is a variable length instruction. Immediately after the tableswitch opcode, between zero and three 0' s are inserted as padding so that the next byte begins at an address that is a multiple of four. After the padding follow a series of signed 4-byte quantities: default-offset, low, high, and then high-low+1 further signed 4-byte offsets. The high-low+1 signed 4-byte offsets are treated as a 0-based jump table. The index must be an integer. If index is less than low or index is greater than high, then default-offset is added to the address of this instruction. Otherwise, low is subtracted from index, and the index-low' th element of the jump table is extracted, and added to the address of this instruction. lookupswitch Access jump table by key match and jump Syntax: lookupswitch=171 ...0-3 byte pad.. default-offsetl default-offset2 default-offset3 default-offset4 npairβl npairs2 npairs3 npairs4 .match-offset pairs... Stack: ..., key=> ... lookupswitch is a variable length instruction. Immediately after the lookupswitch opcode, between zero and three O's are inserted as padding so that the next byte begins at an address that is a multiple of four. Immediately after the padding are a series of pairs of signed 4-byte quantities. The first pair is special. The first item of that pair is the default offset, and the second item of that pair gives the number of pairs that follow. Each subsequent pair consists of a match and an offset. The key must be an integer. The integer key on the stack is compared against each of the matches. If it is equal to one of them, the offset is added to the address of this instruction. If the key does not match any of the matches, the default offset is added to the address of this instruction. 3.14 Manipulating Object Fields putfield Set field in object Syntax: putfield=181 indexbytel indexbyte2 Stack: ..., objectref, value=> ... OR Stack: ..., objectref, value-wordl, value-word2=> ... indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant pool item will be a field reference to a class name and a field name. The item is resolved to a field block pointer which has both the field width (in bytes) and the field offset (in bytes) . The field at that offset from the start of the object referenced by objectref will be set to the value on the top of the stack. This instruction deals with both 32-bit and 64-bit wide fields. If object ref is null, aNullPointerException is generated. If the specified field is a static field, anlncompatibleClassChangeError is thrown. getfield Fetch field from object Syntax: getfield=180 indexbytel indexbyte2 Stack: ..., objectref=> ...,value OR Stack: ..., objectref=> ..., value-wordl, value-word2 indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant pool item will be a field reference to a class name and a field name. The item is resolved to a field block pointer which has both the field width (in bytes) and the field offset (in bytes) . objectref must be a reference to an object. The value at offset into the object referenced by objectref replaces objectref on the top of the stack. This instruction deals with both 32-bit and 64-bit wide fields. If objectref is null, a NullPointerException is generated. If the specified field is a static field, an IncompatibleClassChangeError is thrown. putstatic Set static field in class Syntax: putstatic-179 indexbytel indexbyte2 Stack: .. • , value=> ... OR Stack: ... , value-wordl, value-word2=> ... indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant pool item will be a field reference to a static field of a class. That field will be set to have the value on the top of the stack. This instruction works for both 32-bit and 64-bit wide fields. If the specified field is a dynamic field, an IncompatibleClassChangeError is thrown. getstatic Get static field from class Syntax: getstatic=178 indexbytel indexbyte2 Stack: ..., => ..., value OR Stack: ... , => ... , value-wordl, value-word2 indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant pool item will be a field reference to a static field of a class. This instruction deals with both 32-bit and 64-bit wide fields. If the specified field is a dynamic field, an IncompatibleClassChangeError is generated. 3.15 Method Invocation There are four instructions that implement method invocation. invokevirtual Invoke an instance method of an object, dispatching based on the runtime (virtual) type of the object. This is the normal method dispatch in JAVA, invokenonvirtual Invoke an instance method of an object, dispatching based on the compile-time (non-virtual) type of the object. This is used, for example, when the keywordsuper or the name of a superclass is used as a method qualifier. invokestatic Invoke a class (static) method in a named class, invokeinterface Invoke a method which is implemented by an interface, searching the methods implemented by the particular run-time object to find the appropriate method. invokevirtual Invoke instance method, dispatch based on run-time type Syntax: invokevirtual=182 indexbytel indexbyte2 Stack: ..., objectref, [argl, [arg2 ...]], ...=> The operand stack must contain a reference to an object and some number of arguments.indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class . The item at that index in the constant pool contains the complete method signature. A pointer to the object's method table is retrieved from the object reference. The method signature is looked up in the method table. The method signature is guaranteed to exactly match one of the method signatures in the table. The result of the lookup is an index into the method table of the named class, which is used with the object's dynamic type to look in the method table of that type, where a pointer to the method block for the matched method is found. The method block indicates the type of method (native, synchronized, and so on) and the number of arguments expected on the operand stack. If the method is marked synchronized the monitor associated with objectref is entered. The objectref and arguments are popped off this method's stack and become the initial values of the local variables of the new method. Execution continues with the first instruction of the new method. If the object reference on the operand stack is null, a NullPointerException is thrown. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. invokenonvirtual Invoke instance method, dispatching based on compile-time type Syntax: invokenonvirtual = 183 indexbytel indexbyte2 Stack: ..., objectref, [argl, [arg2 ...]], ... => The operand stack must contain a reference to an object and some number of arguments .indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item at that index in the constant pool contains a complete method signature and class. The method signature is looked up in the method table of the class indicated. The method signature is guaranteed to exactly match one of the method signatures in the table. The result of the lookup is a method block. The method block indicates the type of method (native, synchronized, and so on) and the number of arguments (nargs) expected on the operand stack. If the method is marked synchronized the monitor associated with objectref is entered. The objectref and arguments are popped off this method's stack and become the initial values of the local variables of the new method. Execution continues with the first instruction of the new method. If the object reference on the operand stack is null, a NullPointerException is thrown. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. invokestatic Invoke a class (static) method Syntax: invokestatis 184 indexbytel indexbyte2 Stack: ..., [argl, [arg2 ...]], ... => ... The operand stack must contain some number of arguments. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item at that index in the constant pool contains the complete method signature and class . The method signature is looked up in the method table of the class indicated. The method signature is guaranteed to exactly match one of the method signatures in the class's method table. The result of the lookup is a method block. The method block indicates the type of method (native, synchronized, and so on) and the number of arguments (nargs) expected on the operand stack. If the method is marked synchronized the monitor associated with the class is entered. The arguments are popped off this method's stack and become the initial values of the local variables of the new method. Execution continues with the first instruction of the new method. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. invokeinterface Invoke interface method Syntax: invokeinterface = 185 indexbytel indexbyte2 nargs reserved Stack: ..., objectref, [argl, [arg2 ...]] => The operand stack must contain a reference to an object and nargs-1 arguments. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class . The item at that index in the constant pool contains the complete method signature. A pointer to the object's method table is retrieved from the object reference. The method signature is looked up in the method table. The method signature is guaranteed to exactly match one of the method signatures in the table. The result of the lookup is a method block. The method block indicates the type of method (native, synchronized, and so on) but unlike invokevirtual and invokenonvirtual, the number of available arguments (nargs) is taken from the bytecode. If the method is markedsynchronized the monitor associated with objectref is entered. The objectref and arguments are popped off this method's stack and become the initial values of the local variables of the new method. Execution continues with the first instruction of the new method. If the objectref on the operand stack is null, a NullPointerException is thrown. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. 3.16 Exception Handling athrow Throw exception or error Syntax: athrow = 191 Stack: ..., objectref => [undefined] objectref must be a reference to an object which is a subclass of Throwable, which is thrown. The current JAVA stack frame is searched for the most recent catch clause that catches this class or a superclass of this class. If a matching catch list entry is found, the pc is reset to the address indicated by the catch-list entry, and execution continues there. If no appropriate catch clause is found in the current stack frame, that frame is popped and the object is rethrown. If one is found, it contains the location of the code for this exception. The pc is reset to that location and execution continues. If no appropriate catch is found in the current stack frame, that frame is popped and the objectref is rethrown. If objectref is null, then a NullPointerException is thrown instead. 3.17 Miscellaneous Object Operations new Create new object Syntax: new = 187 indexbytel indexbyte2 Stack: ... => ..., objectref indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item at that index must be a class name that can be resolved to a class pointer, class. A new instance of that class is then created and a reference to the object is pushed on the stack. checkcast Make sure object is of given type Syntax: checkcast = 192 indexbytel indexbyte2 Stack: ..., objectref => ..., objectref indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The string at that index of the constant pool is presumed to be a class name which can be resolved to a class pointer, class. objectref must be a reference to an object. checkcast determines whether objectref can be cast to be a reference to an object of class class. A null objectref can be cast to any class. Otherwise the referenced object must be an instance of class or one of its superclasses. If objectref can be cast to class execution proceeds at the next instruction, and the objectref remains on the stack. If objectref cannot be cast to class, a ClassCastException is thrown. in tanceof Determine if an object is of given type Syntax: instanceof = 193 indexbytel indexbyte2 Stack: ..., objectref «> ..., result indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The string at that index of the constant pool is presumed to be a class name which can be resolved to a class pointer, class. objectref must be a reference to an object. instanceof determines whether objectref can be cast to be a reference to an object of the class class, This instruction will overwrite objectref with 1 if objectref is an instance of class or one of its superclasses. Otherwise, objectref is overwritten by 0. If objectref is null, it's overwritten by 0. 3.18 Monitors monitorenter Enter monitored region of code Syntax: monitorenter = 194 Stack: ..., objectref => ... objectref must be a reference to an object. The interpreter attempts to obtain exclusive access via a lock mechanism to objectref. If another thread already has objectref locked, than the current thread waits until the object is unlocked. If the current thread already has the object locked, then continue execution. If the object is not locked, then obtain an exclusive lock. If objectref is null, then a NullPointerException is thrown instead. monitorexit Exit monitored region of code Syntax: monitorexit = 195 Stack: ..., objectref ■> ... objectref must be a reference to an object. The lock on the object released. If this is the last lock that this thread has on that object (one thread is allowed to have multiple locks on a single object) , then other threads that are waiting for the object to be available are allowed to proceed. If objectref is null, then a NullPointerException is thrown instead. Appendix A: An Optimization The following set of pseudo-instructions suffixed by _quick are variants of JAVA virtual machine instructions. They are used to improve the speed of interpreting bytecodes. They are not part of the virtual machine specification or instruction set, and are invisible outside of an JAVA virtual machine implementation. However, inside a virtual machine implementation they have proven to be an effective optimization. A compiler from JAVA source code to the JAVA virtual machine instruction set emits only non-_quick instructions. If the _quick pseudo-instructions are used, each instance of a non-_quick instruction with a _quick variant is overwritten on execution by its_quick variant . Subsequent execution of that instruction instance will be of the_quick variant . In all cases, if an instruction has an alternative version with the suffix_quick, the instruction references the constant pool. If the_quick optimization is used, each non-_quick instruction with a_quick variant performs the following: Resolves the specified item in the constant pool; Signals an error if the item in the constant pool could not be resolved for some reason; Turns itself into the _quick version of the instruction. The instructions putstatic, getstatic, putfield, and getfield each have two _quick versions; and Performs its intended operation. This is identical to the action of the instruction without the _quick optimization, except for the additional step in which the instruction overwrites itself with its _quick variant. The _quick variant of an instruction assumes that the item in the constant pool has already been resolved, and that this resolution did not generate any errors. It simply performs the intended operation on the resolved item. Note : some of the invoke methods only support a single-byte offset into the method table of the object; for objects with 256 or more methods some invocations cannot be "quicked" with only these bytecodes. This Appendix doesn't give the opcode values of the pseudo-instructions, since they are invisible and subject to change. A.l Constant Pool Resolution When the class is read in, an array constant_pool [] of size n constants is created and assigned to a field in the class.constant_pool [0] is set to point to a dynamically allocated array which indicates which fields in the constant_pool have already been resolved.constant_pool [1] through constant_pool [nconstants - 1] are set to point at the "type" field that corresponds to this constant item. When an instruction is executed that references the constant pool, an index is generated, and constant_pool [0] is checked to see if the index has already been resolved. If so, the value of constant_pool [index] is returned. If not, the value of constant_pool [index] is resolved to be the actual pointer or data, and overwrites whatever value was already in constant_pool [index] . A.2 Pushing Constants onto the Stack ( quick variants) ldcl_quick Push item from constant pool onto stack Syntax: ldcl quick indexbytel Stack: ...=>...,item indexbytel is used as an unsigned 8-bit index into the constant pool of the current class. The item at that index is pushed onto the stack. ldc2_quick Push item from constant pool onto stack Syntax: ldc2 quick indexbytel indexbyte2 Stack: ...=>...,item indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant at that index is resolved and the item at that index is pushed onto the stack. Idc2w_quick Push long integer or double float from constant pool onto stack Syntax: ldc2w_quick indexbytel indexbyte2 Stack: ...=>... ,constant-wordl,constant-word2 indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant at that index is pushed onto the stack. A.3 Managing Arrays (_quick variants) anewarray_quick Allocate new array of references to objects Syntax: anewarray quick indexbytel indexbyte2 Stack: ... ,size=>result size must be an integer. It represents the number of elements in the new array. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The entry must be a class. A new array of the indicated class type and capable of holding size elements is allocated, and result is a reference to this new array. Allocation of an array large enough to contain size items of the given class type is attempted. All elements of the array are initialized to zero. If size is less than zero, a NegativeArraySizeException is thrown. If there is not enough memory to allocate the array, an OutOfMemoryError is thrown. multianewarray_quick Allocate new multi-dimensional array Syntax: multianewarray quick indexbytel indexbyte2 dimensions Stack: ... ,sizel,size2, ...sizen=>result Each size must be an integer. Each represents the number of elements in a dimension of the array. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The resulting entry must be a class. dimensions has the following aspects: It must be an integer ≥l . It represents the number of dimensions being created. It must be ≤ the number of dimensions of the array class. It represents the number of elements that are popped off the stack. All must be integers greater than or equal to zero. These are used as the sizes of the dimension. If any of the size arguments on the stack is less than zero, a NegativeArraySizeException is thrown. If there is not enough memory to allocate the array, an OutOfMemoryError is thrown. The result is a reference to the new array object. A.4 Manipulating Object Fields (_quick variants) putfield_quick Set field in object Syntax: putfield2_quick offset unused Stack: ... ,objectref,value=>... objectref must be a reference to an object. value must be a value of a type appropriate for the specified field. offset is the offset for the field in that object. value is written at offset into the object. Both objectref and value are popped from the stack. If objectref is null, a NullPointerException is generated. putfield2_quick Set long integer or double float field in object Syntax; putfield2_quick offset unused Stack: ... ,objectref,value-wordl,value-word2=>... objectref must be a reference to an object, value must be a value of a type appropriate for the specified field. offset is the offset for the field in that object. value is written at offset into the object. Both objectref and value are popped from the stack. If objectref is null, a NullPointerException is generated. getfield_quick Fetch field from object Syntax: getfield2 quick offset unused Stack: ... ,objectref■>... ,value objectref must be a handle to an object. The value at offset into the object referenced by objectref replaces objectref on the top of the stack. If objectref is null, a NullPointerException is generated. getfield2_quick Fetch field from object Syntax: getfield2 quick offset unused Stack: ... ,objectref=>... ,value-wordl,value-word2 objectref must be a handle to an object. The value at offset into the object referenced by objectref replaces objectref on the top of the stack. If objectref is null, a NullPointerException is generated. putstatic_quick Set static field in class Syntax: putstatic_quick indexbytel indexbyte2 Stack: ... ,value=>... indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant pool item will be a field reference to a static field of a class.value must be the type appropriate to that field. That field will be set to have the value value. putstatic2_quick Set static field in class Syntax: putstatic2 quick indexbytel indexbyte2 Stack: ... ,value-wordl,value-word2=>... indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant pool item will be a field reference to a static field of a class. That field must either be a long integer or a double precision floating point number, value must be the type appropriate to that field. That field will be set to have the value value. getstatic_quick Get static field from class Syntax: getstatic quick indexbytel indexbyte2 Stack: ...,=>...,value indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant pool item will be a field reference to a static field of a class. The value of that field will replace handle on the stack. getstatic2_quick Get static field from class Syntax: getstatic2 quick indexbytel indexbyte2 Stack: ...,=>... ,value-wordl, alue-word2 indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The constant pool item will be a field reference to a static field of a class. The field must be a long integer or a double precision floating point number. The value of that field will replace handle on the stack A.5 Method Invocation (_quick variants) invokevirtual_quick Invoke instance method, dispatching based on run-time type Syntax: invokevirtual quick offset nargs Stack: ... ,objectref, [argl, [arg2...]]=>... The operand stack must contain objectref, a reference to an object and nargs-1 arguments. The method block at offset in the object's method table, as determined by the object's dynamic type, is retrieved. The method block indicates the type of method (native, synchronized, etc.) . If the method is marked synchronized the monitor associated with the object is entered. The base of the local variables array for the new JAVA stack frame is set to point to objectref on the stack, making objectref and the supplied arguments (argl,arg2, ... ) the first nargs local variables of the new frame. The total number of local variables used by the method is determined, and the execution environment of the new frame is pushed after leaving sufficient room for the locals. The base of the operand stack for this method invocation is set to the first word after the execution environment. Finally, execution continues with the first instruction of the matched method. If objectref is null, a NullPointerException is thrown. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. invokevirtualobject_quick Invoke instance method of class JAVA.lang.Object, specifically for benefit of arrays Syntax: invokevirtualobject_quick offset Stack: ... ,objectref, [argl, [arg2...]]=>... The operand stack must contain objectref, a reference to an object or to an array and nargs-1 arguments. The method block at offset in JAVA. lang.Object' s method table is retrieved. The method block indicates the type of method (native, synchronized, etc.) . If the method is marked synchronized the monitor associated with handle is entered. The base of the local variables array for the new JAVA stack frame is set to point to objectref on the stack, making objectref and the supplied arguments (argl,arg2, ... ) the first nargs local variables of the new frame. The total number of local variables used by the method is determined, and the execution environment of the new frame is pushed after leaving sufficient room for the locals. The base of the operand stack for this method invocation is set to the first word after the execution environment. Finally, execution continues with the first instruction of the matched method. If objectref is null, a NullPointerException is thrown. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. invokenonvirtual_quick Invoke instance method, dispatching based on compile-time type Syntax: invokenonvirtual quick indexbytel indexbyte2 Stack: ... ,objectref, [argl, [arg2...]]=>. The operand stack must contain objectref, a reference to an object and some number of arguments. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item at that index in the constant pool contains a method slot index and a pointer to a class. The method block at the method slot index in the indicated class is retrieved. The method block indicates the type of method (native, synchronized, etc.) and the number of arguments (nargs) expected on the operand stack. If the method is marked synchronized the monitor associated with the object is entered. The base of the local variables array for the new JAVA stack frame is set to point to objectref on the stack, making objectref and the supplied arguments (argl, arg2,...) the first nargs local variables of the new frame. The total number of local variables used by the method is determined, and the execution environment of the new frame is pushed after leaving sufficient room for the locals. The base of the operand stack for this method invocation is set to the first word after the execution environment. Finally, execution continues with the first instruction of the matched method. If objectref is null, a NullPointerException is thrown. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. invokestatic_quick Invoke a class (static) method Syntax: invokestatic_quick indexbytel indexbyte2 Stack: ..., [argl, [arg2...]]=>... The operand stack must contain some number of arguments. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item at that index in the constant pool contains a method slot index and a pointer to a class. The method block at the method slot index in the indicated class is retrieved. The method block indicates the type of method (native, synchronized, etc.) and the number of arguments (nargs) expected on the operand stack. If the method is marked synchronized the monitor associated with the method's class is entered. The base of the local variables array for the new JAVA stack frame is set to point to the first argument on the stack, making the supplied arguments (argl,arg2, ... ) the first nargs local variables of the new frame. The total number of local variables used by the method is determined, and the execution environment of the new frame is pushed after leaving sufficient room for the locals. The base of the operand stack for this method invocation is set to the first word after the execution environment. Finally, execution continues with the first instruction of the matched method. If the object handle on the operand stack is null, a NullPointerException is thrown. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. invokeinterface_quick Invoke interface method Syntax: invokeinterface quick idbytβl idbyte2 nargs Stack: ... ,objectref, [argl, [arg2...]]=>... The operand stack must contain objectref, a reference to an object, and nargs-1 arguments. idbytel and idbyte2 are used to construct an index into the constant pool of the current class. The item at that index in the constant pool contains the complete method signature. A pointer to the object's method table is retrieved from the object handle. The method signature is searched for in the object's method table. As a short-cut, the method signature at slot guess is searched first. If that fails, a complete search of the method table is performed. The method signature is guaranteed to exactly match one of the method signatures in the table. The result of the lookup is a method block. The method block indicates the type of method (native, synchronized, etc.) but the number of available arguments (nargs) is taken from the bytecode. If the method is marked synchronized the monitor associated with handle is entered. The base of the local variables array for the new JAVA stack frame is set to point to handle on the stack, making handle and the supplied arguments (argl,arg2, ... ) the first nargs local variables of the new frame. The total number of local variables used by the method is determined, and the execution environment of the new frame is pushed after leaving sufficient room for the locals . The base of the operand stack for this method invocation is set to the first word after the execution environment. Finally, execution continues with the first instruction of the matched method. If objectref is null, a NullPointerException is thrown. If during the method invocation a stack overflow is detected, a StackOverflowError is thrown. guess is the last guess. Each time through, guess is set to the method offset that was used. A.6 Miscellaneous Object Operations ( quick variants) new_quick Create new object Syntax: new quick indexbytel indexbyte2 Stack: ...=>... ,objectref indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item at that index must be a class . A new instance of that class is then created and objectref, a reference to that object is pushed on the stack. checkcast quick Make sure object is of given type Syntax: checkcast quick indexbytel indexbyte2 Stack: ... ,objectref=>... ,objectref objectref must be a reference to an object. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The object at that index of the constant pool must have already been resolved. checkcast then determines whether objectref can be cast to a reference to an object of class class. A null reference can be cast to any class, and otherwise the superclasses of objectref's type are searched for class. If class is determined to be a superclass of objectref's type, or if objectref is null, it can be cast to objectref cannot be cast to class, a ClassCastException is thrown. instanceof_quiσk Determine if object is of given type Syntax: instanceof quick indexbytel indexbyte2 Stack: ... ,objectref=>... , esult objectref must be a reference to an object. indexbytel and indexbyte2 are used to construct an index into the constant pool of the current class. The item of class class at that index of the constant pool must have already been resolved. Instance of determines whether objectref can be cast to an object of the class class. A null objectref can be cast to any class, and otherwise the superclasses of objectref's type are searched for class. If class is determined to be a superclass of objectref's type, result is 1 (true) . Otherwise, result is 0 (false) . If handle is null, result is 0 (false) .

Claims: CLAIMS What is claimed is : 1. An array bounds checking apparatus configured to verify that each access of an array is within a maximum array size boundary value and a minimum array size boundary value, the apparatus comprising: an associative memory element configured to store and retrieve array size values which are associated with one of a plurality of array access instructions, each array access instruction referencing a value of an element within the array; a first comparison element, operatively coupled to an output section of the associative memory element, the first comparison element configured to compare a predetermined maximum array size value and the value of the referenced element and to provide a maximum violation signal if the value of the referenced element is greater than the predetermined maximum array size value; and a second comparison element, operatively coupled to the output section of the associative memory element, the second comparison element configured to compare a predetermined minimum array size value and the value of the referenced element and to provide minimum violation signal if the value of the referenced element is less than the predetermined minimum army size value. 2. The array bounds checking apparatus of Claim 1 further comprising: an exception element, operatively coupled to the first and second comparison elements, the exception element configured to provide an exception signal in response to receipt of either the maximum violation signal or the minimum violation signal. 3. The array bounds checking apparatus of Claim 1 wherein the associative memory element further comprises: a first memory section that includes a first plurality of memory locations configured to receive and store a plurality of array reference entries, wherein each one of the first plurality of memory locations is configured to store one of the plurality of array reference entries, and wherein each one of the plurality of array reference entries corresponds to one of the plurality of array access instructions; an input section, operatively coupled to the first memory section, configured to receive an array access instruction identifier and to simultaneously compare the array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction; a second memory section that includes a second plurality of memory locations configured to receive and store a plurality of array size values, wherein each one of the second plurality of memory locations is configured to store one of the array size values and is associated with one of the first plurality of memory locations, and further wherein each one of the plurality of array size values is associated with one of the plurality of array access instructions and comprises a maximum array size value and a minimum array size value and, further wherein the output section of the associative memory element is operatively coupled to the second memory section and configured to provide, as an array size output value, one of the plurality of array size values stored in one of the second plurality of memory locations which is associated with one of the first plurality of memory locations in which is stored one of the plurality of array reference entries that matches the array access instruction identifier. 4. An array bounds checking apparatus configured to verify that the size of an information array is within a maximum array size boundary value and a minimum array size boundary value, the apparatus comprising: (a) an associative memory element configured to store and retrieve array size values, wherein the array size values are associated with one of a plurality of array access instructions, each army access instruction referencing a value of an element within the array, the associative memory element including: (i) a first memory section that includes a first plurality of memory locations configured to receive and store a plurality of array reference entries, wherein each one of the first plurality of memory locations is configured to store one of the plurality of array reference entries, and further wherein each one of the plurality of array reference entries corresponds to one of the plurality of array access instructions; (ii) a second memory section that includes a second plurality of memory locations configured to receive and store a plurality of array size values, wherein each one of the second plurality of memory locations is configured to store one of the array size values and is associated with one of the first plurality of memory locations, and further wherein each one of the plurality of array size values is associated with one of the plurality of array access instructions and comprises a maximum array size value and a minimum array size value; (iii) an input section, operatively coupled to the first memory section and configured to receive an array access instruction identifier and to simultaneously compare the array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction; and (iv) an output section, operatively coupled to the second memory section, configured to provide, as an array size output value, one of the plurality of array size values stored in one of the second plurality of memory locations which is associated with one of the first plurality of memory locations in which is stored one of the plurality of array reference entries that matches the array access instruction identifier; (b) a first comparison element, operatively coupled to the output section and configured to compare the maximum array size output value and the value of the referenced element and to provide a maximum violation signal if the value of the referenced element is greater than the maximum array size output value; (c) a second comparison element, operatively coupled to the output section and configured to compare the minimum array size output value and the value of the referenced element and to provide a minimum violation signal if the value of the referenced element is less than the minimum array size output value; and (d) an exception element, operatively coupled to the first and second comparison elements and configured to provide an exception output signal in response to receipt of either the maximum violation signal or the minimum violation signal . 5. A method of verifying that the size of an information array is within a maximum array size boundary value and a minimum array size boundary value, the method comprising: storing a plurality of array reference entries in a first memory section that includes a first plurality of memory locations, wherein each one of the first plurality of memory locations is configured to store one of the plurality of array reference entries, and further wherein each one of the plurality of array reference entries corresponds to one of a plurality of array access instructions; storing a plurality of array size values in a second memory section that includes a second plurality of memory locations, wherein each one of the second plurality of memory locations is configured to store one of the array size values and is associated with one of the first plurality of memory locations, and further wherein each one of the plurality of array size values is associated with one of the plurality of array access instructions and comprises a maximum array size value and minimum array size value; simultaneously comparing an array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction; providing as an array size output value one of the plurality of array size values stored in one of the second plurality of memory locations which is associated with one of the first plurality of memory locations in which is stored one of the plurality of array reference entries that matches the array access instruction identifier; comparing the maximum array size output value and the value of the referenced element and generating a maximum violation signal if the value of the referenced element is greater than the maximum array size output value; comparing the minimum array size output value and the value of the referenced element and generating a minimum violation signal if the value of the referenced element is less than the minimum array size Output value; and providing an exception output signal in response to generation of either the maximum violation signal or the minimum violation signal. 6. A method to verify that the size of an information array is within a maximum array size boundary value and a minimum array size boundary value, the method comprising: providing an associative memory element configured to store and retrieve array size values which are associated with one of a plurality of array access instructions, each array access instruction referencing a value of an element within the array; providing a first comparison element, operatively coupled to an output section of the associative memory element, the first comparison element configured to compare a predetermined maximum array size value and the value of the referenced element and to provide a maximum violation signal if the value of the referenced element is greater than the predetermined maximum array size value; providing a second comparison element, operatively coupled to the output section of the associative memory element, the second comparison element configured to compare a predetermined minimum array size value and the value of the referenced element and to provide a minimum violation signal if the value of the referenced element is less than the predetermined minimum array size value; and providing an exception element, operatively coupled to the first and second comparison elements, the exception element configured to provide an exception signal in response to receipt of either the maximum violation signal or the minimum violation signal . 7. The method of Claim 6 further comprising: providing a first memory section in the associative memory element that includes a first plurality of memory locations configured to receive and store a plurality of array reference entries, wherein each one of the first plurality of memory locations is configured to store one of the plurality of array reference entries, and wherein each one of the plurality of array reference entries corresponds to one of the plurality of array access instructions; providing an input section, operatively coupled to the first memory section, configured to receive an array access instruction identifier and to simultaneously compare the array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction; providing a second memory section in the associative memory element that includes a second plurality of memory locations configured to receive and store a plurality of array size values, wherein each one of the second plurality of memory locations is configured to store one of the array size values and is associated with one of the first plurality of memory locations, and further wherein each one of the plurality of array size values is associated with one of the plurality of array access instructions and comprises a maximum array size value and a minimum array size value, and further wherein: the output section of the associative memory element is operatively coupled to the second memory section and configured to provide, as an array size output value, one of the plurality of array size values stored in one of the second plurality of memory locations which is associated with one of the first plurality of memory locations in which is stored one of the plurality of array reference entries that matches the array access instruction identifier. 8. A method of providing an array boundary checking apparatus configured to verify that the size of an information array is within a maximum array size boundary value and a minimum array size boundary value, the method comprising: (a) providing an associative memory element configured to store and retrieve a plurality of array size values, wherein each one of the array size values is associated with one of a plurality of array access instructions, the associative memory element including: (i) a first memory section that includes a first plurality of memory locations configured to receive and store a plurality of array reference entries, wherein each one of the first plurality of memory locations is configured to store one of the plurality of array reference entries, and further wherein each one of the plurality of array reference entries corresponds to one of the plurality of array access instructions; (ii) a second memory section that includes a second plurality of memory locations configured to receive and store a plurality of array size values, wherein each one of the second plurality of memory locations is configured to store one of the array size values and is associated with one of the first plurality of memory locations, and further wherein each one of the plurality of array size values is associated with one of the plurality of array access instructions and comprises a maximum array size value and a minimum array size value; (iii) an input section operatively coupled to the first memory section and configured to receive an array access instruction identifier and to simultaneously compare the array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction; and (iv) an output section operatively coupled to the second memory section and configured to provide as an array size output value one of the plurality of array size values stored in one of the second plurality of memory locations which is associated with one of the first plurality of memory locations in which is stored one of the plurality of array reference entries that matches the array access instruction identifier; (b) providing a first comparison element operatively coupled to the output section, configured to compare the value of the referenced element and the maximum array size output value and to provide a maximum violation signal if the value of the referenced element is greater than the maximum array size output value; (c) providing a second comparison element operatively coupled to the output section and configured to compare the value of the referenced element and the minimum array size output value and to provide a minimum violation signal if the value of the referenced element is less than the minimum array size boundary value; and (d) providing an exception element operatively coupled to the first and second comparison elements and configured to provide an exception output signal in response to receipt of either the maximum violation signal or the minimum violation signal . 9. A computer system comprising: a translation unit configured to receive and translate a software program and, in accordance with the software program, provide a plurality of translated instructions and a plurality of instruction identifiers, wherein each one of the instruction identifiers corresponds to one of the plurality of translated instructions, the plurality of translated instructions including a plurality of array access instructions; an execution unit configured to receive, in accordance with the plurality of instruction identifiers, the plurality of translated instructions, and, in accordance therewith, execute received translated instructions; an associative memory element configured to store and retrieve array size values which are associated with one of a plurality of array access instructions, each array access instruction referencing a value of an element within the array; a first comparison element, operatively coupled to an output section of the associative memory element, the first comparison element configured to compare a predetermined maximum array size value and the value of the referenced element and to provide a maximum violation signal if the value of the referenced element is greater than the predetermined maximum array size value; a second comparison element operatively coupled to the output section of the associative memory element, the second comparison element configured to compare a predetermined minimum array size value and the value of the referenced element and to provide a minimum violation signal if the value of the referenced element is less than the predetermined minimum array size value; and an exception element operatively coupled to the first and second comparison elements and the execution unit, the exception element configured to provide an exception signal to the execution unit in response to receipt of either the maximum violation signal or the minimum violation signal. 10. The computer system of Claim 9 wherein the associative memory element further comprises: a first memory section that includes a first plurality of memory locations configured to receive and store a plurality of army reference entries, wherein each one of the first plurality of memory locations is configured to store one of the plurality of array reference entries, and further wherein each one of the plurality of array reference entries corresponds to one of the plurality of array access instructions; an input section operatively coupled to the first memory section and configured to receive an array access instruction identifier and to simultaneously compare the array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction; a second memory section that includes a second plurality of memory locations configured to receive and store a plurality of array size values, wherein each one of the second plurality of memory locations is configured to store one of the array size values and is associated with one of the first plurality of memory locations, and further wherein each one of the plurality of array size values is associated with one of the plurality of array access instructions and comprises a maximum array size value and a minimum array size value, and further wherein the output section of the associative memory element is operatively coupled to the second memory section and configured to provide, as an array size output value, one of the plurality of array size values stored in one of the second plurality of memory locations which is associated with one of the first plurality of memory locations in which is stored one of the plurality of array reference entries that matches the array access instruction identifier. 11. A computer system comprising: a translation unit configured to receive and translate a software program and, in accordance with the software program, provide a plurality of translated instructions and a plurality of instruction identifiers, wherein each one of the instruction identifiers corresponds to one of the plurality of translated instructions, the plurality of translated instructions including a plurality of array access instructions; an execution unit configured to receive, in accordance with the plurality of instruction identifiers, the plurality of translated instructions, and, in accordance therewith, execute received translated instructions; and an associative memory element configured to store and retrieve a plurality of array size values, wherein each one of the array size values is associated with one of a plurality of array access instructions, the associative memory element including: (i) a first memory section that includes a first plurality of memory locations configured to receive and store a plurality of array reference entries, wherein each one of the first plurality of memory locations is configured to store one of the plurality of array reference entries, and further wherein each one of the plurality of array reference entries corresponds to one of the plurality of array access instructions; (ii) a second memory section that includes a second plurality of memory locations configured to receive and store a plurality of array size values, wherein each one of the second plurality of memory locations is configured to store one of the array size values and is associated with one of the first plurality of memory locations, and further wherein each one of the plurality of array size values is associated with one of the plurality of array access instructions and comprises a maximum array size value and a minimum array size value; (iii) an input section operatively coupled to the first memory section and configured to receive an array access instruction identifier and to simultaneously compare the array access instruction identifier with at least a portion of each of the stored array reference entries, wherein the array access instruction identifier identifies an array access instruction; and (iv) an output section operatively coupled to the second memory section and configured to provide, as an array size output value, one of the plurality of array size values stored in one of the second plurality of memory locations which is associated with one of the first plurality of memory locations in which is stored one of the plurality of array reference entries that matches the array access instruction identifier; a first comparison element operatively coupled to the output section of the associative memory element and configured to compare the value of the referenced element and the maximum array size output value and to provide a maximum violation signal if the value of the referenced element is greater than the maximum array size output value; a second comparison element operatively coupled to the output section of the associative memory element and configured to compare the value of the referenced element and the minimum array size output value and to provide a minimum violation signal if the value of the referenced element is less than the minimum array size output value; and an exception element operatively coupled to the first and second comparison elements and the execution unit, configured to provide an exception output signal to the execution unit in response to receipt of either the maximum violation signal or the minimum violation signal, wherein the execution unit is configured to respond to the exception output signal by executing a sequence of translated instructions that define an array access boundary exception subroutine

Inventors: JOY WILLIAM N, O'CONNOR JAMES MICHAEL, TREMBLAY MARC, JOY, WILLIAM, N., O'CONNOR, JAMES, MICHAEL, TREMBLAY, MARC
Applicants: SUN MICROSYSTEMS INC, SUN MICROSYSTEMS, INC.
Application year: 1997
Main classification: G06F12
IPC codes: G06F9, G06F11, G06F12