author | twisti |
Wed, 25 Aug 2010 05:27:54 -0700 | |
changeset 6418 | 6671edbd230e |
parent 5547 | f4b087cbb361 |
child 7397 | 5b173b4ca846 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
6418 | 2 |
* Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
1 | 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. |
|
8 |
* |
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
13 |
* accompanied this code). |
|
14 |
* |
|
15 |
* You should have received a copy of the GNU General Public License version |
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
18 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
25 |
# include "incls/_precompiled.incl" |
|
26 |
||
27 |
#include "incls/_rframe.cpp.incl" |
|
28 |
||
29 |
static RFrame*const noCaller = (RFrame*) 0x1; // no caller (i.e., initial frame) |
|
30 |
static RFrame*const noCallerYet = (RFrame*) 0x0; // caller not yet computed |
|
31 |
||
32 |
RFrame::RFrame(frame fr, JavaThread* thread, RFrame*const callee) : |
|
33 |
_fr(fr), _thread(thread), _callee(callee), _num(callee ? callee->num() + 1 : 0) { |
|
34 |
_caller = (RFrame*)noCallerYet; |
|
35 |
_invocations = 0; |
|
36 |
_distance = 0; |
|
37 |
} |
|
38 |
||
39 |
void RFrame::set_distance(int d) { |
|
40 |
assert(is_compiled() || d >= 0, "should be positive"); |
|
41 |
_distance = d; |
|
42 |
} |
|
43 |
||
44 |
InterpretedRFrame::InterpretedRFrame(frame fr, JavaThread* thread, RFrame*const callee) |
|
45 |
: RFrame(fr, thread, callee) { |
|
46 |
RegisterMap map(thread, false); |
|
47 |
_vf = javaVFrame::cast(vframe::new_vframe(&_fr, &map, thread)); |
|
48 |
_method = methodHandle(thread, _vf->method()); |
|
49 |
assert( _vf->is_interpreted_frame(), "must be interpreted"); |
|
50 |
init(); |
|
51 |
} |
|
52 |
||
53 |
InterpretedRFrame::InterpretedRFrame(frame fr, JavaThread* thread, methodHandle m) |
|
54 |
: RFrame(fr, thread, NULL) { |
|
55 |
RegisterMap map(thread, false); |
|
56 |
_vf = javaVFrame::cast(vframe::new_vframe(&_fr, &map, thread)); |
|
57 |
_method = m; |
|
58 |
||
59 |
assert( _vf->is_interpreted_frame(), "must be interpreted"); |
|
60 |
init(); |
|
61 |
} |
|
62 |
||
63 |
CompiledRFrame::CompiledRFrame(frame fr, JavaThread* thread, RFrame*const callee) |
|
64 |
: RFrame(fr, thread, callee) { |
|
65 |
init(); |
|
66 |
} |
|
67 |
||
68 |
CompiledRFrame::CompiledRFrame(frame fr, JavaThread* thread) |
|
69 |
: RFrame(fr, thread, NULL) { |
|
70 |
init(); |
|
71 |
} |
|
72 |
||
73 |
DeoptimizedRFrame::DeoptimizedRFrame(frame fr, JavaThread* thread, RFrame*const callee) |
|
74 |
: InterpretedRFrame(fr, thread, callee) {} |
|
75 |
||
76 |
RFrame* RFrame::new_RFrame(frame fr, JavaThread* thread, RFrame*const callee) { |
|
77 |
RFrame* rf; |
|
78 |
int dist = callee ? callee->distance() : -1; |
|
79 |
if (fr.is_interpreted_frame()) { |
|
80 |
rf = new InterpretedRFrame(fr, thread, callee); |
|
81 |
dist++; |
|
82 |
} else if (fr.is_compiled_frame()) { |
|
83 |
// Even deopted frames look compiled because the deopt |
|
84 |
// is invisible until it happens. |
|
85 |
rf = new CompiledRFrame(fr, thread, callee); |
|
86 |
} else { |
|
87 |
assert(false, "Unhandled frame type"); |
|
88 |
} |
|
89 |
rf->set_distance(dist); |
|
90 |
rf->init(); |
|
91 |
return rf; |
|
92 |
} |
|
93 |
||
94 |
RFrame* RFrame::caller() { |
|
95 |
if (_caller != noCallerYet) return (_caller == noCaller) ? NULL : _caller; // already computed caller |
|
96 |
||
97 |
// caller not yet computed; do it now |
|
98 |
if (_fr.is_first_java_frame()) { |
|
99 |
_caller = (RFrame*)noCaller; |
|
100 |
return NULL; |
|
101 |
} |
|
102 |
||
103 |
RegisterMap map(_thread, false); |
|
104 |
frame sender = _fr.real_sender(&map); |
|
105 |
if (sender.is_java_frame()) { |
|
106 |
_caller = new_RFrame(sender, thread(), this); |
|
107 |
return _caller; |
|
108 |
} |
|
109 |
||
110 |
// Real caller is not java related |
|
111 |
_caller = (RFrame*)noCaller; |
|
112 |
return NULL; |
|
113 |
} |
|
114 |
||
115 |
int InterpretedRFrame::cost() const { |
|
116 |
return _method->code_size(); // fix this |
|
117 |
//return _method->estimated_inline_cost(_receiverKlass); |
|
118 |
} |
|
119 |
||
120 |
int CompiledRFrame::cost() const { |
|
121 |
nmethod* nm = top_method()->code(); |
|
122 |
if (nm != NULL) { |
|
6418 | 123 |
return nm->insts_size(); |
1 | 124 |
} else { |
125 |
return top_method()->code_size(); |
|
126 |
} |
|
127 |
} |
|
128 |
||
129 |
void CompiledRFrame::init() { |
|
130 |
RegisterMap map(thread(), false); |
|
131 |
vframe* vf = vframe::new_vframe(&_fr, &map, thread()); |
|
132 |
assert(vf->is_compiled_frame(), "must be compiled"); |
|
133 |
_nm = compiledVFrame::cast(vf)->code(); |
|
134 |
vf = vf->top(); |
|
135 |
_vf = javaVFrame::cast(vf); |
|
136 |
_method = methodHandle(thread(), CodeCache::find_nmethod(_fr.pc())->method()); |
|
137 |
assert(_method(), "should have found a method"); |
|
138 |
#ifndef PRODUCT |
|
139 |
_invocations = _method->compiled_invocation_count(); |
|
140 |
#endif |
|
141 |
} |
|
142 |
||
143 |
void InterpretedRFrame::init() { |
|
144 |
_invocations = _method->invocation_count() + _method->backedge_count(); |
|
145 |
} |
|
146 |
||
147 |
void RFrame::print(const char* kind) { |
|
148 |
#ifndef PRODUCT |
|
149 |
#ifdef COMPILER2 |
|
150 |
int cnt = top_method()->interpreter_invocation_count(); |
|
151 |
#else |
|
152 |
int cnt = top_method()->invocation_count(); |
|
153 |
#endif |
|
154 |
tty->print("%3d %s ", _num, is_interpreted() ? "I" : "C"); |
|
155 |
top_method()->print_short_name(tty); |
|
156 |
tty->print_cr(": inv=%5d(%d) cst=%4d", _invocations, cnt, cost()); |
|
157 |
#endif |
|
158 |
} |
|
159 |
||
160 |
void CompiledRFrame::print() { |
|
161 |
RFrame::print("comp"); |
|
162 |
} |
|
163 |
||
164 |
void InterpretedRFrame::print() { |
|
165 |
RFrame::print("int."); |
|
166 |
} |
|
167 |
||
168 |
void DeoptimizedRFrame::print() { |
|
169 |
RFrame::print("deopt."); |
|
170 |
} |