2021-10-26 01:21:00 +02:00
|
|
|
// Copyright 2021 Google LLC
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
|
|
|
|
|
|
|
package compliance
|
|
|
|
|
|
|
|
import (
|
|
|
|
"sort"
|
|
|
|
"testing"
|
|
|
|
)
|
|
|
|
|
|
|
|
var (
|
|
|
|
// bottomUp describes the bottom-up resolve of a hypothetical graph
|
|
|
|
// the graph has a container image, a couple binaries, and a couple
|
|
|
|
// libraries. bin1 statically links lib1 and dynamically links lib2;
|
|
|
|
// bin2 dynamically links lib1 and statically links lib2.
|
|
|
|
// binc represents a compiler or other toolchain binary used for
|
|
|
|
// building the other binaries.
|
|
|
|
bottomUp = []res{
|
|
|
|
{"image", "image", "image", "notice"},
|
|
|
|
{"image", "image", "bin2", "restricted"},
|
|
|
|
{"image", "bin1", "bin1", "reciprocal"},
|
|
|
|
{"image", "bin2", "bin2", "restricted"},
|
|
|
|
{"image", "lib1", "lib1", "notice"},
|
|
|
|
{"image", "lib2", "lib2", "notice"},
|
|
|
|
{"binc", "binc", "binc", "proprietary"},
|
|
|
|
{"bin1", "bin1", "bin1", "reciprocal"},
|
|
|
|
{"bin1", "lib1", "lib1", "notice"},
|
|
|
|
{"bin2", "bin2", "bin2", "restricted"},
|
|
|
|
{"bin2", "lib2", "lib2", "notice"},
|
|
|
|
{"lib1", "lib1", "lib1", "notice"},
|
|
|
|
{"lib2", "lib2", "lib2", "notice"},
|
|
|
|
}
|
|
|
|
|
|
|
|
// notice describes bottomUp after a top-down notice resolve.
|
|
|
|
notice = []res{
|
|
|
|
{"image", "image", "image", "notice"},
|
|
|
|
{"image", "image", "bin2", "restricted"},
|
|
|
|
{"image", "bin1", "bin1", "reciprocal"},
|
|
|
|
{"image", "bin2", "bin2", "restricted"},
|
|
|
|
{"image", "lib1", "lib1", "notice"},
|
|
|
|
{"image", "lib2", "bin2", "restricted"},
|
|
|
|
{"image", "lib2", "lib2", "notice"},
|
|
|
|
{"bin1", "bin1", "bin1", "reciprocal"},
|
|
|
|
{"bin1", "lib1", "lib1", "notice"},
|
|
|
|
{"bin2", "bin2", "bin2", "restricted"},
|
|
|
|
{"bin2", "lib2", "bin2", "restricted"},
|
|
|
|
{"bin2", "lib2", "lib2", "notice"},
|
|
|
|
{"lib1", "lib1", "lib1", "notice"},
|
|
|
|
{"lib2", "lib2", "lib2", "notice"},
|
|
|
|
}
|
|
|
|
|
|
|
|
// share describes bottomUp after a top-down share resolve.
|
|
|
|
share = []res{
|
|
|
|
{"image", "image", "bin2", "restricted"},
|
|
|
|
{"image", "bin1", "bin1", "reciprocal"},
|
|
|
|
{"image", "bin2", "bin2", "restricted"},
|
|
|
|
{"image", "lib2", "bin2", "restricted"},
|
|
|
|
{"bin1", "bin1", "bin1", "reciprocal"},
|
|
|
|
{"bin2", "bin2", "bin2", "restricted"},
|
|
|
|
{"bin2", "lib2", "bin2", "restricted"},
|
|
|
|
}
|
|
|
|
|
|
|
|
// proprietary describes bottomUp after a top-down proprietary resolve.
|
|
|
|
// Note that the proprietary binc is not reachable through the toolchain
|
|
|
|
// dependency.
|
|
|
|
proprietary = []res{}
|
|
|
|
)
|
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
func TestResolutionSet_AttachesTo(t *testing.T) {
|
2021-10-26 01:21:00 +02:00
|
|
|
lg := newLicenseGraph()
|
|
|
|
|
|
|
|
rsShare := toResolutionSet(lg, share)
|
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
t.Logf("checking resolution set %s", rsShare.String())
|
2021-10-26 01:21:00 +02:00
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
actual := rsShare.AttachesTo().Names()
|
|
|
|
sort.Strings(actual)
|
2021-10-26 01:21:00 +02:00
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
expected := []string{"bin1", "bin2", "image"}
|
2021-10-26 01:21:00 +02:00
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
t.Logf("actual rsShare: %v", actual)
|
|
|
|
t.Logf("expected rsShare: %v", expected)
|
2021-10-26 01:21:00 +02:00
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
if len(actual) != len(expected) {
|
|
|
|
t.Errorf("rsShare: wrong number of targets: got %d, want %d", len(actual), len(expected))
|
|
|
|
return
|
2021-10-26 01:21:00 +02:00
|
|
|
}
|
2022-01-10 22:50:57 +01:00
|
|
|
for i := 0; i < len(actual); i++ {
|
|
|
|
if actual[i] != expected[i] {
|
|
|
|
t.Errorf("rsShare: unexpected target at index %d: got %s, want %s", i, actual[i], expected[i])
|
|
|
|
}
|
2021-10-26 01:21:00 +02:00
|
|
|
}
|
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
rsPrivate := toResolutionSet(lg, proprietary)
|
|
|
|
actual = rsPrivate.AttachesTo().Names()
|
|
|
|
expected = []string{}
|
2021-10-26 01:21:00 +02:00
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
t.Logf("actual rsPrivate: %v", actual)
|
|
|
|
t.Logf("expected rsPrivate: %v", expected)
|
2021-10-26 01:21:00 +02:00
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
if len(actual) != len(expected) {
|
|
|
|
t.Errorf("rsPrivate: wrong number of targets: got %d, want %d", len(actual), len(expected))
|
|
|
|
return
|
2021-10-26 01:21:00 +02:00
|
|
|
}
|
2022-01-10 22:50:57 +01:00
|
|
|
for i := 0; i < len(actual); i++ {
|
|
|
|
if actual[i] != expected[i] {
|
|
|
|
t.Errorf("rsPrivate: unexpected target at index %d: got %s, want %s", i, actual[i], expected[i])
|
|
|
|
}
|
2021-10-26 01:21:00 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestResolutionSet_AttachesToTarget(t *testing.T) {
|
|
|
|
lg := newLicenseGraph()
|
|
|
|
|
|
|
|
rsShare := toResolutionSet(lg, share)
|
|
|
|
|
2022-01-10 22:50:57 +01:00
|
|
|
t.Logf("checking resolution set %s", rsShare.String())
|
|
|
|
|
2021-10-26 01:21:00 +02:00
|
|
|
if rsShare.AttachesToTarget(newTestNode(lg, "binc")) {
|
2022-01-10 22:50:57 +01:00
|
|
|
t.Errorf("actual.AttachesToTarget(\"binc\"): got true, want false")
|
2021-10-26 01:21:00 +02:00
|
|
|
}
|
|
|
|
if !rsShare.AttachesToTarget(newTestNode(lg, "image")) {
|
2022-01-10 22:50:57 +01:00
|
|
|
t.Errorf("actual.AttachesToTarget(\"image\"): got false want true")
|
2021-10-26 01:21:00 +02:00
|
|
|
}
|
|
|
|
}
|