< prev index next >

src/hotspot/share/opto/graphKit.cpp

Print this page

1253   }
1254   Node* conv = _gvn.transform( new ConvI2LNode(offset));
1255   Node* mask = _gvn.transform(ConLNode::make((julong) max_juint));
1256   return _gvn.transform( new AndLNode(conv, mask) );
1257 }
1258 
1259 Node* GraphKit::ConvL2I(Node* offset) {
1260   // short-circuit a common case
1261   jlong offset_con = find_long_con(offset, (jlong)Type::OffsetBot);
1262   if (offset_con != (jlong)Type::OffsetBot) {
1263     return intcon((int) offset_con);
1264   }
1265   return _gvn.transform( new ConvL2INode(offset));
1266 }
1267 
1268 //-------------------------load_object_klass-----------------------------------
1269 Node* GraphKit::load_object_klass(Node* obj) {
1270   // Special-case a fresh allocation to avoid building nodes:
1271   Node* akls = AllocateNode::Ideal_klass(obj, &_gvn);
1272   if (akls != nullptr)  return akls;
1273   Node* k_adr = basic_plus_adr(obj, oopDesc::klass_offset_in_bytes());
1274   return _gvn.transform(LoadKlassNode::make(_gvn, immutable_memory(), k_adr, TypeInstPtr::KLASS));
1275 }
1276 
1277 //-------------------------load_array_length-----------------------------------
1278 Node* GraphKit::load_array_length(Node* array) {
1279   // Special-case a fresh allocation to avoid building nodes:
1280   AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(array);
1281   Node *alen;
1282   if (alloc == nullptr) {
1283     Node *r_adr = basic_plus_adr(array, arrayOopDesc::length_offset_in_bytes());
1284     alen = _gvn.transform( new LoadRangeNode(nullptr, immutable_memory(), r_adr, TypeInt::POS));
1285   } else {
1286     alen = array_ideal_length(alloc, _gvn.type(array)->is_oopptr(), false);
1287   }
1288   return alen;
1289 }
1290 
1291 Node* GraphKit::array_ideal_length(AllocateArrayNode* alloc,
1292                                    const TypeOopPtr* oop_type,
1293                                    bool replace_length_in_map) {

3715   InitializeNode* init = insert_mem_bar_volatile(Op_Initialize, rawidx,
3716                                                  rawoop)->as_Initialize();
3717   assert(alloc->initialization() == init,  "2-way macro link must work");
3718   assert(init ->allocation()     == alloc, "2-way macro link must work");
3719   {
3720     // Extract memory strands which may participate in the new object's
3721     // initialization, and source them from the new InitializeNode.
3722     // This will allow us to observe initializations when they occur,
3723     // and link them properly (as a group) to the InitializeNode.
3724     assert(init->in(InitializeNode::Memory) == malloc, "");
3725     MergeMemNode* minit_in = MergeMemNode::make(malloc);
3726     init->set_req(InitializeNode::Memory, minit_in);
3727     record_for_igvn(minit_in); // fold it up later, if possible
3728     Node* minit_out = memory(rawidx);
3729     assert(minit_out->is_Proj() && minit_out->in(0) == init, "");
3730     int mark_idx = C->get_alias_index(oop_type->add_offset(oopDesc::mark_offset_in_bytes()));
3731     // Add an edge in the MergeMem for the header fields so an access to one of those has correct memory state.
3732     // Use one NarrowMemProjNode per slice to properly record the adr type of each slice. The Initialize node will have
3733     // multiple projections as a result.
3734     set_memory(_gvn.transform(new NarrowMemProjNode(init, C->get_adr_type(mark_idx))), mark_idx);
3735     int klass_idx = C->get_alias_index(oop_type->add_offset(oopDesc::klass_offset_in_bytes()));
3736     set_memory(_gvn.transform(new NarrowMemProjNode(init, C->get_adr_type(klass_idx))), klass_idx);
3737     if (oop_type->isa_aryptr()) {
3738       const TypePtr* telemref = oop_type->add_offset(Type::OffsetBot);
3739       int            elemidx  = C->get_alias_index(telemref);
3740       hook_memory_on_init(*this, elemidx, minit_in, _gvn.transform(new NarrowMemProjNode(init, C->get_adr_type(elemidx))));
3741     } else if (oop_type->isa_instptr()) {
3742       ciInstanceKlass* ik = oop_type->is_instptr()->instance_klass();
3743       for (int i = 0, len = ik->nof_nonstatic_fields(); i < len; i++) {
3744         ciField* field = ik->nonstatic_field_at(i);
3745         if (field->offset_in_bytes() >= TrackedInitializationLimit * HeapWordSize)
3746           continue;  // do not bother to track really large numbers of fields
3747         // Find (or create) the alias category for this field:
3748         int fieldidx = C->alias_type(field)->index();
3749         hook_memory_on_init(*this, fieldidx, minit_in, _gvn.transform(new NarrowMemProjNode(init, C->get_adr_type(fieldidx))));
3750       }
3751     }
3752   }
3753 
3754   // Cast raw oop to the real thing...
3755   Node* javaoop = new CheckCastPPNode(control(), rawoop, oop_type);

1253   }
1254   Node* conv = _gvn.transform( new ConvI2LNode(offset));
1255   Node* mask = _gvn.transform(ConLNode::make((julong) max_juint));
1256   return _gvn.transform( new AndLNode(conv, mask) );
1257 }
1258 
1259 Node* GraphKit::ConvL2I(Node* offset) {
1260   // short-circuit a common case
1261   jlong offset_con = find_long_con(offset, (jlong)Type::OffsetBot);
1262   if (offset_con != (jlong)Type::OffsetBot) {
1263     return intcon((int) offset_con);
1264   }
1265   return _gvn.transform( new ConvL2INode(offset));
1266 }
1267 
1268 //-------------------------load_object_klass-----------------------------------
1269 Node* GraphKit::load_object_klass(Node* obj) {
1270   // Special-case a fresh allocation to avoid building nodes:
1271   Node* akls = AllocateNode::Ideal_klass(obj, &_gvn);
1272   if (akls != nullptr)  return akls;
1273   Node* k_adr = basic_plus_adr(obj, Type::klass_offset());
1274   return _gvn.transform(LoadKlassNode::make(_gvn, immutable_memory(), k_adr, TypeInstPtr::KLASS));
1275 }
1276 
1277 //-------------------------load_array_length-----------------------------------
1278 Node* GraphKit::load_array_length(Node* array) {
1279   // Special-case a fresh allocation to avoid building nodes:
1280   AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(array);
1281   Node *alen;
1282   if (alloc == nullptr) {
1283     Node *r_adr = basic_plus_adr(array, arrayOopDesc::length_offset_in_bytes());
1284     alen = _gvn.transform( new LoadRangeNode(nullptr, immutable_memory(), r_adr, TypeInt::POS));
1285   } else {
1286     alen = array_ideal_length(alloc, _gvn.type(array)->is_oopptr(), false);
1287   }
1288   return alen;
1289 }
1290 
1291 Node* GraphKit::array_ideal_length(AllocateArrayNode* alloc,
1292                                    const TypeOopPtr* oop_type,
1293                                    bool replace_length_in_map) {

3715   InitializeNode* init = insert_mem_bar_volatile(Op_Initialize, rawidx,
3716                                                  rawoop)->as_Initialize();
3717   assert(alloc->initialization() == init,  "2-way macro link must work");
3718   assert(init ->allocation()     == alloc, "2-way macro link must work");
3719   {
3720     // Extract memory strands which may participate in the new object's
3721     // initialization, and source them from the new InitializeNode.
3722     // This will allow us to observe initializations when they occur,
3723     // and link them properly (as a group) to the InitializeNode.
3724     assert(init->in(InitializeNode::Memory) == malloc, "");
3725     MergeMemNode* minit_in = MergeMemNode::make(malloc);
3726     init->set_req(InitializeNode::Memory, minit_in);
3727     record_for_igvn(minit_in); // fold it up later, if possible
3728     Node* minit_out = memory(rawidx);
3729     assert(minit_out->is_Proj() && minit_out->in(0) == init, "");
3730     int mark_idx = C->get_alias_index(oop_type->add_offset(oopDesc::mark_offset_in_bytes()));
3731     // Add an edge in the MergeMem for the header fields so an access to one of those has correct memory state.
3732     // Use one NarrowMemProjNode per slice to properly record the adr type of each slice. The Initialize node will have
3733     // multiple projections as a result.
3734     set_memory(_gvn.transform(new NarrowMemProjNode(init, C->get_adr_type(mark_idx))), mark_idx);
3735     int klass_idx = C->get_alias_index(oop_type->add_offset(Type::klass_offset()));
3736     set_memory(_gvn.transform(new NarrowMemProjNode(init, C->get_adr_type(klass_idx))), klass_idx);
3737     if (oop_type->isa_aryptr()) {
3738       const TypePtr* telemref = oop_type->add_offset(Type::OffsetBot);
3739       int            elemidx  = C->get_alias_index(telemref);
3740       hook_memory_on_init(*this, elemidx, minit_in, _gvn.transform(new NarrowMemProjNode(init, C->get_adr_type(elemidx))));
3741     } else if (oop_type->isa_instptr()) {
3742       ciInstanceKlass* ik = oop_type->is_instptr()->instance_klass();
3743       for (int i = 0, len = ik->nof_nonstatic_fields(); i < len; i++) {
3744         ciField* field = ik->nonstatic_field_at(i);
3745         if (field->offset_in_bytes() >= TrackedInitializationLimit * HeapWordSize)
3746           continue;  // do not bother to track really large numbers of fields
3747         // Find (or create) the alias category for this field:
3748         int fieldidx = C->alias_type(field)->index();
3749         hook_memory_on_init(*this, fieldidx, minit_in, _gvn.transform(new NarrowMemProjNode(init, C->get_adr_type(fieldidx))));
3750       }
3751     }
3752   }
3753 
3754   // Cast raw oop to the real thing...
3755   Node* javaoop = new CheckCastPPNode(control(), rawoop, oop_type);
< prev index next >