< prev index next >

src/hotspot/share/opto/library_call.cpp

Print this page

4705     // and skip a call to MH.linkTo*/invokeBasic adapter, additional information
4706     // about the method being invoked should be attached to the call site to
4707     // make resolution logic work (see SharedRuntime::resolve_{virtual,opt_virtual}_call_C).
4708     slow_call->set_override_symbolic_info(true);
4709   }
4710   set_arguments_for_java_call(slow_call);
4711   set_edges_for_java_call(slow_call);
4712   return slow_call;
4713 }
4714 
4715 
4716 /**
4717  * Build special case code for calls to hashCode on an object. This call may
4718  * be virtual (invokevirtual) or bound (invokespecial). For each case we generate
4719  * slightly different code.
4720  */
4721 bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) {
4722   assert(is_static == callee()->is_static(), "correct intrinsic selection");
4723   assert(!(is_virtual && is_static), "either virtual, special, or static");
4724 
4725   enum { _slow_path = 1, _fast_path, _null_path, PATH_LIMIT };
4726 
4727   RegionNode* result_reg = new RegionNode(PATH_LIMIT);
4728   PhiNode*    result_val = new PhiNode(result_reg, TypeInt::INT);
4729   PhiNode*    result_io  = new PhiNode(result_reg, Type::ABIO);
4730   PhiNode*    result_mem = new PhiNode(result_reg, Type::MEMORY, TypePtr::BOTTOM);
4731   Node* obj = nullptr;
4732   if (!is_static) {
4733     // Check for hashing null object
4734     obj = null_check_receiver();
4735     if (stopped())  return true;        // unconditionally null
4736     result_reg->init_req(_null_path, top());
4737     result_val->init_req(_null_path, top());
4738   } else {
4739     // Do a null check, and return zero if null.
4740     // System.identityHashCode(null) == 0
4741     obj = argument(0);
4742     Node* null_ctl = top();
4743     obj = null_check_oop(obj, &null_ctl);
4744     result_reg->init_req(_null_path, null_ctl);
4745     result_val->init_req(_null_path, _gvn.intcon(0));

4753     return true;
4754   }
4755 
4756   // We only go to the fast case code if we pass a number of guards.  The
4757   // paths which do not pass are accumulated in the slow_region.
4758   RegionNode* slow_region = new RegionNode(1);
4759   record_for_igvn(slow_region);
4760 
4761   // If this is a virtual call, we generate a funny guard.  We pull out
4762   // the vtable entry corresponding to hashCode() from the target object.
4763   // If the target method which we are calling happens to be the native
4764   // Object hashCode() method, we pass the guard.  We do not need this
4765   // guard for non-virtual calls -- the caller is known to be the native
4766   // Object hashCode().
4767   if (is_virtual) {
4768     // After null check, get the object's klass.
4769     Node* obj_klass = load_object_klass(obj);
4770     generate_virtual_guard(obj_klass, slow_region);
4771   }
4772 
4773   // Get the header out of the object, use LoadMarkNode when available
4774   Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes());
4775   // The control of the load must be null. Otherwise, the load can move before
4776   // the null check after castPP removal.
4777   Node* no_ctrl = nullptr;
4778   Node* header = make_load(no_ctrl, header_addr, TypeX_X, TypeX_X->basic_type(), MemNode::unordered);




























