US5878263A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Internal chaining technique for fixup records
Assignee: International Business Machines Corp
•
Filing: 1997-03-05
•
Granted: 1999-03-02
•
Expires: 2017-03-05
Abstract
Abstract A method of indexing memory addresses associated with objects in a program file. In the prior art, a file has a single fixup record section which contains information necessary to determine memory addresses once the file is loaded onto the computer system. In the present invention, the fixup records are located within pages defined in the program file (e.g., data or text pages), and the fixup records are chained, that is, a given fixup record is based on a previous fixup record. In this manner, the overall size of the file is significantly reduced by reducing the collective size of all of the fixup records.
Inventors
- 👤 Michael Richard Fortin
- 👤 Maher Afif Saba
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 12:00
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/445; G06F9/44557
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
103 words
A method of indexing a plurality of memory addresses associated with objects in a computer program file, comprising the steps of: defining at least a first page in the program file, the page including at least two objects; computing a first memory address associated with a first object located in the page; writing to the file a first fixup record for indexing the first memory address of the first object; computing a second memory address associated with a second object located in the page; and writing to the page a second fixup record for indexing the second memory address of the second object.
Claim 2
Independent Claim
103 words
A method of indexing a plurality of memory addresses associated with objects in a computer program file, comprising the steps of: defining at least a first page in the program file, the page including at least two objects; computing a first memory address associated with a first object located in the page; writing to the file a first fixup record for indexing the first memory address of the first object; computing a second memory address associated with a second object located in the page; and writing to the page a second fixup record for indexing the second memory address of the second object.
Claim 3
Dependent Claim
18 words
The method of claim 1 wherein the second fixup record is computed based on the first fixup record.
Claim 4
Dependent Claim
18 words
The method of claim 1 wherein the first fixup record is created by producing a page offset value.
Claim 5
Dependent Claim
55 words
The method of claim 1 further comprising the steps of: defining a second page in the program file, the second page having at least one object; computing a third memory address associated with the object located in the second page; writing to the second page a third fixup record for indexing the third memory address.
Claim 6
Dependent Claim
18 words
The method of claim 3 wherein the first fixup is created by further producing an object offset value.
Claim 7
Dependent Claim
31 words
The method of claim 4 wherein: the second fixup record is computed based on the first fixup record; and the third fixup record is computed based on the second fixup record.
Claim 8
Independent Claim
160 words
A method of indexing a plurality of memory addresses associated with objects in a computer program file, comprising the steps of: defining at least two pages in the program file, a first one of the pages including at least first and second objects, and a second one of the pages including at least third and fourth objects; computing a first memory address associated with the first object; writing to the file a primary fixup record for indexing the first memory address; computing a second memory address associated with the second object; writing to the first page a first page fixup record for indexing the second memory address; computing a third memory address associated with the third object; writing to the second page a second page fixup record for indexing the third memory address; computing a fourth memory address associated with the fourth object; and writing to the second page a third page fixup record for indexing the fourth memory address.
Claim 9
Independent Claim
160 words
A method of indexing a plurality of memory addresses associated with objects in a computer program file, comprising the steps of: defining at least two pages in the program file, a first one of the pages including at least first and second objects, and a second one of the pages including at least third and fourth objects; computing a first memory address associated with the first object; writing to the file a primary fixup record for indexing the first memory address; computing a second memory address associated with the second object; writing to the first page a first page fixup record for indexing the second memory address; computing a third memory address associated with the third object; writing to the second page a second page fixup record for indexing the third memory address; computing a fourth memory address associated with the fourth object; and writing to the second page a third page fixup record for indexing the fourth memory address.
Claim 10
Dependent Claim
20 words
The method of claim 7 wherein each of the page fixup records are created by producing respective page offset values.
Claim 11
Dependent Claim
48 words
The method of claim 7 wherein: the first page fixup record is computed based on the primary fixup record; the second page fixup record is computed based on the first page fixup record; and the third page fixup record is computed based on the second page fixup record.
Claim 12
Dependent Claim
75 words
An article of manufacture comprising: a recordable media; and a program file recorded on said media, said program file having at least a first page, said page including at least first and second objects, said program file further having a primary fixup record for indexing a first memory address associated with said first object, and said page further having a first page fixup record for indexing a second memory address associated with said second object.
Claim 13
Dependent Claim
75 words
An article of manufacture comprising: a recordable media; and a program file recorded on said media, said program file having at least a first page, said page including at least first and second objects, said program file further having a primary fixup record for indexing a first memory address associated with said first object, and said page further having a first page fixup record for indexing a second memory address associated with said second object.
Claim 14
Dependent Claim
18 words
The article of claim 10 wherein said page fixup record is computed based on said primary fixup record.
Claim 15
Dependent Claim
63 words
The article of claim 10 wherein: said program file further has a second page; said second page has at least third and fourth objects; and said second page further has a second page fixup record for indexing a third memory address associated with said third object, and a third page fixup record for indexing a fourth memory address associated with said fourth object.
Claim 16
Dependent Claim
48 words
The article of claim 12 wherein: said first page fixup record is computed based on said primary fixup record; said second page fixup record is computed based on said first page fixup record; and said third page fixup record is computed based on said second page fixup record.
References Cited (Backward Citations)
US5297291A
Cited
US5437006A
Cited
US5708811A
Cited
US5530858A
Cited
US5408665A
Cited
US5548759A
Cited
US5526485A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-03-01 | 2002-08-31 | 2003-03-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-03-01 | 2006-08-31 | 2007-03-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-03-01 | 2010-08-31 | 2011-03-02 | $7700.00 | Window Closed / Lapsed |