25455608158

Committed 06 May 2026 07:10PM UTC coverage: 62.23% (+0.002%) from 62.228%

Build # 25455608158

Build Type

Pull #10686

github

Committed by

web-flow

Commit Message

Merge c5cd7ffca into 6fd5b7bb2

Pull Request Pull Request #10686: chainreg: use getnetworkinfo to count outbound peers (bitcoind backend)

Coverage Stats

7 of 37 new or added lines in 1 file covered. (18.92%)

31329 existing lines in 480 files now uncovered.

143794 of 231070 relevant lines covered (62.23%)

19066.44 hits per line

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

100.0

/buffer/utils.go

package buffer

// RecycleSlice zeroes byte slice, making it fresh for another use.
// Zeroing the buffer using a logarithmic number of calls to the optimized copy
// method.  Benchmarking shows this to be ~30 times faster than a for loop that
// sets each index to 0 for ~65KB buffers use for wire messages. Inspired by:
// https://stackoverflow.com/questions/30614165/is-there-analog-of-memset-in-go
func RecycleSlice(b []byte) {
        if len(b) == 0 {
                return
        }

        b[0] = 0
        for i := 1; i < len(b); i *= 2 {
                copy(b[i:], b[:i])
        }
}

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

lightningnetwork / lnd / 25455608158

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

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