Mercurial > hg > truffle
annotate src/share/vm/opto/compile.cpp @ 21231:0bb06deee33b
Check for null in LabelOp#setIncomingValues and JumpOp#setOutgoingValues.
author | Josef Eisl <josef.eisl@jku.at> |
---|---|
date | Tue, 05 May 2015 12:12:33 +0200 |
parents | 7848fc12602b |
children |
rev | line source |
---|---|
0 | 1 /* |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17914
diff
changeset
|
2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved. |
0 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1397
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1397
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1397
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
7199
cd3d6a6b95d9
8003240: x86: move MacroAssembler into separate file
twisti
parents:
7196
diff
changeset
|
26 #include "asm/macroAssembler.hpp" |
cd3d6a6b95d9
8003240: x86: move MacroAssembler into separate file
twisti
parents:
7196
diff
changeset
|
27 #include "asm/macroAssembler.inline.hpp" |
14232 | 28 #include "ci/ciReplay.hpp" |
1972 | 29 #include "classfile/systemDictionary.hpp" |
30 #include "code/exceptionHandlerTable.hpp" | |
31 #include "code/nmethod.hpp" | |
32 #include "compiler/compileLog.hpp" | |
7199
cd3d6a6b95d9
8003240: x86: move MacroAssembler into separate file
twisti
parents:
7196
diff
changeset
|
33 #include "compiler/disassembler.hpp" |
1972 | 34 #include "compiler/oopMap.hpp" |
35 #include "opto/addnode.hpp" | |
36 #include "opto/block.hpp" | |
37 #include "opto/c2compiler.hpp" | |
38 #include "opto/callGenerator.hpp" | |
39 #include "opto/callnode.hpp" | |
40 #include "opto/cfgnode.hpp" | |
41 #include "opto/chaitin.hpp" | |
42 #include "opto/compile.hpp" | |
43 #include "opto/connode.hpp" | |
44 #include "opto/divnode.hpp" | |
45 #include "opto/escape.hpp" | |
46 #include "opto/idealGraphPrinter.hpp" | |
47 #include "opto/loopnode.hpp" | |
48 #include "opto/machnode.hpp" | |
49 #include "opto/macro.hpp" | |
50 #include "opto/matcher.hpp" | |
12888
4a2acfb16e97
8025657: compiler/intrinsics/mathexact/ConstantTest.java fails on assert in lcm.cpp on solaris x64
rbackman
parents:
12295
diff
changeset
|
51 #include "opto/mathexactnode.hpp" |
1972 | 52 #include "opto/memnode.hpp" |
53 #include "opto/mulnode.hpp" | |
54 #include "opto/node.hpp" | |
55 #include "opto/opcodes.hpp" | |
56 #include "opto/output.hpp" | |
57 #include "opto/parse.hpp" | |
58 #include "opto/phaseX.hpp" | |
59 #include "opto/rootnode.hpp" | |
60 #include "opto/runtime.hpp" | |
61 #include "opto/stringopts.hpp" | |
62 #include "opto/type.hpp" | |
63 #include "opto/vectornode.hpp" | |
64 #include "runtime/arguments.hpp" | |
65 #include "runtime/signature.hpp" | |
66 #include "runtime/stubRoutines.hpp" | |
67 #include "runtime/timer.hpp" | |
10405 | 68 #include "trace/tracing.hpp" |
1972 | 69 #include "utilities/copy.hpp" |
70 #ifdef TARGET_ARCH_MODEL_x86_32 | |
71 # include "adfiles/ad_x86_32.hpp" | |
72 #endif | |
73 #ifdef TARGET_ARCH_MODEL_x86_64 | |
74 # include "adfiles/ad_x86_64.hpp" | |
75 #endif | |
76 #ifdef TARGET_ARCH_MODEL_sparc | |
77 # include "adfiles/ad_sparc.hpp" | |
78 #endif | |
79 #ifdef TARGET_ARCH_MODEL_zero | |
80 # include "adfiles/ad_zero.hpp" | |
81 #endif | |
2192
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2091
diff
changeset
|
82 #ifdef TARGET_ARCH_MODEL_arm |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2091
diff
changeset
|
83 # include "adfiles/ad_arm.hpp" |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2091
diff
changeset
|
84 #endif |
14391 | 85 #ifdef TARGET_ARCH_MODEL_ppc_32 |
86 # include "adfiles/ad_ppc_32.hpp" | |
87 #endif | |
88 #ifdef TARGET_ARCH_MODEL_ppc_64 | |
89 # include "adfiles/ad_ppc_64.hpp" | |
2192
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2091
diff
changeset
|
90 #endif |
0 | 91 |
2008 | 92 |
93 // -------------------- Compile::mach_constant_base_node ----------------------- | |
94 // Constant table base node singleton. | |
95 MachConstantBaseNode* Compile::mach_constant_base_node() { | |
96 if (_mach_constant_base_node == NULL) { | |
97 _mach_constant_base_node = new (C) MachConstantBaseNode(); | |
98 _mach_constant_base_node->add_req(C->root()); | |
99 } | |
100 return _mach_constant_base_node; | |
101 } | |
102 | |
103 | |
0 | 104 /// Support for intrinsics. |
105 | |
106 // Return the index at which m must be inserted (or already exists). | |
107 // The sort order is by the address of the ciMethod, with is_virtual as minor key. | |
108 int Compile::intrinsic_insertion_index(ciMethod* m, bool is_virtual) { | |
109 #ifdef ASSERT | |
110 for (int i = 1; i < _intrinsics->length(); i++) { | |
111 CallGenerator* cg1 = _intrinsics->at(i-1); | |
112 CallGenerator* cg2 = _intrinsics->at(i); | |
113 assert(cg1->method() != cg2->method() | |
114 ? cg1->method() < cg2->method() | |
115 : cg1->is_virtual() < cg2->is_virtual(), | |
116 "compiler intrinsics list must stay sorted"); | |
117 } | |
118 #endif | |
119 // Binary search sorted list, in decreasing intervals [lo, hi]. | |
120 int lo = 0, hi = _intrinsics->length()-1; | |
121 while (lo <= hi) { | |
122 int mid = (uint)(hi + lo) / 2; | |
123 ciMethod* mid_m = _intrinsics->at(mid)->method(); | |
124 if (m < mid_m) { | |
125 hi = mid-1; | |
126 } else if (m > mid_m) { | |
127 lo = mid+1; | |
128 } else { | |
129 // look at minor sort key | |
130 bool mid_virt = _intrinsics->at(mid)->is_virtual(); | |
131 if (is_virtual < mid_virt) { | |
132 hi = mid-1; | |
133 } else if (is_virtual > mid_virt) { | |
134 lo = mid+1; | |
135 } else { | |
136 return mid; // exact match | |
137 } | |
138 } | |
139 } | |
140 return lo; // inexact match | |
141 } | |
142 | |
143 void Compile::register_intrinsic(CallGenerator* cg) { | |
144 if (_intrinsics == NULL) { | |
7473 | 145 _intrinsics = new (comp_arena())GrowableArray<CallGenerator*>(comp_arena(), 60, 0, NULL); |
0 | 146 } |
147 // This code is stolen from ciObjectFactory::insert. | |
148 // Really, GrowableArray should have methods for | |
149 // insert_at, remove_at, and binary_search. | |
150 int len = _intrinsics->length(); | |
151 int index = intrinsic_insertion_index(cg->method(), cg->is_virtual()); | |
152 if (index == len) { | |
153 _intrinsics->append(cg); | |
154 } else { | |
155 #ifdef ASSERT | |
156 CallGenerator* oldcg = _intrinsics->at(index); | |
157 assert(oldcg->method() != cg->method() || oldcg->is_virtual() != cg->is_virtual(), "don't register twice"); | |
158 #endif | |
159 _intrinsics->append(_intrinsics->at(len-1)); | |
160 int pos; | |
161 for (pos = len-2; pos >= index; pos--) { | |
162 _intrinsics->at_put(pos+1,_intrinsics->at(pos)); | |
163 } | |
164 _intrinsics->at_put(index, cg); | |
165 } | |
166 assert(find_intrinsic(cg->method(), cg->is_virtual()) == cg, "registration worked"); | |
167 } | |
168 | |
169 CallGenerator* Compile::find_intrinsic(ciMethod* m, bool is_virtual) { | |
170 assert(m->is_loaded(), "don't try this on unloaded methods"); | |
171 if (_intrinsics != NULL) { | |
172 int index = intrinsic_insertion_index(m, is_virtual); | |
173 if (index < _intrinsics->length() | |
174 && _intrinsics->at(index)->method() == m | |
175 && _intrinsics->at(index)->is_virtual() == is_virtual) { | |
176 return _intrinsics->at(index); | |
177 } | |
178 } | |
179 // Lazily create intrinsics for intrinsic IDs well-known in the runtime. | |
856
75596850f863
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents:
647
diff
changeset
|
180 if (m->intrinsic_id() != vmIntrinsics::_none && |
75596850f863
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents:
647
diff
changeset
|
181 m->intrinsic_id() <= vmIntrinsics::LAST_COMPILER_INLINE) { |
0 | 182 CallGenerator* cg = make_vm_intrinsic(m, is_virtual); |
183 if (cg != NULL) { | |
184 // Save it for next time: | |
185 register_intrinsic(cg); | |
186 return cg; | |
187 } else { | |
188 gather_intrinsic_statistics(m->intrinsic_id(), is_virtual, _intrinsic_disabled); | |
189 } | |
190 } | |
191 return NULL; | |
192 } | |
193 | |
194 // Compile:: register_library_intrinsics and make_vm_intrinsic are defined | |
195 // in library_call.cpp. | |
196 | |
197 | |
198 #ifndef PRODUCT | |
199 // statistics gathering... | |
200 | |
201 juint Compile::_intrinsic_hist_count[vmIntrinsics::ID_LIMIT] = {0}; | |
202 jubyte Compile::_intrinsic_hist_flags[vmIntrinsics::ID_LIMIT] = {0}; | |
203 | |
204 bool Compile::gather_intrinsic_statistics(vmIntrinsics::ID id, bool is_virtual, int flags) { | |
205 assert(id > vmIntrinsics::_none && id < vmIntrinsics::ID_LIMIT, "oob"); | |
206 int oflags = _intrinsic_hist_flags[id]; | |
207 assert(flags != 0, "what happened?"); | |
208 if (is_virtual) { | |
209 flags |= _intrinsic_virtual; | |
210 } | |
211 bool changed = (flags != oflags); | |
212 if ((flags & _intrinsic_worked) != 0) { | |
213 juint count = (_intrinsic_hist_count[id] += 1); | |
214 if (count == 1) { | |
215 changed = true; // first time | |
216 } | |
217 // increment the overall count also: | |
218 _intrinsic_hist_count[vmIntrinsics::_none] += 1; | |
219 } | |
220 if (changed) { | |
221 if (((oflags ^ flags) & _intrinsic_virtual) != 0) { | |
222 // Something changed about the intrinsic's virtuality. | |
223 if ((flags & _intrinsic_virtual) != 0) { | |
224 // This is the first use of this intrinsic as a virtual call. | |
225 if (oflags != 0) { | |
226 // We already saw it as a non-virtual, so note both cases. | |
227 flags |= _intrinsic_both; | |
228 } | |
229 } else if ((oflags & _intrinsic_both) == 0) { | |
230 // This is the first use of this intrinsic as a non-virtual | |
231 flags |= _intrinsic_both; | |
232 } | |
233 } | |
234 _intrinsic_hist_flags[id] = (jubyte) (oflags | flags); | |
235 } | |
236 // update the overall flags also: | |
237 _intrinsic_hist_flags[vmIntrinsics::_none] |= (jubyte) flags; | |
238 return changed; | |
239 } | |
240 | |
241 static char* format_flags(int flags, char* buf) { | |
242 buf[0] = 0; | |
243 if ((flags & Compile::_intrinsic_worked) != 0) strcat(buf, ",worked"); | |
244 if ((flags & Compile::_intrinsic_failed) != 0) strcat(buf, ",failed"); | |
245 if ((flags & Compile::_intrinsic_disabled) != 0) strcat(buf, ",disabled"); | |
246 if ((flags & Compile::_intrinsic_virtual) != 0) strcat(buf, ",virtual"); | |
247 if ((flags & Compile::_intrinsic_both) != 0) strcat(buf, ",nonvirtual"); | |
248 if (buf[0] == 0) strcat(buf, ","); | |
249 assert(buf[0] == ',', "must be"); | |
250 return &buf[1]; | |
251 } | |
252 | |
253 void Compile::print_intrinsic_statistics() { | |
254 char flagsbuf[100]; | |
255 ttyLocker ttyl; | |
256 if (xtty != NULL) xtty->head("statistics type='intrinsic'"); | |
257 tty->print_cr("Compiler intrinsic usage:"); | |
258 juint total = _intrinsic_hist_count[vmIntrinsics::_none]; | |
259 if (total == 0) total = 1; // avoid div0 in case of no successes | |
260 #define PRINT_STAT_LINE(name, c, f) \ | |
261 tty->print_cr(" %4d (%4.1f%%) %s (%s)", (int)(c), ((c) * 100.0) / total, name, f); | |
262 for (int index = 1 + (int)vmIntrinsics::_none; index < (int)vmIntrinsics::ID_LIMIT; index++) { | |
263 vmIntrinsics::ID id = (vmIntrinsics::ID) index; | |
264 int flags = _intrinsic_hist_flags[id]; | |
265 juint count = _intrinsic_hist_count[id]; | |
266 if ((flags | count) != 0) { | |
267 PRINT_STAT_LINE(vmIntrinsics::name_at(id), count, format_flags(flags, flagsbuf)); | |
268 } | |
269 } | |
270 PRINT_STAT_LINE("total", total, format_flags(_intrinsic_hist_flags[vmIntrinsics::_none], flagsbuf)); | |
271 if (xtty != NULL) xtty->tail("statistics"); | |
272 } | |
273 | |
274 void Compile::print_statistics() { | |
275 { ttyLocker ttyl; | |
276 if (xtty != NULL) xtty->head("statistics type='opto'"); | |
277 Parse::print_statistics(); | |
278 PhaseCCP::print_statistics(); | |
279 PhaseRegAlloc::print_statistics(); | |
280 Scheduling::print_statistics(); | |
281 PhasePeephole::print_statistics(); | |
282 PhaseIdealLoop::print_statistics(); | |
283 if (xtty != NULL) xtty->tail("statistics"); | |
284 } | |
285 if (_intrinsic_hist_flags[vmIntrinsics::_none] != 0) { | |
286 // put this under its own <statistics> element. | |
287 print_intrinsic_statistics(); | |
288 } | |
289 } | |
290 #endif //PRODUCT | |
291 | |
292 // Support for bundling info | |
293 Bundle* Compile::node_bundling(const Node *n) { | |
294 assert(valid_bundle_info(n), "oob"); | |
295 return &_node_bundling_base[n->_idx]; | |
296 } | |
297 | |
298 bool Compile::valid_bundle_info(const Node *n) { | |
299 return (_node_bundling_limit > n->_idx); | |
300 } | |
301 | |
302 | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
303 void Compile::gvn_replace_by(Node* n, Node* nn) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
304 for (DUIterator_Last imin, i = n->last_outs(imin); i >= imin; ) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
305 Node* use = n->last_out(i); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
306 bool is_in_table = initial_gvn()->hash_delete(use); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
307 uint uses_found = 0; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
308 for (uint j = 0; j < use->len(); j++) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
309 if (use->in(j) == n) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
310 if (j < use->req()) |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
311 use->set_req(j, nn); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
312 else |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
313 use->set_prec(j, nn); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
314 uses_found++; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
315 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
316 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
317 if (is_in_table) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
318 // reinsert into table |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
319 initial_gvn()->hash_find_insert(use); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
320 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
321 record_for_igvn(use); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
322 i -= uses_found; // we deleted 1 or more copies of this edge |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
323 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
324 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
325 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
326 |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
327 static inline bool not_a_node(const Node* n) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
328 if (n == NULL) return true; |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
329 if (((intptr_t)n & 1) != 0) return true; // uninitialized, etc. |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
330 if (*(address*)n == badAddress) return true; // kill by Node::destruct |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
331 return false; |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
332 } |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
333 |
0 | 334 // Identify all nodes that are reachable from below, useful. |
335 // Use breadth-first pass that records state in a Unique_Node_List, | |
336 // recursive traversal is slower. | |
337 void Compile::identify_useful_nodes(Unique_Node_List &useful) { | |
338 int estimated_worklist_size = unique(); | |
339 useful.map( estimated_worklist_size, NULL ); // preallocate space | |
340 | |
341 // Initialize worklist | |
342 if (root() != NULL) { useful.push(root()); } | |
343 // If 'top' is cached, declare it useful to preserve cached node | |
344 if( cached_top_node() ) { useful.push(cached_top_node()); } | |
345 | |
346 // Push all useful nodes onto the list, breadthfirst | |
347 for( uint next = 0; next < useful.size(); ++next ) { | |
348 assert( next < unique(), "Unique useful nodes < total nodes"); | |
349 Node *n = useful.at(next); | |
350 uint max = n->len(); | |
351 for( uint i = 0; i < max; ++i ) { | |
352 Node *m = n->in(i); | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
353 if (not_a_node(m)) continue; |
0 | 354 useful.push(m); |
355 } | |
356 } | |
357 } | |
358 | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
359 // Update dead_node_list with any missing dead nodes using useful |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
360 // list. Consider all non-useful nodes to be useless i.e., dead nodes. |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
361 void Compile::update_dead_node_list(Unique_Node_List &useful) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
362 uint max_idx = unique(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
363 VectorSet& useful_node_set = useful.member_set(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
364 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
365 for (uint node_idx = 0; node_idx < max_idx; node_idx++) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
366 // If node with index node_idx is not in useful set, |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
367 // mark it as dead in dead node list. |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
368 if (! useful_node_set.test(node_idx) ) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
369 record_dead_node(node_idx); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
370 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
371 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
372 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
373 |
7473 | 374 void Compile::remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful) { |
375 int shift = 0; | |
376 for (int i = 0; i < inlines->length(); i++) { | |
377 CallGenerator* cg = inlines->at(i); | |
378 CallNode* call = cg->call_node(); | |
379 if (shift > 0) { | |
380 inlines->at_put(i-shift, cg); | |
381 } | |
382 if (!useful.member(call)) { | |
383 shift++; | |
384 } | |
385 } | |
386 inlines->trunc_to(inlines->length()-shift); | |
387 } | |
388 | |
0 | 389 // Disconnect all useless nodes by disconnecting those at the boundary. |
390 void Compile::remove_useless_nodes(Unique_Node_List &useful) { | |
391 uint next = 0; | |
4064
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
392 while (next < useful.size()) { |
0 | 393 Node *n = useful.at(next++); |
20327
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
394 if (n->is_SafePoint()) { |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
395 // We're done with a parsing phase. Replaced nodes are not valid |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
396 // beyond that point. |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
397 n->as_SafePoint()->delete_replaced_nodes(); |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
398 } |
0 | 399 // Use raw traversal of out edges since this code removes out edges |
400 int max = n->outcnt(); | |
4064
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
401 for (int j = 0; j < max; ++j) { |
0 | 402 Node* child = n->raw_out(j); |
4064
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
403 if (! useful.member(child)) { |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
404 assert(!child->is_top() || child != top(), |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
405 "If top is cached in Compile object it is in useful list"); |
0 | 406 // Only need to remove this out-edge to the useless node |
407 n->raw_del_out(j); | |
408 --j; | |
409 --max; | |
410 } | |
411 } | |
412 if (n->outcnt() == 1 && n->has_special_unique_user()) { | |
4064
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
413 record_for_igvn(n->unique_out()); |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
414 } |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
415 } |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
416 // Remove useless macro and predicate opaq nodes |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
417 for (int i = C->macro_count()-1; i >= 0; i--) { |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
418 Node* n = C->macro_node(i); |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
419 if (!useful.member(n)) { |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
420 remove_macro_node(n); |
0 | 421 } |
422 } | |
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
423 // Remove useless expensive node |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
424 for (int i = C->expensive_count()-1; i >= 0; i--) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
425 Node* n = C->expensive_node(i); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
426 if (!useful.member(n)) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
427 remove_expensive_node(n); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
428 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
429 } |
7473 | 430 // clean up the late inline lists |
431 remove_useless_late_inlines(&_string_late_inlines, useful); | |
10278 | 432 remove_useless_late_inlines(&_boxing_late_inlines, useful); |
7473 | 433 remove_useless_late_inlines(&_late_inlines, useful); |
0 | 434 debug_only(verify_graph_edges(true/*check for no_dead_code*/);) |
435 } | |
436 | |
437 //------------------------------frame_size_in_words----------------------------- | |
438 // frame_slots in units of words | |
439 int Compile::frame_size_in_words() const { | |
440 // shift is 0 in LP32 and 1 in LP64 | |
441 const int shift = (LogBytesPerWord - LogBytesPerInt); | |
442 int words = _frame_slots >> shift; | |
443 assert( words << shift == _frame_slots, "frame size must be properly aligned in LP64" ); | |
444 return words; | |
445 } | |
446 | |
17980
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
447 // To bang the stack of this compiled method we use the stack size |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
448 // that the interpreter would need in case of a deoptimization. This |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
449 // removes the need to bang the stack in the deoptimization blob which |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
450 // in turn simplifies stack overflow handling. |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
451 int Compile::bang_size_in_bytes() const { |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
452 return MAX2(_interpreter_frame_size, frame_size_in_bytes()); |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
453 } |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
454 |
0 | 455 // ============================================================================ |
456 //------------------------------CompileWrapper--------------------------------- | |
457 class CompileWrapper : public StackObj { | |
458 Compile *const _compile; | |
459 public: | |
460 CompileWrapper(Compile* compile); | |
461 | |
462 ~CompileWrapper(); | |
463 }; | |
464 | |
465 CompileWrapper::CompileWrapper(Compile* compile) : _compile(compile) { | |
466 // the Compile* pointer is stored in the current ciEnv: | |
467 ciEnv* env = compile->env(); | |
468 assert(env == ciEnv::current(), "must already be a ciEnv active"); | |
469 assert(env->compiler_data() == NULL, "compile already active?"); | |
470 env->set_compiler_data(compile); | |
471 assert(compile == Compile::current(), "sanity"); | |
472 | |
473 compile->set_type_dict(NULL); | |
474 compile->set_type_hwm(NULL); | |
475 compile->set_type_last_size(0); | |
476 compile->set_last_tf(NULL, NULL); | |
477 compile->set_indexSet_arena(NULL); | |
478 compile->set_indexSet_free_block_list(NULL); | |
479 compile->init_type_arena(); | |
480 Type::Initialize(compile); | |
481 _compile->set_scratch_buffer_blob(NULL); | |
482 _compile->begin_method(); | |
483 } | |
484 CompileWrapper::~CompileWrapper() { | |
485 _compile->end_method(); | |
486 if (_compile->scratch_buffer_blob() != NULL) | |
487 BufferBlob::free(_compile->scratch_buffer_blob()); | |
488 _compile->env()->set_compiler_data(NULL); | |
489 } | |
490 | |
491 | |
492 //----------------------------print_compile_messages--------------------------- | |
493 void Compile::print_compile_messages() { | |
494 #ifndef PRODUCT | |
495 // Check if recompiling | |
496 if (_subsume_loads == false && PrintOpto) { | |
497 // Recompiling without allowing machine instructions to subsume loads | |
498 tty->print_cr("*********************************************************"); | |
499 tty->print_cr("** Bailout: Recompile without subsuming loads **"); | |
500 tty->print_cr("*********************************************************"); | |
501 } | |
38
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
502 if (_do_escape_analysis != DoEscapeAnalysis && PrintOpto) { |
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
503 // Recompiling without escape analysis |
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
504 tty->print_cr("*********************************************************"); |
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
505 tty->print_cr("** Bailout: Recompile without escape analysis **"); |
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
506 tty->print_cr("*********************************************************"); |
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
507 } |
10278 | 508 if (_eliminate_boxing != EliminateAutoBox && PrintOpto) { |
509 // Recompiling without boxing elimination | |
510 tty->print_cr("*********************************************************"); | |
511 tty->print_cr("** Bailout: Recompile without boxing elimination **"); | |
512 tty->print_cr("*********************************************************"); | |
513 } | |
0 | 514 if (env()->break_at_compile()) { |
605 | 515 // Open the debugger when compiling this method. |
0 | 516 tty->print("### Breaking when compiling: "); |
517 method()->print_short_name(); | |
518 tty->cr(); | |
519 BREAKPOINT; | |
520 } | |
521 | |
522 if( PrintOpto ) { | |
523 if (is_osr_compilation()) { | |
524 tty->print("[OSR]%3d", _compile_id); | |
525 } else { | |
526 tty->print("%3d", _compile_id); | |
527 } | |
528 } | |
529 #endif | |
530 } | |
531 | |
532 | |
2091
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
533 //-----------------------init_scratch_buffer_blob------------------------------ |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
534 // Construct a temporary BufferBlob and cache it for this compile. |
2008 | 535 void Compile::init_scratch_buffer_blob(int const_size) { |
2091
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
536 // If there is already a scratch buffer blob allocated and the |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
537 // constant section is big enough, use it. Otherwise free the |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
538 // current and allocate a new one. |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
539 BufferBlob* blob = scratch_buffer_blob(); |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
540 if ((blob != NULL) && (const_size <= _scratch_const_size)) { |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
541 // Use the current blob. |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
542 } else { |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
543 if (blob != NULL) { |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
544 BufferBlob::free(blob); |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
545 } |
0 | 546 |
2091
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
547 ResourceMark rm; |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
548 _scratch_const_size = const_size; |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
549 int size = (MAX_inst_size + MAX_stubs_size + _scratch_const_size); |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
550 blob = BufferBlob::create("Compile::scratch_buffer", size); |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
551 // Record the buffer blob for next time. |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
552 set_scratch_buffer_blob(blob); |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
553 // Have we run out of code space? |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
554 if (scratch_buffer_blob() == NULL) { |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
555 // Let CompilerBroker disable further compilations. |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
556 record_failure("Not enough space for scratch buffer in CodeCache"); |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
557 return; |
51bd2d261853
7008325: CodeCache exhausted on sparc starting from hs20b04
kvn
parents:
2008
diff
changeset
|
558 } |
163 | 559 } |
0 | 560 |
561 // Initialize the relocation buffers | |
1748 | 562 relocInfo* locs_buf = (relocInfo*) blob->content_end() - MAX_locs_size; |
0 | 563 set_scratch_locs_memory(locs_buf); |
564 } | |
565 | |
566 | |
567 //-----------------------scratch_emit_size------------------------------------- | |
568 // Helper function that computes size by emitting code | |
569 uint Compile::scratch_emit_size(const Node* n) { | |
2008 | 570 // Start scratch_emit_size section. |
571 set_in_scratch_emit_size(true); | |
572 | |
0 | 573 // Emit into a trash buffer and count bytes emitted. |
574 // This is a pretty expensive way to compute a size, | |
575 // but it works well enough if seldom used. | |
576 // All common fixed-size instructions are given a size | |
577 // method by the AD file. | |
578 // Note that the scratch buffer blob and locs memory are | |
579 // allocated at the beginning of the compile task, and | |
580 // may be shared by several calls to scratch_emit_size. | |
581 // The allocation of the scratch buffer blob is particularly | |
582 // expensive, since it has to grab the code cache lock. | |
583 BufferBlob* blob = this->scratch_buffer_blob(); | |
584 assert(blob != NULL, "Initialize BufferBlob at start"); | |
585 assert(blob->size() > MAX_inst_size, "sanity"); | |
586 relocInfo* locs_buf = scratch_locs_memory(); | |
1748 | 587 address blob_begin = blob->content_begin(); |
0 | 588 address blob_end = (address)locs_buf; |
1748 | 589 assert(blob->content_contains(blob_end), "sanity"); |
0 | 590 CodeBuffer buf(blob_begin, blob_end - blob_begin); |
2008 | 591 buf.initialize_consts_size(_scratch_const_size); |
0 | 592 buf.initialize_stubs_size(MAX_stubs_size); |
593 assert(locs_buf != NULL, "sanity"); | |
2008 | 594 int lsize = MAX_locs_size / 3; |
595 buf.consts()->initialize_shared_locs(&locs_buf[lsize * 0], lsize); | |
596 buf.insts()->initialize_shared_locs( &locs_buf[lsize * 1], lsize); | |
597 buf.stubs()->initialize_shared_locs( &locs_buf[lsize * 2], lsize); | |
598 | |
599 // Do the emission. | |
3839 | 600 |
601 Label fakeL; // Fake label for branch instructions. | |
3853
11211f7cb5a0
7079317: Incorrect branch's destination block in PrintoOptoAssembly output
kvn
parents:
3839
diff
changeset
|
602 Label* saveL = NULL; |
11211f7cb5a0
7079317: Incorrect branch's destination block in PrintoOptoAssembly output
kvn
parents:
3839
diff
changeset
|
603 uint save_bnum = 0; |
11211f7cb5a0
7079317: Incorrect branch's destination block in PrintoOptoAssembly output
kvn
parents:
3839
diff
changeset
|
604 bool is_branch = n->is_MachBranch(); |
3839 | 605 if (is_branch) { |
606 MacroAssembler masm(&buf); | |
607 masm.bind(fakeL); | |
3853
11211f7cb5a0
7079317: Incorrect branch's destination block in PrintoOptoAssembly output
kvn
parents:
3839
diff
changeset
|
608 n->as_MachBranch()->save_label(&saveL, &save_bnum); |
11211f7cb5a0
7079317: Incorrect branch's destination block in PrintoOptoAssembly output
kvn
parents:
3839
diff
changeset
|
609 n->as_MachBranch()->label_set(&fakeL, 0); |
3839 | 610 } |
0 | 611 n->emit(buf, this->regalloc()); |
3853
11211f7cb5a0
7079317: Incorrect branch's destination block in PrintoOptoAssembly output
kvn
parents:
3839
diff
changeset
|
612 if (is_branch) // Restore label. |
11211f7cb5a0
7079317: Incorrect branch's destination block in PrintoOptoAssembly output
kvn
parents:
3839
diff
changeset
|
613 n->as_MachBranch()->label_set(saveL, save_bnum); |
2008 | 614 |
615 // End scratch_emit_size section. | |
616 set_in_scratch_emit_size(false); | |
617 | |
1748 | 618 return buf.insts_size(); |
0 | 619 } |
620 | |
621 | |
622 // ============================================================================ | |
623 //------------------------------Compile standard------------------------------- | |
624 debug_only( int Compile::_debug_idx = 100000; ) | |
625 | |
626 // Compile a method. entry_bci is -1 for normal compilations and indicates | |
627 // the continuation bci for on stack replacement. | |
628 | |
629 | |
10278 | 630 Compile::Compile( ciEnv* ci_env, C2Compiler* compiler, ciMethod* target, int osr_bci, |
631 bool subsume_loads, bool do_escape_analysis, bool eliminate_boxing ) | |
0 | 632 : Phase(Compiler), |
633 _env(ci_env), | |
634 _log(ci_env->log()), | |
635 _compile_id(ci_env->compile_id()), | |
636 _save_argument_registers(false), | |
637 _stub_name(NULL), | |
638 _stub_function(NULL), | |
639 _stub_entry_point(NULL), | |
640 _method(target), | |
641 _entry_bci(osr_bci), | |
642 _initial_gvn(NULL), | |
643 _for_igvn(NULL), | |
644 _warm_calls(NULL), | |
645 _subsume_loads(subsume_loads), | |
38
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
646 _do_escape_analysis(do_escape_analysis), |
10278 | 647 _eliminate_boxing(eliminate_boxing), |
0 | 648 _failure_reason(NULL), |
649 _code_buffer("Compile::Fill_buffer"), | |
650 _orig_pc_slot(0), | |
651 _orig_pc_slot_offset_in_bytes(0), | |
1265 | 652 _has_method_handle_invokes(false), |
2008 | 653 _mach_constant_base_node(NULL), |
0 | 654 _node_bundling_limit(0), |
655 _node_bundling_base(NULL), | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
656 _java_calls(0), |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
657 _inner_loops(0), |
2008 | 658 _scratch_const_size(-1), |
659 _in_scratch_emit_size(false), | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
660 _dead_node_list(comp_arena()), |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
661 _dead_node_count(0), |
0 | 662 #ifndef PRODUCT |
663 _trace_opto_output(TraceOptoOutput || method()->has_option("TraceOptoOutput")), | |
14438
4cdf4f71177d
8029025: PPC64 (part 203): opto: Move static _in_dump_cnt to Compile object.
goetz
parents:
14435
diff
changeset
|
664 _in_dump_cnt(0), |
0 | 665 _printer(IdealGraphPrinter::printer()), |
666 #endif | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
667 _congraph(NULL), |
20360 | 668 _comp_arena(mtCompiler), |
669 _node_arena(mtCompiler), | |
670 _old_arena(mtCompiler), | |
671 _Compile_types(mtCompiler), | |
14232 | 672 _replay_inline_data(NULL), |
7473 | 673 _late_inlines(comp_arena(), 2, 0, NULL), |
674 _string_late_inlines(comp_arena(), 2, 0, NULL), | |
10278 | 675 _boxing_late_inlines(comp_arena(), 2, 0, NULL), |
7473 | 676 _late_inlines_pos(0), |
677 _number_of_mh_late_inlines(0), | |
678 _inlining_progress(false), | |
679 _inlining_incrementally(false), | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
680 _print_inlining_list(NULL), |
12956
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12888
diff
changeset
|
681 _print_inlining_idx(0), |
20671
9e69e8d1c900
8058148: MaxNodeLimit and LiveNodeCountInliningCutoff
vlivanov
parents:
20360
diff
changeset
|
682 _interpreter_frame_size(0), |
9e69e8d1c900
8058148: MaxNodeLimit and LiveNodeCountInliningCutoff
vlivanov
parents:
20360
diff
changeset
|
683 _max_node_limit(MaxNodeLimit) { |
0 | 684 C = this; |
685 | |
686 CompileWrapper cw(this); | |
687 #ifndef PRODUCT | |
688 if (TimeCompiler2) { | |
689 tty->print(" "); | |
690 target->holder()->name()->print(); | |
691 tty->print("."); | |
692 target->print_short_name(); | |
693 tty->print(" "); | |
694 } | |
695 TraceTime t1("Total compilation time", &_t_totalCompilation, TimeCompiler, TimeCompiler2); | |
696 TraceTime t2(NULL, &_t_methodCompilation, TimeCompiler, false); | |
100
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
697 bool print_opto_assembly = PrintOptoAssembly || _method->has_option("PrintOptoAssembly"); |
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
698 if (!print_opto_assembly) { |
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
699 bool print_assembly = (PrintAssembly || _method->should_print_assembly()); |
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
700 if (print_assembly && !Disassembler::can_decode()) { |
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
701 tty->print_cr("PrintAssembly request changed to PrintOptoAssembly"); |
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
702 print_opto_assembly = true; |
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
703 } |
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
704 } |
c7c777385a15
6667042: PrintAssembly option does not work without special plugin
jrose
parents:
65
diff
changeset
|
705 set_print_assembly(print_opto_assembly); |
367
194b8e3a2fc4
6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents:
333
diff
changeset
|
706 set_parsed_irreducible_loop(false); |
14232 | 707 |
708 if (method()->has_option("ReplayInline")) { | |
709 _replay_inline_data = ciReplay::load_inline_data(method(), entry_bci(), ci_env->comp_level()); | |
710 } | |
0 | 711 #endif |
12295 | 712 set_print_inlining(PrintInlining || method()->has_option("PrintInlining") NOT_PRODUCT( || PrintOptoInlining)); |
713 set_print_intrinsics(PrintIntrinsics || method()->has_option("PrintIntrinsics")); | |
17914
3636afd5ec1a
8039298: assert(base == NULL || t_adr->isa_rawptr() || !phase->type(base)->higher_equal(TypePtr::NULL_PTR))
kvn
parents:
17895
diff
changeset
|
714 set_has_irreducible_loop(true); // conservative until build_loop_tree() reset it |
0 | 715 |
17780 | 716 if (ProfileTraps RTM_OPT_ONLY( || UseRTMLocking )) { |
0 | 717 // Make sure the method being compiled gets its own MDO, |
718 // so we can at least track the decompile_count(). | |
17780 | 719 // Need MDO to record RTM code generation state. |
2007
5ddfcf4b079e
7003554: (tiered) assert(is_null_object() || handle() != NULL) failed: cannot embed null pointer
iveresov
parents:
1972
diff
changeset
|
720 method()->ensure_method_data(); |
0 | 721 } |
722 | |
723 Init(::AliasLevel); | |
724 | |
725 | |
726 print_compile_messages(); | |
727 | |
14384 | 728 _ilt = InlineTree::build_inline_tree_root(); |
0 | 729 |
730 // Even if NO memory addresses are used, MergeMem nodes must have at least 1 slice | |
731 assert(num_alias_types() >= AliasIdxRaw, ""); | |
732 | |
733 #define MINIMUM_NODE_HASH 1023 | |
734 // Node list that Iterative GVN will start with | |
735 Unique_Node_List for_igvn(comp_arena()); | |
736 set_for_igvn(&for_igvn); | |
737 | |
738 // GVN that will be run immediately on new nodes | |
739 uint estimated_size = method()->code_size()*4+64; | |
740 estimated_size = (estimated_size < MINIMUM_NODE_HASH ? MINIMUM_NODE_HASH : estimated_size); | |
741 PhaseGVN gvn(node_arena(), estimated_size); | |
742 set_initial_gvn(&gvn); | |
743 | |
12295 | 744 if (print_inlining() || print_intrinsics()) { |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
745 _print_inlining_list = new (comp_arena())GrowableArray<PrintInliningBuffer>(comp_arena(), 1, 1, PrintInliningBuffer()); |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
746 } |
0 | 747 { // Scope for timing the parser |
748 TracePhase t3("parse", &_t_parser, true); | |
749 | |
750 // Put top into the hash table ASAP. | |
751 initial_gvn()->transform_no_reclaim(top()); | |
752 | |
753 // Set up tf(), start(), and find a CallGenerator. | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
754 CallGenerator* cg = NULL; |
0 | 755 if (is_osr_compilation()) { |
756 const TypeTuple *domain = StartOSRNode::osr_domain(); | |
757 const TypeTuple *range = TypeTuple::make_range(method()->signature()); | |
758 init_tf(TypeFunc::make(domain, range)); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
759 StartNode* s = new (this) StartOSRNode(root(), domain); |
0 | 760 initial_gvn()->set_type_bottom(s); |
761 init_start(s); | |
762 cg = CallGenerator::for_osr(method(), entry_bci()); | |
763 } else { | |
764 // Normal case. | |
765 init_tf(TypeFunc::make(method())); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
766 StartNode* s = new (this) StartNode(root(), tf()->domain()); |
0 | 767 initial_gvn()->set_type_bottom(s); |
768 init_start(s); | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
769 if (method()->intrinsic_id() == vmIntrinsics::_Reference_get && UseG1GC) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
770 // With java.lang.ref.reference.get() we must go through the |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
771 // intrinsic when G1 is enabled - even when get() is the root |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
772 // method of the compile - so that, if necessary, the value in |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
773 // the referent field of the reference object gets recorded by |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
774 // the pre-barrier code. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
775 // Specifically, if G1 is enabled, the value in the referent |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
776 // field is recorded by the G1 SATB pre barrier. This will |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
777 // result in the referent being marked live and the reference |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
778 // object removed from the list of discovered references during |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
779 // reference processing. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
780 cg = find_intrinsic(method(), false); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
781 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
782 if (cg == NULL) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
783 float past_uses = method()->interpreter_invocation_count(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
784 float expected_uses = past_uses; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
785 cg = CallGenerator::for_inline(method(), expected_uses); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
3248
diff
changeset
|
786 } |
0 | 787 } |
788 if (failing()) return; | |
789 if (cg == NULL) { | |
790 record_method_not_compilable_all_tiers("cannot parse method"); | |
791 return; | |
792 } | |
793 JVMState* jvms = build_start_state(start(), tf()); | |
20327
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
794 if ((jvms = cg->generate(jvms)) == NULL) { |
0 | 795 record_method_not_compilable("method parse failed"); |
796 return; | |
797 } | |
798 GraphKit kit(jvms); | |
799 | |
800 if (!kit.stopped()) { | |
801 // Accept return values, and transfer control we know not where. | |
802 // This is done by a special, unique ReturnNode bound to root. | |
803 return_values(kit.jvms()); | |
804 } | |
805 | |
806 if (kit.has_exceptions()) { | |
807 // Any exceptions that escape from this call must be rethrown | |
808 // to whatever caller is dynamically above us on the stack. | |
809 // This is done by a special, unique RethrowNode bound to root. | |
810 rethrow_exceptions(kit.transfer_exceptions_into_jvms()); | |
811 } | |
812 | |
7473 | 813 assert(IncrementalInline || (_late_inlines.length() == 0 && !has_mh_late_inlines()), "incremental inlining is off"); |
814 | |
815 if (_late_inlines.length() == 0 && !has_mh_late_inlines() && !failing() && has_stringbuilder()) { | |
816 inline_string_calls(true); | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
817 } |
7473 | 818 |
819 if (failing()) return; | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
820 |
10405 | 821 print_method(PHASE_BEFORE_REMOVEUSELESS, 3); |
367
194b8e3a2fc4
6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents:
333
diff
changeset
|
822 |
0 | 823 // Remove clutter produced by parsing. |
824 if (!failing()) { | |
825 ResourceMark rm; | |
826 PhaseRemoveUseless pru(initial_gvn(), &for_igvn); | |
827 } | |
828 } | |
829 | |
830 // Note: Large methods are capped off in do_one_bytecode(). | |
831 if (failing()) return; | |
832 | |
833 // After parsing, node notes are no longer automagic. | |
834 // They must be propagated by register_new_node_with_optimizer(), | |
835 // clone(), or the like. | |
836 set_default_node_notes(NULL); | |
837 | |
838 for (;;) { | |
839 int successes = Inline_Warm(); | |
840 if (failing()) return; | |
841 if (successes == 0) break; | |
842 } | |
843 | |
844 // Drain the list. | |
845 Finish_Warm(); | |
846 #ifndef PRODUCT | |
847 if (_printer) { | |
848 _printer->print_inlining(this); | |
849 } | |
850 #endif | |
851 | |
852 if (failing()) return; | |
853 NOT_PRODUCT( verify_graph_edges(); ) | |
854 | |
855 // Now optimize | |
856 Optimize(); | |
857 if (failing()) return; | |
858 NOT_PRODUCT( verify_graph_edges(); ) | |
859 | |
860 #ifndef PRODUCT | |
861 if (PrintIdeal) { | |
862 ttyLocker ttyl; // keep the following output all in one block | |
863 // This output goes directly to the tty, not the compiler log. | |
864 // To enable tools to match it up with the compilation activity, | |
865 // be sure to tag this tty output with the compile ID. | |
866 if (xtty != NULL) { | |
867 xtty->head("ideal compile_id='%d'%s", compile_id(), | |
868 is_osr_compilation() ? " compile_kind='osr'" : | |
869 ""); | |
870 } | |
871 root()->dump(9999); | |
872 if (xtty != NULL) { | |
873 xtty->tail("ideal"); | |
874 } | |
875 } | |
876 #endif | |
877 | |
13045
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
878 NOT_PRODUCT( verify_barriers(); ) |
14232 | 879 |
880 // Dump compilation data to replay it. | |
881 if (method()->has_option("DumpReplay")) { | |
882 env()->dump_replay_data(_compile_id); | |
883 } | |
884 if (method()->has_option("DumpInline") && (ilt() != NULL)) { | |
885 env()->dump_inline_data(_compile_id); | |
886 } | |
887 | |
0 | 888 // Now that we know the size of all the monitors we can add a fixed slot |
889 // for the original deopt pc. | |
890 | |
891 _orig_pc_slot = fixed_slots(); | |
892 int next_slot = _orig_pc_slot + (sizeof(address) / VMRegImpl::stack_slot_size); | |
893 set_fixed_slots(next_slot); | |
894 | |
14440
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
895 // Compute when to use implicit null checks. Used by matching trap based |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
896 // nodes and NullCheck optimization. |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
897 set_allowed_deopt_reasons(); |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
898 |
0 | 899 // Now generate code |
900 Code_Gen(); | |
901 if (failing()) return; | |
902 | |
903 // Check if we want to skip execution of all compiled code. | |
904 { | |
905 #ifndef PRODUCT | |
906 if (OptoNoExecute) { | |
907 record_method_not_compilable("+OptoNoExecute"); // Flag as failed | |
908 return; | |
909 } | |
910 TracePhase t2("install_code", &_t_registerMethod, TimeCompiler); | |
911 #endif | |
912 | |
913 if (is_osr_compilation()) { | |
914 _code_offsets.set_value(CodeOffsets::Verified_Entry, 0); | |
915 _code_offsets.set_value(CodeOffsets::OSR_Entry, _first_block_size); | |
916 } else { | |
917 _code_offsets.set_value(CodeOffsets::Verified_Entry, _first_block_size); | |
918 _code_offsets.set_value(CodeOffsets::OSR_Entry, 0); | |
919 } | |
920 | |
921 env()->register_method(_method, _entry_bci, | |
922 &_code_offsets, | |
923 _orig_pc_slot_offset_in_bytes, | |
924 code_buffer(), | |
925 frame_size_in_words(), _oop_map_set, | |
926 &_handler_table, &_inc_table, | |
927 compiler, | |
928 env()->comp_level(), | |
6792
137868b7aa6f
7196199: java/text/Bidi/Bug6665028.java failed: Bidi run count incorrect
kvn
parents:
6725
diff
changeset
|
929 has_unsafe_access(), |
17780 | 930 SharedRuntime::is_wide_vector(max_vector_size()), |
931 rtm_state() | |
0 | 932 ); |
6843 | 933 |
934 if (log() != NULL) // Print code cache state into compiler log | |
935 log()->code_cache_state(); | |
0 | 936 } |
937 } | |
938 | |
939 //------------------------------Compile---------------------------------------- | |
940 // Compile a runtime stub | |
941 Compile::Compile( ciEnv* ci_env, | |
942 TypeFunc_generator generator, | |
943 address stub_function, | |
944 const char *stub_name, | |
945 int is_fancy_jump, | |
946 bool pass_tls, | |
947 bool save_arg_registers, | |
948 bool return_pc ) | |
949 : Phase(Compiler), | |
950 _env(ci_env), | |
951 _log(ci_env->log()), | |
8730
b7c2c5b2572c
8005772: Stubs report compile id -1 in phase events
neliasso
parents:
8694
diff
changeset
|
952 _compile_id(0), |
0 | 953 _save_argument_registers(save_arg_registers), |
954 _method(NULL), | |
955 _stub_name(stub_name), | |
956 _stub_function(stub_function), | |
957 _stub_entry_point(NULL), | |
958 _entry_bci(InvocationEntryBci), | |
959 _initial_gvn(NULL), | |
960 _for_igvn(NULL), | |
961 _warm_calls(NULL), | |
962 _orig_pc_slot(0), | |
963 _orig_pc_slot_offset_in_bytes(0), | |
964 _subsume_loads(true), | |
38
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
965 _do_escape_analysis(false), |
10278 | 966 _eliminate_boxing(false), |
0 | 967 _failure_reason(NULL), |
968 _code_buffer("Compile::Fill_buffer"), | |
1265 | 969 _has_method_handle_invokes(false), |
2008 | 970 _mach_constant_base_node(NULL), |
0 | 971 _node_bundling_limit(0), |
972 _node_bundling_base(NULL), | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
973 _java_calls(0), |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
974 _inner_loops(0), |
0 | 975 #ifndef PRODUCT |
976 _trace_opto_output(TraceOptoOutput), | |
14438
4cdf4f71177d
8029025: PPC64 (part 203): opto: Move static _in_dump_cnt to Compile object.
goetz
parents:
14435
diff
changeset
|
977 _in_dump_cnt(0), |
0 | 978 _printer(NULL), |
979 #endif | |
20360 | 980 _comp_arena(mtCompiler), |
981 _node_arena(mtCompiler), | |
982 _old_arena(mtCompiler), | |
983 _Compile_types(mtCompiler), | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
984 _dead_node_list(comp_arena()), |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
985 _dead_node_count(0), |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
986 _congraph(NULL), |
14232 | 987 _replay_inline_data(NULL), |
7473 | 988 _number_of_mh_late_inlines(0), |
989 _inlining_progress(false), | |
990 _inlining_incrementally(false), | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
991 _print_inlining_list(NULL), |
12956
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12888
diff
changeset
|
992 _print_inlining_idx(0), |
17980
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
993 _allowed_reasons(0), |
20671
9e69e8d1c900
8058148: MaxNodeLimit and LiveNodeCountInliningCutoff
vlivanov
parents:
20360
diff
changeset
|
994 _interpreter_frame_size(0), |
9e69e8d1c900
8058148: MaxNodeLimit and LiveNodeCountInliningCutoff
vlivanov
parents:
20360
diff
changeset
|
995 _max_node_limit(MaxNodeLimit) { |
0 | 996 C = this; |
997 | |
998 #ifndef PRODUCT | |
999 TraceTime t1(NULL, &_t_totalCompilation, TimeCompiler, false); | |
1000 TraceTime t2(NULL, &_t_stubCompilation, TimeCompiler, false); | |
1001 set_print_assembly(PrintFrameConverterAssembly); | |
367
194b8e3a2fc4
6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents:
333
diff
changeset
|
1002 set_parsed_irreducible_loop(false); |
0 | 1003 #endif |
17914
3636afd5ec1a
8039298: assert(base == NULL || t_adr->isa_rawptr() || !phase->type(base)->higher_equal(TypePtr::NULL_PTR))
kvn
parents:
17895
diff
changeset
|
1004 set_has_irreducible_loop(false); // no loops |
3636afd5ec1a
8039298: assert(base == NULL || t_adr->isa_rawptr() || !phase->type(base)->higher_equal(TypePtr::NULL_PTR))
kvn
parents:
17895
diff
changeset
|
1005 |
0 | 1006 CompileWrapper cw(this); |
1007 Init(/*AliasLevel=*/ 0); | |
1008 init_tf((*generator)()); | |
1009 | |
1010 { | |
1011 // The following is a dummy for the sake of GraphKit::gen_stub | |
1012 Unique_Node_List for_igvn(comp_arena()); | |
1013 set_for_igvn(&for_igvn); // not used, but some GraphKit guys push on this | |
1014 PhaseGVN gvn(Thread::current()->resource_area(),255); | |
1015 set_initial_gvn(&gvn); // not significant, but GraphKit guys use it pervasively | |
1016 gvn.transform_no_reclaim(top()); | |
1017 | |
1018 GraphKit kit; | |
1019 kit.gen_stub(stub_function, stub_name, is_fancy_jump, pass_tls, return_pc); | |
1020 } | |
1021 | |
1022 NOT_PRODUCT( verify_graph_edges(); ) | |
1023 Code_Gen(); | |
1024 if (failing()) return; | |
1025 | |
1026 | |
1027 // Entry point will be accessed using compile->stub_entry_point(); | |
1028 if (code_buffer() == NULL) { | |
1029 Matcher::soft_match_failure(); | |
1030 } else { | |
1031 if (PrintAssembly && (WizardMode || Verbose)) | |
1032 tty->print_cr("### Stub::%s", stub_name); | |
1033 | |
1034 if (!failing()) { | |
1035 assert(_fixed_slots == 0, "no fixed slots used for runtime stubs"); | |
1036 | |
1037 // Make the NMethod | |
1038 // For now we mark the frame as never safe for profile stackwalking | |
1039 RuntimeStub *rs = RuntimeStub::new_runtime_stub(stub_name, | |
1040 code_buffer(), | |
1041 CodeOffsets::frame_never_safe, | |
1042 // _code_offsets.value(CodeOffsets::Frame_Complete), | |
1043 frame_size_in_words(), | |
1044 _oop_map_set, | |
1045 save_arg_registers); | |
1046 assert(rs != NULL && rs->is_runtime_stub(), "sanity check"); | |
1047 | |
1048 _stub_entry_point = rs->entry_point(); | |
1049 } | |
1050 } | |
1051 } | |
1052 | |
1053 //------------------------------Init------------------------------------------- | |
1054 // Prepare for a single compilation | |
1055 void Compile::Init(int aliaslevel) { | |
1056 _unique = 0; | |
1057 _regalloc = NULL; | |
1058 | |
1059 _tf = NULL; // filled in later | |
1060 _top = NULL; // cached later | |
1061 _matcher = NULL; // filled in later | |
1062 _cfg = NULL; // filled in later | |
1063 | |
1064 set_24_bit_selection_and_mode(Use24BitFP, false); | |
1065 | |
1066 _node_note_array = NULL; | |
1067 _default_node_notes = NULL; | |
1068 | |
1069 _immutable_memory = NULL; // filled in at first inquiry | |
1070 | |
1071 // Globally visible Nodes | |
1072 // First set TOP to NULL to give safe behavior during creation of RootNode | |
1073 set_cached_top_node(NULL); | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1074 set_root(new (this) RootNode()); |
0 | 1075 // Now that you have a Root to point to, create the real TOP |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6795
diff
changeset
|
1076 set_cached_top_node( new (this) ConNode(Type::TOP) ); |
0 | 1077 set_recent_alloc(NULL, NULL); |
1078 | |
1079 // Create Debug Information Recorder to record scopes, oopmaps, etc. | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
1080 env()->set_oop_recorder(new OopRecorder(env()->arena())); |
0 | 1081 env()->set_debug_info(new DebugInformationRecorder(env()->oop_recorder())); |
1082 env()->set_dependencies(new Dependencies(env())); | |
1083 | |
1084 _fixed_slots = 0; | |
1085 set_has_split_ifs(false); | |
1086 set_has_loops(has_method() && method()->has_loops()); // first approximation | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
1087 set_has_stringbuilder(false); |
10278 | 1088 set_has_boxed_value(false); |
0 | 1089 _trap_can_recompile = false; // no traps emitted yet |
1090 _major_progress = true; // start out assuming good things will happen | |
1091 set_has_unsafe_access(false); | |
6792
137868b7aa6f
7196199: java/text/Bidi/Bug6665028.java failed: Bidi run count incorrect
kvn
parents:
6725
diff
changeset
|
1092 set_max_vector_size(0); |
0 | 1093 Copy::zero_to_bytes(_trap_hist, sizeof(_trap_hist)); |
1094 set_decompile_count(0); | |
1095 | |
418 | 1096 set_do_freq_based_layout(BlockLayoutByFrequency || method_has_option("BlockLayoutByFrequency")); |
1783 | 1097 set_num_loop_opts(LoopOptsCount); |
1098 set_do_inlining(Inline); | |
1099 set_max_inline_size(MaxInlineSize); | |
1100 set_freq_inline_size(FreqInlineSize); | |
1101 set_do_scheduling(OptoScheduling); | |
1102 set_do_count_invocations(false); | |
1103 set_do_method_data_update(false); | |
17780 | 1104 set_rtm_state(NoRTM); // No RTM lock eliding by default |
20671
9e69e8d1c900
8058148: MaxNodeLimit and LiveNodeCountInliningCutoff
vlivanov
parents:
20360
diff
changeset
|
1105 method_has_option_value("MaxNodeLimit", _max_node_limit); |
17780 | 1106 #if INCLUDE_RTM_OPT |
1107 if (UseRTMLocking && has_method() && (method()->method_data_or_null() != NULL)) { | |
1108 int rtm_state = method()->method_data()->rtm_state(); | |
1109 if (method_has_option("NoRTMLockEliding") || ((rtm_state & NoRTM) != 0)) { | |
1110 // Don't generate RTM lock eliding code. | |
1111 set_rtm_state(NoRTM); | |
1112 } else if (method_has_option("UseRTMLockEliding") || ((rtm_state & UseRTM) != 0) || !UseRTMDeopt) { | |
1113 // Generate RTM lock eliding code without abort ratio calculation code. | |
1114 set_rtm_state(UseRTM); | |
1115 } else if (UseRTMDeopt) { | |
1116 // Generate RTM lock eliding code and include abort ratio calculation | |
1117 // code if UseRTMDeopt is on. | |
1118 set_rtm_state(ProfileRTM); | |
1119 } | |
1120 } | |
1121 #endif | |
0 | 1122 if (debug_info()->recording_non_safepoints()) { |
1123 set_node_note_array(new(comp_arena()) GrowableArray<Node_Notes*> | |
1124 (comp_arena(), 8, 0, NULL)); | |
1125 set_default_node_notes(Node_Notes::make(this)); | |
1126 } | |
1127 | |
1128 // // -- Initialize types before each compile -- | |
1129 // // Update cached type information | |
1130 // if( _method && _method->constants() ) | |
1131 // Type::update_loaded_types(_method, _method->constants()); | |
1132 | |
1133 // Init alias_type map. | |
38
b789bcaf2dd9
6667610: (Escape Analysis) retry compilation without EA if it fails
kvn
parents:
0
diff
changeset
|
1134 if (!_do_escape_analysis && aliaslevel == 3) |
0 | 1135 aliaslevel = 2; // No unique types without escape analysis |
1136 _AliasLevel = aliaslevel; | |
1137 const int grow_ats = 16; | |
1138 _max_alias_types = grow_ats; | |
1139 _alias_types = NEW_ARENA_ARRAY(comp_arena(), AliasType*, grow_ats); | |
1140 AliasType* ats = NEW_ARENA_ARRAY(comp_arena(), AliasType, grow_ats); | |
1141 Copy::zero_to_bytes(ats, sizeof(AliasType)*grow_ats); | |
1142 { | |
1143 for (int i = 0; i < grow_ats; i++) _alias_types[i] = &ats[i]; | |
1144 } | |
1145 // Initialize the first few types. | |
1146 _alias_types[AliasIdxTop]->Init(AliasIdxTop, NULL); | |
1147 _alias_types[AliasIdxBot]->Init(AliasIdxBot, TypePtr::BOTTOM); | |
1148 _alias_types[AliasIdxRaw]->Init(AliasIdxRaw, TypeRawPtr::BOTTOM); | |
1149 _num_alias_types = AliasIdxRaw+1; | |
1150 // Zero out the alias type cache. | |
1151 Copy::zero_to_bytes(_alias_cache, sizeof(_alias_cache)); | |
1152 // A NULL adr_type hits in the cache right away. Preload the right answer. | |
1153 probe_alias_cache(NULL)->_index = AliasIdxTop; | |
1154 | |
1155 _intrinsics = NULL; | |
1685 | 1156 _macro_nodes = new(comp_arena()) GrowableArray<Node*>(comp_arena(), 8, 0, NULL); |
1157 _predicate_opaqs = new(comp_arena()) GrowableArray<Node*>(comp_arena(), 8, 0, NULL); | |
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
1158 _expensive_nodes = new(comp_arena()) GrowableArray<Node*>(comp_arena(), 8, 0, NULL); |
0 | 1159 register_library_intrinsics(); |
1160 } | |
1161 | |
1162 //---------------------------init_start---------------------------------------- | |
1163 // Install the StartNode on this compile object. | |
1164 void Compile::init_start(StartNode* s) { | |
1165 if (failing()) | |
1166 return; // already failing | |
1167 assert(s == start(), ""); | |
1168 } | |
1169 | |
1170 StartNode* Compile::start() const { | |
1171 assert(!failing(), ""); | |
1172 for (DUIterator_Fast imax, i = root()->fast_outs(imax); i < imax; i++) { | |
1173 Node* start = root()->fast_out(i); | |
1174 if( start->is_Start() ) | |
1175 return start->as_Start(); | |
1176 } | |
17914
3636afd5ec1a
8039298: assert(base == NULL || t_adr->isa_rawptr() || !phase->type(base)->higher_equal(TypePtr::NULL_PTR))
kvn
parents:
17895
diff
changeset
|
1177 fatal("Did not find Start node!"); |
0 | 1178 return NULL; |
1179 } | |
1180 | |
1181 //-------------------------------immutable_memory------------------------------------- | |
1182 // Access immutable memory | |
1183 Node* Compile::immutable_memory() { | |
1184 if (_immutable_memory != NULL) { | |
1185 return _immutable_memory; | |
1186 } | |
1187 StartNode* s = start(); | |
1188 for (DUIterator_Fast imax, i = s->fast_outs(imax); true; i++) { | |
1189 Node *p = s->fast_out(i); | |
1190 if (p != s && p->as_Proj()->_con == TypeFunc::Memory) { | |
1191 _immutable_memory = p; | |
1192 return _immutable_memory; | |
1193 } | |
1194 } | |
1195 ShouldNotReachHere(); | |
1196 return NULL; | |
1197 } | |
1198 | |
1199 //----------------------set_cached_top_node------------------------------------ | |
1200 // Install the cached top node, and make sure Node::is_top works correctly. | |
1201 void Compile::set_cached_top_node(Node* tn) { | |
1202 if (tn != NULL) verify_top(tn); | |
1203 Node* old_top = _top; | |
1204 _top = tn; | |
1205 // Calling Node::setup_is_top allows the nodes the chance to adjust | |
1206 // their _out arrays. | |
1207 if (_top != NULL) _top->setup_is_top(); | |
1208 if (old_top != NULL) old_top->setup_is_top(); | |
1209 assert(_top == NULL || top()->is_top(), ""); | |
1210 } | |
1211 | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1212 #ifdef ASSERT |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1213 uint Compile::count_live_nodes_by_graph_walk() { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1214 Unique_Node_List useful(comp_arena()); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1215 // Get useful node list by walking the graph. |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1216 identify_useful_nodes(useful); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1217 return useful.size(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1218 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1219 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1220 void Compile::print_missing_nodes() { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1221 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1222 // Return if CompileLog is NULL and PrintIdealNodeCount is false. |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1223 if ((_log == NULL) && (! PrintIdealNodeCount)) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1224 return; |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1225 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1226 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1227 // This is an expensive function. It is executed only when the user |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1228 // specifies VerifyIdealNodeCount option or otherwise knows the |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1229 // additional work that needs to be done to identify reachable nodes |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1230 // by walking the flow graph and find the missing ones using |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1231 // _dead_node_list. |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1232 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1233 Unique_Node_List useful(comp_arena()); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1234 // Get useful node list by walking the graph. |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1235 identify_useful_nodes(useful); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1236 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1237 uint l_nodes = C->live_nodes(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1238 uint l_nodes_by_walk = useful.size(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1239 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1240 if (l_nodes != l_nodes_by_walk) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1241 if (_log != NULL) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1242 _log->begin_head("mismatched_nodes count='%d'", abs((int) (l_nodes - l_nodes_by_walk))); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1243 _log->stamp(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1244 _log->end_head(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1245 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1246 VectorSet& useful_member_set = useful.member_set(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1247 int last_idx = l_nodes_by_walk; |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1248 for (int i = 0; i < last_idx; i++) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1249 if (useful_member_set.test(i)) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1250 if (_dead_node_list.test(i)) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1251 if (_log != NULL) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1252 _log->elem("mismatched_node_info node_idx='%d' type='both live and dead'", i); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1253 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1254 if (PrintIdealNodeCount) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1255 // Print the log message to tty |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1256 tty->print_cr("mismatched_node idx='%d' both live and dead'", i); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1257 useful.at(i)->dump(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1258 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1259 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1260 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1261 else if (! _dead_node_list.test(i)) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1262 if (_log != NULL) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1263 _log->elem("mismatched_node_info node_idx='%d' type='neither live nor dead'", i); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1264 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1265 if (PrintIdealNodeCount) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1266 // Print the log message to tty |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1267 tty->print_cr("mismatched_node idx='%d' type='neither live nor dead'", i); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1268 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1269 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1270 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1271 if (_log != NULL) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1272 _log->tail("mismatched_nodes"); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1273 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1274 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1275 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1276 #endif |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
1277 |
0 | 1278 #ifndef PRODUCT |
1279 void Compile::verify_top(Node* tn) const { | |
1280 if (tn != NULL) { | |
1281 assert(tn->is_Con(), "top node must be a constant"); | |
1282 assert(((ConNode*)tn)->type() == Type::TOP, "top node must have correct type"); | |
1283 assert(tn->in(0) != NULL, "must have live top node"); | |
1284 } | |
1285 } | |
1286 #endif | |
1287 | |
1288 | |
1289 ///-------------------Managing Per-Node Debug & Profile Info------------------- | |
1290 | |
1291 void Compile::grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by) { | |
1292 guarantee(arr != NULL, ""); | |
1293 int num_blocks = arr->length(); | |
1294 if (grow_by < num_blocks) grow_by = num_blocks; | |
1295 int num_notes = grow_by * _node_notes_block_size; | |
1296 Node_Notes* notes = NEW_ARENA_ARRAY(node_arena(), Node_Notes, num_notes); | |
1297 Copy::zero_to_bytes(notes, num_notes * sizeof(Node_Notes)); | |
1298 while (num_notes > 0) { | |
1299 arr->append(notes); | |
1300 notes += _node_notes_block_size; | |
1301 num_notes -= _node_notes_block_size; | |
1302 } | |
1303 assert(num_notes == 0, "exact multiple, please"); | |
1304 } | |
1305 | |
1306 bool Compile::copy_node_notes_to(Node* dest, Node* source) { | |
1307 if (source == NULL || dest == NULL) return false; | |
1308 | |
1309 if (dest->is_Con()) | |
1310 return false; // Do not push debug info onto constants. | |
1311 | |
1312 #ifdef ASSERT | |
1313 // Leave a bread crumb trail pointing to the original node: | |
1314 if (dest != NULL && dest != source && dest->debug_orig() == NULL) { | |
1315 dest->set_debug_orig(source); | |
1316 } | |
1317 #endif | |
1318 | |
1319 if (node_note_array() == NULL) | |
1320 return false; // Not collecting any notes now. | |
1321 | |
1322 // This is a copy onto a pre-existing node, which may already have notes. | |
1323 // If both nodes have notes, do not overwrite any pre-existing notes. | |
1324 Node_Notes* source_notes = node_notes_at(source->_idx); | |
1325 if (source_notes == NULL || source_notes->is_clear()) return false; | |
1326 Node_Notes* dest_notes = node_notes_at(dest->_idx); | |
1327 if (dest_notes == NULL || dest_notes->is_clear()) { | |
1328 return set_node_notes_at(dest->_idx, source_notes); | |
1329 } | |
1330 | |
1331 Node_Notes merged_notes = (*source_notes); | |
1332 // The order of operations here ensures that dest notes will win... | |
1333 merged_notes.update_from(dest_notes); | |
1334 return set_node_notes_at(dest->_idx, &merged_notes); | |
1335 } | |
1336 | |
1337 | |
1338 //--------------------------allow_range_check_smearing------------------------- | |
1339 // Gating condition for coalescing similar range checks. | |
1340 // Sometimes we try 'speculatively' replacing a series of a range checks by a | |
1341 // single covering check that is at least as strong as any of them. | |
1342 // If the optimization succeeds, the simplified (strengthened) range check | |
1343 // will always succeed. If it fails, we will deopt, and then give up | |
1344 // on the optimization. | |
1345 bool Compile::allow_range_check_smearing() const { | |
1346 // If this method has already thrown a range-check, | |
1347 // assume it was because we already tried range smearing | |
1348 // and it failed. | |
1349 uint already_trapped = trap_count(Deoptimization::Reason_range_check); | |
1350 return !already_trapped; | |
1351 } | |
1352 | |
1353 | |
1354 //------------------------------flatten_alias_type----------------------------- | |
1355 const TypePtr *Compile::flatten_alias_type( const TypePtr *tj ) const { | |
1356 int offset = tj->offset(); | |
1357 TypePtr::PTR ptr = tj->ptr(); | |
1358 | |
247 | 1359 // Known instance (scalarizable allocation) alias only with itself. |
1360 bool is_known_inst = tj->isa_oopptr() != NULL && | |
1361 tj->is_oopptr()->is_known_instance(); | |
1362 | |
0 | 1363 // Process weird unsafe references. |
1364 if (offset == Type::OffsetBot && (tj->isa_instptr() /*|| tj->isa_klassptr()*/)) { | |
1365 assert(InlineUnsafeOps, "indeterminate pointers come only from unsafe ops"); | |
247 | 1366 assert(!is_known_inst, "scalarizable allocation should not have unsafe references"); |
0 | 1367 tj = TypeOopPtr::BOTTOM; |
1368 ptr = tj->ptr(); | |
1369 offset = tj->offset(); | |
1370 } | |
1371 | |
1372 // Array pointers need some flattening | |
1373 const TypeAryPtr *ta = tj->isa_aryptr(); | |
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1374 if (ta && ta->is_stable()) { |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1375 // Erase stability property for alias analysis. |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1376 tj = ta = ta->cast_to_stable(false); |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1377 } |
247 | 1378 if( ta && is_known_inst ) { |
1379 if ( offset != Type::OffsetBot && | |
1380 offset > arrayOopDesc::length_offset_in_bytes() ) { | |
1381 offset = Type::OffsetBot; // Flatten constant access into array body only | |
1382 tj = ta = TypeAryPtr::make(ptr, ta->ary(), ta->klass(), true, offset, ta->instance_id()); | |
1383 } | |
1384 } else if( ta && _AliasLevel >= 2 ) { | |
0 | 1385 // For arrays indexed by constant indices, we flatten the alias |
1386 // space to include all of the array body. Only the header, klass | |
1387 // and array length can be accessed un-aliased. | |
1388 if( offset != Type::OffsetBot ) { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
1389 if( ta->const_oop() ) { // MethodData* or Method* |
0 | 1390 offset = Type::OffsetBot; // Flatten constant access into array body |
247 | 1391 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),ta->ary(),ta->klass(),false,offset); |
0 | 1392 } else if( offset == arrayOopDesc::length_offset_in_bytes() ) { |
1393 // range is OK as-is. | |
1394 tj = ta = TypeAryPtr::RANGE; | |
1395 } else if( offset == oopDesc::klass_offset_in_bytes() ) { | |
1396 tj = TypeInstPtr::KLASS; // all klass loads look alike | |
1397 ta = TypeAryPtr::RANGE; // generic ignored junk | |
1398 ptr = TypePtr::BotPTR; | |
1399 } else if( offset == oopDesc::mark_offset_in_bytes() ) { | |
1400 tj = TypeInstPtr::MARK; | |
1401 ta = TypeAryPtr::RANGE; // generic ignored junk | |
1402 ptr = TypePtr::BotPTR; | |
1403 } else { // Random constant offset into array body | |
1404 offset = Type::OffsetBot; // Flatten constant access into array body | |
247 | 1405 tj = ta = TypeAryPtr::make(ptr,ta->ary(),ta->klass(),false,offset); |
0 | 1406 } |
1407 } | |
1408 // Arrays of fixed size alias with arrays of unknown size. | |
1409 if (ta->size() != TypeInt::POS) { | |
1410 const TypeAry *tary = TypeAry::make(ta->elem(), TypeInt::POS); | |
247 | 1411 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,ta->klass(),false,offset); |
0 | 1412 } |
1413 // Arrays of known objects become arrays of unknown objects. | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
1414 if (ta->elem()->isa_narrowoop() && ta->elem() != TypeNarrowOop::BOTTOM) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
1415 const TypeAry *tary = TypeAry::make(TypeNarrowOop::BOTTOM, ta->size()); |
247 | 1416 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,NULL,false,offset); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
1417 } |
0 | 1418 if (ta->elem()->isa_oopptr() && ta->elem() != TypeInstPtr::BOTTOM) { |
1419 const TypeAry *tary = TypeAry::make(TypeInstPtr::BOTTOM, ta->size()); | |
247 | 1420 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,NULL,false,offset); |
0 | 1421 } |
1422 // Arrays of bytes and of booleans both use 'bastore' and 'baload' so | |
1423 // cannot be distinguished by bytecode alone. | |
1424 if (ta->elem() == TypeInt::BOOL) { | |
1425 const TypeAry *tary = TypeAry::make(TypeInt::BYTE, ta->size()); | |
1426 ciKlass* aklass = ciTypeArrayKlass::make(T_BYTE); | |
247 | 1427 tj = ta = TypeAryPtr::make(ptr,ta->const_oop(),tary,aklass,false,offset); |
0 | 1428 } |
1429 // During the 2nd round of IterGVN, NotNull castings are removed. | |
1430 // Make sure the Bottom and NotNull variants alias the same. | |
1431 // Also, make sure exact and non-exact variants alias the same. | |
12966 | 1432 if (ptr == TypePtr::NotNull || ta->klass_is_exact() || ta->speculative() != NULL) { |
3789 | 1433 tj = ta = TypeAryPtr::make(TypePtr::BotPTR,ta->ary(),ta->klass(),false,offset); |
0 | 1434 } |
1435 } | |
1436 | |
1437 // Oop pointers need some flattening | |
1438 const TypeInstPtr *to = tj->isa_instptr(); | |
1439 if( to && _AliasLevel >= 2 && to != TypeOopPtr::BOTTOM ) { | |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1440 ciInstanceKlass *k = to->klass()->as_instance_klass(); |
0 | 1441 if( ptr == TypePtr::Constant ) { |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1442 if (to->klass() != ciEnv::current()->Class_klass() || |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1443 offset < k->size_helper() * wordSize) { |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1444 // No constant oop pointers (such as Strings); they alias with |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1445 // unknown strings. |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1446 assert(!is_known_inst, "not scalarizable allocation"); |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1447 tj = to = TypeInstPtr::make(TypePtr::BotPTR,to->klass(),false,0,offset); |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1448 } |
247 | 1449 } else if( is_known_inst ) { |
163 | 1450 tj = to; // Keep NotNull and klass_is_exact for instance type |
0 | 1451 } else if( ptr == TypePtr::NotNull || to->klass_is_exact() ) { |
1452 // During the 2nd round of IterGVN, NotNull castings are removed. | |
1453 // Make sure the Bottom and NotNull variants alias the same. | |
1454 // Also, make sure exact and non-exact variants alias the same. | |
247 | 1455 tj = to = TypeInstPtr::make(TypePtr::BotPTR,to->klass(),false,0,offset); |
0 | 1456 } |
12966 | 1457 if (to->speculative() != NULL) { |
1458 tj = to = TypeInstPtr::make(to->ptr(),to->klass(),to->klass_is_exact(),to->const_oop(),to->offset(), to->instance_id()); | |
1459 } | |
0 | 1460 // Canonicalize the holder of this field |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
1461 if (offset >= 0 && offset < instanceOopDesc::base_offset_in_bytes()) { |
0 | 1462 // First handle header references such as a LoadKlassNode, even if the |
1463 // object's klass is unloaded at compile time (4965979). | |
247 | 1464 if (!is_known_inst) { // Do it only for non-instance types |
1465 tj = to = TypeInstPtr::make(TypePtr::BotPTR, env()->Object_klass(), false, NULL, offset); | |
1466 } | |
0 | 1467 } else if (offset < 0 || offset >= k->size_helper() * wordSize) { |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1468 // Static fields are in the space above the normal instance |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1469 // fields in the java.lang.Class instance. |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1470 if (to->klass() != ciEnv::current()->Class_klass()) { |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1471 to = NULL; |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1472 tj = TypeOopPtr::BOTTOM; |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1473 offset = tj->offset(); |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1474 } |
0 | 1475 } else { |
1476 ciInstanceKlass *canonical_holder = k->get_canonical_holder(offset); | |
1477 if (!k->equals(canonical_holder) || tj->offset() != offset) { | |
247 | 1478 if( is_known_inst ) { |
1479 tj = to = TypeInstPtr::make(to->ptr(), canonical_holder, true, NULL, offset, to->instance_id()); | |
1480 } else { | |
1481 tj = to = TypeInstPtr::make(to->ptr(), canonical_holder, false, NULL, offset); | |
1482 } | |
0 | 1483 } |
1484 } | |
1485 } | |
1486 | |
1487 // Klass pointers to object array klasses need some flattening | |
1488 const TypeKlassPtr *tk = tj->isa_klassptr(); | |
1489 if( tk ) { | |
1490 // If we are referencing a field within a Klass, we need | |
1491 // to assume the worst case of an Object. Both exact and | |
4760
669f6a7d5b70
7121073: secondary_super_cache memory slice has incorrect bounds in flatten_alias_type
never
parents:
4115
diff
changeset
|
1492 // inexact types must flatten to the same alias class so |
669f6a7d5b70
7121073: secondary_super_cache memory slice has incorrect bounds in flatten_alias_type
never
parents:
4115
diff
changeset
|
1493 // use NotNull as the PTR. |
0 | 1494 if ( offset == Type::OffsetBot || (offset >= 0 && (size_t)offset < sizeof(Klass)) ) { |
1495 | |
4760
669f6a7d5b70
7121073: secondary_super_cache memory slice has incorrect bounds in flatten_alias_type
never
parents:
4115
diff
changeset
|
1496 tj = tk = TypeKlassPtr::make(TypePtr::NotNull, |
0 | 1497 TypeKlassPtr::OBJECT->klass(), |
1498 offset); | |
1499 } | |
1500 | |
1501 ciKlass* klass = tk->klass(); | |
1502 if( klass->is_obj_array_klass() ) { | |
1503 ciKlass* k = TypeAryPtr::OOPS->klass(); | |
1504 if( !k || !k->is_loaded() ) // Only fails for some -Xcomp runs | |
1505 k = TypeInstPtr::BOTTOM->klass(); | |
1506 tj = tk = TypeKlassPtr::make( TypePtr::NotNull, k, offset ); | |
1507 } | |
1508 | |
1509 // Check for precise loads from the primary supertype array and force them | |
1510 // to the supertype cache alias index. Check for generic array loads from | |
1511 // the primary supertype array and also force them to the supertype cache | |
1512 // alias index. Since the same load can reach both, we need to merge | |
1513 // these 2 disparate memories into the same alias class. Since the | |
1514 // primary supertype array is read-only, there's no chance of confusion | |
1515 // where we bypass an array load and an array store. | |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
4760
diff
changeset
|
1516 int primary_supers_offset = in_bytes(Klass::primary_supers_offset()); |
4760
669f6a7d5b70
7121073: secondary_super_cache memory slice has incorrect bounds in flatten_alias_type
never
parents:
4115
diff
changeset
|
1517 if (offset == Type::OffsetBot || |
669f6a7d5b70
7121073: secondary_super_cache memory slice has incorrect bounds in flatten_alias_type
never
parents:
4115
diff
changeset
|
1518 (offset >= primary_supers_offset && |
669f6a7d5b70
7121073: secondary_super_cache memory slice has incorrect bounds in flatten_alias_type
never
parents:
4115
diff
changeset
|
1519 offset < (int)(primary_supers_offset + Klass::primary_super_limit() * wordSize)) || |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
4760
diff
changeset
|
1520 offset == (int)in_bytes(Klass::secondary_super_cache_offset())) { |
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
4760
diff
changeset
|
1521 offset = in_bytes(Klass::secondary_super_cache_offset()); |
0 | 1522 tj = tk = TypeKlassPtr::make( TypePtr::NotNull, tk->klass(), offset ); |
1523 } | |
1524 } | |
1525 | |
1526 // Flatten all Raw pointers together. | |
1527 if (tj->base() == Type::RawPtr) | |
1528 tj = TypeRawPtr::BOTTOM; | |
1529 | |
1530 if (tj->base() == Type::AnyPtr) | |
1531 tj = TypePtr::BOTTOM; // An error, which the caller must check for. | |
1532 | |
1533 // Flatten all to bottom for now | |
1534 switch( _AliasLevel ) { | |
1535 case 0: | |
1536 tj = TypePtr::BOTTOM; | |
1537 break; | |
1538 case 1: // Flatten to: oop, static, field or array | |
1539 switch (tj->base()) { | |
1540 //case Type::AryPtr: tj = TypeAryPtr::RANGE; break; | |
1541 case Type::RawPtr: tj = TypeRawPtr::BOTTOM; break; | |
1542 case Type::AryPtr: // do not distinguish arrays at all | |
1543 case Type::InstPtr: tj = TypeInstPtr::BOTTOM; break; | |
1544 case Type::KlassPtr: tj = TypeKlassPtr::OBJECT; break; | |
1545 case Type::AnyPtr: tj = TypePtr::BOTTOM; break; // caller checks it | |
1546 default: ShouldNotReachHere(); | |
1547 } | |
1548 break; | |
605 | 1549 case 2: // No collapsing at level 2; keep all splits |
1550 case 3: // No collapsing at level 3; keep all splits | |
0 | 1551 break; |
1552 default: | |
1553 Unimplemented(); | |
1554 } | |
1555 | |
1556 offset = tj->offset(); | |
1557 assert( offset != Type::OffsetTop, "Offset has fallen from constant" ); | |
1558 | |
1559 assert( (offset != Type::OffsetBot && tj->base() != Type::AryPtr) || | |
1560 (offset == Type::OffsetBot && tj->base() == Type::AryPtr) || | |
1561 (offset == Type::OffsetBot && tj == TypeOopPtr::BOTTOM) || | |
1562 (offset == Type::OffsetBot && tj == TypePtr::BOTTOM) || | |
1563 (offset == oopDesc::mark_offset_in_bytes() && tj->base() == Type::AryPtr) || | |
1564 (offset == oopDesc::klass_offset_in_bytes() && tj->base() == Type::AryPtr) || | |
1565 (offset == arrayOopDesc::length_offset_in_bytes() && tj->base() == Type::AryPtr) , | |
1566 "For oops, klasses, raw offset must be constant; for arrays the offset is never known" ); | |
1567 assert( tj->ptr() != TypePtr::TopPTR && | |
1568 tj->ptr() != TypePtr::AnyNull && | |
1569 tj->ptr() != TypePtr::Null, "No imprecise addresses" ); | |
1570 // assert( tj->ptr() != TypePtr::Constant || | |
1571 // tj->base() == Type::RawPtr || | |
1572 // tj->base() == Type::KlassPtr, "No constant oop addresses" ); | |
1573 | |
1574 return tj; | |
1575 } | |
1576 | |
1577 void Compile::AliasType::Init(int i, const TypePtr* at) { | |
1578 _index = i; | |
1579 _adr_type = at; | |
1580 _field = NULL; | |
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1581 _element = NULL; |
0 | 1582 _is_rewritable = true; // default |
1583 const TypeOopPtr *atoop = (at != NULL) ? at->isa_oopptr() : NULL; | |
223 | 1584 if (atoop != NULL && atoop->is_known_instance()) { |
1585 const TypeOopPtr *gt = atoop->cast_to_instance_id(TypeOopPtr::InstanceBot); | |
0 | 1586 _general_index = Compile::current()->get_alias_index(gt); |
1587 } else { | |
1588 _general_index = 0; | |
1589 } | |
1590 } | |
1591 | |
1592 //---------------------------------print_on------------------------------------ | |
1593 #ifndef PRODUCT | |
1594 void Compile::AliasType::print_on(outputStream* st) { | |
1595 if (index() < 10) | |
1596 st->print("@ <%d> ", index()); | |
1597 else st->print("@ <%d>", index()); | |
1598 st->print(is_rewritable() ? " " : " RO"); | |
1599 int offset = adr_type()->offset(); | |
1600 if (offset == Type::OffsetBot) | |
1601 st->print(" +any"); | |
1602 else st->print(" +%-3d", offset); | |
1603 st->print(" in "); | |
1604 adr_type()->dump_on(st); | |
1605 const TypeOopPtr* tjp = adr_type()->isa_oopptr(); | |
1606 if (field() != NULL && tjp) { | |
1607 if (tjp->klass() != field()->holder() || | |
1608 tjp->offset() != field()->offset_in_bytes()) { | |
1609 st->print(" != "); | |
1610 field()->print(); | |
1611 st->print(" ***"); | |
1612 } | |
1613 } | |
1614 } | |
1615 | |
1616 void print_alias_types() { | |
1617 Compile* C = Compile::current(); | |
1618 tty->print_cr("--- Alias types, AliasIdxBot .. %d", C->num_alias_types()-1); | |
1619 for (int idx = Compile::AliasIdxBot; idx < C->num_alias_types(); idx++) { | |
1620 C->alias_type(idx)->print_on(tty); | |
1621 tty->cr(); | |
1622 } | |
1623 } | |
1624 #endif | |
1625 | |
1626 | |
1627 //----------------------------probe_alias_cache-------------------------------- | |
1628 Compile::AliasCacheEntry* Compile::probe_alias_cache(const TypePtr* adr_type) { | |
1629 intptr_t key = (intptr_t) adr_type; | |
1630 key ^= key >> logAliasCacheSize; | |
1631 return &_alias_cache[key & right_n_bits(logAliasCacheSize)]; | |
1632 } | |
1633 | |
1634 | |
1635 //-----------------------------grow_alias_types-------------------------------- | |
1636 void Compile::grow_alias_types() { | |
1637 const int old_ats = _max_alias_types; // how many before? | |
1638 const int new_ats = old_ats; // how many more? | |
1639 const int grow_ats = old_ats+new_ats; // how many now? | |
1640 _max_alias_types = grow_ats; | |
1641 _alias_types = REALLOC_ARENA_ARRAY(comp_arena(), AliasType*, _alias_types, old_ats, grow_ats); | |
1642 AliasType* ats = NEW_ARENA_ARRAY(comp_arena(), AliasType, new_ats); | |
1643 Copy::zero_to_bytes(ats, sizeof(AliasType)*new_ats); | |
1644 for (int i = 0; i < new_ats; i++) _alias_types[old_ats+i] = &ats[i]; | |
1645 } | |
1646 | |
1647 | |
1648 //--------------------------------find_alias_type------------------------------ | |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1649 Compile::AliasType* Compile::find_alias_type(const TypePtr* adr_type, bool no_create, ciField* original_field) { |
0 | 1650 if (_AliasLevel == 0) |
1651 return alias_type(AliasIdxBot); | |
1652 | |
1653 AliasCacheEntry* ace = probe_alias_cache(adr_type); | |
1654 if (ace->_adr_type == adr_type) { | |
1655 return alias_type(ace->_index); | |
1656 } | |
1657 | |
1658 // Handle special cases. | |
1659 if (adr_type == NULL) return alias_type(AliasIdxTop); | |
1660 if (adr_type == TypePtr::BOTTOM) return alias_type(AliasIdxBot); | |
1661 | |
1662 // Do it the slow way. | |
1663 const TypePtr* flat = flatten_alias_type(adr_type); | |
1664 | |
1665 #ifdef ASSERT | |
1666 assert(flat == flatten_alias_type(flat), "idempotent"); | |
1667 assert(flat != TypePtr::BOTTOM, "cannot alias-analyze an untyped ptr"); | |
1668 if (flat->isa_oopptr() && !flat->isa_klassptr()) { | |
1669 const TypeOopPtr* foop = flat->is_oopptr(); | |
247 | 1670 // Scalarizable allocations have exact klass always. |
1671 bool exact = !foop->klass_is_exact() || foop->is_known_instance(); | |
1672 const TypePtr* xoop = foop->cast_to_exactness(exact)->is_ptr(); | |
0 | 1673 assert(foop == flatten_alias_type(xoop), "exactness must not affect alias type"); |
1674 } | |
1675 assert(flat == flatten_alias_type(flat), "exact bit doesn't matter"); | |
1676 #endif | |
1677 | |
1678 int idx = AliasIdxTop; | |
1679 for (int i = 0; i < num_alias_types(); i++) { | |
1680 if (alias_type(i)->adr_type() == flat) { | |
1681 idx = i; | |
1682 break; | |
1683 } | |
1684 } | |
1685 | |
1686 if (idx == AliasIdxTop) { | |
1687 if (no_create) return NULL; | |
1688 // Grow the array if necessary. | |
1689 if (_num_alias_types == _max_alias_types) grow_alias_types(); | |
1690 // Add a new alias type. | |
1691 idx = _num_alias_types++; | |
1692 _alias_types[idx]->Init(idx, flat); | |
1693 if (flat == TypeInstPtr::KLASS) alias_type(idx)->set_rewritable(false); | |
1694 if (flat == TypeAryPtr::RANGE) alias_type(idx)->set_rewritable(false); | |
1695 if (flat->isa_instptr()) { | |
1696 if (flat->offset() == java_lang_Class::klass_offset_in_bytes() | |
1697 && flat->is_instptr()->klass() == env()->Class_klass()) | |
1698 alias_type(idx)->set_rewritable(false); | |
1699 } | |
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1700 if (flat->isa_aryptr()) { |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1701 #ifdef ASSERT |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1702 const int header_size_min = arrayOopDesc::base_offset_in_bytes(T_BYTE); |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1703 // (T_BYTE has the weakest alignment and size restrictions...) |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1704 assert(flat->offset() < header_size_min, "array body reference must be OffsetBot"); |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1705 #endif |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1706 if (flat->offset() == TypePtr::OffsetBot) { |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1707 alias_type(idx)->set_element(flat->is_aryptr()->elem()); |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1708 } |
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1709 } |
0 | 1710 if (flat->isa_klassptr()) { |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
4760
diff
changeset
|
1711 if (flat->offset() == in_bytes(Klass::super_check_offset_offset())) |
0 | 1712 alias_type(idx)->set_rewritable(false); |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
4760
diff
changeset
|
1713 if (flat->offset() == in_bytes(Klass::modifier_flags_offset())) |
0 | 1714 alias_type(idx)->set_rewritable(false); |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
4760
diff
changeset
|
1715 if (flat->offset() == in_bytes(Klass::access_flags_offset())) |
0 | 1716 alias_type(idx)->set_rewritable(false); |
4762
069ab3f976d3
7118863: Move sizeof(klassOopDesc) into the *Klass::*_offset_in_bytes() functions
stefank
parents:
4760
diff
changeset
|
1717 if (flat->offset() == in_bytes(Klass::java_mirror_offset())) |
0 | 1718 alias_type(idx)->set_rewritable(false); |
1719 } | |
1720 // %%% (We would like to finalize JavaThread::threadObj_offset(), | |
1721 // but the base pointer type is not distinctive enough to identify | |
1722 // references into JavaThread.) | |
1723 | |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1724 // Check for final fields. |
0 | 1725 const TypeInstPtr* tinst = flat->isa_instptr(); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
1726 if (tinst && tinst->offset() >= instanceOopDesc::base_offset_in_bytes()) { |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1727 ciField* field; |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1728 if (tinst->const_oop() != NULL && |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1729 tinst->klass() == ciEnv::current()->Class_klass() && |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1730 tinst->offset() >= (tinst->klass()->as_instance_klass()->size_helper() * wordSize)) { |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1731 // static field |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1732 ciInstanceKlass* k = tinst->const_oop()->as_instance()->java_lang_Class_klass()->as_instance_klass(); |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1733 field = k->get_field_by_offset(tinst->offset(), true); |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1734 } else { |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1735 ciInstanceKlass *k = tinst->klass()->as_instance_klass(); |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1736 field = k->get_field_by_offset(tinst->offset(), false); |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1737 } |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1738 assert(field == NULL || |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1739 original_field == NULL || |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1740 (field->holder() == original_field->holder() && |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1741 field->offset() == original_field->offset() && |
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1742 field->is_static() == original_field->is_static()), "wrong field?"); |
0 | 1743 // Set field() and is_rewritable() attributes. |
1744 if (field != NULL) alias_type(idx)->set_field(field); | |
1745 } | |
1746 } | |
1747 | |
1748 // Fill the cache for next time. | |
1749 ace->_adr_type = adr_type; | |
1750 ace->_index = idx; | |
1751 assert(alias_type(adr_type) == alias_type(idx), "type must be installed"); | |
1752 | |
1753 // Might as well try to fill the cache for the flattened version, too. | |
1754 AliasCacheEntry* face = probe_alias_cache(flat); | |
1755 if (face->_adr_type == NULL) { | |
1756 face->_adr_type = flat; | |
1757 face->_index = idx; | |
1758 assert(alias_type(flat) == alias_type(idx), "flat type must work too"); | |
1759 } | |
1760 | |
1761 return alias_type(idx); | |
1762 } | |
1763 | |
1764 | |
1765 Compile::AliasType* Compile::alias_type(ciField* field) { | |
1766 const TypeOopPtr* t; | |
1767 if (field->is_static()) | |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1768 t = TypeInstPtr::make(field->holder()->java_mirror()); |
0 | 1769 else |
1770 t = TypeOopPtr::make_from_klass_raw(field->holder()); | |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1771 AliasType* atp = alias_type(t->add_offset(field->offset_in_bytes()), field); |
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
12167
diff
changeset
|
1772 assert((field->is_final() || field->is_stable()) == !atp->is_rewritable(), "must get the rewritable bits correct"); |
0 | 1773 return atp; |
1774 } | |
1775 | |
1776 | |
1777 //------------------------------have_alias_type-------------------------------- | |
1778 bool Compile::have_alias_type(const TypePtr* adr_type) { | |
1779 AliasCacheEntry* ace = probe_alias_cache(adr_type); | |
1780 if (ace->_adr_type == adr_type) { | |
1781 return true; | |
1782 } | |
1783 | |
1784 // Handle special cases. | |
1785 if (adr_type == NULL) return true; | |
1786 if (adr_type == TypePtr::BOTTOM) return true; | |
1787 | |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2192
diff
changeset
|
1788 return find_alias_type(adr_type, true, NULL) != NULL; |
0 | 1789 } |
1790 | |
1791 //-----------------------------must_alias-------------------------------------- | |
1792 // True if all values of the given address type are in the given alias category. | |
1793 bool Compile::must_alias(const TypePtr* adr_type, int alias_idx) { | |
1794 if (alias_idx == AliasIdxBot) return true; // the universal category | |
1795 if (adr_type == NULL) return true; // NULL serves as TypePtr::TOP | |
1796 if (alias_idx == AliasIdxTop) return false; // the empty category | |
1797 if (adr_type->base() == Type::AnyPtr) return false; // TypePtr::BOTTOM or its twins | |
1798 | |
1799 // the only remaining possible overlap is identity | |
1800 int adr_idx = get_alias_index(adr_type); | |
1801 assert(adr_idx != AliasIdxBot && adr_idx != AliasIdxTop, ""); | |
1802 assert(adr_idx == alias_idx || | |
1803 (alias_type(alias_idx)->adr_type() != TypeOopPtr::BOTTOM | |
1804 && adr_type != TypeOopPtr::BOTTOM), | |
1805 "should not be testing for overlap with an unsafe pointer"); | |
1806 return adr_idx == alias_idx; | |
1807 } | |
1808 | |
1809 //------------------------------can_alias-------------------------------------- | |
1810 // True if any values of the given address type are in the given alias category. | |
1811 bool Compile::can_alias(const TypePtr* adr_type, int alias_idx) { | |
1812 if (alias_idx == AliasIdxTop) return false; // the empty category | |
1813 if (adr_type == NULL) return false; // NULL serves as TypePtr::TOP | |
1814 if (alias_idx == AliasIdxBot) return true; // the universal category | |
1815 if (adr_type->base() == Type::AnyPtr) return true; // TypePtr::BOTTOM or its twins | |
1816 | |
1817 // the only remaining possible overlap is identity | |
1818 int adr_idx = get_alias_index(adr_type); | |
1819 assert(adr_idx != AliasIdxBot && adr_idx != AliasIdxTop, ""); | |
1820 return adr_idx == alias_idx; | |
1821 } | |
1822 | |
1823 | |
1824 | |
1825 //---------------------------pop_warm_call------------------------------------- | |
1826 WarmCallInfo* Compile::pop_warm_call() { | |
1827 WarmCallInfo* wci = _warm_calls; | |
1828 if (wci != NULL) _warm_calls = wci->remove_from(wci); | |
1829 return wci; | |
1830 } | |
1831 | |
1832 //----------------------------Inline_Warm-------------------------------------- | |
1833 int Compile::Inline_Warm() { | |
1834 // If there is room, try to inline some more warm call sites. | |
1835 // %%% Do a graph index compaction pass when we think we're out of space? | |
1836 if (!InlineWarmCalls) return 0; | |
1837 | |
1838 int calls_made_hot = 0; | |
1839 int room_to_grow = NodeCountInliningCutoff - unique(); | |
1840 int amount_to_grow = MIN2(room_to_grow, (int)NodeCountInliningStep); | |
1841 int amount_grown = 0; | |
1842 WarmCallInfo* call; | |
1843 while (amount_to_grow > 0 && (call = pop_warm_call()) != NULL) { | |
1844 int est_size = (int)call->size(); | |
1845 if (est_size > (room_to_grow - amount_grown)) { | |
1846 // This one won't fit anyway. Get rid of it. | |
1847 call->make_cold(); | |
1848 continue; | |
1849 } | |
1850 call->make_hot(); | |
1851 calls_made_hot++; | |
1852 amount_grown += est_size; | |
1853 amount_to_grow -= est_size; | |
1854 } | |
1855 | |
1856 if (calls_made_hot > 0) set_major_progress(); | |
1857 return calls_made_hot; | |
1858 } | |
1859 | |
1860 | |
1861 //----------------------------Finish_Warm-------------------------------------- | |
1862 void Compile::Finish_Warm() { | |
1863 if (!InlineWarmCalls) return; | |
1864 if (failing()) return; | |
1865 if (warm_calls() == NULL) return; | |
1866 | |
1867 // Clean up loose ends, if we are out of space for inlining. | |
1868 WarmCallInfo* call; | |
1869 while ((call = pop_warm_call()) != NULL) { | |
1870 call->make_cold(); | |
1871 } | |
1872 } | |
1873 | |
1172 | 1874 //---------------------cleanup_loop_predicates----------------------- |
1875 // Remove the opaque nodes that protect the predicates so that all unused | |
1876 // checks and uncommon_traps will be eliminated from the ideal graph | |
1877 void Compile::cleanup_loop_predicates(PhaseIterGVN &igvn) { | |
1878 if (predicate_count()==0) return; | |
1879 for (int i = predicate_count(); i > 0; i--) { | |
1880 Node * n = predicate_opaque1_node(i-1); | |
1881 assert(n->Opcode() == Op_Opaque1, "must be"); | |
1882 igvn.replace_node(n, n->in(1)); | |
1883 } | |
1884 assert(predicate_count()==0, "should be clean!"); | |
1885 } | |
0 | 1886 |
7473 | 1887 // StringOpts and late inlining of string methods |
1888 void Compile::inline_string_calls(bool parse_time) { | |
1889 { | |
1890 // remove useless nodes to make the usage analysis simpler | |
1891 ResourceMark rm; | |
1892 PhaseRemoveUseless pru(initial_gvn(), for_igvn()); | |
1893 } | |
1894 | |
1895 { | |
1896 ResourceMark rm; | |
10405 | 1897 print_method(PHASE_BEFORE_STRINGOPTS, 3); |
7473 | 1898 PhaseStringOpts pso(initial_gvn(), for_igvn()); |
10405 | 1899 print_method(PHASE_AFTER_STRINGOPTS, 3); |
7473 | 1900 } |
1901 | |
1902 // now inline anything that we skipped the first time around | |
1903 if (!parse_time) { | |
1904 _late_inlines_pos = _late_inlines.length(); | |
1905 } | |
1906 | |
1907 while (_string_late_inlines.length() > 0) { | |
1908 CallGenerator* cg = _string_late_inlines.pop(); | |
1909 cg->do_late_inline(); | |
1910 if (failing()) return; | |
1911 } | |
1912 _string_late_inlines.trunc_to(0); | |
1913 } | |
1914 | |
10278 | 1915 // Late inlining of boxing methods |
1916 void Compile::inline_boxing_calls(PhaseIterGVN& igvn) { | |
1917 if (_boxing_late_inlines.length() > 0) { | |
1918 assert(has_boxed_value(), "inconsistent"); | |
1919 | |
1920 PhaseGVN* gvn = initial_gvn(); | |
1921 set_inlining_incrementally(true); | |
1922 | |
1923 assert( igvn._worklist.size() == 0, "should be done with igvn" ); | |
1924 for_igvn()->clear(); | |
1925 gvn->replace_with(&igvn); | |
1926 | |
20327
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
1927 _late_inlines_pos = _late_inlines.length(); |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
1928 |
10278 | 1929 while (_boxing_late_inlines.length() > 0) { |
1930 CallGenerator* cg = _boxing_late_inlines.pop(); | |
1931 cg->do_late_inline(); | |
1932 if (failing()) return; | |
1933 } | |
1934 _boxing_late_inlines.trunc_to(0); | |
1935 | |
1936 { | |
1937 ResourceMark rm; | |
1938 PhaseRemoveUseless pru(gvn, for_igvn()); | |
1939 } | |
1940 | |
1941 igvn = PhaseIterGVN(gvn); | |
1942 igvn.optimize(); | |
1943 | |
1944 set_inlining_progress(false); | |
1945 set_inlining_incrementally(false); | |
1946 } | |
1947 } | |
1948 | |
7473 | 1949 void Compile::inline_incrementally_one(PhaseIterGVN& igvn) { |
1950 assert(IncrementalInline, "incremental inlining should be on"); | |
1951 PhaseGVN* gvn = initial_gvn(); | |
1952 | |
1953 set_inlining_progress(false); | |
1954 for_igvn()->clear(); | |
1955 gvn->replace_with(&igvn); | |
1956 | |
1957 int i = 0; | |
1958 | |
1959 for (; i <_late_inlines.length() && !inlining_progress(); i++) { | |
1960 CallGenerator* cg = _late_inlines.at(i); | |
1961 _late_inlines_pos = i+1; | |
1962 cg->do_late_inline(); | |
1963 if (failing()) return; | |
1964 } | |
1965 int j = 0; | |
1966 for (; i < _late_inlines.length(); i++, j++) { | |
1967 _late_inlines.at_put(j, _late_inlines.at(i)); | |
1968 } | |
1969 _late_inlines.trunc_to(j); | |
1970 | |
1971 { | |
1972 ResourceMark rm; | |
10278 | 1973 PhaseRemoveUseless pru(gvn, for_igvn()); |
7473 | 1974 } |
1975 | |
1976 igvn = PhaseIterGVN(gvn); | |
1977 } | |
1978 | |
1979 // Perform incremental inlining until bound on number of live nodes is reached | |
1980 void Compile::inline_incrementally(PhaseIterGVN& igvn) { | |
1981 PhaseGVN* gvn = initial_gvn(); | |
1982 | |
1983 set_inlining_incrementally(true); | |
1984 set_inlining_progress(true); | |
1985 uint low_live_nodes = 0; | |
1986 | |
1987 while(inlining_progress() && _late_inlines.length() > 0) { | |
1988 | |
1989 if (live_nodes() > (uint)LiveNodeCountInliningCutoff) { | |
1990 if (low_live_nodes < (uint)LiveNodeCountInliningCutoff * 8 / 10) { | |
1991 // PhaseIdealLoop is expensive so we only try it once we are | |
20327
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
1992 // out of live nodes and we only try it again if the previous |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
1993 // helped got the number of nodes down significantly |
7473 | 1994 PhaseIdealLoop ideal_loop( igvn, false, true ); |
1995 if (failing()) return; | |
1996 low_live_nodes = live_nodes(); | |
1997 _major_progress = true; | |
1998 } | |
1999 | |
2000 if (live_nodes() > (uint)LiveNodeCountInliningCutoff) { | |
2001 break; | |
2002 } | |
2003 } | |
2004 | |
2005 inline_incrementally_one(igvn); | |
2006 | |
2007 if (failing()) return; | |
2008 | |
2009 igvn.optimize(); | |
2010 | |
2011 if (failing()) return; | |
2012 } | |
2013 | |
2014 assert( igvn._worklist.size() == 0, "should be done with igvn" ); | |
2015 | |
2016 if (_string_late_inlines.length() > 0) { | |
2017 assert(has_stringbuilder(), "inconsistent"); | |
2018 for_igvn()->clear(); | |
2019 initial_gvn()->replace_with(&igvn); | |
2020 | |
2021 inline_string_calls(false); | |
2022 | |
2023 if (failing()) return; | |
2024 | |
2025 { | |
2026 ResourceMark rm; | |
2027 PhaseRemoveUseless pru(initial_gvn(), for_igvn()); | |
2028 } | |
2029 | |
2030 igvn = PhaseIterGVN(gvn); | |
2031 | |
2032 igvn.optimize(); | |
2033 } | |
2034 | |
2035 set_inlining_incrementally(false); | |
2036 } | |
2037 | |
2038 | |
0 | 2039 //------------------------------Optimize--------------------------------------- |
2040 // Given a graph, optimize it. | |
2041 void Compile::Optimize() { | |
2042 TracePhase t1("optimizer", &_t_optimizer, true); | |
2043 | |
2044 #ifndef PRODUCT | |
2045 if (env()->break_at_compile()) { | |
2046 BREAKPOINT; | |
2047 } | |
2048 | |
2049 #endif | |
2050 | |
2051 ResourceMark rm; | |
2052 int loop_opts_cnt; | |
2053 | |
2054 NOT_PRODUCT( verify_graph_edges(); ) | |
2055 | |
10405 | 2056 print_method(PHASE_AFTER_PARSING); |
0 | 2057 |
2058 { | |
2059 // Iterative Global Value Numbering, including ideal transforms | |
2060 // Initialize IterGVN with types and values from parse-time GVN | |
2061 PhaseIterGVN igvn(initial_gvn()); | |
2062 { | |
2063 NOT_PRODUCT( TracePhase t2("iterGVN", &_t_iterGVN, TimeCompiler); ) | |
2064 igvn.optimize(); | |
2065 } | |
2066 | |
10405 | 2067 print_method(PHASE_ITER_GVN1, 2); |
0 | 2068 |
2069 if (failing()) return; | |
2070 | |
10278 | 2071 { |
2072 NOT_PRODUCT( TracePhase t2("incrementalInline", &_t_incrInline, TimeCompiler); ) | |
2073 inline_incrementally(igvn); | |
2074 } | |
7473 | 2075 |
10405 | 2076 print_method(PHASE_INCREMENTAL_INLINE, 2); |
7473 | 2077 |
2078 if (failing()) return; | |
2079 | |
10278 | 2080 if (eliminate_boxing()) { |
2081 NOT_PRODUCT( TracePhase t2("incrementalInline", &_t_incrInline, TimeCompiler); ) | |
2082 // Inline valueOf() methods now. | |
2083 inline_boxing_calls(igvn); | |
2084 | |
20327
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
2085 if (AlwaysIncrementalInline) { |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
2086 inline_incrementally(igvn); |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
2087 } |
411e30e5fbb8
8026796: Make replace_in_map() on parent maps generic
roland
parents:
17980
diff
changeset
|
2088 |
10405 | 2089 print_method(PHASE_INCREMENTAL_BOXING_INLINE, 2); |
10278 | 2090 |
2091 if (failing()) return; | |
2092 } | |
2093 | |
12966 | 2094 // Remove the speculative part of types and clean up the graph from |
2095 // the extra CastPP nodes whose only purpose is to carry them. Do | |
2096 // that early so that optimizations are not disrupted by the extra | |
2097 // CastPP nodes. | |
2098 remove_speculative_types(igvn); | |
2099 | |
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
2100 // No more new expensive nodes will be added to the list from here |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
2101 // so keep only the actual candidates for optimizations. |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
2102 cleanup_expensive_nodes(igvn); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
2103 |
1634
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2104 // Perform escape analysis |
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2105 if (_do_escape_analysis && ConnectionGraph::has_candidates(this)) { |
4064
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
2106 if (has_loops()) { |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
2107 // Cleanup graph (remove dead nodes). |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
2108 TracePhase t2("idealLoop", &_t_idealLoop, true); |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
2109 PhaseIdealLoop ideal_loop( igvn, false, true ); |
10405 | 2110 if (major_progress()) print_method(PHASE_PHASEIDEAL_BEFORE_EA, 2); |
4064
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
2111 if (failing()) return; |
670a74b863fc
7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents:
3899
diff
changeset
|
2112 } |
1634
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2113 ConnectionGraph::do_analysis(this, &igvn); |
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2114 |
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2115 if (failing()) return; |
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2116 |
4115 | 2117 // Optimize out fields loads from scalar replaceable allocations. |
1634
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2118 igvn.optimize(); |
10405 | 2119 print_method(PHASE_ITER_GVN_AFTER_EA, 2); |
1634
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2120 |
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2121 if (failing()) return; |
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2122 |
4115 | 2123 if (congraph() != NULL && macro_count() > 0) { |
5948
ee138854b3a6
7147744: CTW: assert(false) failed: infinite EA connection graph build
kvn
parents:
4767
diff
changeset
|
2124 NOT_PRODUCT( TracePhase t2("macroEliminate", &_t_macroEliminate, TimeCompiler); ) |
4115 | 2125 PhaseMacroExpand mexp(igvn); |
2126 mexp.eliminate_macro_nodes(); | |
2127 igvn.set_delay_transform(false); | |
2128 | |
2129 igvn.optimize(); | |
10405 | 2130 print_method(PHASE_ITER_GVN_AFTER_ELIMINATION, 2); |
4115 | 2131 |
2132 if (failing()) return; | |
2133 } | |
1634
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2134 } |
60a14ad85270
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP
kvn
parents:
1609
diff
changeset
|
2135 |
0 | 2136 // Loop transforms on the ideal graph. Range Check Elimination, |
2137 // peeling, unrolling, etc. | |
2138 | |
2139 // Set loop opts counter | |
2140 loop_opts_cnt = num_loop_opts(); | |
2141 if((loop_opts_cnt > 0) && (has_loops() || has_split_ifs())) { | |
2142 { | |
2143 TracePhase t2("idealLoop", &_t_idealLoop, true); | |
2445 | 2144 PhaseIdealLoop ideal_loop( igvn, true ); |
0 | 2145 loop_opts_cnt--; |
10405 | 2146 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP1, 2); |
0 | 2147 if (failing()) return; |
2148 } | |
2149 // Loop opts pass if partial peeling occurred in previous pass | |
2150 if(PartialPeelLoop && major_progress() && (loop_opts_cnt > 0)) { | |
2151 TracePhase t3("idealLoop", &_t_idealLoop, true); | |
2445 | 2152 PhaseIdealLoop ideal_loop( igvn, false ); |
0 | 2153 loop_opts_cnt--; |
10405 | 2154 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP2, 2); |
0 | 2155 if (failing()) return; |
2156 } | |
2157 // Loop opts pass for loop-unrolling before CCP | |
2158 if(major_progress() && (loop_opts_cnt > 0)) { | |
2159 TracePhase t4("idealLoop", &_t_idealLoop, true); | |
2445 | 2160 PhaseIdealLoop ideal_loop( igvn, false ); |
0 | 2161 loop_opts_cnt--; |
10405 | 2162 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP3, 2); |
0 | 2163 } |
921
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2164 if (!failing()) { |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2165 // Verify that last round of loop opts produced a valid graph |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2166 NOT_PRODUCT( TracePhase t2("idealLoopVerify", &_t_idealLoopVerify, TimeCompiler); ) |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2167 PhaseIdealLoop::verify(igvn); |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2168 } |
0 | 2169 } |
2170 if (failing()) return; | |
2171 | |
2172 // Conditional Constant Propagation; | |
2173 PhaseCCP ccp( &igvn ); | |
2174 assert( true, "Break here to ccp.dump_nodes_and_types(_root,999,1)"); | |
2175 { | |
2176 TracePhase t2("ccp", &_t_ccp, true); | |
2177 ccp.do_transform(); | |
2178 } | |
10405 | 2179 print_method(PHASE_CPP1, 2); |
0 | 2180 |
2181 assert( true, "Break here to ccp.dump_old2new_map()"); | |
2182 | |
2183 // Iterative Global Value Numbering, including ideal transforms | |
2184 { | |
2185 NOT_PRODUCT( TracePhase t2("iterGVN2", &_t_iterGVN2, TimeCompiler); ) | |
2186 igvn = ccp; | |
2187 igvn.optimize(); | |
2188 } | |
2189 | |
10405 | 2190 print_method(PHASE_ITER_GVN2, 2); |
0 | 2191 |
2192 if (failing()) return; | |
2193 | |
2194 // Loop transforms on the ideal graph. Range Check Elimination, | |
2195 // peeling, unrolling, etc. | |
2196 if(loop_opts_cnt > 0) { | |
2197 debug_only( int cnt = 0; ); | |
2198 while(major_progress() && (loop_opts_cnt > 0)) { | |
2199 TracePhase t2("idealLoop", &_t_idealLoop, true); | |
2200 assert( cnt++ < 40, "infinite cycle in loop optimization" ); | |
2445 | 2201 PhaseIdealLoop ideal_loop( igvn, true); |
0 | 2202 loop_opts_cnt--; |
10405 | 2203 if (major_progress()) print_method(PHASE_PHASEIDEALLOOP_ITERATIONS, 2); |
0 | 2204 if (failing()) return; |
2205 } | |
2206 } | |
19817
8b7a143aea6b
Local fix for JDK-8075105
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
18041
diff
changeset
|
2207 // Ensure that major progress is now clear |
8b7a143aea6b
Local fix for JDK-8075105
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
18041
diff
changeset
|
2208 C->clear_major_progress(); |
921
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2209 |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2210 { |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2211 // Verify that all previous optimizations produced a valid graph |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2212 // at least to this point, even if no loop optimizations were done. |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2213 NOT_PRODUCT( TracePhase t2("idealLoopVerify", &_t_idealLoopVerify, TimeCompiler); ) |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2214 PhaseIdealLoop::verify(igvn); |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2215 } |
046932b72aa2
6862956: PhaseIdealLoop should have a CFG verification mode
never
parents:
859
diff
changeset
|
2216 |
0 | 2217 { |
2218 NOT_PRODUCT( TracePhase t2("macroExpand", &_t_macroExpand, TimeCompiler); ) | |
2219 PhaseMacroExpand mex(igvn); | |
2220 if (mex.expand_macro_nodes()) { | |
2221 assert(failing(), "must bail out w/ explicit message"); | |
2222 return; | |
2223 } | |
2224 } | |
2225 | |
2226 } // (End scope of igvn; run destructor if necessary for asserts.) | |
2227 | |
7605 | 2228 dump_inlining(); |
0 | 2229 // A method with only infinite loops has no edges entering loops from root |
2230 { | |
2231 NOT_PRODUCT( TracePhase t2("graphReshape", &_t_graphReshaping, TimeCompiler); ) | |
2232 if (final_graph_reshaping()) { | |
2233 assert(failing(), "must bail out w/ explicit message"); | |
2234 return; | |
2235 } | |
2236 } | |
2237 | |
10405 | 2238 print_method(PHASE_OPTIMIZE_FINISHED, 2); |
0 | 2239 } |
2240 | |
2241 | |
2242 //------------------------------Code_Gen--------------------------------------- | |
2243 // Given a graph, generate code for it | |
2244 void Compile::Code_Gen() { | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2245 if (failing()) { |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2246 return; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2247 } |
0 | 2248 |
2249 // Perform instruction selection. You might think we could reclaim Matcher | |
2250 // memory PDQ, but actually the Matcher is used in generating spill code. | |
2251 // Internals of the Matcher (including some VectorSets) must remain live | |
2252 // for awhile - thus I cannot reclaim Matcher memory lest a VectorSet usage | |
2253 // set a bit in reclaimed memory. | |
2254 | |
2255 // In debug mode can dump m._nodes.dump() for mapping of ideal to machine | |
2256 // nodes. Mapping is only valid at the root of each matched subtree. | |
2257 NOT_PRODUCT( verify_graph_edges(); ) | |
2258 | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2259 Matcher matcher; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2260 _matcher = &matcher; |
0 | 2261 { |
2262 TracePhase t2("matcher", &_t_matcher, true); | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2263 matcher.match(); |
0 | 2264 } |
2265 // In debug mode can dump m._nodes.dump() for mapping of ideal to machine | |
2266 // nodes. Mapping is only valid at the root of each matched subtree. | |
2267 NOT_PRODUCT( verify_graph_edges(); ) | |
2268 | |
2269 // If you have too many nodes, or if matching has failed, bail out | |
2270 check_node_count(0, "out of nodes matching instructions"); | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2271 if (failing()) { |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2272 return; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2273 } |
0 | 2274 |
2275 // Build a proper-looking CFG | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2276 PhaseCFG cfg(node_arena(), root(), matcher); |
0 | 2277 _cfg = &cfg; |
2278 { | |
2279 NOT_PRODUCT( TracePhase t2("scheduler", &_t_scheduler, TimeCompiler); ) | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2280 bool success = cfg.do_global_code_motion(); |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2281 if (!success) { |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2282 return; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2283 } |
0 | 2284 |
10405 | 2285 print_method(PHASE_GLOBAL_CODE_MOTION, 2); |
0 | 2286 NOT_PRODUCT( verify_graph_edges(); ) |
2287 debug_only( cfg.verify(); ) | |
2288 } | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2289 |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2290 PhaseChaitin regalloc(unique(), cfg, matcher); |
0 | 2291 _regalloc = ®alloc; |
2292 { | |
2293 TracePhase t2("regalloc", &_t_registerAllocation, true); | |
2294 // Perform register allocation. After Chaitin, use-def chains are | |
2295 // no longer accurate (at spill code) and so must be ignored. | |
2296 // Node->LRG->reg mappings are still accurate. | |
2297 _regalloc->Register_Allocate(); | |
2298 | |
2299 // Bail out if the allocator builds too many nodes | |
10111 | 2300 if (failing()) { |
2301 return; | |
2302 } | |
0 | 2303 } |
2304 | |
2305 // Prior to register allocation we kept empty basic blocks in case the | |
2306 // the allocator needed a place to spill. After register allocation we | |
2307 // are not adding any new instructions. If any basic block is empty, we | |
2308 // can now safely remove it. | |
2309 { | |
418 | 2310 NOT_PRODUCT( TracePhase t2("blockOrdering", &_t_blockOrdering, TimeCompiler); ) |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2311 cfg.remove_empty_blocks(); |
418 | 2312 if (do_freq_based_layout()) { |
2313 PhaseBlockLayout layout(cfg); | |
2314 } else { | |
2315 cfg.set_loop_alignment(); | |
2316 } | |
2317 cfg.fixup_flow(); | |
0 | 2318 } |
2319 | |
2320 // Apply peephole optimizations | |
2321 if( OptoPeephole ) { | |
2322 NOT_PRODUCT( TracePhase t2("peephole", &_t_peephole, TimeCompiler); ) | |
2323 PhasePeephole peep( _regalloc, cfg); | |
2324 peep.do_transform(); | |
2325 } | |
2326 | |
14428
044b28168e20
8003854: PPC64 (part 115): Introduce PostallocExpand that expands nodes after register allocation
goetz
parents:
14422
diff
changeset
|
2327 // Do late expand if CPU requires this. |
044b28168e20
8003854: PPC64 (part 115): Introduce PostallocExpand that expands nodes after register allocation
goetz
parents:
14422
diff
changeset
|
2328 if (Matcher::require_postalloc_expand) { |
044b28168e20
8003854: PPC64 (part 115): Introduce PostallocExpand that expands nodes after register allocation
goetz
parents:
14422
diff
changeset
|
2329 NOT_PRODUCT(TracePhase t2c("postalloc_expand", &_t_postalloc_expand, true)); |
044b28168e20
8003854: PPC64 (part 115): Introduce PostallocExpand that expands nodes after register allocation
goetz
parents:
14422
diff
changeset
|
2330 cfg.postalloc_expand(_regalloc); |
044b28168e20
8003854: PPC64 (part 115): Introduce PostallocExpand that expands nodes after register allocation
goetz
parents:
14422
diff
changeset
|
2331 } |
044b28168e20
8003854: PPC64 (part 115): Introduce PostallocExpand that expands nodes after register allocation
goetz
parents:
14422
diff
changeset
|
2332 |
0 | 2333 // Convert Nodes to instruction bits in a buffer |
2334 { | |
2335 // %%%% workspace merge brought two timers together for one job | |
2336 TracePhase t2a("output", &_t_output, true); | |
2337 NOT_PRODUCT( TraceTime t2b(NULL, &_t_codeGeneration, TimeCompiler, false); ) | |
2338 Output(); | |
2339 } | |
2340 | |
10405 | 2341 print_method(PHASE_FINAL_CODE); |
0 | 2342 |
2343 // He's dead, Jim. | |
2344 _cfg = (PhaseCFG*)0xdeadbeef; | |
2345 _regalloc = (PhaseChaitin*)0xdeadbeef; | |
2346 } | |
2347 | |
2348 | |
2349 //------------------------------dump_asm--------------------------------------- | |
2350 // Dump formatted assembly | |
2351 #ifndef PRODUCT | |
2352 void Compile::dump_asm(int *pcs, uint pc_limit) { | |
2353 bool cut_short = false; | |
2354 tty->print_cr("#"); | |
2355 tty->print("# "); _tf->dump(); tty->cr(); | |
2356 tty->print_cr("#"); | |
2357 | |
2358 // For all blocks | |
2359 int pc = 0x0; // Program counter | |
2360 char starts_bundle = ' '; | |
2361 _regalloc->dump_frame(); | |
2362 | |
2363 Node *n = NULL; | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2364 for (uint i = 0; i < _cfg->number_of_blocks(); i++) { |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2365 if (VMThread::should_terminate()) { |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2366 cut_short = true; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2367 break; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2368 } |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2369 Block* block = _cfg->get_block(i); |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2370 if (block->is_connector() && !Verbose) { |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2371 continue; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2372 } |
12167
650868c062a9
8023691: Create interface for nodes in class Block
adlertz
parents:
12071
diff
changeset
|
2373 n = block->head(); |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2374 if (pcs && n->_idx < pc_limit) { |
0 | 2375 tty->print("%3.3x ", pcs[n->_idx]); |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2376 } else { |
0 | 2377 tty->print(" "); |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2378 } |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2379 block->dump_head(_cfg); |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2380 if (block->is_connector()) { |
0 | 2381 tty->print_cr(" # Empty connector block"); |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2382 } else if (block->num_preds() == 2 && block->pred(1)->is_CatchProj() && block->pred(1)->as_CatchProj()->_con == CatchProjNode::fall_through_index) { |
0 | 2383 tty->print_cr(" # Block is sole successor of call"); |
2384 } | |
2385 | |
2386 // For all instructions | |
2387 Node *delay = NULL; | |
12167
650868c062a9
8023691: Create interface for nodes in class Block
adlertz
parents:
12071
diff
changeset
|
2388 for (uint j = 0; j < block->number_of_nodes(); j++) { |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2389 if (VMThread::should_terminate()) { |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2390 cut_short = true; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2391 break; |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2392 } |
12167
650868c062a9
8023691: Create interface for nodes in class Block
adlertz
parents:
12071
diff
changeset
|
2393 n = block->get_node(j); |
0 | 2394 if (valid_bundle_info(n)) { |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2395 Bundle* bundle = node_bundling(n); |
0 | 2396 if (bundle->used_in_unconditional_delay()) { |
2397 delay = n; | |
2398 continue; | |
2399 } | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2400 if (bundle->starts_bundle()) { |
0 | 2401 starts_bundle = '+'; |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2402 } |
0 | 2403 } |
2404 | |
12071
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2405 if (WizardMode) { |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2406 n->dump(); |
adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
adlertz
parents:
12023
diff
changeset
|
2407 } |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
2408 |
0 | 2409 if( !n->is_Region() && // Dont print in the Assembly |
2410 !n->is_Phi() && // a few noisely useless nodes | |
2411 !n->is_Proj() && | |
2412 !n->is_MachTemp() && | |
1100
f96a1a986f7b
6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents:
1080
diff
changeset
|
2413 !n->is_SafePointScalarObject() && |
0 | 2414 !n->is_Catch() && // Would be nice to print exception table targets |
2415 !n->is_MergeMem() && // Not very interesting | |
2416 !n->is_top() && // Debug info table constants | |
2417 !(n->is_Con() && !n->is_Mach())// Debug info table constants | |
2418 ) { | |
2419 if (pcs && n->_idx < pc_limit) | |
2420 tty->print("%3.3x", pcs[n->_idx]); | |
2421 else | |
2422 tty->print(" "); | |
2423 tty->print(" %c ", starts_bundle); | |
2424 starts_bundle = ' '; | |
2425 tty->print("\t"); | |
2426 n->format(_regalloc, tty); | |
2427 tty->cr(); | |
2428 } | |
2429 | |
2430 // If we have an instruction with a delay slot, and have seen a delay, | |
2431 // then back up and print it | |
2432 if (valid_bundle_info(n) && node_bundling(n)->use_unconditional_delay()) { | |
2433 assert(delay != NULL, "no unconditional delay instruction"); | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
2434 if (WizardMode) delay->dump(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
2435 |
0 | 2436 if (node_bundling(delay)->starts_bundle()) |
2437 starts_bundle = '+'; | |
2438 if (pcs && n->_idx < pc_limit) | |
2439 tty->print("%3.3x", pcs[n->_idx]); | |
2440 else | |
2441 tty->print(" "); | |
2442 tty->print(" %c ", starts_bundle); | |
2443 starts_bundle = ' '; | |
2444 tty->print("\t"); | |
2445 delay->format(_regalloc, tty); | |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17914
diff
changeset
|
2446 tty->cr(); |
0 | 2447 delay = NULL; |
2448 } | |
2449 | |
2450 // Dump the exception table as well | |
2451 if( n->is_Catch() && (Verbose || WizardMode) ) { | |
2452 // Print the exception table for this offset | |
2453 _handler_table.print_subtable_for(pc); | |
2454 } | |
2455 } | |
2456 | |
2457 if (pcs && n->_idx < pc_limit) | |
2458 tty->print_cr("%3.3x", pcs[n->_idx]); | |
2459 else | |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17914
diff
changeset
|
2460 tty->cr(); |
0 | 2461 |
2462 assert(cut_short || delay == NULL, "no unconditional delay branch"); | |
2463 | |
2464 } // End of per-block dump | |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17914
diff
changeset
|
2465 tty->cr(); |
0 | 2466 |
2467 if (cut_short) tty->print_cr("*** disassembly is cut short ***"); | |
2468 } | |
2469 #endif | |
2470 | |
2471 //------------------------------Final_Reshape_Counts--------------------------- | |
2472 // This class defines counters to help identify when a method | |
2473 // may/must be executed using hardware with only 24-bit precision. | |
2474 struct Final_Reshape_Counts : public StackObj { | |
2475 int _call_count; // count non-inlined 'common' calls | |
2476 int _float_count; // count float ops requiring 24-bit precision | |
2477 int _double_count; // count double ops requiring more precision | |
2478 int _java_call_count; // count non-inlined 'java' calls | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2479 int _inner_loop_count; // count loops which need alignment |
0 | 2480 VectorSet _visited; // Visitation flags |
2481 Node_List _tests; // Set of IfNodes & PCTableNodes | |
2482 | |
2483 Final_Reshape_Counts() : | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2484 _call_count(0), _float_count(0), _double_count(0), |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2485 _java_call_count(0), _inner_loop_count(0), |
0 | 2486 _visited( Thread::current()->resource_area() ) { } |
2487 | |
2488 void inc_call_count () { _call_count ++; } | |
2489 void inc_float_count () { _float_count ++; } | |
2490 void inc_double_count() { _double_count++; } | |
2491 void inc_java_call_count() { _java_call_count++; } | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2492 void inc_inner_loop_count() { _inner_loop_count++; } |
0 | 2493 |
2494 int get_call_count () const { return _call_count ; } | |
2495 int get_float_count () const { return _float_count ; } | |
2496 int get_double_count() const { return _double_count; } | |
2497 int get_java_call_count() const { return _java_call_count; } | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2498 int get_inner_loop_count() const { return _inner_loop_count; } |
0 | 2499 }; |
2500 | |
9060
cc32ccaaf47f
8003310: Enable -Wunused-function when compiling with gcc
mikael
parents:
8730
diff
changeset
|
2501 #ifdef ASSERT |
0 | 2502 static bool oop_offset_is_sane(const TypeInstPtr* tp) { |
2503 ciInstanceKlass *k = tp->klass()->as_instance_klass(); | |
2504 // Make sure the offset goes inside the instance layout. | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
2505 return k->contains_field_offset(tp->offset()); |
0 | 2506 // Note that OffsetBot and OffsetTop are very negative. |
2507 } | |
9060
cc32ccaaf47f
8003310: Enable -Wunused-function when compiling with gcc
mikael
parents:
8730
diff
changeset
|
2508 #endif |
0 | 2509 |
3248
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2510 // Eliminate trivially redundant StoreCMs and accumulate their |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2511 // precedence edges. |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2512 void Compile::eliminate_redundant_card_marks(Node* n) { |
3248
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2513 assert(n->Opcode() == Op_StoreCM, "expected StoreCM"); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2514 if (n->in(MemNode::Address)->outcnt() > 1) { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2515 // There are multiple users of the same address so it might be |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2516 // possible to eliminate some of the StoreCMs |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2517 Node* mem = n->in(MemNode::Memory); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2518 Node* adr = n->in(MemNode::Address); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2519 Node* val = n->in(MemNode::ValueIn); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2520 Node* prev = n; |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2521 bool done = false; |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2522 // Walk the chain of StoreCMs eliminating ones that match. As |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2523 // long as it's a chain of single users then the optimization is |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2524 // safe. Eliminating partially redundant StoreCMs would require |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2525 // cloning copies down the other paths. |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2526 while (mem->Opcode() == Op_StoreCM && mem->outcnt() == 1 && !done) { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2527 if (adr == mem->in(MemNode::Address) && |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2528 val == mem->in(MemNode::ValueIn)) { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2529 // redundant StoreCM |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2530 if (mem->req() > MemNode::OopStore) { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2531 // Hasn't been processed by this code yet. |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2532 n->add_prec(mem->in(MemNode::OopStore)); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2533 } else { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2534 // Already converted to precedence edge |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2535 for (uint i = mem->req(); i < mem->len(); i++) { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2536 // Accumulate any precedence edges |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2537 if (mem->in(i) != NULL) { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2538 n->add_prec(mem->in(i)); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2539 } |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2540 } |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2541 // Everything above this point has been processed. |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2542 done = true; |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2543 } |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2544 // Eliminate the previous StoreCM |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2545 prev->set_req(MemNode::Memory, mem->in(MemNode::Memory)); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2546 assert(mem->outcnt() == 0, "should be dead"); |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2547 mem->disconnect_inputs(NULL, this); |
3248
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2548 } else { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2549 prev = mem; |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2550 } |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2551 mem = prev->in(MemNode::Memory); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2552 } |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2553 } |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2554 } |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2555 |
0 | 2556 //------------------------------final_graph_reshaping_impl---------------------- |
2557 // Implement items 1-5 from final_graph_reshaping below. | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2558 void Compile::final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc) { |
0 | 2559 |
168
7793bd37a336
6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents:
164
diff
changeset
|
2560 if ( n->outcnt() == 0 ) return; // dead node |
0 | 2561 uint nop = n->Opcode(); |
2562 | |
2563 // Check for 2-input instruction with "last use" on right input. | |
2564 // Swap to left input. Implements item (2). | |
2565 if( n->req() == 3 && // two-input instruction | |
2566 n->in(1)->outcnt() > 1 && // left use is NOT a last use | |
2567 (!n->in(1)->is_Phi() || n->in(1)->in(2) != n) && // it is not data loop | |
2568 n->in(2)->outcnt() == 1 &&// right use IS a last use | |
2569 !n->in(2)->is_Con() ) { // right use is not a constant | |
2570 // Check for commutative opcode | |
2571 switch( nop ) { | |
2572 case Op_AddI: case Op_AddF: case Op_AddD: case Op_AddL: | |
2573 case Op_MaxI: case Op_MinI: | |
2574 case Op_MulI: case Op_MulF: case Op_MulD: case Op_MulL: | |
2575 case Op_AndL: case Op_XorL: case Op_OrL: | |
2576 case Op_AndI: case Op_XorI: case Op_OrI: { | |
2577 // Move "last use" input to left by swapping inputs | |
2578 n->swap_edges(1, 2); | |
2579 break; | |
2580 } | |
2581 default: | |
2582 break; | |
2583 } | |
2584 } | |
2585 | |
1609 | 2586 #ifdef ASSERT |
2587 if( n->is_Mem() ) { | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2588 int alias_idx = get_alias_index(n->as_Mem()->adr_type()); |
1609 | 2589 assert( n->in(0) != NULL || alias_idx != Compile::AliasIdxRaw || |
2590 // oop will be recorded in oop map if load crosses safepoint | |
2591 n->is_Load() && (n->as_Load()->bottom_type()->isa_oopptr() || | |
2592 LoadNode::is_immutable_value(n->in(MemNode::Address))), | |
2593 "raw memory operations should have control edge"); | |
2594 } | |
2595 #endif | |
0 | 2596 // Count FPU ops and common calls, implements item (3) |
2597 switch( nop ) { | |
2598 // Count all float operations that may use FPU | |
2599 case Op_AddF: | |
2600 case Op_SubF: | |
2601 case Op_MulF: | |
2602 case Op_DivF: | |
2603 case Op_NegF: | |
2604 case Op_ModF: | |
2605 case Op_ConvI2F: | |
2606 case Op_ConF: | |
2607 case Op_CmpF: | |
2608 case Op_CmpF3: | |
2609 // case Op_ConvL2F: // longs are split into 32-bit halves | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2610 frc.inc_float_count(); |
0 | 2611 break; |
2612 | |
2613 case Op_ConvF2D: | |
2614 case Op_ConvD2F: | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2615 frc.inc_float_count(); |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2616 frc.inc_double_count(); |
0 | 2617 break; |
2618 | |
2619 // Count all double operations that may use FPU | |
2620 case Op_AddD: | |
2621 case Op_SubD: | |
2622 case Op_MulD: | |
2623 case Op_DivD: | |
2624 case Op_NegD: | |
2625 case Op_ModD: | |
2626 case Op_ConvI2D: | |
2627 case Op_ConvD2I: | |
2628 // case Op_ConvL2D: // handled by leaf call | |
2629 // case Op_ConvD2L: // handled by leaf call | |
2630 case Op_ConD: | |
2631 case Op_CmpD: | |
2632 case Op_CmpD3: | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2633 frc.inc_double_count(); |
0 | 2634 break; |
2635 case Op_Opaque1: // Remove Opaque Nodes before matching | |
2636 case Op_Opaque2: // Remove Opaque Nodes before matching | |
17780 | 2637 case Op_Opaque3: |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2638 n->subsume_by(n->in(1), this); |
0 | 2639 break; |
2640 case Op_CallStaticJava: | |
2641 case Op_CallJava: | |
2642 case Op_CallDynamicJava: | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2643 frc.inc_java_call_count(); // Count java call site; |
0 | 2644 case Op_CallRuntime: |
2645 case Op_CallLeaf: | |
2646 case Op_CallLeafNoFP: { | |
2647 assert( n->is_Call(), "" ); | |
2648 CallNode *call = n->as_Call(); | |
2649 // Count call sites where the FP mode bit would have to be flipped. | |
2650 // Do not count uncommon runtime calls: | |
2651 // uncommon_trap, _complete_monitor_locking, _complete_monitor_unlocking, | |
2652 // _new_Java, _new_typeArray, _new_objArray, _rethrow_Java, ... | |
2653 if( !call->is_CallStaticJava() || !call->as_CallStaticJava()->_name ) { | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2654 frc.inc_call_count(); // Count the call site |
0 | 2655 } else { // See if uncommon argument is shared |
2656 Node *n = call->in(TypeFunc::Parms); | |
2657 int nop = n->Opcode(); | |
2658 // Clone shared simple arguments to uncommon calls, item (1). | |
2659 if( n->outcnt() > 1 && | |
2660 !n->is_Proj() && | |
2661 nop != Op_CreateEx && | |
2662 nop != Op_CheckCastPP && | |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2663 nop != Op_DecodeN && |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2664 nop != Op_DecodeNKlass && |
0 | 2665 !n->is_Mem() ) { |
2666 Node *x = n->clone(); | |
2667 call->set_req( TypeFunc::Parms, x ); | |
2668 } | |
2669 } | |
2670 break; | |
2671 } | |
2672 | |
2673 case Op_StoreD: | |
2674 case Op_LoadD: | |
2675 case Op_LoadD_unaligned: | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2676 frc.inc_double_count(); |
0 | 2677 goto handle_mem; |
2678 case Op_StoreF: | |
2679 case Op_LoadF: | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
2680 frc.inc_float_count(); |
0 | 2681 goto handle_mem; |
2682 | |
3248
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2683 case Op_StoreCM: |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2684 { |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2685 // Convert OopStore dependence into precedence edge |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2686 Node* prec = n->in(MemNode::OopStore); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2687 n->del_req(MemNode::OopStore); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2688 n->add_prec(prec); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2689 eliminate_redundant_card_marks(n); |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2690 } |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2691 |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2692 // fall through |
e6beb62de02d
7032963: StoreCM shouldn't participate in store elimination
never
parents:
2376
diff
changeset
|
2693 |
0 | 2694 case Op_StoreB: |
2695 case Op_StoreC: | |
2696 case Op_StorePConditional: | |
2697 case Op_StoreI: | |
2698 case Op_StoreL: | |
420
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
418
diff
changeset
|
2699 case Op_StoreIConditional: |
0 | 2700 case Op_StoreLConditional: |
2701 case Op_CompareAndSwapI: | |
2702 case Op_CompareAndSwapL: | |
2703 case Op_CompareAndSwapP: | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
2704 case Op_CompareAndSwapN: |
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6792
diff
changeset
|
2705 case Op_GetAndAddI: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6792
diff
changeset
|
2706 case Op_GetAndAddL: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6792
diff
changeset
|
2707 case Op_GetAndSetI: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6792
diff
changeset
|
2708 case Op_GetAndSetL: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6792
diff
changeset
|
2709 case Op_GetAndSetP: |
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6792
diff
changeset
|
2710 case Op_GetAndSetN: |
0 | 2711 case Op_StoreP: |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
2712 case Op_StoreN: |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2713 case Op_StoreNKlass: |
0 | 2714 case Op_LoadB: |
624 | 2715 case Op_LoadUB: |
558
3b5ac9e7e6ea
6796746: rename LoadC (char) opcode class to LoadUS (unsigned short)
twisti
parents:
492
diff
changeset
|
2716 case Op_LoadUS: |
0 | 2717 case Op_LoadI: |
2718 case Op_LoadKlass: | |
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2719 case Op_LoadNKlass: |
0 | 2720 case Op_LoadL: |
2721 case Op_LoadL_unaligned: | |
2722 case Op_LoadPLocked: | |
2723 case Op_LoadP: | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
100
diff
changeset
|
2724 case Op_LoadN: |
0 | 2725 case Op_LoadRange: |
2726 case Op_LoadS: { | |
2727 handle_mem: | |
2728 #ifdef ASSERT | |
2729 if( VerifyOptoOopOffsets ) { | |
2730 assert( n->is_Mem(), "" ); | |
2731 MemNode *mem = (MemNode*)n; | |
2732 // Check to see if address types have grounded out somehow. | |
2733 const TypeInstPtr *tp = mem->in(MemNode::Address)->bottom_type()->isa_instptr(); | |
2734 assert( !tp || oop_offset_is_sane(tp), "" ); | |
2735 } | |
2736 #endif | |
2737 break; | |
2738 } | |
2739 | |
2740 case Op_AddP: { // Assert sane base pointers | |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2741 Node *addp = n->in(AddPNode::Address); |
0 | 2742 assert( !addp->is_AddP() || |
2743 addp->in(AddPNode::Base)->is_top() || // Top OK for allocation | |
2744 addp->in(AddPNode::Base) == n->in(AddPNode::Base), | |
2745 "Base pointers must match" ); | |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2746 #ifdef _LP64 |
12226
7944aba7ba41
8015107: NPG: Use consistent naming for metaspace concepts
ehelin
parents:
12167
diff
changeset
|
2747 if ((UseCompressedOops || UseCompressedClassPointers) && |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2748 addp->Opcode() == Op_ConP && |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2749 addp == n->in(AddPNode::Base) && |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2750 n->in(AddPNode::Offset)->is_Con()) { |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2751 // Use addressing with narrow klass to load with offset on x86. |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2752 // On sparc loading 32-bits constant and decoding it have less |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2753 // instructions (4) then load 64-bits constant (7). |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2754 // Do this transformation here since IGVN will convert ConN back to ConP. |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2755 const Type* t = addp->bottom_type(); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2756 if (t->isa_oopptr() || t->isa_klassptr()) { |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2757 Node* nn = NULL; |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2758 |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2759 int op = t->isa_oopptr() ? Op_ConN : Op_ConNKlass; |
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2760 |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2761 // Look for existing ConN node of the same exact type. |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2762 Node* r = root(); |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2763 uint cnt = r->outcnt(); |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2764 for (uint i = 0; i < cnt; i++) { |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2765 Node* m = r->raw_out(i); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2766 if (m!= NULL && m->Opcode() == op && |
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
182
diff
changeset
|
2767 m->bottom_type()->make_ptr() == t) { |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2768 nn = m; |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2769 break; |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2770 } |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2771 } |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2772 if (nn != NULL) { |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2773 // Decode a narrow oop to match address |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2774 // [R12 + narrow_oop_reg<<3 + offset] |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2775 if (t->isa_oopptr()) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2776 nn = new (this) DecodeNNode(nn, t); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2777 } else { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2778 nn = new (this) DecodeNKlassNode(nn, t); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2779 } |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2780 n->set_req(AddPNode::Base, nn); |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2781 n->set_req(AddPNode::Address, nn); |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2782 if (addp->outcnt() == 0) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2783 addp->disconnect_inputs(NULL, this); |
182
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2784 } |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2785 } |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2786 } |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2787 } |
44abbb0d4c18
6709093: Compressed Oops: reduce size of compiled methods
kvn
parents:
168
diff
changeset
|
2788 #endif |
0 | 2789 break; |
2790 } | |
2791 | |
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2792 #ifdef _LP64 |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2793 case Op_CastPP: |
1575
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
2794 if (n->in(1)->is_DecodeN() && Matcher::gen_narrow_oop_implicit_null_checks()) { |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2795 Node* in1 = n->in(1); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2796 const Type* t = n->bottom_type(); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2797 Node* new_in1 = in1->clone(); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2798 new_in1->as_DecodeN()->set_type(t); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2799 |
1575
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
2800 if (!Matcher::narrow_oop_use_complex_address()) { |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2801 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2802 // x86, ARM and friends can handle 2 adds in addressing mode |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2803 // and Matcher can fold a DecodeN node into address by using |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2804 // a narrow oop directly and do implicit NULL check in address: |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2805 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2806 // [R12 + narrow_oop_reg<<3 + offset] |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2807 // NullCheck narrow_oop_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2808 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2809 // On other platforms (Sparc) we have to keep new DecodeN node and |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2810 // use it to do implicit NULL check in address: |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2811 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2812 // decode_not_null narrow_oop_reg, base_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2813 // [base_reg + offset] |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2814 // NullCheck base_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2815 // |
605 | 2816 // Pin the new DecodeN node to non-null path on these platform (Sparc) |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2817 // to keep the information to which NULL check the new DecodeN node |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2818 // corresponds to use it as value in implicit_null_check(). |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2819 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2820 new_in1->set_req(0, n->in(0)); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2821 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2822 |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2823 n->subsume_by(new_in1, this); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2824 if (in1->outcnt() == 0) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2825 in1->disconnect_inputs(NULL, this); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2826 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2827 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2828 break; |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2829 |
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2830 case Op_CmpP: |
168
7793bd37a336
6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents:
164
diff
changeset
|
2831 // Do this transformation here to preserve CmpPNode::sub() and |
7793bd37a336
6705887: Compressed Oops: generate x64 addressing and implicit null checks with narrow oops
kvn
parents:
164
diff
changeset
|
2832 // other TypePtr related Ideal optimizations (for example, ptr nullness). |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2833 if (n->in(1)->is_DecodeNarrowPtr() || n->in(2)->is_DecodeNarrowPtr()) { |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2834 Node* in1 = n->in(1); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2835 Node* in2 = n->in(2); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2836 if (!in1->is_DecodeNarrowPtr()) { |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2837 in2 = in1; |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2838 in1 = n->in(2); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2839 } |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2840 assert(in1->is_DecodeNarrowPtr(), "sanity"); |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2841 |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2842 Node* new_in2 = NULL; |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2843 if (in2->is_DecodeNarrowPtr()) { |
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2844 assert(in2->Opcode() == in1->Opcode(), "must be same node type"); |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2845 new_in2 = in2->in(1); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2846 } else if (in2->Opcode() == Op_ConP) { |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2847 const Type* t = in2->bottom_type(); |
1575
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
2848 if (t == TypePtr::NULL_PTR) { |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2849 assert(in1->is_DecodeN(), "compare klass to null?"); |
1575
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
2850 // Don't convert CmpP null check into CmpN if compressed |
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
2851 // oops implicit null check is not generated. |
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
2852 // This will allow to generate normal oop implicit null check. |
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
2853 if (Matcher::gen_narrow_oop_implicit_null_checks()) |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2854 new_in2 = ConNode::make(this, TypeNarrowOop::NULL_PTR); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2855 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2856 // This transformation together with CastPP transformation above |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2857 // will generated code for implicit NULL checks for compressed oops. |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2858 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2859 // The original code after Optimize() |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2860 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2861 // LoadN memory, narrow_oop_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2862 // decode narrow_oop_reg, base_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2863 // CmpP base_reg, NULL |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2864 // CastPP base_reg // NotNull |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2865 // Load [base_reg + offset], val_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2866 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2867 // after these transformations will be |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2868 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2869 // LoadN memory, narrow_oop_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2870 // CmpN narrow_oop_reg, NULL |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2871 // decode_not_null narrow_oop_reg, base_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2872 // Load [base_reg + offset], val_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2873 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2874 // and the uncommon path (== NULL) will use narrow_oop_reg directly |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2875 // since narrow oops can be used in debug info now (see the code in |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2876 // final_graph_reshaping_walk()). |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2877 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2878 // At the end the code will be matched to |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2879 // on x86: |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2880 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2881 // Load_narrow_oop memory, narrow_oop_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2882 // Load [R12 + narrow_oop_reg<<3 + offset], val_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2883 // NullCheck narrow_oop_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2884 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2885 // and on sparc: |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2886 // |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2887 // Load_narrow_oop memory, narrow_oop_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2888 // decode_not_null narrow_oop_reg, base_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2889 // Load [base_reg + offset], val_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2890 // NullCheck base_reg |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2891 // |
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2892 } else if (t->isa_oopptr()) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2893 new_in2 = ConNode::make(this, t->make_narrowoop()); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2894 } else if (t->isa_klassptr()) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2895 new_in2 = ConNode::make(this, t->make_narrowklass()); |
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2896 } |
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2897 } |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2898 if (new_in2 != NULL) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2899 Node* cmpN = new (this) CmpNNode(in1->in(1), new_in2); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2900 n->subsume_by(cmpN, this); |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2901 if (in1->outcnt() == 0) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2902 in1->disconnect_inputs(NULL, this); |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2903 } |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2904 if (in2->outcnt() == 0) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2905 in2->disconnect_inputs(NULL, this); |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
2906 } |
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2907 } |
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2908 } |
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
253
diff
changeset
|
2909 break; |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2910 |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2911 case Op_DecodeN: |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2912 case Op_DecodeNKlass: |
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2913 assert(!n->in(1)->is_EncodeNarrowPtr(), "should be optimized out"); |
1575
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
2914 // DecodeN could be pinned when it can't be fold into |
492
5496e074077f
6787050: assert(n->in(0) == 0L,"no control") with UseCompressedOops on sparcv9
kvn
parents:
490
diff
changeset
|
2915 // an address expression, see the code for Op_CastPP above. |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2916 assert(n->in(0) == NULL || (UseCompressedOops && !Matcher::narrow_oop_use_complex_address()), "no control"); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2917 break; |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2918 |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2919 case Op_EncodeP: |
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2920 case Op_EncodePKlass: { |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2921 Node* in1 = n->in(1); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2922 if (in1->is_DecodeNarrowPtr()) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2923 n->subsume_by(in1->in(1), this); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2924 } else if (in1->Opcode() == Op_ConP) { |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2925 const Type* t = in1->bottom_type(); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2926 if (t == TypePtr::NULL_PTR) { |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2927 assert(t->isa_oopptr(), "null klass?"); |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2928 n->subsume_by(ConNode::make(this, TypeNarrowOop::NULL_PTR), this); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2929 } else if (t->isa_oopptr()) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2930 n->subsume_by(ConNode::make(this, t->make_narrowoop()), this); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2931 } else if (t->isa_klassptr()) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2932 n->subsume_by(ConNode::make(this, t->make_narrowklass()), this); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2933 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2934 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2935 if (in1->outcnt() == 0) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2936 in1->disconnect_inputs(NULL, this); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2937 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2938 break; |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2939 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2940 |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2941 case Op_Proj: { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2942 if (OptimizeStringConcat) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2943 ProjNode* p = n->as_Proj(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2944 if (p->_is_io_use) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2945 // Separate projections were used for the exception path which |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2946 // are normally removed by a late inline. If it wasn't inlined |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2947 // then they will hang around and should just be replaced with |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2948 // the original one. |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2949 Node* proj = NULL; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2950 // Replace with just one |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2951 for (SimpleDUIterator i(p->in(0)); i.has_next(); i.next()) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2952 Node *use = i.get(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2953 if (use->is_Proj() && p != use && use->as_Proj()->_con == p->_con) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2954 proj = use; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2955 break; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2956 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2957 } |
4767 | 2958 assert(proj != NULL, "must be found"); |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2959 p->subsume_by(proj, this); |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2960 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2961 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2962 break; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2963 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
929
diff
changeset
|
2964 |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2965 case Op_Phi: |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
2966 if (n->as_Phi()->bottom_type()->isa_narrowoop() || n->as_Phi()->bottom_type()->isa_narrowklass()) { |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2967 // The EncodeP optimization may create Phi with the same edges |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2968 // for all paths. It is not handled well by Register Allocator. |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2969 Node* unique_in = n->in(1); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2970 assert(unique_in != NULL, ""); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2971 uint cnt = n->req(); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2972 for (uint i = 2; i < cnt; i++) { |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2973 Node* m = n->in(i); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2974 assert(m != NULL, ""); |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2975 if (unique_in != m) |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2976 unique_in = NULL; |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2977 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2978 if (unique_in != NULL) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2979 n->subsume_by(unique_in, this); |
368
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2980 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2981 } |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2982 break; |
36ccc817fca4
6747051: Improve code and implicit null check generation for compressed oops
kvn
parents:
367
diff
changeset
|
2983 |
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2984 #endif |
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
2985 |
0 | 2986 case Op_ModI: |
2987 if (UseDivMod) { | |
2988 // Check if a%b and a/b both exist | |
2989 Node* d = n->find_similar(Op_DivI); | |
2990 if (d) { | |
2991 // Replace them with a fused divmod if supported | |
2992 if (Matcher::has_match_rule(Op_DivModI)) { | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2993 DivModINode* divmod = DivModINode::make(this, n); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2994 d->subsume_by(divmod->div_proj(), this); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2995 n->subsume_by(divmod->mod_proj(), this); |
0 | 2996 } else { |
2997 // replace a%b with a-((a/b)*b) | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2998 Node* mult = new (this) MulINode(d, d->in(2)); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
2999 Node* sub = new (this) SubINode(d->in(1), mult); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3000 n->subsume_by(sub, this); |
0 | 3001 } |
3002 } | |
3003 } | |
3004 break; | |
3005 | |
3006 case Op_ModL: | |
3007 if (UseDivMod) { | |
3008 // Check if a%b and a/b both exist | |
3009 Node* d = n->find_similar(Op_DivL); | |
3010 if (d) { | |
3011 // Replace them with a fused divmod if supported | |
3012 if (Matcher::has_match_rule(Op_DivModL)) { | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3013 DivModLNode* divmod = DivModLNode::make(this, n); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3014 d->subsume_by(divmod->div_proj(), this); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3015 n->subsume_by(divmod->mod_proj(), this); |
0 | 3016 } else { |
3017 // replace a%b with a-((a/b)*b) | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3018 Node* mult = new (this) MulLNode(d, d->in(2)); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3019 Node* sub = new (this) SubLNode(d->in(1), mult); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3020 n->subsume_by(sub, this); |
0 | 3021 } |
3022 } | |
3023 } | |
3024 break; | |
3025 | |
6179
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
6143
diff
changeset
|
3026 case Op_LoadVector: |
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
6143
diff
changeset
|
3027 case Op_StoreVector: |
0 | 3028 break; |
3029 | |
3030 case Op_PackB: | |
3031 case Op_PackS: | |
3032 case Op_PackI: | |
3033 case Op_PackF: | |
3034 case Op_PackL: | |
3035 case Op_PackD: | |
3036 if (n->req()-1 > 2) { | |
3037 // Replace many operand PackNodes with a binary tree for matching | |
3038 PackNode* p = (PackNode*) n; | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3039 Node* btp = p->binary_tree_pack(this, 1, n->req()); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3040 n->subsume_by(btp, this); |
0 | 3041 } |
3042 break; | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3043 case Op_Loop: |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3044 case Op_CountedLoop: |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3045 if (n->as_Loop()->is_inner_loop()) { |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3046 frc.inc_inner_loop_count(); |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3047 } |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3048 break; |
2401
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3049 case Op_LShiftI: |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3050 case Op_RShiftI: |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3051 case Op_URShiftI: |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3052 case Op_LShiftL: |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3053 case Op_RShiftL: |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3054 case Op_URShiftL: |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3055 if (Matcher::need_masked_shift_count) { |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3056 // The cpu's shift instructions don't restrict the count to the |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3057 // lower 5/6 bits. We need to do the masking ourselves. |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3058 Node* in2 = n->in(2); |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3059 juint mask = (n->bottom_type() == TypeInt::INT) ? (BitsPerInt - 1) : (BitsPerLong - 1); |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3060 const TypeInt* t = in2->find_int_type(); |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3061 if (t != NULL && t->is_con()) { |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3062 juint shift = t->get_con(); |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3063 if (shift > mask) { // Unsigned cmp |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3064 n->set_req(2, ConNode::make(this, TypeInt::make(shift & mask))); |
2401
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3065 } |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3066 } else { |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3067 if (t == NULL || t->_lo < 0 || t->_hi > (int)mask) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3068 Node* shift = new (this) AndINode(in2, ConNode::make(this, TypeInt::make(mask))); |
2401
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3069 n->set_req(2, shift); |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3070 } |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3071 } |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3072 if (in2->outcnt() == 0) { // Remove dead node |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3073 in2->disconnect_inputs(NULL, this); |
2401
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3074 } |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3075 } |
7e88bdae86ec
7029017: Additional architecture support for c2 compiler
roland
parents:
2376
diff
changeset
|
3076 break; |
8694
8651f608fea4
8009460: C2compiler crash in machnode::in_regmask(unsigned int)
roland
parents:
8691
diff
changeset
|
3077 case Op_MemBarStoreStore: |
10278 | 3078 case Op_MemBarRelease: |
8694
8651f608fea4
8009460: C2compiler crash in machnode::in_regmask(unsigned int)
roland
parents:
8691
diff
changeset
|
3079 // Break the link with AllocateNode: it is no longer useful and |
8651f608fea4
8009460: C2compiler crash in machnode::in_regmask(unsigned int)
roland
parents:
8691
diff
changeset
|
3080 // confuses register allocation. |
8651f608fea4
8009460: C2compiler crash in machnode::in_regmask(unsigned int)
roland
parents:
8691
diff
changeset
|
3081 if (n->req() > MemBarNode::Precedent) { |
8651f608fea4
8009460: C2compiler crash in machnode::in_regmask(unsigned int)
roland
parents:
8691
diff
changeset
|
3082 n->set_req(MemBarNode::Precedent, top()); |
8651f608fea4
8009460: C2compiler crash in machnode::in_regmask(unsigned int)
roland
parents:
8691
diff
changeset
|
3083 } |
8651f608fea4
8009460: C2compiler crash in machnode::in_regmask(unsigned int)
roland
parents:
8691
diff
changeset
|
3084 break; |
0 | 3085 default: |
3086 assert( !n->is_Call(), "" ); | |
3087 assert( !n->is_Mem(), "" ); | |
3088 break; | |
3089 } | |
127 | 3090 |
3091 // Collect CFG split points | |
3092 if (n->is_MultiBranch()) | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3093 frc._tests.push(n); |
0 | 3094 } |
3095 | |
3096 //------------------------------final_graph_reshaping_walk--------------------- | |
3097 // Replacing Opaque nodes with their input in final_graph_reshaping_impl(), | |
3098 // requires that the walk visits a node's inputs before visiting the node. | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3099 void Compile::final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc ) { |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3100 ResourceArea *area = Thread::current()->resource_area(); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3101 Unique_Node_List sfpt(area); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3102 |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3103 frc._visited.set(root->_idx); // first, mark node as visited |
0 | 3104 uint cnt = root->req(); |
3105 Node *n = root; | |
3106 uint i = 0; | |
3107 while (true) { | |
3108 if (i < cnt) { | |
3109 // Place all non-visited non-null inputs onto stack | |
3110 Node* m = n->in(i); | |
3111 ++i; | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3112 if (m != NULL && !frc._visited.test_set(m->_idx)) { |
17980
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
3113 if (m->is_SafePoint() && m->as_SafePoint()->jvms() != NULL) { |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
3114 // compute worst case interpreter size in case of a deoptimization |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
3115 update_interpreter_frame_size(m->as_SafePoint()->jvms()->interpreter_frame_size()); |
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
3116 |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3117 sfpt.push(m); |
17980
0bf37f737702
8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
roland
parents:
17937
diff
changeset
|
3118 } |
0 | 3119 cnt = m->req(); |
3120 nstack.push(n, i); // put on stack parent and next input's index | |
3121 n = m; | |
3122 i = 0; | |
3123 } | |
3124 } else { | |
3125 // Now do post-visit work | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3126 final_graph_reshaping_impl( n, frc ); |
0 | 3127 if (nstack.is_empty()) |
3128 break; // finished | |
3129 n = nstack.node(); // Get node from stack | |
3130 cnt = n->req(); | |
3131 i = nstack.index(); | |
3132 nstack.pop(); // Shift to the next node on stack | |
3133 } | |
3134 } | |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3135 |
1575
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
3136 // Skip next transformation if compressed oops are not used. |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
3137 if ((UseCompressedOops && !Matcher::gen_narrow_oop_implicit_null_checks()) || |
12226
7944aba7ba41
8015107: NPG: Use consistent naming for metaspace concepts
ehelin
parents:
12167
diff
changeset
|
3138 (!UseCompressedOops && !UseCompressedClassPointers)) |
1575
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
3139 return; |
3657cb01ffc5
6954029: Improve implicit null check generation with compressed oops
kvn
parents:
1397
diff
changeset
|
3140 |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
3141 // Go over safepoints nodes to skip DecodeN/DecodeNKlass nodes for debug edges. |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3142 // It could be done for an uncommon traps or any safepoints/calls |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
3143 // if the DecodeN/DecodeNKlass node is referenced only in a debug info. |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3144 while (sfpt.size() > 0) { |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3145 n = sfpt.pop(); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3146 JVMState *jvms = n->as_SafePoint()->jvms(); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3147 assert(jvms != NULL, "sanity"); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3148 int start = jvms->debug_start(); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3149 int end = n->req(); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3150 bool is_uncommon = (n->is_CallStaticJava() && |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3151 n->as_CallStaticJava()->uncommon_trap_request() != 0); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3152 for (int j = start; j < end; j++) { |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3153 Node* in = n->in(j); |
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6843
diff
changeset
|
3154 if (in->is_DecodeNarrowPtr()) { |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3155 bool safe_to_skip = true; |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3156 if (!is_uncommon ) { |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3157 // Is it safe to skip? |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3158 for (uint i = 0; i < in->outcnt(); i++) { |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3159 Node* u = in->raw_out(i); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3160 if (!u->is_SafePoint() || |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3161 u->is_Call() && u->as_Call()->has_non_debug_use(n)) { |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3162 safe_to_skip = false; |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3163 } |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3164 } |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3165 } |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3166 if (safe_to_skip) { |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3167 n->set_req(j, in->in(1)); |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3168 } |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3169 if (in->outcnt() == 0) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3170 in->disconnect_inputs(NULL, this); |
331
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3171 } |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3172 } |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3173 } |
cecd8eb4e0ca
6706829: Compressed Oops: add debug info for narrow oops
kvn
parents:
293
diff
changeset
|
3174 } |
0 | 3175 } |
3176 | |
3177 //------------------------------final_graph_reshaping-------------------------- | |
3178 // Final Graph Reshaping. | |
3179 // | |
3180 // (1) Clone simple inputs to uncommon calls, so they can be scheduled late | |
3181 // and not commoned up and forced early. Must come after regular | |
3182 // optimizations to avoid GVN undoing the cloning. Clone constant | |
3183 // inputs to Loop Phis; these will be split by the allocator anyways. | |
3184 // Remove Opaque nodes. | |
3185 // (2) Move last-uses by commutative operations to the left input to encourage | |
3186 // Intel update-in-place two-address operations and better register usage | |
3187 // on RISCs. Must come after regular optimizations to avoid GVN Ideal | |
3188 // calls canonicalizing them back. | |
3189 // (3) Count the number of double-precision FP ops, single-precision FP ops | |
3190 // and call sites. On Intel, we can get correct rounding either by | |
3191 // forcing singles to memory (requires extra stores and loads after each | |
3192 // FP bytecode) or we can set a rounding mode bit (requires setting and | |
3193 // clearing the mode bit around call sites). The mode bit is only used | |
3194 // if the relative frequency of single FP ops to calls is low enough. | |
3195 // This is a key transform for SPEC mpeg_audio. | |
3196 // (4) Detect infinite loops; blobs of code reachable from above but not | |
3197 // below. Several of the Code_Gen algorithms fail on such code shapes, | |
3198 // so we simply bail out. Happens a lot in ZKM.jar, but also happens | |
3199 // from time to time in other codes (such as -Xcomp finalizer loops, etc). | |
3200 // Detection is by looking for IfNodes where only 1 projection is | |
3201 // reachable from below or CatchNodes missing some targets. | |
3202 // (5) Assert for insane oop offsets in debug mode. | |
3203 | |
3204 bool Compile::final_graph_reshaping() { | |
3205 // an infinite loop may have been eliminated by the optimizer, | |
3206 // in which case the graph will be empty. | |
3207 if (root()->req() == 1) { | |
3208 record_method_not_compilable("trivial infinite loop"); | |
3209 return true; | |
3210 } | |
3211 | |
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3212 // Expensive nodes have their control input set to prevent the GVN |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3213 // from freely commoning them. There's no GVN beyond this point so |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3214 // no need to keep the control input. We want the expensive nodes to |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3215 // be freely moved to the least frequent code path by gcm. |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3216 assert(OptimizeExpensiveOps || expensive_count() == 0, "optimization off but list non empty?"); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3217 for (int i = 0; i < expensive_count(); i++) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3218 _expensive_nodes->at(i)->set_req(0, NULL); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3219 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3220 |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3221 Final_Reshape_Counts frc; |
0 | 3222 |
3223 // Visit everybody reachable! | |
3224 // Allocate stack of size C->unique()/2 to avoid frequent realloc | |
3225 Node_Stack nstack(unique() >> 1); | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3226 final_graph_reshaping_walk(nstack, root(), frc); |
0 | 3227 |
3228 // Check for unreachable (from below) code (i.e., infinite loops). | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3229 for( uint i = 0; i < frc._tests.size(); i++ ) { |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3230 MultiBranchNode *n = frc._tests[i]->as_MultiBranch(); |
127 | 3231 // Get number of CFG targets. |
0 | 3232 // Note that PCTables include exception targets after calls. |
127 | 3233 uint required_outcnt = n->required_outcnt(); |
3234 if (n->outcnt() != required_outcnt) { | |
0 | 3235 // Check for a few special cases. Rethrow Nodes never take the |
3236 // 'fall-thru' path, so expected kids is 1 less. | |
3237 if (n->is_PCTable() && n->in(0) && n->in(0)->in(0)) { | |
3238 if (n->in(0)->in(0)->is_Call()) { | |
3239 CallNode *call = n->in(0)->in(0)->as_Call(); | |
3240 if (call->entry_point() == OptoRuntime::rethrow_stub()) { | |
127 | 3241 required_outcnt--; // Rethrow always has 1 less kid |
0 | 3242 } else if (call->req() > TypeFunc::Parms && |
3243 call->is_CallDynamicJava()) { | |
3244 // Check for null receiver. In such case, the optimizer has | |
3245 // detected that the virtual call will always result in a null | |
3246 // pointer exception. The fall-through projection of this CatchNode | |
3247 // will not be populated. | |
3248 Node *arg0 = call->in(TypeFunc::Parms); | |
3249 if (arg0->is_Type() && | |
3250 arg0->as_Type()->type()->higher_equal(TypePtr::NULL_PTR)) { | |
127 | 3251 required_outcnt--; |
0 | 3252 } |
3253 } else if (call->entry_point() == OptoRuntime::new_array_Java() && | |
3254 call->req() > TypeFunc::Parms+1 && | |
3255 call->is_CallStaticJava()) { | |
3256 // Check for negative array length. In such case, the optimizer has | |
3257 // detected that the allocation attempt will always result in an | |
3258 // exception. There is no fall-through projection of this CatchNode . | |
3259 Node *arg1 = call->in(TypeFunc::Parms+1); | |
3260 if (arg1->is_Type() && | |
3261 arg1->as_Type()->type()->join(TypeInt::POS)->empty()) { | |
127 | 3262 required_outcnt--; |
0 | 3263 } |
3264 } | |
3265 } | |
3266 } | |
127 | 3267 // Recheck with a better notion of 'required_outcnt' |
3268 if (n->outcnt() != required_outcnt) { | |
0 | 3269 record_method_not_compilable("malformed control flow"); |
3270 return true; // Not all targets reachable! | |
3271 } | |
3272 } | |
3273 // Check that I actually visited all kids. Unreached kids | |
3274 // must be infinite loops. | |
3275 for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3276 if (!frc._visited.test(n->fast_out(j)->_idx)) { |
0 | 3277 record_method_not_compilable("infinite loop"); |
3278 return true; // Found unvisited kid; must be unreach | |
3279 } | |
3280 } | |
3281 | |
3282 // If original bytecodes contained a mixture of floats and doubles | |
3283 // check if the optimizer has made it homogenous, item (3). | |
929
cd18bd5e667c
6873777: FPU control word optimization still performed with SSE
never
parents:
921
diff
changeset
|
3284 if( Use24BitFPMode && Use24BitFP && UseSSE == 0 && |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3285 frc.get_float_count() > 32 && |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3286 frc.get_double_count() == 0 && |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3287 (10 * frc.get_call_count() < frc.get_float_count()) ) { |
0 | 3288 set_24_bit_selection_and_mode( false, true ); |
3289 } | |
3290 | |
859
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3291 set_java_calls(frc.get_java_call_count()); |
ea3f9723b5cf
6860599: nodes limit could be reached during Output phase
kvn
parents:
856
diff
changeset
|
3292 set_inner_loops(frc.get_inner_loop_count()); |
0 | 3293 |
3294 // No infinite loops, no reason to bail out. | |
3295 return false; | |
3296 } | |
3297 | |
3298 //-----------------------------too_many_traps---------------------------------- | |
3299 // Report if there are too many traps at the current method and bci. | |
3300 // Return true if there was a trap, and/or PerMethodTrapLimit is exceeded. | |
3301 bool Compile::too_many_traps(ciMethod* method, | |
3302 int bci, | |
3303 Deoptimization::DeoptReason reason) { | |
3304 ciMethodData* md = method->method_data(); | |
3305 if (md->is_empty()) { | |
3306 // Assume the trap has not occurred, or that it occurred only | |
3307 // because of a transient condition during start-up in the interpreter. | |
3308 return false; | |
3309 } | |
17728
b8413a9cbb84
8031752: Failed speculative optimizations should be reattempted when root of compilation is different
roland
parents:
17726
diff
changeset
|
3310 ciMethod* m = Deoptimization::reason_is_speculate(reason) ? this->method() : NULL; |
b8413a9cbb84
8031752: Failed speculative optimizations should be reattempted when root of compilation is different
roland
parents:
17726
diff
changeset
|
3311 if (md->has_trap_at(bci, m, reason) != 0) { |
0 | 3312 // Assume PerBytecodeTrapLimit==0, for a more conservative heuristic. |
3313 // Also, if there are multiple reasons, or if there is no per-BCI record, | |
3314 // assume the worst. | |
3315 if (log()) | |
3316 log()->elem("observe trap='%s' count='%d'", | |
3317 Deoptimization::trap_reason_name(reason), | |
3318 md->trap_count(reason)); | |
3319 return true; | |
3320 } else { | |
3321 // Ignore method/bci and see if there have been too many globally. | |
3322 return too_many_traps(reason, md); | |
3323 } | |
3324 } | |
3325 | |
3326 // Less-accurate variant which does not require a method and bci. | |
3327 bool Compile::too_many_traps(Deoptimization::DeoptReason reason, | |
3328 ciMethodData* logmd) { | |
17728
b8413a9cbb84
8031752: Failed speculative optimizations should be reattempted when root of compilation is different
roland
parents:
17726
diff
changeset
|
3329 if (trap_count(reason) >= Deoptimization::per_method_trap_limit(reason)) { |
0 | 3330 // Too many traps globally. |
3331 // Note that we use cumulative trap_count, not just md->trap_count. | |
3332 if (log()) { | |
3333 int mcount = (logmd == NULL)? -1: (int)logmd->trap_count(reason); | |
3334 log()->elem("observe trap='%s' count='0' mcount='%d' ccount='%d'", | |
3335 Deoptimization::trap_reason_name(reason), | |
3336 mcount, trap_count(reason)); | |
3337 } | |
3338 return true; | |
3339 } else { | |
3340 // The coast is clear. | |
3341 return false; | |
3342 } | |
3343 } | |
3344 | |
3345 //--------------------------too_many_recompiles-------------------------------- | |
3346 // Report if there are too many recompiles at the current method and bci. | |
3347 // Consults PerBytecodeRecompilationCutoff and PerMethodRecompilationCutoff. | |
3348 // Is not eager to return true, since this will cause the compiler to use | |
3349 // Action_none for a trap point, to avoid too many recompilations. | |
3350 bool Compile::too_many_recompiles(ciMethod* method, | |
3351 int bci, | |
3352 Deoptimization::DeoptReason reason) { | |
3353 ciMethodData* md = method->method_data(); | |
3354 if (md->is_empty()) { | |
3355 // Assume the trap has not occurred, or that it occurred only | |
3356 // because of a transient condition during start-up in the interpreter. | |
3357 return false; | |
3358 } | |
3359 // Pick a cutoff point well within PerBytecodeRecompilationCutoff. | |
3360 uint bc_cutoff = (uint) PerBytecodeRecompilationCutoff / 8; | |
3361 uint m_cutoff = (uint) PerMethodRecompilationCutoff / 2 + 1; // not zero | |
3362 Deoptimization::DeoptReason per_bc_reason | |
3363 = Deoptimization::reason_recorded_per_bytecode_if_any(reason); | |
17728
b8413a9cbb84
8031752: Failed speculative optimizations should be reattempted when root of compilation is different
roland
parents:
17726
diff
changeset
|
3364 ciMethod* m = Deoptimization::reason_is_speculate(reason) ? this->method() : NULL; |
0 | 3365 if ((per_bc_reason == Deoptimization::Reason_none |
17728
b8413a9cbb84
8031752: Failed speculative optimizations should be reattempted when root of compilation is different
roland
parents:
17726
diff
changeset
|
3366 || md->has_trap_at(bci, m, reason) != 0) |
0 | 3367 // The trap frequency measure we care about is the recompile count: |
17728
b8413a9cbb84
8031752: Failed speculative optimizations should be reattempted when root of compilation is different
roland
parents:
17726
diff
changeset
|
3368 && md->trap_recompiled_at(bci, m) |
0 | 3369 && md->overflow_recompile_count() >= bc_cutoff) { |
3370 // Do not emit a trap here if it has already caused recompilations. | |
3371 // Also, if there are multiple reasons, or if there is no per-BCI record, | |
3372 // assume the worst. | |
3373 if (log()) | |
3374 log()->elem("observe trap='%s recompiled' count='%d' recompiles2='%d'", | |
3375 Deoptimization::trap_reason_name(reason), | |
3376 md->trap_count(reason), | |
3377 md->overflow_recompile_count()); | |
3378 return true; | |
3379 } else if (trap_count(reason) != 0 | |
3380 && decompile_count() >= m_cutoff) { | |
3381 // Too many recompiles globally, and we have seen this sort of trap. | |
3382 // Use cumulative decompile_count, not just md->decompile_count. | |
3383 if (log()) | |
3384 log()->elem("observe trap='%s' count='%d' mcount='%d' decompiles='%d' mdecompiles='%d'", | |
3385 Deoptimization::trap_reason_name(reason), | |
3386 md->trap_count(reason), trap_count(reason), | |
3387 md->decompile_count(), decompile_count()); | |
3388 return true; | |
3389 } else { | |
3390 // The coast is clear. | |
3391 return false; | |
3392 } | |
3393 } | |
3394 | |
14440
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3395 // Compute when not to trap. Used by matching trap based nodes and |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3396 // NullCheck optimization. |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3397 void Compile::set_allowed_deopt_reasons() { |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3398 _allowed_reasons = 0; |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3399 if (is_method_compilation()) { |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3400 for (int rs = (int)Deoptimization::Reason_none+1; rs < Compile::trapHistLength; rs++) { |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3401 assert(rs < BitsPerInt, "recode bit map"); |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3402 if (!too_many_traps((Deoptimization::DeoptReason) rs)) { |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3403 _allowed_reasons |= nth_bit(rs); |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3404 } |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3405 } |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3406 } |
41b780b43b74
8029015: PPC64 (part 216): opto: trap based null and range checks
goetz
parents:
14438
diff
changeset
|
3407 } |
0 | 3408 |
3409 #ifndef PRODUCT | |
3410 //------------------------------verify_graph_edges--------------------------- | |
3411 // Walk the Graph and verify that there is a one-to-one correspondence | |
3412 // between Use-Def edges and Def-Use edges in the graph. | |
3413 void Compile::verify_graph_edges(bool no_dead_code) { | |
3414 if (VerifyGraphEdges) { | |
3415 ResourceArea *area = Thread::current()->resource_area(); | |
3416 Unique_Node_List visited(area); | |
3417 // Call recursive graph walk to check edges | |
3418 _root->verify_edges(visited); | |
3419 if (no_dead_code) { | |
3420 // Now make sure that no visited node is used by an unvisited node. | |
3421 bool dead_nodes = 0; | |
3422 Unique_Node_List checked(area); | |
3423 while (visited.size() > 0) { | |
3424 Node* n = visited.pop(); | |
3425 checked.push(n); | |
3426 for (uint i = 0; i < n->outcnt(); i++) { | |
3427 Node* use = n->raw_out(i); | |
3428 if (checked.member(use)) continue; // already checked | |
3429 if (visited.member(use)) continue; // already in the graph | |
3430 if (use->is_Con()) continue; // a dead ConNode is OK | |
3431 // At this point, we have found a dead node which is DU-reachable. | |
3432 if (dead_nodes++ == 0) | |
3433 tty->print_cr("*** Dead nodes reachable via DU edges:"); | |
3434 use->dump(2); | |
3435 tty->print_cr("---"); | |
3436 checked.push(use); // No repeats; pretend it is now checked. | |
3437 } | |
3438 } | |
3439 assert(dead_nodes == 0, "using nodes must be reachable from root"); | |
3440 } | |
3441 } | |
3442 } | |
13045
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3443 |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3444 // Verify GC barriers consistency |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3445 // Currently supported: |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3446 // - G1 pre-barriers (see GraphKit::g1_write_barrier_pre()) |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3447 void Compile::verify_barriers() { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3448 if (UseG1GC) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3449 // Verify G1 pre-barriers |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3450 const int marking_offset = in_bytes(JavaThread::satb_mark_queue_offset() + PtrQueue::byte_offset_of_active()); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3451 |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3452 ResourceArea *area = Thread::current()->resource_area(); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3453 Unique_Node_List visited(area); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3454 Node_List worklist(area); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3455 // We're going to walk control flow backwards starting from the Root |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3456 worklist.push(_root); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3457 while (worklist.size() > 0) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3458 Node* x = worklist.pop(); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3459 if (x == NULL || x == top()) continue; |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3460 if (visited.member(x)) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3461 continue; |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3462 } else { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3463 visited.push(x); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3464 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3465 |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3466 if (x->is_Region()) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3467 for (uint i = 1; i < x->req(); i++) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3468 worklist.push(x->in(i)); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3469 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3470 } else { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3471 worklist.push(x->in(0)); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3472 // We are looking for the pattern: |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3473 // /->ThreadLocal |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3474 // If->Bool->CmpI->LoadB->AddP->ConL(marking_offset) |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3475 // \->ConI(0) |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3476 // We want to verify that the If and the LoadB have the same control |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3477 // See GraphKit::g1_write_barrier_pre() |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3478 if (x->is_If()) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3479 IfNode *iff = x->as_If(); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3480 if (iff->in(1)->is_Bool() && iff->in(1)->in(1)->is_Cmp()) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3481 CmpNode *cmp = iff->in(1)->in(1)->as_Cmp(); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3482 if (cmp->Opcode() == Op_CmpI && cmp->in(2)->is_Con() && cmp->in(2)->bottom_type()->is_int()->get_con() == 0 |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3483 && cmp->in(1)->is_Load()) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3484 LoadNode* load = cmp->in(1)->as_Load(); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3485 if (load->Opcode() == Op_LoadB && load->in(2)->is_AddP() && load->in(2)->in(2)->Opcode() == Op_ThreadLocal |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3486 && load->in(2)->in(3)->is_Con() |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3487 && load->in(2)->in(3)->bottom_type()->is_intptr_t()->get_con() == marking_offset) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3488 |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3489 Node* if_ctrl = iff->in(0); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3490 Node* load_ctrl = load->in(0); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3491 |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3492 if (if_ctrl != load_ctrl) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3493 // Skip possible CProj->NeverBranch in infinite loops |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3494 if ((if_ctrl->is_Proj() && if_ctrl->Opcode() == Op_CProj) |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3495 && (if_ctrl->in(0)->is_MultiBranch() && if_ctrl->in(0)->Opcode() == Op_NeverBranch)) { |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3496 if_ctrl = if_ctrl->in(0)->in(0); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3497 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3498 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3499 assert(load_ctrl != NULL && if_ctrl == load_ctrl, "controls must match"); |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3500 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3501 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3502 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3503 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3504 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3505 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3506 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3507 } |
94a83e0f9ce1
8017065: C2 allows safepoint checks to leak into G1 pre-barriers
iveresov
parents:
12966
diff
changeset
|
3508 |
0 | 3509 #endif |
3510 | |
3511 // The Compile object keeps track of failure reasons separately from the ciEnv. | |
3512 // This is required because there is not quite a 1-1 relation between the | |
3513 // ciEnv and its compilation task and the Compile object. Note that one | |
3514 // ciEnv might use two Compile objects, if C2Compiler::compile_method decides | |
3515 // to backtrack and retry without subsuming loads. Other than this backtracking | |
3516 // behavior, the Compile's failure reason is quietly copied up to the ciEnv | |
3517 // by the logic in C2Compiler. | |
3518 void Compile::record_failure(const char* reason) { | |
3519 if (log() != NULL) { | |
3520 log()->elem("failure reason='%s' phase='compile'", reason); | |
3521 } | |
3522 if (_failure_reason == NULL) { | |
3523 // Record the first failure reason. | |
3524 _failure_reason = reason; | |
3525 } | |
10405 | 3526 |
3527 EventCompilerFailure event; | |
3528 if (event.should_commit()) { | |
3529 event.set_compileID(Compile::compile_id()); | |
3530 event.set_failure(reason); | |
3531 event.commit(); | |
3532 } | |
3533 | |
222 | 3534 if (!C->failure_reason_is(C2Compiler::retry_no_subsuming_loads())) { |
10405 | 3535 C->print_method(PHASE_FAILURE); |
222 | 3536 } |
0 | 3537 _root = NULL; // flush the graph, too |
3538 } | |
3539 | |
3540 Compile::TracePhase::TracePhase(const char* name, elapsedTimer* accumulator, bool dolog) | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3541 : TraceTime(NULL, accumulator, false NOT_PRODUCT( || TimeCompiler ), false), |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3542 _phase_name(name), _dolog(dolog) |
0 | 3543 { |
3544 if (dolog) { | |
3545 C = Compile::current(); | |
3546 _log = C->log(); | |
3547 } else { | |
3548 C = NULL; | |
3549 _log = NULL; | |
3550 } | |
3551 if (_log != NULL) { | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3552 _log->begin_head("phase name='%s' nodes='%d' live='%d'", _phase_name, C->unique(), C->live_nodes()); |
0 | 3553 _log->stamp(); |
3554 _log->end_head(); | |
3555 } | |
3556 } | |
3557 | |
3558 Compile::TracePhase::~TracePhase() { | |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3559 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3560 C = Compile::current(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3561 if (_dolog) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3562 _log = C->log(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3563 } else { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3564 _log = NULL; |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3565 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3566 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3567 #ifdef ASSERT |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3568 if (PrintIdealNodeCount) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3569 tty->print_cr("phase name='%s' nodes='%d' live='%d' live_graph_walk='%d'", |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3570 _phase_name, C->unique(), C->live_nodes(), C->count_live_nodes_by_graph_walk()); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3571 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3572 |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3573 if (VerifyIdealNodeCount) { |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3574 Compile::current()->print_missing_nodes(); |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3575 } |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3576 #endif |
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3577 |
0 | 3578 if (_log != NULL) { |
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6888
diff
changeset
|
3579 _log->done("phase name='%s' nodes='%d' live='%d'", _phase_name, C->unique(), C->live_nodes()); |
0 | 3580 } |
3581 } | |
2008 | 3582 |
3583 //============================================================================= | |
3584 // Two Constant's are equal when the type and the value are equal. | |
3585 bool Compile::Constant::operator==(const Constant& other) { | |
3586 if (type() != other.type() ) return false; | |
3587 if (can_be_reused() != other.can_be_reused()) return false; | |
3588 // For floating point values we compare the bit pattern. | |
3589 switch (type()) { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3590 case T_FLOAT: return (_v._value.i == other._v._value.i); |
2008 | 3591 case T_LONG: |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3592 case T_DOUBLE: return (_v._value.j == other._v._value.j); |
2008 | 3593 case T_OBJECT: |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3594 case T_ADDRESS: return (_v._value.l == other._v._value.l); |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3595 case T_VOID: return (_v._value.l == other._v._value.l); // jump-table entries |
6888
cfe522e6461c
8000623: tools/javac/Diagnostics/6769027/T6769027.java crashes in PSPromotionManager::copy_to_survivor_space
kvn
parents:
6849
diff
changeset
|
3596 case T_METADATA: return (_v._metadata == other._v._metadata); |
2008 | 3597 default: ShouldNotReachHere(); |
3598 } | |
3599 return false; | |
3600 } | |
3601 | |
3602 static int type_to_size_in_bytes(BasicType t) { | |
3603 switch (t) { | |
3604 case T_LONG: return sizeof(jlong ); | |
3605 case T_FLOAT: return sizeof(jfloat ); | |
3606 case T_DOUBLE: return sizeof(jdouble); | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3607 case T_METADATA: return sizeof(Metadata*); |
2008 | 3608 // We use T_VOID as marker for jump-table entries (labels) which |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3609 // need an internal word relocation. |
2008 | 3610 case T_VOID: |
3611 case T_ADDRESS: | |
3612 case T_OBJECT: return sizeof(jobject); | |
3613 } | |
3614 | |
3615 ShouldNotReachHere(); | |
3616 return -1; | |
3617 } | |
3618 | |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3619 int Compile::ConstantTable::qsort_comparator(Constant* a, Constant* b) { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3620 // sort descending |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3621 if (a->freq() > b->freq()) return -1; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3622 if (a->freq() < b->freq()) return 1; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3623 return 0; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3624 } |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3625 |
2008 | 3626 void Compile::ConstantTable::calculate_offsets_and_size() { |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3627 // First, sort the array by frequencies. |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3628 _constants.sort(qsort_comparator); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3629 |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3630 #ifdef ASSERT |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3631 // Make sure all jump-table entries were sorted to the end of the |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3632 // array (they have a negative frequency). |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3633 bool found_void = false; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3634 for (int i = 0; i < _constants.length(); i++) { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3635 Constant con = _constants.at(i); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3636 if (con.type() == T_VOID) |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3637 found_void = true; // jump-tables |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3638 else |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3639 assert(!found_void, "wrong sorting"); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3640 } |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3641 #endif |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3642 |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3643 int offset = 0; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3644 for (int i = 0; i < _constants.length(); i++) { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3645 Constant* con = _constants.adr_at(i); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3646 |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3647 // Align offset for type. |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3648 int typesize = type_to_size_in_bytes(con->type()); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3649 offset = align_size_up(offset, typesize); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3650 con->set_offset(offset); // set constant's offset |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3651 |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3652 if (con->type() == T_VOID) { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3653 MachConstantNode* n = (MachConstantNode*) con->get_jobject(); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3654 offset = offset + typesize * n->outcnt(); // expand jump-table |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3655 } else { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3656 offset = offset + typesize; |
2008 | 3657 } |
3658 } | |
3659 | |
3660 // Align size up to the next section start (which is insts; see | |
3661 // CodeBuffer::align_at_start). | |
3662 assert(_size == -1, "already set?"); | |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3663 _size = align_size_up(offset, CodeEntryAlignment); |
2008 | 3664 } |
3665 | |
3666 void Compile::ConstantTable::emit(CodeBuffer& cb) { | |
3667 MacroAssembler _masm(&cb); | |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3668 for (int i = 0; i < _constants.length(); i++) { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3669 Constant con = _constants.at(i); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3670 address constant_addr; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3671 switch (con.type()) { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3672 case T_LONG: constant_addr = _masm.long_constant( con.get_jlong() ); break; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3673 case T_FLOAT: constant_addr = _masm.float_constant( con.get_jfloat() ); break; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3674 case T_DOUBLE: constant_addr = _masm.double_constant(con.get_jdouble()); break; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3675 case T_OBJECT: { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3676 jobject obj = con.get_jobject(); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3677 int oop_index = _masm.oop_recorder()->find_index(obj); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3678 constant_addr = _masm.address_constant((address) obj, oop_Relocation::spec(oop_index)); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3679 break; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3680 } |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3681 case T_ADDRESS: { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3682 address addr = (address) con.get_jobject(); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3683 constant_addr = _masm.address_constant(addr); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3684 break; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3685 } |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3686 // We use T_VOID as marker for jump-table entries (labels) which |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3687 // need an internal word relocation. |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3688 case T_VOID: { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3689 MachConstantNode* n = (MachConstantNode*) con.get_jobject(); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3690 // Fill the jump-table with a dummy word. The real value is |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3691 // filled in later in fill_jump_table. |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3692 address dummy = (address) n; |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3693 constant_addr = _masm.address_constant(dummy); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3694 // Expand jump-table |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3695 for (uint i = 1; i < n->outcnt(); i++) { |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3696 address temp_addr = _masm.address_constant(dummy + i); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3697 assert(temp_addr, "consts section too small"); |
2008 | 3698 } |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3699 break; |
2008 | 3700 } |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3701 case T_METADATA: { |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3702 Metadata* obj = con.get_metadata(); |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3703 int metadata_index = _masm.oop_recorder()->find_index(obj); |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3704 constant_addr = _masm.address_constant((address) obj, metadata_Relocation::spec(metadata_index)); |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3705 break; |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3706 } |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3707 default: ShouldNotReachHere(); |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3708 } |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3709 assert(constant_addr, "consts section too small"); |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17914
diff
changeset
|
3710 assert((constant_addr - _masm.code()->consts()->start()) == con.offset(), |
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17914
diff
changeset
|
3711 err_msg_res("must be: %d == %d", (int) (constant_addr - _masm.code()->consts()->start()), (int)(con.offset()))); |
2008 | 3712 } |
3713 } | |
3714 | |
3715 int Compile::ConstantTable::find_offset(Constant& con) const { | |
3716 int idx = _constants.find(con); | |
3717 assert(idx != -1, "constant must be in constant table"); | |
3718 int offset = _constants.at(idx).offset(); | |
3719 assert(offset != -1, "constant table not emitted yet?"); | |
3720 return offset; | |
3721 } | |
3722 | |
3723 void Compile::ConstantTable::add(Constant& con) { | |
3724 if (con.can_be_reused()) { | |
3725 int idx = _constants.find(con); | |
3726 if (idx != -1 && _constants.at(idx).can_be_reused()) { | |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3727 _constants.adr_at(idx)->inc_freq(con.freq()); // increase the frequency by the current value |
2008 | 3728 return; |
3729 } | |
3730 } | |
3731 (void) _constants.append(con); | |
3732 } | |
3733 | |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3734 Compile::Constant Compile::ConstantTable::add(MachConstantNode* n, BasicType type, jvalue value) { |
12023
d1034bd8cefc
8022284: Hide internal data structure in PhaseCFG
adlertz
parents:
10405
diff
changeset
|
3735 Block* b = Compile::current()->cfg()->get_block_for_node(n); |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3736 Constant con(type, value, b->_freq); |
2008 | 3737 add(con); |
3738 return con; | |
3739 } | |
3740 | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3741 Compile::Constant Compile::ConstantTable::add(Metadata* metadata) { |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3742 Constant con(metadata); |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3743 add(con); |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3744 return con; |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3745 } |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3746 |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3747 Compile::Constant Compile::ConstantTable::add(MachConstantNode* n, MachOper* oper) { |
2008 | 3748 jvalue value; |
3749 BasicType type = oper->type()->basic_type(); | |
3750 switch (type) { | |
3751 case T_LONG: value.j = oper->constantL(); break; | |
3752 case T_FLOAT: value.f = oper->constantF(); break; | |
3753 case T_DOUBLE: value.d = oper->constantD(); break; | |
3754 case T_OBJECT: | |
3755 case T_ADDRESS: value.l = (jobject) oper->constant(); break; | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3756 case T_METADATA: return add((Metadata*)oper->constant()); break; |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6619
diff
changeset
|
3757 default: guarantee(false, err_msg_res("unhandled type: %s", type2name(type))); |
2008 | 3758 } |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3759 return add(n, type, value); |
2008 | 3760 } |
3761 | |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3762 Compile::Constant Compile::ConstantTable::add_jump_table(MachConstantNode* n) { |
2008 | 3763 jvalue value; |
3764 // We can use the node pointer here to identify the right jump-table | |
3765 // as this method is called from Compile::Fill_buffer right before | |
3766 // the MachNodes are emitted and the jump-table is filled (means the | |
3767 // MachNode pointers do not change anymore). | |
3768 value.l = (jobject) n; | |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3769 Constant con(T_VOID, value, next_jump_table_freq(), false); // Labels of a jump-table cannot be reused. |
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3770 add(con); |
2008 | 3771 return con; |
3772 } | |
3773 | |
3774 void Compile::ConstantTable::fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const { | |
3775 // If called from Compile::scratch_emit_size do nothing. | |
3776 if (Compile::current()->in_scratch_emit_size()) return; | |
3777 | |
3778 assert(labels.is_nonempty(), "must be"); | |
6268
6c5b7a6becc8
7187454: stack overflow in C2 compiler thread on Solaris x86
kvn
parents:
6179
diff
changeset
|
3779 assert((uint) labels.length() == n->outcnt(), err_msg_res("must be equal: %d == %d", labels.length(), n->outcnt())); |
2008 | 3780 |
3781 // Since MachConstantNode::constant_offset() also contains | |
3782 // table_base_offset() we need to subtract the table_base_offset() | |
3783 // to get the plain offset into the constant table. | |
3784 int offset = n->constant_offset() - table_base_offset(); | |
3785 | |
3786 MacroAssembler _masm(&cb); | |
3787 address* jump_table_base = (address*) (_masm.code()->consts()->start() + offset); | |
3788 | |
4114
6729bbc1fcd6
7003454: order constants in constant table by number of references in code
twisti
parents:
4064
diff
changeset
|
3789 for (uint i = 0; i < n->outcnt(); i++) { |
2008 | 3790 address* constant_addr = &jump_table_base[i]; |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17914
diff
changeset
|
3791 assert(*constant_addr == (((address) n) + i), err_msg_res("all jump-table entries must contain adjusted node pointer: " INTPTR_FORMAT " == " INTPTR_FORMAT, p2i(*constant_addr), p2i(((address) n) + i))); |
2008 | 3792 *constant_addr = cb.consts()->target(*labels.at(i), (address) constant_addr); |
3793 cb.consts()->relocate((address) constant_addr, relocInfo::internal_word_type); | |
3794 } | |
3795 } | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
3796 |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
3797 void Compile::dump_inlining() { |
12295 | 3798 if (print_inlining() || print_intrinsics()) { |
7473 | 3799 // Print inlining message for candidates that we couldn't inline |
3800 // for lack of space or non constant receiver | |
3801 for (int i = 0; i < _late_inlines.length(); i++) { | |
3802 CallGenerator* cg = _late_inlines.at(i); | |
3803 cg->print_inlining_late("live nodes > LiveNodeCountInliningCutoff"); | |
3804 } | |
3805 Unique_Node_List useful; | |
3806 useful.push(root()); | |
3807 for (uint next = 0; next < useful.size(); ++next) { | |
3808 Node* n = useful.at(next); | |
3809 if (n->is_Call() && n->as_Call()->generator() != NULL && n->as_Call()->generator()->call_node() == n) { | |
3810 CallNode* call = n->as_Call(); | |
3811 CallGenerator* cg = call->generator(); | |
3812 cg->print_inlining_late("receiver not constant"); | |
3813 } | |
3814 uint max = n->len(); | |
3815 for ( uint i = 0; i < max; ++i ) { | |
3816 Node *m = n->in(i); | |
3817 if ( m == NULL ) continue; | |
3818 useful.push(m); | |
3819 } | |
3820 } | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
3821 for (int i = 0; i < _print_inlining_list->length(); i++) { |
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17914
diff
changeset
|
3822 tty->print("%s", _print_inlining_list->adr_at(i)->ss()->as_string()); |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
3823 } |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
3824 } |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7199
diff
changeset
|
3825 } |
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3826 |
14232 | 3827 // Dump inlining replay data to the stream. |
3828 // Don't change thread state and acquire any locks. | |
3829 void Compile::dump_inline_data(outputStream* out) { | |
3830 InlineTree* inl_tree = ilt(); | |
3831 if (inl_tree != NULL) { | |
3832 out->print(" inline %d", inl_tree->count()); | |
3833 inl_tree->dump_replay_data(out); | |
3834 } | |
3835 } | |
3836 | |
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3837 int Compile::cmp_expensive_nodes(Node* n1, Node* n2) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3838 if (n1->Opcode() < n2->Opcode()) return -1; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3839 else if (n1->Opcode() > n2->Opcode()) return 1; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3840 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3841 assert(n1->req() == n2->req(), err_msg_res("can't compare %s nodes: n1->req() = %d, n2->req() = %d", NodeClassNames[n1->Opcode()], n1->req(), n2->req())); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3842 for (uint i = 1; i < n1->req(); i++) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3843 if (n1->in(i) < n2->in(i)) return -1; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3844 else if (n1->in(i) > n2->in(i)) return 1; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3845 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3846 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3847 return 0; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3848 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3849 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3850 int Compile::cmp_expensive_nodes(Node** n1p, Node** n2p) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3851 Node* n1 = *n1p; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3852 Node* n2 = *n2p; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3853 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3854 return cmp_expensive_nodes(n1, n2); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3855 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3856 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3857 void Compile::sort_expensive_nodes() { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3858 if (!expensive_nodes_sorted()) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3859 _expensive_nodes->sort(cmp_expensive_nodes); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3860 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3861 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3862 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3863 bool Compile::expensive_nodes_sorted() const { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3864 for (int i = 1; i < _expensive_nodes->length(); i++) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3865 if (cmp_expensive_nodes(_expensive_nodes->adr_at(i), _expensive_nodes->adr_at(i-1)) < 0) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3866 return false; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3867 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3868 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3869 return true; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3870 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3871 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3872 bool Compile::should_optimize_expensive_nodes(PhaseIterGVN &igvn) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3873 if (_expensive_nodes->length() == 0) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3874 return false; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3875 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3876 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3877 assert(OptimizeExpensiveOps, "optimization off?"); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3878 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3879 // Take this opportunity to remove dead nodes from the list |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3880 int j = 0; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3881 for (int i = 0; i < _expensive_nodes->length(); i++) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3882 Node* n = _expensive_nodes->at(i); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3883 if (!n->is_unreachable(igvn)) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3884 assert(n->is_expensive(), "should be expensive"); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3885 _expensive_nodes->at_put(j, n); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3886 j++; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3887 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3888 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3889 _expensive_nodes->trunc_to(j); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3890 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3891 // Then sort the list so that similar nodes are next to each other |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3892 // and check for at least two nodes of identical kind with same data |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3893 // inputs. |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3894 sort_expensive_nodes(); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3895 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3896 for (int i = 0; i < _expensive_nodes->length()-1; i++) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3897 if (cmp_expensive_nodes(_expensive_nodes->adr_at(i), _expensive_nodes->adr_at(i+1)) == 0) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3898 return true; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3899 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3900 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3901 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3902 return false; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3903 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3904 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3905 void Compile::cleanup_expensive_nodes(PhaseIterGVN &igvn) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3906 if (_expensive_nodes->length() == 0) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3907 return; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3908 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3909 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3910 assert(OptimizeExpensiveOps, "optimization off?"); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3911 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3912 // Sort to bring similar nodes next to each other and clear the |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3913 // control input of nodes for which there's only a single copy. |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3914 sort_expensive_nodes(); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3915 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3916 int j = 0; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3917 int identical = 0; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3918 int i = 0; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3919 for (; i < _expensive_nodes->length()-1; i++) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3920 assert(j <= i, "can't write beyond current index"); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3921 if (_expensive_nodes->at(i)->Opcode() == _expensive_nodes->at(i+1)->Opcode()) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3922 identical++; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3923 _expensive_nodes->at_put(j++, _expensive_nodes->at(i)); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3924 continue; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3925 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3926 if (identical > 0) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3927 _expensive_nodes->at_put(j++, _expensive_nodes->at(i)); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3928 identical = 0; |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3929 } else { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3930 Node* n = _expensive_nodes->at(i); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3931 igvn.hash_delete(n); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3932 n->set_req(0, NULL); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3933 igvn.hash_insert(n); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3934 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3935 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3936 if (identical > 0) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3937 _expensive_nodes->at_put(j++, _expensive_nodes->at(i)); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3938 } else if (_expensive_nodes->length() >= 1) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3939 Node* n = _expensive_nodes->at(i); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3940 igvn.hash_delete(n); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3941 n->set_req(0, NULL); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3942 igvn.hash_insert(n); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3943 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3944 _expensive_nodes->trunc_to(j); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3945 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3946 |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3947 void Compile::add_expensive_node(Node * n) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3948 assert(!_expensive_nodes->contains(n), "duplicate entry in expensive list"); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3949 assert(n->is_expensive(), "expensive nodes with non-null control here only"); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3950 assert(!n->is_CFG() && !n->is_Mem(), "no cfg or memory nodes here"); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3951 if (OptimizeExpensiveOps) { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3952 _expensive_nodes->append(n); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3953 } else { |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3954 // Clear control input and let IGVN optimize expensive nodes if |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3955 // OptimizeExpensiveOps is off. |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3956 n->set_req(0, NULL); |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3957 } |
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7605
diff
changeset
|
3958 } |
8691
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
3959 |
12966 | 3960 /** |
3961 * Remove the speculative part of types and clean up the graph | |
3962 */ | |
3963 void Compile::remove_speculative_types(PhaseIterGVN &igvn) { | |
3964 if (UseTypeSpeculation) { | |
3965 Unique_Node_List worklist; | |
3966 worklist.push(root()); | |
3967 int modified = 0; | |
3968 // Go over all type nodes that carry a speculative type, drop the | |
3969 // speculative part of the type and enqueue the node for an igvn | |
3970 // which may optimize it out. | |
3971 for (uint next = 0; next < worklist.size(); ++next) { | |
3972 Node *n = worklist.at(next); | |
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3973 if (n->is_Type()) { |
12966 | 3974 TypeNode* tn = n->as_Type(); |
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3975 const Type* t = tn->type(); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3976 const Type* t_no_spec = t->remove_speculative(); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3977 if (t_no_spec != t) { |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3978 bool in_hash = igvn.hash_delete(n); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3979 assert(in_hash, "node should be in igvn hash table"); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3980 tn->set_type(t_no_spec); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3981 igvn.hash_insert(n); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3982 igvn._worklist.push(n); // give it a chance to go away |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3983 modified++; |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3984 } |
12966 | 3985 } |
3986 uint max = n->len(); | |
3987 for( uint i = 0; i < max; ++i ) { | |
3988 Node *m = n->in(i); | |
3989 if (not_a_node(m)) continue; | |
3990 worklist.push(m); | |
3991 } | |
3992 } | |
3993 // Drop the speculative part of all types in the igvn's type table | |
3994 igvn.remove_speculative_types(); | |
3995 if (modified > 0) { | |
3996 igvn.optimize(); | |
3997 } | |
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3998 #ifdef ASSERT |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
3999 // Verify that after the IGVN is over no speculative type has resurfaced |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4000 worklist.clear(); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4001 worklist.push(root()); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4002 for (uint next = 0; next < worklist.size(); ++next) { |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4003 Node *n = worklist.at(next); |
17895
31e28ee4c9b4
8038921: assert(t != NULL) failed: must set before get
anoll
parents:
17810
diff
changeset
|
4004 const Type* t = igvn.type_or_null(n); |
31e28ee4c9b4
8038921: assert(t != NULL) failed: must set before get
anoll
parents:
17810
diff
changeset
|
4005 assert((t == NULL) || (t == t->remove_speculative()), "no more speculative types"); |
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4006 if (n->is_Type()) { |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4007 t = n->as_Type()->type(); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4008 assert(t == t->remove_speculative(), "no more speculative types"); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4009 } |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4010 uint max = n->len(); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4011 for( uint i = 0; i < max; ++i ) { |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4012 Node *m = n->in(i); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4013 if (not_a_node(m)) continue; |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4014 worklist.push(m); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4015 } |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4016 } |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4017 igvn.check_no_speculative_types(); |
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14232
diff
changeset
|
4018 #endif |
12966 | 4019 } |
4020 } | |
4021 | |
8691
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4022 // Auxiliary method to support randomized stressing/fuzzing. |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4023 // |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4024 // This method can be called the arbitrary number of times, with current count |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4025 // as the argument. The logic allows selecting a single candidate from the |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4026 // running list of candidates as follows: |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4027 // int count = 0; |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4028 // Cand* selected = null; |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4029 // while(cand = cand->next()) { |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4030 // if (randomized_select(++count)) { |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4031 // selected = cand; |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4032 // } |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4033 // } |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4034 // |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4035 // Including count equalizes the chances any candidate is "selected". |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4036 // This is useful when we don't have the complete list of candidates to choose |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4037 // from uniformly. In this case, we need to adjust the randomicity of the |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4038 // selection, or else we will end up biasing the selection towards the latter |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4039 // candidates. |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4040 // |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4041 // Quick back-envelope calculation shows that for the list of n candidates |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4042 // the equal probability for the candidate to persist as "best" can be |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4043 // achieved by replacing it with "next" k-th candidate with the probability |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4044 // of 1/k. It can be easily shown that by the end of the run, the |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4045 // probability for any candidate is converged to 1/n, thus giving the |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4046 // uniform distribution among all the candidates. |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4047 // |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4048 // We don't care about the domain size as long as (RANDOMIZED_DOMAIN / count) is large. |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4049 #define RANDOMIZED_DOMAIN_POW 29 |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4050 #define RANDOMIZED_DOMAIN (1 << RANDOMIZED_DOMAIN_POW) |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4051 #define RANDOMIZED_DOMAIN_MASK ((1 << (RANDOMIZED_DOMAIN_POW + 1)) - 1) |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4052 bool Compile::randomized_select(int count) { |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4053 assert(count > 0, "only positive"); |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4054 return (os::random() & RANDOMIZED_DOMAIN_MASK) < (RANDOMIZED_DOMAIN / count); |
571076d3c79d
8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents:
8048
diff
changeset
|
4055 } |