Patent US5146586A successfully refreshed from Google Patents.
US5146586A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Arrangement for storing an execution history in an information processing unit
Assignee: NEC Corp
•
Filing: 1990-02-13
•
Granted: 1992-09-08
•
Expires: 2010-02-13
Abstract
Abstract A tracer memory (7) stores the history of execution of addresses for the microprogram of an information processing unit to provide clues to the identification of the cause of any exceptional event that may occur in the unit. A pointer register (10) is indexed by one to store in the tracer memory the state of a predetermined group of logical signals at a location designated by the pointer value. When the result of addition to the pointer value surpasses the end address of the tracer memory, the pointer value is changed to the head address of the tracer memory so that data previously written is over written. The tracer memory contains N addresses and on the occurrence of an exceptional event, the current address J in a pointer register is stored in a mask end register 12 and a preceding address I, separated by a predetermined number M of addresses from address J, is stored in a mask start register 11. The value J-M is stored in said mask start register if J-M>0; otherwise, the value {N+(J-M)} is stored. If a second exceptional event occurs during the execution of a failure recovery procedure for the first exceptional event, there is preserved the execution history of the failure recovery procedure caused by the first exceptional event.
Inventors
- 👤 Hirotaka Nakano
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 05:28
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/0703; G06F11/0766; G06F11/0706; G06F11/0721; G06F11/0793; G06F11/30; G06F11/34; G06F11/3466; G06F11/348
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
226 words
An arrangement for storing an execution history in an information processing unit, comprising: control storage means for storing at least one microprogram consisting of a plurality of microinstructions; microinstruction storage means for temporarily storing a microinstruction read out of said control storage means; pointer storage means for storing a pointer value; history data storage means for storing a state of a predetermined group of logical signals at a storage location in said history data storage means designated by said pointer value; mask-start-address storage means and mask-end-address storage means for storing a mask start address and mask end address, respectively; mask indication means for selectively indicating one of first and second states; and history storage control means for performing, if said mask indication means indicates said first state, a first process of storing the result of addition of said pointer value and one into said pointer storage means and, when said result of addition has surpassed an end address of said history data storage means, storing a head address of said history data storage means into said pointer storage means, but if said mask indication means indicates said second state, a second process of updating said pointer value so as to prevent accessing of the addresses ranging from said mask start address in said mask-start-address storage means to said mask end address in said mask-end-address storage means.
Claim 2
Dependent Claim
226 words
An arrangement for storing an execution history in an information processing unit, comprising: control storage means for storing at least one microprogram consisting of a plurality of microinstructions; microinstruction storage means for temporarily storing a microinstruction read out of said control storage means; pointer storage means for storing a pointer value; history data storage means for storing a state of a predetermined group of logical signals at a storage location in said history data storage means designated by said pointer value; mask-start-address storage means and mask-end-address storage means for storing a mask start address and mask end address, respectively; mask indication means for selectively indicating one of first and second states; and history storage control means for performing, if said mask indication means indicates said first state, a first process of storing the result of addition of said pointer value and one into said pointer storage means and, when said result of addition has surpassed an end address of said history data storage means, storing a head address of said history data storage means into said pointer storage means, but if said mask indication means indicates said second state, a second process of updating said pointer value so as to prevent accessing of the addresses ranging from said mask start address in said mask-start-address storage means to said mask end address in said mask-end-address storage means.
Claim 3
Dependent Claim
80 words
The arrangement for storing an execution history in an information processing unit as recited in claim 1 wherein said history storage control means further performs a third process of having said mask indication means indicate said second state in response to a mask-setting microinstruction read out of said control storage means into said microinstruction storage means and, at the same time, setting said mask start address and mask end address in said mask-start-address storage means and mask-end-address storage means, respectively.
Claim 4
Dependent Claim
56 words
The arrangement for storing an execution history in an information processing unit as recited in claim 2 wherein said history storage control means further performs a fourth process of having said mask indication means indicate said first state in response to a mask-resetting microinstruction read out of said control storage means into said microinstruction storage means.
Claim 5
Dependent Claim
60 words
The arrangement for storing an execution history in an information processing unit as recited in claim 1 wherein said history data storage means includes N addresses, said mask-start-address storage means stores a mask start address I and said mask-end-address storage means stores a mask end address J where address I precedes address J by a predetermined number M of addresses.
Claim 6
Dependent Claim
41 words
The arrangement for storing an execution history in an information processing unit as recited in claim 4 wherein the value J-M is stored in said mask-start-address storage means if J-M>0; otherwise, the value {N+(J-M)} is stored in said mask-start-address storage means.
Claim 7
Dependent Claim
228 words
In an arrangement for storing an execution history in an information processing unit, said arrangement comprising control storage means for storing at least one microprogram consisting of a plurality of microinstructions, microinstruction storage means for temporarily storing a microinstruction read out of said control storage means, pointer storage means for storing a pointer value, history data storage means for storing a state of a predetermined group of logical signals at a storage location in said history data storage means designated by said pointer value, mask-start-address storage means and mask-end-address storage means for storing a mask start address and mask end address, respectively, mask indication means for selectively indicating one of first and second states, and history storage control means, said history storage control means performing the following steps: if said mask indication means indicates said first state, storing the result of addition of said pointer value and one into said pointer storage means; and, when said result of addition has surpassed an end address of said history data storage means, storing a head address of said history data storage means into said pointer storage means; but if said mask indication means indicates said second state, updating said pointer value so as to prevent accessing of the addresses ranging from said mask start address in said mask-start-address storage means to said mask end address in said mask-end-address storage means.
Claim 8
Dependent Claim
228 words
In an arrangement for storing an execution history in an information processing unit, said arrangement comprising control storage means for storing at least one microprogram consisting of a plurality of microinstructions, microinstruction storage means for temporarily storing a microinstruction read out of said control storage means, pointer storage means for storing a pointer value, history data storage means for storing a state of a predetermined group of logical signals at a storage location in said history data storage means designated by said pointer value, mask-start-address storage means and mask-end-address storage means for storing a mask start address and mask end address, respectively, mask indication means for selectively indicating one of first and second states, and history storage control means, said history storage control means performing the following steps: if said mask indication means indicates said first state, storing the result of addition of said pointer value and one into said pointer storage means; and, when said result of addition has surpassed an end address of said history data storage means, storing a head address of said history data storage means into said pointer storage means; but if said mask indication means indicates said second state, updating said pointer value so as to prevent accessing of the addresses ranging from said mask start address in said mask-start-address storage means to said mask end address in said mask-end-address storage means.
Claim 9
Dependent Claim
79 words
In the arrangement for storing an execution history in an information processing unit recited in claim 6, wherein said history storage control means further performs the step of having said mask indication means indicate said second state in response to a mask-setting microinstruction read out of said control storage means into said microinstruction storage means and, at the same time, setting said mask start address and mask end address in said mask-start-address storage means and mask-end-address storage means, respectively.
Claim 10
Dependent Claim
55 words
In the arrangement for storing an execution history in an information processing unit recited in claim 7, wherein said history storage control means further performs the step of having said mask indication means indicate said first state in response to a mask-resetting microinstruction read out of said control storage means into said microinstruction storage means.
References Cited (Backward Citations)
US3736566A
Cited
US4315313A
Cited
US4559596A
Cited
US4598364A
Cited
US4661953A
Cited
US4941087A
Cited
US4912707A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-09-08 | 1996-03-09 | 1996-09-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-09-08 | 2000-03-09 | 2000-09-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-09-08 | 2004-03-09 | 2004-09-08 | $7700.00 | Window Closed / Lapsed |