15205630088

Committed 23 May 2025 08:14AM UTC coverage: 57.45% (-11.5%) from 68.996%

Build # 15205630088

Build Type

Pull #9784

github

Committed by

web-flow

Commit Message

Merge f8b9f36a3 into c52a6ddeb

Pull Request Pull Request #9784: [wip] lnwallet+walletrpc: add SubmitPackage and related RPC call

Run Details

47 of 96 new or added lines in 5 files covered. (48.96%)

30087 existing lines in 459 files now uncovered.

95586 of 166380 relevant lines covered (57.45%)

0.61 hits per line

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

87.5

/graph/db/channel_cache.go

package graphdb

// channelCache is an in-memory cache used to improve the performance of
// ChanUpdatesInHorizon. It caches the chan info and edge policies for a
// particular channel.
type channelCache struct {
        n        int
        channels map[uint64]ChannelEdge
}

// newChannelCache creates a new channelCache with maximum capacity of n
// channels.
func newChannelCache(n int) *channelCache {
        return &channelCache{
                n:        n,
                channels: make(map[uint64]ChannelEdge),
        }
}

// get returns the channel from the cache, if it exists.
func (c *channelCache) get(chanid uint64) (ChannelEdge, bool) {
        channel, ok := c.channels[chanid]
        return channel, ok
}

// insert adds the entry to the channel cache. If an entry for chanid already
// exists, it will be replaced with the new entry. If the entry doesn't exist,
// it will be inserted to the cache, performing a random eviction if the cache
// is at capacity.
func (c *channelCache) insert(chanid uint64, channel ChannelEdge) {
        // If entry exists, replace it.
        if _, ok := c.channels[chanid]; ok {
                c.channels[chanid] = channel
                return
        }

        // Otherwise, evict an entry at random and insert.
        if len(c.channels) == c.n {
                for id := range c.channels {
                        delete(c.channels, id)
                        break
                }
        }
        c.channels[chanid] = channel
}

// remove deletes an edge for chanid from the cache, if it exists.
func (c *channelCache) remove(chanid uint64) {
        delete(c.channels, chanid)
}

1	package graphdb
2
3	// channelCache is an in-memory cache used to improve the performance of
4	// ChanUpdatesInHorizon. It caches the chan info and edge policies for a
5	// particular channel.
6	type channelCache struct {
7	n int
8	channels map[uint64]ChannelEdge
9	}
10
11	// newChannelCache creates a new channelCache with maximum capacity of n
12	// channels.
13	func newChannelCache(n int) *channelCache {	1✔
14	return &channelCache{	1✔
15	n: n,	1✔
16	channels: make(map[uint64]ChannelEdge),	1✔
17	}	1✔
18	}	1✔
19
20	// get returns the channel from the cache, if it exists.
21	func (c *channelCache) get(chanid uint64) (ChannelEdge, bool) {	1✔
22	channel, ok := c.channels[chanid]	1✔
23	return channel, ok	1✔
24	}	1✔
25
26	// insert adds the entry to the channel cache. If an entry for chanid already
27	// exists, it will be replaced with the new entry. If the entry doesn't exist,
28	// it will be inserted to the cache, performing a random eviction if the cache
29	// is at capacity.
30	func (c *channelCache) insert(chanid uint64, channel ChannelEdge) {	1✔
31	// If entry exists, replace it.	1✔
32	if _, ok := c.channels[chanid]; ok {	2✔
33	c.channels[chanid] = channel	1✔
34	return	1✔
35	}	1✔
36
37	// Otherwise, evict an entry at random and insert.
38	if len(c.channels) == c.n {	1✔
UNCOV 39	for id := range c.channels {	×
UNCOV 40	delete(c.channels, id)	×
UNCOV 41	break	×
42	}
43	}
44	c.channels[chanid] = channel	1✔
45	}
46
47	// remove deletes an edge for chanid from the cache, if it exists.
48	func (c *channelCache) remove(chanid uint64) {	1✔
49	delete(c.channels, chanid)	1✔
50	}	1✔

lightningnetwork / lnd / 15205630088

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