mirror/erigon-pulse
1
0
Fork 0
mirror of https://gitlab.com/pulsechaincom/erigon-pulse.git synced 2024-12-31 16:21:21 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

decompress: catch maxDepth underflow

Browse Source
This commit is contained in:
Alex Sharov 2022-08-01 12:37:10 +07:00 committed by GitHub
parent ea2d29332c
commit 127d1bac5b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 18 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
compress/decompress.go
View File

@ -126,7 +126,9 @@ func NewDecompressor(compressedFile string) (*Decompressor, error) {
bitLen: bitLen, bitLen: bitLen,
patterns: make([]*codeword, tableSize), patterns: make([]*codeword, tableSize),
} }
buildPatternTable(d.dict, depths, patterns, 0, 0, 0, patternMaxDepth) if _, err := buildPatternTable(d.dict, depths, patterns, 0, 0, 0, patternMaxDepth); err != nil {
return nil, err
}
} }
// read positions // read positions
@ -174,9 +176,9 @@ func NewDecompressor(compressedFile string) (*Decompressor, error) {
type word []byte // plain text word associated with code from dictionary type word []byte // plain text word associated with code from dictionary
// returns number of depth and patterns comsumed // returns number of depth and patterns comsumed
func buildPatternTable(table *patternTable, depths []uint64, patterns [][]byte, code uint16, bits int, depth uint64, maxDepth uint64) int { func buildPatternTable(table *patternTable, depths []uint64, patterns [][]byte, code uint16, bits int, depth uint64, maxDepth uint64) (int, error) {
if len(depths) == 0 { if len(depths) == 0 {
return 0 return 0, nil
} }
if depth == depths[0] { if depth == depths[0] {
pattern := word(patterns[0]) pattern := word(patterns[0])
@ -196,7 +198,7 @@ func buildPatternTable(table *patternTable, depths []uint64, patterns [][]byte,
p.pattern, p.len, p.ptr = &pattern, byte(bits), nil p.pattern, p.len, p.ptr = &pattern, byte(bits), nil
} }
} }
return 1 return 1, nil
} }
if bits == 9 { if bits == 9 {
var bitLen int var bitLen int
@ -214,8 +216,18 @@ func buildPatternTable(table *patternTable, depths []uint64, patterns [][]byte,
table.patterns[code] = &codeword{pattern: nil, len: byte(0), ptr: newTable} table.patterns[code] = &codeword{pattern: nil, len: byte(0), ptr: newTable}
return buildPatternTable(newTable, depths, patterns, 0, 0, depth, maxDepth) return buildPatternTable(newTable, depths, patterns, 0, 0, depth, maxDepth)
} }
b0 := buildPatternTable(table, depths, patterns, code, bits+1, depth+1, maxDepth-1) if maxDepth == 0 {
return b0 + buildPatternTable(table, depths[b0:], patterns[b0:], (uint16(1)<<bits)|code, bits+1, depth+1, maxDepth-1) return 0, fmt.Errorf("invalid snapshot format. decompress.buildPatternTable faced maxDepth underflow")
}
b0, err := buildPatternTable(table, depths, patterns, code, bits+1, depth+1, maxDepth-1)
if err != nil {
return 0, err
}
b1, err := buildPatternTable(table, depths[b0:], patterns[b0:], (uint16(1)<<bits)|code, bits+1, depth+1, maxDepth-1)
if err != nil {
return 0, err
}
return b0 + b1, nil
} }
func buildPosTable(depths []uint64, poss []uint64, table *posTable, code uint16, bits int, depth uint64, maxDepth uint64) int { func buildPosTable(depths []uint64, poss []uint64, table *posTable, code uint16, bits int, depth uint64, maxDepth uint64) int {