← Back to Patent Explorer
US5596735A Expired / Lapsed US ⏱️ 0.0 years remaining

Circuit and method for addressing segment descriptor tables

Assignee: VIA Cyrix Inc
•
Filing: 1996-02-23
•
Granted: 1997-01-21
•
Expires: 2016-02-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a processor having a protected mode of operation in which a computer memory associated with the processor contains global and local descriptor tables addressed by a combination of a base address and an index, the processor having (i) global and local base address registers alternatively to provide the base address and (ii) a selector for containing the index and a table indicator (TI) bit indicating which of the global and local base address registers is to provide the base address, the processor requiring a time to derive the index and a value of the TI bit and a further time to combine the index and the base address, a base address register predicting circuit to predict, and a method of predicting, which of the global and local base address registers is to provide the base address without having to wait for the processor to derive the value of the TI bit. The circuit includes (i) TI bit predicting circuitry to generate a predicted value of the TI bit as a function of a prior value of the TI bit, and (ii) register access circuitry to access one of the global and local base address registers as a function of the predicted value of the TI bit.

Inventors

  • 👤 Mark W. Hervin
  • 👤 Raul A. Garibay, Jr.

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 07:22
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/34; G06F9/342; G06F12/00; G06F12/02; G06F12/0223; G06F12/0292

Claims Analysis

