75 lines
1.9 KiB
Go
75 lines
1.9 KiB
Go
// Copyright (c) 2024 Karl Gaissmaier
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package bart
|
|
|
|
import (
|
|
"encoding/json"
|
|
"net/netip"
|
|
"slices"
|
|
)
|
|
|
|
// DumpListNode contains CIDR, value and list of subnets (tree childrens).
|
|
type DumpListNode[V any] struct {
|
|
CIDR netip.Prefix `json:"cidr"`
|
|
Value V `json:"value"`
|
|
Subnets []DumpListNode[V] `json:"subnets,omitempty"`
|
|
}
|
|
|
|
// MarshalJSON dumps the table into two sorted lists: for ipv4 and ipv6.
|
|
// Every root and subnet is an array, not a map, because the order matters.
|
|
func (t *Table[V]) MarshalJSON() ([]byte, error) {
|
|
t.init()
|
|
|
|
result := struct {
|
|
Ipv4 []DumpListNode[V] `json:"ipv4,omitempty"`
|
|
Ipv6 []DumpListNode[V] `json:"ipv6,omitempty"`
|
|
}{
|
|
Ipv4: t.DumpList4(),
|
|
Ipv6: t.DumpList6(),
|
|
}
|
|
|
|
buf, err := json.Marshal(result)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
return buf, nil
|
|
}
|
|
|
|
// DumpList4 dumps the ipv4 tree into a list of roots and their subnets.
|
|
// It can be used to analyze the tree or build custom json representation.
|
|
func (t *Table[V]) DumpList4() []DumpListNode[V] {
|
|
t.init()
|
|
if t.rootV4 == nil {
|
|
return nil
|
|
}
|
|
return t.rootV4.dumpListRec(0, zeroPath, 0, true)
|
|
}
|
|
|
|
// DumpList6 dumps the ipv6 tree into a list of roots and their subnets.
|
|
// It can be used to analyze the tree or build custom json representation.
|
|
func (t *Table[V]) DumpList6() []DumpListNode[V] {
|
|
t.init()
|
|
if t.rootV6 == nil {
|
|
return nil
|
|
}
|
|
return t.rootV6.dumpListRec(0, zeroPath, 0, false)
|
|
}
|
|
|
|
func (n *node[V]) dumpListRec(parentIdx uint, path [16]byte, depth int, is4 bool) []DumpListNode[V] {
|
|
directKids := n.getKidsRec(parentIdx, path, depth, is4)
|
|
slices.SortFunc(directKids, cmpKidByPrefix[V])
|
|
|
|
nodes := make([]DumpListNode[V], 0, len(directKids))
|
|
for _, kid := range directKids {
|
|
nodes = append(nodes, DumpListNode[V]{
|
|
CIDR: kid.cidr,
|
|
Value: kid.val,
|
|
Subnets: kid.n.dumpListRec(kid.idx, kid.path, kid.depth, is4),
|
|
})
|
|
}
|
|
|
|
return nodes
|
|
}
|