US4462074A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Do loop circuit
Assignee: Motorola Solutions Inc
•
Filing: 1981-11-19
•
Granted: 1984-07-24
•
Expires: 2001-11-19
Abstract
Abstract In a programmable machine, a combination for executing a do loop without requiring "overhead" steps to be included in the do loop, having means for determining when the final do loop step is being executed, means for counting the number of do loop iterations remaining, and means for proceeding to the first do loop step each time the final do loop step is being executed provided the last iteration has not been reached, or otherwise for exiting from the do loop.
Inventors
- 👤 Yosef Linde
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 12:38
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
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
137 words
In data processing apparatus for executing the steps of a program, said apparatus having a program memory means, a combination for executing a selected number of times the steps of a do loop within said program comprising: first means for determining, while each do loop step is being executed, whether it is the final step in said do loop without decoding any part of the instruction associated with said do loop step, second means for determining, during each execution of said final step, whether said do loop has been executed said selected number of times, and means for thereafter re-executing the first step in said do loop if said second means indicates that said do loop has not been executed said selected number of times, and for otherwise causing said apparatus to exit from said do loop.
Claim 2
Dependent Claim
137 words
In data processing apparatus for executing the steps of a program, said apparatus having a program memory means, a combination for executing a selected number of times the steps of a do loop within said program comprising: first means for determining, while each do loop step is being executed, whether it is the final step in said do loop without decoding any part of the instruction associated with said do loop step, second means for determining, during each execution of said final step, whether said do loop has been executed said selected number of times, and means for thereafter re-executing the first step in said do loop if said second means indicates that said do loop has not been executed said selected number of times, and for otherwise causing said apparatus to exit from said do loop.
Claim 3
Dependent Claim
34 words
The apparatus of claim 1 wherein said first means comprises means for storing the address of said final step and means for comparing said stored address with the address of the step being executed.
Claim 4
Dependent Claim
56 words
The apparatus of claim 2 further comprising a program address bus carrying the address in said program memory means of the next step to be executed, and wherein said means for storing is a register and said means for comparing is a comparator having its inputs connected to said register and to said program address bus.
Claim 5
Dependent Claim
37 words
The apparatus of claim 1 wherein said second means comprises counting means responsive to each execution of the do loop to decrement the count to zero from a number one less than said selected number of times.
Claim 6
Dependent Claim
23 words
The apparatus of claim 4 wherein said counting means is a down counter having its count triggering input connected to said first means.
Claim 7
Dependent Claim
72 words
The apparatus of claim 1 wherein said re-executing means comprises means for storing the address of said first step of said do loop, means for retrieving said stored address after each execution of said final step until said do loop has been executed said selected number of times, and means for purging said stored address from said means for storing when said do loop has been executed said selected number of times.
Claim 8
Dependent Claim
57 words
The apparatus of claim 6 wherein said means for storing is a last-in, first-out memory stack, said means for retrieving is a first gate having its output connected to a read triggering input of said stack, and said means for purging is a second gate having its output connected to a purge triggering input of said stack.
Claim 9
Dependent Claim
72 words
The apparatus of claim 1 further comprising program address carrying means for indicating the address in said program memory means of the next step to be performed, address indicating means connected to said program address carrying means for providing the address of the next step to be executed, and means for incrementing by one the address on said program address carrying means and providing the incremented address to said address indicating means.
Claim 10
Dependent Claim
36 words
The apparatus of claim 8 wherein said program address carrying means is an address bus connected to said means for thereafter re-executing, said address indicating means, said incrementing means and said means for incrementing are counters.
References Cited (Backward Citations)
US3587044A
Cited
US3593313A
Cited
US4156905A
Cited
US4037213A
Cited
US4097920A
Cited
US4160273A
Cited
US4292667A
Cited
US4321687A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-07-24 | 1988-01-23 | 1988-07-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-07-24 | 1992-01-23 | 1992-07-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-07-24 | 1996-01-23 | 1996-07-24 | $7700.00 | Window Closed / Lapsed |