18057435015

Committed 27 Sep 2025 08:27AM UTC coverage: 66.623% (+0.02%) from 66.601%

Build # 18057435015

Build Type

Pull #10248

github

Committed by

web-flow

Commit Message

Merge badc471a8 into 641456e21

Pull Request Pull Request #10248: Enforce TLV when creating a Route

Run Details

86 of 119 new or added lines in 5 files covered. (72.27%)

28747 existing lines in 465 files now uncovered.

136873 of 205443 relevant lines covered (66.62%)

21376.11 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 / 18057435015

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