23225456449

Committed 18 Mar 2026 01:57AM UTC coverage: 52.146% (-10.2%) from 62.328%

Build Type

github

Committed by

Commit Message

Merge d1736eb3d into 21ee770e8

Coverage Stats

103 of 147 new or added lines in 7 files covered. (70.07%)

30810 existing lines in 474 files now uncovered.

101079 of 193840 relevant lines covered (52.15%)

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