-
Notifications
You must be signed in to change notification settings - Fork 574
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat: implement new address sorting algorithm
Fixes #9725 See #9749 Signed-off-by: Andrey Smirnov <[email protected]>
- Loading branch information
Showing
38 changed files
with
1,893 additions
and
818 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
machine: | ||
features: | ||
nodeAddressSortAlgorithm: v2 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
67 changes: 67 additions & 0 deletions
67
internal/app/machined/pkg/controllers/network/internal/addressutil/addressutil.go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,67 @@ | ||
// This Source Code Form is subject to the terms of the Mozilla Public | ||
// License, v. 2.0. If a copy of the MPL was not distributed with this | ||
// file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
|
||
// Package addressutil contains helpers working with addresses. | ||
package addressutil | ||
|
||
import "net/netip" | ||
|
||
// DeduplicateIPPrefixes removes duplicates from the given list of prefixes. | ||
// | ||
// The input list must be sorted. | ||
// DeduplicateIPPrefixes performs in-place deduplication. | ||
func DeduplicateIPPrefixes(in []netip.Prefix) []netip.Prefix { | ||
// assumes that current is sorted | ||
n := 0 | ||
|
||
var prev netip.Prefix | ||
|
||
for _, x := range in { | ||
if prev != x { | ||
in[n] = x | ||
n++ | ||
} | ||
|
||
prev = x | ||
} | ||
|
||
return in[:n] | ||
} | ||
|
||
// FilterIPs filters the given list of IP prefixes based on the given include and exclude subnets. | ||
// | ||
// If includeSubnets is not empty, only IPs that are in one of the subnets are included. | ||
// If excludeSubnets is not empty, IPs that are in one of the subnets are excluded. | ||
func FilterIPs(addrs []netip.Prefix, includeSubnets, excludeSubnets []netip.Prefix) []netip.Prefix { | ||
result := make([]netip.Prefix, 0, len(addrs)) | ||
|
||
outer: | ||
for _, ip := range addrs { | ||
if len(includeSubnets) > 0 { | ||
matchesAny := false | ||
|
||
for _, subnet := range includeSubnets { | ||
if subnet.Contains(ip.Addr()) { | ||
matchesAny = true | ||
|
||
break | ||
} | ||
} | ||
|
||
if !matchesAny { | ||
continue outer | ||
} | ||
} | ||
|
||
for _, subnet := range excludeSubnets { | ||
if subnet.Contains(ip.Addr()) { | ||
continue outer | ||
} | ||
} | ||
|
||
result = append(result, ip) | ||
} | ||
|
||
return result | ||
} |
105 changes: 105 additions & 0 deletions
105
internal/app/machined/pkg/controllers/network/internal/addressutil/addressutil_test.go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,105 @@ | ||
// This Source Code Form is subject to the terms of the Mozilla Public | ||
// License, v. 2.0. If a copy of the MPL was not distributed with this | ||
// file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
|
||
package addressutil_test | ||
|
||
import ( | ||
"net/netip" | ||
"testing" | ||
|
||
"github.com/stretchr/testify/assert" | ||
|
||
"github.com/siderolabs/talos/internal/app/machined/pkg/controllers/network/internal/addressutil" | ||
) | ||
|
||
func TestDeduplicateIPPrefixes(t *testing.T) { | ||
t.Parallel() | ||
|
||
for _, test := range []struct { | ||
name string | ||
in []netip.Prefix | ||
|
||
out []netip.Prefix | ||
}{ | ||
{ | ||
name: "empty", | ||
}, | ||
{ | ||
name: "single", | ||
in: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32"), netip.MustParsePrefix("1.2.3.4/32")}, | ||
|
||
out: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32")}, | ||
}, | ||
{ | ||
name: "many", | ||
in: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32"), netip.MustParsePrefix("1.2.3.4/24"), netip.MustParsePrefix("2000::aebc/64"), netip.MustParsePrefix("2000::aebc/64")}, | ||
|
||
out: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32"), netip.MustParsePrefix("1.2.3.4/24"), netip.MustParsePrefix("2000::aebc/64")}, | ||
}, | ||
} { | ||
t.Run(test.name, func(t *testing.T) { | ||
t.Parallel() | ||
|
||
got := addressutil.DeduplicateIPPrefixes(test.in) | ||
|
||
assert.Equal(t, test.out, got) | ||
}) | ||
} | ||
} | ||
|
||
// TestFilterIPs tests the FilterIPs function. | ||
func TestFilterIPs(t *testing.T) { | ||
t.Parallel() | ||
|
||
for _, test := range []struct { | ||
name string | ||
|
||
in []netip.Prefix | ||
include []netip.Prefix | ||
exclude []netip.Prefix | ||
|
||
out []netip.Prefix | ||
}{ | ||
{ | ||
name: "empty filters", | ||
|
||
in: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32"), netip.MustParsePrefix("2000::aebc/64")}, | ||
|
||
out: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32"), netip.MustParsePrefix("2000::aebc/64")}, | ||
}, | ||
{ | ||
name: "v4 only", | ||
|
||
in: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32"), netip.MustParsePrefix("2000::aebc/64")}, | ||
include: []netip.Prefix{netip.MustParsePrefix("0.0.0.0/0")}, | ||
|
||
out: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32")}, | ||
}, | ||
{ | ||
name: "v6 only", | ||
|
||
in: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32"), netip.MustParsePrefix("2000::aebc/64")}, | ||
exclude: []netip.Prefix{netip.MustParsePrefix("0.0.0.0/0")}, | ||
|
||
out: []netip.Prefix{netip.MustParsePrefix("2000::aebc/64")}, | ||
}, | ||
{ | ||
name: "include and exclude", | ||
|
||
in: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32"), netip.MustParsePrefix("3.4.5.6/24"), netip.MustParsePrefix("2000::aebc/64")}, | ||
include: []netip.Prefix{netip.MustParsePrefix("0.0.0.0/0")}, | ||
exclude: []netip.Prefix{netip.MustParsePrefix("3.0.0.0/8")}, | ||
|
||
out: []netip.Prefix{netip.MustParsePrefix("1.2.3.4/32")}, | ||
}, | ||
} { | ||
t.Run(test.name, func(t *testing.T) { | ||
t.Parallel() | ||
|
||
got := addressutil.FilterIPs(test.in, test.include, test.exclude) | ||
|
||
assert.Equal(t, test.out, got) | ||
}) | ||
} | ||
} |
89 changes: 89 additions & 0 deletions
89
internal/app/machined/pkg/controllers/network/internal/addressutil/compare.go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,89 @@ | ||
// This Source Code Form is subject to the terms of the Mozilla Public | ||
// License, v. 2.0. If a copy of the MPL was not distributed with this | ||
// file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
|
||
package addressutil | ||
|
||
import ( | ||
"cmp" | ||
"fmt" | ||
"net/netip" | ||
|
||
"github.com/siderolabs/talos/pkg/machinery/nethelpers" | ||
"github.com/siderolabs/talos/pkg/machinery/resources/network" | ||
) | ||
|
||
// CompareByAlgorithm returns a comparison function based on the given algorithm. | ||
func CompareByAlgorithm(algorithm nethelpers.AddressSortAlgorithm) func(a, b netip.Prefix) int { | ||
switch algorithm { | ||
case nethelpers.AddressSortAlgorithmV1: | ||
return ComparePrefixesLegacy | ||
case nethelpers.AddressSortAlgorithmV2: | ||
return ComparePrefixNew | ||
} | ||
|
||
panic(fmt.Sprintf("unknown address sort algorithm: %s", algorithm)) | ||
} | ||
|
||
// ComparePrefixesLegacy is the old way to sort prefixes. | ||
// | ||
// It only compares addresses and does not take prefix length into account. | ||
func ComparePrefixesLegacy(a, b netip.Prefix) int { | ||
if c := a.Addr().Compare(b.Addr()); c != 0 { | ||
return c | ||
} | ||
|
||
// note: this was missing in the previous implementation, but this makes sorting stable | ||
return cmp.Compare(a.Bits(), b.Bits()) | ||
} | ||
|
||
func family(a netip.Prefix) int { | ||
if a.Addr().Is4() { | ||
return 4 | ||
} | ||
|
||
return 6 | ||
} | ||
|
||
// ComparePrefixNew compares two prefixes by address family, address, and prefix length. | ||
// | ||
// It prefers more specific prefixes. | ||
func ComparePrefixNew(a, b netip.Prefix) int { | ||
// (1): first, compare address families | ||
if c := cmp.Compare(family(a), family(b)); c != 0 { | ||
return c | ||
} | ||
|
||
// (2): if addresses are equal, Contains will report that one prefix contains the other, so compare prefix lengths | ||
if a.Addr() == b.Addr() { | ||
return -cmp.Compare(a.Bits(), b.Bits()) | ||
} | ||
|
||
// (3): if one prefix contains another, the more specific one should come first | ||
// but if both prefixes contain each other, proceed to compare addresses | ||
aContainsB := a.Contains(b.Addr()) | ||
bContainsA := b.Contains(a.Addr()) | ||
|
||
switch { | ||
case aContainsB && !bContainsA: | ||
return 1 | ||
case !aContainsB && bContainsA: | ||
return -1 | ||
} | ||
|
||
// (4): compare addresses, they are not equal at this point (see (2)) | ||
return a.Addr().Compare(b.Addr()) | ||
} | ||
|
||
// CompareAddressStatuses compares two address statuses with the prefix comparison func. | ||
// | ||
// The comparison of AddressStatuses sorts by link name and then by address. | ||
func CompareAddressStatuses(comparePrefixes func(a, b netip.Prefix) int) func(a, b *network.AddressStatus) int { | ||
return func(a, b *network.AddressStatus) int { | ||
if c := cmp.Compare(a.TypedSpec().LinkName, b.TypedSpec().LinkName); c != 0 { | ||
return c | ||
} | ||
|
||
return comparePrefixes(a.TypedSpec().Address, b.TypedSpec().Address) | ||
} | ||
} |
Oops, something went wrong.