Method and apparatus for forwarding references to objects concurrently with space-incremental garbage collection

• US 7,321,909 B1
• Filed: 12/23/2004
• Issued: 01/22/2008
• Est. Priority Date: 12/23/2004
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Garthwaite, Alexander T.
• Primary Examiner(s): LEROUX, ETIENNE PIERRE
• Application Number:
  US11/021,287
• Time in Patent Office: 1,125 Days
• Field of Search: 707/2, 707/10, 707/102, 707/206, 707/1, 711/114, 709/213
• US Class Current: 1/1
• CPC Class Codes: G06F 12/0276 Generational garbage collection
• CPC Class Codes: Y10S 707/99957 Garbage collection

Abstract

In order to prevent concurrent garbage collection using a space-incremental algorithm from corrupting objects, objects are evacuated by copying them to relocated destinations and a forwarding data structure is associated with each region created by the space-incremental algorithm. The forwarding data structure is used to map object locations in that region to their relocated destinations. When an attempt is made to access the object, the forwarding data structure is accessed and, if the object is found in the data structure, the corresponding forwarding address is used to access the object. The forwarding data structure can be a hash table, a direct mapped table or other structure.

Claims

1. A method for forwarding references to objects concurrently with garbage collection using a space-incremental algorithm in which objects are located in a first memory region having a starting address, the method comprising:

creating and associating a forwarding data structure with the first memory region;

when an object is evacuated from the first memory region in accordance with the algorithm, copying the object to a second memory region;

calculating an index into the forwarding data structure based on a location of the object in the first memory region;

using the calculated index to write an address of the object copy in the second memory region into the forwarding data structure; and

when the object is referenced in the first memory region, using the forwarding data structure to locate the object copy address and causing the object copy to be accessed.

2. The method of claim 1 wherein using the forwarding data structure further comprises recalculating the index based on the location of the object in the first memory region and causing the object copy to be accessed further comprises using the recalculated index to access the forwarding data structure in order to locate the object copy address.

3. The method of claim 1 wherein the forwarding data structure has entries that contain both an object address and an object copy address and wherein using the forwarding data structure further comprises using the object address to directly index the forwarding data structure to locate the object copy address.

4. The method of claim 1 wherein the forwarding data structure comprises a hash table and calculating an index further comprises applying a hash function to an offset of the object location from the starting address in order to generate the index.

5. The method of claim 1 wherein the forwarding data structure comprises a direct mapped table having an entry for each object that could possibly be located in the first memory region and wherein calculating an index further comprises using an offset of the object location from the starting address as the index.

6. The method of claim 1 wherein the first memory region is divided into equal sized blocks, each of which can hold a plurality of objects and the forwarding data structure is a direct mapped table having an entry for each block and wherein calculating an index further comprises dividing an offset of a starting address of the object from the starting address by the number of bytes in a block and using the integer part of a resulting quotient as the index.

7. The method of claim 6 further comprising the step of relocating all objects in a block when one object in the block is relocated.

8. The method of claim 6 further comprising:

creating a displacement sub table having a plurality of entries when two objects in a block generate the same index;

calculating an index into the displacement sub table for each of the two objects; and

using the computed indices to write an address in the second memory region of a copy of each of the two objects into the displacement sub table.

9. The method of claim 8 wherein creating a displacement sub table further comprises creating the displacement sub table with the plurality of entries equal to the number of objects that could possibly be located in a block.

10. The method of claim 8 wherein calculating an index into the displacement sub table further comprises dividing an offset of an object from the starting address by the number of bytes in a block and using the remainder of the resulting quotient as the index into the sub table.

11. The method of claim 8 further comprising:

marking each entry in the plurality of entries to indicate when a displacement sub table exists for that entry.

12. The method of claim 1 wherein the space-incremental algorithm is the Train algorithm and the first memory region is a car section managed by a car.

13. Apparatus for forwarding references to objects concurrently with garbage collection using a space-incremental algorithm in which objects are located in a first memory region having a starting address, the apparatus comprising:

a mechanism that creates and associates a forwarding data structure with the first memory region;

a mechanism operable when an object is evacuated from the first memory region in accordance with the algorithm, that copies the object to a second memory region;

a mechanism that calculates an index into the forwarding data structure based on a location of the object in the first memory region;

a mechanism that uses the calculated index to write an address of the object copy in the second memory region into the forwarding data structure; and

