stan/jdk-24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

7132936: guarantee(t != NULL) failed: must be con

Browse Source 
Use !higher_equal() check to skip top and values which fit.

Reviewed-by: never
This commit is contained in:
Vladimir Kozlov 2012-01-24 17:04:51 -08:00
parent 7f44e35134
commit 3770ecec6f
1 changed files with 8 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
hotspot/src/share/vm/opto/memnode.cpp
View File

@ -1764,7 +1764,8 @@ Node *LoadBNode::Ideal(PhaseGVN *phase, bool can_reshape) {
const Type* LoadBNode::Value(PhaseTransform *phase) const { const Type* LoadBNode::Value(PhaseTransform *phase) const {
Node* mem = in(MemNode::Memory); Node* mem = in(MemNode::Memory);
Node* value = can_see_stored_value(mem,phase); Node* value = can_see_stored_value(mem,phase);
if (value != NULL && value->is_Con()) { if (value != NULL && value->is_Con() &&
!value->bottom_type()->higher_equal(_type)) {
// If the input to the store does not fit with the load's result type, // If the input to the store does not fit with the load's result type,
// it must be truncated. We can't delay until Ideal call since // it must be truncated. We can't delay until Ideal call since
// a singleton Value is needed for split_thru_phi optimization. // a singleton Value is needed for split_thru_phi optimization.
@ -1793,7 +1794,8 @@ Node* LoadUBNode::Ideal(PhaseGVN* phase, bool can_reshape) {
const Type* LoadUBNode::Value(PhaseTransform *phase) const { const Type* LoadUBNode::Value(PhaseTransform *phase) const {
Node* mem = in(MemNode::Memory); Node* mem = in(MemNode::Memory);
Node* value = can_see_stored_value(mem,phase); Node* value = can_see_stored_value(mem,phase);
if (value != NULL && value->is_Con()) { if (value != NULL && value->is_Con() &&
!value->bottom_type()->higher_equal(_type)) {
// If the input to the store does not fit with the load's result type, // If the input to the store does not fit with the load's result type,
// it must be truncated. We can't delay until Ideal call since // it must be truncated. We can't delay until Ideal call since
// a singleton Value is needed for split_thru_phi optimization. // a singleton Value is needed for split_thru_phi optimization.
@ -1822,7 +1824,8 @@ Node *LoadUSNode::Ideal(PhaseGVN *phase, bool can_reshape) {
const Type* LoadUSNode::Value(PhaseTransform *phase) const { const Type* LoadUSNode::Value(PhaseTransform *phase) const {
Node* mem = in(MemNode::Memory); Node* mem = in(MemNode::Memory);
Node* value = can_see_stored_value(mem,phase); Node* value = can_see_stored_value(mem,phase);
if (value != NULL && value->is_Con()) { if (value != NULL && value->is_Con() &&
!value->bottom_type()->higher_equal(_type)) {
// If the input to the store does not fit with the load's result type, // If the input to the store does not fit with the load's result type,
// it must be truncated. We can't delay until Ideal call since // it must be truncated. We can't delay until Ideal call since
// a singleton Value is needed for split_thru_phi optimization. // a singleton Value is needed for split_thru_phi optimization.
@ -1853,7 +1856,8 @@ Node *LoadSNode::Ideal(PhaseGVN *phase, bool can_reshape) {
const Type* LoadSNode::Value(PhaseTransform *phase) const { const Type* LoadSNode::Value(PhaseTransform *phase) const {
Node* mem = in(MemNode::Memory); Node* mem = in(MemNode::Memory);
Node* value = can_see_stored_value(mem,phase); Node* value = can_see_stored_value(mem,phase);
if (value != NULL && value->is_Con()) { if (value != NULL && value->is_Con() &&
!value->bottom_type()->higher_equal(_type)) {
// If the input to the store does not fit with the load's result type, // If the input to the store does not fit with the load's result type,
// it must be truncated. We can't delay until Ideal call since // it must be truncated. We can't delay until Ideal call since
// a singleton Value is needed for split_thru_phi optimization. // a singleton Value is needed for split_thru_phi optimization.