US4897787A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data processing system
Assignee: Hitachi Ltd
•
Filing: 1987-02-17
•
Granted: 1990-01-30
•
Expires: 2007-02-17
Abstract
Abstract An instruction is constituted by a plurality of words, minimum necessary information necessary for effective address calculation of an operand is stored in a leading word and a word or words containing an operation specification field (operation words) are arranged to continue the first word. According to this system, the operation word can be decoded concurrently with the address calculation of the operand or the operand fetch operation. Therefore, there is no need to secure a time exclusively for decoding the operation word and the execution speed of the instruction requiring the operand can be improved.
Inventors
- 👤 Ikuya Kawasaki
- 👤 Keiichi Kurakazu
- 👤 Hideo Maejima
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 06:21
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3818; G06F9/3822; G06F9/30145; G06F9/30149; G06F9/3824
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
115 words
A method of controlling processing in a microprocessor having a decoder for decoding a multi-word instruction including a first word having operand address information and means for controlling said execution means in response to an output of said decoder, comprising the steps of: (a) decoding said first word using said decoder to produce a decoded result; (b) providing said operand in response to the decoded result produced in said step (a); (c) decoding said second word after completion of said step (a) using the decoder used in step (a) to determine an operation to be performed; and (d) processing said operand using said execution means in response to the operation determined in said step (c).
Claim 2
Independent Claim
115 words
A method of controlling processing in a microprocessor having a decoder for decoding a multi-word instruction including a first word having operand address information and means for controlling said execution means in response to an output of said decoder, comprising the steps of: (a) decoding said first word using said decoder to produce a decoded result; (b) providing said operand in response to the decoded result produced in said step (a); (c) decoding said second word after completion of said step (a) using the decoder used in step (a) to determine an operation to be performed; and (d) processing said operand using said execution means in response to the operation determined in said step (c).
Claim 3
Dependent Claim
34 words
A method according to claim 1, wherein said execution means includes address calculation means, and wherein said step (b) includes: (b1) calculating an address of said operand by use of said address calculation means.
Claim 4
Dependent Claim
32 words
A method according to claim 2, wherein said execution means further includes fetch means, and wherein said step (b) further includes: (b2) fetching said operand to a register in said execution means.
Claim 5
Dependent Claim
23 words
A method according to claim 3, wherein said step (b2) and said step (c) performed to overlap at least partly with each other.
Claim 6
Dependent Claim
34 words
A method according to claim 4, wherein said control means includes a micro ROM, and wherein said step (b) includes: (b3) reading a first microinstruction from said micro ROM for controlling said fetch means.
Claim 7
Dependent Claim
24 words
A method according to claim 5, wherein said step (b1) and said step (b3) are performed to overlap at least partly with each other.
Claim 8
Dependent Claim
45 words
A method according to claim 6, wherein said execution means further includes an arithmetic logic means for processing said operand in said step (d), and further including the steps of: (e) reading a second microinstruction from said micro ROM for controlling said arithmetic logic means.
Claim 9
Dependent Claim
24 words
A method according to claim 7, wherein said step (b2) and said step (e) are performed to overlap at least partly with each other.
Claim 10
Dependent Claim
18 words
A method according to claim 8, wherein said step (d) is performed immediately after completion of step (b2).
Claim 11
Dependent Claim
33 words
A method according to claim 9, wherein said steps (a), (b1), (b3), (c) and (e) each take at least one machine cycle, respectively, and said step (b2) takes at least two machine cycles.
Claim 12
Dependent Claim
26 words
A method according to claim 10, wherein said step (d) is started from a machine cycle immediately following the last machine cycle in said step (b2).
Claim 13
Independent Claim
187 words
A method of controlling processing in a microprocessor having a decoder for decoding at least tow words of a plurality of words forming an instruction including a first word having first information for specifying an address of an first operand, a second word having second information for specifying said address of said first operand, a third word having an operation code and third information for specifying an address of a second operand; execution means for performing an operation designated by said operation code on said first and second operands; and control means for controlling said execution means in response to an output of said decoder, comprising the steps of: (a) decoding said first word using said decoder; (b) providing said first operand in response to said step (a) and said second word; (c) decoding said third word after completion of said step (a) using said decoder; (d) providing said second operand in response to said step (c); and (e) processing said first operand provided in said step (b) and said second operand provided in said step (d) by said execution means in response to said step (c).
Claim 14
Independent Claim
187 words
A method of controlling processing in a microprocessor having a decoder for decoding at least tow words of a plurality of words forming an instruction including a first word having first information for specifying an address of an first operand, a second word having second information for specifying said address of said first operand, a third word having an operation code and third information for specifying an address of a second operand; execution means for performing an operation designated by said operation code on said first and second operands; and control means for controlling said execution means in response to an output of said decoder, comprising the steps of: (a) decoding said first word using said decoder; (b) providing said first operand in response to said step (a) and said second word; (c) decoding said third word after completion of said step (a) using said decoder; (d) providing said second operand in response to said step (c); and (e) processing said first operand provided in said step (b) and said second operand provided in said step (d) by said execution means in response to said step (c).
Claim 15
Dependent Claim
43 words
A method according to claim 12, wherein said execution means includes address calculation means, and wherein said step (b) includes: (b1) calculating an address of said first operand using said address calculation means in response to said first information and said second information.
Claim 16
Dependent Claim
34 words
A method according to claim 13, wherein said execution means further includes fetch means, and wherein said step (b) further includes: (b2) fetching said first operand to a first register in said execution means.
Claim 17
Dependent Claim
22 words
A method according to claim 14, wherein said step (b2) and step (c) overlap are performed at least partly with each other.
Claim 18
Dependent Claim
33 words
A method according to claim 15, wherein said control means includes micro ROM, and wherein said step (b) includes: (b3) reading a first microinstruction from said micro ROM for controlling said fetch means.
Claim 19
Dependent Claim
24 words
A method according to claim 16, wherein said step (b1) and said step (b3) are performed to overlap at least partly with each other.
Claim 20
Dependent Claim
30 words
A method according to claim 17, wherein said step (d) includes: (d1) calculating an address of said second operand using said address calculation means in response to said third information.
Claim 21
Dependent Claim
25 words
A method according to claim 18, wherein said step (d) further includes: (d2) fetching said second operand to a second register in said execution means.
Claim 22
Dependent Claim
26 words
A method according to claim 19, wherein said step (d) further includes: (d3) reading a second microinstruction from said micro ROM for controlling said fetch means.
Claim 23
Dependent Claim
24 words
A method according to claim 20, wherein said step (d1) and said step (b2) are performed to overlap at least partly with each other.
Claim 24
Dependent Claim
33 words
A method according to claim 21, wherein said execution means further includes arithmetic logic means for processing in said step (e), and wherein said arithmetic logic means is controlled by said second microinstruction.
Claim 25
Dependent Claim
24 words
A method according to claim 22, wherein said step (d3) and said step (b2) are performed to overlap at least partly with each other.
Claim 26
Dependent Claim
17 words
A method according to claim 23, wherein said step (e) is performed immediately after said step (d2).
Claim 27
Dependent Claim
17 words
A method according to claim 24, wherein said step (d2) is performed immediately after said step (b2).
Claim 28
Dependent Claim
36 words
A method according to claim 12, wherein said first information includes addressing mode specification information for said first operand, and said second information includes displacement or offset information in accordance with said addressing mode specification information.
Claim 29
Dependent Claim
19 words
A method according to claim 26, wherein said third information includes addressing mode specification information for said second operand.
References Cited (Backward Citations)
US3958221A
Cited
US4028670A
Cited
US4398245A
Cited
JPS5711121A
Cited
US4631672A
Cited
US4521851A
Cited
US4616313A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-01-29 | 1993-07-31 | 1994-01-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-01-29 | 1997-07-31 | 1998-01-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-01-29 | 2001-07-31 | 2002-01-30 | $7700.00 | Window Closed / Lapsed |