Patent US5237664A successfully refreshed from Google Patents.
US5237664A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Pipeline circuit
Assignee: Toshiba Corp
•
Filing: 1988-11-18
•
Granted: 1993-08-17
•
Expires: 2008-11-18
Abstract
Abstract A pipeline circuit adopted for a CPU or a microprocessor in a computer system, computes the effective branch destination address of a conditional branch instruction before or in parallel with the execution of the conditional branch instruction, judges according to a result of the execution of an instruction just before the conditional branch instruction whether or not a branch condition of the conditional branch instruction is met, and, if the branch condition is met, executes the conditional branch instruction while prefetching and decoding an instruction located at the branch destination address.
Inventors
- 👤 Kimiyoshi Usami
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 07:23
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/22; G06F9/28; G06F9/30; G06F9/38; G06F9/3802; G06F9/3804
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
317 words
An information processing system for processing instructions according to a pipeline circuit, comprising: an instruction fetching unit for fetching an instruction from a memory; an instruction decoding unit connected to said fetching unit for decoding an instruction transferred from said fetching unit; an execution unit connected to said decoding unit for executing the instruction decoded by said decoding unit; and an address generating unit connected to said decoding unit and said fetching unit for calculating an effective address of the decoded instruction in response to an address calculation request transferred from said decoding unit; wherein said fetching unit includes a program counter for storing an address of an instruction to be fetched from said memory and an instruction buffer for storing a fetched instruction, said address generating unit being connected to said instruction buffer for calculating said effective address based on a displacement transferred from said instruction buffer when said displacement is used for the address calculation; said address generating unit starting calculation of a branch destination address when a conditional branch instruction has been decoded by said decoding unit; said branch destination being held by said address generating unit if it is not determined whether or not the branch condition is satisfied after said branch destination address is calculated by said address generating unit; when it is determined that the branch condition is satisfied, the branch destination address being set in said program counter so that the fetching operation of said branch destination instruction is carried out; when it is determined that the branch condition is not satisfied, said branch destination address not being set in said program counter so that the fetching operation of said branch destination instruction is not carried out; and when it is determined that the branch condition is not satisfied before completion of the calculation of said branch destination address, said branch destination address calculation is continued up to the end.
Claim 2
Dependent Claim
317 words
An information processing system for processing instructions according to a pipeline circuit, comprising: an instruction fetching unit for fetching an instruction from a memory; an instruction decoding unit connected to said fetching unit for decoding an instruction transferred from said fetching unit; an execution unit connected to said decoding unit for executing the instruction decoded by said decoding unit; and an address generating unit connected to said decoding unit and said fetching unit for calculating an effective address of the decoded instruction in response to an address calculation request transferred from said decoding unit; wherein said fetching unit includes a program counter for storing an address of an instruction to be fetched from said memory and an instruction buffer for storing a fetched instruction, said address generating unit being connected to said instruction buffer for calculating said effective address based on a displacement transferred from said instruction buffer when said displacement is used for the address calculation; said address generating unit starting calculation of a branch destination address when a conditional branch instruction has been decoded by said decoding unit; said branch destination being held by said address generating unit if it is not determined whether or not the branch condition is satisfied after said branch destination address is calculated by said address generating unit; when it is determined that the branch condition is satisfied, the branch destination address being set in said program counter so that the fetching operation of said branch destination instruction is carried out; when it is determined that the branch condition is not satisfied, said branch destination address not being set in said program counter so that the fetching operation of said branch destination instruction is not carried out; and when it is determined that the branch condition is not satisfied before completion of the calculation of said branch destination address, said branch destination address calculation is continued up to the end.
Claim 3
Dependent Claim
73 words
The pipeline circuit in a computer system as claimed in claim 1, in which a reading operation of instructions stored in the instruction buffer is controlled by a pointer which indicates a position of a data to be read next and is advanced by one word whenever a data is read out of the instruction buffer according to a readout request from said instruction decoding unit or from said effective address generating unit.
Claim 4
Dependent Claim
59 words
The pipeline circuit in a computer system as claimed in claim 1, in which the branch destination address of the conditional branch instruction is computed even if it is found, before said effective address generating unit computes the effective branch destination address of the conditional branch instruction, that the branch condition of the conditional branch instruction is not met.
Claim 5
Dependent Claim
25 words
The information processing system as claimed in claim 1 wherein said execution unit is connected with said address generating unit through said instruction decoding unit.
References Cited (Backward Citations)
US3881173A
Cited
JPS573142A
Cited
US4430706A
Cited
JPS5848144A
Cited
US4435756A
Cited
EP0162778A2
Cited
US4760520A
Cited
US4870573A
Cited
US4827402A
Cited
US4679141A
Cited
EP0213301A2
Cited
EP0219203A2
Cited
US4907192A
Cited
US4853840A
Cited
US4881170A
Cited
US4991080A
Cited
US4974154A
Cited
US4858104A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-08-16 | 1997-02-15 | 1997-08-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-08-16 | 2001-02-15 | 2001-08-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-08-16 | 2005-02-15 | 2005-08-17 | $7700.00 | Window Closed / Lapsed |