25864777516

Committed 14 May 2026 02:09PM UTC coverage: 52.189% (-10.0%) from 62.233%

Build Type

github

Committed by

Commit Message

Merge b4b65bb3a into b9b299bec

Coverage Stats

28 of 371 new or added lines in 4 files covered. (7.55%)

31416 existing lines in 482 files now uncovered.

103065 of 197486 relevant lines covered (52.19%)

2.16 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) {	4✔
9	if len(b) == 0 {	4✔
UNCOV 10	return	×
UNCOV 11	}	×
12
13	b[0] = 0	4✔
14	for i := 1; i < len(b); i *= 2 {	8✔
15	copy(b[i:], b[:i])	4✔
16	}	4✔
17	}