forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-07-25 06:06:44 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Revert "expose stats"

Browse source 
This reverts commit d0cef767e12fc63d081871fc3913af83719a0034.
This commit is contained in:
jsvisa 2025-08-25 10:22:39 +08:00 committed by Gary Rong
parent d74dd39131
commit 898057af09
1 changed files with 6 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
core/state/state_sizer.go
View file

@ -235,7 +235,6 @@ type SizeTracker struct {
abort chan struct{} abort chan struct{}
aborted chan struct{} aborted chan struct{}
updateCh chan *stateUpdate updateCh chan *stateUpdate
stats map[common.Hash]SizeStats // internal stats map
} }
// NewSizeTracker creates a new state size tracker and starts it automatically // NewSizeTracker creates a new state size tracker and starts it automatically
@ -249,7 +248,6 @@ func NewSizeTracker(db ethdb.KeyValueStore, triedb *triedb.Database) (*SizeTrack
abort: make(chan struct{}), abort: make(chan struct{}),
aborted: make(chan struct{}), aborted: make(chan struct{}),
updateCh: make(chan *stateUpdate), updateCh: make(chan *stateUpdate),
stats: make(map[common.Hash]SizeStats),
} }
go t.run() go t.run()
return t, nil return t, nil
@ -288,14 +286,13 @@ func (t *SizeTracker) run() {
if err != nil { if err != nil {
return return
} }
t.stats = stats
h := sizeStatsHeap(slices.Collect(maps.Values(stats))) h := sizeStatsHeap(slices.Collect(maps.Values(stats)))
heap.Init(&h) heap.Init(&h)
for { for {
select { select {
case u := <-t.updateCh: case u := <-t.updateCh:
base, found := t.stats[u.originRoot] base, found := stats[u.originRoot]
if !found { if !found {
continue continue
} }
@ -304,14 +301,15 @@ func (t *SizeTracker) run() {
continue continue
} }
stat := base.add(diff) stat := base.add(diff)
t.stats[u.root] = stat stats[u.root] = stat
t.upload(stat) t.upload(stat)
heap.Push(&h, t.stats[u.root]) heap.Push(&h, stats[u.root])
for len(h) > 0 && u.blockNumber-h[0].BlockNumber > statEvictThreshold { for u.blockNumber-h[0].BlockNumber > statEvictThreshold {
delete(t.stats, h[0].StateRoot) delete(stats, h[0].StateRoot)
heap.Pop(&h) heap.Pop(&h)
} }
case <-t.abort: case <-t.abort:
return return
} }
@ -514,8 +512,6 @@ func (t *SizeTracker) Notify(update *stateUpdate) {
case t.updateCh <- update: case t.updateCh <- update:
case <-t.abort: case <-t.abort:
return return
default:
// Drop update if channel is full
} }
} }