23495090469

Committed 24 Mar 2026 02:35PM UTC coverage: 62.622% (+0.5%) from 62.081%

Build Type

github

Committed by

Commit Message

Merge 06c383f26 into bee0d598c

Coverage Stats

142557 of 227647 relevant lines covered (62.62%)

19358.8 hits per line

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

100.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) {	86✔
9	if len(b) == 0 {	87✔
10	return	1✔
11	}	1✔
12
13	b[0] = 0	85✔
14	for i := 1; i < len(b); i *= 2 {	1,400✔
15	copy(b[i:], b[:i])	1,315✔
16	}	1,315✔
17	}