US4454580A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Program call method and call instruction execution apparatus
Assignee: International Business Machines Corp
•
Filing: 1981-09-16
•
Granted: 1984-06-12
•
Expires: 2001-09-16
Abstract
Abstract A computer architecture is disclosed which permits intersegment program calls with associated selective allocation of data segments of varying lengths. The calling program controls selective allocation of segments to the called program but the called program controls the lengths of the segments being allocated. In this way, recursive calls to the same program cannot affect the function or data of other programs or of the same program in a previous call. Also allocation of data segments can be postponed until execution resulting in more flexible execution of programs written without knowledge of the details of other co-executing programs.
Inventors
- 👤 Howard L. Page
- 👤 James A. Wingert
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 01:42
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/50; G06F9/5005; G06F9/5011; G06F9/5016; G06F12/00; G06F12/02; G06F12/0223; G06F12/0284; G06F9/30; G06F9/30003; G06F9/3005; G06F9/30054
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
119 words
The method of passing execution from a program in one logical address space to another program in a new logical address space comprising the steps of: storing a start address and length of the one logical address space and a program status word; creating the new logical address space by accessing a table to obtain a start address and length of the new logical address space; passing execution control to an instruction in the new logical address space; executing at least another instruction in the new logical address space; retrieving the start address and length of the one address space and the program status word; and passing execution control to the next sequential instruction in the one address space.
Claim 2
Independent Claim
119 words
The method of passing execution from a program in one logical address space to another program in a new logical address space comprising the steps of: storing a start address and length of the one logical address space and a program status word; creating the new logical address space by accessing a table to obtain a start address and length of the new logical address space; passing execution control to an instruction in the new logical address space; executing at least another instruction in the new logical address space; retrieving the start address and length of the one address space and the program status word; and passing execution control to the next sequential instruction in the one address space.
Claim 3
Dependent Claim
61 words
The method of claim 1 following the step of accessing, further comprising the steps of: accessing the new logical address space to retrieve a length value of a logical data address space to be used by the program in the new logical address space; and selectively allocating a new logical data address space having a length determined by the length value.
Claim 4
Dependent Claim
87 words
In a digital computer including means for executing an intersegment call instruction, the improvement comprising: opcode decoding logic for decoding the opcode portion of the instruction and controlling execution of the call instruction; and storage allocation logic controlled by said opcode decoding logic and responsive to the content of a storage allocation field in the call instruction for allocating a new data segment to a called program and alternately for allocating to the called program a data segment which has also been allocated to the calling program.
Claim 5
Dependent Claim
87 words
In a digital computer including means for executing an intersegment call instruction, the improvement comprising: opcode decoding logic for decoding the opcode portion of the instruction and controlling execution of the call instruction; and storage allocation logic controlled by said opcode decoding logic and responsive to the content of a storage allocation field in the call instruction for allocating a new data segment to a called program and alternately for allocating to the called program a data segment which has also been allocated to the calling program.
Claim 6
Dependent Claim
61 words
The digital computer of claim 3 wherein the storage allocation logic further comprises: logic responsive to a new length value stored as part of the called program to control the storage allocation logic to allocate only so much storage, as specified by the length value, to the called program when a new data segment is allocated by the storage allocation logic.
Claim 7
Dependent Claim
55 words
The digital computer of claim 4 wherein the storage allocation logic further comprises: logic responsive to an old length value of a data segment of the calling program for limiting the length of the data segment of the calling program as allocated to the called program to be not greater than the old length value.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-06-12 | 1987-12-12 | 1988-06-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-06-12 | 1991-12-12 | 1992-06-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-06-12 | 1995-12-12 | 1996-06-12 | $7700.00 | Window Closed / Lapsed |