-
Notifications
You must be signed in to change notification settings - Fork 180
/
main.go
169 lines (153 loc) · 3.8 KB
/
main.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
package main
import (
"bytes"
"crypto/sha256"
"encoding/hex"
"fmt"
"os"
"strconv"
"strings"
"github.com/okex/exchain/libs/iavl"
dbm "github.com/okex/exchain/libs/tm-db"
)
// TODO: make this configurable?
const (
DefaultCacheSize int = 10000
)
func main() {
args := os.Args[1:]
if len(args) < 2 || (args[0] != "data" && args[0] != "shape" && args[0] != "versions") {
fmt.Fprintln(os.Stderr, "Usage: iaviewer <data|shape|versions> <leveldb dir> [version number]")
os.Exit(1)
}
version := 0
if len(args) == 3 {
var err error
version, err = strconv.Atoi(args[2])
if err != nil {
fmt.Fprintf(os.Stderr, "Invalid version number: %s\n", err)
os.Exit(1)
}
}
tree, err := ReadTree(args[1], version)
if err != nil {
fmt.Fprintf(os.Stderr, "Error reading data: %s\n", err)
os.Exit(1)
}
switch args[0] {
case "data":
PrintKeys(tree)
fmt.Printf("Hash: %X\n", tree.Hash())
fmt.Printf("Size: %X\n", tree.Size())
case "shape":
PrintShape(tree)
case "versions":
PrintVersions(tree)
}
}
func OpenDB(dir string) (dbm.DB, error) {
switch {
case strings.HasSuffix(dir, ".db"):
dir = dir[:len(dir)-3]
case strings.HasSuffix(dir, ".db/"):
dir = dir[:len(dir)-4]
default:
return nil, fmt.Errorf("database directory must end with .db")
}
// TODO: doesn't work on windows!
cut := strings.LastIndex(dir, "/")
if cut == -1 {
return nil, fmt.Errorf("cannot cut paths on %s", dir)
}
name := dir[cut+1:]
db, err := dbm.NewGoLevelDB(name, dir[:cut])
if err != nil {
return nil, err
}
return db, nil
}
// nolint: unused,deadcode
func PrintDBStats(db dbm.DB) {
count := 0
prefix := map[string]int{}
iter, err := db.Iterator(nil, nil)
if err != nil {
panic(err)
}
for ; iter.Valid(); iter.Next() {
key := string(iter.Key()[:1])
prefix[key]++
count++
}
iter.Close()
fmt.Printf("DB contains %d entries\n", count)
for k, v := range prefix {
fmt.Printf(" %s: %d\n", k, v)
}
}
// ReadTree loads an iavl tree from the directory
// If version is 0, load latest, otherwise, load named version
func ReadTree(dir string, version int) (*iavl.MutableTree, error) {
db, err := OpenDB(dir)
if err != nil {
return nil, err
}
tree, err := iavl.NewMutableTree(db, DefaultCacheSize)
if err != nil {
return nil, err
}
ver, err := tree.LoadVersion(int64(version))
fmt.Printf("Got version: %d\n", ver)
return tree, err
}
func PrintKeys(tree *iavl.MutableTree) {
fmt.Println("Printing all keys with hashed values (to detect diff)")
tree.Iterate(func(key []byte, value []byte) bool {
printKey := parseWeaveKey(key)
digest := sha256.Sum256(value)
fmt.Printf(" %s\n %X\n", printKey, digest)
return false
})
}
// parseWeaveKey assumes a separating : where all in front should be ascii,
// and all afterwards may be ascii or binary
func parseWeaveKey(key []byte) string {
cut := bytes.IndexRune(key, ':')
if cut == -1 {
return encodeID(key)
}
prefix := key[:cut]
id := key[cut+1:]
return fmt.Sprintf("%s:%s", encodeID(prefix), encodeID(id))
}
// casts to a string if it is printable ascii, hex-encodes otherwise
func encodeID(id []byte) string {
for _, b := range id {
if b < 0x20 || b >= 0x80 {
return strings.ToUpper(hex.EncodeToString(id))
}
}
return string(id)
}
func PrintShape(tree *iavl.MutableTree) {
// shape := tree.RenderShape(" ", nil)
shape := tree.RenderShape(" ", nodeEncoder)
fmt.Println(strings.Join(shape, "\n"))
}
func nodeEncoder(id []byte, depth int, isLeaf bool) string {
prefix := fmt.Sprintf("-%d ", depth)
if isLeaf {
prefix = fmt.Sprintf("*%d ", depth)
}
if len(id) == 0 {
return fmt.Sprintf("%s<nil>", prefix)
}
return fmt.Sprintf("%s%s", prefix, parseWeaveKey(id))
}
func PrintVersions(tree *iavl.MutableTree) {
versions := tree.AvailableVersions()
fmt.Println("Available versions:")
for _, v := range versions {
fmt.Printf(" %d\n", v)
}
}