1 /* 2 * Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 26 27 /* 28 * The Original Code is HAT. The Initial Developer of the 29 * Original Code is Bill Foote, with contributions from others 30 * at JavaSoft/Sun. 31 */ 32 33 package jdk.test.lib.hprof.model; 34 35 /** 36 * Represents a chain of references to some target object 37 * 38 * @author Bill Foote 39 */ 40 41 public class ReferenceChain { 42 43 JavaHeapObject obj; // Object referred to 44 ReferenceChain next; // Next in chain 45 46 public ReferenceChain(JavaHeapObject obj, ReferenceChain next) { 47 this.obj = obj; 48 this.next = next; 49 } 50 51 public JavaHeapObject getObj() { 52 return obj; 53 } 54 55 public ReferenceChain getNext() { 56 return next; 57 } 58 59 public int getDepth() { 60 int count = 1; 61 ReferenceChain tmp = next; 62 while (tmp != null) { 63 count++; 64 tmp = tmp.next; 65 } 66 return count; 67 } 68 69 }