15426453692

Committed 03 Jun 2025 07:48PM UTC coverage: 58.323% (-10.1%) from 68.458%

Build Type

github

Committed by

Commit Message

Merge a20c4b3ae into ac76d6311

Run Details

2 of 2 new or added lines in 1 file covered. (100.0%)

28286 existing lines in 454 files now uncovered.

97505 of 167181 relevant lines covered (58.32%)

1.81 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	}