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