54 lines
2.0 KiB
Go
54 lines
2.0 KiB
Go
// Copyright 2023 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 triestate
|
|
|
|
import "github.com/ethereum/go-ethereum/common"
|
|
|
|
// Set represents a collection of mutated states during a state transition.
|
|
// The value refers to the original content of state before the transition
|
|
// is made. Nil means that the state was not present previously.
|
|
type Set struct {
|
|
Accounts map[common.Address][]byte // Mutated account set, nil means the account was not present
|
|
Storages map[common.Address]map[common.Hash][]byte // Mutated storage set, nil means the slot was not present
|
|
size common.StorageSize // Approximate size of set
|
|
}
|
|
|
|
// New constructs the state set with provided data.
|
|
func New(accounts map[common.Address][]byte, storages map[common.Address]map[common.Hash][]byte) *Set {
|
|
return &Set{
|
|
Accounts: accounts,
|
|
Storages: storages,
|
|
}
|
|
}
|
|
|
|
// Size returns the approximate memory size occupied by the set.
|
|
func (s *Set) Size() common.StorageSize {
|
|
if s.size != 0 {
|
|
return s.size
|
|
}
|
|
for _, account := range s.Accounts {
|
|
s.size += common.StorageSize(common.AddressLength + len(account))
|
|
}
|
|
for _, slots := range s.Storages {
|
|
for _, val := range slots {
|
|
s.size += common.StorageSize(common.HashLength + len(val))
|
|
}
|
|
s.size += common.StorageSize(common.AddressLength)
|
|
}
|
|
return s.size
|
|
}
|