JDK-7163191 : G1: introduce a "heap spanning table" abstraction
- Type: Enhancement
- Component: hotspot
- Sub-Component: gc
- Affected Version: hs24
- Priority: P4
- Status: Resolved
- Resolution: Duplicate
- OS: generic
- CPU: generic
- Submitted: 2012-04-20
- Updated: 2013-10-30
- Resolved: 2013-09-25
The Version table provides details related to the release that this issue/RFE will be addressed.
Unresolved : Release in which this issue/RFE will be addressed.
Resolved: Release in which this issue/RFE has been resolved.
Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availability Release.
To download the current JDK release, click here.
Unresolved : Release in which this issue/RFE will be addressed.
Resolved: Release in which this issue/RFE has been resolved.
Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availability Release.
To download the current JDK release, click here.
| JDK 8 | Other |
|---|---|
8Fixed  |
hs25Resolved |
Related Reports
|
Duplicate :
|
|
|
Relates :
|
|
|
Relates :
|
Description
In G1 we have a few tables which have one entry for a fixed-sized subdivision of the heap. Examples of such tables are the HeapRegionSeq table as well as the "fast cset test" table which have one entry per region in the heap. Another example is the upcoming "segments" table. It'd be nice to have an abstraction for such tables to avoid duplicating a lot of the code. We'll call the abstraction the "heap spanning table" and it will provide facilities to allocate, index, resize, etc. such tables. It will also provide a "fast look-up" facility which will be based on a version of the table that's biased to address 0. As a first cut we'll also modify the HeapRegionSeq class to take advantage of the new abstraction.
Comments
|