Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_jdk
提交
5e5d3be3
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看板
提交
5e5d3be3
编写于
7月 12, 2020
作者:
W
weijun
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
8238804: Enhance key handling process
Reviewed-by: rriggs, mullan, ahgross, rhalade, mbalao, andrew
上级
f3e2235f
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
19 addition
and
5 deletion
+19
-5
src/share/classes/java/security/MessageDigest.java
src/share/classes/java/security/MessageDigest.java
+19
-5
未找到文件。
src/share/classes/java/security/MessageDigest.java
浏览文件 @
5e5d3be3
/*
* Copyright (c) 1996, 20
17
, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1996, 20
20
, Oracle and/or its affiliates. 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
...
...
@@ -433,6 +433,12 @@ public abstract class MessageDigest extends MessageDigestSpi {
/**
* Compares two digests for equality. Does a simple byte compare.
*
* @implNote
* All bytes in {@code digesta} are examined to determine equality.
* The calculation time depends only on the length of {@code digesta}.
* It does not depend on the length of {@code digestb} or the contents
* of {@code digesta} and {@code digestb}.
*
* @param digesta one of the digests to compare.
*
* @param digestb the other digest to compare.
...
...
@@ -444,14 +450,22 @@ public abstract class MessageDigest extends MessageDigestSpi {
if
(
digesta
==
null
||
digestb
==
null
)
{
return
false
;
}
if
(
digesta
.
length
!=
digestb
.
length
)
{
return
false
;
int
lenA
=
digesta
.
length
;
int
lenB
=
digestb
.
length
;
if
(
lenB
==
0
)
{
return
lenA
==
0
;
}
int
result
=
0
;
result
|=
lenA
-
lenB
;
// time-constant comparison
for
(
int
i
=
0
;
i
<
digesta
.
length
;
i
++)
{
result
|=
digesta
[
i
]
^
digestb
[
i
];
for
(
int
i
=
0
;
i
<
lenA
;
i
++)
{
// If i >= lenB, indexB is 0; otherwise, i.
int
indexB
=
((
i
-
lenB
)
>>>
31
)
*
i
;
result
|=
digesta
[
i
]
^
digestb
[
indexB
];
}
return
result
==
0
;
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录