Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
9ec2fad0
提交
9ec2fad0
authored
7 年前
作者:
Noel Grandin
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fix deadlock
need to take the TransactionStore RWLock before we synchronize on the MVMap
上级
67310c61
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
52 行增加
和
50 行删除
+52
-50
TransactionStore.java
h2/src/main/org/h2/mvstore/db/TransactionStore.java
+52
-50
没有找到文件。
h2/src/main/org/h2/mvstore/db/TransactionStore.java
浏览文件 @
9ec2fad0
...
...
@@ -946,64 +946,66 @@ public class TransactionStore {
* @return the size
*/
public
long
sizeAsLong
()
{
long
sizeRaw
=
map
.
sizeAsLong
();
MVMap
<
Long
,
Object
[]>
undo
=
transaction
.
store
.
undoLog
;
long
undoLogSize
;
synchronized
(
undo
)
{
undoLogSize
=
undo
.
sizeAsLong
()
;
}
if
(
undoLogSize
==
0
)
{
return
sizeRaw
;
}
if
(
undoLogSize
>
sizeRaw
)
{
// the undo log is larger than the map -
// count the entries of the map
long
size
=
0
;
Cursor
<
K
,
VersionedValue
>
cursor
=
map
.
cursor
(
null
);
while
(
cursor
.
hasNext
())
{
VersionedValue
data
;
transaction
.
store
.
rwLock
.
readLock
().
lock
();
try
{
transaction
.
store
.
rwLock
.
readLock
().
lock
();
try
{
long
sizeRaw
=
map
.
sizeAsLong
()
;
MVMap
<
Long
,
Object
[]>
undo
=
transaction
.
store
.
undoLog
;
long
undoLogSize
;
synchronized
(
undo
)
{
undoLogSize
=
undo
.
sizeAsLong
();
}
if
(
undoLogSize
==
0
)
{
return
sizeRaw
;
}
if
(
undoLogSize
>
sizeRaw
)
{
// the undo log is larger than the map -
// count the entries of the map
long
size
=
0
;
Cursor
<
K
,
VersionedValue
>
cursor
=
map
.
cursor
(
null
)
;
while
(
cursor
.
hasNext
())
{
VersionedValue
data
;
K
key
=
cursor
.
next
();
data
=
getValue
(
key
,
readLogId
,
cursor
.
getValue
());
}
finally
{
transaction
.
store
.
rwLock
.
readLock
().
unlock
();
}
if
(
data
!=
null
&&
data
.
value
!=
null
)
{
size
++;
if
(
data
!=
null
&&
data
.
value
!=
null
)
{
size
++;
}
}
return
size
;
}
return
size
;
}
// the undo log is smaller than the map -
// scan the undo log and subtract invisible entries
synchronized
(
undo
)
{
// re-fetch in case any transaction was committed now
long
size
=
map
.
sizeAsLong
();
MVMap
<
Object
,
Integer
>
temp
=
transaction
.
store
.
createTempMap
();
try
{
for
(
Entry
<
Long
,
Object
[]>
e
:
undo
.
entrySet
())
{
Object
[]
op
=
e
.
getValue
();
int
m
=
(
Integer
)
op
[
0
];
if
(
m
!=
mapId
)
{
// a different map - ignore
continue
;
}
@SuppressWarnings
(
"unchecked"
)
K
key
=
(
K
)
op
[
1
];
if
(
get
(
key
)
==
null
)
{
Integer
old
=
temp
.
put
(
key
,
1
);
// count each key only once (there might be multiple
// changes for the same key)
if
(
old
==
null
)
{
size
--;
// the undo log is smaller than the map -
// scan the undo log and subtract invisible entries
synchronized
(
undo
)
{
// re-fetch in case any transaction was committed now
long
size
=
map
.
sizeAsLong
();
MVMap
<
Object
,
Integer
>
temp
=
transaction
.
store
.
createTempMap
();
try
{
for
(
Entry
<
Long
,
Object
[]>
e
:
undo
.
entrySet
())
{
Object
[]
op
=
e
.
getValue
();
int
m
=
(
Integer
)
op
[
0
];
if
(
m
!=
mapId
)
{
// a different map - ignore
continue
;
}
@SuppressWarnings
(
"unchecked"
)
K
key
=
(
K
)
op
[
1
];
if
(
get
(
key
)
==
null
)
{
Integer
old
=
temp
.
put
(
key
,
1
);
// count each key only once (there might be
// multiple
// changes for the same key)
if
(
old
==
null
)
{
size
--;
}
}
}
}
finally
{
transaction
.
store
.
store
.
removeMap
(
temp
);
}
}
finally
{
transaction
.
store
.
store
.
removeMap
(
temp
);
return
size
;
}
return
size
;
}
finally
{
transaction
.
store
.
rwLock
.
readLock
().
unlock
();
}
}
...
...
This diff is collapsed.
Click to expand it.
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论