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

avoid yet another AI PR

Browse source
This commit is contained in:
Guillaume Ballet 2025-10-13 14:48:06 -04:00
parent 14c59592fa
commit 5251356c46
1 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
triedb/pathdb/history_trienode.go
View file

@ -161,7 +161,7 @@ func newTrienodeHistory(root common.Hash, parent common.Hash, block uint64, node
// sharedLen returns the length of the common prefix shared by a and b. // sharedLen returns the length of the common prefix shared by a and b.
func sharedLen(a, b []byte) int { func sharedLen(a, b []byte) int {
n := min(len(a), len(b)) n := min(len(a), len(b))
for i := 0; i < n; i++ { for i := range n {
if a[i] != b[i] { if a[i] != b[i] {
return i return i
} }
@ -295,7 +295,7 @@ func decodeHeader(data []byte) (*trienodeMetadata, []common.Hash, []uint32, []ui
keyOffsets = make([]uint32, 0, count) keyOffsets = make([]uint32, 0, count)
valOffsets = make([]uint32, 0, count) valOffsets = make([]uint32, 0, count)
) )
for i := 0; i < count; i++ { for i := range count {
n := trienodeMetadataSize + trienodeTrieHeaderSize*i n := trienodeMetadataSize + trienodeTrieHeaderSize*i
owner := common.BytesToHash(data[n : n+common.HashLength]) owner := common.BytesToHash(data[n : n+common.HashLength])
if i != 0 && bytes.Compare(owner.Bytes(), owners[i-1].Bytes()) <= 0 { if i != 0 && bytes.Compare(owner.Bytes(), owners[i-1].Bytes()) <= 0 {
@ -348,7 +348,7 @@ func decodeSingle(keySection []byte, onValue func([]byte, int, int) error) ([]st
if len(keySection) < int(8*nRestarts)+4 { if len(keySection) < int(8*nRestarts)+4 {
return nil, fmt.Errorf("key section too short, restarts: %d, size: %d", nRestarts, len(keySection)) return nil, fmt.Errorf("key section too short, restarts: %d, size: %d", nRestarts, len(keySection))
} }
for i := 0; i < int(nRestarts); i++ { for i := range int(nRestarts) {
o := len(keySection) - 4 - (int(nRestarts)-i)*8 o := len(keySection) - 4 - (int(nRestarts)-i)*8
keyOffset := binary.BigEndian.Uint32(keySection[o : o+4]) keyOffset := binary.BigEndian.Uint32(keySection[o : o+4])
if i != 0 && keyOffset <= keyOffsets[i-1] { if i != 0 && keyOffset <= keyOffsets[i-1] {
@ -469,7 +469,7 @@ func (h *trienodeHistory) decode(header []byte, keySection []byte, valueSection
h.nodeList = make(map[common.Hash][]string) h.nodeList = make(map[common.Hash][]string)
h.nodes = make(map[common.Hash]map[string][]byte) h.nodes = make(map[common.Hash]map[string][]byte)
for i := 0; i < len(owners); i++ { for i := range len(owners) {
// Resolve the boundary of key section // Resolve the boundary of key section
keyStart := keyOffsets[i] keyStart := keyOffsets[i]
keyLimit := len(keySection) keyLimit := len(keySection)