Garbage collection – root nodes

by

I found the answer provided by greyfairer is wrong. The JVM runtime does not gather the root set from stack by looking at what bytecodes are used to push data on the stack. The stack frame consists of 4 byte(32bit arch) slots. Each slot could be a reference to a heap object or a primitive value such as an int. When a GC is needed, the runtime scans the stack, from top to bottom. For each slot, it contains a reference if:

a. It’s aligned at 4 byte boundary.

b. The value in the slot point to the region of the heap(between lower and upper bound).

c. The allocbit is set. The allocbit is a flag indicating whether the memory location corresponding to it is allocated or not.

Here is my reference: http://www.ibm.com/developerworks/ibm/library/i-garbage2/.

There are some other techniques to find the root set(not in Java). For example, because pointers are usually aligned at 4/8 bytes boundary, the first bit can be used to indicate whether a slot is a primitive value or pointer: for primitive values, the first bit is set to 1. The disadvantage of this is that you only have 31bits(32 bits arch) to represent the integer, and every operations on primitive values involves shifting, which is obvious an overhead.

Also, you can make all types including int allocated on the heap. That is, all things are objects. Then all slots in a stack frame are then references.

More Related Contents:

  1. How to debug why my C code causes a segmentation fault? [closed]
  2. Stack, Static, and Heap in C++
  3. Why are the terms “automatic” and “dynamic” preferred over the terms “stack” and “heap” in C++ memory management?
  4. Java heap terminology: young, old and permanent generations?
  5. Java 7 (JDK 7) garbage collection and documentation on G1
  6. When vectors are allocated, do they use memory on the heap or the stack?
  7. Arrays, heap and stack and value types
  8. Is a Java array of primitives stored in stack or heap?
  9. Memory allocation: Stack vs Heap?
  10. Object creation on the stack/heap?
  11. Do Java primitives go on the Stack or the Heap?
  12. Why not use pointers for everything in C++?
  13. Fields of class, are they stored in the stack or heap?
  14. Where are temporary object stored?
  15. Why would you ever want to allocate memory on the heap rather than the stack? [duplicate]
  16. Are there stackless or heapless implementation of C++?
  17. Stack vs heap allocation of structs in Go, and how they relate to garbage collection
  18. Where in memory are string literals ? stack / heap? [duplicate]
  19. How is the array stored in memory?
  20. How is heap and stack memories managed, implemented, allocated?
  21. Is accessing data in the heap faster than from the stack?
  22. Size of stack and heap memory [duplicate]
  23. What happens if I increment an array variable?
  24. PyQt: RuntimeError: wrapped C/C++ object has been deleted
  25. How to find if a variable is allocated in stack or heap?
  26. What kind of Garbage Collection does Go use?
  27. Java very large heap sizes [closed]
  28. Class members and explicit stack/heap allocation
  29. Are global variables in C++ stored on the stack, heap or neither of them?
  30. What’s the Mark-Compact algorithm used by HotSpot?

Leave a Comment