< prev index next >

src/share/vm/opto/valuetypenode.cpp

Print this page




  38 Node* ValueTypeNode::make_default(PhaseGVN& gvn, ciValueKlass* vk) {
  39   // TODO re-use constant oop of pre-allocated default value type here?
  40   // Create a new ValueTypeNode with default values
  41   ValueTypeNode* vt = ValueTypeNode::make(gvn, vk);
  42   for (uint i = 0; i < vt->field_count(); ++i) {
  43     ciType* field_type = vt->field_type(i);
  44     Node* value = NULL;
  45     if (field_type->is_primitive_type()) {
  46       value = gvn.zerocon(field_type->basic_type());
  47     } else {
  48       value = ValueTypeNode::make_default(gvn, field_type->as_value_klass());
  49     }
  50     vt->set_field_value(i, value);
  51   }
  52   return gvn.transform(vt);
  53 }
  54 
  55 Node* ValueTypeNode::make(PhaseGVN& gvn, Node* mem, Node* oop) {
  56   // Create and initialize a ValueTypeNode by loading all field
  57   // values from a heap-allocated version and also save the oop.
  58   const TypeValueTypePtr* vtptr = gvn.type(oop)->is_valuetypeptr();
  59   ValueTypeNode* vt = new ValueTypeNode(vtptr->value_type(), oop);
  60   vt->load_values(gvn, mem, oop, oop);
  61   return gvn.transform(vt);
  62 }
  63 
  64 Node* ValueTypeNode::make(PhaseGVN& gvn, ciValueKlass* vk, Node* mem, Node* obj, Node* ptr, ciKlass* holder, int field_offset) {
  65   // Create and initialize a ValueTypeNode by loading all field values from
  66   // a flattened value type field at 'field_offset' or from a value type array.
  67   ValueTypeNode* vt = make(gvn, vk);
  68   int base_offset = 0;
  69   if (holder->is_value_array_klass()) {
  70     assert(field_offset == 0, "field offset not supported for arrays");
  71   } else {
  72     // The value type is flattened into the object without an oop header. Subtract the
  73     // offset of the first field to account for the missing header when loading the values.
  74     base_offset = field_offset - vk->first_field_offset();
  75   }
  76   vt->load_values(gvn, mem, obj, ptr, holder, base_offset);
  77   return gvn.transform(vt);
  78 }
  79 
  80 void ValueTypeNode::load_values(PhaseGVN& gvn, Node* mem, Node* base, Node* ptr, ciKlass* holder, int f_offset) {
  81   ciInstanceKlass* lookup;
  82   if (holder) {
  83     // Flattened
  84     if (holder->is_value_array_klass()) {
  85       lookup = value_klass();
  86     } else {
  87       lookup = holder->as_instance_klass();
  88     }
  89   } else {
  90     // Not flattened
  91     assert(f_offset == 0, "must be");
  92     lookup = value_klass();
  93   }
  94   // Initialize the value type by loading its field values from
  95   // memory and adding the values as input edges to the node.
  96   for (uint i = 0; i < field_count(); ++i) {
  97     int offset = f_offset + field_offset(i);
  98     ciField* field = lookup->get_field_by_offset(offset, false);
  99     ciType* f_type = field_type(i);
 100     Node* value = NULL;
 101     if (f_type->is_valuetype()) {
 102       if (holder && holder->is_value_array_klass()) {
 103         offset -= value_klass()->first_field_offset();
 104       }
 105       // Recursively load the flattened value type field
 106       value = ValueTypeNode::make(gvn, f_type->as_value_klass(), mem, base, ptr, lookup, offset);
 107     } else {
 108       const Type* con_type = NULL;
 109       if (base->is_Con()) {
 110         // If the oop to the value type is constant (static final field), we can
 111         // also treat the fields as constants because the value type is immutable.
 112         const TypeOopPtr* oop_ptr = base->bottom_type()->isa_oopptr();
 113         ciObject* constant_oop = oop_ptr->const_oop();

 114         ciConstant constant = constant_oop->as_instance()->field_value(field);
 115         con_type = Type::make_from_constant(constant, /*require_const=*/ true);
 116       }
 117       if (con_type != NULL) {
 118         // Found a constant field value
 119         value = gvn.makecon(con_type);
 120       } else {
 121         // Load field value from memory
 122         if (holder && holder->is_value_array_klass()) {
 123           offset -= value_klass()->first_field_offset();
 124         }
 125         const Type* base_type = gvn.type(base); 
 126         const TypePtr* adr_type = NULL;
 127         if (base_type->isa_aryptr()) {
 128           // In the case of a flattened value type array, each field
 129           // has its own slice
 130           adr_type = base_type->is_aryptr()->with_field_offset(offset)->add_offset(Type::OffsetBot);
 131         } else {

 132           adr_type = gvn.C->alias_type(field)->adr_type();
 133         }
 134         Node* adr = gvn.transform(new AddPNode(base, ptr, gvn.MakeConX(offset)));
 135         value = LoadNode::make(gvn, NULL, mem, adr, adr_type, Type::get_const_type(f_type), f_type->basic_type(), MemNode::unordered);
 136       }
 137     }
 138     set_field_value(i, gvn.transform(value));
 139   }
 140 }
 141 
 142 void ValueTypeNode::store_to_field(GraphKit* kit, Node* obj, Node* ptr, ciInstanceKlass* instance_type, int field_offset) const {
 143   // The value type is embedded into the object without an oop header. Subtract the
 144   // offset of the first field to account for the missing header when storing the values.
 145   int base_offset = field_offset - value_klass()->first_field_offset();
 146   store_values(kit, obj, ptr, instance_type, base_offset);
 147 }
 148 
 149 void ValueTypeNode::store_values(GraphKit* kit, Node* base, Node* ptr, ciKlass* holder, int holder_offset) const {
 150   ciInstanceKlass* lookup;
 151   if (holder) {
 152     // flattened
 153     if (holder->is_value_array_klass()) {
 154       assert(holder_offset == 0, "must be");
 155       lookup = value_klass();
 156     } else {
 157       lookup = holder->as_instance_klass();
 158     }
 159   } else {
 160     // not flattened
 161     assert(holder_offset == 0, "must be");
 162     lookup = value_klass();
 163   }
 164   // Write field values to memory
 165   for (uint i = 0; i < field_count(); ++i) {
 166     int offset = holder_offset + field_offset(i);
 167     Node* value = field_value(i);
 168     if (value->is_ValueType()) {
 169       // Recursively store the flattened value type field
 170       if (holder && holder->is_value_array_klass()) {
 171         offset -= value_klass()->first_field_offset();
 172       }
 173       value->isa_ValueType()->store_to_field(kit, base, ptr, lookup, offset);
 174     } else {
 175       if (holder && holder->is_value_array_klass()) {
 176         offset -= value_klass()->first_field_offset();
 177       }
 178       const Type* base_type = kit->gvn().type(base); 
 179       const TypePtr* adr_type = NULL;
 180       if (base_type->isa_aryptr()) {
 181         // In the case of a flattened value type array, each field has
 182         // its own slice
 183         adr_type = base_type->is_aryptr()->with_field_offset(offset)->add_offset(Type::OffsetBot);
 184       } else {
 185         ciField* field = lookup->get_field_by_offset(offset, false);
 186         adr_type = kit->C->alias_type(field)->adr_type();
 187       }
 188       Node* adr = kit->basic_plus_adr(base, ptr, offset);
 189       kit->store_to_memory(kit->control(), adr, value, field_type(i)->basic_type(), adr_type, MemNode::unordered);
 190     }
 191   }
 192 }
 193 
 194 Node* ValueTypeNode::store_to_memory(GraphKit* kit) {
 195   Node* in_oop = get_oop();
 196   Node* null_ctl = kit->top();
 197   // Check if value type is already allocated
 198   Node* not_null_oop = kit->null_check_oop(in_oop, &null_ctl);
 199   if (null_ctl->is_top()) {
 200     // Value type is allocated
 201     return not_null_oop;
 202   }
 203   // Not able to prove that value type is allocated.
 204   // Emit runtime check that may be folded later.
 205   const Type* oop_type = kit->gvn().type(in_oop);
 206   assert(TypePtr::NULL_PTR->higher_equal(oop_type), "should not be allocated");
 207 
 208   const TypeValueTypePtr* vtptr_type = TypeValueTypePtr::make(bottom_type()->isa_valuetype(), TypePtr::NotNull);
 209   RegionNode* region = new RegionNode(3);
 210   PhiNode* oop = new PhiNode(region, vtptr_type);
 211   PhiNode* io  = new PhiNode(region, Type::ABIO);
 212   PhiNode* mem = new PhiNode(region, Type::MEMORY, TypePtr::BOTTOM);
 213 
 214   // Oop is non-NULL, use it
 215   region->init_req(1, kit->control());
 216   // Fixme if we cast oop to not null we fail if the control path is not folded
 217   // castnode.cpp:69: #  assert(ft == Type::TOP) failed: special case #3
 218   //oop   ->init_req(1, not_null_oop);
 219   oop   ->init_req(1, in_oop);
 220   io    ->init_req(1, kit->i_o());
 221   mem   ->init_req(1, kit->merged_memory());
 222 
 223   // Oop is NULL, allocate value type
 224   kit->set_control(null_ctl);
 225   kit->kill_dead_locals();
 226   Node* klass_node = kit->makecon(TypeKlassPtr::make(value_klass()));

 227   Node* alloc_oop  = kit->new_instance(klass_node);
 228   AllocateNode* alloc = AllocateNode::Ideal_allocation(alloc_oop, &kit->gvn());
 229   // TODO enable/fix this
 230   // alloc->initialization()->set_complete_with_arraycopy();
 231   // Write field values to memory
 232   store_values(kit, alloc_oop, alloc_oop);
 233   region->init_req(2, kit->control());
 234   oop   ->init_req(2, alloc_oop);
 235   io    ->init_req(2, kit->i_o());
 236   mem   ->init_req(2, kit->merged_memory());
 237 
 238   // Update GraphKit
 239   kit->set_control(kit->gvn().transform(region));
 240   kit->set_i_o(kit->gvn().transform(io));
 241   kit->set_all_memory(kit->gvn().transform(mem));
 242   kit->record_for_igvn(region);
 243   kit->record_for_igvn(oop);
 244   kit->record_for_igvn(io);
 245   kit->record_for_igvn(mem);
 246 
 247   // Use cloned ValueTypeNode to propagate oop from now on
 248   Node* res_oop = kit->gvn().transform(oop);
 249   ValueTypeNode* vt = clone()->as_ValueType();
 250   vt->set_oop(res_oop);
 251   kit->replace_in_map(this, kit->gvn().transform(vt));
 252   return res_oop;




  38 Node* ValueTypeNode::make_default(PhaseGVN& gvn, ciValueKlass* vk) {
  39   // TODO re-use constant oop of pre-allocated default value type here?
  40   // Create a new ValueTypeNode with default values
  41   ValueTypeNode* vt = ValueTypeNode::make(gvn, vk);
  42   for (uint i = 0; i < vt->field_count(); ++i) {
  43     ciType* field_type = vt->field_type(i);
  44     Node* value = NULL;
  45     if (field_type->is_primitive_type()) {
  46       value = gvn.zerocon(field_type->basic_type());
  47     } else {
  48       value = ValueTypeNode::make_default(gvn, field_type->as_value_klass());
  49     }
  50     vt->set_field_value(i, value);
  51   }
  52   return gvn.transform(vt);
  53 }
  54 
  55 Node* ValueTypeNode::make(PhaseGVN& gvn, Node* mem, Node* oop) {
  56   // Create and initialize a ValueTypeNode by loading all field
  57   // values from a heap-allocated version and also save the oop.
  58   const TypeValueType* type = gvn.type(oop)->is_valuetypeptr()->value_type();
  59   ValueTypeNode* vt = new ValueTypeNode(type, oop);
  60   vt->load_values(gvn, mem, oop, oop, type->value_klass());
  61   return gvn.transform(vt);
  62 }
  63 
  64 Node* ValueTypeNode::make(PhaseGVN& gvn, ciValueKlass* vk, Node* mem, Node* obj, Node* ptr, ciInstanceKlass* holder, int holder_offset) {
  65   // Create and initialize a ValueTypeNode by loading all field values from
  66   // a flattened value type field at 'holder_offset' or from a value type array.
  67   ValueTypeNode* vt = make(gvn, vk);




  68   // The value type is flattened into the object without an oop header. Subtract the
  69   // offset of the first field to account for the missing header when loading the values.
  70   holder_offset -= vk->first_field_offset();
  71   vt->load_values(gvn, mem, obj, ptr, holder, holder_offset);

  72   return gvn.transform(vt);
  73 }
  74 
  75 void ValueTypeNode::load_values(PhaseGVN& gvn, Node* mem, Node* base, Node* ptr, ciInstanceKlass* holder, int holder_offset) {













  76   // Initialize the value type by loading its field values from
  77   // memory and adding the values as input edges to the node.
  78   for (uint i = 0; i < field_count(); ++i) {
  79     int offset = holder_offset + field_offset(i);
  80     ciType* ftype = field_type(i);

  81     Node* value = NULL;
  82     if (ftype->is_valuetype()) {



  83       // Recursively load the flattened value type field
  84       value = ValueTypeNode::make(gvn, ftype->as_value_klass(), mem, base, ptr, holder, offset);
  85     } else {
  86       const Type* con_type = NULL;
  87       if (base->is_Con()) {
  88         // If the oop to the value type is constant (static final field), we can
  89         // also treat the fields as constants because the value type is immutable.
  90         const TypeOopPtr* oop_ptr = base->bottom_type()->isa_oopptr();
  91         ciObject* constant_oop = oop_ptr->const_oop();
  92         ciField* field = holder->get_field_by_offset(offset, false);
  93         ciConstant constant = constant_oop->as_instance()->field_value(field);
  94         con_type = Type::make_from_constant(constant, /*require_const=*/ true);
  95       }
  96       if (con_type != NULL) {
  97         // Found a constant field value
  98         value = gvn.makecon(con_type);
  99       } else {
 100         // Load field value from memory



 101         const Type* base_type = gvn.type(base); 
 102         const TypePtr* adr_type = NULL;
 103         if (base_type->isa_aryptr()) {
 104           // In the case of a flattened value type array, each field
 105           // has its own slice
 106           adr_type = base_type->is_aryptr()->with_field_offset(offset)->add_offset(Type::OffsetBot);
 107         } else {
 108           ciField* field = holder->get_field_by_offset(offset, false);
 109           adr_type = gvn.C->alias_type(field)->adr_type();
 110         }
 111         Node* adr = gvn.transform(new AddPNode(base, ptr, gvn.MakeConX(offset)));
 112         value = LoadNode::make(gvn, NULL, mem, adr, adr_type, Type::get_const_type(ftype), ftype->basic_type(), MemNode::unordered);
 113       }
 114     }
 115     set_field_value(i, gvn.transform(value));
 116   }
 117 }
 118 
 119 void ValueTypeNode::store(GraphKit* kit, Node* obj, Node* ptr, ciInstanceKlass* holder, int holder_offset) const {
 120   // The value type is embedded into the object without an oop header. Subtract the
 121   // offset of the first field to account for the missing header when storing the values.
 122   holder_offset -= value_klass()->first_field_offset();
 123   store_values(kit, obj, ptr, holder, holder_offset);
 124 }
 125 
 126 void ValueTypeNode::store_values(GraphKit* kit, Node* base, Node* ptr, ciInstanceKlass* holder, int holder_offset) const {














 127   // Write field values to memory
 128   for (uint i = 0; i < field_count(); ++i) {
 129     int offset = holder_offset + field_offset(i);
 130     Node* value = field_value(i);
 131     if (value->is_ValueType()) {
 132       // Recursively store the flattened value type field
 133       value->isa_ValueType()->store(kit, base, ptr, value_klass(), offset);



 134     } else {



 135       const Type* base_type = kit->gvn().type(base); 
 136       const TypePtr* adr_type = NULL;
 137       if (base_type->isa_aryptr()) {
 138         // In the case of a flattened value type array, each field has its own slice

 139         adr_type = base_type->is_aryptr()->with_field_offset(offset)->add_offset(Type::OffsetBot);
 140       } else {
 141         ciField* field = holder->get_field_by_offset(offset, false);
 142         adr_type = kit->C->alias_type(field)->adr_type();
 143       }
 144       Node* adr = kit->basic_plus_adr(base, ptr, offset);
 145       kit->store_to_memory(kit->control(), adr, value, field_type(i)->basic_type(), adr_type, MemNode::unordered);
 146     }
 147   }
 148 }
 149 
 150 Node* ValueTypeNode::store_to_memory(GraphKit* kit) {
 151   Node* in_oop = get_oop();
 152   Node* null_ctl = kit->top();
 153   // Check if value type is already allocated
 154   Node* not_null_oop = kit->null_check_oop(in_oop, &null_ctl);
 155   if (null_ctl->is_top()) {
 156     // Value type is allocated
 157     return not_null_oop;
 158   }
 159   // Not able to prove that value type is allocated.
 160   // Emit runtime check that may be folded later.
 161   const Type* oop_type = kit->gvn().type(in_oop);
 162   assert(TypePtr::NULL_PTR->higher_equal(oop_type), "should not be allocated");
 163 
 164   const TypeValueTypePtr* vtptr_type = TypeValueTypePtr::make(bottom_type()->isa_valuetype(), TypePtr::NotNull);
 165   RegionNode* region = new RegionNode(3);
 166   PhiNode* oop = new PhiNode(region, vtptr_type);
 167   PhiNode* io  = new PhiNode(region, Type::ABIO);
 168   PhiNode* mem = new PhiNode(region, Type::MEMORY, TypePtr::BOTTOM);
 169 
 170   // Oop is non-NULL, use it
 171   region->init_req(1, kit->control());
 172   // Fixme if we cast oop to not null we fail if the control path is not folded
 173   // castnode.cpp:69: #  assert(ft == Type::TOP) failed: special case #3
 174   //oop   ->init_req(1, not_null_oop);
 175   oop   ->init_req(1, in_oop);
 176   io    ->init_req(1, kit->i_o());
 177   mem   ->init_req(1, kit->merged_memory());
 178 
 179   // Oop is NULL, allocate value type
 180   kit->set_control(null_ctl);
 181   kit->kill_dead_locals();
 182   ciValueKlass* vk = value_klass();
 183   Node* klass_node = kit->makecon(TypeKlassPtr::make(vk));
 184   Node* alloc_oop  = kit->new_instance(klass_node);
 185   AllocateNode* alloc = AllocateNode::Ideal_allocation(alloc_oop, &kit->gvn());
 186   // TODO enable/fix this
 187   // alloc->initialization()->set_complete_with_arraycopy();
 188   // Write field values to memory
 189   store_values(kit, alloc_oop, alloc_oop, vk);
 190   region->init_req(2, kit->control());
 191   oop   ->init_req(2, alloc_oop);
 192   io    ->init_req(2, kit->i_o());
 193   mem   ->init_req(2, kit->merged_memory());
 194 
 195   // Update GraphKit
 196   kit->set_control(kit->gvn().transform(region));
 197   kit->set_i_o(kit->gvn().transform(io));
 198   kit->set_all_memory(kit->gvn().transform(mem));
 199   kit->record_for_igvn(region);
 200   kit->record_for_igvn(oop);
 201   kit->record_for_igvn(io);
 202   kit->record_for_igvn(mem);
 203 
 204   // Use cloned ValueTypeNode to propagate oop from now on
 205   Node* res_oop = kit->gvn().transform(oop);
 206   ValueTypeNode* vt = clone()->as_ValueType();
 207   vt->set_oop(res_oop);
 208   kit->replace_in_map(this, kit->gvn().transform(vt));
 209   return res_oop;


< prev index next >