Typically the default implementation of Object.hashCode()
is some function of the allocated address of the object in memory (though this is not
Modern JVMs save the value in the object header. I believe the value is typically calculated only on first use in order to keep time spent in object allocation to a minimum (sometimes down to as low as a dozen cycles). The common Sun JVM can be compiled so that the identity hash code is always 1 for all objects.
Multiple objects can have the same identity hash code. That is the nature of hash codes.
The general guideline for implementing a hashing function is :
The header of an object in HotSpot consists of a class pointer and a "mark" word.
The source code of the data structure for the mark word can be found the markOop.hpp file. In this file there is a comment describing memory layout of the mark word:
hash:25 ------------>| age:4 biased_lock:1 lock:2 (normal object)
Here we can see that the the identity hash code for normal Java objects on a 32 bit system is saved in the mark word and it is 25 bits long.
In answer to the second question, irrespective of the implementation, it is possible for multiple objects to have the same identityHashCode.
See bug 6321873 for a brief discussion on the wording in the javadoc, and a program to demonstrate non-uniqueness.
As far as I know, this is implemented to return the reference, that will never change in a objects lifetime .