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