Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_jdk
提交
9e1d9e6d
D
dragonwell8_jdk
项目概览
openanolis
/
dragonwell8_jdk
通知
4
Star
2
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
D
dragonwell8_jdk
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
9e1d9e6d
编写于
10月 20, 2009
作者:
D
darcy
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
6371401: java.math.BigInteger.shift(Integer.MIN_VALUE) throws StackOverflowError
Reviewed-by: alanb
上级
45e132fc
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
66 addition
and
4 deletion
+66
-4
src/share/classes/java/math/BigInteger.java
src/share/classes/java/math/BigInteger.java
+18
-4
test/java/math/BigInteger/ExtremeShiftingTests.java
test/java/math/BigInteger/ExtremeShiftingTests.java
+48
-0
未找到文件。
src/share/classes/java/math/BigInteger.java
浏览文件 @
9e1d9e6d
...
...
@@ -2051,6 +2051,8 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
*
* @param n shift distance, in bits.
* @return {@code this << n}
* @throws ArithmeticException if the shift distance is {@code
* Integer.MIN_VALUE}.
* @see #shiftRight
*/
public
BigInteger
shiftLeft
(
int
n
)
{
...
...
@@ -2058,8 +2060,13 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
return
ZERO
;
if
(
n
==
0
)
return
this
;
if
(
n
<
0
)
return
shiftRight
(-
n
);
if
(
n
<
0
)
{
if
(
n
==
Integer
.
MIN_VALUE
)
{
throw
new
ArithmeticException
(
"Shift distance of Integer.MIN_VALUE not supported."
);
}
else
{
return
shiftRight
(-
n
);
}
}
int
nInts
=
n
>>>
5
;
int
nBits
=
n
&
0x1f
;
...
...
@@ -2097,13 +2104,20 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
*
* @param n shift distance, in bits.
* @return {@code this >> n}
* @throws ArithmeticException if the shift distance is {@code
* Integer.MIN_VALUE}.
* @see #shiftLeft
*/
public
BigInteger
shiftRight
(
int
n
)
{
if
(
n
==
0
)
return
this
;
if
(
n
<
0
)
return
shiftLeft
(-
n
);
if
(
n
<
0
)
{
if
(
n
==
Integer
.
MIN_VALUE
)
{
throw
new
ArithmeticException
(
"Shift distance of Integer.MIN_VALUE not supported."
);
}
else
{
return
shiftLeft
(-
n
);
}
}
int
nInts
=
n
>>>
5
;
int
nBits
=
n
&
0x1f
;
...
...
test/java/math/BigInteger/ExtremeShiftingTests.java
0 → 100644
浏览文件 @
9e1d9e6d
/*
* Copyright 2009 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
* CA 95054 USA or visit www.sun.com if you need additional information or
* have any questions.
*/
/*
* @test
* @bug 6371401
* @summary Tests of shiftLeft and shiftRight on Integer.MIN_VALUE
* @author Joseph D. Darcy
*/
import
static
java
.
math
.
BigInteger
.*;
public
class
ExtremeShiftingTests
{
public
static
void
main
(
String
...
args
)
{
try
{
ONE
.
shiftLeft
(
Integer
.
MIN_VALUE
);
throw
new
RuntimeException
(
"Should not reach here."
);
}
catch
(
ArithmeticException
ae
)
{
;
// Expected
}
try
{
ONE
.
shiftRight
(
Integer
.
MIN_VALUE
);
throw
new
RuntimeException
(
"Should not reach here."
);
}
catch
(
ArithmeticException
ae
)
{
;
// Expected
}
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录