Total Claims: 31
Claim 1
Independent Claim 199 words
In a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address, a base address register predicting circuit to predict which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit, comprising: TI bit predicting circuitry to generate a predicted value of said TI bit as a function of a prior value of said TI bit; and register access circuitry to access one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 2
Dependent Claim 199 words
In a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address, a base address register predicting circuit to predict which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit, comprising: TI bit predicting circuitry to generate a predicted value of said TI bit as a function of a prior value of said TI bit; and register access circuitry to access one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 3
Dependent Claim 60 words
The circuit as recited in claim 1 further comprising comparison circuitry to compare a derived value of said TI bit and said predicted value of said TI bit, said register access circuitry accessing another of said global and local base address registers if said derived value of said TI bit is unequal to said predicted value of said TI bit.
Claim 4
Dependent Claim 23 words
The circuit as recited in claim 2 wherein said comparison circuitry is further operative to invert said predicted value of said TI bit.
Claim 5
Dependent Claim 43 words
The circuit as recited in claim 2 further including descriptor table addressing circuitry, associated with said register access circuitry, to retrieve a segment descriptor from one of said global and local descriptor tables as a function of said base address and said index.
Claim 6
Dependent Claim 30 words
The circuit as recited in claim 2 further comprising computer memory addressing circuitry to address said computer memory as a function of said inverted predicted value of said TI bit.
Claim 7
Dependent Claim 199 words
In a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address, a base address register predicting circuit to predict which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit, comprising: TI bit predicting means for generating a predicted value of said TI bit as a function of a prior value of said TI bit; and register access means for accessing one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 8
Dependent Claim 199 words
In a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address, a base address register predicting circuit to predict which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit, comprising: TI bit predicting means for generating a predicted value of said TI bit as a function of a prior value of said TI bit; and register access means for accessing one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 9
Dependent Claim 61 words
The circuit as recited in claim 6 further comprising comparison means for comparing a derived value of said TI bit and said predicted value of said TI bit, said register access circuitry means accessing another of said global and local base address registers if said derived value of said TI bit is unequal to said predicted value of said TI bit.
Claim 10
Dependent Claim 23 words
The circuit as recited in claim 7 wherein said comparison means is further operative to invert said predicted value of said TI bit.
Claim 11
Dependent Claim 43 words
The circuit as recited in claim 7 further including descriptor table addressing means, associated with said register access means, for retrieving a segment descriptor from one of said global and local descriptor tables as a function of said base address and said index.
Claim 12
Dependent Claim 30 words
The circuit as recited in claim 7 further comprising computer memory addressing means for addressing said computer memory as a function of said inverted predicted value of said TI bit.
Claim 13
Dependent Claim 189 words
In a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address, a method of predicting which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit, comprising the steps of: generating a predicted value of said TI bit as a function of a prior value of said TI bit; and accessing one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 14
Dependent Claim 189 words
In a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address, a method of predicting which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit, comprising the steps of: generating a predicted value of said TI bit as a function of a prior value of said TI bit; and accessing one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 15
Dependent Claim 57 words
The method as recited in claim 11 further comprising the steps of: comparing a derived value of said TI bit and said predicted value of said TI bit; and accessing another of said global and local base address registers if said derived value of said TI bit is unequal to said predicted value of said TI bit.
Claim 16
Dependent Claim 38 words
The method as recited in claim 12 further comprising the step of inverting said predicted value of said TI bit if said derived value of said TI bit is unequal to said predicted value of said TI bit.
Claim 17
Dependent Claim 27 words
The method as recited in claim 13 further comprising the step of addressing said computer memory as a function of said predicted value of said TI bit.
Claim 18
Dependent Claim 35 words
The method as recited in claim 12 further comprising the step of retrieving a segment descriptor from one of said global and local descriptor tables as a function of said base address and said index.
Claim 19
Dependent Claim 243 words
A computer system, comprising: (a) a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address; (b) said computer memory further containing instructions including instructions affecting said selector; (c) said processor including instruction fetch logic that fetches instructions from said computer memory; and (d) said processor further including a base address register predicting circuit to predict which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit, said base address register predicting circuit comprising: (i) TI bit predicting circuitry to generate a predicted value of said TI bit as a function of a prior value of said TI bit; and (ii) register access circuitry to access one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 20
Dependent Claim 243 words
A computer system, comprising: (a) a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address; (b) said computer memory further containing instructions including instructions affecting said selector; (c) said processor including instruction fetch logic that fetches instructions from said computer memory; and (d) said processor further including a base address register predicting circuit to predict which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit, said base address register predicting circuit comprising: (i) TI bit predicting circuitry to generate a predicted value of said TI bit as a function of a prior value of said TI bit; and (ii) register access circuitry to access one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 21
Dependent Claim 61 words
The computer system as recited in claim 16 further comprising comparison circuitry to compare a derived value of said TI bit and said predicted value of said TI bit, said register access circuitry accessing another of said global and local base address registers if said derived value of said TI bit is unequal to said predicted value of said TI bit.
Claim 22
Dependent Claim 24 words
The computer system as recited in claim 17 wherein said comparison circuitry is further operative to invert said predicted value of said TI bit.
Claim 23
Dependent Claim 44 words
The computer system as recited in claim 17 further including descriptor table addressing circuitry, associated with said register access circuitry, to retrieve a segment descriptor from one of said global and local descriptor tables as a function of said base address and said index.
Claim 24
Dependent Claim 31 words
The computer system as recited in claim 17 further comprising computer memory addressing circuitry to address said computer memory as a function of said inverted predicted value of said TI bit.
Claim 25
Independent Claim 184 words
A method of operating a computer system, comprising the steps of: (a) applying power to a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address; (b) storing instructions in said computer memory, said instructions including instructions affecting said selector; (c) fetching instructions from said computer memory; and (d) executing instructions in said processor and predicting which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit.
Claim 26
Independent Claim 184 words
A method of operating a computer system, comprising the steps of: (a) applying power to a processor having a protected mode of operation in which a computer memory associated with said processor contains global and local descriptor tables addressed by a combination of a base address and an index, said processor having global and local base address registers alternatively to provide said base address, said processor further having a selector for containing said index and a table indicator (TI) bit indicating which of said global and local base address registers is to provide said base address, said processor requiring a time to derive said index and a value of said TI bit and a further time to combine said index and said base address; (b) storing instructions in said computer memory, said instructions including instructions affecting said selector; (c) fetching instructions from said computer memory; and (d) executing instructions in said processor and predicting which of said global and local base address registers is to provide said base address without having to wait for said processor to derive said value of said TI bit.
Claim 27
Dependent Claim 56 words
The method recited in claim 21 wherein said predicting step further includes the steps of: generating a predicted value of said TI bit as a function of a prior value of said TI bit; and accessing one of said global and local base address registers as a function of said predicted value of said TI bit.
Claim 28
Dependent Claim 57 words
The method as recited in claim 21 further comprising the steps of: comparing a derived value of said TI bit and said predicted value of said TI bit; and accessing another of said global and local base address registers if said derived value of said TI bit is unequal to said predicted value of said TI bit.
Claim 29
Dependent Claim 23 words
The method as recited in claim 23 wherein said comparing step includes the step of inverting said predicted value of said TI bit.
Claim 30
Dependent Claim 28 words
The method as recited in claim 24 further comprising the step of addressing said computer memory as a function of said inverted predicted value of said TI bit.
Claim 31
Dependent Claim 35 words
The method as recited in claim 22 further including the step of retrieving a segment descriptor from one of said global and local descriptor tables as a function of said base address and said index.

References Cited (Backward Citations)

US4675810A Cited
US4825358A Cited
US5027273A Cited
US5136717A Cited
US5148538A Cited
US5255379A Cited
US5517651A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-01-21 2000-07-22 2001-01-21 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-01-21 2004-07-22 2005-01-21 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-01-21 2008-07-22 2009-01-21 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag