US7444630B2 - Method and apparatus for changing microcode to be executed in a processor - Google Patents

Method and apparatus for changing microcode to be executed in a processor Download PDF

Info

Publication number
US7444630B2
US7444630B2 US10/774,994 US77499404A US7444630B2 US 7444630 B2 US7444630 B2 US 7444630B2 US 77499404 A US77499404 A US 77499404A US 7444630 B2 US7444630 B2 US 7444630B2
Authority
US
United States
Prior art keywords
memory
address
cache
opcode
read
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime, expires
Application number
US10/774,994
Other versions
US20040158827A1 (en
Inventor
Christian D. Kasper
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
STMicroelectronics lnc USA
Original Assignee
STMicroelectronics lnc USA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by STMicroelectronics lnc USA filed Critical STMicroelectronics lnc USA
Priority to US10/774,994 priority Critical patent/US7444630B2/en
Publication of US20040158827A1 publication Critical patent/US20040158827A1/en
Application granted granted Critical
Publication of US7444630B2 publication Critical patent/US7444630B2/en
Priority to US12/914,978 priority patent/USRE45278E1/en
Adjusted expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/3017Runtime instruction translation, e.g. macros
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/22Microcontrol or microprogram arrangements
    • G06F9/26Address formation of the next micro-instruction ; Microprogram storage or retrieval arrangements
    • G06F9/262Arrangements for next microinstruction selection
    • G06F9/268Microinstruction selection not based on processing results, e.g. interrupt, patch, first cycle store, diagnostic programs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30181Instruction operation extension or modification
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/32Address formation of the next instruction, e.g. by incrementing the instruction counter
    • G06F9/322Address formation of the next instruction, e.g. by incrementing the instruction counter for non-sequential address
    • G06F9/328Address formation of the next instruction, e.g. by incrementing the instruction counter for non-sequential address for runtime instruction patching

Definitions

  • This invention relates generally to a processors and, more specifically, to a method and apparatus which provides run-time correction for microcode, code enhancement, and/or interrupt vector reassignment.
  • the debug circuit should consume only a small amount of silicon real estate, be inexpensive to implement and allow changes at a faster rate then current techniques.
  • the debug circuit must also provide a means by which the debug circuit could download data to debug the device. Data could be downloaded by the host system or managed via a simplistic communication scheme as described in the ST52T3 data book written by STMicroelectronics, Inc.
  • a hot patch system for changing of code in a processor.
  • the hot patch system has a memory, such as a Read Only Memory (ROM), for storing a plurality of instructions.
  • a program counter is coupled to the memory for indexing of the memory to access an instruction.
  • a cache system is coupled to the memory and to the program counter. The cache system is used for comparing information associated with the instruction from memory with information stored in the cache system. If there is a comparison match, the cache system alters the instruction stream as designated by information stored in the cache system. If no match occurs, the cache system sends the instruction from memory into the instruction stream.
  • a method of altering the code of a pipeline processor requires that a plurality of instructions be stored in memory.
  • a cache is provided and information is stored in the cache.
  • the memory is indexed to access one of the instructions stored in memory.
  • Information associated with the instruction from memory is compared with information stored in the cache. If a comparison match is made, the instruction stream is altered as designated by the information stored in the cache. If no comparison match is made, the instruction from memory is inserted into the instruction stream.
  • FIG. 1 is a simplified block diagram of one embodiment of the hot patch circuit of the present invention.
  • FIG. 2 is a simplified block diagram of a second embodiment of the hot patch circuit of the present invention.
  • FIG. 3 shows one example of the different fields associated with the cache used in the present invention.
  • FIG. 4 shows one example of the control codes used in the control flag field of FIG. 3 .
  • FIG. 5 shows one example of the bit configuration of the cache control register used in the present invention.
  • circuit 10 provides a means whereby the instruction content of an embedded memory device or the behavior of the Central Processing Unit (CPU) may be corrected, modified and/or debugged.
  • the circuit 10 is preferably used in a pipeline CPU.
  • the circuit 10 has a program counter 12 .
  • the program counter 12 is coupled to a memory device 14 and to a register 18 .
  • the program counter 12 is used to generate an address of an instruction to be executed. When the address is generated, the program counter 12 will index the memory unit 14 .
  • the memory unit 14 stores instructions which are to be executed by the CPU.
  • the memory unit 14 is a nonvolatile memory device like a Read Only Memory (ROM) device.
  • the register 18 is coupled to the memory unit 14 , the program counter 12 , and to a cache unit 20 .
  • the register 18 is used to store data which will be compared to data which is stored in the cache unit 20 .
  • the register 18 may either store the address sent from the program counter 12 or the instruction which the program counter 12 access from the memory unit 14 .
  • the cache unit 20 is comprised of a plurality of cache lines 30 .
  • Each cache line 30 is comprised of at least three different fields: a control flag field 30 A, an op-code field 30 B which stores the new instruction to be inserted into the instruction stream, and an address/op-code field 30 C which stores the data which is to be compared to the data stored in the register 18 .
  • the size of the fields will vary based on the implementation of the circuit 10 .
  • the width of the cache line 30 would be able to accommodate at least a 32-bit op-code (field 30 B) along with a 10 to 32-bit address/op-code (field 30 C) and a 2 to 8-bit control flag field (field 30 A).
  • This would yield a cache line width between 44 to 72-bits.
  • these field lengths are only given as one example and should not be seen as limiting the scope of the present invention.
  • bit field dimensions will vary depending on the size of the memory unit 14 .
  • the control flag field 30 A is used to dictate both the semantic content and the execution behavior of individual or multiple cache lines 30 .
  • the number of control flags is dependent upon the allocated field size. In some cases, combination of control flags may be useful. Control flags may be used to either delete or enable cache unit entries, or provide alternate semantic information regarding the register content. Referring to FIG. 3 , some examples of the control flag code is shown.
  • the valid flag “V” indicates whether the entry in the cache unit 20 is valid.
  • the “A” and “O” flags indicate whether the information to be compared is an address or an op-code.
  • the global flag “G” allows for greater than a 1:1 mapping. For example, if the address flag “A” is set, one would only be comparing the one particular address in the memory unit 14 .
  • the op-code “O” and global “G” flags are set, one would be able to replace every occurrence of a particular instruction that is accessed from the memory unit 14 .
  • the global flag “G” allows one to make better use of the space in the cache unit 20 .
  • the insert “I”, match “M”, block assignment “B”, and delete “X” flags are used by the cache control logic 22 to control access to the instruction stream.
  • the “I” flag implies that the associated op-code in the cache is to be inserted into the instruction stream.
  • the “M” flag indicates that when the contents of the register 18 matches that in the cache unit 20 , the cache unit instruction is to replace the instruction from the memory unit 14 in the instruction stream.
  • the “B” flag allows for more than one instruction (i.e., a block of instructions) that is stored in the cache unit 20 is to be clocked into the instruction stream.
  • the “X” indicates that the relevant instruction is to be ignored or deleted (i.e., no operation (NOP)).
  • the “E”, “H”, “L”, and “Q” flags are pipeline control flags.
  • the “E” flags indicates that if there is a match to jump to external memory using the address in the “opcode field” and to execute the instructions in external memory starting at that location.
  • the “H” flag allows one to stop the clock for purposes of debugging the pipeline.
  • the “L” flag allows one to lock the cache unit 20 and the “Q” flag is a generate trap flag.
  • the control codes shown in FIG. 3 are just examples and should not be seen to limit the scope of the present invention. Different sets or embodiments of flags could be used depending on the particular implementation.
  • the cache unit is a fully associative or direct-mapped cache which would contain memory unit addresses with associated control flags, executable instructions, and tag information.
  • the cache unit 20 may be a content addressable memory whereby the data in the register 18 is compared to all the contents in the cache unit 20 .
  • the cache 20 is also coupled to a bus 21 .
  • the bus 21 could be coupled to a host bus or to external memory.
  • the bus 21 allows data to be downloaded into the cache 20 or for allowing instructions to be executed from the external memory. Contents of the cache 20 could be downloaded by the host system or managed via a simple communication scheme as described in the ST52T3 data book written by STMicroelectronics, Inc.
  • Cache control logic 22 is coupled to the cache unit 20 and to te multiplexer 16 .
  • the cache control logic 22 controls the operation of the cache unit 20 and when a particular instruction will be inserted into the instruction stream of the pipeline 24 . If there is no comparison match, the cache control logic 22 will let the instruction from the memory unit 14 flow through the multiplexer 16 to the pipeline 24 . When there is a comparison match, the instruction from the memory unit 14 is replaced by a new instruction from the cache unit 20 in the pipeline 24 .
  • the cache control logic 22 will have a cache control register 23 .
  • the cache control register 23 allows one to control the cache unit 20 and to control insertion of an instruction into the pipeline 24 .
  • the cache control register 23 By setting various bits in the cache control register 23 , one would be able to enable/disable the cache unit 20 , modify the contents of the cache unit 20 and control the general operation of the cache unit 20 .
  • the cache control register 23 will be described in further detail in relation to the dual cache system of FIG. 2 .
  • a mask register 26 may be coupled to the cache unit 20 .
  • the mask register 26 may be a global mask register which would affect the entire cache unit 20 or a local mask register 32 ( FIG. 3 ) whereby a single cache line 30 would have an associated local mask register 32 .
  • the mask register 26 provides flexibility to the circuit 10 .
  • the mask register 26 allows flexibility by allowing one to control how the data from the memory unit 14 is matched with data in the cache unit 20 . For example, if all of the bits in the global mask register 26 were set to 1, then what ever data came through the register 18 would be matched one to one against that of the cache unit 20 .
  • the mask register 26 may also be used to modify the contents of the cache unit 20 by using simple write instructions.
  • circuit 10 ′ looks and operates in a similar fashion as circuit 10 depicted in FIG. 1 .
  • One difference in circuit 10 ′ is that the cache 20 ′ is divided into two separate caches: an address cache 20 A′ and an instruction cache 20 B′.
  • the address cache 20 A′ the third field of the cache line will contain the memory unit address location to be matched
  • the instruction cache 20 A′ the third field of the cache line will contain the memory unit instruction to be matched.
  • the cache control logic 22 ′ operates in a similar fashion as disclosed above.
  • the cache control register 23 ′ is shown in FIG. 5 .
  • the catch control register 23 ′ depicted in FIG. 5 would be used in the dual cache system of FIG. 2 .
  • the cache control register 23 ′ has locking, enabling, indexing, and match status bits for both the address cache 20 A′ and the index cache 20 B′. Bits like the enable operation bit and the debug mode bit could be used in either the single cache system of FIG. 1 or the dual cache system of FIG. 2 .
  • the cache control register bit definition as shown in FIG. 5 is just one example and should not be seen to limit the scope of the present invention. Different configuration of bits could be used depending on the particular implementation.
  • the dual cache system also uses two multiplexers 16 A′ and 16 B′.
  • the first multiplexer 16 A′ has a first input coupled to the output of the address cache 20 A′, a second input coupled to the output of the instruction cache 20 B′, a third input coupled to the cache control logic 22 ′, and an output coupled to the second multiplexer 16 B′.
  • the second multiplexer 16 B′ has a first input coupled to the output of the first multiplexer 16 A′, a second input coupled to the output of the memory device 14 ′, a third input coupled to the cache control logic 22 ′, and outputs coupled to the pipeline 24 ′ and the status buffer 34 ′.
  • the cache control logic 23 ′ will control which cache 20 A′ or 20 B′ is enabled and if there is a dual match if both caches 20 A′ and 20 B′ are enabled, which cache has priority. If there is a comparison match, the cache control logic 22 ′ will cause the multiplexer 16 A′ to send an output from the cache unit 20 ′ to the second multiplexer 16 B′. The cache control logic 22 ′ will then cause the multiplexer 16 B′ to insert the output from the cache unit 20 ′ into the instruction stream to be executed. If there is no comparison match, the cache control logic 22 ′ will cause the multiplexer 16 B′ to insert the instruction from the memory unit 14 ′ into the pipeline 24 ′.
  • the circuit 10 ′ has a status buffer 34 ′.
  • the status buffer 34 ′ has an input coupled to the cache control logic 22 ′, an input coupled to the second multiplexer 16 B′, and an input coupled to the bus 36 ′.
  • the status buffer is used to store information related to the operation of the circuit 10 ′.
  • the status buffer could be used to gather debug information such as what line of code was matched.
  • the status buffer 34 ′ could also be used in the embodiment depicted in FIG. 1 .
  • circuit 10 Referring now to Table 1 below, the operation of circuit 10 will be described. It should be noted that the operation of circuit 10 ′ is similar to 10 and will not be described in detail.
  • the program counter 12 When the program counter 12 generates the address 0111111, the program counter 12 will index the memory unit 14 . The instruction associated with address 0111111 from the memory unit 14 will be stored in the multiplexer 16 . The address from the program counter 12 is also sent to the register 18 where it is compared to the data stored in the cache unit 20 . As can be seen above, for address 0111111 there is a comparison match with cache line 1. Since the “M” flag is set for cache line 1, the op-code in cache line 1 will replace the instruction from memory. Thus the cache control logic 23 will send the CP32 A,C instruction associated with cache line 1 through the multiplexer 16 into the pipeline 24 to be execute.
  • the next address generated by the program counter 12 is 1000000.
  • the memory unit instruction associated with address 1000000 is sent from the memory unit 14 and stored in the multiplexer 16 .
  • the address generated by the program counter 12 is sent to the register 18 where it is compared to the data stored in the cache unit 20 . For the address 1000000 there is a comparison match with cache line 2. Since the “I” flag is set for cache line 2, the op-code in cache line 2 (i.e., MOV A,B) will be inserted into the instruction stream after the instruction associated with the memory unit address location 1000000.
  • the next address generated by the program counter 12 is 1000001. For this address there is no comparison match. Thus, the cache control logic 23 will send the instruction associated with memory unit address location 1000001 through the multiplexer 16 into the pipeline 24 to be execute.
  • the next address generated by the program counter is 1000011. For this address, there is a comparison match with cache line 4. Since the “R” flag is set in cache line 4, the op-code ADD B,C in cache line 4 replaces the memory unit instruction associated with the address 1000011 in the instruction stream.
  • the next address in the program counter is 1000101. Again there is a comparison match. This time the match is with cache line 5. Cache line 5 has the “X” flag set so the instruction is ignored or deleted (i.e., no operation (NOP)).
  • the cache control logic 23 will send the instruction associated with these memory unit address locations through the multiplexer 16 into the pipeline 24 to be execute.

Abstract

A Central Processing Unit (CPU) hotpatch circuit compares the run-time instruction stream against an internal cache. The internal cache stores embedded memory addresses with associated control flags, executable instruction codes, and tag information. In the event that a comparison against the current program counter succeeds, then execution is altered as required per the control flags. If no comparison match is made, then execution of the instruction that was accessed by the program counter is executed.

Description

This application is a continuation of prior application Ser. No. 09/475,927 filed on Dec. 30, 1999 now U.S. Pat. No. 6,691,308.
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates generally to a processors and, more specifically, to a method and apparatus which provides run-time correction for microcode, code enhancement, and/or interrupt vector reassignment.
2. Description of the Prior Art
For integrated circuits which are driven by microcode which is embedded in internal memory, many times it is necessary to either have the instruction content of the embedded memory device or the behavior of the Central Processing Unit (CPU) pipeline itself corrected or debugged in the field. This may require on-the-fly modifications driven by customer request or updates due to evolution of industry protocol standards. However, this creates problems since it is difficult to correct and/or debug these types of circuits. Debugging and/or changing the embedded microcode is a time consuming effort which generally requires messy CRC changes or related checksum modifications.
Therefore, a need existed to provide a circuit by which either the instruction content of the internal memory and/or the behavior of the CPU pipeline itself could be corrected and/or debugged in the field. The debug circuit should consume only a small amount of silicon real estate, be inexpensive to implement and allow changes at a faster rate then current techniques. The debug circuit must also provide a means by which the debug circuit could download data to debug the device. Data could be downloaded by the host system or managed via a simplistic communication scheme as described in the ST52T3 data book written by STMicroelectronics, Inc.
SUMMARY OF THE INVENTION
It is object of the present invention to provide a circuit by which either the instruction content of an internal memory and/or the behavior of the CPU pipeline itself could be corrected and/or debugged in the field.
It is another object of the present invention to provide a debug circuit which consumes only a small amount of silicon real estate, is inexpensive to implement and allow changes at a faster rate then current techniques.
It is still a further object of the present invention to provide a debug circuit which provides a means by which the debug circuit could download data to debug the device.
BRIEF DESCRIPTION OF THE PREFERRED EMBODIMENTS
In accordance with one embodiment of the present invention, a hot patch system for changing of code in a processor is disclosed. The hot patch system has a memory, such as a Read Only Memory (ROM), for storing a plurality of instructions. A program counter is coupled to the memory for indexing of the memory to access an instruction. A cache system is coupled to the memory and to the program counter. The cache system is used for comparing information associated with the instruction from memory with information stored in the cache system. If there is a comparison match, the cache system alters the instruction stream as designated by information stored in the cache system. If no match occurs, the cache system sends the instruction from memory into the instruction stream.
In accordance with another embodiment of the present invention, a method of altering the code of a pipeline processor is disclosed. The method requires that a plurality of instructions be stored in memory. A cache is provided and information is stored in the cache. The memory is indexed to access one of the instructions stored in memory. Information associated with the instruction from memory is compared with information stored in the cache. If a comparison match is made, the instruction stream is altered as designated by the information stored in the cache. If no comparison match is made, the instruction from memory is inserted into the instruction stream.
The foregoing and other objects, features, and advantages of the invention will be apparent from the following, more particular, description of the preferred embodiments of the invention, as illustrated in the accompanying drawing.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a simplified block diagram of one embodiment of the hot patch circuit of the present invention.
FIG. 2 is a simplified block diagram of a second embodiment of the hot patch circuit of the present invention.
FIG. 3 shows one example of the different fields associated with the cache used in the present invention.
FIG. 4 shows one example of the control codes used in the control flag field of FIG. 3.
FIG. 5 shows one example of the bit configuration of the cache control register used in the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Referring to FIG. 1, one embodiment of a hot patch circuit 10 (hereinafter circuit 10) is shown. The circuit 10 provides a means whereby the instruction content of an embedded memory device or the behavior of the Central Processing Unit (CPU) may be corrected, modified and/or debugged. The circuit 10 is preferably used in a pipeline CPU.
The circuit 10 has a program counter 12. The program counter 12 is coupled to a memory device 14 and to a register 18. The program counter 12 is used to generate an address of an instruction to be executed. When the address is generated, the program counter 12 will index the memory unit 14. The memory unit 14 stores instructions which are to be executed by the CPU. The memory unit 14 is a nonvolatile memory device like a Read Only Memory (ROM) device. Once the program counter 12 access the instruction which is stored in the memory unit 14, the instruction is sent to a multiplexer 16.
The register 18 is coupled to the memory unit 14, the program counter 12, and to a cache unit 20. The register 18 is used to store data which will be compared to data which is stored in the cache unit 20. The register 18 may either store the address sent from the program counter 12 or the instruction which the program counter 12 access from the memory unit 14.
As may be seen in FIG. 4, the cache unit 20 is comprised of a plurality of cache lines 30. Each cache line 30 is comprised of at least three different fields: a control flag field 30A, an op-code field 30B which stores the new instruction to be inserted into the instruction stream, and an address/op-code field 30C which stores the data which is to be compared to the data stored in the register 18. The size of the fields will vary based on the implementation of the circuit 10. In accordance with one embodiment of the present invention, the width of the cache line 30 would be able to accommodate at least a 32-bit op-code (field 30B) along with a 10 to 32-bit address/op-code (field 30C) and a 2 to 8-bit control flag field (field 30A). This would yield a cache line width between 44 to 72-bits. However, it should be noted that these field lengths are only given as one example and should not be seen as limiting the scope of the present invention. As stated above, bit field dimensions will vary depending on the size of the memory unit 14.
The control flag field 30A is used to dictate both the semantic content and the execution behavior of individual or multiple cache lines 30. The number of control flags is dependent upon the allocated field size. In some cases, combination of control flags may be useful. Control flags may be used to either delete or enable cache unit entries, or provide alternate semantic information regarding the register content. Referring to FIG. 3, some examples of the control flag code is shown. The valid flag “V” indicates whether the entry in the cache unit 20 is valid. The “A” and “O” flags indicate whether the information to be compared is an address or an op-code. The global flag “G” allows for greater than a 1:1 mapping. For example, if the address flag “A” is set, one would only be comparing the one particular address in the memory unit 14. Thus, there is only a 1:1 mapping. However, if the op-code “O” and global “G” flags are set, one would be able to replace every occurrence of a particular instruction that is accessed from the memory unit 14. Thus, the global flag “G” allows one to make better use of the space in the cache unit 20. The insert “I”, match “M”, block assignment “B”, and delete “X” flags are used by the cache control logic 22 to control access to the instruction stream. The “I” flag implies that the associated op-code in the cache is to be inserted into the instruction stream. The “M” flag indicates that when the contents of the register 18 matches that in the cache unit 20, the cache unit instruction is to replace the instruction from the memory unit 14 in the instruction stream. The “B” flag allows for more than one instruction (i.e., a block of instructions) that is stored in the cache unit 20 is to be clocked into the instruction stream. The “X” indicates that the relevant instruction is to be ignored or deleted (i.e., no operation (NOP)). The “E”, “H”, “L”, and “Q” flags are pipeline control flags. The “E” flags indicates that if there is a match to jump to external memory using the address in the “opcode field” and to execute the instructions in external memory starting at that location. The “H” flag allows one to stop the clock for purposes of debugging the pipeline. The “L” flag allows one to lock the cache unit 20 and the “Q” flag is a generate trap flag. The control codes shown in FIG. 3 are just examples and should not be seen to limit the scope of the present invention. Different sets or embodiments of flags could be used depending on the particular implementation.
In the embodiment depicted in FIG. 1, the cache unit is a fully associative or direct-mapped cache which would contain memory unit addresses with associated control flags, executable instructions, and tag information. The cache unit 20 may be a content addressable memory whereby the data in the register 18 is compared to all the contents in the cache unit 20.
The cache 20 is also coupled to a bus 21. The bus 21 could be coupled to a host bus or to external memory. The bus 21 allows data to be downloaded into the cache 20 or for allowing instructions to be executed from the external memory. Contents of the cache 20 could be downloaded by the host system or managed via a simple communication scheme as described in the ST52T3 data book written by STMicroelectronics, Inc.
Cache control logic 22 is coupled to the cache unit 20 and to te multiplexer 16. The cache control logic 22 controls the operation of the cache unit 20 and when a particular instruction will be inserted into the instruction stream of the pipeline 24. If there is no comparison match, the cache control logic 22 will let the instruction from the memory unit 14 flow through the multiplexer 16 to the pipeline 24. When there is a comparison match, the instruction from the memory unit 14 is replaced by a new instruction from the cache unit 20 in the pipeline 24. The cache control logic 22 will have a cache control register 23. The cache control register 23 allows one to control the cache unit 20 and to control insertion of an instruction into the pipeline 24. By setting various bits in the cache control register 23, one would be able to enable/disable the cache unit 20, modify the contents of the cache unit 20 and control the general operation of the cache unit 20. The cache control register 23 will be described in further detail in relation to the dual cache system of FIG. 2.
A mask register 26 may be coupled to the cache unit 20. The mask register 26 may be a global mask register which would affect the entire cache unit 20 or a local mask register 32 (FIG. 3) whereby a single cache line 30 would have an associated local mask register 32. The mask register 26 provides flexibility to the circuit 10. The mask register 26 allows flexibility by allowing one to control how the data from the memory unit 14 is matched with data in the cache unit 20. For example, if all of the bits in the global mask register 26 were set to 1, then what ever data came through the register 18 would be matched one to one against that of the cache unit 20. One could also set the global mask register 26 to invalidating the cache unit 20 and let the memory unit instructions be executed as accessed by the program control 12. The mask register 26 may also be used to modify the contents of the cache unit 20 by using simple write instructions.
Referring to FIG. 2, a second embodiment of the present invention is shown wherein like numerals represent like elements with the exception of a “′” to indicate another embodiment. The circuit 10′ looks and operates in a similar fashion as circuit 10 depicted in FIG. 1. One difference in circuit 10′ is that the cache 20′ is divided into two separate caches: an address cache 20A′ and an instruction cache 20B′. Thus, for the address cache 20A′, the third field of the cache line will contain the memory unit address location to be matched, and for the instruction cache 20A′, the third field of the cache line will contain the memory unit instruction to be matched.
The cache control logic 22′ operates in a similar fashion as disclosed above. For the dual cache system, one implementation of the cache control register 23′ is shown in FIG. 5. As can be seen in FIG. 5, by setting different bits in the cache control register 23′, one is able to control the operation of the cache unit 20′. The catch control register 23′ depicted in FIG. 5 would be used in the dual cache system of FIG. 2. In this particular embodiment, the cache control register 23′ has locking, enabling, indexing, and match status bits for both the address cache 20A′ and the index cache 20B′. Bits like the enable operation bit and the debug mode bit could be used in either the single cache system of FIG. 1 or the dual cache system of FIG. 2. The cache control register bit definition as shown in FIG. 5 is just one example and should not be seen to limit the scope of the present invention. Different configuration of bits could be used depending on the particular implementation.
The dual cache system also uses two multiplexers 16A′ and 16B′. The first multiplexer 16A′ has a first input coupled to the output of the address cache 20A′, a second input coupled to the output of the instruction cache 20B′, a third input coupled to the cache control logic 22′, and an output coupled to the second multiplexer 16B′. The second multiplexer 16B′ has a first input coupled to the output of the first multiplexer 16A′, a second input coupled to the output of the memory device 14′, a third input coupled to the cache control logic 22′, and outputs coupled to the pipeline 24′ and the status buffer 34′. In operation, the cache control logic 23′ will control which cache 20A′ or 20B′ is enabled and if there is a dual match if both caches 20A′ and 20B′ are enabled, which cache has priority. If there is a comparison match, the cache control logic 22′ will cause the multiplexer 16A′ to send an output from the cache unit 20′ to the second multiplexer 16B′. The cache control logic 22′ will then cause the multiplexer 16B′ to insert the output from the cache unit 20′ into the instruction stream to be executed. If there is no comparison match, the cache control logic 22′ will cause the multiplexer 16B′ to insert the instruction from the memory unit 14′ into the pipeline 24′.
In the embodiment depicted in FIG. 2, the circuit 10′ has a status buffer 34′. The status buffer 34′ has an input coupled to the cache control logic 22′, an input coupled to the second multiplexer 16B′, and an input coupled to the bus 36′. The status buffer is used to store information related to the operation of the circuit 10′. For example, the status buffer could be used to gather debug information such as what line of code was matched. Although not shown in FIG. 1, it should be noted that the status buffer 34′ could also be used in the embodiment depicted in FIG. 1.
OPERATION
Referring now to Table 1 below, the operation of circuit 10 will be described. It should be noted that the operation of circuit 10′ is similar to 10 and will not be described in detail.
TABLE 1
Cache
Flags Address Op-code Program Counter Code Stream
1 MA 0111111 CP32 A,C 0111111 CP32 A,C
2 IR 1000000 MOV A,B 1000000 100000
3 RA 1000010 SAV B 1000001 MOV A,B
4 RA 1000011 ADD B,C 1000010 100001
5 XA 1000101 1000011 SAV B
1000101 ADD B,C
1000110 NOP
1000111 1000110
1000111
When the program counter 12 generates the address 0111111, the program counter 12 will index the memory unit 14. The instruction associated with address 0111111 from the memory unit 14 will be stored in the multiplexer 16. The address from the program counter 12 is also sent to the register 18 where it is compared to the data stored in the cache unit 20. As can be seen above, for address 0111111 there is a comparison match with cache line 1. Since the “M” flag is set for cache line 1, the op-code in cache line 1 will replace the instruction from memory. Thus the cache control logic 23 will send the CP32 A,C instruction associated with cache line 1 through the multiplexer 16 into the pipeline 24 to be execute.
The next address generated by the program counter 12 is 1000000. The memory unit instruction associated with address 1000000 is sent from the memory unit 14 and stored in the multiplexer 16. The address generated by the program counter 12 is sent to the register 18 where it is compared to the data stored in the cache unit 20. For the address 1000000 there is a comparison match with cache line 2. Since the “I” flag is set for cache line 2, the op-code in cache line 2 (i.e., MOV A,B) will be inserted into the instruction stream after the instruction associated with the memory unit address location 1000000.
The next address generated by the program counter 12 is 1000001. For this address there is no comparison match. Thus, the cache control logic 23 will send the instruction associated with memory unit address location 1000001 through the multiplexer 16 into the pipeline 24 to be execute.
For the next address, 1000010, there is a comparison match with cache line 3. Since the “R” flag is set in cache line 3, the op-code in cache line 3 (i.e., SAV B) replaces the memory unit instruction associated with the address 1000010 in the instruction stream.
The next address generated by the program counter is 1000011. For this address, there is a comparison match with cache line 4. Since the “R” flag is set in cache line 4, the op-code ADD B,C in cache line 4 replaces the memory unit instruction associated with the address 1000011 in the instruction stream.
The next address in the program counter is 1000101. Again there is a comparison match. This time the match is with cache line 5. Cache line 5 has the “X” flag set so the instruction is ignored or deleted (i.e., no operation (NOP)).
For the last two addresses in the program counter, 1000110 and 1000101, this is no comparison match. Thus, the cache control logic 23 will send the instruction associated with these memory unit address locations through the multiplexer 16 into the pipeline 24 to be execute.
While the invention has been particularly shown and described with reference to preferred embodiments thereof, it will be understood by those skilled in the art that the foregoing and other exchanges in form and details may be made therein without departing from the spirit and scope of the invention.

Claims (23)

1. A hot patch system comprising:
a read only memory storing a plurality of instructions;
a cache memory storing alternate instructions for at least one instruction stored within the read only memory, each cache line within the cache memory having associated therewith one or more selection flags;
a program counter coupled to the read only memory and to the cache memory, the program counter transmitting an address to both the read only memory and the cache memory; and
cache control logic coupled to the cache memory, the cache control logic comparing selected information associated with an instruction stored at the address in the read only memory with counterpart selected information associated with an instruction stored at the address in the cache memory, wherein the selected information and counterpart selected information are selected based upon the one or more selection flags associated with a cache line corresponding to the address.
2. The hot patch system according to claim 1, wherein the one or more selection flags include a first flag indicating whether the cache control logic is to compare addresses and a second flag indicating whether the cache control logic is to compare opcodes.
3. The hot patch system according to claim 2, wherein the second flag, when set, indicates that the cache control logic is to compare an opcode stored at the address within the read only memory with an opcode stored at the address within the cache memory.
4. The hot patch system according to claim 2, wherein the first and second flags may be individually set, so that both flags may be set, one flag may be set while the other flag is not set, or both flags may be not set.
5. The hot patch system according to claim 2, wherein the one or more selection flags further include a third flag indicating whether an opcode comparison should be performed for every instance of an opcode within the read only memory.
6. The hot patch system according to claim 1, wherein each cache line within the cache memory has associated therewith one or more instruction flow control flags, wherein the cache control logic causes a change in instruction flow based upon the one or more instruction flow control flags associated with the cache line corresponding to the address when there is a comparison match between the selected information and the counterpart selected information.
7. The hot patch system according to claim 6, wherein the one or more instruction flow control flags include an insert flag indicating that an opcode at the address within the cache memory is to be inserted prior to execution of an opcode at the address within the read only memory.
8. The hot patch system according to claim 6, wherein the one or more instruction flow control flags include a replace flag indicating that an opcode at the address within the cache memory is to be executed instead of an opcode at the address within the read only memory.
9. The hot patch system according to claim 6, wherein the one or more instruction flow control flags include a block flag indicating that more than one opcode starting at the address within the cache memory are to be executed instead of or before an opcode at the address within the read only memory.
10. The hot patch system according to claim 6, wherein the one or more instruction flow control flags include a noop flag indicating that an opcode at the address within the read only memory is to be skipped.
11. A hot patch method comprising:
storing a plurality of instructions within a read only memory;
storing alternate instructions for at least one instruction in the read only memory within a cache memory, each cache line within the cache memory having associated therewith one or more selection flags;
transmitting an address to both the read only memory and the cache memory; and
comparing selected information associated with an instruction stored at the address in the read only memory with counterpart selected information associated with an instruction stored at the address in the cache memory, wherein the selected information and counterpart selected information are selected based upon the one or more selection flags associated with a cache line corresponding to the address.
12. The hot patch method according to claim 11, wherein the one or more selection flags include a first flag indicating whether addresses are to be compared and a second flag indicating whether opcodes are to be compared.
13. The hot patch method according to claim 12, wherein the second flag, when set, indicates that an opcode stored at the address within the read only memory is to be compared with an opcode stored at the address within the cache memory.
14. The hot patch method according to claim 12, wherein the first and second flags may be individually set, so that either both flags may be set, one flag may be set while the other flag is not set, or both flags may be not set.
15. The hot patch method according to claim 12, wherein the one or more selection flags further include a third flag indicating whether an opcode comparison should be performed for every instance of an opcode within the read only memory.
16. The hot patch method according to claim 11, wherein each cache line within the cache memory has associated therewith one or more instruction flow control flags, wherein instruction flow is changed based upon the one or more instruction flow control flags associated with a cache line corresponding to the address when there is a comparison match between the selected information and the counterpart selected information.
17. The hot patch method according to claim 16, wherein the one or more instruction flow control flags include an insert flag indicating that an opcode at the address within the cache memory is to be inserted prior to execution of an opcode at the address within the read only memory.
18. The hot patch method according to claim 16, wherein the one or more instruction flow control flags include a replace flag indicating that an opcode at the address within the cache memory is to be executed instead of an opcode at the address within the read only memory.
19. The hot patch method according to claim 16, wherein the one or more instruction flow control flags include a block flag indicating that more than one opcode starting at the address within the cache memory are to be executed instead of or before an opcode at the address within the read only memory.
20. The hot patch method according to claim 16, wherein the one or more instruction flow control flags include a noop flag indicating that an opcode at the address within the read only memory is to be skipped.
21. A hot patch system comprising:
a read only memory storing a plurality of instructions;
a cache memory storing alternate instructions for at least one instruction stored within the read only memory, each cache line within the cache memory having associated therewith one or more selection flags and one or more instruction flow control flags; and
cache control logic coupled to the cache memory, the cache control logic comparing selected information associated with an instruction stored at a specified address in the read only memory with counterpart selected information associated with an instruction stored at the specified address in the cache memory,
wherein the selected information and counterpart selected information are selected based upon the one or more selection flags associated with a cache line corresponding to the specified address, and
wherein the cache control logic causes a change in instruction flow based upon the one or more instruction flow control flags associated with the cache line corresponding to the address when there is a comparison match between the selected information and the counterpart selected information.
22. The hot patch system according to claim 21, wherein the one or more selection flags include:
a first flag indicating whether the cache control logic is to compare the specified address with an address of one or more instructions within the cache memory;
a second flag indicating whether the cache control logic is to compare an opcode stored at least at the specified address within the read only memory with an opcode stored at the specified address within the cache memory; and
a third flag indicating whether the cache control logic is to compare an opcode stored at any address within the read only memory with an opcode stored at the specified address within the cache memory.
23. The hot patch system according to claim 21, wherein the one or more instruction flow control flags include:
a replace flag indicating that an opcode at the specified address within the cache memory is to be executed instead of an opcode at the specified address within the read only memory;
a block flag indicating that more than one opcodes starting at the specified address within the cache memory are to be executed instead of or before an opcode at the specified address within the read only memory; and
a noop flag indicating that an opcode at the specified address within the read only memory is to be skipped.
US10/774,994 1999-12-30 2004-02-09 Method and apparatus for changing microcode to be executed in a processor Expired - Lifetime US7444630B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US10/774,994 US7444630B2 (en) 1999-12-30 2004-02-09 Method and apparatus for changing microcode to be executed in a processor
US12/914,978 USRE45278E1 (en) 1999-12-30 2010-10-28 Method and apparatus for changing microcode to be executed in a processor

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US09/475,927 US6691308B1 (en) 1999-12-30 1999-12-30 Method and apparatus for changing microcode to be executed in a processor
US10/774,994 US7444630B2 (en) 1999-12-30 2004-02-09 Method and apparatus for changing microcode to be executed in a processor

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09/475,927 Continuation US6691308B1 (en) 1999-12-30 1999-12-30 Method and apparatus for changing microcode to be executed in a processor

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/914,978 Reissue USRE45278E1 (en) 1999-12-30 2010-10-28 Method and apparatus for changing microcode to be executed in a processor

Publications (2)

Publication Number Publication Date
US20040158827A1 US20040158827A1 (en) 2004-08-12
US7444630B2 true US7444630B2 (en) 2008-10-28

Family

ID=30771309

Family Applications (3)

Application Number Title Priority Date Filing Date
US09/475,927 Expired - Lifetime US6691308B1 (en) 1999-12-30 1999-12-30 Method and apparatus for changing microcode to be executed in a processor
US10/774,994 Expired - Lifetime US7444630B2 (en) 1999-12-30 2004-02-09 Method and apparatus for changing microcode to be executed in a processor
US12/914,978 Expired - Lifetime USRE45278E1 (en) 1999-12-30 2010-10-28 Method and apparatus for changing microcode to be executed in a processor

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US09/475,927 Expired - Lifetime US6691308B1 (en) 1999-12-30 1999-12-30 Method and apparatus for changing microcode to be executed in a processor

Family Applications After (1)

Application Number Title Priority Date Filing Date
US12/914,978 Expired - Lifetime USRE45278E1 (en) 1999-12-30 2010-10-28 Method and apparatus for changing microcode to be executed in a processor

Country Status (1)

Country Link
US (3) US6691308B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8607208B1 (en) * 2008-10-01 2013-12-10 Oracle International Corporation System and methods for object code hot updates

Families Citing this family (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6691308B1 (en) * 1999-12-30 2004-02-10 Stmicroelectronics, Inc. Method and apparatus for changing microcode to be executed in a processor
US6643769B1 (en) * 2000-08-23 2003-11-04 Hewlett-Packard Development Company, L.P. System and method for enabling selective execution of computer code
US7310800B2 (en) * 2001-02-28 2007-12-18 Safenet, Inc. Method and system for patching ROM code
US6823445B2 (en) * 2001-07-31 2004-11-23 International Business Machines Corporation Limiting concurrent modification and execution of instructions to a particular type to avoid unexpected results
US8074201B2 (en) * 2002-07-10 2011-12-06 National Instruments Corporation Deployment and execution of a program on an embedded device
US7296259B2 (en) * 2002-09-11 2007-11-13 Agere Systems Inc. Processor system with cache-based software breakpoints
US8539469B2 (en) * 2004-05-11 2013-09-17 Microsoft Corporation Efficient patching
EP1622009A1 (en) * 2004-07-27 2006-02-01 Texas Instruments Incorporated JSM architecture and systems
US20060174244A1 (en) * 2005-01-31 2006-08-03 Woods Paul R System and method for modifying execution flow in firmware
US20060179323A1 (en) * 2005-02-04 2006-08-10 Xac Automation Corp. Method for substitution of prompts for an encrypting pin device
US7543287B2 (en) * 2005-06-30 2009-06-02 Intel Corporation Using a block device interface to invoke device controller functionality
KR100573334B1 (en) * 2005-08-31 2006-04-24 주식회사 칩스앤미디어 Computer having dynamically changeable instruction set in realtime
CN100445949C (en) * 2005-11-23 2008-12-24 晨星半导体股份有限公司 Amending method for content of built-in program code of ROM
US20080115217A1 (en) * 2006-10-31 2008-05-15 Hewlett-Packard Development Company, L.P. Method and apparatus for protection of a computer system from malicious code attacks
US8296849B2 (en) * 2006-10-31 2012-10-23 Hewlett-Packard Development Company, L.P. Method and apparatus for removing homogeneity from execution environment of computing system
US20090031121A1 (en) * 2007-07-24 2009-01-29 Via Technologies Apparatus and method for real-time microcode patch
US20090031107A1 (en) * 2007-07-24 2009-01-29 Via Technologies On-chip memory providing for microcode patch overlay and constant update functions
US20090031110A1 (en) * 2007-07-24 2009-01-29 Via Technologies Microcode patch expansion mechanism
US20090031109A1 (en) * 2007-07-24 2009-01-29 Via Technologies Apparatus and method for fast microcode patch from memory
US20090031090A1 (en) * 2007-07-24 2009-01-29 Via Technologies Apparatus and method for fast one-to-many microcode patch
US20090031103A1 (en) * 2007-07-24 2009-01-29 Via Technologies Mechanism for implementing a microcode patch during fabrication
CN101799763B (en) * 2009-02-10 2013-01-30 华为技术有限公司 Method, device and system for patching kernel on line
US9904616B2 (en) * 2011-12-14 2018-02-27 International Business Machines Corporation Instruction output dependent on a random number-based selection or non-selection of a special command from a group of commands
US9632779B2 (en) * 2011-12-19 2017-04-25 International Business Machines Corporation Instruction predication using instruction filtering
US9384109B2 (en) 2014-04-17 2016-07-05 Texas Instruments Deutschland Gmbh Processor with debug pipeline
CN105988798B (en) * 2015-02-12 2020-07-31 南京中兴软件有限责任公司 Patch processing method and device
CN107436842A (en) * 2016-05-25 2017-12-05 中兴通讯股份有限公司 A kind of microcode adjustment method and veneer
GB201621776D0 (en) * 2016-12-20 2017-02-01 Undo Ltd Debugging Method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5796974A (en) 1995-11-07 1998-08-18 Advanced Micro Devices, Inc. Microcode patching apparatus and method
US5860104A (en) 1995-08-31 1999-01-12 Advanced Micro Devices, Inc. Data cache which speculatively updates a predicted data cache storage location with store data and subsequently corrects mispredicted updates
US5887152A (en) 1995-04-12 1999-03-23 Advanced Micro Devices, Inc. Load/store unit with multiple oldest outstanding instruction pointers for completing store and load/store miss instructions
US5983337A (en) 1997-06-12 1999-11-09 Advanced Micro Devices, Inc. Apparatus and method for patching an instruction by providing a substitute instruction or instructions from an external memory responsive to detecting an opcode of the instruction
US6049672A (en) * 1996-03-08 2000-04-11 Texas Instruments Incorporated Microprocessor with circuits, systems, and methods for operating with patch micro-operation codes and patch microinstruction codes stored in multi-purpose memory structure
US6295644B1 (en) 1999-08-17 2001-09-25 Hewlett-Packard Company Method and apparatus for patching program text to improve performance of applications
US6691308B1 (en) * 1999-12-30 2004-02-10 Stmicroelectronics, Inc. Method and apparatus for changing microcode to be executed in a processor

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5136696A (en) * 1988-06-27 1992-08-04 Prime Computer, Inc. High-performance pipelined central processor for predicting the occurrence of executing single-cycle instructions and multicycle instructions
US6091897A (en) * 1996-01-29 2000-07-18 Digital Equipment Corporation Fast translation and execution of a computer program on a non-native architecture by use of background translator
US6101580A (en) * 1997-04-23 2000-08-08 Sun Microsystems, Inc. Apparatus and method for assisting exact garbage collection by using a stack cache of tag bits
US6021273A (en) * 1997-06-30 2000-02-01 Sun Microsystems, Inc. Interpreter generation and implementation utilizing interpreter states and register caching
US6240506B1 (en) * 1998-10-02 2001-05-29 Advanced Micro Devices, Inc. Expanding instructions with variable-length operands to a fixed length
US7111290B1 (en) * 1999-01-28 2006-09-19 Ati International Srl Profiling program execution to identify frequently-executed portions and to assist binary translation
US6851109B1 (en) * 1999-05-06 2005-02-01 International Business Machines Corporation Process and system for dynamically compiling a partially interpreted method
US6629312B1 (en) * 1999-08-20 2003-09-30 Hewlett-Packard Development Company, L.P. Programmatic synthesis of a machine description for retargeting a compiler
US6549959B1 (en) * 1999-08-30 2003-04-15 Ati International Srl Detecting modification to computer memory by a DMA device
US6704926B1 (en) * 2000-09-28 2004-03-09 International Business Machines Corporation Bimodal Java just-in-time complier
US20020069402A1 (en) * 2000-10-05 2002-06-06 Nevill Edward Colles Scheduling control within a system having mixed hardware and software based instruction execution
US6718539B1 (en) * 2000-12-22 2004-04-06 Lsi Logic Corporation Interrupt handling mechanism in translator from one instruction set to another
US7036118B1 (en) * 2001-12-20 2006-04-25 Mindspeed Technologies, Inc. System for executing computer programs on a limited-memory computing machine

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5887152A (en) 1995-04-12 1999-03-23 Advanced Micro Devices, Inc. Load/store unit with multiple oldest outstanding instruction pointers for completing store and load/store miss instructions
US5860104A (en) 1995-08-31 1999-01-12 Advanced Micro Devices, Inc. Data cache which speculatively updates a predicted data cache storage location with store data and subsequently corrects mispredicted updates
US5796974A (en) 1995-11-07 1998-08-18 Advanced Micro Devices, Inc. Microcode patching apparatus and method
US6049672A (en) * 1996-03-08 2000-04-11 Texas Instruments Incorporated Microprocessor with circuits, systems, and methods for operating with patch micro-operation codes and patch microinstruction codes stored in multi-purpose memory structure
US5983337A (en) 1997-06-12 1999-11-09 Advanced Micro Devices, Inc. Apparatus and method for patching an instruction by providing a substitute instruction or instructions from an external memory responsive to detecting an opcode of the instruction
US6295644B1 (en) 1999-08-17 2001-09-25 Hewlett-Packard Company Method and apparatus for patching program text to improve performance of applications
US6691308B1 (en) * 1999-12-30 2004-02-10 Stmicroelectronics, Inc. Method and apparatus for changing microcode to be executed in a processor

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
IBM Technical Disclosure Bulletin, published Oct. 1, 1993.

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8607208B1 (en) * 2008-10-01 2013-12-10 Oracle International Corporation System and methods for object code hot updates

Also Published As

Publication number Publication date
US6691308B1 (en) 2004-02-10
US20040158827A1 (en) 2004-08-12
USRE45278E1 (en) 2014-12-02

Similar Documents

Publication Publication Date Title
USRE45278E1 (en) Method and apparatus for changing microcode to be executed in a processor
US6865667B2 (en) Data processing system having redirecting circuitry and method therefor
US5481734A (en) Data processor having 2n bits width data bus for context switching function
CN105980993B (en) Data processing apparatus and method
US7996646B2 (en) Efficient encoding for detecting load dependency on store with misalignment
US20020188830A1 (en) Bit replacement and extraction instructions
US8539210B2 (en) Context switching with automatic saving of special function registers memory-mapped to all banks
EP2842041B1 (en) Data processing system and method for operating a data processing system
US5617553A (en) Computer system which switches bus protocols and controls the writing of a dirty page bit of an address translation buffer
JPS58125148A (en) Apparatus for forecasting conditioned branch instruction
CA2383532A1 (en) Branch instruction for processor architecture
US6931477B2 (en) Method and apparatus for patching code and data residing on a memory
TW202246973A (en) Hardware processor and processor
US20230084523A1 (en) Data Processing Method and Device, and Storage Medium
US6272453B1 (en) Concurrent legacy and native code execution techniques
US7996651B2 (en) Enhanced microprocessor or microcontroller
US6757809B1 (en) Data processor having 2n bits width data bus for context switching functions
US11500982B2 (en) Systems and methods for reliably injecting control flow integrity into binaries by tokenizing return addresses
CN112596792A (en) Branch prediction method, apparatus, medium, and device
US11436124B2 (en) Apparatus and method for accessing metadata when debugging a device
US7191430B2 (en) Providing instruction execution hints to a processor using break instructions
US7401328B2 (en) Software-implemented grouping techniques for use in a superscalar data processing system
US20040019764A1 (en) System and method for processing data in an integrated circuit environment
US7039789B2 (en) Circular addressing algorithms providing increased compatibility with one or more higher-level programming languages
US20140297958A1 (en) System and method for updating an instruction cache following a branch instruction in a semiconductor device

Legal Events

Date Code Title Description
STCF Information on status: patent grant

Free format text: PATENTED CASE

RF Reissue application filed

Effective date: 20101028

FPAY Fee payment

Year of fee payment: 4