mirror/dolt
1
0
Fork 0
mirror of https://github.com/dolthub/dolt.git synced 2026-01-08 16:16:45 -06:00
Code Issues Packages Projects Releases 117 Wiki Activity

Merge pull request #8596 from dolthub/aaron/table-file-reader-suffixes-larger-than-4gb

Browse Source 
go/store/nbs: table_index.go: Improve support for large table files.
This commit is contained in:
Aaron Son
2024-11-25 19:27:36 +01:00
committed by GitHub
parent 9427579c20 fcfac4409b
commit 1801cdabe5
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
go/store/nbs/table_index.go
View File

@@ -287,7 +287,7 @@ func newOnHeapTableIndex(indexBuff []byte, offsetsBuff1 []byte, count uint32, to
func (ti onHeapTableIndex) entrySuffixMatches(idx uint32, h *hash.Hash) (bool, error) {
ord := ti.ordinalAt(idx)
o := ord * hash.SuffixLen
o := uint64(ord) * hash.SuffixLen
b := ti.suffixes[o : o+hash.SuffixLen]
return bytes.Equal(h[hash.PrefixLen:], b), nil
}
@@ -298,7 +298,7 @@ func (ti onHeapTableIndex) indexEntry(idx uint32, a *hash.Hash) (entry indexEntr
if a != nil {
binary.BigEndian.PutUint64(a[:], prefix)
o := int64(hash.SuffixLen * ord)
o := hash.SuffixLen * uint64(ord)
b := ti.suffixes[o : o+hash.SuffixLen]
copy(a[hash.PrefixLen:], b)
}
@@ -432,8 +432,9 @@ func (ti onHeapTableIndex) hashAt(idx uint32) hash.Hash {
// Get prefix, ordinal, and suffix
prefix := tuple[:hash.PrefixLen]
ord := binary.BigEndian.Uint32(tuple[hash.PrefixLen:]) * hash.SuffixLen
suffix := ti.suffixes[ord : ord+hash.SuffixLen] // suffix is 12 bytes
ord := binary.BigEndian.Uint32(tuple[hash.PrefixLen:])
suffixOffset := uint64(ord) * hash.SuffixLen
suffix := ti.suffixes[suffixOffset : suffixOffset+hash.SuffixLen]
// Combine prefix and suffix to get hash
buf := [hash.ByteLen]byte{}