US6000028A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Means and apparatus for maintaining condition codes in an unevaluated state
Assignee: Google LLC
•
Filing: 1996-01-29
•
Granted: 1999-12-07
•
Expires: 2016-01-29
Abstract
Abstract A computer system for executing a binary image conversion system which converts instructions from a instruction set of a first, non native computer system to a second, different, native computer system, includes an run-time system which in response to a non-native image of an application program written for a non-native instruction set provides an native instruction or a native instruction routine. The run-time system collects profile data in response to execution of the native instructions to determine execution characteristics of the non-native instruction. Thereafter, the non-native instructions and the profile statistics are fed to a binary translator operating in a background mode and which is responsive to the profile data generated by the run-time system to form a translated native image. The run-time system and the binary translator are under the control of a server process. The non-native image is executed in two different enviroments with first portion executed as an interpreted image and remaining portions as a translated image. The run-time system includes an interpreter which is capable of handling condition codes corresponding to the non-native architecute.
Inventors
- 👤 Anton Chernoff
- 👤 John S. Yates
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 22:33
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/455; G06F9/45504
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
88 words
A method for maintaining a plurality of condition codes bits in an unevaluated state comprising the steps of: storing, in response to an execution of a condition code modifying instruction, a first table of methods including an entry for each of said plurality of condition code bits which are associated with said condition code modifying instruction, said methods providing access to evaluation routines which, when executed, modify one or all of said plurality of condition code bits; and providing a first pointer to said first table of methods.
Claim 2
Independent Claim
88 words
A method for maintaining a plurality of condition codes bits in an unevaluated state comprising the steps of: storing, in response to an execution of a condition code modifying instruction, a first table of methods including an entry for each of said plurality of condition code bits which are associated with said condition code modifying instruction, said methods providing access to evaluation routines which, when executed, modify one or all of said plurality of condition code bits; and providing a first pointer to said first table of methods.
Claim 3
Dependent Claim
74 words
The method of claim 1 wherein said method further includes the steps of: providing a second table of methods including an entry for each of said plurality of condition code bits which are associated with a previously executed condition code modifying instruction, said methods providing access to evaluation routines which, when executed, modify one or all of said plurality of condition code bits; and providing a second pointer to said second table of methods.
Claim 4
Dependent Claim
57 words
The method of claim 2 further including the steps of: storing a first group of selected data, in response to said execution of said condition code modifying instruction and associated with said first pointer; and providing a second group of selected data, corresponding to said previously executed condition code modifying instruction and associated with said second pointer.
Claim 5
Dependent Claim
44 words
The method of claim 3, wherein said first table of methods includes an entry for each of eight available conditional branch predicates, an entry to obtain a nibble carry bit and an entry to receive a set of said plurality of condition code bits.
Claim 6
Dependent Claim
44 words
The method of claim 4, wherein said second table of methods includes an entry for each of eight available conditional branch predicates, an entry to obtain a nibble carry bit and an entry to receive a set of said plurality of condition code bits.
Claim 7
Dependent Claim
38 words
The method of claim 3, wherein said first group of selected data provides sufficient information to determine an appropriate modification to each of said plurality of condition code bits which are associated with said condition code modifying instruction.
Claim 8
Dependent Claim
40 words
The method of claim 6, wherein said second group of selected data provides sufficient information to determine an appropriate modification to each of said plurality of condition code bits which are associated with said previously executed condition code modifying instruction.
Claim 9
Independent Claim
89 words
An apparatus for maintaining a plurality of condition codes bits in an unevaluated state comprising: means for storing, in response to an execution of a condition code modifying instruction, a first table of methods including an entry for each of said plurality of condition code bits which are associated with said condition code modifying instruction, said methods providing access to evaluation routines which, when executed, modify one or all of said plurality of condition code bits; and means for providing a first pointer to said first table of methods.
Claim 10
Independent Claim
89 words
An apparatus for maintaining a plurality of condition codes bits in an unevaluated state comprising: means for storing, in response to an execution of a condition code modifying instruction, a first table of methods including an entry for each of said plurality of condition code bits which are associated with said condition code modifying instruction, said methods providing access to evaluation routines which, when executed, modify one or all of said plurality of condition code bits; and means for providing a first pointer to said first table of methods.
Claim 11
Dependent Claim
72 words
The apparatus of claim 8 further including: means for providing a second table of methods including an entry for each of said plurality of condition code bits which are associated with a previously executed condition code modifying instruction, said methods providing access to evaluation routines which, when executed, modify one or all of said plurality of condition code bits; and means for providing a second pointer to said second table of methods.
Claim 12
Dependent Claim
58 words
The apparatus of claim 9 further including: means for storing a first group of selected data, in response to said execution of said condition code modifying instruction and associated with said first pointer; and means for providing a second group of selected data, corresponding to said previously executed condition code modifying instruction and associated with said second pointer.
Claim 13
Dependent Claim
44 words
The apparatus of claim 10, wherein said first table of methods includes an entry for each of eight available conditional branch predicates, an entry to obtain a nibble carry bit and an entry to receive a set of said plurality of condition code bits.
Claim 14
Dependent Claim
44 words
The apparatus of claim 11, wherein said second table of methods includes an entry for each of eight available conditional branch predicates, an entry to obtain a nibble carry bit and an entry to receive a set of said plurality of condition code bits.
Claim 15
Dependent Claim
38 words
The apparatus of claim 10, wherein said first group of selected data provides sufficient information to determine an appropriate modification to each of said plurality of condition code bits which are associated with said condition code modifying instruction.
Claim 16
Dependent Claim
40 words
The apparatus of claim 13, wherein said second group of selected data provides sufficient information to determine an appropriate modification to each of said plurality of condition code bits which are associated with said previously executed condition code modifying instruction.
Claim 17
Dependent Claim
105 words
An arrangement for use in a computer system for maintaining a plurality of condition codes bits in an unevaluated state comprising: a data structure, said data structure comprising: at least one evaluation routine which, when executed, modifies at least one of said plurality of condition code bits; a table of methods including at least one entry corresponding to said at least one of said plurality of condition code bits associated with an executed condition code modifying instruction, said at least one entry identifying said at least one evaluation routine; and a pointer, associated with said executed condition code modifying instruction, identifying said table of methods.
Claim 18
Dependent Claim
105 words
An arrangement for use in a computer system for maintaining a plurality of condition codes bits in an unevaluated state comprising: a data structure, said data structure comprising: at least one evaluation routine which, when executed, modifies at least one of said plurality of condition code bits; a table of methods including at least one entry corresponding to said at least one of said plurality of condition code bits associated with an executed condition code modifying instruction, said at least one entry identifying said at least one evaluation routine; and a pointer, associated with said executed condition code modifying instruction, identifying said table of methods.
Claim 19
Dependent Claim
43 words
The arrangement of claim 15 further including: means for storing selected data, associated with said executed condition code modifying instruction, with said data providing sufficient information to determine an appropriate modification to said at least one of said plurality of condition code bits.
Claim 20
Dependent Claim
19 words
The arrangement of claim 16 wherein said pointer and said means for storing being included in said data structure.
Claim 21
Dependent Claim
24 words
The arrangement of claim 16 wherein said pointer and said means for storing being implemented in a plurality of registers in said computer system.
References Cited (Backward Citations)
US4914581A
Cited
US5551015A
Cited
US5307504A
Cited
US5432795A
Cited
US5301325A
Cited
US5317740A
Cited
US5339238A
Cited
US5339422A
Cited
US5428786A
Cited
US5307492A
Cited
US5450575A
Cited
US5507030A
Cited
US5287490A
Cited
US5598560A
Cited
US5564050A
Cited
US5574927A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-12-06 | 2003-06-07 | 2003-12-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-12-06 | 2007-06-07 | 2007-12-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-12-06 | 2011-06-07 | 2011-12-07 | $7700.00 | Window Closed / Lapsed |