Java中的Sizeof(二)

核心提示：在做了所有这些预备之后，下面就是这种图形遍历的标准实现：public static IObjectPRofileNode profile (Object obj) { final IdentityHashMap visited = new IdentityHashMap ();

　　在做了所有这些预备之后，下面就是这种图形遍历的标准实现：

public static IObjectPRofileNode profile (Object obj)
{
final IdentityHashMap visited = new IdentityHashMap ();

final ObjectProfileNode root = createProfileTree (obj, visited,
CLASS_METADATA_CACHE);
finishProfileTree (root);

return root;
}

private static ObjectProfileNode createProfileTree (Object obj,
IdentityHashMap visited,
Map metadataMap)
{
final ObjectProfileNode root = new ObjectProfileNode (null, obj, null);

final LinkedList queue = new LinkedList ();

queue.addFirst (root);
visited.put (obj, root);

final ClassaccessPrivilegedAction caAction =
new ClassAccessPrivilegedAction ();
final FieldAccessPrivilegedAction faAction =
new FieldAccessPrivilegedAction ();

while (! queue.isEmpty ())
{
final ObjectProfileNode node = (ObjectProfileNode) queue.removeFirst ();

obj = node.m_obj;
final Class objClass = obj.getClass ();

if (objClass.isArray ())
{
final int arrayLength = Array.getLength (obj);
final Class componentType = objClass.getComponentType ();

// Add shell pseudo-node:
final AbstractShellProfileNode shell =
new ArrayShellProfileNode (node, objClass, arrayLength);
shell.m_size = sizeofArrayShell (arrayLength, componentType);

node.m_shell = shell;
node.addFieldRef (shell);

if (! componentType.isPrimitive ())
{
// Traverse each array slot:
for (int i = 0; i < arrayLength; ++ i)
{
final Object ref = Array.get (obj, i);

if (ref != null)
{
ObjectProfileNode child =
(ObjectProfileNode) visited.get (ref);
if (child != null)
++ child.m_refcount;
else