4779 
4780   if (!UseObjectMonitorTable) {
4781     // Test the header to see if it is safe to read w.r.t. locking.
4782     Node *lock_mask      = _gvn.MakeConX(markWord::lock_mask_in_place);
4783     Node *lmasked_header = _gvn.transform(new AndXNode(header, lock_mask));
4784     if (LockingMode == LM_LIGHTWEIGHT) {
4785       Node *monitor_val   = _gvn.MakeConX(markWord::monitor_value);
4786       Node *chk_monitor   = _gvn.transform(new CmpXNode(lmasked_header, monitor_val));
4787       Node *test_monitor  = _gvn.transform(new BoolNode(chk_monitor, BoolTest::eq));











4788 
4789       generate_slow_guard(test_monitor, slow_region);
4790     } else {
4791       Node *unlocked_val      = _gvn.MakeConX(markWord::unlocked_value);
4792       Node *chk_unlocked      = _gvn.transform(new CmpXNode(lmasked_header, unlocked_val));
4793       Node *test_not_unlocked = _gvn.transform(new BoolNode(chk_unlocked, BoolTest::ne));

















4794 
4795       generate_slow_guard(test_not_unlocked, slow_region);













































































4796     }
4797   }
4798 
4799   // Get the hash value and check to see that it has been properly assigned.
4800   // We depend on hash_mask being at most 32 bits and avoid the use of
4801   // hash_mask_in_place because it could be larger than 32 bits in a 64-bit
4802   // vm: see markWord.hpp.
4803   Node *hash_mask      = _gvn.intcon(markWord::hash_mask);
4804   Node *hash_shift     = _gvn.intcon(markWord::hash_shift);
4805   Node *hshifted_header= _gvn.transform(new URShiftXNode(header, hash_shift));
4806   // This hack lets the hash bits live anywhere in the mark object now, as long
4807   // as the shift drops the relevant bits into the low 32 bits.  Note that
4808   // Java spec says that HashCode is an int so there's no point in capturing
4809   // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build).
4810   hshifted_header      = ConvX2I(hshifted_header);
4811   Node *hash_val       = _gvn.transform(new AndINode(hshifted_header, hash_mask));
4812 
4813   Node *no_hash_val    = _gvn.intcon(markWord::no_hash);
4814   Node *chk_assigned   = _gvn.transform(new CmpINode( hash_val, no_hash_val));
4815   Node *test_assigned  = _gvn.transform(new BoolNode( chk_assigned, BoolTest::eq));
4816 
4817   generate_slow_guard(test_assigned, slow_region);









4818 
4819   Node* init_mem = reset_memory();
4820   // fill in the rest of the null path:
4821   result_io ->init_req(_null_path, i_o());
4822   result_mem->init_req(_null_path, init_mem);
4823 
4824   result_val->init_req(_fast_path, hash_val);
4825   result_reg->init_req(_fast_path, control());
4826   result_io ->init_req(_fast_path, i_o());
4827   result_mem->init_req(_fast_path, init_mem);
4828 





4829   // Generate code for the slow case.  We make a call to hashCode().

4830   set_control(_gvn.transform(slow_region));
4831   if (!stopped()) {
4832     // No need for PreserveJVMState, because we're using up the present state.
4833     set_all_memory(init_mem);
4834     vmIntrinsics::ID hashCode_id = is_static ? vmIntrinsics::_identityHashCode : vmIntrinsics::_hashCode;
4835     CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static, false);
4836     Node* slow_result = set_results_for_java_call(slow_call);
4837     // this->control() comes from set_results_for_java_call
4838     result_reg->init_req(_slow_path, control());
4839     result_val->init_req(_slow_path, slow_result);
4840     result_io  ->set_req(_slow_path, i_o());
4841     result_mem ->set_req(_slow_path, reset_memory());
4842   }
4843 
4844   // Return the combined state.
4845   set_i_o(        _gvn.transform(result_io)  );
4846   set_all_memory( _gvn.transform(result_mem));
4847 
4848   set_result(result_reg, result_val);
4849   return true;

