-
Notifications
You must be signed in to change notification settings - Fork 148
Expand file tree
/
Copy pathblockindex.go
More file actions
131 lines (109 loc) · 2.88 KB
/
blockindex.go
File metadata and controls
131 lines (109 loc) · 2.88 KB
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
/*
* Copyright 2018 The CovenantSQL Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package sqlchain
import (
"encoding/binary"
"sync"
"github.com/CovenantSQL/CovenantSQL/crypto/hash"
"github.com/CovenantSQL/CovenantSQL/types"
)
type blockNode struct {
parent *blockNode
block *types.Block
hash hash.Hash
height int32 // height is the chain height of the head
count int32 // count counts the blocks (except genesis) at this head
}
func newBlockNode(height int32, block *types.Block, parent *blockNode) *blockNode {
return &blockNode{
hash: *block.BlockHash(),
parent: parent,
block: block,
height: height,
count: func() int32 {
if parent != nil {
return parent.count + 1
}
return 0
}(),
}
}
func (n *blockNode) initBlockNode(height int32, block *types.Block, parent *blockNode) {
n.block = block
n.hash = *block.BlockHash()
n.parent = nil
n.height = height
n.count = 0
if parent != nil {
n.parent = parent
n.count = parent.count + 1
}
}
func (n *blockNode) ancestor(height int32) (ancestor *blockNode) {
if height < 0 || height > n.height {
return nil
}
for ancestor = n; ancestor != nil && ancestor.height > height; ancestor = ancestor.parent {
}
// The block at this height may not exist
if ancestor != nil && ancestor.height < height {
ancestor = nil
}
return
}
func (n *blockNode) ancestorByCount(count int32) (ancestor *blockNode) {
if count < 0 || count > n.count {
return nil
}
for ancestor = n; ancestor != nil && ancestor.count > count; ancestor = ancestor.parent {
}
if ancestor != nil && ancestor.count < count {
ancestor = nil
}
return
}
func (n *blockNode) indexKey() (key []byte) {
key = make([]byte, hash.HashSize+4)
binary.BigEndian.PutUint32(key[0:4], uint32(n.height))
copy(key[4:hash.HashSize+4], n.hash[:])
return
}
type blockIndex struct {
mu sync.RWMutex
index map[hash.Hash]*blockNode
}
func newBlockIndex() (index *blockIndex) {
return &blockIndex{
index: make(map[hash.Hash]*blockNode),
}
}
func (i *blockIndex) addBlock(newBlock *blockNode) {
i.mu.Lock()
defer i.mu.Unlock()
i.index[newBlock.hash] = newBlock
}
func (i *blockIndex) hasBlock(hash *hash.Hash) (hasBlock bool) {
i.mu.RLock()
defer i.mu.RUnlock()
_, hasBlock = i.index[*hash]
return
}
func (i *blockIndex) lookupNode(hash *hash.Hash) (b *blockNode) {
i.mu.RLock()
defer i.mu.RUnlock()
b = i.index[*hash]
return
}