Patent US5481705A successfully refreshed from Google Patents.
US5481705A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for executing a program with branch-to modifying instructions
Assignee: Canon Inc
•
Filing: 1993-06-28
•
Granted: 1996-01-02
•
Expires: 2013-06-28
Abstract
Abstract In a method for executing a program for sequentially reading step information registered in an execution queue in the order of registration in order to permit the modification of a branch-to address with ease and without error when the modification of the branch-to address is instructed during the debugging of the program, the step information which is no longer the branch-to address due to the modification is searched in response to the branch-to address modification instruction, the retrieved step information is erased from the execution queue, and step information which is a new branch-to address is registered at the position of the erased step.
Inventors
- 👤 Hitoshi Watanabe
- 👤 Tsuneaki Kadosawa
- 👤 Takashi Nakamura
- 👤 Eiji Koga
- 👤 Satoshi Asada
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 17:52
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/36; G06F11/362
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
145 words
A method for executing a program by a processor including a plurality of program steps to be executed, comprising the steps of: registering information of at least one of the program steps to be executed in an order of execution in a queue; searching information of program steps in the queue in response to an instruction for modifying a branch-to direction from a first direction to a second direction and retrieving information of the program step in the queue which is in the first direction; erasing the retrieved program step information from the queue; registering program step information of a program step which is in the second direction at the position of the erased program step in the queue; sequentially reading the program step information registered in the queue in the order of registration; and executing program steps corresponding to the read program step information.
Claim 2
Independent Claim
145 words
A method for executing a program by a processor including a plurality of program steps to be executed, comprising the steps of: registering information of at least one of the program steps to be executed in an order of execution in a queue; searching information of program steps in the queue in response to an instruction for modifying a branch-to direction from a first direction to a second direction and retrieving information of the program step in the queue which is in the first direction; erasing the retrieved program step information from the queue; registering program step information of a program step which is in the second direction at the position of the erased program step in the queue; sequentially reading the program step information registered in the queue in the order of registration; and executing program steps corresponding to the read program step information.
Claim 3
Dependent Claim
38 words
A method for executing a program according to claim 1, wherein a read position in the queue is stored as a pointer address and the pointer address is incremented each time one of the sequential readings is made.
Claim 4
Dependent Claim
39 words
A method for executing a program according to claim 1, wherein a position for registering the program step information is stored as a pointer address and the pointer address is modified each time the program step information is registered.
Claim 5
Dependent Claim
60 words
A method for executing a program according to claim 2, wherein the position of the retrieved program step is stored as a second pointer address until the program step in the second direction is registered at the same position, and the reading of the program step is inhibited when the pointer address and the second pointer address are the same.
Claim 6
Dependent Claim
24 words
A method for executing a program according to claim 1, wherein the information of the program step is a number identifying the program step.
Claim 7
Dependent Claim
48 words
A method for executing a program according to claim 5, wherein the number identifying the program step to be executed next is described in a preceding program step, and the number identifying the program step to be executed next is registered after the preceding program step is executed.
Claim 8
Independent Claim
161 words
An apparatus for executing a program including a plurality of program steps to be executed, said apparatus comprising: first registration means for registering information of at least one of the program steps to be executed in an order of execution in a queue; retrieval means for searching information of program steps in the queue in response to an instruction for modifying a branch-to direction from a first direction to a second direction and retrieving information of the program step in the queue which is in the first direction; erasing means for erasing the retrieved program step information from the queue; second registration means for registering program step information of a program step which is in the second direction at the position of the erased program step in the queue; reading means for sequentially reading the program step information registered in the queue in the order of registration; and execution means for executing program steps corresponding to the read program step information.
Claim 9
Independent Claim
161 words
An apparatus for executing a program including a plurality of program steps to be executed, said apparatus comprising: first registration means for registering information of at least one of the program steps to be executed in an order of execution in a queue; retrieval means for searching information of program steps in the queue in response to an instruction for modifying a branch-to direction from a first direction to a second direction and retrieving information of the program step in the queue which is in the first direction; erasing means for erasing the retrieved program step information from the queue; second registration means for registering program step information of a program step which is in the second direction at the position of the erased program step in the queue; reading means for sequentially reading the program step information registered in the queue in the order of registration; and execution means for executing program steps corresponding to the read program step information.
Claim 10
Dependent Claim
48 words
An apparatus for executing a program according to claim 7 further comprising: storing means for storing a read position for said reading means as a pointer address; and increment means for incrementing the pointer address each time one of the sequential readings is made by said reading means.
Claim 11
Dependent Claim
48 words
An apparatus for executing a program according to claim 7 further comprising: storing means for storing a position for registering the program step information as a pointer address; and modifying means for modifying the pointer address each time the program step information is registered by said registration means.
Claim 12
Dependent Claim
68 words
An apparatus for executing a program according to claim 8 further comprising: second storing means for storing the retrieved position of the program step as a second pointer address until the program step in the second direction is registered at the same position; and inhibiting means for inhibiting said reading means to read the program step when the pointer address and the second pointer address are the same.
Claim 13
Dependent Claim
24 words
An apparatus for executing a program according to claim 7 wherein the information of the program step is a number identifying the program step.
Claim 14
Dependent Claim
51 words
An apparatus for executing a program according to claim 11 wherein the number identifying the program step to be executed next is described in a preceding program step, and said registration means registers the number of identifying the program step to be executed next after the preceding program step is executed.
References Cited (Backward Citations)
US4439828A
Cited
US4827402A
Cited
US4954947A
Cited
US5263153A
Cited
US5193156A
Cited
US5099419A
Cited
US5034880A
Cited
US5072364A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-01-01 | 1999-07-03 | 2000-01-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-01-01 | 2003-07-03 | 2004-01-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-01-01 | 2007-07-03 | 2008-01-02 | $7700.00 | Window Closed / Lapsed |