US5247679A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for sequentially registering executable program formats with unresolved pointers by assigning linkage state and invocation state thereof
Assignee: Computervision Corp
•
Filing: 1990-02-20
•
Granted: 1993-09-21
•
Expires: 2010-02-20
Abstract
Abstract A method and apparatus for linking and registering executable program formats (EPFs) so as to resolve all unresolved pointers. The invention sequentially attempts to link and initialize each EPF by resolving the unresolved pointers of each EPF. During each attempt to initialize an EPF, the EPF is assigned two states, a linkage state and an invocation state. If an EPF has all pointers to shared address space resolved, it is marked as INITIALIZED. Otherwise, it is marked as UNINITIALIZED. Further, an EPF is marked as SUSPENDED if it contains either unresolved pointers or pointers that reference another EPF that is marked as SUSPENDED. Otherwise, the EPF is marked as READY and is ready to execute. Data defining the unresolved pointers of each EPF that is not SUSPENDED is stored in a database. After each EPF is registered, the database is checked to determine if all the unresolved pointers in the shared linkage of a suspended EPF can now be resolved. If so, those EPFs are reinitialized, marked as INITIALIZED and READY and the data pertaining to them is removed from the database. In this manner, the EPFs can be registered and initialized in any order.
Inventors
- 👤 Arun Kumar
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 07:36
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/445; G06F9/44521
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
247 words
A method of registering Executable Program Formats (EPFs) in a list of EPFs in a computer system, said EPFs having unresolved pointers to shared memory space, which shared memory space can be accessed by all EPFs; sequentially registering each EPF, said registration including resolving an actual address in said shared memory space of all of the unresolved pointers to said shared memory space for which an actual address is determinable, after each registration of an EPF from said list, if said EPF still has at least one unresolved pointer to shared memory space or said EPF references another EPF which is unregistered or has at least one unresolved pointer to shared memory space, storing data identifying said EPF in a database comprising the sub-steps of: storing in said database a linkage state for each EPF, said linkage state being INITIALIZED if all pointers to shared memory space are resolved and being UNINITIALIZED otherwise. storing in said database a SUSPENDED invocation state for each said EPF which SUSPENDED invocation state indicates that at least one pointer to shared memory space is unresolved or at least one of the EPFs referenced by a pointer in said EPF is UNINITIATED or not registered and, after registration of each EPF, resolving an actual address in shared memory space of all of the unresolved pointers of each EPF listed in said database for which an actual address is determinable and updating said invocation state and linkage state of each of said EFPs.
Claim 2
Independent Claim
247 words
A method of registering Executable Program Formats (EPFs) in a list of EPFs in a computer system, said EPFs having unresolved pointers to shared memory space, which shared memory space can be accessed by all EPFs; sequentially registering each EPF, said registration including resolving an actual address in said shared memory space of all of the unresolved pointers to said shared memory space for which an actual address is determinable, after each registration of an EPF from said list, if said EPF still has at least one unresolved pointer to shared memory space or said EPF references another EPF which is unregistered or has at least one unresolved pointer to shared memory space, storing data identifying said EPF in a database comprising the sub-steps of: storing in said database a linkage state for each EPF, said linkage state being INITIALIZED if all pointers to shared memory space are resolved and being UNINITIALIZED otherwise. storing in said database a SUSPENDED invocation state for each said EPF which SUSPENDED invocation state indicates that at least one pointer to shared memory space is unresolved or at least one of the EPFs referenced by a pointer in said EPF is UNINITIATED or not registered and, after registration of each EPF, resolving an actual address in shared memory space of all of the unresolved pointers of each EPF listed in said database for which an actual address is determinable and updating said invocation state and linkage state of each of said EFPs.
Claim 3
Dependent Claim
47 words
A method as set forth in claim 1 wherein, after all remaining unresolved pointers of an EPF are resolved, and all EPFs which said EPF references are READY, the linkage state of said EPF is made INITIALIZED and the invocation state of said EPF is made READY.
Claim 4
Dependent Claim
21 words
A method as set forth in claim 2 wherein data defining the unresolved pointers of each EPF is stored in memory.
Claim 5
Dependent Claim
95 words
A method as set forth in claim 3 further comprising the steps of: creating a direct dependency table for each SUSPENDED EPF which table lists those EPFs to which said SUSPENDED EPF refers, after each EPF is registered, comparing a list of READY EPFs with said direct dependency table for said registered EPF, and resolving an actual address in said shared memory space for the unresolved pointers for which an actual address is determinable of only the suspended EPFs for which the EPFs listed in the related portion of the dependency table are all READY.
Claim 6
Dependent Claim
45 words
A method as set forth in claim 4 further comprising the step of: unregistering the first copy of a registered EPF, through an unregister instruction, before re-registering said first registered EPF, such that a second copy of the EPF is generated in shared memory space.
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) | 1996-09-20 | 1997-03-22 | 1997-09-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-09-20 | 2001-03-22 | 2001-09-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-09-20 | 2005-03-22 | 2005-09-21 | $7700.00 | Window Closed / Lapsed |