Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
775b1b00
提交
775b1b00
authored
3月 18, 2012
作者:
Thomas Mueller
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
A persistent tree map (work in progress)
上级
4c584cef
隐藏空白字符变更
内嵌
并排
正在显示
4 个修改的文件
包含
248 行增加
和
38 行删除
+248
-38
TestAll.java
h2/src/test/org/h2/test/TestAll.java
+2
-1
TestTreeMapStore.java
h2/src/test/org/h2/test/unit/TestTreeMapStore.java
+25
-0
StoredMap.java
h2/src/tools/org/h2/dev/store/StoredMap.java
+22
-1
TreeMapStore.java
h2/src/tools/org/h2/dev/store/TreeMapStore.java
+199
-36
没有找到文件。
h2/src/test/org/h2/test/TestAll.java
浏览文件 @
775b1b00
...
@@ -701,7 +701,8 @@ kill -9 `jps -l | grep "org.h2.test." | cut -d " " -f 1`
...
@@ -701,7 +701,8 @@ kill -9 `jps -l | grep "org.h2.test." | cut -d " " -f 1`
new
TestStringCache
().
runTest
(
this
);
new
TestStringCache
().
runTest
(
this
);
new
TestStringUtils
().
runTest
(
this
);
new
TestStringUtils
().
runTest
(
this
);
new
TestTools
().
runTest
(
this
);
new
TestTools
().
runTest
(
this
);
new
TestTreeMapStore
().
runTest
(
this
);
int
test
;
// new TestTreeMapStore().runTest(this);
new
TestTraceSystem
().
runTest
(
this
);
new
TestTraceSystem
().
runTest
(
this
);
new
TestUpgrade
().
runTest
(
this
);
new
TestUpgrade
().
runTest
(
this
);
new
TestUtils
().
runTest
(
this
);
new
TestUtils
().
runTest
(
this
);
...
...
h2/src/test/org/h2/test/unit/TestTreeMapStore.java
浏览文件 @
775b1b00
...
@@ -29,6 +29,7 @@ public class TestTreeMapStore extends TestBase {
...
@@ -29,6 +29,7 @@ public class TestTreeMapStore extends TestBase {
}
}
public
void
test
()
throws
Exception
{
public
void
test
()
throws
Exception
{
// testDefragment();
testReuseSpace
();
testReuseSpace
();
testRandom
();
testRandom
();
testKeyValueClasses
();
testKeyValueClasses
();
...
@@ -36,6 +37,30 @@ public class TestTreeMapStore extends TestBase {
...
@@ -36,6 +37,30 @@ public class TestTreeMapStore extends TestBase {
testSimple
();
testSimple
();
}
}
private
void
testDefragment
()
{
String
fileName
=
getBaseDir
()
+
"/data.h3"
;
FileUtils
.
delete
(
fileName
);
long
initialLength
=
0
;
for
(
int
j
=
0
;
j
<
10
;
j
++)
{
TreeMapStore
s
=
TreeMapStore
.
open
(
fileName
);
StoredMap
<
Integer
,
String
>
m
=
s
.
openMap
(
"data"
,
Integer
.
class
,
String
.
class
);
for
(
int
i
=
0
;
i
<
10
;
i
++)
{
m
.
put
(
j
+
i
,
"Hello "
+
j
);
}
s
.
store
();
System
.
out
.
println
(
s
.
toString
());
s
.
compact
();
s
.
close
();
long
len
=
FileUtils
.
size
(
fileName
);
System
.
out
.
println
(
" len:"
+
len
);
// if (initialLength == 0) {
// initialLength = len;
// } else {
// assertTrue(len <= initialLength * 2);
// }
}
}
private
void
testReuseSpace
()
{
private
void
testReuseSpace
()
{
String
fileName
=
getBaseDir
()
+
"/data.h3"
;
String
fileName
=
getBaseDir
()
+
"/data.h3"
;
FileUtils
.
delete
(
fileName
);
FileUtils
.
delete
(
fileName
);
...
...
h2/src/tools/org/h2/dev/store/StoredMap.java
浏览文件 @
775b1b00
...
@@ -43,6 +43,15 @@ public class StoredMap<K, V> {
...
@@ -43,6 +43,15 @@ public class StoredMap<K, V> {
}
}
}
}
static
Class
<?>
getClass
(
String
name
)
{
if
(
name
.
equals
(
"i"
))
{
return
Integer
.
class
;
}
else
if
(
name
.
equals
(
"s"
))
{
return
String
.
class
;
}
throw
new
RuntimeException
(
"Unknown class name "
+
name
);
}
static
<
K
,
V
>
StoredMap
<
K
,
V
>
open
(
TreeMapStore
store
,
String
name
,
Class
<
K
>
keyClass
,
Class
<
V
>
valueClass
)
{
static
<
K
,
V
>
StoredMap
<
K
,
V
>
open
(
TreeMapStore
store
,
String
name
,
Class
<
K
>
keyClass
,
Class
<
V
>
valueClass
)
{
return
new
StoredMap
<
K
,
V
>(
store
,
name
,
keyClass
,
valueClass
);
return
new
StoredMap
<
K
,
V
>(
store
,
name
,
keyClass
,
valueClass
);
}
}
...
@@ -60,6 +69,10 @@ public class StoredMap<K, V> {
...
@@ -60,6 +69,10 @@ public class StoredMap<K, V> {
return
(
V
)
(
n
==
null
?
null
:
n
.
getData
());
return
(
V
)
(
n
==
null
?
null
:
n
.
getData
());
}
}
Node
getNode
(
Object
key
)
{
return
Node
.
getNode
(
root
,
key
);
}
public
void
remove
(
K
key
)
{
public
void
remove
(
K
key
)
{
if
(!
isChanged
())
{
if
(!
isChanged
())
{
store
.
changed
(
name
,
this
);
store
.
changed
(
name
,
this
);
...
@@ -78,6 +91,7 @@ public class StoredMap<K, V> {
...
@@ -78,6 +91,7 @@ public class StoredMap<K, V> {
int
length
(
Object
obj
);
int
length
(
Object
obj
);
void
write
(
ByteBuffer
buff
,
Object
x
);
void
write
(
ByteBuffer
buff
,
Object
x
);
Object
read
(
ByteBuffer
buff
);
Object
read
(
ByteBuffer
buff
);
String
getName
();
}
}
/**
/**
...
@@ -112,6 +126,10 @@ public class StoredMap<K, V> {
...
@@ -112,6 +126,10 @@ public class StoredMap<K, V> {
TreeMapStore
.
writeVarInt
(
buff
,
(
Integer
)
x
);
TreeMapStore
.
writeVarInt
(
buff
,
(
Integer
)
x
);
}
}
public
String
getName
()
{
return
"i"
;
}
}
}
/**
/**
...
@@ -153,6 +171,10 @@ public class StoredMap<K, V> {
...
@@ -153,6 +171,10 @@ public class StoredMap<K, V> {
}
}
}
}
public
String
getName
()
{
return
"s"
;
}
}
}
KeyType
getKeyType
()
{
KeyType
getKeyType
()
{
...
@@ -183,7 +205,6 @@ public class StoredMap<K, V> {
...
@@ -183,7 +205,6 @@ public class StoredMap<K, V> {
root
=
readNode
(
rootPos
);
root
=
readNode
(
rootPos
);
}
}
public
Iterator
<
K
>
keyIterator
(
K
from
)
{
public
Iterator
<
K
>
keyIterator
(
K
from
)
{
return
new
Cursor
(
root
,
from
);
return
new
Cursor
(
root
,
from
);
}
}
...
...
h2/src/tools/org/h2/dev/store/TreeMapStore.java
浏览文件 @
775b1b00
...
@@ -13,13 +13,16 @@ import java.nio.ByteBuffer;
...
@@ -13,13 +13,16 @@ import java.nio.ByteBuffer;
import
java.nio.channels.FileChannel
;
import
java.nio.channels.FileChannel
;
import
java.util.ArrayList
;
import
java.util.ArrayList
;
import
java.util.BitSet
;
import
java.util.BitSet
;
import
java.util.Collections
;
import
java.util.Comparator
;
import
java.util.HashMap
;
import
java.util.HashMap
;
import
java.util.Iterator
;
import
java.util.Iterator
;
import
java.util.Properties
;
import
java.util.Properties
;
import
java.util.Tree
Set
;
import
java.util.Tree
Map
;
import
org.h2.store.fs.FilePath
;
import
org.h2.store.fs.FilePath
;
import
org.h2.util.New
;
import
org.h2.util.New
;
import
org.h2.util.SmallLRUCache
;
import
org.h2.util.SmallLRUCache
;
import
org.h2.util.StringUtils
;
/*
/*
...
@@ -35,7 +38,7 @@ pageSize=4096
...
@@ -35,7 +38,7 @@ pageSize=4096
r=1
r=1
chunk:
chunk:
'd' [
length] root
...
'd' [
id] [metaRootOffset] data
...
todo:
todo:
...
@@ -64,9 +67,9 @@ public class TreeMapStore {
...
@@ -64,9 +67,9 @@ public class TreeMapStore {
private
final
String
fileName
;
private
final
String
fileName
;
private
FileChannel
file
;
private
FileChannel
file
;
private
int
pageSize
=
4
*
1024
;
private
int
pageSize
=
4
*
1024
;
private
long
root
Pos
;
private
long
root
BlockStart
;
private
HashMap
<
Long
,
Node
>
cache
=
SmallLRUCache
.
newInstance
(
50000
);
private
HashMap
<
Long
,
Node
>
cache
=
SmallLRUCache
.
newInstance
(
50000
);
private
Tree
Set
<
Block
>
blocks
=
new
TreeSet
<
Block
>();
private
Tree
Map
<
Integer
,
Block
>
blocks
=
new
TreeMap
<
Integer
,
Block
>();
private
StoredMap
<
String
,
String
>
meta
;
private
StoredMap
<
String
,
String
>
meta
;
private
HashMap
<
String
,
StoredMap
<?,
?>>
maps
=
New
.
hashMap
();
private
HashMap
<
String
,
StoredMap
<?,
?>>
maps
=
New
.
hashMap
();
private
HashMap
<
String
,
StoredMap
<?,
?>>
mapsChanged
=
New
.
hashMap
();
private
HashMap
<
String
,
StoredMap
<?,
?>>
mapsChanged
=
New
.
hashMap
();
...
@@ -75,7 +78,7 @@ public class TreeMapStore {
...
@@ -75,7 +78,7 @@ public class TreeMapStore {
private
long
transaction
;
private
long
transaction
;
private
int
tempNodeId
;
private
int
tempNodeId
;
private
int
nex
tBlockId
;
private
int
las
tBlockId
;
private
int
loadCount
;
private
int
loadCount
;
...
@@ -96,8 +99,11 @@ public class TreeMapStore {
...
@@ -96,8 +99,11 @@ public class TreeMapStore {
String
root
=
meta
.
get
(
"map."
+
name
);
String
root
=
meta
.
get
(
"map."
+
name
);
m
=
StoredMap
.
open
(
this
,
name
,
keyClass
,
valueClass
);
m
=
StoredMap
.
open
(
this
,
name
,
keyClass
,
valueClass
);
maps
.
put
(
name
,
m
);
maps
.
put
(
name
,
m
);
if
(
root
!=
null
&&
!
root
.
equals
(
"0"
))
{
if
(
root
!=
null
)
{
m
.
setRoot
(
Long
.
parseLong
(
root
));
root
=
StringUtils
.
arraySplit
(
root
,
','
,
false
)[
0
];
if
(!
root
.
equals
(
"0"
))
{
m
.
setRoot
(
Long
.
parseLong
(
root
));
}
}
}
}
}
return
m
;
return
m
;
...
@@ -118,9 +124,6 @@ public class TreeMapStore {
...
@@ -118,9 +124,6 @@ public class TreeMapStore {
writeHeader
();
writeHeader
();
}
else
{
}
else
{
readHeader
();
readHeader
();
if
(
rootPos
>
0
)
{
meta
.
setRoot
(
rootPos
);
}
readMeta
();
readMeta
();
}
}
}
catch
(
Exception
e
)
{
}
catch
(
Exception
e
)
{
...
@@ -129,6 +132,8 @@ public class TreeMapStore {
...
@@ -129,6 +132,8 @@ public class TreeMapStore {
}
}
private
void
readMeta
()
{
private
void
readMeta
()
{
long
rootPos
=
readMetaRootPos
(
rootBlockStart
);
meta
.
setRoot
(
rootPos
);
Iterator
<
String
>
it
=
meta
.
keyIterator
(
"block."
);
Iterator
<
String
>
it
=
meta
.
keyIterator
(
"block."
);
while
(
it
.
hasNext
())
{
while
(
it
.
hasNext
())
{
String
s
=
it
.
next
();
String
s
=
it
.
next
();
...
@@ -136,8 +141,8 @@ public class TreeMapStore {
...
@@ -136,8 +141,8 @@ public class TreeMapStore {
break
;
break
;
}
}
Block
b
=
Block
.
fromString
(
meta
.
get
(
s
));
Block
b
=
Block
.
fromString
(
meta
.
get
(
s
));
nextBlockId
=
Math
.
max
(
b
.
id
+
1
,
nex
tBlockId
);
lastBlockId
=
Math
.
max
(
b
.
id
,
las
tBlockId
);
blocks
.
add
(
b
);
blocks
.
put
(
b
.
id
,
b
);
}
}
}
}
...
@@ -147,7 +152,7 @@ public class TreeMapStore {
...
@@ -147,7 +152,7 @@ public class TreeMapStore {
"# H2 1.5\n"
+
"# H2 1.5\n"
+
"read-version: 1\n"
+
"read-version: 1\n"
+
"write-version: 1\n"
+
"write-version: 1\n"
+
"root
: "
+
rootPos
+
"\n"
+
"root
Block: "
+
rootBlockStart
+
"\n"
+
"transaction: "
+
transaction
+
"\n"
).
getBytes
());
"transaction: "
+
transaction
+
"\n"
).
getBytes
());
file
.
position
(
0
);
file
.
position
(
0
);
file
.
write
(
header
);
file
.
write
(
header
);
...
@@ -166,7 +171,7 @@ public class TreeMapStore {
...
@@ -166,7 +171,7 @@ public class TreeMapStore {
file
.
read
(
ByteBuffer
.
wrap
(
header
));
file
.
read
(
ByteBuffer
.
wrap
(
header
));
Properties
prop
=
new
Properties
();
Properties
prop
=
new
Properties
();
prop
.
load
(
new
ByteArrayInputStream
(
header
));
prop
.
load
(
new
ByteArrayInputStream
(
header
));
root
Pos
=
Long
.
parseLong
(
prop
.
get
(
"root
"
).
toString
());
root
BlockStart
=
Long
.
parseLong
(
prop
.
get
(
"rootBlock
"
).
toString
());
transaction
=
Long
.
parseLong
(
prop
.
get
(
"transaction"
).
toString
());
transaction
=
Long
.
parseLong
(
prop
.
get
(
"transaction"
).
toString
());
}
catch
(
Exception
e
)
{
}
catch
(
Exception
e
)
{
throw
convert
(
e
);
throw
convert
(
e
);
...
@@ -257,6 +262,16 @@ public class TreeMapStore {
...
@@ -257,6 +262,16 @@ public class TreeMapStore {
}
}
}
}
private
long
getPosition
(
long
nodeId
)
{
long
pos
=
getBlock
(
nodeId
).
start
;
pos
+=
(
int
)
(
nodeId
&
Integer
.
MAX_VALUE
);
return
pos
;
}
private
long
getId
(
int
blockId
,
int
offset
)
{
return
((
long
)
blockId
<<
32
)
|
offset
;
}
public
void
store
()
{
public
void
store
()
{
if
(!
meta
.
isChanged
()
&&
mapsChanged
.
size
()
==
0
)
{
if
(!
meta
.
isChanged
()
&&
mapsChanged
.
size
()
==
0
)
{
// TODO truncate file if empty
// TODO truncate file if empty
...
@@ -268,15 +283,17 @@ public class TreeMapStore {
...
@@ -268,15 +283,17 @@ public class TreeMapStore {
// as we don't know the exact positions and entry counts
// as we don't know the exact positions and entry counts
int
lenEstimate
=
1
+
8
;
int
lenEstimate
=
1
+
8
;
for
(
StoredMap
<?,
?>
m
:
mapsChanged
.
values
())
{
for
(
StoredMap
<?,
?>
m
:
mapsChanged
.
values
())
{
meta
.
put
(
"map."
+
m
.
getName
(),
String
.
valueOf
(
Long
.
MAX_VALUE
));
meta
.
put
(
"map."
+
m
.
getName
(),
String
.
valueOf
(
Long
.
MAX_VALUE
)
+
","
+
m
.
getKeyType
().
getName
()
+
","
+
m
.
getValueType
().
getName
());
lenEstimate
+=
length
(
m
.
getRoot
());
lenEstimate
+=
length
(
m
.
getRoot
());
}
}
Block
b
=
new
Block
(
nextBlockId
++);
int
blockId
=
++
lastBlockId
;
Block
b
=
new
Block
(
blockId
);
b
.
start
=
Long
.
MAX_VALUE
;
b
.
start
=
Long
.
MAX_VALUE
;
b
.
entryCount
=
Integer
.
MAX_VALUE
;
b
.
entryCount
=
Integer
.
MAX_VALUE
;
b
.
liveCount
=
Integer
.
MAX_VALUE
;
b
.
liveCount
=
Integer
.
MAX_VALUE
;
blocks
.
add
(
b
);
blocks
.
put
(
b
.
id
,
b
);
for
(
Block
x
:
blocks
)
{
for
(
Block
x
:
blocks
.
values
()
)
{
if
(
x
.
liveCount
==
0
)
{
if
(
x
.
liveCount
==
0
)
{
meta
.
remove
(
"block."
+
x
.
id
);
meta
.
remove
(
"block."
+
x
.
id
);
}
else
{
}
else
{
...
@@ -285,10 +302,10 @@ public class TreeMapStore {
...
@@ -285,10 +302,10 @@ public class TreeMapStore {
}
}
// modifying the meta can itself affect the metadata
// modifying the meta can itself affect the metadata
// TODO solve this in a better way
// TODO solve this in a better way
for
(
Block
x
:
new
ArrayList
<
Block
>(
blocks
))
{
for
(
Block
x
:
new
ArrayList
<
Block
>(
blocks
.
values
()
))
{
if
(
x
.
liveCount
==
0
)
{
if
(
x
.
liveCount
==
0
)
{
meta
.
remove
(
"block."
+
x
.
id
);
meta
.
remove
(
"block."
+
x
.
id
);
blocks
.
remove
(
x
);
blocks
.
remove
(
x
.
id
);
}
else
{
}
else
{
meta
.
put
(
"block."
+
x
.
id
,
x
.
toString
());
meta
.
put
(
"block."
+
x
.
id
,
x
.
toString
());
}
}
...
@@ -296,16 +313,17 @@ public class TreeMapStore {
...
@@ -296,16 +313,17 @@ public class TreeMapStore {
lenEstimate
+=
length
(
meta
.
getRoot
());
lenEstimate
+=
length
(
meta
.
getRoot
());
b
.
length
=
lenEstimate
;
b
.
length
=
lenEstimate
;
long
storePos
=
allocate
(
lenEstimate
);
// TODO allocate as late as possible
long
storePos
=
allocateBlock
(
lenEstimate
);
long
end
=
storePos
+
1
+
8
;
long
nodeId
=
getId
(
blockId
,
1
+
8
)
;
for
(
StoredMap
<?,
?>
m
:
mapsChanged
.
values
())
{
for
(
StoredMap
<?,
?>
m
:
mapsChanged
.
values
())
{
Node
r
=
m
.
getRoot
();
Node
r
=
m
.
getRoot
();
long
p
=
r
==
null
?
0
:
en
d
;
long
p
=
r
==
null
?
0
:
nodeI
d
;
meta
.
put
(
"map."
+
m
.
getName
(),
String
.
valueOf
(
p
));
meta
.
put
(
"map."
+
m
.
getName
(),
String
.
valueOf
(
p
)
+
","
+
m
.
getKeyType
().
getName
()
+
","
+
m
.
getValueType
().
getName
()
);
end
=
updateId
(
r
,
en
d
);
nodeId
=
updateId
(
r
,
nodeI
d
);
}
}
long
meta
Pos
=
end
;
long
meta
NodeOffset
=
nodeId
-
getId
(
blockId
,
0
)
;
// add a dummy entry so the count is correct
// add a dummy entry so the count is correct
meta
.
put
(
"block."
+
b
.
id
,
b
.
toString
());
meta
.
put
(
"block."
+
b
.
id
,
b
.
toString
());
...
@@ -321,11 +339,12 @@ public class TreeMapStore {
...
@@ -321,11 +339,12 @@ public class TreeMapStore {
meta
.
put
(
"block."
+
b
.
id
,
b
.
toString
());
meta
.
put
(
"block."
+
b
.
id
,
b
.
toString
());
end
=
updateId
(
meta
.
getRoot
(),
end
);
nodeId
=
updateId
(
meta
.
getRoot
(),
nodeId
);
int
len
=
(
int
)
(
nodeId
-
getId
(
blockId
,
0
));
ByteBuffer
buff
=
ByteBuffer
.
allocate
(
(
int
)
(
end
-
storePos
)
);
ByteBuffer
buff
=
ByteBuffer
.
allocate
(
len
);
buff
.
put
((
byte
)
'd'
);
buff
.
put
((
byte
)
'd'
);
buff
.
putLong
(
meta
Pos
-
storePos
);
buff
.
putLong
(
meta
NodeOffset
);
for
(
StoredMap
<?,
?>
m
:
mapsChanged
.
values
())
{
for
(
StoredMap
<?,
?>
m
:
mapsChanged
.
values
())
{
store
(
buff
,
m
.
getRoot
());
store
(
buff
,
m
.
getRoot
());
}
}
...
@@ -340,17 +359,17 @@ public class TreeMapStore {
...
@@ -340,17 +359,17 @@ public class TreeMapStore {
}
catch
(
IOException
e
)
{
}
catch
(
IOException
e
)
{
throw
new
RuntimeException
(
e
);
throw
new
RuntimeException
(
e
);
}
}
root
Pos
=
meta
.
getRoot
().
getId
()
;
root
BlockStart
=
storePos
;
writeHeader
();
writeHeader
();
tempNodeId
=
0
;
tempNodeId
=
0
;
mapsChanged
.
clear
();
mapsChanged
.
clear
();
}
}
private
long
allocate
(
long
length
)
{
private
long
allocate
Block
(
long
length
)
{
BitSet
set
=
new
BitSet
();
BitSet
set
=
new
BitSet
();
set
.
set
(
0
);
set
.
set
(
0
);
set
.
set
(
1
);
set
.
set
(
1
);
for
(
Block
b
:
blocks
)
{
for
(
Block
b
:
blocks
.
values
()
)
{
if
(
b
.
start
==
Long
.
MAX_VALUE
)
{
if
(
b
.
start
==
Long
.
MAX_VALUE
)
{
continue
;
continue
;
}
}
...
@@ -388,6 +407,139 @@ public class TreeMapStore {
...
@@ -388,6 +407,139 @@ public class TreeMapStore {
return
++
transaction
;
return
++
transaction
;
}
}
private
long
readMetaRootPos
(
long
blockStart
)
{
try
{
file
.
position
(
blockStart
);
ByteBuffer
buff
=
ByteBuffer
.
wrap
(
new
byte
[
16
]);
file
.
read
(
buff
);
buff
.
rewind
();
if
(
buff
.
get
()
!=
'd'
)
{
throw
new
RuntimeException
(
"File corrupt"
);
}
return
buff
.
getLong
()
+
blockStart
;
}
catch
(
IOException
e
)
{
throw
new
RuntimeException
(
e
);
}
}
public
void
compact
()
{
if
(
blocks
.
size
()
<=
1
)
{
return
;
}
long
liveCountTotal
=
0
,
entryCountTotal
=
0
;
for
(
Block
b
:
blocks
.
values
())
{
entryCountTotal
+=
b
.
entryCount
;
liveCountTotal
+=
b
.
liveCount
;
}
int
averageEntryCount
=
(
int
)
(
entryCountTotal
/
blocks
.
size
());
if
(
entryCountTotal
==
0
)
{
return
;
}
int
percentTotal
=
(
int
)
(
100
*
liveCountTotal
/
entryCountTotal
);
if
(
percentTotal
>
80
)
{
return
;
}
System
.
out
.
println
(
"--- defrag ---"
);
ArrayList
<
Block
>
old
=
New
.
arrayList
();
for
(
Block
b
:
blocks
.
values
())
{
int
age
=
lastBlockId
-
b
.
id
;
b
.
collectPriority
=
b
.
getFillRate
()
/
age
;
old
.
add
(
b
);
}
Collections
.
sort
(
old
,
new
Comparator
<
Block
>()
{
public
int
compare
(
Block
o1
,
Block
o2
)
{
return
new
Integer
(
o1
.
collectPriority
).
compareTo
(
o2
.
collectPriority
);
}
});
int
moveCount
=
0
;
Block
move
=
null
;
for
(
Block
b
:
old
)
{
if
(
moveCount
+
b
.
liveCount
>
averageEntryCount
)
{
break
;
}
System
.
out
.
println
(
" block "
+
b
.
id
+
" "
+
b
.
getFillRate
()
+
" % full; prio="
+
b
.
collectPriority
);
moveCount
+=
b
.
liveCount
;
move
=
b
;
}
boolean
remove
=
false
;
for
(
Iterator
<
Block
>
it
=
old
.
iterator
();
it
.
hasNext
();)
{
Block
b
=
it
.
next
();
if
(
move
==
b
)
{
remove
=
true
;
}
else
if
(
remove
)
{
it
.
remove
();
}
}
long
oldMetaPos
=
readMetaRootPos
(
move
.
start
);
System
.
out
.
println
(
" meta:"
+
oldMetaPos
);
StoredMap
<
String
,
String
>
oldMeta
=
StoredMap
.
open
(
this
,
"old-meta"
,
String
.
class
,
String
.
class
);
oldMeta
.
setRoot
(
oldMetaPos
);
Iterator
<
String
>
it
=
oldMeta
.
keyIterator
(
null
);
while
(
it
.
hasNext
())
{
String
k
=
it
.
next
();
String
v
=
oldMeta
.
get
(
k
);
System
.
out
.
println
(
" "
+
k
+
" "
+
v
.
replace
(
'\n'
,
' '
));
if
(!
k
.
startsWith
(
"map."
))
{
continue
;
}
k
=
k
.
substring
(
"map."
.
length
());
if
(!
maps
.
containsKey
(
k
))
{
continue
;
}
String
[]
d
=
StringUtils
.
arraySplit
(
v
,
','
,
false
);
Class
<?>
kt
=
StoredMap
.
getClass
(
d
[
1
]);
Class
<?>
vt
=
StoredMap
.
getClass
(
d
[
2
]);
StoredMap
<?,
?>
oldData
=
StoredMap
.
open
(
this
,
"old-"
+
k
,
kt
,
vt
);
long
oldDataRoot
=
Long
.
parseLong
(
d
[
0
]);
oldData
.
setRoot
(
oldDataRoot
);
@SuppressWarnings
(
"unchecked"
)
StoredMap
<
Object
,
Object
>
data
=
(
StoredMap
<
Object
,
Object
>)
maps
.
get
(
k
);
Iterator
<?>
dataIt
=
oldData
.
keyIterator
(
null
);
while
(
dataIt
.
hasNext
())
{
Object
o
=
dataIt
.
next
();
Node
n
=
data
.
getNode
(
o
);
if
(
n
==
null
)
{
// was removed later - ignore
}
else
if
(
n
.
getId
()
<
0
)
{
// temporarily changed - ok
}
else
{
Block
b
=
getBlock
(
n
.
getId
());
if
(
old
.
contains
(
b
))
{
System
.
out
.
println
(
" move "
+
o
);
data
.
remove
(
o
);
data
.
put
(
o
,
n
.
getData
());
}
}
}
}
//
// meta = StoredMap.open(this, "meta", String.class, String.class);
// new File(fileName).getParentFile().mkdirs();
// try {
// file = FilePathCache.wrap(FilePath.get(fileName).open("rw"));
// if (file.size() == 0) {
// writeHeader();
// } else {
// readHeader();
// if (rootPos > 0) {
// meta.setRoot(rootPos);
// }
// readMeta();
//
// }
// }
// Iterator<String> it = meta.keyIterator(null);
// while (it.hasNext()) {
// String m = it.next();
// System.out.println("meta " + m);
// }
// System.out.println("---");
// // TODO Auto-generated method stub
}
Node
readNode
(
StoredMap
<?,
?>
map
,
long
id
)
{
Node
readNode
(
StoredMap
<?,
?>
map
,
long
id
)
{
Node
n
=
cache
.
get
(
id
);
Node
n
=
cache
.
get
(
id
);
if
(
n
==
null
)
{
if
(
n
==
null
)
{
...
@@ -471,20 +623,19 @@ public class TreeMapStore {
...
@@ -471,20 +623,19 @@ public class TreeMapStore {
}
}
private
Block
getBlock
(
long
pos
)
{
private
Block
getBlock
(
long
pos
)
{
Block
b
=
new
Block
(
0
);
int
b
=
(
int
)
(
pos
>>>
32
);
b
.
start
=
pos
;
return
blocks
.
get
(
b
);
return
blocks
.
headSet
(
b
).
last
();
}
}
/**
/**
* A block of data.
* A block of data.
*/
*/
static
class
Block
implements
Comparable
<
Block
>
{
static
class
Block
implements
Comparable
<
Block
>
{
public
int
collectPriority
;
int
id
;
int
id
;
long
start
;
long
start
;
long
length
;
long
length
;
int
entryCount
;
int
entryCount
;
int
liveCount
;
int
liveCount
;
// int outRevCount;
Block
(
int
id
)
{
Block
(
int
id
)
{
this
.
id
=
id
;
this
.
id
=
id
;
...
@@ -506,10 +657,22 @@ public class TreeMapStore {
...
@@ -506,10 +657,22 @@ public class TreeMapStore {
}
}
}
}
public
int
getFillRate
()
{
return
entryCount
==
0
?
0
:
100
*
liveCount
/
entryCount
;
}
public
int
compareTo
(
Block
o
)
{
public
int
compareTo
(
Block
o
)
{
return
start
==
o
.
start
?
0
:
start
<
o
.
start
?
-
1
:
1
;
return
start
==
o
.
start
?
0
:
start
<
o
.
start
?
-
1
:
1
;
}
}
public
int
hashCode
()
{
return
id
;
}
public
boolean
equals
(
Object
o
)
{
return
o
instanceof
Block
&&
((
Block
)
o
).
id
==
id
;
}
public
String
toString
()
{
public
String
toString
()
{
return
return
"id:"
+
id
+
"\n"
+
"id:"
+
id
+
"\n"
+
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论