4705     // and skip a call to MH.linkTo*/invokeBasic adapter, additional information
4706     // about the method being invoked should be attached to the call site to
4707     // make resolution logic work (see SharedRuntime::resolve_{virtual,opt_virtual}_call_C).
4708     slow_call->set_override_symbolic_info(true);
4709   }
4710   set_arguments_for_java_call(slow_call);
4711   set_edges_for_java_call(slow_call);
4712   return slow_call;
4713 }
4714 
4715 
4716 /**
4717  * Build special case code for calls to hashCode on an object. This call may
4718  * be virtual (invokevirtual) or bound (invokespecial). For each case we generate
4719  * slightly different code.
4720  */
4721 bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) {
4722   assert(is_static == callee()->is_static(), "correct intrinsic selection");
4723   assert(!(is_virtual && is_static), "either virtual, special, or static");
4724 
4725   enum { _slow_path = 1, _null_path, _fast_path, _fast_path2, PATH_LIMIT };
4726 
4727   RegionNode* result_reg = new RegionNode(PATH_LIMIT);
4728   PhiNode*    result_val = new PhiNode(result_reg, TypeInt::INT);
4729   PhiNode*    result_io  = new PhiNode(result_reg, Type::ABIO);
4730   PhiNode*    result_mem = new PhiNode(result_reg, Type::MEMORY, TypePtr::BOTTOM);
4731   Node* obj = nullptr;
4732   if (!is_static) {
4733     // Check for hashing null object
4734     obj = null_check_receiver();
4735     if (stopped())  return true;        // unconditionally null
4736     result_reg->init_req(_null_path, top());
4737     result_val->init_req(_null_path, top());
4738   } else {
4739     // Do a null check, and return zero if null.
4740     // System.identityHashCode(null) == 0
4741     obj = argument(0);
4742     Node* null_ctl = top();
4743     obj = null_check_oop(obj, &null_ctl);
4744     result_reg->init_req(_null_path, null_ctl);
4745     result_val->init_req(_null_path, _gvn.intcon(0));

4753     return true;
4754   }
4755 
4756   // We only go to the fast case code if we pass a number of guards.  The
4757   // paths which do not pass are accumulated in the slow_region.
4758   RegionNode* slow_region = new RegionNode(1);
4759   record_for_igvn(slow_region);
4760 
4761   // If this is a virtual call, we generate a funny guard.  We pull out
4762   // the vtable entry corresponding to hashCode() from the target object.
4763   // If the target method which we are calling happens to be the native
4764   // Object hashCode() method, we pass the guard.  We do not need this
4765   // guard for non-virtual calls -- the caller is known to be the native
4766   // Object hashCode().
4767   if (is_virtual) {
4768     // After null check, get the object's klass.
4769     Node* obj_klass = load_object_klass(obj);
4770     generate_virtual_guard(obj_klass, slow_region);
4771   }
4772 
4773   if (UseCompactObjectHeaders) {
4774     // Get the header out of the object.
4775     Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes());
4776     // The control of the load must be null. Otherwise, the load can move before
4777     // the null check after castPP removal.
4778     Node* no_ctrl = nullptr;
4779     Node* header = make_load(no_ctrl, header_addr, TypeX_X, TypeX_X->basic_type(), MemNode::unordered);
4780 
4781     // Test the header to see if the object is in hashed or copied state.
4782     Node* hashctrl_mask  = _gvn.MakeConX(markWord::hashctrl_mask_in_place);
4783     Node* masked_header  = _gvn.transform(new AndXNode(header, hashctrl_mask));
4784 
4785     // Take slow-path when the object has not been hashed.
4786     Node* not_hashed_val = _gvn.MakeConX(0);
4787     Node* chk_hashed     = _gvn.transform(new CmpXNode(masked_header, not_hashed_val));
4788     Node* test_hashed    = _gvn.transform(new BoolNode(chk_hashed, BoolTest::eq));
4789 
4790     generate_slow_guard(test_hashed, slow_region);
4791 
4792     // Test whether the object is hashed or hashed&copied.
4793     Node* hashed_copied = _gvn.MakeConX(markWord::hashctrl_expanded_mask_in_place | markWord::hashctrl_hashed_mask_in_place);
4794     Node* chk_copied    = _gvn.transform(new CmpXNode(masked_header, hashed_copied));
4795     // If true, then object has been hashed&copied, otherwise it's only hashed.
4796     Node* test_copied   = _gvn.transform(new BoolNode(chk_copied, BoolTest::eq));
4797     IfNode* if_copied   = create_and_map_if(control(), test_copied, PROB_FAIR, COUNT_UNKNOWN);
4798     Node* if_true = _gvn.transform(new IfTrueNode(if_copied));
4799     Node* if_false = _gvn.transform(new IfFalseNode(if_copied));
4800 
4801     // Hashed&Copied path: read hash-code out of the object.
4802     set_control(if_true);
4803     // result_val->del_req(_fast_path2);
4804     // result_reg->del_req(_fast_path2);
4805     // result_io->del_req(_fast_path2);
4806     // result_mem->del_req(_fast_path2);
4807 
4808     Node* obj_klass = load_object_klass(obj);
4809     Node* hash_addr;
4810     const TypeKlassPtr* klass_t = _gvn.type(obj_klass)->isa_klassptr();
4811     bool load_offset_runtime = true;
4812 
4813     if (klass_t != nullptr) {
4814       if (klass_t->klass_is_exact()  && klass_t->isa_instklassptr()) {
4815         ciInstanceKlass* ciKlass = reinterpret_cast<ciInstanceKlass*>(klass_t->is_instklassptr()->exact_klass());
4816         if (!ciKlass->is_mirror_instance_klass() && !ciKlass->is_reference_instance_klass()) {
4817           // We know the InstanceKlass, load hash_offset from there at compile-time.
4818           int hash_offset = ciKlass->hash_offset_in_bytes();
4819           hash_addr = basic_plus_adr(obj, hash_offset);
4820           Node* loaded_hash = make_load(control(), hash_addr, TypeInt::INT, T_INT, MemNode::unordered);
4821           result_val->init_req(_fast_path2, loaded_hash);
4822           result_reg->init_req(_fast_path2, control());
4823           load_offset_runtime = false;
4824         }
4825       }
4826     }
4827 
4828     //tty->print_cr("Load hash-offset at runtime: %s", BOOL_TO_STR(load_offset_runtime));
4829 
4830     if (load_offset_runtime) {
4831       // We don't know if it is an array or an exact type, figure it out at run-time.
4832       // If not an ordinary instance, then we need to take slow-path.
4833       Node* kind_addr = basic_plus_adr(obj_klass, Klass::kind_offset_in_bytes());
4834       Node* kind = make_load(control(), kind_addr, TypeInt::INT, T_INT, MemNode::unordered);
4835       Node* instance_val = _gvn.intcon(Klass::InstanceKlassKind);
4836       Node* chk_inst     = _gvn.transform(new CmpINode(kind, instance_val));
4837       Node* test_inst    = _gvn.transform(new BoolNode(chk_inst, BoolTest::ne));
4838       generate_slow_guard(test_inst, slow_region);
4839 
4840       // Otherwise it's an instance and we can read the hash_offset from the InstanceKlass.
4841       Node* hash_offset_addr = basic_plus_adr(obj_klass, InstanceKlass::hash_offset_offset_in_bytes());
4842       Node* hash_offset = make_load(control(), hash_offset_addr, TypeInt::INT, T_INT, MemNode::unordered);
4843       // hash_offset->dump();
4844       Node* hash_addr = basic_plus_adr(obj, ConvI2X(hash_offset));
4845       Compile::current()->set_has_unsafe_access(true);
4846       Node* loaded_hash = make_load(control(), hash_addr, TypeInt::INT, T_INT, MemNode::unordered);
4847       result_val->init_req(_fast_path2, loaded_hash);
4848       result_reg->init_req(_fast_path2, control());
4849     }
4850 
4851     // Hashed-only path: recompute hash-code from object address.
4852     set_control(if_false);
4853     if (hashCode == 6) {
4854       // Our constants.
4855       Node* M = _gvn.intcon(0x337954D5);
4856       Node* A = _gvn.intcon(0xAAAAAAAA);
4857       // Split object address into lo and hi 32 bits.
4858       Node* obj_addr = _gvn.transform(new CastP2XNode(nullptr, obj));
4859       Node* x = _gvn.transform(new ConvL2INode(obj_addr));
4860       Node* upper_addr = _gvn.transform(new URShiftLNode(obj_addr, _gvn.intcon(32)));
4861       Node* y = _gvn.transform(new ConvL2INode(upper_addr));
4862 
4863       Node* H0 = _gvn.transform(new XorINode(x, y));
4864       Node* L0 = _gvn.transform(new XorINode(x, A));
4865 
4866       // Full multiplication of two 32 bit values L0 and M into a hi/lo result in two 32 bit values V0 and U0.
4867       Node* L0_64 = _gvn.transform(new ConvI2LNode(L0));
4868       L0_64 = _gvn.transform(new AndLNode(L0_64, _gvn.longcon(0xFFFFFFFF)));
4869       Node* M_64 = _gvn.transform(new ConvI2LNode(M));
4870       // M_64 = _gvn.transform(new AndLNode(M_64, _gvn.longcon(0xFFFFFFFF)));
4871       Node* prod64 = _gvn.transform(new MulLNode(L0_64, M_64));
4872       Node* V0 = _gvn.transform(new ConvL2INode(prod64));
4873       Node* prod_upper = _gvn.transform(new URShiftLNode(prod64, _gvn.intcon(32)));
4874       Node* U0 = _gvn.transform(new ConvL2INode(prod_upper));
4875 
4876       Node* Q0 = _gvn.transform(new MulINode(H0, M));
4877       Node* L1 = _gvn.transform(new XorINode(Q0, U0));
4878 
4879       // Full multiplication of two 32 bit values L1 and M into a hi/lo result in two 32 bit values V1 and U1.
4880       Node* L1_64 = _gvn.transform(new ConvI2LNode(L1));
4881       L1_64 = _gvn.transform(new AndLNode(L1_64, _gvn.longcon(0xFFFFFFFF)));
4882       prod64 = _gvn.transform(new MulLNode(L1_64, M_64));
4883       Node* V1 = _gvn.transform(new ConvL2INode(prod64));
4884       prod_upper = _gvn.transform(new URShiftLNode(prod64, _gvn.intcon(32)));
4885       Node* U1 = _gvn.transform(new ConvL2INode(prod_upper));
4886 
4887       Node* P1 = _gvn.transform(new XorINode(V0, M));
4888 
4889       // Right rotate P1 by distance L1.
4890       Node* distance = _gvn.transform(new AndINode(L1, _gvn.intcon(32 - 1)));
4891       Node* inverse_distance = _gvn.transform(new SubINode(_gvn.intcon(32), distance));
4892       Node* ror_part1 = _gvn.transform(new URShiftINode(P1, distance));
4893       Node* ror_part2 = _gvn.transform(new LShiftINode(P1, inverse_distance));
4894       Node* Q1 = _gvn.transform(new OrINode(ror_part1, ror_part2));
4895 
4896       Node* L2 = _gvn.transform(new XorINode(Q1, U1));
4897       Node* hash = _gvn.transform(new XorINode(V1, L2));
4898       Node* hash_truncated = _gvn.transform(new AndINode(hash, _gvn.intcon(markWord::hash_mask)));
4899 
4900       result_val->init_req(_fast_path, hash_truncated);
4901     } else if (hashCode == 2) {
4902       result_val->init_req(_fast_path, _gvn.intcon(1));
4903     }
4904   } else {
4905     // Get the header out of the object, use LoadMarkNode when available
4906     Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes());
4907     // The control of the load must be null. Otherwise, the load can move before
4908     // the null check after castPP removal.
4909     Node* no_ctrl = nullptr;
4910     Node* header = make_load(no_ctrl, header_addr, TypeX_X, TypeX_X->basic_type(), MemNode::unordered);
4911 
4912     if (!UseObjectMonitorTable) {
4913       // Test the header to see if it is safe to read w.r.t. locking.
4914       Node *lock_mask      = _gvn.MakeConX(markWord::lock_mask_in_place);
4915       Node *lmasked_header = _gvn.transform(new AndXNode(header, lock_mask));
4916       if (LockingMode == LM_LIGHTWEIGHT) {
4917         Node *monitor_val   = _gvn.MakeConX(markWord::monitor_value);
4918         Node *chk_monitor   = _gvn.transform(new CmpXNode(lmasked_header, monitor_val));
4919         Node *test_monitor  = _gvn.transform(new BoolNode(chk_monitor, BoolTest::eq));
4920 
4921         generate_slow_guard(test_monitor, slow_region);
4922       } else {
4923         Node *unlocked_val      = _gvn.MakeConX(markWord::unlocked_value);
4924         Node *chk_unlocked      = _gvn.transform(new CmpXNode(lmasked_header, unlocked_val));
4925         Node *test_not_unlocked = _gvn.transform(new BoolNode(chk_unlocked, BoolTest::ne));
4926 
4927         generate_slow_guard(test_not_unlocked, slow_region);
4928       }
4929     }

