16029443474

Committed 02 Jul 2025 03:33PM UTC coverage: 67.734% (+0.2%) from 67.54%

Build # 16029443474

Build Type

Pull #10028

github

Committed by

web-flow

Commit Message

Merge 5cea87470 into b5c84eab1

Pull Request Pull Request #10028: chainntnfs: export NotifierOptions and internal field for interface use

Run Details

6 of 6 new or added lines in 2 files covered. (100.0%)

28407 existing lines in 455 files now uncovered.

135470 of 200003 relevant lines covered (67.73%)

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

lightningnetwork / lnd / 16029443474

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