I understand that in Java, if an object doesn’t have any references to it any more, the garbage collector will reclaim it back some time later.
But how does the garbage collector know that an object has or has not references associated to it?
Is garbage collector using some kind of hashmap or table?
Please note that I am not asking how generally GC works. Really, I am not asking that. I am asking specifically how GC knows which objects are live and which are dead, with efficiencies.
That’s why I say in my question that is GC maintain some kind of hashmap or set, and consistently update the number of references an object has?
A typical modern JVM uses several different types of garbage collectors.
One type that’s often used for objects that have been around for a while is called Mark-and-Sweep. It basically involves starting from known “live” objects (the so-called garbage collection roots), following all chains of object references, and marking every reachable object as “live”.
Once this is done, the sweep stage can reclaim those objects that haven’t been marked as “live”.
For this process to work, the JVM has to know the location in memory of every object reference. This is a necessary condition for a garbage collector to be precise (which Java’s is).