[Lilliput] Implement compact identity hashcode

Currently, the identity hash-code of an object is stored as 31bit value in the object's header. We should implement it such that the storage for the identity hash code is only allocated when it's actually needed.