aboutsummaryrefslogtreecommitdiffstats
path: root/core/blockchain_insert.go
blob: 7fb15b639f1540a33024588c5e70e83b5739bc59 (plain) (blame)
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
// Copyright 2018 The go-ethereum Authors
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.

package core

import (
    "time"

    "github.com/dexon-foundation/dexon/common"
    "github.com/dexon-foundation/dexon/common/mclock"
    "github.com/dexon-foundation/dexon/core/types"
    "github.com/dexon-foundation/dexon/log"
)

// insertStats tracks and reports on block insertion.
type insertStats struct {
    queued, processed, ignored int
    usedGas                    uint64
    lastIndex                  int
    startTime                  mclock.AbsTime
}

// statsReportLimit is the time limit during import and export after which we
// always print out progress. This avoids the user wondering what's going on.
const statsReportLimit = 8 * time.Second

// report prints statistics if some number of blocks have been processed
// or more than a few seconds have passed since the last message.
func (st *insertStats) report(chain []*types.Block, index int, cache common.StorageSize) {
    // Fetch the timings for the batch
    var (
        now     = mclock.Now()
        elapsed = time.Duration(now) - time.Duration(st.startTime)
    )
    // If we're at the last block of the batch or report period reached, log
    if index == len(chain)-1 || elapsed >= statsReportLimit {
        // Count the number of transactions in this segment
        var txs int
        for _, block := range chain[st.lastIndex : index+1] {
            txs += len(block.Transactions())
        }
        end := chain[index]

        // Assemble the log context and send it to the logger
        context := []interface{}{
            "blocks", st.processed, "txs", txs, "mgas", float64(st.usedGas) / 1000000,
            "elapsed", common.PrettyDuration(elapsed), "mgasps", float64(st.usedGas) * 1000 / float64(elapsed),
            "number", end.Number(), "hash", end.Hash(),
        }
        if timestamp := time.Unix(int64(end.Time()), 0); time.Since(timestamp) > time.Minute {
            context = append(context, []interface{}{"age", common.PrettyAge(timestamp)}...)
        }
        context = append(context, []interface{}{"cache", cache}...)

        if st.queued > 0 {
            context = append(context, []interface{}{"queued", st.queued}...)
        }
        if st.ignored > 0 {
            context = append(context, []interface{}{"ignored", st.ignored}...)
        }
        log.Info("Imported new chain segment", context...)

        // Bump the stats reported to the next section
        *st = insertStats{startTime: now, lastIndex: index + 1}
    }
}

// insertIterator is a helper to assist during chain import.
type insertIterator struct {
    chain     types.Blocks
    results   <-chan error
    index     int
    validator Validator
}

// newInsertIterator creates a new iterator based on the given blocks, which are
// assumed to be a contiguous chain.
func newInsertIterator(chain types.Blocks, results <-chan error, validator Validator) *insertIterator {
    return &insertIterator{
        chain:     chain,
        results:   results,
        index:     -1,
        validator: validator,
    }
}

// next returns the next block in the iterator, along with any potential validation
// error for that block. When the end is reached, it will return (nil, nil).
func (it *insertIterator) next() (*types.Block, error) {
    if it.index+1 >= len(it.chain) {
        it.index = len(it.chain)
        return nil, nil
    }
    it.index++
    if err := <-it.results; err != nil {
        return it.chain[it.index], err
    }
    return it.chain[it.index], it.validator.ValidateBody(it.chain[it.index])
}

// previous returns the previous block was being processed, or nil
func (it *insertIterator) previous() *types.Block {
    if it.index < 1 {
        return nil
    }
    return it.chain[it.index-1]
}

// first returns the first block in the it.
func (it *insertIterator) first() *types.Block {
    return it.chain[0]
}

// remaining returns the number of remaining blocks.
func (it *insertIterator) remaining() int {
    return len(it.chain) - it.index
}

// processed returns the number of processed blocks.
func (it *insertIterator) processed() int {
    return it.index + 1
}