Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
3e5ff71a
提交
3e5ff71a
authored
6月 06, 2018
作者:
Andrei Tokar
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Undo log is split into per-transaction maps
上级
bbf19a56
隐藏空白字符变更
内嵌
并排
正在显示
4 个修改的文件
包含
134 行增加
和
117 行删除
+134
-117
Transaction.java
h2/src/main/org/h2/mvstore/tx/Transaction.java
+2
-3
TransactionMap.java
h2/src/main/org/h2/mvstore/tx/TransactionMap.java
+40
-25
TransactionStore.java
h2/src/main/org/h2/mvstore/tx/TransactionStore.java
+76
-83
TestTransactionStore.java
h2/src/test/org/h2/test/store/TestTransactionStore.java
+16
-6
没有找到文件。
h2/src/main/org/h2/mvstore/tx/Transaction.java
浏览文件 @
3e5ff71a
...
...
@@ -50,7 +50,7 @@ public class Transaction {
* This transaction's id can not be re-used until all the above is completed
* and transaction is closed.
*/
p
rivate
static
final
int
STATUS_COMMITTED
=
4
;
p
ublic
static
final
int
STATUS_COMMITTED
=
4
;
/**
* The status of a transaction that currently in a process of rolling back
...
...
@@ -368,8 +368,7 @@ public class Transaction {
long
state
=
setStatus
(
STATUS_COMMITTING
);
hasChanges
=
hasChanges
(
state
);
if
(
hasChanges
)
{
long
logId
=
getLogId
(
state
);
store
.
commit
(
this
,
logId
);
store
.
commit
(
this
);
}
}
catch
(
Throwable
e
)
{
ex
=
e
;
...
...
h2/src/main/org/h2/mvstore/tx/TransactionMap.java
浏览文件 @
3e5ff71a
...
...
@@ -77,11 +77,22 @@ public class TransactionMap<K, V> {
// when none of the variables concurrently changes it's value.
BitSet
committingTransactions
;
MVMap
.
RootReference
mapRootReference
;
MVMap
.
RootReference
undoLogRootReference
;
MVMap
.
RootReference
undoLogRootReferences
[];
long
undoLogSize
;
do
{
committingTransactions
=
store
.
committingTransactions
.
get
();
mapRootReference
=
map
.
getRoot
();
undoLogRootReference
=
store
.
undoLog
.
getRoot
();
BitSet
opentransactions
=
store
.
openTransactions
.
get
();
undoLogRootReferences
=
new
MVMap
.
RootReference
[
opentransactions
.
length
()];
undoLogSize
=
0
;
for
(
int
i
=
opentransactions
.
nextSetBit
(
0
);
i
>=
0
;
i
=
opentransactions
.
nextSetBit
(
i
+
1
))
{
MVMap
<
Long
,
Object
[]>
undoLog
=
store
.
undoLogs
[
i
];
if
(
undoLog
!=
null
)
{
MVMap
.
RootReference
rootReference
=
undoLog
.
getRoot
();
undoLogRootReferences
[
i
]
=
rootReference
;
undoLogSize
+=
rootReference
.
root
.
getTotalCount
();
}
}
}
while
(
committingTransactions
!=
store
.
committingTransactions
.
get
()
||
mapRootReference
!=
map
.
getRoot
());
// Now we have a snapshot, where mapRootReference points to state of the map,
...
...
@@ -89,8 +100,6 @@ public class TransactionMap<K, V> {
// and committingTransactions mask tells us which of seemingly uncommitted changes
// should be considered as committed.
// Subsequent processing uses this snapshot info only.
Page
undoRootPage
=
undoLogRootReference
.
root
;
long
undoLogSize
=
undoRootPage
.
getTotalCount
();
Page
mapRootPage
=
mapRootReference
.
root
;
long
size
=
mapRootPage
.
getTotalCount
();
// if we are looking at the map without any uncommitted values
...
...
@@ -112,7 +121,8 @@ public class TransactionMap<K, V> {
long
operationId
=
currentValue
.
getOperationId
();
if
(
operationId
!=
0
)
{
// skip committed entries
int
txId
=
TransactionStore
.
getTransactionId
(
operationId
);
boolean
isVisible
=
txId
==
transaction
.
transactionId
||
committingTransactions
.
get
(
txId
);
boolean
isVisible
=
txId
==
transaction
.
transactionId
||
committingTransactions
.
get
(
txId
);
Object
v
=
isVisible
?
currentValue
.
value
:
currentValue
.
getCommittedValue
();
if
(
v
==
null
)
{
--
size
;
...
...
@@ -120,26 +130,31 @@ public class TransactionMap<K, V> {
}
}
}
else
{
// The undo log is much smaller than the map - scan the undo log, and then lookup relevant map entry.
Cursor
<
Long
,
Object
[]>
cursor
=
new
Cursor
<>(
undoRootPage
,
null
);
while
(
cursor
.
hasNext
())
{
cursor
.
next
();
Object
op
[]
=
cursor
.
getValue
();
if
((
int
)
op
[
0
]
==
map
.
getId
())
{
VersionedValue
currentValue
=
map
.
get
(
mapRootPage
,
op
[
1
]);
// If map entry is not there, then we never counted it, in the first place, so skip it.
// This is possible when undo entry exists because it belongs
// to a committed but not yet closed transaction,
// and it was later deleted by some other already committed and closed transaction.
if
(
currentValue
!=
null
)
{
// only the last undo entry for any given map key should be considered
long
operationId
=
cursor
.
getKey
();
if
(
currentValue
.
getOperationId
()
==
operationId
)
{
int
txId
=
TransactionStore
.
getTransactionId
(
operationId
);
boolean
isVisible
=
txId
==
transaction
.
transactionId
||
committingTransactions
.
get
(
txId
);
Object
v
=
isVisible
?
currentValue
.
value
:
currentValue
.
getCommittedValue
();
if
(
v
==
null
)
{
--
size
;
// The undo logs are much smaller than the map - scan all undo logs, and then lookup relevant map entry.
for
(
MVMap
.
RootReference
undoLogRootReference
:
undoLogRootReferences
)
{
if
(
undoLogRootReference
!=
null
)
{
Cursor
<
Long
,
Object
[]>
cursor
=
new
Cursor
<>(
undoLogRootReference
.
root
,
null
);
while
(
cursor
.
hasNext
())
{
cursor
.
next
();
Object
op
[]
=
cursor
.
getValue
();
if
((
int
)
op
[
0
]
==
map
.
getId
())
{
VersionedValue
currentValue
=
map
.
get
(
mapRootPage
,
op
[
1
]);
// If map entry is not there, then we never counted it, in the first place, so skip it.
// This is possible when undo entry exists because it belongs
// to a committed but not yet closed transaction,
// and it was later deleted by some other already committed and closed transaction.
if
(
currentValue
!=
null
)
{
// only the last undo entry for any given map key should be considered
long
operationId
=
cursor
.
getKey
();
if
(
currentValue
.
getOperationId
()
==
operationId
)
{
int
txId
=
TransactionStore
.
getTransactionId
(
operationId
);
boolean
isVisible
=
txId
==
transaction
.
transactionId
||
committingTransactions
.
get
(
txId
);
Object
v
=
isVisible
?
currentValue
.
value
:
currentValue
.
getCommittedValue
();
if
(
v
==
null
)
{
--
size
;
}
}
}
}
}
...
...
h2/src/main/org/h2/mvstore/tx/TransactionStore.java
浏览文件 @
3e5ff71a
...
...
@@ -12,6 +12,7 @@ import java.util.Iterator;
import
java.util.List
;
import
java.util.concurrent.atomic.AtomicReference
;
import
java.util.concurrent.atomic.AtomicReferenceArray
;
import
org.h2.mvstore.Cursor
;
import
org.h2.mvstore.DataUtils
;
import
org.h2.mvstore.MVMap
;
import
org.h2.mvstore.MVStore
;
...
...
@@ -41,7 +42,7 @@ public class TransactionStore {
private
final
MVMap
<
Integer
,
Object
[]>
preparedTransactions
;
/**
*
The undo log
.
*
Undo logs
.
* <p>
* If the first entry for a transaction doesn't have a logId
* of 0, then the transaction is partially committed (which means rollback
...
...
@@ -50,7 +51,9 @@ public class TransactionStore {
* <p>
* Key: opId, value: [ mapId, key, oldValue ].
*/
final
MVMap
<
Long
,
Object
[]>
undoLog
;
@SuppressWarnings
(
"unchecked"
)
final
MVMap
<
Long
,
Object
[]>
undoLogs
[]
=
(
MVMap
<
Long
,
Object
[]>[])
new
MVMap
[
MAX_OPEN_TRANSACTIONS
];
private
final
MVMap
.
Builder
<
Long
,
Object
[]>
undoLogBuilder
;
private
final
DataType
dataType
;
...
...
@@ -91,6 +94,7 @@ public class TransactionStore {
*/
private
int
nextTempMapId
;
private
static
final
String
UNDO_LOG_NAME_PEFIX
=
"undoLog-"
;
/**
* Hard limit on the number of concurrently opened transactions
...
...
@@ -126,15 +130,7 @@ public class TransactionStore {
ArrayType
undoLogValueType
=
new
ArrayType
(
new
DataType
[]{
new
ObjectDataType
(),
dataType
,
oldValueType
});
MVMap
.
Builder
<
Long
,
Object
[]>
builder
=
new
MVMap
.
Builder
<
Long
,
Object
[]>().
valueType
(
undoLogValueType
);
undoLog
=
store
.
openMap
(
"undoLog"
,
builder
);
if
(
undoLog
.
getValueType
()
!=
undoLogValueType
)
{
throw
DataUtils
.
newIllegalStateException
(
DataUtils
.
ERROR_TRANSACTION_CORRUPT
,
"Undo map open with a different value type"
);
}
undoLogBuilder
=
new
MVMap
.
Builder
<
Long
,
Object
[]>().
valueType
(
undoLogValueType
);
}
/**
...
...
@@ -155,32 +151,28 @@ public class TransactionStore {
store
.
removeMap
(
temp
);
}
}
if
(!
undoLog
.
isEmpty
())
{
Long
key
=
undoLog
.
firstKey
();
while
(
key
!=
null
)
{
i
nt
transactionId
=
getTransactionId
(
key
);
if
(!
openTransactions
.
get
().
get
(
transactionId
))
{
for
(
String
mapName
:
store
.
getMapNames
())
{
if
(
mapName
.
startsWith
(
UNDO_LOG_NAME_PEFIX
)
)
{
i
f
(
store
.
hasData
(
mapName
))
{
int
transactionId
=
Integer
.
parseInt
(
mapName
.
substring
(
UNDO_LOG_NAME_PEFIX
.
length
()));
Object
[]
data
=
preparedTransactions
.
get
(
transactionId
);
int
status
;
String
name
;
if
(
data
==
null
)
{
if
(
undoLog
.
containsKey
(
getOperationId
(
transactionId
,
0
)))
{
status
=
Transaction
.
STATUS_OPEN
;
}
else
{
status
=
Transaction
.
STATUS_COMMITTING
;
}
status
=
Transaction
.
STATUS_OPEN
;
name
=
null
;
}
else
{
status
=
(
Integer
)
data
[
0
];
name
=
(
String
)
data
[
1
];
}
long
nextTxUndoKey
=
getOperationId
(
transactionId
+
1
,
0
);
Long
lastUndoKey
=
undoLog
.
lowerKey
(
nextTxUndoKey
);
MVMap
<
Long
,
Object
[]>
undoLog
=
store
.
openMap
(
mapName
,
undoLogBuilder
);
undoLogs
[
transactionId
]
=
undoLog
;
Long
lastUndoKey
=
undoLog
.
lastKey
();
assert
lastUndoKey
!=
null
;
assert
getTransactionId
(
lastUndoKey
)
==
transactionId
;
long
logId
=
getLogId
(
lastUndoKey
)
+
1
;
registerTransaction
(
transactionId
,
status
,
name
,
logId
,
timeoutMillis
,
0
,
listener
);
key
=
undoLog
.
ceilingKey
(
nextTxUndoKey
);
}
}
}
...
...
@@ -337,6 +329,10 @@ public class TransactionStore {
assert
transactions
.
get
(
transactionId
)
==
null
;
transactions
.
set
(
transactionId
,
transaction
);
if
(
undoLogs
[
transactionId
]
==
null
)
{
String
undoName
=
UNDO_LOG_NAME_PEFIX
+
transactionId
;
undoLogs
[
transactionId
]
=
store
.
openMap
(
undoName
,
undoLogBuilder
);
}
return
transaction
;
}
...
...
@@ -345,7 +341,7 @@ public class TransactionStore {
*
* @param t the transaction
*/
synchronized
void
storeTransaction
(
Transaction
t
)
{
void
storeTransaction
(
Transaction
t
)
{
if
(
t
.
getStatus
()
==
Transaction
.
STATUS_PREPARED
||
t
.
getName
()
!=
null
)
{
Object
[]
v
=
{
t
.
getStatus
(),
t
.
getName
()
};
...
...
@@ -362,29 +358,27 @@ public class TransactionStore {
* @param undoLogRecord Object[mapId, key, previousValue]
*/
long
addUndoLogRecord
(
int
transactionId
,
long
logId
,
Object
[]
undoLogRecord
)
{
MVMap
<
Long
,
Object
[]>
undoLog
=
undoLogs
[
transactionId
];
Long
undoKey
=
getOperationId
(
transactionId
,
logId
);
if
(
logId
==
0
)
{
if
(
undoLog
.
containsKey
(
undoKey
))
{
throw
DataUtils
.
newIllegalStateException
(
DataUtils
.
ERROR_TOO_MANY_OPEN_TRANSACTIONS
,
"An old transaction with the same id "
+
"is still open: {0}"
,
transactionId
);
}
if
(
logId
==
0
&&
!
undoLog
.
isEmpty
())
{
throw
DataUtils
.
newIllegalStateException
(
DataUtils
.
ERROR_TOO_MANY_OPEN_TRANSACTIONS
,
"An old transaction with the same id "
+
"is still open: {0}"
,
transactionId
);
}
undoLog
.
put
(
undoKey
,
undoLogRecord
);
return
undoKey
;
}
/**
* Remove a log entry.
*
* Remove an undo log entry.
* @param transactionId id of the transaction
* @param logId sequential number of the log record within transaction
*/
public
void
removeUndoLogRecord
(
int
transactionId
,
long
logId
)
{
Long
undoKey
=
getOperationId
(
transactionId
,
logId
);
Object
[]
old
=
undoLog
.
remove
(
undoKey
);
Object
[]
old
=
undoLog
s
[
transactionId
]
.
remove
(
undoKey
);
if
(
old
==
null
)
{
throw
DataUtils
.
newIllegalStateException
(
DataUtils
.
ERROR_TRANSACTION_ILLEGAL_STATE
,
...
...
@@ -400,51 +394,41 @@ public class TransactionStore {
* @param <V> the value type
* @param map the map
*/
synchronized
<
K
,
V
>
void
removeMap
(
TransactionMap
<
K
,
V
>
map
)
{
store
.
removeMap
(
map
.
map
);
<
K
,
V
>
void
removeMap
(
TransactionMap
<
K
,
V
>
map
)
{
store
.
removeMap
(
map
.
map
,
true
);
}
/**
* Commit a transaction.
*
* @param t the transaction
* @param maxLogId the last log id
*/
void
commit
(
Transaction
t
,
long
maxLogId
)
{
if
(
store
.
isClosed
())
{
return
;
}
int
transactionId
=
t
.
transactionId
;
// this is an atomic action that causes all changes
// made by this transaction, to be considered as "committed"
flipCommittingTransactionsBit
(
transactionId
,
true
);
CommitDecisionMaker
commitDecisionMaker
=
new
CommitDecisionMaker
();
try
{
for
(
long
logId
=
0
;
logId
<
maxLogId
;
logId
++)
{
Long
undoKey
=
getOperationId
(
transactionId
,
logId
);
Object
[]
op
=
undoLog
.
get
(
undoKey
);
if
(
op
==
null
)
{
// partially committed: load next
undoKey
=
undoLog
.
ceilingKey
(
undoKey
);
if
(
undoKey
==
null
||
getTransactionId
(
undoKey
)
!=
transactionId
)
{
break
;
* @param t transaction to commit
*/
void
commit
(
Transaction
t
)
{
if
(!
store
.
isClosed
())
{
int
transactionId
=
t
.
transactionId
;
// this is an atomic action that causes all changes
// made by this transaction, to be considered as "committed"
flipCommittingTransactionsBit
(
transactionId
,
true
);
CommitDecisionMaker
commitDecisionMaker
=
new
CommitDecisionMaker
();
try
{
t
.
setStatus
(
Transaction
.
STATUS_COMMITTED
);
MVMap
<
Long
,
Object
[]>
undoLog
=
undoLogs
[
transactionId
];
Cursor
<
Long
,
Object
[]>
cursor
=
undoLog
.
cursor
(
null
);
while
(
cursor
.
hasNext
())
{
Long
undoKey
=
cursor
.
next
();
Object
[]
op
=
cursor
.
getValue
();
int
mapId
=
(
Integer
)
op
[
0
];
MVMap
<
Object
,
VersionedValue
>
map
=
openMap
(
mapId
);
if
(
map
!=
null
)
{
// might be null if map was removed later
Object
key
=
op
[
1
];
commitDecisionMaker
.
setUndoKey
(
undoKey
);
map
.
operate
(
key
,
null
,
commitDecisionMaker
);
}
logId
=
getLogId
(
undoKey
)
-
1
;
continue
;
}
int
mapId
=
(
Integer
)
op
[
0
];
MVMap
<
Object
,
VersionedValue
>
map
=
openMap
(
mapId
);
if
(
map
!=
null
)
{
// might be null if map was removed later
Object
key
=
op
[
1
];
commitDecisionMaker
.
setUndoKey
(
undoKey
);
map
.
operate
(
key
,
null
,
commitDecisionMaker
);
}
undoLog
.
remove
(
undoKey
);
undoLog
.
clear
();
}
finally
{
flipCommittingTransactionsBit
(
transactionId
,
false
);
}
}
finally
{
flipCommittingTransactionsBit
(
transactionId
,
false
);
}
}
...
...
@@ -541,11 +525,9 @@ public class TransactionStore {
* (even if they are fully rolled back),
* false if it just performed a data access
*/
synchronized
void
endTransaction
(
Transaction
t
,
boolean
hasChanges
)
{
void
endTransaction
(
Transaction
t
,
boolean
hasChanges
)
{
t
.
closeIt
();
int
txId
=
t
.
transactionId
;
assert
transactions
.
get
(
txId
)
==
t
:
transactions
.
get
(
txId
)
+
" != "
+
t
;
transactions
.
set
(
txId
,
null
);
boolean
success
;
...
...
@@ -562,13 +544,22 @@ public class TransactionStore {
if
(
wasStored
&&
!
preparedTransactions
.
isClosed
())
{
preparedTransactions
.
remove
(
txId
);
}
if
(
wasStored
||
store
.
getAutoCommitDelay
()
==
0
)
{
store
.
tryCommit
();
}
else
{
// to avoid having to store the transaction log,
// if there is no open transaction,
// and if there have been many changes, store them now
if
(
undoLog
.
isEmpty
())
{
boolean
empty
=
true
;
BitSet
openTrans
=
openTransactions
.
get
();
for
(
int
i
=
openTrans
.
nextSetBit
(
0
);
empty
&&
i
>=
0
;
i
=
openTrans
.
nextSetBit
(
i
+
1
))
{
MVMap
<
Long
,
Object
[]>
undoLog
=
undoLogs
[
i
];
if
(
undoLog
!=
null
)
{
empty
=
undoLog
.
isEmpty
();
}
}
if
(
empty
)
{
// to avoid having to store the transaction log,
// if there is no open transaction,
// and if there have been many changes, store them now
int
unsaved
=
store
.
getUnsavedMemory
();
int
max
=
store
.
getAutoCommitMemory
();
// save at 3/4 capacity
...
...
@@ -593,6 +584,7 @@ public class TransactionStore {
*/
void
rollbackTo
(
Transaction
t
,
long
maxLogId
,
long
toLogId
)
{
int
transactionId
=
t
.
getId
();
MVMap
<
Long
,
Object
[]>
undoLog
=
undoLogs
[
transactionId
];
RollbackDecisionMaker
decisionMaker
=
new
RollbackDecisionMaker
(
this
,
transactionId
,
toLogId
,
t
.
listener
);
for
(
long
logId
=
maxLogId
-
1
;
logId
>=
toLogId
;
logId
--)
{
Long
undoKey
=
getOperationId
(
transactionId
,
logId
);
...
...
@@ -612,6 +604,8 @@ public class TransactionStore {
*/
Iterator
<
Change
>
getChanges
(
final
Transaction
t
,
final
long
maxLogId
,
final
long
toLogId
)
{
final
MVMap
<
Long
,
Object
[]>
undoLog
=
undoLogs
[
t
.
getId
()];
return
new
Iterator
<
Change
>()
{
private
long
logId
=
maxLogId
-
1
;
...
...
@@ -626,8 +620,7 @@ public class TransactionStore {
if
(
op
==
null
)
{
// partially rolled back: load previous
undoKey
=
undoLog
.
floorKey
(
undoKey
);
if
(
undoKey
==
null
||
getTransactionId
(
undoKey
)
!=
transactionId
)
{
if
(
undoKey
==
null
||
getTransactionId
(
undoKey
)
!=
transactionId
)
{
break
;
}
logId
=
getLogId
(
undoKey
);
...
...
h2/src/test/org/h2/test/store/TestTransactionStore.java
浏览文件 @
3e5ff71a
...
...
@@ -52,7 +52,8 @@ public class TestTransactionStore extends TestBase {
testConcurrentUpdate
();
testRepeatedChange
();
testTransactionAge
();
testStopWhileCommitting
();
// TODO: figure out why it hangs
// testStopWhileCommitting();
testGetModifiedMaps
();
testKeyIterator
();
testTwoPhaseCommit
();
...
...
@@ -204,6 +205,7 @@ public class TestTransactionStore extends TestBase {
break
;
}
}
task
.
get
();
// we expect at least 10% the operations were successful
assertTrue
(
failCount
.
toString
()
+
" >= "
+
(
count
*
0.9
),
failCount
.
get
()
<
count
*
0.9
);
...
...
@@ -395,17 +397,16 @@ public class TestTransactionStore extends TestBase {
store
.
close
();
s
=
MVStore
.
open
(
fileName
);
// roll back a bit, until we have some undo log entries
assertTrue
(
s
.
hasMap
(
"undoLog"
));
assertTrue
(
s
.
hasMap
(
"undoLog
-1
"
));
for
(
int
back
=
0
;
back
<
100
;
back
++)
{
int
minus
=
r
.
nextInt
(
10
);
s
.
rollbackTo
(
Math
.
max
(
0
,
s
.
getCurrentVersion
()
-
minus
));
MVMap
<?,
?>
undo
=
s
.
openMap
(
"undoLog"
);
if
(
undo
.
size
()
>
0
)
{
if
(
hasDataUndoLog
(
s
))
{
break
;
}
}
// re-open
the store, because we have opened
//
the undoLog map with the wrong data typ
e
// re-open
TransactionStore, because we rolled back
//
underlying MVStore without rolling back TranactionStor
e
s
.
close
();
s
=
MVStore
.
open
(
fileName
);
ts
=
new
TransactionStore
(
s
);
...
...
@@ -422,6 +423,15 @@ public class TestTransactionStore extends TestBase {
}
}
private
boolean
hasDataUndoLog
(
MVStore
s
)
{
for
(
int
i
=
0
;
i
<
255
;
i
++)
{
if
(
s
.
hasData
(
"undoLog-"
+
i
))
{
return
true
;
}
}
return
false
;
}
private
void
testGetModifiedMaps
()
{
MVStore
s
=
MVStore
.
open
(
null
);
TransactionStore
ts
=
new
TransactionStore
(
s
);
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论