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