4930 
4931     // Get the hash value and check to see that it has been properly assigned.
4932     // We depend on hash_mask being at most 32 bits and avoid the use of
4933     // hash_mask_in_place because it could be larger than 32 bits in a 64-bit
4934     // vm: see markWord.hpp.
4935     Node *hash_mask      = _gvn.intcon(markWord::hash_mask);
4936     Node *hash_shift     = _gvn.intcon(markWord::hash_shift);
4937     Node *hshifted_header= _gvn.transform(new URShiftXNode(header, hash_shift));
4938     // This hack lets the hash bits live anywhere in the mark object now, as long
4939     // as the shift drops the relevant bits into the low 32 bits.  Note that
4940     // Java spec says that HashCode is an int so there's no point in capturing
4941     // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build).
4942     hshifted_header      = ConvX2I(hshifted_header);
4943     Node *hash_val       = _gvn.transform(new AndINode(hshifted_header, hash_mask));
4944 
4945     Node *no_hash_val    = _gvn.intcon(markWord::no_hash);
4946     Node *chk_assigned   = _gvn.transform(new CmpINode( hash_val, no_hash_val));
4947     Node *test_assigned  = _gvn.transform(new BoolNode( chk_assigned, BoolTest::eq));
4948 
4949     generate_slow_guard(test_assigned, slow_region);
4950 
4951     result_val->init_req(_fast_path, hash_val);
4952 
4953     // _fast_path2 is not used here.
4954     result_val->del_req(_fast_path2);
4955     result_reg->del_req(_fast_path2);
4956     result_io->del_req(_fast_path2);
4957     result_mem->del_req(_fast_path2);
4958   }
4959 
4960   Node* init_mem = reset_memory();
4961   // fill in the rest of the null path:
4962   result_io ->init_req(_null_path, i_o());
4963   result_mem->init_req(_null_path, init_mem);
4964 

