Converting byte code instructions to a new instruction set
OwnerMichael A. Di Loretoinventor
Life of this patent
Estimating the term…
Loading patent…
OwnerMichael A. Di Loretoinventor
Estimating the term…
Byte code instructions encoding a computer method typically make use of a stack frame having an (implicit) stack pointer which points to locations on the stack frame for obtaining or storing data. Thus, the instructions typically do not contain an explicit encoding of locations on the stack frame for obtaining or storing data. The stack pointer typically adjusts itself automatically as data are moved on and off the stack frame during execution or simulation of a method. In an improved methodology, before execution (JIT compilation or interpretation), various locations on the stack frame indicated by the stack pointer are converted into explicit location data on the stack frame, thereby obviating the need for the stack pointer. The byte code instructions are converted to new instructions using said explicit locations, and which are substantially uniform in size to improve efficiency of execution.
A process for converting byte code instructions to a new instruction set that is more efficiently compiled, comprising:
A computer readable medium for converting byte code instructions to a new instruction set that is more efficiently compiled, comprising logic instructions that, if executed:
An apparatus for converting byte code instructions to a new instruction set that is more efficiently compiled, comprising:
A process for converting byte code instructions to a new instruction set that is more efficiently compiled, comprising:
A computer-readable medium for converting byte code instructions to a new instruction set that is more efficiently compiled, comprising logic instructions that, if executed:
Dependencies are inferred from the claim text.