< prev index next >

src/hotspot/share/opto/macro.cpp

Print this page

1682     transform_later(rawmem);
1683   }
1684 }
1685 
1686 // Helper for PhaseMacroExpand::expand_allocate_common.
1687 // Initializes the newly-allocated storage.
1688 Node*
1689 PhaseMacroExpand::initialize_object(AllocateNode* alloc,
1690                                     Node* control, Node* rawmem, Node* object,
1691                                     Node* klass_node, Node* length,
1692                                     Node* size_in_bytes) {
1693   InitializeNode* init = alloc->initialization();
1694   // Store the klass & mark bits
1695   Node* mark_node = alloc->make_ideal_mark(&_igvn, object, control, rawmem);
1696   if (!mark_node->is_Con()) {
1697     transform_later(mark_node);
1698   }
1699   rawmem = make_store(control, rawmem, object, oopDesc::mark_offset_in_bytes(), mark_node, TypeX_X->basic_type());
1700 
1701   if (!UseCompactObjectHeaders) {
1702     rawmem = make_store(control, rawmem, object, oopDesc::klass_offset_in_bytes(), klass_node, T_METADATA);
1703   }
1704   int header_size = alloc->minimum_header_size();  // conservatively small
1705 
1706   // Array length
1707   if (length != nullptr) {         // Arrays need length field
1708     rawmem = make_store(control, rawmem, object, arrayOopDesc::length_offset_in_bytes(), length, T_INT);
1709     // conservatively small header size:
1710     header_size = arrayOopDesc::base_offset_in_bytes(T_BYTE);
1711     if (_igvn.type(klass_node)->isa_aryklassptr()) {   // we know the exact header size in most cases:
1712       BasicType elem = _igvn.type(klass_node)->is_klassptr()->as_instance_type()->isa_aryptr()->elem()->array_element_basic_type();
1713       if (is_reference_type(elem, true)) {
1714         elem = T_OBJECT;
1715       }
1716       header_size = Klass::layout_helper_header_size(Klass::array_layout_helper(elem));
1717     }
1718   }
1719 
1720   // Clear the object body, if necessary.
1721   if (init == nullptr) {
1722     // The init has somehow disappeared; be cautious and clear everything.

2309   Node* superklass = check->in(SubTypeCheckNode::SuperKlass);
2310   assert(bol->is_Bool() && bol->as_Bool()->_test._test == BoolTest::ne, "unexpected bool node");
2311 
2312   for (DUIterator_Last imin, i = bol->last_outs(imin); i >= imin; --i) {
2313     Node* iff = bol->last_out(i);
2314     assert(iff->is_If(), "where's the if?");
2315 
2316     if (iff->in(0)->is_top()) {
2317       _igvn.replace_input_of(iff, 1, C->top());
2318       continue;
2319     }
2320 
2321     Node* iftrue = iff->as_If()->proj_out(1);
2322     Node* iffalse = iff->as_If()->proj_out(0);
2323     Node* ctrl = iff->in(0);
2324 
2325     Node* subklass = nullptr;
2326     if (_igvn.type(obj_or_subklass)->isa_klassptr()) {
2327       subklass = obj_or_subklass;
2328     } else {
2329       Node* k_adr = basic_plus_adr(obj_or_subklass, oopDesc::klass_offset_in_bytes());
2330       subklass = _igvn.transform(LoadKlassNode::make(_igvn, C->immutable_memory(), k_adr, TypeInstPtr::KLASS));
2331     }
2332 
2333     Node* not_subtype_ctrl = Phase::gen_subtype_check(subklass, superklass, &ctrl, nullptr, _igvn, check->method(), check->bci());
2334 
2335     _igvn.replace_input_of(iff, 0, C->top());
2336     _igvn.replace_node(iftrue, not_subtype_ctrl);
2337     _igvn.replace_node(iffalse, ctrl);
2338   }
2339   _igvn.replace_node(check, C->top());
2340 }
2341 
2342 // Perform refining of strip mined loop nodes in the macro nodes list.
2343 void PhaseMacroExpand::refine_strip_mined_loop_macro_nodes() {
2344    for (int i = C->macro_count(); i > 0; i--) {
2345     Node* n = C->macro_node(i - 1);
2346     if (n->is_OuterStripMinedLoop()) {
2347       n->as_OuterStripMinedLoop()->adjust_strip_mined_loop(&_igvn);
2348     }
2349   }

1682     transform_later(rawmem);
1683   }
1684 }
1685 
1686 // Helper for PhaseMacroExpand::expand_allocate_common.
1687 // Initializes the newly-allocated storage.
1688 Node*
1689 PhaseMacroExpand::initialize_object(AllocateNode* alloc,
1690                                     Node* control, Node* rawmem, Node* object,
1691                                     Node* klass_node, Node* length,
1692                                     Node* size_in_bytes) {
1693   InitializeNode* init = alloc->initialization();
1694   // Store the klass & mark bits
1695   Node* mark_node = alloc->make_ideal_mark(&_igvn, object, control, rawmem);
1696   if (!mark_node->is_Con()) {
1697     transform_later(mark_node);
1698   }
1699   rawmem = make_store(control, rawmem, object, oopDesc::mark_offset_in_bytes(), mark_node, TypeX_X->basic_type());
1700 
1701   if (!UseCompactObjectHeaders) {
1702     rawmem = make_store(control, rawmem, object, Type::klass_offset(), klass_node, T_METADATA);
1703   }
1704   int header_size = alloc->minimum_header_size();  // conservatively small
1705 
1706   // Array length
1707   if (length != nullptr) {         // Arrays need length field
1708     rawmem = make_store(control, rawmem, object, arrayOopDesc::length_offset_in_bytes(), length, T_INT);
1709     // conservatively small header size:
1710     header_size = arrayOopDesc::base_offset_in_bytes(T_BYTE);
1711     if (_igvn.type(klass_node)->isa_aryklassptr()) {   // we know the exact header size in most cases:
1712       BasicType elem = _igvn.type(klass_node)->is_klassptr()->as_instance_type()->isa_aryptr()->elem()->array_element_basic_type();
1713       if (is_reference_type(elem, true)) {
1714         elem = T_OBJECT;
1715       }
1716       header_size = Klass::layout_helper_header_size(Klass::array_layout_helper(elem));
1717     }
1718   }
1719 
1720   // Clear the object body, if necessary.
1721   if (init == nullptr) {
1722     // The init has somehow disappeared; be cautious and clear everything.

2309   Node* superklass = check->in(SubTypeCheckNode::SuperKlass);
2310   assert(bol->is_Bool() && bol->as_Bool()->_test._test == BoolTest::ne, "unexpected bool node");
2311 
2312   for (DUIterator_Last imin, i = bol->last_outs(imin); i >= imin; --i) {
2313     Node* iff = bol->last_out(i);
2314     assert(iff->is_If(), "where's the if?");
2315 
2316     if (iff->in(0)->is_top()) {
2317       _igvn.replace_input_of(iff, 1, C->top());
2318       continue;
2319     }
2320 
2321     Node* iftrue = iff->as_If()->proj_out(1);
2322     Node* iffalse = iff->as_If()->proj_out(0);
2323     Node* ctrl = iff->in(0);
2324 
2325     Node* subklass = nullptr;
2326     if (_igvn.type(obj_or_subklass)->isa_klassptr()) {
2327       subklass = obj_or_subklass;
2328     } else {
2329       Node* k_adr = basic_plus_adr(obj_or_subklass, Type::klass_offset());
2330       subklass = _igvn.transform(LoadKlassNode::make(_igvn, C->immutable_memory(), k_adr, TypeInstPtr::KLASS));
2331     }
2332 
2333     Node* not_subtype_ctrl = Phase::gen_subtype_check(subklass, superklass, &ctrl, nullptr, _igvn, check->method(), check->bci());
2334 
2335     _igvn.replace_input_of(iff, 0, C->top());
2336     _igvn.replace_node(iftrue, not_subtype_ctrl);
2337     _igvn.replace_node(iffalse, ctrl);
2338   }
2339   _igvn.replace_node(check, C->top());
2340 }
2341 
2342 // Perform refining of strip mined loop nodes in the macro nodes list.
2343 void PhaseMacroExpand::refine_strip_mined_loop_macro_nodes() {
2344    for (int i = C->macro_count(); i > 0; i--) {
2345     Node* n = C->macro_node(i - 1);
2346     if (n->is_OuterStripMinedLoop()) {
2347       n->as_OuterStripMinedLoop()->adjust_strip_mined_loop(&_igvn);
2348     }
2349   }
< prev index next >