US5367683A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Smart recompilation of performing matchup/difference after code generation
Assignee: Hewlett Packard Development Co LP
•
Filing: 1992-06-26
•
Granted: 1994-11-22
•
Expires: 2012-06-26
Abstract
Abstract A method and system for compiling a source program using smart recompilation. The invention allows fragments to contain "invocation specific" information, which is generated during a code generation phase of compilation. A hint generator attempts to preserve values of the invocation specific information between successive invocations of the compiler.
Inventors
- 👤 Bevin R. Brett
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 15:39
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/40; G06F8/41; G06F8/48
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
202 words
In a computer system, including a memory, a method of translating a source program comprising the steps of: translating a first source program and producing a first global context table, said first global context table containing global information describing definitions from said first source program which can be referenced by source programs other than said first source program, said translating of said first source program including a first code generation step; dividing, after said first code generation step, the information contained in said first global context table into a first group of fragments; translating a second source program and producing a second global context table containing global information describing definitions from said second source program which can be referenced by source programs other than said second source program, said translating of said second program including a second code generation step; dividing, after said second code generation step, the information contained in said second global context table into a second group of fragments; determining whether a fragment in said second group has an equivalent fragment in said first group; and translating source programs which are dependent on fragments from said second group determined not to have an equivalent fragment in said first group.
Claim 2
Dependent Claim
202 words
In a computer system, including a memory, a method of translating a source program comprising the steps of: translating a first source program and producing a first global context table, said first global context table containing global information describing definitions from said first source program which can be referenced by source programs other than said first source program, said translating of said first source program including a first code generation step; dividing, after said first code generation step, the information contained in said first global context table into a first group of fragments; translating a second source program and producing a second global context table containing global information describing definitions from said second source program which can be referenced by source programs other than said second source program, said translating of said second program including a second code generation step; dividing, after said second code generation step, the information contained in said second global context table into a second group of fragments; determining whether a fragment in said second group has an equivalent fragment in said first group; and translating source programs which are dependent on fragments from said second group determined not to have an equivalent fragment in said first group.
Claim 3
Dependent Claim
61 words
The method of claim 1, wherein the step of dividing the information contained in said first global context table includes assigning a version identifier to each fragment in said first group of fragments; and wherein, the method further includes assigning a new version identifier to fragments in said second group that do not have an equivalent fragment in said first group.
Claim 4
Dependent Claim
59 words
The method of claim 1, wherein the step of dividing the information contained in said first global context table further includes assigning a version identifier to each fragment in said first group of fragments; and wherein the method further includes maintaining that version number for a fragment in said second group having an equivalent fragment in said first group.
Claim 5
Dependent Claim
35 words
The method of claim 1, wherein the first global context table includes semantic information comprising at least one of a semantic nature identifier, a type identifier, a number of parameters, and a type of parameters.
Claim 6
Dependent Claim
36 words
The method of claim 1, wherein the first global context table includes invocation specific information comprising at least one of a global symbol name, programming variable information including size and representation information, and register offset information.
Claim 7
Dependent Claim
35 words
The method of claim 1, wherein said translating the first and second source programs respectively produces first and second object files, and wherein the first and second object files each contain a global symbol table.
Claim 8
Dependent Claim
17 words
The method of claim 6, wherein the global symbol table further includes a program section contribution table.
Claim 9
Dependent Claim
25 words
The method of claim 6, wherein the global symbol table further includes a global symbol name, a program section name, and a program section offset.
Claim 10
Dependent Claim
21 words
The method of claim 7, wherein the program section contribution table further includes a program section name and program section contents.
Claim 11
Dependent Claim
23 words
The method of claim 1 further including the step of matching fragments in said first group with corresponding fragments in the second group.
Claim 12
Dependent Claim
16 words
The method of claim 1 further comprising storing said first global context table in a library.
Claim 13
Dependent Claim
19 words
The method of claim 1 wherein said second source program is a subsequent version of the first source program.
References Cited (Backward Citations)
US4558413A
Cited
US4667290A
Cited
US5206951A
Cited
US5230050A
Cited
US5123098A
Cited
US5187788A
Cited
US5201050A
Cited
US5204939A
Cited
US5204960A
Cited
US5247651A
Cited
US5175856A
Cited
US5193180A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-11-21 | 1998-05-23 | 1998-11-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-11-21 | 2002-05-23 | 2002-11-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-11-21 | 2006-05-23 | 2006-11-22 | $7700.00 | Window Closed / Lapsed |