/* * Copyright (c) 1997, 2008, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ /* * The Original Code is HAT. The Initial Developer of the * Original Code is Bill Foote, with contributions from others * at JavaSoft/Sun. */ package com.sun.tools.hat.internal.server; import java.util.Vector; import com.sun.tools.hat.internal.model.*; import com.sun.tools.hat.internal.util.ArraySorter; import com.sun.tools.hat.internal.util.Comparer; /** * * @author Bill Foote */ class RootsQuery extends QueryHandler { private boolean includeWeak; public RootsQuery(boolean includeWeak) { this.includeWeak = includeWeak; } public void run() { long id = parseHex(query); JavaHeapObject target = snapshot.findThing(id); if (target == null) { startHtml("Object not found for rootset"); error("object not found"); endHtml(); return; } if (includeWeak) { startHtml("Rootset references to " + target + " (includes weak refs)"); } else { startHtml("Rootset references to " + target + " (excludes weak refs)"); } out.flush(); ReferenceChain[] refs = snapshot.rootsetReferencesTo(target, includeWeak); ArraySorter.sort(refs, new Comparer() { public int compare(Object lhs, Object rhs) { ReferenceChain left = (ReferenceChain) lhs; ReferenceChain right = (ReferenceChain) rhs; Root leftR = left.getObj().getRoot(); Root rightR = right.getObj().getRoot(); int d = leftR.getType() - rightR.getType(); if (d != 0) { return -d; // More interesting values are *higher* } return left.getDepth() - right.getDepth(); } }); out.print("