64 public boolean isConstantInit() { 65 return base.isConstantInit(); 66 } 67 68 @Override 69 public boolean isConstantStride() { 70 return base.isConstantStride(); 71 } 72 73 @Override 74 public long constantInit() { 75 return base.constantInit(); 76 } 77 78 @Override 79 public long constantStride() { 80 return base.constantStride(); 81 } 82 83 @Override 84 public ValueNode extremumNode(boolean assumePositiveTripCount, Stamp s) { 85 return base.extremumNode(assumePositiveTripCount, s); 86 } 87 88 @Override 89 public ValueNode exitValueNode() { 90 return IntegerConvertNode.convert(base.exitValueNode(), stamp, graph(), NodeView.DEFAULT); 91 } 92 93 @Override 94 public boolean isConstantExtremum() { 95 return base.isConstantExtremum(); 96 } 97 98 @Override 99 public long constantExtremum() { 100 return base.constantExtremum(); 101 } 102 103 @Override 104 public void deleteUnusedNodes() { 105 } | 64 public boolean isConstantInit() { 65 return base.isConstantInit(); 66 } 67 68 @Override 69 public boolean isConstantStride() { 70 return base.isConstantStride(); 71 } 72 73 @Override 74 public long constantInit() { 75 return base.constantInit(); 76 } 77 78 @Override 79 public long constantStride() { 80 return base.constantStride(); 81 } 82 83 @Override 84 public ValueNode extremumNode(boolean assumeLoopEntered, Stamp s) { 85 return base.extremumNode(assumeLoopEntered, s); 86 } 87 88 @Override 89 public ValueNode exitValueNode() { 90 return IntegerConvertNode.convert(base.exitValueNode(), stamp, graph(), NodeView.DEFAULT); 91 } 92 93 @Override 94 public boolean isConstantExtremum() { 95 return base.isConstantExtremum(); 96 } 97 98 @Override 99 public long constantExtremum() { 100 return base.constantExtremum(); 101 } 102 103 @Override 104 public void deleteUnusedNodes() { 105 } |