Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
df217319
提交
df217319
authored
10月 04, 2017
作者:
andrei
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
MVStore: make fields final, streamline constructor code
上级
cfbdf443
隐藏空白字符变更
内嵌
并排
正在显示
3 个修改的文件
包含
108 行增加
和
90 行删除
+108
-90
MVStore.java
h2/src/main/org/h2/mvstore/MVStore.java
+82
-87
CacheLongKeyLIRS.java
h2/src/main/org/h2/mvstore/cache/CacheLongKeyLIRS.java
+9
-1
Utils.java
h2/src/main/org/h2/util/Utils.java
+17
-2
没有找到文件。
h2/src/main/org/h2/mvstore/MVStore.java
浏览文件 @
df217319
...
@@ -26,6 +26,7 @@ import org.h2.mvstore.cache.CacheLongKeyLIRS;
...
@@ -26,6 +26,7 @@ import org.h2.mvstore.cache.CacheLongKeyLIRS;
import
org.h2.mvstore.type.StringDataType
;
import
org.h2.mvstore.type.StringDataType
;
import
org.h2.util.MathUtils
;
import
org.h2.util.MathUtils
;
import
org.h2.util.New
;
import
org.h2.util.New
;
import
org.h2.util.Utils
;
/*
/*
...
@@ -151,8 +152,8 @@ public final class MVStore {
...
@@ -151,8 +152,8 @@ public final class MVStore {
private
volatile
boolean
closed
;
private
volatile
boolean
closed
;
private
FileStore
fileStore
;
private
final
FileStore
fileStore
;
private
boolean
fileStoreIsProvided
;
private
final
boolean
fileStoreIsProvided
;
private
final
int
pageSplitSize
;
private
final
int
pageSplitSize
;
...
@@ -161,14 +162,14 @@ public final class MVStore {
...
@@ -161,14 +162,14 @@ public final class MVStore {
* It is split in 16 segments. The stack move distance is 2% of the expected
* It is split in 16 segments. The stack move distance is 2% of the expected
* number of entries.
* number of entries.
*/
*/
private
CacheLongKeyLIRS
<
Page
>
cache
;
private
final
CacheLongKeyLIRS
<
Page
>
cache
;
/**
/**
* The page chunk references cache. The default size is 4 MB, and the
* The page chunk references cache. The default size is 4 MB, and the
* average size is 2 KB. It is split in 16 segments. The stack move distance
* average size is 2 KB. It is split in 16 segments. The stack move distance
* is 2% of the expected number of entries.
* is 2% of the expected number of entries.
*/
*/
private
CacheLongKeyLIRS
<
PageChildren
>
cacheChunkRef
;
private
final
CacheLongKeyLIRS
<
PageChildren
>
cacheChunkRef
;
/**
/**
* The newest chunk. If nothing was stored yet, this field is not set.
* The newest chunk. If nothing was stored yet, this field is not set.
...
@@ -198,12 +199,12 @@ public final class MVStore {
...
@@ -198,12 +199,12 @@ public final class MVStore {
* The metadata map. Write access to this map needs to be synchronized on
* The metadata map. Write access to this map needs to be synchronized on
* the store.
* the store.
*/
*/
private
MVMap
<
String
,
String
>
meta
;
private
final
MVMap
<
String
,
String
>
meta
;
private
final
ConcurrentHashMap
<
Integer
,
MVMap
<?,
?>>
maps
=
private
final
ConcurrentHashMap
<
Integer
,
MVMap
<?,
?>>
maps
=
new
ConcurrentHashMap
<>();
new
ConcurrentHashMap
<>();
private
HashMap
<
String
,
Object
>
storeHeader
=
New
.
hashMap
();
private
final
HashMap
<
String
,
Object
>
storeHeader
=
New
.
hashMap
();
private
WriteBuffer
writeBuffer
;
private
WriteBuffer
writeBuffer
;
...
@@ -221,7 +222,7 @@ public final class MVStore {
...
@@ -221,7 +222,7 @@ public final class MVStore {
private
Compressor
compressorHigh
;
private
Compressor
compressorHigh
;
p
rivate
final
UncaughtExceptionHandler
backgroundExceptionHandler
;
p
ublic
final
UncaughtExceptionHandler
backgroundExceptionHandler
;
private
volatile
long
currentVersion
;
private
volatile
long
currentVersion
;
...
@@ -292,91 +293,88 @@ public final class MVStore {
...
@@ -292,91 +293,88 @@ public final class MVStore {
* occurred while opening
* occurred while opening
* @throws IllegalArgumentException if the directory does not exist
* @throws IllegalArgumentException if the directory does not exist
*/
*/
MVStore
(
HashMap
<
String
,
Object
>
config
)
{
MVStore
(
Map
<
String
,
Object
>
config
)
{
Object
o
=
config
.
get
(
"compress"
);
this
.
compressionLevel
=
Utils
.
getConfigParam
(
config
,
"compress"
,
0
);
this
.
compressionLevel
=
o
==
null
?
0
:
(
Integer
)
o
;
String
fileName
=
(
String
)
config
.
get
(
"fileName"
);
String
fileName
=
(
String
)
config
.
get
(
"fileName"
);
fileStore
=
(
FileStore
)
config
.
get
(
"fileStore"
);
FileStore
fileStore
=
(
FileStore
)
config
.
get
(
"fileStore"
);
fileStoreIsProvided
=
fileStore
!=
null
;
fileStoreIsProvided
=
fileStore
!=
null
;
if
(
fileStore
==
null
&&
fileName
!=
null
)
{
if
(
fileStore
==
null
&&
fileName
!=
null
)
{
fileStore
=
new
FileStore
();
fileStore
=
new
FileStore
();
}
}
o
=
config
.
get
(
"pageSplitSize"
);
this
.
fileStore
=
fileStore
;
int
pgSplitSize
;
if
(
o
!=
null
)
{
CacheLongKeyLIRS
.
Config
cc
=
null
;
pgSplitSize
=
(
Integer
)
o
;
if
(
this
.
fileStore
!=
null
)
{
}
else
if
(
fileStore
!=
null
)
{
int
mb
=
Utils
.
getConfigParam
(
config
,
"cacheSize"
,
16
);
pgSplitSize
=
16
*
1024
;
if
(
mb
>
0
)
{
cc
=
new
CacheLongKeyLIRS
.
Config
();
cc
.
maxMemory
=
mb
*
1024L
*
1024L
;
Object
o
=
config
.
get
(
"cacheConcurrency"
);
if
(
o
!=
null
)
{
cc
.
segmentCount
=
(
Integer
)
o
;
}
}
}
if
(
cc
!=
null
)
{
cache
=
new
CacheLongKeyLIRS
<>(
cc
);
cc
.
maxMemory
/=
4
;
cacheChunkRef
=
new
CacheLongKeyLIRS
<>(
cc
);
}
else
{
}
else
{
pgSplitSize
=
48
;
// number of keys per page in that case
cache
=
null
;
cacheChunkRef
=
null
;
}
int
pgSplitSize
=
Utils
.
getConfigParam
(
config
,
"pageSplitSize"
,
16
*
1024
);
// Make sure pages will fit into cache
if
(
cache
!=
null
&&
pgSplitSize
>
cache
.
getMaxItemSize
())
{
pgSplitSize
=
(
int
)
cache
.
getMaxItemSize
();
}
}
pageSplitSize
=
pgSplitSize
;
pageSplitSize
=
pgSplitSize
;
o
=
config
.
get
(
"backgroundExceptionHandler"
);
backgroundExceptionHandler
=
this
.
backgroundExceptionHandler
=
(
UncaughtExceptionHandler
)
o
;
(
UncaughtExceptionHandler
)
config
.
get
(
"backgroundExceptionHandler"
)
;
meta
=
new
MVMap
<>(
StringDataType
.
INSTANCE
,
meta
=
new
MVMap
<>(
StringDataType
.
INSTANCE
,
StringDataType
.
INSTANCE
);
StringDataType
.
INSTANCE
);
HashMap
<
String
,
Object
>
c
=
New
.
hashMap
();
HashMap
<
String
,
Object
>
c
=
New
.
hashMap
();
c
.
put
(
"id"
,
0
);
c
.
put
(
"id"
,
0
);
c
.
put
(
"createVersion"
,
currentVersion
);
c
.
put
(
"createVersion"
,
currentVersion
);
meta
.
init
(
this
,
c
);
meta
.
init
(
this
,
c
);
if
(
fileStore
==
null
)
{
if
(
this
.
fileStore
!=
null
)
{
cache
=
null
;
retentionTime
=
this
.
fileStore
.
getDefaultRetentionTime
();
cacheChunkRef
=
null
;
int
kb
=
Utils
.
getConfigParam
(
config
,
"autoCommitBufferSize"
,
1024
);
return
;
// 19 KB memory is about 1 KB storage
}
autoCommitMemory
=
kb
*
1024
*
19
;
retentionTime
=
fileStore
.
getDefaultRetentionTime
();
autoCompactFillRate
=
Utils
.
getConfigParam
(
config
,
"autoCompactFillRate"
,
50
);
boolean
readOnly
=
config
.
containsKey
(
"readOnly"
);
char
[]
encryptionKey
=
(
char
[])
config
.
get
(
"encryptionKey"
);
o
=
config
.
get
(
"cacheSize"
);
try
{
int
mb
=
o
==
null
?
16
:
(
Integer
)
o
;
if
(!
fileStoreIsProvided
)
{
if
(
mb
>
0
)
{
boolean
readOnly
=
config
.
containsKey
(
"readOnly"
);
CacheLongKeyLIRS
.
Config
cc
=
new
CacheLongKeyLIRS
.
Config
();
this
.
fileStore
.
open
(
fileName
,
readOnly
,
encryptionKey
);
cc
.
maxMemory
=
mb
*
1024L
*
1024L
;
}
o
=
config
.
get
(
"cacheConcurrency"
);
if
(
this
.
fileStore
.
size
()
==
0
)
{
if
(
o
!=
null
)
{
creationTime
=
getTimeAbsolute
();
cc
.
segmentCount
=
(
Integer
)
o
;
lastCommitTime
=
creationTime
;
storeHeader
.
put
(
"H"
,
2
);
storeHeader
.
put
(
"blockSize"
,
BLOCK_SIZE
);
storeHeader
.
put
(
"format"
,
FORMAT_WRITE
);
storeHeader
.
put
(
"created"
,
creationTime
);
writeStoreHeader
();
}
else
{
readStoreHeader
();
}
}
catch
(
IllegalStateException
e
)
{
panic
(
e
);
}
finally
{
if
(
encryptionKey
!=
null
)
{
Arrays
.
fill
(
encryptionKey
,
(
char
)
0
);
}
}
}
cache
=
new
CacheLongKeyLIRS
<>(
cc
);
lastCommitTime
=
getTimeSinceCreation
();
cc
.
maxMemory
/=
4
;
cacheChunkRef
=
new
CacheLongKeyLIRS
<>(
cc
);
}
o
=
config
.
get
(
"autoCommitBufferSize"
);
int
kb
=
o
==
null
?
1024
:
(
Integer
)
o
;
// 19 KB memory is about 1 KB storage
autoCommitMemory
=
kb
*
1024
*
19
;
o
=
config
.
get
(
"autoCompactFillRate"
);
// setAutoCommitDelay starts the thread, but only if
autoCompactFillRate
=
o
==
null
?
50
:
(
Integer
)
o
;
// the parameter is different from the old value
int
delay
=
Utils
.
getConfigParam
(
config
,
"autoCommitDelay"
,
1000
);
char
[]
encryptionKey
=
(
char
[])
config
.
get
(
"encryptionKey"
);
setAutoCommitDelay
(
delay
);
try
{
if
(!
fileStoreIsProvided
)
{
fileStore
.
open
(
fileName
,
readOnly
,
encryptionKey
);
}
if
(
fileStore
.
size
()
==
0
)
{
creationTime
=
getTimeAbsolute
();
lastCommitTime
=
creationTime
;
storeHeader
.
put
(
"H"
,
2
);
storeHeader
.
put
(
"blockSize"
,
BLOCK_SIZE
);
storeHeader
.
put
(
"format"
,
FORMAT_WRITE
);
storeHeader
.
put
(
"created"
,
creationTime
);
writeStoreHeader
();
}
else
{
readStoreHeader
();
}
}
catch
(
IllegalStateException
e
)
{
panic
(
e
);
}
finally
{
if
(
encryptionKey
!=
null
)
{
Arrays
.
fill
(
encryptionKey
,
(
char
)
0
);
}
}
}
lastCommitTime
=
getTimeSinceCreation
();
// setAutoCommitDelay starts the thread, but only if
// the parameter is different from the old value
o
=
config
.
get
(
"autoCommitDelay"
);
int
delay
=
o
==
null
?
1000
:
(
Integer
)
o
;
setAutoCommitDelay
(
delay
);
}
}
private
void
panic
(
IllegalStateException
e
)
{
private
void
panic
(
IllegalStateException
e
)
{
...
@@ -892,29 +890,26 @@ public final class MVStore {
...
@@ -892,29 +890,26 @@ public final class MVStore {
// the thread also synchronized on this, which
// the thread also synchronized on this, which
// could result in a deadlock
// could result in a deadlock
stopBackgroundThread
();
stopBackgroundThread
();
closed
=
true
;
synchronized
(
this
)
{
synchronized
(
this
)
{
closed
=
true
;
if
(
fileStore
!=
null
&&
shrinkIfPossible
)
{
if
(
fileStore
!=
null
&&
shrinkIfPossible
)
{
shrinkFileIfPossible
(
0
);
shrinkFileIfPossible
(
0
);
}
}
// release memory early - this is important when called
// release memory early - this is important when called
// because of out of memory
// because of out of memory
cache
=
null
;
if
(
cache
!=
null
)
{
cacheChunkRef
=
null
;
cache
.
clear
();
}
if
(
cacheChunkRef
!=
null
)
{
cacheChunkRef
.
clear
();
}
for
(
MVMap
<?,
?>
m
:
New
.
arrayList
(
maps
.
values
()))
{
for
(
MVMap
<?,
?>
m
:
New
.
arrayList
(
maps
.
values
()))
{
m
.
close
();
m
.
close
();
}
}
meta
=
null
;
chunks
.
clear
();
chunks
.
clear
();
maps
.
clear
();
maps
.
clear
();
if
(
fileStore
!=
null
)
{
if
(
fileStore
!=
null
&&
!
fileStoreIsProvided
)
{
try
{
fileStore
.
close
();
if
(!
fileStoreIsProvided
)
{
fileStore
.
close
();
}
}
finally
{
fileStore
=
null
;
}
}
}
}
}
}
}
...
...
h2/src/main/org/h2/mvstore/cache/CacheLongKeyLIRS.java
浏览文件 @
df217319
...
@@ -82,13 +82,21 @@ public class CacheLongKeyLIRS<V> {
...
@@ -82,13 +82,21 @@ public class CacheLongKeyLIRS<V> {
* Remove all entries.
* Remove all entries.
*/
*/
public
void
clear
()
{
public
void
clear
()
{
long
max
=
Math
.
max
(
1
,
maxMemory
/
segmentCount
);
long
max
=
getMaxItemSize
(
);
for
(
int
i
=
0
;
i
<
segmentCount
;
i
++)
{
for
(
int
i
=
0
;
i
<
segmentCount
;
i
++)
{
segments
[
i
]
=
new
Segment
<>(
segments
[
i
]
=
new
Segment
<>(
max
,
stackMoveDistance
,
8
,
nonResidentQueueSize
);
max
,
stackMoveDistance
,
8
,
nonResidentQueueSize
);
}
}
}
}
/**
* Determines max size of the data item size to fit into cache
* @return data items size limit
*/
public
long
getMaxItemSize
()
{
return
Math
.
max
(
1
,
maxMemory
/
segmentCount
);
}
private
Entry
<
V
>
find
(
long
key
)
{
private
Entry
<
V
>
find
(
long
key
)
{
int
hash
=
getHash
(
key
);
int
hash
=
getHash
(
key
);
return
getSegment
(
hash
).
find
(
key
,
hash
);
return
getSegment
(
hash
).
find
(
key
,
hash
);
...
...
h2/src/main/org/h2/util/Utils.java
浏览文件 @
df217319
...
@@ -17,6 +17,7 @@ import java.lang.reflect.Modifier;
...
@@ -17,6 +17,7 @@ import java.lang.reflect.Modifier;
import
java.util.Arrays
;
import
java.util.Arrays
;
import
java.util.Comparator
;
import
java.util.Comparator
;
import
java.util.HashMap
;
import
java.util.HashMap
;
import
java.util.Map
;
import
java.util.concurrent.TimeUnit
;
import
java.util.concurrent.TimeUnit
;
import
java.util.zip.ZipEntry
;
import
java.util.zip.ZipEntry
;
import
java.util.zip.ZipInputStream
;
import
java.util.zip.ZipInputStream
;
...
@@ -75,7 +76,7 @@ public class Utils {
...
@@ -75,7 +76,7 @@ public class Utils {
buff
[
pos
++]
=
(
byte
)
(
x
>>
24
);
buff
[
pos
++]
=
(
byte
)
(
x
>>
24
);
buff
[
pos
++]
=
(
byte
)
(
x
>>
16
);
buff
[
pos
++]
=
(
byte
)
(
x
>>
16
);
buff
[
pos
++]
=
(
byte
)
(
x
>>
8
);
buff
[
pos
++]
=
(
byte
)
(
x
>>
8
);
buff
[
pos
++]
=
(
byte
)
x
;
buff
[
pos
]
=
(
byte
)
x
;
}
}
/**
/**
...
@@ -722,7 +723,7 @@ public class Utils {
...
@@ -722,7 +723,7 @@ public class Utils {
String
s
=
getProperty
(
key
,
null
);
String
s
=
getProperty
(
key
,
null
);
if
(
s
!=
null
)
{
if
(
s
!=
null
)
{
try
{
try
{
return
Integer
.
decode
(
s
)
.
intValue
()
;
return
Integer
.
decode
(
s
);
}
catch
(
NumberFormatException
e
)
{
}
catch
(
NumberFormatException
e
)
{
// ignore
// ignore
}
}
...
@@ -750,6 +751,20 @@ public class Utils {
...
@@ -750,6 +751,20 @@ public class Utils {
return
defaultValue
;
return
defaultValue
;
}
}
public
static
int
getConfigParam
(
Map
<
String
,?>
config
,
String
key
,
int
defaultValue
)
{
Object
o
=
config
.
get
(
key
);
if
(
o
instanceof
Number
)
{
return
((
Number
)
o
).
intValue
();
}
else
if
(
o
!=
null
)
{
try
{
return
Integer
.
decode
(
o
.
toString
());
}
catch
(
NumberFormatException
e
)
{
// ignore
}
}
return
defaultValue
;
}
/**
/**
* Scale the value with the available memory. If 1 GB of RAM is available,
* Scale the value with the available memory. If 1 GB of RAM is available,
* the value is returned, if 2 GB are available, then twice the value, and
* the value is returned, if 2 GB are available, then twice the value, and
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论