Defer edge creation. Don't create edges until the count is known to avoid repeated allocate+ copy operatios. Limit resolutions. Allow only a single resolution condition set per target, and overwrite intermediate results. Reduces memory and obviates allocations. Propagate fewer conditions. Instead of propagating notice conditions to parents in graph during initial resolve, leave them on leaf node, and attach to ancestors in the final walk. Reduces copies. Parallelize resolutions. Use goroutines, mutexes, and waitgroups to resolve branches of the graph in parallel. Makes better use of available cores. Don't accumulate resolutions inside non-containers. During the final resolution walk, only attach actions to ancestors from the root down until the 1st non-aggregate. Prevents an explosion of copies in the lower levels of the graph. Drop origin for scale. Tracking the origin of every potential origin for every restricted condition does not scale. By dropping origin, propagating from top to bottom can prune many redundant paths avoiding an exponential explosion. Conditions as bitmask. Use bit masks for license conditions and condition sets. Reduces maps and allocations. Bug: 68860345 Bug: 151177513 Bug: 151953481 Test: m all Test: m systemlicense Test: m listshare; out/soong/host/linux-x86/bin/listshare ... Test: m checkshare; out/soong/host/linux-x86/bin/checkshare ... Test: m dumpgraph; out/soong/host/linux-x86/dumpgraph ... Test: m dumpresolutions; out/soong/host/linux-x86/dumpresolutions ... where ... is the path to the .meta_lic file for the system image. In my case if $ export PRODUCT=$(realpath $ANDROID_PRODUCT_OUT --relative-to=$PWD) ... can be expressed as: ${PRODUCT}/gen/META/lic_intermediates/${PRODUCT}/system.img.meta_lic Change-Id: Ia2ec1b818de6122c239fbd0824754f1d65daffd3
120 lines
3.1 KiB
Go
120 lines
3.1 KiB
Go
// 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 main
|
|
|
|
import (
|
|
"compliance"
|
|
"flag"
|
|
"fmt"
|
|
"io"
|
|
"os"
|
|
"path/filepath"
|
|
"sort"
|
|
"strings"
|
|
)
|
|
|
|
func init() {
|
|
flag.Usage = func() {
|
|
fmt.Fprintf(os.Stderr, `Usage: %s file.meta_lic {file.meta_lic...}
|
|
|
|
Outputs a csv file with 1 project per line in the first field followed
|
|
by target:condition pairs describing why the project must be shared.
|
|
|
|
Each target is the path to a generated license metadata file for a
|
|
Soong module or Make target, and the license condition is either
|
|
restricted (e.g. GPL) or reciprocal (e.g. MPL).
|
|
`, filepath.Base(os.Args[0]))
|
|
}
|
|
}
|
|
|
|
var (
|
|
failNoneRequested = fmt.Errorf("\nNo license metadata files requested")
|
|
failNoLicenses = fmt.Errorf("No licenses found")
|
|
)
|
|
|
|
func main() {
|
|
flag.Parse()
|
|
|
|
// Must specify at least one root target.
|
|
if flag.NArg() == 0 {
|
|
flag.Usage()
|
|
os.Exit(2)
|
|
}
|
|
|
|
err := listShare(os.Stdout, os.Stderr, flag.Args()...)
|
|
if err != nil {
|
|
if err == failNoneRequested {
|
|
flag.Usage()
|
|
}
|
|
fmt.Fprintf(os.Stderr, "%s\n", err.Error())
|
|
os.Exit(1)
|
|
}
|
|
os.Exit(0)
|
|
}
|
|
|
|
// listShare implements the listshare utility.
|
|
func listShare(stdout, stderr io.Writer, files ...string) error {
|
|
// Must be at least one root file.
|
|
if len(files) < 1 {
|
|
return failNoneRequested
|
|
}
|
|
|
|
// Read the license graph from the license metadata files (*.meta_lic).
|
|
licenseGraph, err := compliance.ReadLicenseGraph(os.DirFS("."), stderr, files)
|
|
if err != nil {
|
|
return fmt.Errorf("Unable to read license metadata file(s) %q: %v\n", files, err)
|
|
}
|
|
if licenseGraph == nil {
|
|
return failNoLicenses
|
|
}
|
|
|
|
// shareSource contains all source-sharing resolutions.
|
|
shareSource := compliance.ResolveSourceSharing(licenseGraph)
|
|
|
|
// Group the resolutions by project.
|
|
presolution := make(map[string]compliance.LicenseConditionSet)
|
|
for _, target := range shareSource.AttachesTo() {
|
|
rl := shareSource.Resolutions(target)
|
|
sort.Sort(rl)
|
|
for _, r := range rl {
|
|
for _, p := range r.ActsOn().Projects() {
|
|
if _, ok := presolution[p]; !ok {
|
|
presolution[p] = r.Resolves()
|
|
continue
|
|
}
|
|
presolution[p] = presolution[p].Union(r.Resolves())
|
|
}
|
|
}
|
|
}
|
|
|
|
// Sort the projects for repeatability/stability.
|
|
projects := make([]string, 0, len(presolution))
|
|
for p := range presolution {
|
|
projects = append(projects, p)
|
|
}
|
|
sort.Strings(projects)
|
|
|
|
// Output the sorted projects and the source-sharing license conditions that each project resolves.
|
|
for _, p := range projects {
|
|
if presolution[p].IsEmpty() {
|
|
fmt.Fprintf(stdout, "%s\n", p)
|
|
} else {
|
|
fmt.Fprintf(stdout, "%s,%s\n", p, strings.Join(presolution[p].Names(), ","))
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|