Skip to content

db/seg, db/seg/patricia: fix fuzz harness defects #23173

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
AskAlexSharov merged 3 commits into from
Aug 12, 2026
+5 −2
Merged

db/seg, db/seg/patricia: fix fuzz harness defects #23173

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
97f43e3
db/seg/patricia: make FuzzLongestMatch input deterministic
AskAlexSharov Aug 11, 2026
01ec175
db/seg: fix uint8 overflow in FuzzCompress chunk size
AskAlexSharov Aug 11, 2026
ac53a22
db/seg: fix uint8 overflow in FuzzDecompressMatch chunk size
AskAlexSharov Aug 11, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion db/seg/compress_fuzz_test.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,7 @@ func FuzzCompress(f *testing.F) {
if pos[i] == 0 {
continue
}
next := min(j+int(pos[i]*10), len(x)-1)
next := min(j+int(pos[i])*10, len(x)-1)
bbb := x[j:next]
a = append(a, bbb)
j = next
Expand Down
2 changes: 1 addition & 1 deletion db/seg/decompress_fuzz_test.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,7 @@ func FuzzDecompressMatch(f *testing.F) {
if pos[i] == 0 {
continue
}
next := min(j+int(pos[i]*10), len(x)-1)
next := min(j+int(pos[i])*10, len(x)-1)
bbb := x[j:next]
a = append(a, bbb)
j = next
Expand Down
3 changes: 3 additions & 0 deletions db/seg/patricia/patricia_fuzz_test.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -61,6 +61,9 @@ func FuzzLongestMatch(f *testing.F) {
if len(keys) == 0 {
return
}
// keys indexes the generated match data below, so map iteration order
// would make the same fuzz input build a different test string each run.
slices.Sort(keys)
var data []byte
for i := 0; i < 4*(len(test)/4); i += 4 {
keyIdx := int(binary.BigEndian.Uint32(test[i : i+4]))
Expand Down
Loading