17933922378

Committed 23 Sep 2025 02:20AM UTC coverage: 55.978% (-10.7%) from 66.647%

Build Type

github

Committed by

Commit Message

Merge a87d79c05 into 82f77e542

Run Details

19 of 54 new or added lines in 2 files covered. (35.19%)

30681 existing lines in 467 files now uncovered.

97422 of 174037 relevant lines covered (55.98%)

0.59 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

75.0

/buffer/utils.go

1	package buffer
2
3	// RecycleSlice zeroes byte slice, making it fresh for another use.
4	// Zeroing the buffer using a logarithmic number of calls to the optimized copy
5	// method. Benchmarking shows this to be ~30 times faster than a for loop that
6	// sets each index to 0 for ~65KB buffers use for wire messages. Inspired by:
7	// https://stackoverflow.com/questions/30614165/is-there-analog-of-memset-in-go
8	func RecycleSlice(b []byte) {	1✔
9	if len(b) == 0 {	1✔
UNCOV 10	return	×
UNCOV 11	}	×
12
13	b[0] = 0	1✔
14	for i := 1; i < len(b); i *= 2 {	2✔
15	copy(b[i:], b[:i])	1✔
16	}	1✔
17	}