1 /* 2 * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "ci/ciValueKlass.hpp" 27 #include "opto/addnode.hpp" 28 #include "opto/castnode.hpp" 29 #include "opto/graphKit.hpp" 30 #include "opto/rootnode.hpp" 31 #include "opto/valuetypenode.hpp" 32 #include "opto/phaseX.hpp" 33 34 // Clones the values type to handle control flow merges involving multiple value types. 35 // The inputs are replaced by PhiNodes to represent the merged values for the given region. 36 ValueTypeBaseNode* ValueTypeBaseNode::clone_with_phis(PhaseGVN* gvn, Node* region) { 37 assert(!has_phi_inputs(region), "already cloned with phis"); 38 ValueTypeBaseNode* vt = clone()->as_ValueTypeBase(); 39 40 // Create a PhiNode for merging the oop values 41 const Type* phi_type = Type::get_const_type(value_klass()); 42 PhiNode* oop = PhiNode::make(region, vt->get_oop(), phi_type); 43 gvn->set_type(oop, phi_type); 44 vt->set_oop(oop); 45 46 // Create a PhiNode each for merging the field values 47 for (uint i = 0; i < vt->field_count(); ++i) { 48 ciType* type = vt->field_type(i); 49 Node* value = vt->field_value(i); 50 if (type->is_valuetype() && value->isa_ValueType()) { 51 // Handle flattened value type fields recursively 52 value = value->as_ValueType()->clone_with_phis(gvn, region); 53 } else { 54 phi_type = Type::get_const_type(type); 55 value = PhiNode::make(region, value, phi_type); 56 gvn->set_type(value, phi_type); 57 } 58 vt->set_field_value(i, value); 59 } 60 gvn->set_type(vt, vt->bottom_type()); 61 return vt; 62 } 63 64 // Checks if the inputs of the ValueBaseTypeNode were replaced by PhiNodes 65 // for the given region (see ValueBaseTypeNode::clone_with_phis). 66 bool ValueTypeBaseNode::has_phi_inputs(Node* region) { 67 // Check oop input 68 bool result = get_oop()->is_Phi() && get_oop()->as_Phi()->region() == region; 69 #ifdef ASSERT 70 if (result) { 71 // Check all field value inputs for consistency 72 for (uint i = Oop; i < field_count(); ++i) { 73 Node* n = in(i); 74 if (n->is_ValueTypeBase()) { 75 assert(n->as_ValueTypeBase()->has_phi_inputs(region), "inconsistent phi inputs"); 76 } else { 77 assert(n->is_Phi() && n->as_Phi()->region() == region, "inconsistent phi inputs"); 78 } 79 } 80 } 81 #endif 82 return result; 83 } 84 85 // Merges 'this' with 'other' by updating the input PhiNodes added by 'clone_with_phis' 86 ValueTypeBaseNode* ValueTypeBaseNode::merge_with(PhaseGVN* gvn, const ValueTypeBaseNode* other, int pnum, bool transform) { 87 // Merge oop inputs 88 PhiNode* phi = get_oop()->as_Phi(); 89 phi->set_req(pnum, other->get_oop()); 90 if (transform) { 91 set_oop(gvn->transform(phi)); 92 gvn->record_for_igvn(phi); 93 } 94 // Merge field values 95 for (uint i = 0; i < field_count(); ++i) { 96 Node* val1 = field_value(i); 97 Node* val2 = other->field_value(i); 98 if (val1->is_ValueType()) { 99 val1->as_ValueType()->merge_with(gvn, val2->as_ValueType(), pnum, transform); 100 } else { 101 assert(val1->is_Phi(), "must be a phi node"); 102 assert(!val2->is_ValueType(), "inconsistent merge values"); 103 val1->set_req(pnum, val2); 104 } 105 if (transform) { 106 set_field_value(i, gvn->transform(val1)); 107 gvn->record_for_igvn(val1); 108 } 109 } 110 return this; 111 } 112 113 // Adds a new merge path to a valuetype node with phi inputs 114 void ValueTypeBaseNode::add_new_path(Node* region) { 115 assert(has_phi_inputs(region), "must have phi inputs"); 116 117 PhiNode* phi = get_oop()->as_Phi(); 118 phi->add_req(NULL); 119 assert(phi->req() == region->req(), "must be same size as region"); 120 121 for (uint i = 0; i < field_count(); ++i) { 122 Node* val = field_value(i); 123 if (val->is_ValueType()) { 124 val->as_ValueType()->add_new_path(region); 125 } else { 126 val->as_Phi()->add_req(NULL); 127 assert(val->req() == region->req(), "must be same size as region"); 128 } 129 } 130 } 131 132 Node* ValueTypeBaseNode::field_value(uint index) const { 133 assert(index < field_count(), "index out of bounds"); 134 return in(Values + index); 135 } 136 137 // Get the value of the field at the given offset. 138 // If 'recursive' is true, flattened value type fields will be resolved recursively. 139 Node* ValueTypeBaseNode::field_value_by_offset(int offset, bool recursive) const { 140 // If the field at 'offset' belongs to a flattened value type field, 'index' refers to the 141 // corresponding ValueTypeNode input and 'sub_offset' is the offset in flattened value type. 142 int index = value_klass()->field_index_by_offset(offset); 143 int sub_offset = offset - field_offset(index); 144 Node* value = field_value(index); 145 assert(value != NULL, "field value not found"); 146 if (recursive && value->is_ValueType()) { 147 ValueTypeNode* vt = value->as_ValueType(); 148 if (field_is_flattened(index)) { 149 // Flattened value type field 150 sub_offset += vt->value_klass()->first_field_offset(); // Add header size 151 return vt->field_value_by_offset(sub_offset, recursive); 152 } else { 153 assert(sub_offset == 0, "should not have a sub offset"); 154 return vt; 155 } 156 } 157 assert(!(recursive && value->is_ValueType()), "should not be a value type"); 158 assert(sub_offset == 0, "offset mismatch"); 159 return value; 160 } 161 162 void ValueTypeBaseNode::set_field_value(uint index, Node* value) { 163 assert(index < field_count(), "index out of bounds"); 164 set_req(Values + index, value); 165 } 166 167 void ValueTypeBaseNode::set_field_value_by_offset(int offset, Node* value) { 168 set_field_value(field_index(offset), value); 169 } 170 171 int ValueTypeBaseNode::field_offset(uint index) const { 172 assert(index < field_count(), "index out of bounds"); 173 return value_klass()->declared_nonstatic_field_at(index)->offset(); 174 } 175 176 uint ValueTypeBaseNode::field_index(int offset) const { 177 uint i = 0; 178 for (; i < field_count() && field_offset(i) != offset; i++) { } 179 assert(i < field_count(), "field not found"); 180 return i; 181 } 182 183 ciType* ValueTypeBaseNode::field_type(uint index) const { 184 assert(index < field_count(), "index out of bounds"); 185 return value_klass()->declared_nonstatic_field_at(index)->type(); 186 } 187 188 bool ValueTypeBaseNode::field_is_flattened(uint index) const { 189 assert(index < field_count(), "index out of bounds"); 190 ciField* field = value_klass()->declared_nonstatic_field_at(index); 191 assert(!field->is_flattened() || field->type()->is_valuetype(), "must be a value type"); 192 return field->is_flattened(); 193 } 194 195 bool ValueTypeBaseNode::field_is_flattenable(uint index) const { 196 assert(index < field_count(), "index out of bounds"); 197 ciField* field = value_klass()->declared_nonstatic_field_at(index); 198 assert(!field->is_flattenable() || field->type()->is_valuetype(), "must be a value type"); 199 return field->is_flattenable(); 200 } 201 202 int ValueTypeBaseNode::make_scalar_in_safepoint(PhaseIterGVN* igvn, Unique_Node_List& worklist, SafePointNode* sfpt) { 203 ciValueKlass* vk = value_klass(); 204 uint nfields = vk->nof_nonstatic_fields(); 205 JVMState* jvms = sfpt->jvms(); 206 int start = jvms->debug_start(); 207 int end = jvms->debug_end(); 208 // Replace safepoint edge by SafePointScalarObjectNode and add field values 209 assert(jvms != NULL, "missing JVMS"); 210 uint first_ind = (sfpt->req() - jvms->scloff()); 211 SafePointScalarObjectNode* sobj = new SafePointScalarObjectNode(value_ptr(), 212 #ifdef ASSERT 213 NULL, 214 #endif 215 first_ind, nfields); 216 sobj->init_req(0, igvn->C->root()); 217 // Iterate over the value type fields in order of increasing 218 // offset and add the field values to the safepoint. 219 for (uint j = 0; j < nfields; ++j) { 220 int offset = vk->nonstatic_field_at(j)->offset(); 221 Node* value = field_value_by_offset(offset, true /* include flattened value type fields */); 222 if (value->is_ValueType()) { 223 // Add value type field to the worklist to process later 224 worklist.push(value); 225 } 226 sfpt->add_req(value); 227 } 228 jvms->set_endoff(sfpt->req()); 229 sobj = igvn->transform(sobj)->as_SafePointScalarObject(); 230 igvn->rehash_node_delayed(sfpt); 231 return sfpt->replace_edges_in_range(this, sobj, start, end); 232 } 233 234 void ValueTypeBaseNode::make_scalar_in_safepoints(PhaseIterGVN* igvn) { 235 // Process all safepoint uses and scalarize value type 236 Unique_Node_List worklist; 237 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { 238 SafePointNode* sfpt = fast_out(i)->isa_SafePoint(); 239 if (sfpt != NULL && !sfpt->is_CallLeaf() && (!sfpt->is_Call() || sfpt->as_Call()->has_debug_use(this))) { 240 int nb = 0; 241 if (is_allocated(igvn) && get_oop()->is_Con()) { 242 // Value type is allocated with a constant oop, link it directly 243 nb = sfpt->replace_edges_in_range(this, get_oop(), sfpt->jvms()->debug_start(), sfpt->jvms()->debug_end()); 244 igvn->rehash_node_delayed(sfpt); 245 } else { 246 nb = make_scalar_in_safepoint(igvn, worklist, sfpt); 247 } 248 --i; imax -= nb; 249 } 250 } 251 // Now scalarize non-flattened fields 252 for (uint i = 0; i < worklist.size(); ++i) { 253 Node* vt = worklist.at(i); 254 vt->as_ValueType()->make_scalar_in_safepoints(igvn); 255 } 256 } 257 258 const TypePtr* ValueTypeBaseNode::field_adr_type(Node* base, int offset, ciInstanceKlass* holder, DecoratorSet decorators, PhaseGVN& gvn) const { 259 const TypeAryPtr* ary_type = gvn.type(base)->isa_aryptr(); 260 const TypePtr* adr_type = NULL; 261 bool is_array = ary_type != NULL; 262 if ((decorators & C2_MISMATCHED) != 0) { 263 adr_type = TypeRawPtr::BOTTOM; 264 } else if (is_array) { 265 // In the case of a flattened value type array, each field has its own slice 266 adr_type = ary_type->with_field_offset(offset)->add_offset(Type::OffsetBot); 267 } else { 268 ciField* field = holder->get_field_by_offset(offset, false); 269 assert(field != NULL, "field not found"); 270 adr_type = gvn.C->alias_type(field)->adr_type(); 271 } 272 return adr_type; 273 } 274 275 void ValueTypeBaseNode::load(GraphKit* kit, Node* base, Node* ptr, ciInstanceKlass* holder, int holder_offset, DecoratorSet decorators) { 276 // Initialize the value type by loading its field values from 277 // memory and adding the values as input edges to the node. 278 for (uint i = 0; i < field_count(); ++i) { 279 int offset = holder_offset + field_offset(i); 280 Node* value = NULL; 281 ciType* ft = field_type(i); 282 if (field_is_flattened(i)) { 283 // Recursively load the flattened value type field 284 value = ValueTypeNode::make_from_flattened(kit, ft->as_value_klass(), base, ptr, holder, offset, decorators); 285 } else { 286 const TypeOopPtr* oop_ptr = kit->gvn().type(base)->isa_oopptr(); 287 bool is_array = (oop_ptr->isa_aryptr() != NULL); 288 if (base->is_Con() && !is_array) { 289 // If the oop to the value type is constant (static final field), we can 290 // also treat the fields as constants because the value type is immutable. 291 ciObject* constant_oop = oop_ptr->const_oop(); 292 ciField* field = holder->get_field_by_offset(offset, false); 293 assert(field != NULL, "field not found"); 294 ciConstant constant = constant_oop->as_instance()->field_value(field); 295 const Type* con_type = Type::make_from_constant(constant, /*require_const=*/ true); 296 assert(con_type != NULL, "type not found"); 297 value = kit->gvn().transform(kit->makecon(con_type)); 298 } else { 299 // Load field value from memory 300 const TypePtr* adr_type = field_adr_type(base, offset, holder, decorators, kit->gvn()); 301 Node* adr = kit->basic_plus_adr(base, ptr, offset); 302 BasicType bt = type2field[ft->basic_type()]; 303 assert(is_java_primitive(bt) || adr->bottom_type()->is_ptr_to_narrowoop() == UseCompressedOops, "inconsistent"); 304 const Type* val_type = Type::get_const_type(ft); 305 if (is_array) { 306 decorators |= IS_ARRAY; 307 } 308 value = kit->access_load_at(base, adr, adr_type, val_type, bt, decorators); 309 } 310 if (field_is_flattenable(i)) { 311 // Loading a non-flattened but flattenable value type from memory 312 if (ft->as_value_klass()->is_scalarizable()) { 313 value = ValueTypeNode::make_from_oop(kit, value, ft->as_value_klass()); 314 } else { 315 value = kit->null2default(value, ft->as_value_klass()); 316 } 317 } 318 } 319 set_field_value(i, value); 320 } 321 } 322 323 void ValueTypeBaseNode::store_flattened(GraphKit* kit, Node* base, Node* ptr, ciInstanceKlass* holder, int holder_offset, DecoratorSet decorators) const { 324 // The value type is embedded into the object without an oop header. Subtract the 325 // offset of the first field to account for the missing header when storing the values. 326 if (holder == NULL) { 327 holder = value_klass(); 328 } 329 holder_offset -= value_klass()->first_field_offset(); 330 store(kit, base, ptr, holder, holder_offset, false, decorators); 331 } 332 333 void ValueTypeBaseNode::store(GraphKit* kit, Node* base, Node* ptr, ciInstanceKlass* holder, int holder_offset, bool deoptimize_on_exception, DecoratorSet decorators) const { 334 // Write field values to memory 335 for (uint i = 0; i < field_count(); ++i) { 336 int offset = holder_offset + field_offset(i); 337 Node* value = field_value(i); 338 ciType* ft = field_type(i); 339 if (field_is_flattened(i)) { 340 // Recursively store the flattened value type field 341 if (!value->is_ValueType()) { 342 assert(!kit->gvn().type(value)->maybe_null(), "should never be null"); 343 value = ValueTypeNode::make_from_oop(kit, value, ft->as_value_klass()); 344 } 345 value->as_ValueType()->store_flattened(kit, base, ptr, holder, offset, decorators); 346 } else { 347 // Store field value to memory 348 const TypePtr* adr_type = field_adr_type(base, offset, holder, decorators, kit->gvn()); 349 Node* adr = kit->basic_plus_adr(base, ptr, offset); 350 BasicType bt = type2field[ft->basic_type()]; 351 assert(is_java_primitive(bt) || adr->bottom_type()->is_ptr_to_narrowoop() == UseCompressedOops, "inconsistent"); 352 const Type* val_type = Type::get_const_type(ft); 353 const TypeAryPtr* ary_type = kit->gvn().type(base)->isa_aryptr(); 354 if (ary_type != NULL) { 355 decorators |= IS_ARRAY; 356 } 357 kit->access_store_at(base, adr, adr_type, value, val_type, bt, decorators, deoptimize_on_exception); 358 } 359 } 360 } 361 362 ValueTypeBaseNode* ValueTypeBaseNode::allocate(GraphKit* kit, bool deoptimize_on_exception, bool safe_for_replace) { 363 // Check if value type is already allocated 364 Node* null_ctl = kit->top(); 365 Node* not_null_oop = kit->null_check_oop(get_oop(), &null_ctl); 366 if (null_ctl->is_top()) { 367 // Value type is allocated 368 return this; 369 } 370 assert(!is_allocated(&kit->gvn()), "should not be allocated"); 371 RegionNode* region = new RegionNode(3); 372 373 // Oop is non-NULL, use it 374 region->init_req(1, kit->control()); 375 PhiNode* oop = PhiNode::make(region, not_null_oop, value_ptr()); 376 PhiNode* io = PhiNode::make(region, kit->i_o(), Type::ABIO); 377 PhiNode* mem = PhiNode::make(region, kit->merged_memory(), Type::MEMORY, TypePtr::BOTTOM); 378 379 { 380 // Oop is NULL, allocate and initialize buffer 381 PreserveJVMState pjvms(kit); 382 kit->set_control(null_ctl); 383 kit->kill_dead_locals(); 384 ciValueKlass* vk = value_klass(); 385 Node* klass_node = kit->makecon(TypeKlassPtr::make(vk)); 386 Node* alloc_oop = kit->new_instance(klass_node, NULL, NULL, deoptimize_on_exception, this); 387 store(kit, alloc_oop, alloc_oop, vk, 0, deoptimize_on_exception); 388 region->init_req(2, kit->control()); 389 oop ->init_req(2, alloc_oop); 390 io ->init_req(2, kit->i_o()); 391 mem ->init_req(2, kit->merged_memory()); 392 } 393 394 // Update GraphKit 395 kit->set_control(kit->gvn().transform(region)); 396 kit->set_i_o(kit->gvn().transform(io)); 397 kit->set_all_memory(kit->gvn().transform(mem)); 398 kit->record_for_igvn(region); 399 kit->record_for_igvn(oop); 400 kit->record_for_igvn(io); 401 kit->record_for_igvn(mem); 402 403 // Use cloned ValueTypeNode to propagate oop from now on 404 Node* res_oop = kit->gvn().transform(oop); 405 ValueTypeBaseNode* vt = clone()->as_ValueTypeBase(); 406 vt->set_oop(res_oop); 407 vt = kit->gvn().transform(vt)->as_ValueTypeBase(); 408 if (safe_for_replace) { 409 kit->replace_in_map(this, vt); 410 } 411 return vt; 412 } 413 414 bool ValueTypeBaseNode::is_allocated(PhaseGVN* phase) const { 415 Node* oop = get_oop(); 416 const Type* oop_type = (phase != NULL) ? phase->type(oop) : oop->bottom_type(); 417 return !oop_type->maybe_null(); 418 } 419 420 // When a call returns multiple values, it has several result 421 // projections, one per field. Replacing the result of the call by a 422 // value type node (after late inlining) requires that for each result 423 // projection, we find the corresponding value type field. 424 void ValueTypeBaseNode::replace_call_results(GraphKit* kit, Node* call, Compile* C) { 425 ciValueKlass* vk = value_klass(); 426 for (DUIterator_Fast imax, i = call->fast_outs(imax); i < imax; i++) { 427 ProjNode* pn = call->fast_out(i)->as_Proj(); 428 uint con = pn->_con; 429 if (con >= TypeFunc::Parms+1) { 430 uint field_nb = con - (TypeFunc::Parms+1); 431 int extra = 0; 432 for (uint j = 0; j < field_nb - extra; j++) { 433 ciField* f = vk->nonstatic_field_at(j); 434 BasicType bt = f->type()->basic_type(); 435 if (bt == T_LONG || bt == T_DOUBLE) { 436 extra++; 437 } 438 } 439 ciField* f = vk->nonstatic_field_at(field_nb - extra); 440 Node* field = field_value_by_offset(f->offset(), true); 441 if (field->is_ValueType()) { 442 field = field->as_ValueType()->allocate(kit)->get_oop(); 443 } 444 C->gvn_replace_by(pn, field); 445 C->initial_gvn()->hash_delete(pn); 446 pn->set_req(0, C->top()); 447 --i; --imax; 448 } 449 } 450 } 451 452 ValueTypeNode* ValueTypeNode::make_uninitialized(PhaseGVN& gvn, ciValueKlass* vk) { 453 // Create a new ValueTypeNode with uninitialized values and NULL oop 454 return new ValueTypeNode(vk, gvn.zerocon(T_VALUETYPE)); 455 } 456 457 Node* ValueTypeNode::default_oop(PhaseGVN& gvn, ciValueKlass* vk) { 458 // Returns the constant oop of the default value type allocation 459 return gvn.makecon(TypeInstPtr::make(vk->default_value_instance())); 460 } 461 462 ValueTypeNode* ValueTypeNode::make_default(PhaseGVN& gvn, ciValueKlass* vk) { 463 // Create a new ValueTypeNode with default values 464 ValueTypeNode* vt = new ValueTypeNode(vk, default_oop(gvn, vk)); 465 for (uint i = 0; i < vt->field_count(); ++i) { 466 ciType* field_type = vt->field_type(i); 467 Node* value = NULL; 468 if (field_type->is_valuetype() && vt->field_is_flattenable(i)) { 469 ciValueKlass* field_klass = field_type->as_value_klass(); 470 if (field_klass->is_scalarizable() || vt->field_is_flattened(i)) { 471 value = ValueTypeNode::make_default(gvn, field_klass); 472 } else { 473 value = default_oop(gvn, field_klass); 474 } 475 } else { 476 value = gvn.zerocon(field_type->basic_type()); 477 } 478 vt->set_field_value(i, value); 479 } 480 vt = gvn.transform(vt)->as_ValueType(); 481 assert(vt->is_default(gvn), "must be the default value type"); 482 return vt; 483 } 484 485 bool ValueTypeNode::is_default(PhaseGVN& gvn) const { 486 for (uint i = 0; i < field_count(); ++i) { 487 Node* value = field_value(i); 488 if (!gvn.type(value)->is_zero_type() && 489 !(value->is_ValueType() && value->as_ValueType()->is_default(gvn)) && 490 !(field_type(i)->is_valuetype() && value == default_oop(gvn, field_type(i)->as_value_klass()))) { 491 return false; 492 } 493 } 494 return true; 495 } 496 497 ValueTypeNode* ValueTypeNode::make_from_oop(GraphKit* kit, Node* oop, ciValueKlass* vk) { 498 PhaseGVN& gvn = kit->gvn(); 499 500 // Create and initialize a ValueTypeNode by loading all field 501 // values from a heap-allocated version and also save the oop. 502 ValueTypeNode* vt = new ValueTypeNode(vk, oop); 503 504 if (oop->isa_ValueTypePtr()) { 505 // Can happen with late inlining 506 ValueTypePtrNode* vtptr = oop->as_ValueTypePtr(); 507 vt->set_oop(vtptr->get_oop()); 508 for (uint i = Oop+1; i < vtptr->req(); ++i) { 509 vt->init_req(i, vtptr->in(i)); 510 } 511 } else if (gvn.type(oop)->maybe_null()) { 512 // Add a null check because the oop may be null 513 Node* null_ctl = kit->top(); 514 Node* not_null_oop = kit->null_check_oop(oop, &null_ctl); 515 if (kit->stopped()) { 516 // Constant null 517 kit->set_control(null_ctl); 518 return make_default(gvn, vk); 519 } 520 vt->set_oop(not_null_oop); 521 vt->load(kit, not_null_oop, not_null_oop, vk, /* holder_offset */ 0); 522 523 if (null_ctl != kit->top()) { 524 // Return default value type if oop is null 525 ValueTypeNode* def = make_default(gvn, vk); 526 Node* region = new RegionNode(3); 527 region->init_req(1, kit->control()); 528 region->init_req(2, null_ctl); 529 530 vt = vt->clone_with_phis(&gvn, region)->as_ValueType(); 531 vt->merge_with(&gvn, def, 2, true); 532 kit->set_control(gvn.transform(region)); 533 } 534 } else { 535 // Oop can never be null 536 Node* init_ctl = kit->control(); 537 vt->load(kit, oop, oop, vk, /* holder_offset */ 0); 538 assert(init_ctl != kit->control() || !gvn.type(oop)->is_valuetypeptr() || oop->is_Con() || oop->Opcode() == Op_ValueTypePtr || 539 AllocateNode::Ideal_allocation(oop, &gvn) != NULL || vt->is_loaded(&gvn) == oop, "value type should be loaded"); 540 } 541 542 assert(vt->is_allocated(&gvn), "value type should be allocated"); 543 return gvn.transform(vt)->as_ValueType(); 544 } 545 546 // GraphKit wrapper for the 'make_from_flattened' method 547 ValueTypeNode* ValueTypeNode::make_from_flattened(GraphKit* kit, ciValueKlass* vk, Node* obj, Node* ptr, ciInstanceKlass* holder, int holder_offset, DecoratorSet decorators) { 548 // Create and initialize a ValueTypeNode by loading all field values from 549 // a flattened value type field at 'holder_offset' or from a value type array. 550 ValueTypeNode* vt = make_uninitialized(kit->gvn(), vk); 551 // The value type is flattened into the object without an oop header. Subtract the 552 // offset of the first field to account for the missing header when loading the values. 553 holder_offset -= vk->first_field_offset(); 554 vt->load(kit, obj, ptr, holder, holder_offset, decorators); 555 assert(vt->is_loaded(&kit->gvn()) != obj, "holder oop should not be used as flattened value type oop"); 556 return kit->gvn().transform(vt)->as_ValueType(); 557 } 558 559 ValueTypeNode* ValueTypeNode::make_from_multi(GraphKit* kit, MultiNode* multi, ExtendedSignature& sig, ciValueKlass* vk, uint& base_input, bool in) { 560 ValueTypeNode* vt = ValueTypeNode::make_uninitialized(kit->gvn(), vk); 561 vt->initialize_fields(kit, multi, sig, base_input, 0, in); 562 return kit->gvn().transform(vt)->as_ValueType(); 563 } 564 565 ValueTypeNode* ValueTypeNode::make_larval(GraphKit* kit, bool allocate) const { 566 ciValueKlass* vk = value_klass(); 567 ValueTypeNode* res = clone()->as_ValueType(); 568 if (allocate) { 569 Node* klass_node = kit->makecon(TypeKlassPtr::make(vk)); 570 Node* alloc_oop = kit->new_instance(klass_node, NULL, NULL, false); 571 AllocateNode* alloc = AllocateNode::Ideal_allocation(alloc_oop, &kit->gvn()); 572 alloc->_larval = true; 573 574 store(kit, alloc_oop, alloc_oop, vk, 0, false); 575 res->set_oop(alloc_oop); 576 } 577 res->set_type(TypeValueType::make(vk, true)); 578 res = kit->gvn().transform(res)->as_ValueType(); 579 return res; 580 } 581 582 ValueTypeNode* ValueTypeNode::finish_larval(GraphKit* kit) const { 583 Node* obj = get_oop(); 584 Node* mark_addr = kit->basic_plus_adr(obj, oopDesc::mark_offset_in_bytes()); 585 Node* mark = kit->make_load(NULL, mark_addr, TypeX_X, TypeX_X->basic_type(), MemNode::unordered); 586 mark = kit->gvn().transform(new AndXNode(mark, kit->MakeConX(~markOopDesc::larval_mask_in_place))); 587 kit->store_to_memory(kit->control(), mark_addr, mark, TypeX_X->basic_type(), kit->gvn().type(mark_addr)->is_ptr(), MemNode::unordered); 588 589 ciValueKlass* vk = value_klass(); 590 ValueTypeNode* res = clone()->as_ValueType(); 591 res->set_type(TypeValueType::make(vk, false)); 592 res = kit->gvn().transform(res)->as_ValueType(); 593 return res; 594 } 595 596 Node* ValueTypeNode::is_loaded(PhaseGVN* phase, ciValueKlass* vk, Node* base, int holder_offset) { 597 if (vk == NULL) { 598 vk = value_klass(); 599 } 600 if (field_count() == 0) { 601 assert(is_allocated(phase), "must be allocated"); 602 return get_oop(); 603 } 604 for (uint i = 0; i < field_count(); ++i) { 605 int offset = holder_offset + field_offset(i); 606 Node* value = field_value(i); 607 if (value->is_ValueType()) { 608 ValueTypeNode* vt = value->as_ValueType(); 609 if (field_is_flattened(i)) { 610 // Check value type field load recursively 611 base = vt->is_loaded(phase, vk, base, offset - vt->value_klass()->first_field_offset()); 612 if (base == NULL) { 613 return NULL; 614 } 615 continue; 616 } else { 617 value = vt->get_oop(); 618 if (value->Opcode() == Op_CastPP) { 619 // Skip CastPP 620 value = value->in(1); 621 } 622 } 623 } 624 if (value->isa_DecodeN()) { 625 // Skip DecodeN 626 value = value->in(1); 627 } 628 if (value->isa_Load()) { 629 // Check if base and offset of field load matches value type layout 630 intptr_t loffset = 0; 631 Node* lbase = AddPNode::Ideal_base_and_offset(value->in(MemNode::Address), phase, loffset); 632 if (lbase == NULL || (lbase != base && base != NULL) || loffset != offset) { 633 return NULL; 634 } else if (base == NULL) { 635 // Set base and check if pointer type matches 636 base = lbase; 637 const TypeInstPtr* vtptr = phase->type(base)->isa_instptr(); 638 if (vtptr == NULL || !vtptr->klass()->equals(vk)) { 639 return NULL; 640 } 641 } 642 } else { 643 return NULL; 644 } 645 } 646 return base; 647 } 648 649 Node* ValueTypeNode::allocate_fields(GraphKit* kit) { 650 ValueTypeNode* vt = clone()->as_ValueType(); 651 for (uint i = 0; i < field_count(); i++) { 652 ValueTypeNode* value = field_value(i)->isa_ValueType(); 653 if (field_is_flattened(i)) { 654 // Flattened value type field 655 vt->set_field_value(i, value->allocate_fields(kit)); 656 } else if (value != NULL){ 657 // Non-flattened value type field 658 vt->set_field_value(i, value->allocate(kit)); 659 } 660 } 661 vt = kit->gvn().transform(vt)->as_ValueType(); 662 kit->replace_in_map(this, vt); 663 return vt; 664 } 665 666 Node* ValueTypeNode::tagged_klass(ciValueKlass* vk, PhaseGVN& gvn) { 667 const TypeKlassPtr* tk = TypeKlassPtr::make(vk); 668 intptr_t bits = tk->get_con(); 669 set_nth_bit(bits, 0); 670 return gvn.makecon(TypeRawPtr::make((address)bits)); 671 } 672 673 void ValueTypeNode::pass_fields(GraphKit* kit, Node* n, ExtendedSignature& sig, uint& base_input, int base_offset) { 674 for (uint i = 0; i < field_count(); i++) { 675 int sig_offset = (*sig)._offset; 676 uint idx = field_index(sig_offset - base_offset); 677 Node* arg = field_value(idx); 678 679 if (field_is_flattened(idx)) { 680 // Flattened value type field 681 ValueTypeNode* vt = arg->as_ValueType(); 682 vt->pass_fields(kit, n, sig, base_input, sig_offset - vt->value_klass()->first_field_offset()); 683 } else { 684 if (arg->is_ValueType()) { 685 // Non-flattened value type field 686 assert(field_is_flattenable(idx), "must be flattenable"); 687 ValueTypeNode* vt = arg->as_ValueType(); 688 assert(n->Opcode() != Op_Return || vt->is_allocated(&kit->gvn()), "value type field should be allocated on return"); 689 arg = vt->allocate(kit)->get_oop(); 690 } 691 // Initialize call/return arguments 692 BasicType bt = field_type(i)->basic_type(); 693 n->init_req(base_input++, arg); 694 if (type2size[bt] == 2) { 695 n->init_req(base_input++, kit->top()); 696 } 697 // Skip reserved arguments 698 while (SigEntry::next_is_reserved(sig, bt)) { 699 n->init_req(base_input++, kit->top()); 700 if (type2size[bt] == 2) { 701 n->init_req(base_input++, kit->top()); 702 } 703 } 704 } 705 } 706 } 707 708 void ValueTypeNode::initialize_fields(GraphKit* kit, MultiNode* multi, ExtendedSignature& sig, uint& base_input, int base_offset, bool in) { 709 PhaseGVN& gvn = kit->gvn(); 710 for (uint i = 0; i < field_count(); i++) { 711 int sig_offset = (*sig)._offset; 712 uint idx = field_index(sig_offset - base_offset); 713 ciType* type = field_type(idx); 714 715 Node* parm = NULL; 716 if (field_is_flattened(idx)) { 717 // Flattened value type field 718 ValueTypeNode* vt = ValueTypeNode::make_uninitialized(gvn, type->as_value_klass()); 719 vt->initialize_fields(kit, multi, sig, base_input, sig_offset - type->as_value_klass()->first_field_offset(), in); 720 parm = gvn.transform(vt); 721 } else { 722 if (multi->is_Start()) { 723 assert(in, "return from start?"); 724 parm = gvn.transform(new ParmNode(multi->as_Start(), base_input)); 725 } else if (in) { 726 parm = multi->as_Call()->in(base_input); 727 } else { 728 parm = gvn.transform(new ProjNode(multi->as_Call(), base_input)); 729 } 730 if (field_is_flattenable(idx)) { 731 // Non-flattened but flattenable value type 732 if (type->as_value_klass()->is_scalarizable()) { 733 parm = ValueTypeNode::make_from_oop(kit, parm, type->as_value_klass()); 734 } else { 735 parm = kit->null2default(parm, type->as_value_klass()); 736 } 737 } 738 base_input += type2size[type->basic_type()]; 739 // Skip reserved arguments 740 BasicType bt = type->basic_type(); 741 while (SigEntry::next_is_reserved(sig, bt)) { 742 base_input += type2size[bt]; 743 } 744 } 745 assert(parm != NULL, "should never be null"); 746 set_field_value(idx, parm); 747 gvn.record_for_igvn(parm); 748 } 749 } 750 751 Node* ValueTypeNode::Ideal(PhaseGVN* phase, bool can_reshape) { 752 Node* oop = get_oop(); 753 if (is_default(*phase) && (!oop->is_Con() || phase->type(oop)->is_zero_type())) { 754 // Use the pre-allocated oop for default value types 755 set_oop(default_oop(*phase, value_klass())); 756 return this; 757 } else if (oop->isa_ValueTypePtr()) { 758 // Can happen with late inlining 759 ValueTypePtrNode* vtptr = oop->as_ValueTypePtr(); 760 set_oop(vtptr->get_oop()); 761 for (uint i = Oop+1; i < vtptr->req(); ++i) { 762 set_req(i, vtptr->in(i)); 763 } 764 return this; 765 } 766 767 if (!is_allocated(phase)) { 768 // Save base oop if fields are loaded from memory and the value 769 // type is not buffered (in this case we should not use the oop). 770 Node* base = is_loaded(phase); 771 if (base != NULL) { 772 set_oop(base); 773 assert(is_allocated(phase), "should now be allocated"); 774 return this; 775 } 776 } 777 778 if (can_reshape) { 779 PhaseIterGVN* igvn = phase->is_IterGVN(); 780 781 if (is_default(*phase)) { 782 // Search for users of the default value type 783 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { 784 Node* user = fast_out(i); 785 AllocateNode* alloc = user->isa_Allocate(); 786 if (alloc != NULL && alloc->result_cast() != NULL && alloc->in(AllocateNode::ValueNode) == this) { 787 // Found an allocation of the default value type. 788 // If the code in StoreNode::Identity() that removes useless stores was not yet 789 // executed or ReduceFieldZeroing is disabled, there can still be initializing 790 // stores (only zero-type or default value stores, because value types are immutable). 791 Node* res = alloc->result_cast(); 792 for (DUIterator_Fast jmax, j = res->fast_outs(jmax); j < jmax; j++) { 793 AddPNode* addp = res->fast_out(j)->isa_AddP(); 794 if (addp != NULL) { 795 for (DUIterator_Fast kmax, k = addp->fast_outs(kmax); k < kmax; k++) { 796 StoreNode* store = addp->fast_out(k)->isa_Store(); 797 if (store != NULL && store->outcnt() != 0) { 798 // Remove the useless store 799 igvn->replace_in_uses(store, store->in(MemNode::Memory)); 800 } 801 } 802 } 803 } 804 // Replace allocation by pre-allocated oop 805 igvn->replace_node(res, default_oop(*phase, value_klass())); 806 } else if (user->is_ValueType()) { 807 // Add value type user to worklist to give it a chance to get optimized as well 808 igvn->_worklist.push(user); 809 } 810 } 811 } 812 813 if (is_allocated(igvn)) { 814 // Value type is heap allocated, search for safepoint uses 815 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { 816 Node* out = fast_out(i); 817 if (out->is_SafePoint()) { 818 // Let SafePointNode::Ideal() take care of re-wiring the 819 // safepoint to the oop input instead of the value type node. 820 igvn->rehash_node_delayed(out); 821 } 822 } 823 } 824 } 825 return NULL; 826 } 827 828 // Search for multiple allocations of this value type 829 // and try to replace them by dominating allocations. 830 void ValueTypeNode::remove_redundant_allocations(PhaseIterGVN* igvn, PhaseIdealLoop* phase) { 831 assert(EliminateAllocations, "allocation elimination should be enabled"); 832 // Search for allocations of this value type 833 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { 834 AllocateNode* alloc = fast_out(i)->isa_Allocate(); 835 if (alloc != NULL && alloc->result_cast() != NULL && alloc->in(AllocateNode::ValueNode) == this) { 836 assert(!is_default(*igvn), "default value type allocation"); 837 Node* res = alloc->result_cast(); 838 Node* res_dom = NULL; 839 if (is_allocated(igvn)) { 840 // The value type is already allocated but still connected to an AllocateNode. 841 // This can happen with late inlining when we first allocate a value type argument 842 // but later decide to inline the call with the callee code also allocating. 843 res_dom = get_oop(); 844 } else { 845 // Search for a dominating allocation of the same value type 846 for (DUIterator_Fast jmax, j = fast_outs(jmax); j < jmax; j++) { 847 AllocateNode* alloc_dom = fast_out(j)->isa_Allocate(); 848 if (alloc_dom != NULL && alloc != alloc_dom && alloc_dom->result_cast() != NULL && 849 alloc_dom->in(AllocateNode::ValueNode) == this) { 850 assert(alloc->in(AllocateNode::KlassNode) == alloc_dom->in(AllocateNode::KlassNode), "klasses should match"); 851 if (phase->is_dominator(alloc_dom->result_cast()->in(0), res->in(0))) { 852 res_dom = alloc_dom->result_cast(); 853 break; 854 } 855 } 856 } 857 } 858 if (res_dom != NULL) { 859 // Move users to dominating allocation 860 igvn->replace_node(res, res_dom); 861 // The result of the dominated allocation is now unused and will be 862 // removed later in AllocateNode::Ideal() to not confuse loop opts. 863 igvn->record_for_igvn(alloc); 864 #ifdef ASSERT 865 if (PrintEliminateAllocations) { 866 tty->print("++++ Eliminated: %d Allocate ", alloc->_idx); 867 dump_spec(tty); 868 tty->cr(); 869 } 870 #endif 871 } 872 } 873 } 874 875 // Process users 876 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { 877 Node* out = fast_out(i); 878 if (out->is_ValueType()) { 879 // Recursively process value type users 880 out->as_ValueType()->remove_redundant_allocations(igvn, phase); 881 } else if (out->isa_Allocate() != NULL) { 882 // Allocate users should be linked 883 assert(out->in(AllocateNode::ValueNode) == this, "should be linked"); 884 } else { 885 #ifdef ASSERT 886 // The value type should not have any other users at this time 887 out->dump(); 888 assert(false, "unexpected user of value type"); 889 #endif 890 } 891 } 892 } 893 894 ValueTypePtrNode* ValueTypePtrNode::make_from_value_type(GraphKit* kit, ValueTypeNode* vt, bool deoptimize_on_exception) { 895 Node* oop = vt->allocate(kit, deoptimize_on_exception)->get_oop(); 896 ValueTypePtrNode* vtptr = new ValueTypePtrNode(vt->value_klass(), oop); 897 for (uint i = Oop+1; i < vt->req(); i++) { 898 vtptr->init_req(i, vt->in(i)); 899 } 900 return kit->gvn().transform(vtptr)->as_ValueTypePtr(); 901 } 902 903 ValueTypePtrNode* ValueTypePtrNode::make_from_oop(GraphKit* kit, Node* oop) { 904 // Create and initialize a ValueTypePtrNode by loading all field 905 // values from a heap-allocated version and also save the oop. 906 ciValueKlass* vk = kit->gvn().type(oop)->value_klass(); 907 ValueTypePtrNode* vtptr = new ValueTypePtrNode(vk, oop); 908 vtptr->load(kit, oop, oop, vk); 909 return kit->gvn().transform(vtptr)->as_ValueTypePtr(); 910 }