← Back to Patent Explorer
US4812989A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for executing machine language instructions

Assignee: Fujitsu IT Holdings Inc
•
Filing: 1986-10-15
•
Granted: 1989-03-14
•
Expires: 2006-10-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The present invention provides for use in a data processor a method for mapping a respective machine language instruction stored by cache storage unit to a respective microprogrammed algorithm stored in control storage unit means, wherein the respective machine language instruction includes an opcode field with a prescribed value and at least one nonopcode field with one of a plurality of values, the method, comprising the steps of in the course of one data processor clock cycle, providing the respective machine language instruction to a decoder for converting the prescribed opcode field and the at least one nonopcode field of the respective machine language instruction into a respective combination of decoded signals which corresponds to the prescribed opcode field value and that at least one nonopcode field value of the respective machine language instruction; and providing the respective combination of decoded signals to combinational logic for converting the respective combination of decode signals into a respective address signal which points to a microprogrammed algorithm stored by the control storage unit means.

Inventors

  • 👤 Robert M. Maier
  • 👤 Allan J. Zmyslowski
  • 👤 Carolee N. Schober

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 07:12
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/22; G06F9/26; G06F9/261

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 171 words
For use in a data processor, a method for mapping a respective machine language instruction stored by cache storage unit means to a respective microprogrammed algorithm stored by control storage unit means, wherein the respective machine language instruction includes an opcode field with a prescribed value and includes at least one nonopcode field with one of a plurality of values, the method comprising the steps of: in the course of one data processor clock cycle, (i) providing the respective machine language instruction to means for converting the prescribed opcode field and the at least one nonopcode field of the respective machine language instruction into a respective first combination of signals which corresponds to the prescribed opcode field value and the at least one nonopcode field value of the respective machine language instruction; and (ii) providing the respective first combination of signals to combinational logic means for coverting the respective first combination of signals into a respective address signal which points to a microprogrammed algorithm stored in the control storage unit means.
Claim 2
Dependent Claim 171 words
For use in a data processor, a method for mapping a respective machine language instruction stored by cache storage unit means to a respective microprogrammed algorithm stored by control storage unit means, wherein the respective machine language instruction includes an opcode field with a prescribed value and includes at least one nonopcode field with one of a plurality of values, the method comprising the steps of: in the course of one data processor clock cycle, (i) providing the respective machine language instruction to means for converting the prescribed opcode field and the at least one nonopcode field of the respective machine language instruction into a respective first combination of signals which corresponds to the prescribed opcode field value and the at least one nonopcode field value of the respective machine language instruction; and (ii) providing the respective first combination of signals to combinational logic means for coverting the respective first combination of signals into a respective address signal which points to a microprogrammed algorithm stored in the control storage unit means.
Claim 3
Dependent Claim 27 words
The method of claim 1 and further comprising the step of: entering the respective machine language instruction into respective first register means for holding the respective instruction.
Claim 4
Dependent Claim 27 words
The method of claim 1 and further comprising the step of: entering the respective address signal into respective second register means for holding the respective address signal.
Claim 5
Dependent Claim 188 words
For use in a data processor, a method for mapping a respective machine language instruction stored by cache storage unit means to a respective microprogrammed algorithm stored by control storage unit means, wherein the respective machine language instruction includes an opcode field with a prescribed value and includes at least one nonopcode field with one of a plurality of values, the method comprising the steps of: entering the respective machine language instruction into respective first register means for holding the respective instruction; substantially in the course of one data processor clock cycle, (i) providing the respective machine language instruction to means for converting the prescribed opcode field and the at least one nonopcode field of the respective machine language instruction into a respective first combination of signals which corresponds to the opcode field value and the at least one nonopcode field value of the respective machine language instruction, and (ii) providing the respective first combination of signals to combinational logic means for a converting the respective first combination of signals into a respective address signal which points to a microprogrammed algorithm stored in the control storage unit means.
Claim 6
Dependent Claim 188 words
For use in a data processor, a method for mapping a respective machine language instruction stored by cache storage unit means to a respective microprogrammed algorithm stored by control storage unit means, wherein the respective machine language instruction includes an opcode field with a prescribed value and includes at least one nonopcode field with one of a plurality of values, the method comprising the steps of: entering the respective machine language instruction into respective first register means for holding the respective instruction; substantially in the course of one data processor clock cycle, (i) providing the respective machine language instruction to means for converting the prescribed opcode field and the at least one nonopcode field of the respective machine language instruction into a respective first combination of signals which corresponds to the opcode field value and the at least one nonopcode field value of the respective machine language instruction, and (ii) providing the respective first combination of signals to combinational logic means for a converting the respective first combination of signals into a respective address signal which points to a microprogrammed algorithm stored in the control storage unit means.
Claim 7
Dependent Claim 47 words
The method of claim 4 wherein the opcode field of the respective machine language instruction specifies a register loading operation; and the nonopcode field of the respective machine language instruction specifies at least a one particular register from a set of registers which is to be loaded.
Claim 8
Dependent Claim 16 words
The method of claim 5 wherein the set of registers comprise at least one control register.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-03-13 1992-09-12 1993-03-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-03-13 1996-09-12 1997-03-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-03-13 2000-09-12 2001-03-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag