Print this page
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/opto/callGenerator.hpp
+++ new/src/share/vm/opto/callGenerator.hpp
1 1 /*
2 - * Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved.
2 + * Copyright (c) 2000, 2011, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #ifndef SHARE_VM_OPTO_CALLGENERATOR_HPP
26 26 #define SHARE_VM_OPTO_CALLGENERATOR_HPP
27 27
28 28 #include "opto/callnode.hpp"
29 29 #include "opto/compile.hpp"
30 30 #include "opto/type.hpp"
31 31 #include "runtime/deoptimization.hpp"
32 32
33 33 //---------------------------CallGenerator-------------------------------------
34 34 // The subclasses of this class handle generation of ideal nodes for
35 35 // call sites and method entry points.
36 36
37 37 class CallGenerator : public ResourceObj {
38 38 public:
39 39 enum {
40 40 xxxunusedxxx
41 41 };
42 42
43 43 private:
44 44 ciMethod* _method; // The method being called.
45 45
46 46 protected:
47 47 CallGenerator(ciMethod* method);
48 48
49 49 public:
50 50 // Accessors
51 51 ciMethod* method() const { return _method; }
52 52
53 53 // is_inline: At least some code implementing the method is copied here.
54 54 virtual bool is_inline() const { return false; }
55 55 // is_intrinsic: There's a method-specific way of generating the inline code.
56 56 virtual bool is_intrinsic() const { return false; }
57 57 // is_parse: Bytecodes implementing the specific method are copied here.
58 58 virtual bool is_parse() const { return false; }
59 59 // is_virtual: The call uses the receiver type to select or check the method.
60 60 virtual bool is_virtual() const { return false; }
61 61 // is_deferred: The decision whether to inline or not is deferred.
62 62 virtual bool is_deferred() const { return false; }
63 63 // is_predicted: Uses an explicit check against a predicted type.
64 64 virtual bool is_predicted() const { return false; }
65 65 // is_trap: Does not return to the caller. (E.g., uncommon trap.)
66 66 virtual bool is_trap() const { return false; }
67 67
68 68 // is_late_inline: supports conversion of call into an inline
69 69 virtual bool is_late_inline() const { return false; }
70 70 // Replace the call with an inline version of the code
71 71 virtual void do_late_inline() { ShouldNotReachHere(); }
72 72
73 73 virtual CallStaticJavaNode* call_node() const { ShouldNotReachHere(); return NULL; }
74 74
75 75 // Note: It is possible for a CG to be both inline and virtual.
76 76 // (The hashCode intrinsic does a vtable check and an inlined fast path.)
77 77
78 78 // Utilities:
79 79 const TypeFunc* tf() const;
80 80
81 81 // The given jvms has state and arguments for a call to my method.
82 82 // Edges after jvms->argoff() carry all (pre-popped) argument values.
83 83 //
84 84 // Update the map with state and return values (if any) and return it.
85 85 // The return values (0, 1, or 2) must be pushed on the map's stack,
86 86 // and the sp of the jvms incremented accordingly.
87 87 //
88 88 // The jvms is returned on success. Alternatively, a copy of the
89 89 // given jvms, suitably updated, may be returned, in which case the
90 90 // caller should discard the original jvms.
91 91 //
92 92 // The non-Parm edges of the returned map will contain updated global state,
93 93 // and one or two edges before jvms->sp() will carry any return values.
94 94 // Other map edges may contain locals or monitors, and should not
95 95 // be changed in meaning.
96 96 //
97 97 // If the call traps, the returned map must have a control edge of top.
98 98 // If the call can throw, the returned map must report has_exceptions().
99 99 //
100 100 // If the result is NULL, it means that this CallGenerator was unable
101 101 // to handle the given call, and another CallGenerator should be consulted.
102 102 virtual JVMState* generate(JVMState* jvms) = 0;
103 103
|
↓ open down ↓ |
91 lines elided |
↑ open up ↑ |
104 104 // How to generate a call site that is inlined:
105 105 static CallGenerator* for_inline(ciMethod* m, float expected_uses = -1);
106 106 // How to generate code for an on-stack replacement handler.
107 107 static CallGenerator* for_osr(ciMethod* m, int osr_bci);
108 108
109 109 // How to generate vanilla out-of-line call sites:
110 110 static CallGenerator* for_direct_call(ciMethod* m, bool separate_io_projs = false); // static, special
111 111 static CallGenerator* for_dynamic_call(ciMethod* m); // invokedynamic
112 112 static CallGenerator* for_virtual_call(ciMethod* m, int vtable_index); // virtual, interface
113 113
114 - static CallGenerator* for_method_handle_inline(Node* method_handle, JVMState* jvms, ciMethod* caller, ciMethod* callee, ciCallProfile profile);
114 + static CallGenerator* for_method_handle_inline(Node* method_handle, JVMState* jvms, ciMethod* caller, ciMethod* callee, ciCallProfile profile);
115 + static CallGenerator* for_invokedynamic_inline(ciCallSite* call_site, JVMState* jvms, ciMethod* caller, ciMethod* callee, ciCallProfile profile);
115 116
116 117 // How to generate a replace a direct call with an inline version
117 118 static CallGenerator* for_late_inline(ciMethod* m, CallGenerator* inline_cg);
118 119
119 120 // How to make a call but defer the decision whether to inline or not.
120 121 static CallGenerator* for_warm_call(WarmCallInfo* ci,
121 122 CallGenerator* if_cold,
122 123 CallGenerator* if_hot);
123 124
124 125 // How to make a call that optimistically assumes a receiver type:
125 126 static CallGenerator* for_predicted_call(ciKlass* predicted_receiver,
126 127 CallGenerator* if_missed,
127 128 CallGenerator* if_hit,
128 129 float hit_prob);
129 130
130 131 // How to make a call that optimistically assumes a MethodHandle target:
131 132 static CallGenerator* for_predicted_dynamic_call(ciMethodHandle* predicted_method_handle,
132 133 CallGenerator* if_missed,
133 134 CallGenerator* if_hit,
134 135 float hit_prob);
135 136
136 137 // How to make a call that gives up and goes back to the interpreter:
137 138 static CallGenerator* for_uncommon_trap(ciMethod* m,
138 139 Deoptimization::DeoptReason reason,
139 140 Deoptimization::DeoptAction action);
140 141
141 142 // Registry for intrinsics:
142 143 static CallGenerator* for_intrinsic(ciMethod* m);
143 144 static void register_intrinsic(ciMethod* m, CallGenerator* cg);
144 145 };
145 146
146 147 class InlineCallGenerator : public CallGenerator {
147 148 virtual bool is_inline() const { return true; }
148 149
149 150 protected:
150 151 InlineCallGenerator(ciMethod* method) : CallGenerator(method) { }
151 152 };
152 153
153 154
154 155 //---------------------------WarmCallInfo--------------------------------------
155 156 // A struct to collect information about a given call site.
156 157 // Helps sort call sites into "hot", "medium", and "cold".
157 158 // Participates in the queueing of "medium" call sites for possible inlining.
158 159 class WarmCallInfo : public ResourceObj {
159 160 private:
160 161
161 162 CallNode* _call; // The CallNode which may be inlined.
162 163 CallGenerator* _hot_cg;// CG for expanding the call node
163 164
164 165 // These are the metrics we use to evaluate call sites:
165 166
166 167 float _count; // How often do we expect to reach this site?
167 168 float _profit; // How much time do we expect to save by inlining?
168 169 float _work; // How long do we expect the average call to take?
169 170 float _size; // How big do we expect the inlined code to be?
170 171
171 172 float _heat; // Combined score inducing total order on call sites.
172 173 WarmCallInfo* _next; // Next cooler call info in pending queue.
173 174
174 175 // Count is the number of times this call site is expected to be executed.
175 176 // Large count is favorable for inlining, because the extra compilation
176 177 // work will be amortized more completely.
177 178
178 179 // Profit is a rough measure of the amount of time we expect to save
179 180 // per execution of this site if we inline it. (1.0 == call overhead)
180 181 // Large profit favors inlining. Negative profit disables inlining.
181 182
182 183 // Work is a rough measure of the amount of time a typical out-of-line
183 184 // call from this site is expected to take. (1.0 == call, no-op, return)
184 185 // Small work is somewhat favorable for inlining, since methods with
185 186 // short "hot" traces are more likely to inline smoothly.
186 187
187 188 // Size is the number of graph nodes we expect this method to produce,
188 189 // not counting the inlining of any further warm calls it may include.
189 190 // Small size favors inlining, since small methods are more likely to
190 191 // inline smoothly. The size is estimated by examining the native code
191 192 // if available. The method bytecodes are also examined, assuming
192 193 // empirically observed node counts for each kind of bytecode.
193 194
194 195 // Heat is the combined "goodness" of a site's inlining. If we were
195 196 // omniscient, it would be the difference of two sums of future execution
196 197 // times of code emitted for this site (amortized across multiple sites if
197 198 // sharing applies). The two sums are for versions of this call site with
198 199 // and without inlining.
199 200
200 201 // We approximate this mythical quantity by playing with averages,
201 202 // rough estimates, and assumptions that history repeats itself.
202 203 // The basic formula count * profit is heuristically adjusted
203 204 // by looking at the expected compilation and execution times of
204 205 // of the inlined call.
205 206
206 207 // Note: Some of these metrics may not be present in the final product,
207 208 // but exist in development builds to experiment with inline policy tuning.
208 209
209 210 // This heuristic framework does not model well the very significant
210 211 // effects of multiple-level inlining. It is possible to see no immediate
211 212 // profit from inlining X->Y, but to get great profit from a subsequent
212 213 // inlining X->Y->Z.
213 214
214 215 // This framework does not take well into account the problem of N**2 code
215 216 // size in a clique of mutually inlinable methods.
216 217
217 218 WarmCallInfo* next() const { return _next; }
218 219 void set_next(WarmCallInfo* n) { _next = n; }
219 220
220 221 static WarmCallInfo _always_hot;
221 222 static WarmCallInfo _always_cold;
222 223
223 224 // Constructor intitialization of always_hot and always_cold
224 225 WarmCallInfo(float c, float p, float w, float s) {
225 226 _call = NULL;
226 227 _hot_cg = NULL;
227 228 _next = NULL;
228 229 _count = c;
229 230 _profit = p;
230 231 _work = w;
231 232 _size = s;
232 233 _heat = 0;
233 234 }
234 235
235 236 public:
236 237 // Because WarmInfo objects live over the entire lifetime of the
237 238 // Compile object, they are allocated into the comp_arena, which
238 239 // does not get resource marked or reset during the compile process
239 240 void *operator new( size_t x, Compile* C ) { return C->comp_arena()->Amalloc(x); }
240 241 void operator delete( void * ) { } // fast deallocation
241 242
242 243 static WarmCallInfo* always_hot();
243 244 static WarmCallInfo* always_cold();
244 245
245 246 WarmCallInfo() {
246 247 _call = NULL;
247 248 _hot_cg = NULL;
248 249 _next = NULL;
249 250 _count = _profit = _work = _size = _heat = 0;
250 251 }
251 252
252 253 CallNode* call() const { return _call; }
253 254 float count() const { return _count; }
254 255 float size() const { return _size; }
255 256 float work() const { return _work; }
256 257 float profit() const { return _profit; }
257 258 float heat() const { return _heat; }
258 259
259 260 void set_count(float x) { _count = x; }
260 261 void set_size(float x) { _size = x; }
261 262 void set_work(float x) { _work = x; }
262 263 void set_profit(float x) { _profit = x; }
263 264 void set_heat(float x) { _heat = x; }
264 265
265 266 // Load initial heuristics from profiles, etc.
266 267 // The heuristics can be tweaked further by the caller.
267 268 void init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor);
268 269
269 270 static float MAX_VALUE() { return +1.0e10; }
270 271 static float MIN_VALUE() { return -1.0e10; }
271 272
272 273 float compute_heat() const;
273 274
274 275 void set_call(CallNode* call) { _call = call; }
275 276 void set_hot_cg(CallGenerator* cg) { _hot_cg = cg; }
276 277
277 278 // Do not queue very hot or very cold calls.
278 279 // Make very cold ones out of line immediately.
279 280 // Inline very hot ones immediately.
280 281 // These queries apply various tunable limits
281 282 // to the above metrics in a systematic way.
282 283 // Test for coldness before testing for hotness.
283 284 bool is_cold() const;
284 285 bool is_hot() const;
285 286
286 287 // Force a warm call to be hot. This worklists the call node for inlining.
287 288 void make_hot();
288 289
289 290 // Force a warm call to be cold. This worklists the call node for out-of-lining.
290 291 void make_cold();
291 292
292 293 // A reproducible total ordering, in which heat is the major key.
293 294 bool warmer_than(WarmCallInfo* that);
294 295
295 296 // List management. These methods are called with the list head,
296 297 // and return the new list head, inserting or removing the receiver.
297 298 WarmCallInfo* insert_into(WarmCallInfo* head);
298 299 WarmCallInfo* remove_from(WarmCallInfo* head);
299 300
300 301 #ifndef PRODUCT
301 302 void print() const;
302 303 void print_all() const;
303 304 int count_all() const;
304 305 #endif
305 306 };
306 307
307 308 #endif // SHARE_VM_OPTO_CALLGENERATOR_HPP
|
↓ open down ↓ |
183 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX