US4463422A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of processing an iterative program loop
Assignee: CSP Inc
•
Filing: 1982-07-12
•
Granted: 1984-07-31
•
Expires: 2002-07-12
Abstract
Abstract A method for speeding up computer execution of short, highly repetitive program loops, wherein the method involves storing the address of the first instruction in the program loop in the stack of a control element before the loop is run, and thereafter generating that address when it is needed to restart processing of the loop by holding the stack and reading its value into the control element's register.
Inventors
- 👤 James E. Storer
- 👤 James A. Waggett
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 15:56
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/32; G06F9/322; G06F9/325; G06F9/44; G06F9/448; G06F9/4482; G06F9/4484; G06F9/4486
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
172 words
A method of operating a digital computer of the type having a control element for generating instruction addresses, wherein the control element comprises an adder, a stack, a selecter and a register, so as to facilitate computer execution of short, highly repetitive program loops, said method including the steps of (a) initially storing the address of the first instruction in the program loop in the stack before said loop is entered and before said first instruction in said loop is executed, and (b) thereafter generating the instruction address required in a fall through operation out of the loop, by loading the register with a sum obtained from the adder, and generating the instruction address required in a jump back operation to rerun the loop by loading the register with the value previously stored in said stack, said stack being held during this loading operation so that the value representing the address of the first instruction of the loop is left intact within said stack so as to be available for future reference.
Claim 2
Independent Claim
172 words
A method of operating a digital computer of the type having a control element for generating instruction addresses, wherein the control element comprises an adder, a stack, a selecter and a register, so as to facilitate computer execution of short, highly repetitive program loops, said method including the steps of (a) initially storing the address of the first instruction in the program loop in the stack before said loop is entered and before said first instruction in said loop is executed, and (b) thereafter generating the instruction address required in a fall through operation out of the loop, by loading the register with a sum obtained from the adder, and generating the instruction address required in a jump back operation to rerun the loop by loading the register with the value previously stored in said stack, said stack being held during this loading operation so that the value representing the address of the first instruction of the loop is left intact within said stack so as to be available for future reference.
Claim 3
Dependent Claim
37 words
A method according to claim 1 wherein the initial storing of the address of the first instruction in the program loop in the stack is accomplished by pushing the sum computed in the adder onto the stack.
Claim 4
Dependent Claim
31 words
A method according to claim 1 wherein the initial storing of the address of the first instruction in the program loop in the stack is accomplished by executing a "call" operation.
References Cited (Backward Citations)
US4097920A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-07-31 | 1988-01-30 | 1988-07-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-07-31 | 1992-01-30 | 1992-07-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-07-31 | 1996-01-30 | 1996-07-31 | $7700.00 | Window Closed / Lapsed |