Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
  • G06F9/3017—Runtime instruction translation, e.g. macros
  • G06F9/30174—Runtime instruction translation, e.g. macros for non-native instruction set, e.g. Javabyte, legacy code
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
  • G06F9/30181—Instruction operation extension or modification
  • G06F9/30185—Instruction operation extension or modification according to one or more bits in the instruction, e.g. prefix, sub-opcode
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
  • G06F9/30181—Instruction operation extension or modification
  • G06F9/30189—Instruction operation extension or modification according to execution mode, e.g. mode flag
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
  • G06F9/30181—Instruction operation extension or modification
  • G06F9/30192—Instruction operation extension or modification according to data descriptor, e.g. dynamic data typing

Definitions

• the invention relates to data processing; and, more particularly, to apparatus and methods for indicating operand width in the use of micro-sequences for efficient execution of microprocessor code (e.g., JavaTM bytecodes).
• microprocessor code e.g., JavaTM bytecodes
• Some processors have the ability to execute JavaTM bytecodes directly (an "opcode” being a single member of the group bytecodes), or the functionality desired may be performed by way of "micro-sequences.”
• a stacked-based opcode may be used when a stack-based implementation works better for the desired function
• register-based micro-sequence may be used when a register-based implementation works better for the desired function.
• U>S> Patent Publication No. US2004-0024999 describes processors having the ability to execute an opcode, or have the opcode trigger a micro-sequence.
• the width of an operand is indicated by the presence or absence of another opcode known as "WIDE.”
• WIDE opcode
• the operand width is greater than if the WIDE opcode is not present.
• a directly executed JavaTM opcode "ILOAD” integer load
• the ILOAD opcode may fetch a 32 bit local variable from the location indicated by an sixteen bit operand.
• WIDE extends the number of available local variables to 65,536, though each local variable is still 32 bits in width regardless of the presence or absence of WIDE.
• the processor decodes the WIDE and adjusts fetched operand width accordingly. However, if the opcode triggers a micro-sequence, fetching of the operand is performed by register-based micro-sequences that are unaware of whether the opcode that triggered the micro-sequence was preceded by a WIDE opcode.
• the micro-sequence may have to analyze the opcode instruction stream by reading the instruction stream through data cache reads.
• the opcode instruction stream may be present in the processor's instruction cache and not the data cache, the initial attempt to read the instruction stream through the data cache results in a cache miss.
• significant processor time is expended by a micro-sequence reading the various triggering opcodes and determining the operand width.
• Example embodiments comprise methods and apparatus for fetching a first opcode, asserting a flag if the first opcode modifies an operand width of a subsequent opcode, fetching a second opcode, triggering a micro-sequence based on the opcode, reading the flag by instructions of the micro-sequence, and fetching an operand of the second opcode by the micro-sequence (the bit width of the operand based on a state of the flag).
• FIG. 1 shows a diagram of a system in accordance with embodiments of the invention
• FIG. 2 shows a block diagram of the JSM of FIG. 1 in accordance with embodiments of the invention
• FIG. 3 shows various registers used in the JSM of FIGS. 1 and 2;
• FIG. 4 illustrates operation of the JSM to trigger "micro-sequences";
• FIG. 5 illustrates a method in accordance with embodiments of the invention; and
• FIG. 6 depicts an illustrative embodiment of the system described herein.
• FIG. 1 shows a system 100 in accordance with embodiments of the invention.
• the system may comprise at least two processors 102 and 104.
• Processor 102 may be referred to for purposes of this disclosure as a Java Stack Machine ("JSM") and processor 104 may be referred to as a Main Processor Unit (“MPU").
• System 100 may also comprise memory 106 coupled to both the JSM 102 and MPU 104. At least a portion of the memory 106 may be shared by both processors, and if desired, other portions of the memory 106 may be designated as private to one processor or the other.
• System 100 also comprises a Java Virtual Machine (“JVM”) 108, compiler 110, and a display 114.
• the JVM 108 may comprise a combination of software and hardware.
• the software may comprise the compiler 110 and the hardware may comprise the JSM 102.
• the JVM may comprise a class loader, bytecode verifier, garbage collector, and a bytecode interpreter loop to interpret the bytecodes that are not executed on the JSM processor 102.
• Other components may be included as desired for various applications.
• JavaTM language source code is converted or compiled to a series of bytecodes 112, with each individual one of the bytecodes referred to as an "opcode.”
• Bytecodes 112 may be provided to the JVM 108, possibly compiled by compiler 110, and provided to the JSM 102 and/or MPU 104 for execution.
• the JSM 102 may execute at least some JavaTM bytecodes directly.
• the JVM 108 may also request the MPU 104 to execute one or more JavaTM bytecodes not executed or executable by the JSM 102.
• the MPU 104 also may execute non-Java instructions.
• the MPU 104 may thus also host an operating system ("O/S") (not specifically shown) which performs various functions such as system memory management, the system task management that schedules the software aspects of the JVM 108 and most or all other native tasks running on the system, management of the display 114, and receiving input from input devices (not specifically shown).
• O/S operating system
• JavaTM code may be used to perform any one of a variety of applications such as multimedia, games or web based applications in the system 100, while non-JavaTM code, which may comprise the O/S and other native applications, may still run on the system on the MPU 104.
• JavaTM bytecodes perform stack-based operations. For example, an "IADD" (integer add) JavaTM opcode pops two integers off the top of the stack, adds them together, and pushes the sum back on the stack.
• a "simple” opcode is one in which the JSM 102 may perform an immediate operation either in a single cycle (e.g., an IADD opcode) or in several cycles (e.g., "DUP2_X2").
• a “complex” opcode is one in which several memory accesses may be required to be made within the JVM data structure for various verifications (e.g., NULL pointer, array boundaries).
• a JSM processor 102 in accordance with embodiments of the invention may execute, in addition to the JavaTM bytecodes, a second instruction set other than JavaTM bytecodes.
• the second instruction set may comprise register-based and memory-based operations rather than stack-based operations.
• This second instruction set complements the JavaTM instruction set and, accordingly, may be referred to as a complementary instruction set architecture ("C-ISA").
• C-ISA complementary instruction set architecture
• complementary it is meant that some complex JavaTM bytecodes may be replaced by a "micro-sequence" comprising C-ISA instructions. The execution of JavaTM code may thus be made more efficient and run faster by replacing some opcodes by more efficient micro-sequences of C-ISA instructions.
• JSM 102 comprises a stack- based architecture for efficient and accelerated execution of JavaTM bytecodes, combined with a register-based architecture for executing register and memory based micro-sequences of C- ISA instructions. Because various of the data structures described herein are JVM-dependent, and thus may change from one JVM implementation to another, the software flexibility of the micro-sequence provides a mechanism for various JVM optimizations now known or later developed.
• FIG. 2 shows an illustrative block diagram of the JSM 102.
• the JSM comprises a core 120 coupled to data storage 122 and instruction storage 130.
• the components of the core 120 preferably comprise a plurality of registers 140, address generation units (“AGUs”) 142 and 147, micro-translation lookaside buffers (micro-TLBs) 144 and 156, a multi-entry micro-stack 146, an arithmetic logic unit (“ALU”) 148, a multiplier 150, decode logic 152, and instruction fetch logic 154.
• ALU arithmetic logic unit
• Instructions may be fetched from instruction storage 130 by fetch logic 154 and decoded by decode logic 152.
• the AGUs 142 may be used to calculate addresses for micro-sequence instructions based, at least in part, on data contained in the registers 140.
• AGU 147 couples to the micro-stack 146 and may manage overflow and underflow conditions in the micro-stack 146.
• the micro-TLBs 144 and 156 perform the function of a cache for the address translation and memory protection information bits that are under the control of the operating system running on the MPU 104.
• the registers 140 may comprise a plurality of registers designated as R0-R15.
• Registers R0-R3, R5, R8-R11 and R13-R14 may be used as general purposes ("GP") registers for any purpose. Other registers, and some of the GP registers, may be used for specific purposes. For example, registers R4 and R12 may each be used to store program counters, with R4 storing the program counter ("PC") for a stream of bytecodes, and Rl 2 storing a micro-program counter (“micro-PC”) for executing micro-sequence. The use of the PC and micro-PC will be explained in greater detail below.
• register R5 may be used to store the base address of a portion of memory in which JavaTM local variables may be stored when used by the current JavaTM method.
• the top of the micro-stack 146 can be referenced by the values in registers R6 and R7, and the top of the micro-stack may have a matching address in external memory pointed to by register R6.
• the values contained in the micro-stack are the latest updated values, while their corresponding values in external memory may or may not be up to date.
• Register R7 provides the data value stored at the top of the micro-stack.
• Registers R8 and R9 may also be used to hold the address index 0 ("AIO") and address index 1 ("All").
• Register R14 may also be used to hold the indirect register index ("IRI").
• Register Rl 5 may be used for status and control of the JSM
• At least one bit (called the "Micro-Sequence- Active" bit, not specifically shown) in status register Rl 5 is used to indicate whether the JSM 102 is executing by way of a micro-sequence. This bit controls, in particular, which program counter is used R4 (PC) or Rl 2 (micro-PC) to fetch the next instruction.
• Another bit of the status and control register Rl 5 (termed herein the "WIDE flag” or "WIDE bit”, and given the reference number 200) is used indicate to an executing micro-sequence whether the opcode that triggered the micro-sequence was preceded by a JavaTM WIDE opcode, as discussed more fully below.
• JavaTM bytecodes may pop data from and push data onto the micro-stack 146, which micro-stack 146 preferably comprises a plurality of gates in the core 120 of the JSM 102.
• the micro-stack 146 preferably comprises the top n entries of a larger stack that is implemented in data storage 122. Although the value of n may be vary in different embodiments, in accordance with at least some embodiments the size n of the micro-stack may be the top eight entries in the larger, memory-based stack.
• ALU 148 adds, subtracts, and shifts data.
• the multiplier 150 may be used to multiply two values together in one or more cycles.
• the instruction fetch logic 154 fetches instructions from instruction storage 130, which instructions may be decoded by decode logic 152. Because the JSM 102 is configured to process instructions from at least two instruction sets, the decode logic 152 comprises at least two modes of operation, one mode for each instruction set. As such, the decode logic unit 152 may comprise a JavaTM mode in which JavaTM bytecodes may be decoded, and a C-ISA mode in which micro-sequences of C-ISA instructions may be decoded.
• the data storage 122 comprises data cache ("D-cache”) 124 and data random access memory (“D-RAM”) 126.
• the stack (excluding the micro-stack 146), arrays and non-critical data maybe stored in the D-cache 124, while JavaTM local variables, critical data and non-JavaTM variables (e.g., C 5 C++) may be stored in D-RAM 126.
• the instruction storage 130 may comprise instruction RAM (“I-RAM”) 132 and instruction cache (“I-CACHE”) 134.
• the I-RAM 132 may be used for opcodes or micro-sequences, and the I-CACHE 134 may be used to store other types of JavaTM bytecode and mixed JavaTM/C-ISA instructions.
• FIG. 4 illustrates the operation of the JSM 102 with regard to triggering of micro-sequences based on JavaTM bytecodes.
• FIG. 4 illustrates the instruction storage 130, the decode logic 152, and a micro-sequence vector table 162.
• the decode logic 152 accesses the instruction storage 130 and a micro-sequence vector table 162.
• the decode logic 152 retrieves instructions (e.g., instructions 170) from instruction storage 130 by way of instruction fetch logic 154 (FIG. 2) and decodes the instructions to determine the type of instruction.
• the JSM 102 either directly executes an opcode of instructions 170, or triggers a micro-sequence to perform a desired function (that may or may not be related to the opcode).
• the micro-sequence vector table 162 may be implemented in the decode logic 152, or as separate logic in the JSM 102.
• the micro-sequence vector table 162 preferably comprises a plurality of entries 164, such as one entry for each opcode that the JSM may receive. For example, if there are a total of 256 bytecodes, the micro-sequence vector table 162 preferably comprises at least 256 entries.
• Each entry 164 may have at least two fields - a field 166 and an associated field 168.
• Field 168 may comprise a single bit that indicates whether the instruction 170 is to be directly executed, or whether the associated field 166 contains a reference to a micro-sequence.
• an asserted bit 168 may indicate the corresponding opcode is directly executable by the JSM, and a non-asserted bit 168 may indicate that the associated field 166 contains a reference to a micro-sequence.
• the reference may comprise the full starting address in instruction storage 130 of the micro-sequence, or a part of the starting address that can be concatenated with a base address that may be programmable in the JSM.
• field 166 may provide as many address bits as are required to access the full memory space.
• a register within the JSM registers 140, or preferably within a JSM configuration register accessible through an indirect addressing mechanism using the IRI register is programmed to hold the base address, m these embodiments the vector table 162 may supply only the offset to access the start of the micro-sequence.
• Most or all JSM internal registers 140 and any other registers may be accessible by the MPU 104, and therefore may be modified by the JVM as necessary.
• the offset addressing technique may be preferred to reduce the number of bits needed within field 166.
• At least a portion 180 of the instruction storage 130 may be allocated for storage of micro-sequences and thus the starting address may point to a location in micro-sequence storage 180 at which a particular micro-sequence can be found.
• the portion 180 may be implemented in I-RAM 132 shown in FIG. 2.
• the decode -logic 152 uses an opcode as an index into micro-sequence vector table 162. Once the decode logic 152 locates the indexed entry 164, the decode logic 152 examines the associated bit 168 to determine whether the opcode triggers a micro-sequence. If the bit 168 indicates that the opcode can be directly processed and executed by the JSM, then the instruction is so executed.
• the decode logic 152 preferably changes the opcode into a "NOP,” executes the NOP opcode, asserts the micro-sequence-active bit in the status register Rl 5 (not specifically shown), and begins fetching the first micro-sequence instruction.
• NOP NOP
• the micro-sequence-active bit may be set at any suitable time, such as when the micro-sequence enters the JSM execution stage (not specifically shown).
• the JSM 102 implements two program counters - the PC 186 (register R4) and the micro-PC 188 (register R12).
• one of these two program counters is the active program counter used to fetch and decode instructions.
• the PC 186 stored in register R4 may be the active program counter when executing bytecodes.
• the micro-PC 188 stored in register Rl 2 maybe the active program counter when fetching and executing micro-sequences.
• the JSM 102 hardware may need to fetch data, such as data pointed to by operands.
• data such as data pointed to by operands.
• the size or bit width of the operand is dictated, at least in part, by the presence or absence of the WIDE opcode.
• the micro-sequence may be unaware that its triggering opcode was preceded by a WIDE opcode.
• the decode logic 152 (FIG. 2 or FIG. 3) is configured to assert the WIDE bit or WIDE flag 200 in register Rl 5 when a WIDE opcode is encountered, possibly in addition to other steps taken in response to a WIDE opcode.
• micro-PC 188 register R12
• the contents of the field 166 associated with the micro-sequenced opcode is loaded into the micro-PC 188.
• the JSM 102 begins fetching and decoding the instructions of the micro-sequence.
• the PC 186 preferably is incremented by a suitable value to point the program counter to the next instruction following the opcode that triggered the micro-sequence.
• the micro-sequence-active bit within the status register Rl 5 may only be changed when the first instruction of the micro-sequence enters the execute phase of JSM 102 pipe.
• the switch from PC 186 to the micro-PC 188 preferably is effective immediately after the micro-sequenced instruction is decoded, thereby reducing the latency.
• the micro-sequence may perform its task and end with a predetermined instruction from the C-ISA called "RtuS" (return from micro-sequence) that indicates the end of the sequence.
• This C-ISA instruction causes a switch from the micro-PC (register Rl 2) to the PC (register R4).
• the PC 186 was previously incremented so that the value of the PC 186 points to the next instruction to be decoded.
• FIG. 5 illustrates a flow diagram of a method in accordance with embodiments of the invention.
• the process may start (block 502) by the triggering of a micro-sequence operation by an opcode.
• the micro-sequence instructions read the WIDE flag 200 (block 504). If the WIDE flag 200 is asserted (block 506), then the micro-sequence instructions fetch the operand(s) in WIDE format (block 508). On the other hand, if the WIDE flag is not asserted (block 506), then the micro-sequence instructions fetch the operands in normal or non-WIDE format (block 510).
• the micro-sequence instructions then perform their desired function (block 512), which may be different for each opcode that triggers a micro-sequence. Thereafter, the micro-sequence clears the WIDE flag (block 514). If the WIDE flag was not asserted, the illustrative clearing of the WIDE flag of step 514 may be skipped. In alternative embodiments, the decode logic 152 may de-assert the WIDE flag 200 at an appropriate time, such as after decoding and executing the instruction immediately subsequent to the WIDE opcode. Thereafter, the process ends (block 516).
• System 100 may be implemented as a mobile cell phone such as that shown in FIG. 6.
• the mobile communication device includes an integrated keypad 412 and display 414.
• the JSM processor 102 and MPU processor 104 and other components may be included in electronics package 410 connected to the keypad 412, display 414, and radio frequency ("RF") circuitry 416.
• the RF circuitry 416 may be connected to an antenna 418.

Landscapes

• Engineering & Computer Science (AREA)
• Software Systems (AREA)
• Theoretical Computer Science (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Devices For Executing Special Programs (AREA)
• Executing Machine-Instructions (AREA)

Applications Claiming Priority (2)

Publications (2)

Family

ID=37452815

Family Applications (1)

Country Status (2)

Families Citing this family (3)

Citations (4)

Family Cites Families (5)

• 2006
  • 2006-05-24 EP EP06771120A patent/EP1891517A4/de not_active Withdrawn
  • 2006-05-24 WO PCT/US2006/020162 patent/WO2006127856A2/en active Application Filing

Patent Citations (4)

Non-Patent Citations (3)

Also Published As

Similar Documents

Legal Events