Jump to content

Execute instruction

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Certes (talk | contribs) at 17:01, 21 December 2023 (typo: Interruptible (via WP:JWB)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In a computer instruction set architecture (ISA), an execute instruction is a machine language instruction which treats data as a machine instruction and executes it.

It can be considered a fourth mode of instruction sequencing after ordinary sequential execution, branching, and interrupting.[1] Since it is an instruction that operates on other instructions like the repeat instruction, it has also been classified as a meta-instruction.[2]

Computer models

Many computer families introduced in the 1950s and 1960s include execute instructions: the IBM 709[1] and IBM 7090 (op code mnemonic: XEC),[3] the IBM 7030 Stretch (EX, EXIC),[4][1] the PDP-1/-4/-7/-9/-15 (XCT),[5][6] the UNIVAC 1100/2200 (EXRI),[7] the CDC 924 (XEC),[8] the PDP-6/-10 (XCT), the IBM System/360 (EX),[9] the GE-600/Honeywell 6000 (XEC, XED),[10] the SDS-9xx (EXU),[11] the SDS 92 (EXU),[12] and the SDS Sigma series (EXU).[13]

Fewer 1970s designs include execute instructions: the Nuclear Data 812 minicomputer (1971) (XCT),[14] the HP 3000 (1972) (XEQ),[15] and the Texas Instruments TI-990 (1975)[16] and its microprocessor version, the TMS9900 (1976) (X).[17] An execute instruction was proposed for the PDP-11 in 1970,[18] but never implemented for it[19] or its successor, the VAX.[20]

Modern instruction sets do not include execute instructions because they interfere with pipelining, prefetching, and other optimizations.[citation needed]

Semantics

The instruction to be executed, the target instruction, may be in a register or fetched from memory. Some architectures allow the target instruction to itself be an execute instruction; others do not.

The target instruction is executed as if it were in the memory location of the execute instruction. If, for example, it is a subroutine call instruction, execution is transferred to the subroutine, with the return location being the location after the execute instruction. However, some architectures implement variants of the execute instruction which inhibit branches.[1]

The System/360 supports variable-length target instructions. It also supports modifying the target instruction before executing it. The target instruction must start on an even-numbered byte.[9]

The GE-600 series supports execution of two-instruction sequences, which must be doubleword-aligned.[10]

Some architectures support an execute instruction which operates in a different protection and address relocation mode. For example, the ITS PDP-10 paging device supports a privileged-mode XCTR 'execute relocated' instruction which allows memory reads, writes, or both to use the user-mode page mappings.[21] Similarly, the KL10 variant of the PDP-10 supports the privileged instruction PXCT 'previous context XCT'.[22]

The execute instruction can cause several problems when one execute instruction points to another one and so on:

  • the processor may be uninterruptible for multiple clock cycles if the execute instruction cannot be interrupted in the middle of execution;
  • similarly, the processor may go into an infinite loop if the series of execute instructions is circular and uninterruptible;
  • if the execute instructions are on different swap pages, all of the pages need to be swapped in for the instruction to complete, which can cause thrashing.

Similar issues arise with multilevel indirect addressing modes.

Applications

The execute instruction has several applications:[1]

  • Functioning as a single-instruction subroutine without the usual overhead of subroutine calls; that instruction may call a full subroutine if necessary.[1]
  • Late binding
    • Implementation of call by name and other thunks.[1]
    • A table of execute targets may be used for dynamic dispatch of the methods or virtual functions of an object or class, especially when the method or function may often be implementable as a single instruction.[19]
    • An execute target may contain a hook for adding functionality or for debugging; it is normally initialized as a NOP which may be overridden dynamically.
    • An execute target may change between a fast version of an operation and a fully traced version.[23][24][25]
  • Tracing, monitoring, and emulation
    • This may maintain a pseudo-program counter, leaving the normal program counter unchanged.[1]
  • Executing dynamically generated code, especially when memory protection prevents executable code from being writable.
  • Emulating self-modifying code, especially when it must be reentrant or read-only.[18]
  • In the IBM System/360, the execute instruction can modify bits 8-15 of the target instruction, effectively turning an instruction with a fixed argument (e.g., a length field) into an instruction with a variable argument.
  • Privileged-mode execute instructions as on the KL10 are used by operating system kernels to execute operations such as block copies within the virtual space of user processes.

Notes

  1. ^ a b c d e f g h Brooks, F.P. (March 1960). "The execute operations—a fourth mode of instruction sequencing". Communications of the ACM. 3 (3): 168–170. doi:10.1145/367149.367168. S2CID 37725430.
  2. ^ Rossman, George E. (December 1975). "A Course of Study in Computer Hardware Architecture". IEEE Computer. 8 (12): 44–63. doi:10.1109/C-M.1975.218835. S2CID 977792., p. 50
  3. ^ Reference Manual, IBM 7090 Data Processing System (PDF). IBM. March 1962. p. 36.
  4. ^ Reference Manual, 7030 Data Processing System (PDF). IBM. August 1961. p. 50.
  5. ^ Programmed Data Processor-1 Manual (PDF). Digital Equipment Corporation. 1961. p. 14.
  6. ^ Supnik, Bob. "Architectural Evolution in DEC's 18b Computers" (PDF). p. 8 (page numbers not shown).
  7. ^ Univac 1107 Central Computer (PDF). November 1961. p. 12-1.
  8. ^ Control Data 924 Computer Reference Manual (PDF). October 1962. p. 2-41.
  9. ^ a b IBM System/360 Principles of Operation (PDF). IBM. 1964. p. 65. A22-6821-0.
  10. ^ a b GE-635 System Manual (PDF). General Electric Computer Department. July 1964. p. A-5.
  11. ^ SDS 940 Theory of Operation (PDF). Scientific Data Systems. March 1967. p. 2-12. SDS-98-01-26A.
  12. ^ SDS 92 Computer. Scientific Data Systems. June 1965. p. 2-6.
  13. ^ Xerox SIGMA 7 Computer: Reference Manual (PDF). 90 09 5J; XG46, File No: 1X03 (0 ed.). Xerox Corporation. October 1973. pp. 70–71.{{cite book}}: CS1 maint: others (link)
  14. ^ Principles of Programming the ND812 Computer (PDF). Nuclear Data, Inc. 1971. p. 4-4.
  15. ^ HP 3000 Computer System: Machine Instruction Set Reference Manual (PDF). Hewlett-Packard. 1980. p. 2-31.
  16. ^ 990 Computer Family Systems Handbook (PDF). Texas Instruments. p. 3-28.
  17. ^ TMS 9900 Microprocessor Data Manual (PDF). Texas Instruments. December 1976. p. 24.
  18. ^ a b van de Goor, Ad (September 21, 1970). "The Execute Instruction" (PDF). PDP-11/40 Technical Memorandum 18.
  19. ^ a b PDP11 Processor Handbook: PDP11/04/34a/44/60/60 (PDF). Digital Equipment Corporation. 1979.
  20. ^ VAX MACRO and Instruction Set Reference Manual (PDF). Compaq Computer Corporation. April 2001. AA-PS6GD-TE.
  21. ^ Holloway, J. (February 20, 1970). "Hardware Memo 2 - PDP-10 Paging Device" (PDF). MIT AI Lab. p. 11.
  22. ^ DECsystem-10, DECSYSTEM-20 Processor Reference Manual (PDF). Digital Equipment Corporation. June 1982. p. 2-63. AA-H391A-TK, AD-H391A-T1.
  23. ^ Gabriel, Richard P. (August 1985). Performance and Evaluation of Lisp Systems (PDF). MIT Press. p. 32. ISBN 9780262070935.
  24. ^ Pitman, Kent M. "PURE". The Revised Maclisp Manual, Sunday Morning Edition.
  25. ^ Moon, David A. (April 1974). Maclisp Reference Manual (PDF). Revision 0. p. 181.