4965   result_reg->init_req(_fast_path, control());
4966   result_io ->init_req(_fast_path, i_o());
4967   result_mem->init_req(_fast_path, init_mem);
4968 
4969   if (UseCompactObjectHeaders) {
4970     result_io->init_req(_fast_path2, i_o());
4971     result_mem->init_req(_fast_path2, init_mem);
4972   }
4973 
4974   // Generate code for the slow case.  We make a call to hashCode().
4975   assert(slow_region != nullptr, "must have slow_region");
4976   set_control(_gvn.transform(slow_region));
4977   if (!stopped()) {
4978     // No need for PreserveJVMState, because we're using up the present state.
4979     set_all_memory(init_mem);
4980     vmIntrinsics::ID hashCode_id = is_static ? vmIntrinsics::_identityHashCode : vmIntrinsics::_hashCode;
4981     CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static, false);
4982     Node* slow_result = set_results_for_java_call(slow_call);
4983     // this->control() comes from set_results_for_java_call
4984     result_reg->init_req(_slow_path, control());
4985     result_val->init_req(_slow_path, slow_result);
4986     result_io  ->set_req(_slow_path, i_o());
4987     result_mem ->set_req(_slow_path, reset_memory());
4988   }
4989 
4990   // Return the combined state.
4991   set_i_o(        _gvn.transform(result_io)  );
4992   set_all_memory( _gvn.transform(result_mem));
4993 
4994   set_result(result_reg, result_val);
4995   return true;
< prev index next >