a mechanism operable when the object is referenced in the first memory region, that uses the forwarding data structure to locate the object copy address and causing the object copy to be accessed.

14. The apparatus of claim 13 wherein the mechanism that uses the forwarding data structure to locate the object copy comprises a mechanism that recalculates the index based on the location of the object in the first memory region and uses the recalculated index to access the forwarding data structure in order to locate the object copy address.

15. The apparatus of claim 13 wherein the forwarding data structure has entries that contain both an object address and an object copy address and wherein the mechanism that uses the forwarding data structure to locate the object copy comprises a mechanism that uses the object address to directly index the forwarding data structure to locate the object copy address.

16. The apparatus of claim 13 wherein the forwarding data structure comprises a hash table and the mechanism that calculates an index into the forwarding data structure comprises a mechanism that applies a hash function to an offset of the object location from the starting address in order to generate the index.

17. The apparatus of claim 13 wherein the forwarding data structure comprises a direct mapped table having an entry for each object that could possibly be located in the first memory region and wherein the mechanism that calculates an index into the forwarding data structure comprises a mechanism that uses an offset of the object location from the starting address as an index.

18. The apparatus of claim 13 wherein the first memory region is divided into equal sized blocks, each of which can hold a plurality of objects and the forwarding data structure is a direct mapped table having an entry for each block and wherein the mechanism that calculates an index into the forwarding data structure comprises a mechanism that divides an offset of a starting address of the object from the starting address by the number of bytes in a block and uses the integer part of a resulting quotient as the index.

19. The apparatus of claim 18 further comprising a mechanism that relocates all objects in a block when one object in the block is relocated.

20. The apparatus of claim 18 further comprising:

a mechanism that creates a displacement sub table having a plurality of entries when the mechanism that calculates an index into the forwarding data structure generates the same index for two objects in a block;

a mechanism that calculates an index into the displacement sub table for each of the two objects; and

a mechanism that uses the computed indices to write an address in the second memory region of a copy of each of the two objects into the displacement sub table.

21. The apparatus of claim 20 wherein the mechanism that creates a displacement sub table comprises a mechanism that creates the displacement sub table with the plurality of entries equal to the number of objects that could possibly be located in a block.

22. The apparatus of claim 20 wherein the mechanism that calculates an index into the displacement sub table comprises a mechanism that divides an offset of an object from the starting address by the number of bytes in a block and uses the remainder of the resulting quotient as the index into the sub table.

23. The apparatus of claim 20 further comprising:

a mechanism that marks each entry in the plurality of entries to indicate when a displacement sub table exists for that entry.

24. The apparatus of claim 13 wherein the space-incremental algorithm is the Train algorithm and the first memory region is a car section managed by a car.

25. Apparatus for forwarding references to objects concurrently with garbage collection using a space-incremental algorithm in which objects are located in a first memory region having a starting address, the apparatus comprising:

means for creating and associating a forwarding data structure with the first memory region;

means operable when an object is evacuated from the first memory region in accordance with the algorithm, for copying the object to a second memory region;

means for calculating an index into the forwarding data structure based on a location of the object in the first memory region;

means for using the calculated index to write an address of the object copy in the second memory region into the forwarding data structure; and

means operable when the object is referenced in the first memory region, for using the forwarding data structure to locate the object copy address and for causing the object copy to be accessed.

26. The apparatus of claim 25 wherein the means for using the forwarding data structure to locate the object copy comprises means for recalculating the index based on the location of the object in the first memory region and means for using the recalculated index to access the forwarding data structure in order to locate the object copy address.

27. The apparatus of claim 25 wherein the forwarding data structure has entries that contain both an object address and an object copy address and wherein the means for using the forwarding data structure to locate the object copy comprises means for using the object address to directly index the forwarding data structure to locate the object copy address.

28. A computer readable medium comprising computer program code stored therein for forwarding references to objects concurrently with garbage collection using a space-incremental algorithm in which objects are located in a first memory region having a starting address, the computer program code comprising:

program code for creating and associating a forwarding data structure with the first memory region;

program code operable when an object is evacuated from the first region in accordance with the algorithm, for copying the object to a second memory region;

program code for calculating an index into the forwarding data structure based on a location of the object in the first memory region;

program code for using the calculated index to write an address of the object copy in the second memory region into the forwarding data structure; and

program code operable when the object is referenced in the first memory region, for using the forwarding data structure to locate the object copy address and for causing the object copy to be accessed.