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