StackTrace.java revision 2224:2a8815d86b93 
1/*
2 * Copyright (c) 1997, 2016, 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
33package jdk.test.lib.hprof.model;
34
35/**
36 *
37 * @author      Bill Foote
38 */
39
40
41/**
42 * Represents a stack trace, that is, an ordered collection of stack frames.
43 */
44
45public class StackTrace {
46
47    private StackFrame[] frames;
48
49    public StackTrace(StackFrame[] frames) {
50        this.frames = frames;
51    }
52
53    /**
54     * @param depth.  The minimum reasonable depth is 1.
55     *
56     * @return a (possibly new) StackTrace that is limited to depth.
57     */
58    public StackTrace traceForDepth(int depth) {
59        if (depth >= frames.length) {
60            return this;
61        } else {
62            StackFrame[] f = new StackFrame[depth];
63            System.arraycopy(frames, 0, f, 0, depth);
64            return new StackTrace(f);
65        }
66    }
67
68    public void resolve(Snapshot snapshot) {
69        for (int i = 0; i < frames.length; i++) {
70            frames[i].resolve(snapshot);
71        }
72    }
73
74    public StackFrame[] getFrames() {
75        return frames;
76    }
77}
78