2017-07-13 23:43:27 +02:00
|
|
|
// Copyright 2017 Google Inc. All rights reserved.
|
|
|
|
//
|
|
|
|
// 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 android
|
|
|
|
|
|
|
|
import (
|
2022-02-11 00:34:28 +01:00
|
|
|
"bytes"
|
2017-07-13 23:43:27 +02:00
|
|
|
"fmt"
|
2019-12-10 14:41:51 +01:00
|
|
|
"path/filepath"
|
2018-03-12 09:34:26 +01:00
|
|
|
"regexp"
|
2020-05-13 02:13:50 +02:00
|
|
|
"sort"
|
2017-07-13 23:43:27 +02:00
|
|
|
"strings"
|
2021-03-06 21:29:19 +01:00
|
|
|
"sync"
|
2018-03-12 09:29:17 +01:00
|
|
|
"testing"
|
2017-07-13 23:43:27 +02:00
|
|
|
|
2022-02-11 00:34:28 +01:00
|
|
|
mkparser "android/soong/androidmk/parser"
|
|
|
|
|
2017-07-13 23:43:27 +02:00
|
|
|
"github.com/google/blueprint"
|
2021-03-07 16:45:56 +01:00
|
|
|
"github.com/google/blueprint/proptools"
|
2017-07-13 23:43:27 +02:00
|
|
|
)
|
|
|
|
|
2020-10-30 01:09:13 +01:00
|
|
|
func NewTestContext(config Config) *TestContext {
|
2017-11-30 01:47:17 +01:00
|
|
|
namespaceExportFilter := func(namespace *Namespace) bool {
|
|
|
|
return true
|
|
|
|
}
|
2017-12-02 02:10:33 +01:00
|
|
|
|
|
|
|
nameResolver := NewNameResolver(namespaceExportFilter)
|
|
|
|
ctx := &TestContext{
|
2020-10-30 01:09:13 +01:00
|
|
|
Context: &Context{blueprint.NewContext(), config},
|
2017-12-02 02:10:33 +01:00
|
|
|
NameResolver: nameResolver,
|
|
|
|
}
|
|
|
|
|
|
|
|
ctx.SetNameInterface(nameResolver)
|
2017-11-30 01:47:17 +01:00
|
|
|
|
2019-03-05 07:33:56 +01:00
|
|
|
ctx.postDeps = append(ctx.postDeps, registerPathDepsMutator)
|
|
|
|
|
2020-10-30 01:09:13 +01:00
|
|
|
ctx.SetFs(ctx.config.fs)
|
|
|
|
if ctx.config.mockBpList != "" {
|
|
|
|
ctx.SetModuleListFile(ctx.config.mockBpList)
|
|
|
|
}
|
|
|
|
|
2017-11-30 01:47:17 +01:00
|
|
|
return ctx
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
|
2021-02-28 02:38:51 +01:00
|
|
|
var PrepareForTestWithArchMutator = GroupFixturePreparers(
|
2021-02-24 02:49:52 +01:00
|
|
|
// Configure architecture targets in the fixture config.
|
|
|
|
FixtureModifyConfig(modifyTestConfigToSupportArchMutator),
|
|
|
|
|
|
|
|
// Add the arch mutator to the context.
|
|
|
|
FixtureRegisterWithContext(func(ctx RegistrationContext) {
|
|
|
|
ctx.PreDepsMutators(registerArchMutator)
|
|
|
|
}),
|
|
|
|
)
|
|
|
|
|
|
|
|
var PrepareForTestWithDefaults = FixtureRegisterWithContext(func(ctx RegistrationContext) {
|
|
|
|
ctx.PreArchMutators(RegisterDefaultsPreArchMutators)
|
|
|
|
})
|
|
|
|
|
|
|
|
var PrepareForTestWithComponentsMutator = FixtureRegisterWithContext(func(ctx RegistrationContext) {
|
|
|
|
ctx.PreArchMutators(RegisterComponentsMutator)
|
|
|
|
})
|
|
|
|
|
|
|
|
var PrepareForTestWithPrebuilts = FixtureRegisterWithContext(RegisterPrebuiltMutators)
|
|
|
|
|
|
|
|
var PrepareForTestWithOverrides = FixtureRegisterWithContext(func(ctx RegistrationContext) {
|
|
|
|
ctx.PostDepsMutators(RegisterOverridePostDepsMutators)
|
|
|
|
})
|
|
|
|
|
2021-05-06 17:39:27 +02:00
|
|
|
var PrepareForTestWithLicenses = GroupFixturePreparers(
|
|
|
|
FixtureRegisterWithContext(RegisterLicenseKindBuildComponents),
|
|
|
|
FixtureRegisterWithContext(RegisterLicenseBuildComponents),
|
|
|
|
FixtureRegisterWithContext(registerLicenseMutators),
|
|
|
|
)
|
|
|
|
|
2022-05-21 01:41:39 +02:00
|
|
|
var PrepareForTestWithGenNotice = FixtureRegisterWithContext(RegisterGenNoticeBuildComponents)
|
|
|
|
|
2021-05-06 17:39:27 +02:00
|
|
|
func registerLicenseMutators(ctx RegistrationContext) {
|
|
|
|
ctx.PreArchMutators(RegisterLicensesPackageMapper)
|
|
|
|
ctx.PreArchMutators(RegisterLicensesPropertyGatherer)
|
|
|
|
ctx.PostDepsMutators(RegisterLicensesDependencyChecker)
|
|
|
|
}
|
|
|
|
|
|
|
|
var PrepareForTestWithLicenseDefaultModules = GroupFixturePreparers(
|
|
|
|
FixtureAddTextFile("build/soong/licenses/Android.bp", `
|
|
|
|
license {
|
|
|
|
name: "Android-Apache-2.0",
|
|
|
|
package_name: "Android",
|
|
|
|
license_kinds: ["SPDX-license-identifier-Apache-2.0"],
|
|
|
|
copyright_notice: "Copyright (C) The Android Open Source Project",
|
|
|
|
license_text: ["LICENSE"],
|
|
|
|
}
|
|
|
|
|
|
|
|
license_kind {
|
|
|
|
name: "SPDX-license-identifier-Apache-2.0",
|
|
|
|
conditions: ["notice"],
|
|
|
|
url: "https://spdx.org/licenses/Apache-2.0.html",
|
|
|
|
}
|
|
|
|
|
|
|
|
license_kind {
|
|
|
|
name: "legacy_unencumbered",
|
|
|
|
conditions: ["unencumbered"],
|
|
|
|
}
|
|
|
|
`),
|
|
|
|
FixtureAddFile("build/soong/licenses/LICENSE", nil),
|
|
|
|
)
|
|
|
|
|
2021-07-09 17:47:38 +02:00
|
|
|
var PrepareForTestWithNamespace = FixtureRegisterWithContext(func(ctx RegistrationContext) {
|
|
|
|
registerNamespaceBuildComponents(ctx)
|
|
|
|
ctx.PreArchMutators(RegisterNamespaceMutator)
|
|
|
|
})
|
|
|
|
|
2022-02-11 00:34:28 +01:00
|
|
|
var PrepareForTestWithMakevars = FixtureRegisterWithContext(func(ctx RegistrationContext) {
|
|
|
|
ctx.RegisterSingletonType("makevars", makeVarsSingletonFunc)
|
|
|
|
})
|
|
|
|
|
2021-03-09 02:01:31 +01:00
|
|
|
// Test fixture preparer that will register most java build components.
|
|
|
|
//
|
|
|
|
// Singletons and mutators should only be added here if they are needed for a majority of java
|
|
|
|
// module types, otherwise they should be added under a separate preparer to allow them to be
|
|
|
|
// selected only when needed to reduce test execution time.
|
|
|
|
//
|
|
|
|
// Module types do not have much of an overhead unless they are used so this should include as many
|
|
|
|
// module types as possible. The exceptions are those module types that require mutators and/or
|
|
|
|
// singletons in order to function in which case they should be kept together in a separate
|
|
|
|
// preparer.
|
|
|
|
//
|
|
|
|
// The mutators in this group were chosen because they are needed by the vast majority of tests.
|
|
|
|
var PrepareForTestWithAndroidBuildComponents = GroupFixturePreparers(
|
2021-03-07 14:20:38 +01:00
|
|
|
// Sorted alphabetically as the actual order does not matter as tests automatically enforce the
|
|
|
|
// correct order.
|
2021-02-24 02:49:52 +01:00
|
|
|
PrepareForTestWithArchMutator,
|
|
|
|
PrepareForTestWithComponentsMutator,
|
2021-03-07 14:20:38 +01:00
|
|
|
PrepareForTestWithDefaults,
|
2021-02-24 02:49:52 +01:00
|
|
|
PrepareForTestWithFilegroup,
|
2021-03-07 14:20:38 +01:00
|
|
|
PrepareForTestWithOverrides,
|
|
|
|
PrepareForTestWithPackageModule,
|
|
|
|
PrepareForTestWithPrebuilts,
|
|
|
|
PrepareForTestWithVisibility,
|
2021-02-24 02:49:52 +01:00
|
|
|
)
|
|
|
|
|
2021-03-09 02:01:31 +01:00
|
|
|
// Prepares an integration test with all build components from the android package.
|
|
|
|
//
|
|
|
|
// This should only be used by tests that want to run with as much of the build enabled as possible.
|
|
|
|
var PrepareForIntegrationTestWithAndroid = GroupFixturePreparers(
|
|
|
|
PrepareForTestWithAndroidBuildComponents,
|
|
|
|
)
|
|
|
|
|
2021-03-07 16:45:56 +01:00
|
|
|
// Prepares a test that may be missing dependencies by setting allow_missing_dependencies to
|
|
|
|
// true.
|
|
|
|
var PrepareForTestWithAllowMissingDependencies = GroupFixturePreparers(
|
|
|
|
FixtureModifyProductVariables(func(variables FixtureProductVariables) {
|
|
|
|
variables.Allow_missing_dependencies = proptools.BoolPtr(true)
|
|
|
|
}),
|
|
|
|
FixtureModifyContext(func(ctx *TestContext) {
|
|
|
|
ctx.SetAllowMissingDependencies(true)
|
|
|
|
}),
|
|
|
|
)
|
|
|
|
|
2021-03-20 15:19:46 +01:00
|
|
|
// Prepares a test that disallows non-existent paths.
|
|
|
|
var PrepareForTestDisallowNonExistentPaths = FixtureModifyConfig(func(config Config) {
|
|
|
|
config.TestAllowNonExistentPaths = false
|
|
|
|
})
|
|
|
|
|
2020-10-30 01:09:13 +01:00
|
|
|
func NewTestArchContext(config Config) *TestContext {
|
|
|
|
ctx := NewTestContext(config)
|
2017-09-16 02:33:55 +02:00
|
|
|
ctx.preDeps = append(ctx.preDeps, registerArchMutator)
|
|
|
|
return ctx
|
|
|
|
}
|
|
|
|
|
2017-07-13 23:43:27 +02:00
|
|
|
type TestContext struct {
|
2019-02-25 23:54:28 +01:00
|
|
|
*Context
|
2021-07-21 20:34:58 +02:00
|
|
|
preArch, preDeps, postDeps, finalDeps []RegisterMutatorFunc
|
|
|
|
bp2buildPreArch, bp2buildMutators []RegisterMutatorFunc
|
|
|
|
NameResolver *NameResolver
|
2021-03-06 21:29:19 +01:00
|
|
|
|
2021-03-07 13:24:44 +01:00
|
|
|
// The list of pre-singletons and singletons registered for the test.
|
|
|
|
preSingletons, singletons sortableComponents
|
|
|
|
|
2021-03-07 13:23:48 +01:00
|
|
|
// The order in which the pre-singletons, mutators and singletons will be run in this test
|
|
|
|
// context; for debugging.
|
|
|
|
preSingletonOrder, mutatorOrder, singletonOrder []string
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
func (ctx *TestContext) PreArchMutators(f RegisterMutatorFunc) {
|
|
|
|
ctx.preArch = append(ctx.preArch, f)
|
|
|
|
}
|
|
|
|
|
2020-01-14 13:09:36 +01:00
|
|
|
func (ctx *TestContext) HardCodedPreArchMutators(f RegisterMutatorFunc) {
|
|
|
|
// Register mutator function as normal for testing.
|
|
|
|
ctx.PreArchMutators(f)
|
|
|
|
}
|
|
|
|
|
2017-07-13 23:43:27 +02:00
|
|
|
func (ctx *TestContext) PreDepsMutators(f RegisterMutatorFunc) {
|
|
|
|
ctx.preDeps = append(ctx.preDeps, f)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ctx *TestContext) PostDepsMutators(f RegisterMutatorFunc) {
|
|
|
|
ctx.postDeps = append(ctx.postDeps, f)
|
|
|
|
}
|
|
|
|
|
2020-01-16 16:12:04 +01:00
|
|
|
func (ctx *TestContext) FinalDepsMutators(f RegisterMutatorFunc) {
|
|
|
|
ctx.finalDeps = append(ctx.finalDeps, f)
|
|
|
|
}
|
|
|
|
|
2022-08-24 00:29:05 +02:00
|
|
|
func (ctx *TestContext) RegisterBp2BuildConfig(config Bp2BuildConversionAllowlist) {
|
|
|
|
ctx.config.Bp2buildPackageConfig = config
|
2021-03-10 08:05:59 +01:00
|
|
|
}
|
|
|
|
|
2021-01-26 15:18:53 +01:00
|
|
|
// PreArchBp2BuildMutators adds mutators to be register for converting Android Blueprint modules
|
|
|
|
// into Bazel BUILD targets that should run prior to deps and conversion.
|
|
|
|
func (ctx *TestContext) PreArchBp2BuildMutators(f RegisterMutatorFunc) {
|
|
|
|
ctx.bp2buildPreArch = append(ctx.bp2buildPreArch, f)
|
|
|
|
}
|
|
|
|
|
2021-03-06 21:29:19 +01:00
|
|
|
// registeredComponentOrder defines the order in which a sortableComponent type is registered at
|
|
|
|
// runtime and provides support for reordering the components registered for a test in the same
|
|
|
|
// way.
|
|
|
|
type registeredComponentOrder struct {
|
|
|
|
// The name of the component type, used for error messages.
|
|
|
|
componentType string
|
|
|
|
|
|
|
|
// The names of the registered components in the order in which they were registered.
|
|
|
|
namesInOrder []string
|
|
|
|
|
|
|
|
// Maps from the component name to its position in the runtime ordering.
|
|
|
|
namesToIndex map[string]int
|
|
|
|
|
|
|
|
// A function that defines the order between two named components that can be used to sort a slice
|
|
|
|
// of component names into the same order as they appear in namesInOrder.
|
|
|
|
less func(string, string) bool
|
|
|
|
}
|
|
|
|
|
|
|
|
// registeredComponentOrderFromExistingOrder takes an existing slice of sortableComponents and
|
|
|
|
// creates a registeredComponentOrder that contains a less function that can be used to sort a
|
|
|
|
// subset of that list of names so it is in the same order as the original sortableComponents.
|
|
|
|
func registeredComponentOrderFromExistingOrder(componentType string, existingOrder sortableComponents) registeredComponentOrder {
|
|
|
|
// Only the names from the existing order are needed for this so create a list of component names
|
|
|
|
// in the correct order.
|
|
|
|
namesInOrder := componentsToNames(existingOrder)
|
|
|
|
|
|
|
|
// Populate the map from name to position in the list.
|
|
|
|
nameToIndex := make(map[string]int)
|
|
|
|
for i, n := range namesInOrder {
|
|
|
|
nameToIndex[n] = i
|
|
|
|
}
|
|
|
|
|
|
|
|
// A function to use to map from a name to an index in the original order.
|
|
|
|
indexOf := func(name string) int {
|
|
|
|
index, ok := nameToIndex[name]
|
|
|
|
if !ok {
|
|
|
|
// Should never happen as tests that use components that are not known at runtime do not sort
|
|
|
|
// so should never use this function.
|
|
|
|
panic(fmt.Errorf("internal error: unknown %s %q should be one of %s", componentType, name, strings.Join(namesInOrder, ", ")))
|
|
|
|
}
|
|
|
|
return index
|
|
|
|
}
|
|
|
|
|
|
|
|
// The less function.
|
|
|
|
less := func(n1, n2 string) bool {
|
|
|
|
i1 := indexOf(n1)
|
|
|
|
i2 := indexOf(n2)
|
|
|
|
return i1 < i2
|
|
|
|
}
|
|
|
|
|
|
|
|
return registeredComponentOrder{
|
|
|
|
componentType: componentType,
|
|
|
|
namesInOrder: namesInOrder,
|
|
|
|
namesToIndex: nameToIndex,
|
|
|
|
less: less,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// componentsToNames maps from the slice of components to a slice of their names.
|
|
|
|
func componentsToNames(components sortableComponents) []string {
|
|
|
|
names := make([]string, len(components))
|
|
|
|
for i, c := range components {
|
|
|
|
names[i] = c.componentName()
|
|
|
|
}
|
|
|
|
return names
|
|
|
|
}
|
|
|
|
|
|
|
|
// enforceOrdering enforces the supplied components are in the same order as is defined in this
|
|
|
|
// object.
|
|
|
|
//
|
|
|
|
// If the supplied components contains any components that are not registered at runtime, i.e. test
|
|
|
|
// specific components, then it is impossible to sort them into an order that both matches the
|
|
|
|
// runtime and also preserves the implicit ordering defined in the test. In that case it will not
|
|
|
|
// sort the components, instead it will just check that the components are in the correct order.
|
|
|
|
//
|
|
|
|
// Otherwise, this will sort the supplied components in place.
|
|
|
|
func (o *registeredComponentOrder) enforceOrdering(components sortableComponents) {
|
|
|
|
// Check to see if the list of components contains any components that are
|
|
|
|
// not registered at runtime.
|
|
|
|
var unknownComponents []string
|
|
|
|
testOrder := componentsToNames(components)
|
|
|
|
for _, name := range testOrder {
|
|
|
|
if _, ok := o.namesToIndex[name]; !ok {
|
|
|
|
unknownComponents = append(unknownComponents, name)
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the slice contains some unknown components then it is not possible to
|
|
|
|
// sort them into an order that matches the runtime while also preserving the
|
|
|
|
// order expected from the test, so in that case don't sort just check that
|
|
|
|
// the order of the known mutators does match.
|
|
|
|
if len(unknownComponents) > 0 {
|
|
|
|
// Check order.
|
|
|
|
o.checkTestOrder(testOrder, unknownComponents)
|
|
|
|
} else {
|
|
|
|
// Sort the components.
|
|
|
|
sort.Slice(components, func(i, j int) bool {
|
|
|
|
n1 := components[i].componentName()
|
|
|
|
n2 := components[j].componentName()
|
|
|
|
return o.less(n1, n2)
|
|
|
|
})
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// checkTestOrder checks that the supplied testOrder matches the one defined by this object,
|
|
|
|
// panicking if it does not.
|
|
|
|
func (o *registeredComponentOrder) checkTestOrder(testOrder []string, unknownComponents []string) {
|
|
|
|
lastMatchingTest := -1
|
|
|
|
matchCount := 0
|
|
|
|
// Take a copy of the runtime order as it is modified during the comparison.
|
|
|
|
runtimeOrder := append([]string(nil), o.namesInOrder...)
|
|
|
|
componentType := o.componentType
|
|
|
|
for i, j := 0, 0; i < len(testOrder) && j < len(runtimeOrder); {
|
|
|
|
test := testOrder[i]
|
|
|
|
runtime := runtimeOrder[j]
|
|
|
|
|
|
|
|
if test == runtime {
|
|
|
|
testOrder[i] = test + fmt.Sprintf(" <-- matched with runtime %s %d", componentType, j)
|
|
|
|
runtimeOrder[j] = runtime + fmt.Sprintf(" <-- matched with test %s %d", componentType, i)
|
|
|
|
lastMatchingTest = i
|
|
|
|
i += 1
|
|
|
|
j += 1
|
|
|
|
matchCount += 1
|
|
|
|
} else if _, ok := o.namesToIndex[test]; !ok {
|
|
|
|
// The test component is not registered globally so assume it is the correct place, treat it
|
|
|
|
// as having matched and skip it.
|
|
|
|
i += 1
|
|
|
|
matchCount += 1
|
|
|
|
} else {
|
|
|
|
// Assume that the test list is in the same order as the runtime list but the runtime list
|
|
|
|
// contains some components that are not present in the tests. So, skip the runtime component
|
|
|
|
// to try and find the next one that matches the current test component.
|
|
|
|
j += 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// If every item in the test order was either test specific or matched one in the runtime then
|
|
|
|
// it is in the correct order. Otherwise, it was not so fail.
|
|
|
|
if matchCount != len(testOrder) {
|
|
|
|
// The test component names were not all matched with a runtime component name so there must
|
|
|
|
// either be a component present in the test that is not present in the runtime or they must be
|
|
|
|
// in the wrong order.
|
|
|
|
testOrder[lastMatchingTest+1] = testOrder[lastMatchingTest+1] + " <--- unmatched"
|
|
|
|
panic(fmt.Errorf("the tests uses test specific components %q and so cannot be automatically sorted."+
|
|
|
|
" Unfortunately it uses %s components in the wrong order.\n"+
|
|
|
|
"test order:\n %s\n"+
|
|
|
|
"runtime order\n %s\n",
|
|
|
|
SortedUniqueStrings(unknownComponents),
|
|
|
|
componentType,
|
|
|
|
strings.Join(testOrder, "\n "),
|
|
|
|
strings.Join(runtimeOrder, "\n ")))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// registrationSorter encapsulates the information needed to ensure that the test mutators are
|
|
|
|
// registered, and thereby executed, in the same order as they are at runtime.
|
|
|
|
//
|
|
|
|
// It MUST be populated lazily AFTER all package initialization has been done otherwise it will
|
|
|
|
// only define the order for a subset of all the registered build components that are available for
|
|
|
|
// the packages being tested.
|
|
|
|
//
|
|
|
|
// e.g if this is initialized during say the cc package initialization then any tests run in the
|
|
|
|
// java package will not sort build components registered by the java package's init() functions.
|
|
|
|
type registrationSorter struct {
|
|
|
|
// Used to ensure that this is only created once.
|
|
|
|
once sync.Once
|
|
|
|
|
2021-03-07 13:23:48 +01:00
|
|
|
// The order of pre-singletons
|
|
|
|
preSingletonOrder registeredComponentOrder
|
|
|
|
|
2021-03-06 21:29:19 +01:00
|
|
|
// The order of mutators
|
|
|
|
mutatorOrder registeredComponentOrder
|
2021-03-07 13:23:48 +01:00
|
|
|
|
|
|
|
// The order of singletons
|
|
|
|
singletonOrder registeredComponentOrder
|
2021-03-06 21:29:19 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// populate initializes this structure from globally registered build components.
|
|
|
|
//
|
|
|
|
// Only the first call has any effect.
|
|
|
|
func (s *registrationSorter) populate() {
|
|
|
|
s.once.Do(func() {
|
2021-03-07 13:23:48 +01:00
|
|
|
// Create an ordering from the globally registered pre-singletons.
|
|
|
|
s.preSingletonOrder = registeredComponentOrderFromExistingOrder("pre-singleton", preSingletons)
|
|
|
|
|
2021-03-06 21:29:19 +01:00
|
|
|
// Created an ordering from the globally registered mutators.
|
|
|
|
globallyRegisteredMutators := collateGloballyRegisteredMutators()
|
|
|
|
s.mutatorOrder = registeredComponentOrderFromExistingOrder("mutator", globallyRegisteredMutators)
|
2021-03-07 13:23:48 +01:00
|
|
|
|
|
|
|
// Create an ordering from the globally registered singletons.
|
|
|
|
globallyRegisteredSingletons := collateGloballyRegisteredSingletons()
|
|
|
|
s.singletonOrder = registeredComponentOrderFromExistingOrder("singleton", globallyRegisteredSingletons)
|
2021-03-06 21:29:19 +01:00
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
// Provides support for enforcing the same order in which build components are registered globally
|
|
|
|
// to the order in which they are registered during tests.
|
|
|
|
//
|
|
|
|
// MUST only be accessed via the globallyRegisteredComponentsOrder func.
|
|
|
|
var globalRegistrationSorter registrationSorter
|
|
|
|
|
|
|
|
// globallyRegisteredComponentsOrder returns the globalRegistrationSorter after ensuring it is
|
|
|
|
// correctly populated.
|
|
|
|
func globallyRegisteredComponentsOrder() *registrationSorter {
|
|
|
|
globalRegistrationSorter.populate()
|
|
|
|
return &globalRegistrationSorter
|
|
|
|
}
|
|
|
|
|
2020-10-30 01:09:13 +01:00
|
|
|
func (ctx *TestContext) Register() {
|
2021-03-06 21:29:19 +01:00
|
|
|
globalOrder := globallyRegisteredComponentsOrder()
|
|
|
|
|
2021-03-07 13:23:48 +01:00
|
|
|
// Ensure that the pre-singletons used in the test are in the same order as they are used at
|
|
|
|
// runtime.
|
|
|
|
globalOrder.preSingletonOrder.enforceOrdering(ctx.preSingletons)
|
2021-03-07 13:24:44 +01:00
|
|
|
ctx.preSingletons.registerAll(ctx.Context)
|
|
|
|
|
2021-03-06 14:28:13 +01:00
|
|
|
mutators := collateRegisteredMutators(ctx.preArch, ctx.preDeps, ctx.postDeps, ctx.finalDeps)
|
2021-03-06 21:29:19 +01:00
|
|
|
// Ensure that the mutators used in the test are in the same order as they are used at runtime.
|
|
|
|
globalOrder.mutatorOrder.enforceOrdering(mutators)
|
2021-03-06 14:28:13 +01:00
|
|
|
mutators.registerAll(ctx.Context)
|
2017-07-13 23:43:27 +02:00
|
|
|
|
2021-03-07 13:23:48 +01:00
|
|
|
// Ensure that the singletons used in the test are in the same order as they are used at runtime.
|
|
|
|
globalOrder.singletonOrder.enforceOrdering(ctx.singletons)
|
2021-03-07 13:24:44 +01:00
|
|
|
ctx.singletons.registerAll(ctx.Context)
|
|
|
|
|
2021-03-07 13:23:48 +01:00
|
|
|
// Save the sorted components order away to make them easy to access while debugging.
|
2021-03-09 00:42:10 +01:00
|
|
|
ctx.preSingletonOrder = componentsToNames(preSingletons)
|
|
|
|
ctx.mutatorOrder = componentsToNames(mutators)
|
|
|
|
ctx.singletonOrder = componentsToNames(singletons)
|
2019-12-31 03:45:15 +01:00
|
|
|
}
|
|
|
|
|
2020-12-14 14:25:34 +01:00
|
|
|
// RegisterForBazelConversion prepares a test context for bp2build conversion.
|
|
|
|
func (ctx *TestContext) RegisterForBazelConversion() {
|
2022-08-20 20:48:32 +02:00
|
|
|
ctx.config.BuildMode = Bp2build
|
2021-11-01 20:32:43 +01:00
|
|
|
RegisterMutatorsForBazelConversion(ctx.Context, ctx.bp2buildPreArch)
|
2020-12-14 14:25:34 +01:00
|
|
|
}
|
|
|
|
|
2022-09-28 22:43:08 +02:00
|
|
|
// RegisterForApiBazelConversion prepares a test context for API bp2build conversion.
|
|
|
|
func (ctx *TestContext) RegisterForApiBazelConversion() {
|
|
|
|
ctx.config.BuildMode = ApiBp2build
|
|
|
|
RegisterMutatorsForApiBazelConversion(ctx.Context, ctx.bp2buildPreArch)
|
|
|
|
}
|
|
|
|
|
2019-12-31 03:45:15 +01:00
|
|
|
func (ctx *TestContext) ParseFileList(rootDir string, filePaths []string) (deps []string, errs []error) {
|
|
|
|
// This function adapts the old style ParseFileList calls that are spread throughout the tests
|
|
|
|
// to the new style that takes a config.
|
|
|
|
return ctx.Context.ParseFileList(rootDir, filePaths, ctx.config)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ctx *TestContext) ParseBlueprintsFiles(rootDir string) (deps []string, errs []error) {
|
|
|
|
// This function adapts the old style ParseBlueprintsFiles calls that are spread throughout the
|
|
|
|
// tests to the new style that takes a config.
|
|
|
|
return ctx.Context.ParseBlueprintsFiles(rootDir, ctx.config)
|
2019-11-23 00:25:03 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func (ctx *TestContext) RegisterModuleType(name string, factory ModuleFactory) {
|
|
|
|
ctx.Context.RegisterModuleType(name, ModuleFactoryAdaptor(factory))
|
|
|
|
}
|
|
|
|
|
2020-12-29 00:15:34 +01:00
|
|
|
func (ctx *TestContext) RegisterSingletonModuleType(name string, factory SingletonModuleFactory) {
|
|
|
|
s, m := SingletonModuleFactoryAdaptor(name, factory)
|
|
|
|
ctx.RegisterSingletonType(name, s)
|
|
|
|
ctx.RegisterModuleType(name, m)
|
|
|
|
}
|
|
|
|
|
2019-11-23 00:25:03 +01:00
|
|
|
func (ctx *TestContext) RegisterSingletonType(name string, factory SingletonFactory) {
|
2021-03-07 13:24:44 +01:00
|
|
|
ctx.singletons = append(ctx.singletons, newSingleton(name, factory))
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
|
2021-02-24 02:43:18 +01:00
|
|
|
func (ctx *TestContext) RegisterPreSingletonType(name string, factory SingletonFactory) {
|
2021-03-07 13:24:44 +01:00
|
|
|
ctx.preSingletons = append(ctx.preSingletons, newPreSingleton(name, factory))
|
2021-02-24 02:43:18 +01:00
|
|
|
}
|
|
|
|
|
2021-09-10 23:39:59 +02:00
|
|
|
// ModuleVariantForTests selects a specific variant of the module with the given
|
|
|
|
// name by matching the variations map against the variations of each module
|
|
|
|
// variant. A module variant matches the map if every variation that exists in
|
|
|
|
// both have the same value. Both the module and the map are allowed to have
|
|
|
|
// extra variations that the other doesn't have. Panics if not exactly one
|
|
|
|
// module variant matches.
|
|
|
|
func (ctx *TestContext) ModuleVariantForTests(name string, matchVariations map[string]string) TestingModule {
|
|
|
|
modules := []Module{}
|
|
|
|
ctx.VisitAllModules(func(m blueprint.Module) {
|
|
|
|
if ctx.ModuleName(m) == name {
|
|
|
|
am := m.(Module)
|
|
|
|
amMut := am.base().commonProperties.DebugMutators
|
|
|
|
amVar := am.base().commonProperties.DebugVariations
|
|
|
|
matched := true
|
|
|
|
for i, mut := range amMut {
|
|
|
|
if wantedVar, found := matchVariations[mut]; found && amVar[i] != wantedVar {
|
|
|
|
matched = false
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if matched {
|
|
|
|
modules = append(modules, am)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
})
|
|
|
|
|
|
|
|
if len(modules) == 0 {
|
|
|
|
// Show all the modules or module variants that do exist.
|
|
|
|
var allModuleNames []string
|
|
|
|
var allVariants []string
|
|
|
|
ctx.VisitAllModules(func(m blueprint.Module) {
|
|
|
|
allModuleNames = append(allModuleNames, ctx.ModuleName(m))
|
|
|
|
if ctx.ModuleName(m) == name {
|
|
|
|
allVariants = append(allVariants, m.(Module).String())
|
|
|
|
}
|
|
|
|
})
|
|
|
|
|
|
|
|
if len(allVariants) == 0 {
|
|
|
|
panic(fmt.Errorf("failed to find module %q. All modules:\n %s",
|
|
|
|
name, strings.Join(SortedUniqueStrings(allModuleNames), "\n ")))
|
|
|
|
} else {
|
|
|
|
sort.Strings(allVariants)
|
|
|
|
panic(fmt.Errorf("failed to find module %q matching %v. All variants:\n %s",
|
|
|
|
name, matchVariations, strings.Join(allVariants, "\n ")))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(modules) > 1 {
|
|
|
|
moduleStrings := []string{}
|
|
|
|
for _, m := range modules {
|
|
|
|
moduleStrings = append(moduleStrings, m.String())
|
|
|
|
}
|
|
|
|
sort.Strings(moduleStrings)
|
|
|
|
panic(fmt.Errorf("module %q has more than one variant that match %v:\n %s",
|
|
|
|
name, matchVariations, strings.Join(moduleStrings, "\n ")))
|
|
|
|
}
|
|
|
|
|
|
|
|
return newTestingModule(ctx.config, modules[0])
|
|
|
|
}
|
|
|
|
|
2017-07-13 23:43:27 +02:00
|
|
|
func (ctx *TestContext) ModuleForTests(name, variant string) TestingModule {
|
|
|
|
var module Module
|
|
|
|
ctx.VisitAllModules(func(m blueprint.Module) {
|
|
|
|
if ctx.ModuleName(m) == name && ctx.ModuleSubDir(m) == variant {
|
|
|
|
module = m.(Module)
|
|
|
|
}
|
|
|
|
})
|
|
|
|
|
|
|
|
if module == nil {
|
2017-09-28 02:05:30 +02:00
|
|
|
// find all the modules that do exist
|
2020-08-11 21:02:11 +02:00
|
|
|
var allModuleNames []string
|
|
|
|
var allVariants []string
|
2017-09-28 02:05:30 +02:00
|
|
|
ctx.VisitAllModules(func(m blueprint.Module) {
|
2020-08-11 21:02:11 +02:00
|
|
|
allModuleNames = append(allModuleNames, ctx.ModuleName(m))
|
|
|
|
if ctx.ModuleName(m) == name {
|
|
|
|
allVariants = append(allVariants, ctx.ModuleSubDir(m))
|
|
|
|
}
|
2017-09-28 02:05:30 +02:00
|
|
|
})
|
2020-08-11 21:02:11 +02:00
|
|
|
sort.Strings(allVariants)
|
|
|
|
|
|
|
|
if len(allVariants) == 0 {
|
|
|
|
panic(fmt.Errorf("failed to find module %q. All modules:\n %s",
|
2021-09-09 22:34:02 +02:00
|
|
|
name, strings.Join(SortedUniqueStrings(allModuleNames), "\n ")))
|
2020-08-11 21:02:11 +02:00
|
|
|
} else {
|
|
|
|
panic(fmt.Errorf("failed to find module %q variant %q. All variants:\n %s",
|
|
|
|
name, variant, strings.Join(allVariants, "\n ")))
|
|
|
|
}
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
|
2021-03-22 11:09:02 +01:00
|
|
|
return newTestingModule(ctx.config, module)
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
|
2018-07-11 03:49:27 +02:00
|
|
|
func (ctx *TestContext) ModuleVariantsForTests(name string) []string {
|
|
|
|
var variants []string
|
|
|
|
ctx.VisitAllModules(func(m blueprint.Module) {
|
|
|
|
if ctx.ModuleName(m) == name {
|
|
|
|
variants = append(variants, ctx.ModuleSubDir(m))
|
|
|
|
}
|
|
|
|
})
|
|
|
|
return variants
|
|
|
|
}
|
|
|
|
|
2019-02-25 23:54:28 +01:00
|
|
|
// SingletonForTests returns a TestingSingleton for the singleton registered with the given name.
|
|
|
|
func (ctx *TestContext) SingletonForTests(name string) TestingSingleton {
|
|
|
|
allSingletonNames := []string{}
|
|
|
|
for _, s := range ctx.Singletons() {
|
|
|
|
n := ctx.SingletonName(s)
|
|
|
|
if n == name {
|
|
|
|
return TestingSingleton{
|
2021-03-22 11:09:02 +01:00
|
|
|
baseTestingComponent: newBaseTestingComponent(ctx.config, s.(testBuildProvider)),
|
2021-03-22 10:29:00 +01:00
|
|
|
singleton: s.(*singletonAdaptor).Singleton,
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
allSingletonNames = append(allSingletonNames, n)
|
|
|
|
}
|
|
|
|
|
|
|
|
panic(fmt.Errorf("failed to find singleton %q."+
|
|
|
|
"\nall singletons: %v", name, allSingletonNames))
|
|
|
|
}
|
|
|
|
|
2022-02-11 00:34:28 +01:00
|
|
|
type InstallMakeRule struct {
|
|
|
|
Target string
|
|
|
|
Deps []string
|
|
|
|
OrderOnlyDeps []string
|
|
|
|
}
|
|
|
|
|
|
|
|
func parseMkRules(t *testing.T, config Config, nodes []mkparser.Node) []InstallMakeRule {
|
|
|
|
var rules []InstallMakeRule
|
|
|
|
for _, node := range nodes {
|
|
|
|
if mkParserRule, ok := node.(*mkparser.Rule); ok {
|
|
|
|
var rule InstallMakeRule
|
|
|
|
|
|
|
|
if targets := mkParserRule.Target.Words(); len(targets) == 0 {
|
|
|
|
t.Fatalf("no targets for rule %s", mkParserRule.Dump())
|
|
|
|
} else if len(targets) > 1 {
|
|
|
|
t.Fatalf("unsupported multiple targets for rule %s", mkParserRule.Dump())
|
|
|
|
} else if !targets[0].Const() {
|
|
|
|
t.Fatalf("unsupported non-const target for rule %s", mkParserRule.Dump())
|
|
|
|
} else {
|
|
|
|
rule.Target = normalizeStringRelativeToTop(config, targets[0].Value(nil))
|
|
|
|
}
|
|
|
|
|
|
|
|
prereqList := &rule.Deps
|
|
|
|
for _, prereq := range mkParserRule.Prerequisites.Words() {
|
|
|
|
if !prereq.Const() {
|
|
|
|
t.Fatalf("unsupported non-const prerequisite for rule %s", mkParserRule.Dump())
|
|
|
|
}
|
|
|
|
|
|
|
|
if prereq.Value(nil) == "|" {
|
|
|
|
prereqList = &rule.OrderOnlyDeps
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
|
|
|
*prereqList = append(*prereqList, normalizeStringRelativeToTop(config, prereq.Value(nil)))
|
|
|
|
}
|
|
|
|
|
|
|
|
rules = append(rules, rule)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return rules
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ctx *TestContext) InstallMakeRulesForTesting(t *testing.T) []InstallMakeRule {
|
|
|
|
installs := ctx.SingletonForTests("makevars").Singleton().(*makeVarsSingleton).installsForTesting
|
|
|
|
buf := bytes.NewBuffer(append([]byte(nil), installs...))
|
|
|
|
parser := mkparser.NewParser("makevars", buf)
|
|
|
|
|
|
|
|
nodes, errs := parser.Parse()
|
|
|
|
if len(errs) > 0 {
|
|
|
|
t.Fatalf("error parsing install rules: %s", errs[0])
|
|
|
|
}
|
|
|
|
|
|
|
|
return parseMkRules(t, ctx.config, nodes)
|
|
|
|
}
|
|
|
|
|
2022-10-04 20:03:31 +02:00
|
|
|
// MakeVarVariable provides access to make vars that will be written by the makeVarsSingleton
|
|
|
|
type MakeVarVariable interface {
|
|
|
|
// Name is the name of the variable.
|
|
|
|
Name() string
|
|
|
|
|
|
|
|
// Value is the value of the variable.
|
|
|
|
Value() string
|
|
|
|
}
|
|
|
|
|
|
|
|
func (v makeVarsVariable) Name() string {
|
|
|
|
return v.name
|
|
|
|
}
|
|
|
|
|
|
|
|
func (v makeVarsVariable) Value() string {
|
|
|
|
return v.value
|
|
|
|
}
|
|
|
|
|
|
|
|
// PrepareForTestAccessingMakeVars sets up the test so that MakeVarsForTesting will work.
|
|
|
|
var PrepareForTestAccessingMakeVars = GroupFixturePreparers(
|
|
|
|
PrepareForTestWithAndroidMk,
|
|
|
|
PrepareForTestWithMakevars,
|
|
|
|
)
|
|
|
|
|
|
|
|
// MakeVarsForTesting returns a filtered list of MakeVarVariable objects that represent the
|
|
|
|
// variables that will be written out.
|
|
|
|
//
|
|
|
|
// It is necessary to use PrepareForTestAccessingMakeVars in tests that want to call this function.
|
|
|
|
// Along with any other preparers needed to add the make vars.
|
|
|
|
func (ctx *TestContext) MakeVarsForTesting(filter func(variable MakeVarVariable) bool) []MakeVarVariable {
|
|
|
|
vars := ctx.SingletonForTests("makevars").Singleton().(*makeVarsSingleton).varsForTesting
|
|
|
|
result := make([]MakeVarVariable, 0, len(vars))
|
|
|
|
for _, v := range vars {
|
|
|
|
if filter(v) {
|
|
|
|
result = append(result, v)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return result
|
|
|
|
}
|
|
|
|
|
2020-07-03 22:18:24 +02:00
|
|
|
func (ctx *TestContext) Config() Config {
|
|
|
|
return ctx.config
|
|
|
|
}
|
|
|
|
|
2019-02-25 23:54:28 +01:00
|
|
|
type testBuildProvider interface {
|
|
|
|
BuildParamsForTests() []BuildParams
|
|
|
|
RuleParamsForTests() map[blueprint.Rule]blueprint.RuleParams
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
|
2019-02-25 23:54:28 +01:00
|
|
|
type TestingBuildParams struct {
|
|
|
|
BuildParams
|
|
|
|
RuleParams blueprint.RuleParams
|
2021-03-22 11:09:02 +01:00
|
|
|
|
|
|
|
config Config
|
|
|
|
}
|
|
|
|
|
|
|
|
// RelativeToTop creates a new instance of this which has had any usages of the current test's
|
|
|
|
// temporary and test specific build directory replaced with a path relative to the notional top.
|
|
|
|
//
|
|
|
|
// The parts of this structure which are changed are:
|
|
|
|
// * BuildParams
|
2022-08-16 19:27:33 +02:00
|
|
|
// - Args
|
|
|
|
// - All Path, Paths, WritablePath and WritablePaths fields.
|
2021-03-22 11:09:02 +01:00
|
|
|
//
|
|
|
|
// * RuleParams
|
2022-08-16 19:27:33 +02:00
|
|
|
// - Command
|
|
|
|
// - Depfile
|
|
|
|
// - Rspfile
|
|
|
|
// - RspfileContent
|
|
|
|
// - SymlinkOutputs
|
|
|
|
// - CommandDeps
|
|
|
|
// - CommandOrderOnly
|
2021-03-22 11:09:02 +01:00
|
|
|
//
|
|
|
|
// See PathRelativeToTop for more details.
|
2021-03-29 01:42:57 +02:00
|
|
|
//
|
|
|
|
// deprecated: this is no longer needed as TestingBuildParams are created in this form.
|
2021-03-22 11:09:02 +01:00
|
|
|
func (p TestingBuildParams) RelativeToTop() TestingBuildParams {
|
|
|
|
// If this is not a valid params then just return it back. That will make it easy to use with the
|
|
|
|
// Maybe...() methods.
|
|
|
|
if p.Rule == nil {
|
|
|
|
return p
|
|
|
|
}
|
|
|
|
if p.config.config == nil {
|
2021-03-24 11:40:38 +01:00
|
|
|
return p
|
2021-03-22 11:09:02 +01:00
|
|
|
}
|
|
|
|
// Take a copy of the build params and replace any args that contains test specific temporary
|
|
|
|
// paths with paths relative to the top.
|
|
|
|
bparams := p.BuildParams
|
2021-03-24 11:34:52 +01:00
|
|
|
bparams.Depfile = normalizeWritablePathRelativeToTop(bparams.Depfile)
|
|
|
|
bparams.Output = normalizeWritablePathRelativeToTop(bparams.Output)
|
|
|
|
bparams.Outputs = bparams.Outputs.RelativeToTop()
|
|
|
|
bparams.SymlinkOutput = normalizeWritablePathRelativeToTop(bparams.SymlinkOutput)
|
|
|
|
bparams.SymlinkOutputs = bparams.SymlinkOutputs.RelativeToTop()
|
|
|
|
bparams.ImplicitOutput = normalizeWritablePathRelativeToTop(bparams.ImplicitOutput)
|
|
|
|
bparams.ImplicitOutputs = bparams.ImplicitOutputs.RelativeToTop()
|
|
|
|
bparams.Input = normalizePathRelativeToTop(bparams.Input)
|
|
|
|
bparams.Inputs = bparams.Inputs.RelativeToTop()
|
|
|
|
bparams.Implicit = normalizePathRelativeToTop(bparams.Implicit)
|
|
|
|
bparams.Implicits = bparams.Implicits.RelativeToTop()
|
|
|
|
bparams.OrderOnly = bparams.OrderOnly.RelativeToTop()
|
|
|
|
bparams.Validation = normalizePathRelativeToTop(bparams.Validation)
|
|
|
|
bparams.Validations = bparams.Validations.RelativeToTop()
|
2021-03-22 11:09:02 +01:00
|
|
|
bparams.Args = normalizeStringMapRelativeToTop(p.config, bparams.Args)
|
|
|
|
|
|
|
|
// Ditto for any fields in the RuleParams.
|
|
|
|
rparams := p.RuleParams
|
|
|
|
rparams.Command = normalizeStringRelativeToTop(p.config, rparams.Command)
|
|
|
|
rparams.Depfile = normalizeStringRelativeToTop(p.config, rparams.Depfile)
|
|
|
|
rparams.Rspfile = normalizeStringRelativeToTop(p.config, rparams.Rspfile)
|
|
|
|
rparams.RspfileContent = normalizeStringRelativeToTop(p.config, rparams.RspfileContent)
|
|
|
|
rparams.SymlinkOutputs = normalizeStringArrayRelativeToTop(p.config, rparams.SymlinkOutputs)
|
|
|
|
rparams.CommandDeps = normalizeStringArrayRelativeToTop(p.config, rparams.CommandDeps)
|
|
|
|
rparams.CommandOrderOnly = normalizeStringArrayRelativeToTop(p.config, rparams.CommandOrderOnly)
|
|
|
|
|
|
|
|
return TestingBuildParams{
|
|
|
|
BuildParams: bparams,
|
|
|
|
RuleParams: rparams,
|
|
|
|
}
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
|
2021-03-24 11:34:52 +01:00
|
|
|
func normalizeWritablePathRelativeToTop(path WritablePath) WritablePath {
|
|
|
|
if path == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
return path.RelativeToTop().(WritablePath)
|
|
|
|
}
|
|
|
|
|
|
|
|
func normalizePathRelativeToTop(path Path) Path {
|
|
|
|
if path == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
return path.RelativeToTop()
|
|
|
|
}
|
|
|
|
|
2021-03-22 10:34:29 +01:00
|
|
|
// baseTestingComponent provides functionality common to both TestingModule and TestingSingleton.
|
|
|
|
type baseTestingComponent struct {
|
2021-03-22 11:09:02 +01:00
|
|
|
config Config
|
2021-03-22 10:34:29 +01:00
|
|
|
provider testBuildProvider
|
|
|
|
}
|
|
|
|
|
2021-03-22 11:09:02 +01:00
|
|
|
func newBaseTestingComponent(config Config, provider testBuildProvider) baseTestingComponent {
|
|
|
|
return baseTestingComponent{config, provider}
|
|
|
|
}
|
|
|
|
|
|
|
|
// A function that will normalize a string containing paths, e.g. ninja command, by replacing
|
|
|
|
// any references to the test specific temporary build directory that changes with each run to a
|
|
|
|
// fixed path relative to a notional top directory.
|
|
|
|
//
|
|
|
|
// This is similar to StringPathRelativeToTop except that assumes the string is a single path
|
|
|
|
// containing at most one instance of the temporary build directory at the start of the path while
|
|
|
|
// this assumes that there can be any number at any position.
|
|
|
|
func normalizeStringRelativeToTop(config Config, s string) string {
|
2021-08-26 15:07:24 +02:00
|
|
|
// The soongOutDir usually looks something like: /tmp/testFoo2345/001
|
2021-03-22 11:09:02 +01:00
|
|
|
//
|
2021-08-26 15:07:24 +02:00
|
|
|
// Replace any usage of the soongOutDir with out/soong, e.g. replace "/tmp/testFoo2345/001" with
|
2021-03-22 11:09:02 +01:00
|
|
|
// "out/soong".
|
2021-08-26 15:07:24 +02:00
|
|
|
outSoongDir := filepath.Clean(config.soongOutDir)
|
2021-03-22 11:09:02 +01:00
|
|
|
re := regexp.MustCompile(`\Q` + outSoongDir + `\E\b`)
|
|
|
|
s = re.ReplaceAllString(s, "out/soong")
|
|
|
|
|
2021-08-26 15:07:24 +02:00
|
|
|
// Replace any usage of the soongOutDir/.. with out, e.g. replace "/tmp/testFoo2345" with
|
2021-03-22 11:09:02 +01:00
|
|
|
// "out". This must come after the previous replacement otherwise this would replace
|
|
|
|
// "/tmp/testFoo2345/001" with "out/001" instead of "out/soong".
|
|
|
|
outDir := filepath.Dir(outSoongDir)
|
|
|
|
re = regexp.MustCompile(`\Q` + outDir + `\E\b`)
|
|
|
|
s = re.ReplaceAllString(s, "out")
|
|
|
|
|
|
|
|
return s
|
|
|
|
}
|
|
|
|
|
|
|
|
// normalizeStringArrayRelativeToTop creates a new slice constructed by applying
|
|
|
|
// normalizeStringRelativeToTop to each item in the slice.
|
|
|
|
func normalizeStringArrayRelativeToTop(config Config, slice []string) []string {
|
|
|
|
newSlice := make([]string, len(slice))
|
|
|
|
for i, s := range slice {
|
|
|
|
newSlice[i] = normalizeStringRelativeToTop(config, s)
|
|
|
|
}
|
|
|
|
return newSlice
|
|
|
|
}
|
|
|
|
|
|
|
|
// normalizeStringMapRelativeToTop creates a new map constructed by applying
|
|
|
|
// normalizeStringRelativeToTop to each value in the map.
|
|
|
|
func normalizeStringMapRelativeToTop(config Config, m map[string]string) map[string]string {
|
|
|
|
newMap := map[string]string{}
|
|
|
|
for k, v := range m {
|
|
|
|
newMap[k] = normalizeStringRelativeToTop(config, v)
|
|
|
|
}
|
|
|
|
return newMap
|
2021-03-22 10:34:29 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func (b baseTestingComponent) newTestingBuildParams(bparams BuildParams) TestingBuildParams {
|
2019-02-25 23:54:28 +01:00
|
|
|
return TestingBuildParams{
|
2021-03-22 11:09:02 +01:00
|
|
|
config: b.config,
|
2019-02-25 23:54:28 +01:00
|
|
|
BuildParams: bparams,
|
2021-03-22 10:34:29 +01:00
|
|
|
RuleParams: b.provider.RuleParamsForTests()[bparams.Rule],
|
2021-03-24 11:40:38 +01:00
|
|
|
}.RelativeToTop()
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
2021-03-22 10:34:29 +01:00
|
|
|
func (b baseTestingComponent) maybeBuildParamsFromRule(rule string) (TestingBuildParams, []string) {
|
2020-08-27 15:50:24 +02:00
|
|
|
var searchedRules []string
|
2021-06-08 11:06:37 +02:00
|
|
|
buildParams := b.provider.BuildParamsForTests()
|
|
|
|
for _, p := range buildParams {
|
|
|
|
ruleAsString := p.Rule.String()
|
|
|
|
searchedRules = append(searchedRules, ruleAsString)
|
|
|
|
if strings.Contains(ruleAsString, rule) {
|
2021-03-22 10:34:29 +01:00
|
|
|
return b.newTestingBuildParams(p), searchedRules
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
}
|
2020-08-27 15:50:24 +02:00
|
|
|
return TestingBuildParams{}, searchedRules
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
|
2021-03-22 10:34:29 +01:00
|
|
|
func (b baseTestingComponent) buildParamsFromRule(rule string) TestingBuildParams {
|
|
|
|
p, searchRules := b.maybeBuildParamsFromRule(rule)
|
2019-01-06 07:09:19 +01:00
|
|
|
if p.Rule == nil {
|
2021-06-08 11:06:37 +02:00
|
|
|
panic(fmt.Errorf("couldn't find rule %q.\nall rules:\n%s", rule, strings.Join(searchRules, "\n")))
|
2019-01-06 07:09:19 +01:00
|
|
|
}
|
|
|
|
return p
|
|
|
|
}
|
|
|
|
|
2022-02-03 01:20:11 +01:00
|
|
|
func (b baseTestingComponent) maybeBuildParamsFromDescription(desc string) (TestingBuildParams, []string) {
|
|
|
|
var searchedDescriptions []string
|
2021-03-22 10:34:29 +01:00
|
|
|
for _, p := range b.provider.BuildParamsForTests() {
|
2022-02-03 01:20:11 +01:00
|
|
|
searchedDescriptions = append(searchedDescriptions, p.Description)
|
2019-06-11 00:15:17 +02:00
|
|
|
if strings.Contains(p.Description, desc) {
|
2022-02-03 01:20:11 +01:00
|
|
|
return b.newTestingBuildParams(p), searchedDescriptions
|
2017-10-19 22:06:22 +02:00
|
|
|
}
|
|
|
|
}
|
2022-02-03 01:20:11 +01:00
|
|
|
return TestingBuildParams{}, searchedDescriptions
|
2017-10-19 22:06:22 +02:00
|
|
|
}
|
|
|
|
|
2021-03-22 10:34:29 +01:00
|
|
|
func (b baseTestingComponent) buildParamsFromDescription(desc string) TestingBuildParams {
|
2022-02-03 01:20:11 +01:00
|
|
|
p, searchedDescriptions := b.maybeBuildParamsFromDescription(desc)
|
2019-01-06 07:09:19 +01:00
|
|
|
if p.Rule == nil {
|
2022-02-03 01:20:11 +01:00
|
|
|
panic(fmt.Errorf("couldn't find description %q\nall descriptions:\n%s", desc, strings.Join(searchedDescriptions, "\n")))
|
2019-01-06 07:09:19 +01:00
|
|
|
}
|
|
|
|
return p
|
|
|
|
}
|
|
|
|
|
2021-03-22 10:34:29 +01:00
|
|
|
func (b baseTestingComponent) maybeBuildParamsFromOutput(file string) (TestingBuildParams, []string) {
|
2021-09-17 03:51:48 +02:00
|
|
|
searchedOutputs := WritablePaths(nil)
|
2021-03-22 10:34:29 +01:00
|
|
|
for _, p := range b.provider.BuildParamsForTests() {
|
2017-07-13 23:43:27 +02:00
|
|
|
outputs := append(WritablePaths(nil), p.Outputs...)
|
2019-03-29 23:33:06 +01:00
|
|
|
outputs = append(outputs, p.ImplicitOutputs...)
|
2017-07-13 23:43:27 +02:00
|
|
|
if p.Output != nil {
|
|
|
|
outputs = append(outputs, p.Output)
|
|
|
|
}
|
|
|
|
for _, f := range outputs {
|
2021-03-22 12:34:57 +01:00
|
|
|
if f.String() == file || f.Rel() == file || PathRelativeToTop(f) == file {
|
2021-03-22 10:34:29 +01:00
|
|
|
return b.newTestingBuildParams(p), nil
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
2021-09-17 03:51:48 +02:00
|
|
|
searchedOutputs = append(searchedOutputs, f)
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
|
|
|
}
|
2021-09-17 03:51:48 +02:00
|
|
|
|
|
|
|
formattedOutputs := []string{}
|
|
|
|
for _, f := range searchedOutputs {
|
|
|
|
formattedOutputs = append(formattedOutputs,
|
|
|
|
fmt.Sprintf("%s (rel=%s)", PathRelativeToTop(f), f.Rel()))
|
|
|
|
}
|
|
|
|
|
|
|
|
return TestingBuildParams{}, formattedOutputs
|
2019-01-06 07:09:19 +01:00
|
|
|
}
|
|
|
|
|
2021-03-22 10:34:29 +01:00
|
|
|
func (b baseTestingComponent) buildParamsFromOutput(file string) TestingBuildParams {
|
|
|
|
p, searchedOutputs := b.maybeBuildParamsFromOutput(file)
|
2019-01-06 07:09:19 +01:00
|
|
|
if p.Rule == nil {
|
2021-03-22 12:34:57 +01:00
|
|
|
panic(fmt.Errorf("couldn't find output %q.\nall outputs:\n %s\n",
|
|
|
|
file, strings.Join(searchedOutputs, "\n ")))
|
2019-01-06 07:09:19 +01:00
|
|
|
}
|
|
|
|
return p
|
2017-07-13 23:43:27 +02:00
|
|
|
}
|
2018-03-12 09:29:17 +01:00
|
|
|
|
2021-03-22 10:34:29 +01:00
|
|
|
func (b baseTestingComponent) allOutputs() []string {
|
2019-01-24 01:27:47 +01:00
|
|
|
var outputFullPaths []string
|
2021-03-22 10:34:29 +01:00
|
|
|
for _, p := range b.provider.BuildParamsForTests() {
|
2019-01-24 01:27:47 +01:00
|
|
|
outputs := append(WritablePaths(nil), p.Outputs...)
|
2019-03-29 23:33:06 +01:00
|
|
|
outputs = append(outputs, p.ImplicitOutputs...)
|
2019-01-24 01:27:47 +01:00
|
|
|
if p.Output != nil {
|
|
|
|
outputs = append(outputs, p.Output)
|
|
|
|
}
|
|
|
|
outputFullPaths = append(outputFullPaths, outputs.Strings()...)
|
|
|
|
}
|
|
|
|
return outputFullPaths
|
|
|
|
}
|
|
|
|
|
2019-02-25 23:54:28 +01:00
|
|
|
// MaybeRule finds a call to ctx.Build with BuildParams.Rule set to a rule with the given name. Returns an empty
|
|
|
|
// BuildParams if no rule is found.
|
2021-03-22 10:29:00 +01:00
|
|
|
func (b baseTestingComponent) MaybeRule(rule string) TestingBuildParams {
|
2021-03-22 10:34:29 +01:00
|
|
|
r, _ := b.maybeBuildParamsFromRule(rule)
|
2020-08-27 15:50:24 +02:00
|
|
|
return r
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Rule finds a call to ctx.Build with BuildParams.Rule set to a rule with the given name. Panics if no rule is found.
|
2021-03-22 10:29:00 +01:00
|
|
|
func (b baseTestingComponent) Rule(rule string) TestingBuildParams {
|
2021-03-22 10:34:29 +01:00
|
|
|
return b.buildParamsFromRule(rule)
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// MaybeDescription finds a call to ctx.Build with BuildParams.Description set to a the given string. Returns an empty
|
|
|
|
// BuildParams if no rule is found.
|
2021-03-22 10:29:00 +01:00
|
|
|
func (b baseTestingComponent) MaybeDescription(desc string) TestingBuildParams {
|
2022-02-03 01:20:11 +01:00
|
|
|
p, _ := b.maybeBuildParamsFromDescription(desc)
|
|
|
|
return p
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Description finds a call to ctx.Build with BuildParams.Description set to a the given string. Panics if no rule is
|
|
|
|
// found.
|
2021-03-22 10:29:00 +01:00
|
|
|
func (b baseTestingComponent) Description(desc string) TestingBuildParams {
|
2021-03-22 10:34:29 +01:00
|
|
|
return b.buildParamsFromDescription(desc)
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// MaybeOutput finds a call to ctx.Build with a BuildParams.Output or BuildParams.Outputs whose String() or Rel()
|
|
|
|
// value matches the provided string. Returns an empty BuildParams if no rule is found.
|
2021-03-22 10:29:00 +01:00
|
|
|
func (b baseTestingComponent) MaybeOutput(file string) TestingBuildParams {
|
2021-03-22 10:34:29 +01:00
|
|
|
p, _ := b.maybeBuildParamsFromOutput(file)
|
2019-02-25 23:54:28 +01:00
|
|
|
return p
|
|
|
|
}
|
|
|
|
|
|
|
|
// Output finds a call to ctx.Build with a BuildParams.Output or BuildParams.Outputs whose String() or Rel()
|
|
|
|
// value matches the provided string. Panics if no rule is found.
|
2021-03-22 10:29:00 +01:00
|
|
|
func (b baseTestingComponent) Output(file string) TestingBuildParams {
|
2021-03-22 10:34:29 +01:00
|
|
|
return b.buildParamsFromOutput(file)
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// AllOutputs returns all 'BuildParams.Output's and 'BuildParams.Outputs's in their full path string forms.
|
2021-03-22 10:29:00 +01:00
|
|
|
func (b baseTestingComponent) AllOutputs() []string {
|
2021-03-22 10:34:29 +01:00
|
|
|
return b.allOutputs()
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
2021-03-22 10:29:00 +01:00
|
|
|
// TestingModule is wrapper around an android.Module that provides methods to find information about individual
|
2019-02-25 23:54:28 +01:00
|
|
|
// ctx.Build parameters for verification in tests.
|
2021-03-22 10:29:00 +01:00
|
|
|
type TestingModule struct {
|
|
|
|
baseTestingComponent
|
|
|
|
module Module
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
2021-03-22 11:09:02 +01:00
|
|
|
func newTestingModule(config Config, module Module) TestingModule {
|
2021-03-22 10:29:00 +01:00
|
|
|
return TestingModule{
|
2021-03-22 11:09:02 +01:00
|
|
|
newBaseTestingComponent(config, module),
|
2021-03-22 10:29:00 +01:00
|
|
|
module,
|
|
|
|
}
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
2021-03-22 10:29:00 +01:00
|
|
|
// Module returns the Module wrapped by the TestingModule.
|
|
|
|
func (m TestingModule) Module() Module {
|
|
|
|
return m.module
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
2021-03-22 17:04:50 +01:00
|
|
|
// VariablesForTestsRelativeToTop returns a copy of the Module.VariablesForTests() with every value
|
|
|
|
// having any temporary build dir usages replaced with paths relative to a notional top.
|
|
|
|
func (m TestingModule) VariablesForTestsRelativeToTop() map[string]string {
|
|
|
|
return normalizeStringMapRelativeToTop(m.config, m.module.VariablesForTests())
|
|
|
|
}
|
|
|
|
|
2021-03-29 01:00:17 +02:00
|
|
|
// OutputFiles calls OutputFileProducer.OutputFiles on the encapsulated module, exits the test
|
|
|
|
// immediately if there is an error and otherwise returns the result of calling Paths.RelativeToTop
|
|
|
|
// on the returned Paths.
|
|
|
|
func (m TestingModule) OutputFiles(t *testing.T, tag string) Paths {
|
|
|
|
producer, ok := m.module.(OutputFileProducer)
|
|
|
|
if !ok {
|
|
|
|
t.Fatalf("%q must implement OutputFileProducer\n", m.module.Name())
|
|
|
|
}
|
|
|
|
paths, err := producer.OutputFiles(tag)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
return paths.RelativeToTop()
|
|
|
|
}
|
|
|
|
|
2021-03-22 10:29:00 +01:00
|
|
|
// TestingSingleton is wrapper around an android.Singleton that provides methods to find information about individual
|
|
|
|
// ctx.Build parameters for verification in tests.
|
|
|
|
type TestingSingleton struct {
|
|
|
|
baseTestingComponent
|
|
|
|
singleton Singleton
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
2021-03-22 10:29:00 +01:00
|
|
|
// Singleton returns the Singleton wrapped by the TestingSingleton.
|
|
|
|
func (s TestingSingleton) Singleton() Singleton {
|
|
|
|
return s.singleton
|
2019-02-25 23:54:28 +01:00
|
|
|
}
|
|
|
|
|
2018-03-12 09:29:17 +01:00
|
|
|
func FailIfErrored(t *testing.T, errs []error) {
|
|
|
|
t.Helper()
|
|
|
|
if len(errs) > 0 {
|
|
|
|
for _, err := range errs {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
t.FailNow()
|
|
|
|
}
|
|
|
|
}
|
2018-03-12 09:34:26 +01:00
|
|
|
|
2021-03-04 18:58:33 +01:00
|
|
|
// Fail if no errors that matched the regular expression were found.
|
|
|
|
//
|
|
|
|
// Returns true if a matching error was found, false otherwise.
|
|
|
|
func FailIfNoMatchingErrors(t *testing.T, pattern string, errs []error) bool {
|
2018-03-12 09:34:26 +01:00
|
|
|
t.Helper()
|
|
|
|
|
|
|
|
matcher, err := regexp.Compile(pattern)
|
|
|
|
if err != nil {
|
2021-03-04 18:58:33 +01:00
|
|
|
t.Fatalf("failed to compile regular expression %q because %s", pattern, err)
|
2018-03-12 09:34:26 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
found := false
|
|
|
|
for _, err := range errs {
|
|
|
|
if matcher.FindStringIndex(err.Error()) != nil {
|
|
|
|
found = true
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if !found {
|
2022-08-30 03:11:11 +02:00
|
|
|
t.Errorf("could not match the expected error regex %q (checked %d error(s))", pattern, len(errs))
|
2018-03-12 09:34:26 +01:00
|
|
|
for i, err := range errs {
|
Reland: Deduplicate APEX variants that would build identically
APEX variants that share the same SDK version and updatability
almost always use identical command line arguments to build but
with different intermediates directories. This causes unnecessary
build time and disk space for duplicated work.
Deduplicate APEX variants that would build identically. Create
aliases from the per-APEX variations to the new shared variations
so that the APEX modules can continue to depend on them via the
APEX name as the variation.
This has one significant change in behavior. Before this change,
if an APEX had two libraries in its direct dependencies and one
of those libraries depended on the other, and the second library
had stubs, then the first library would depend on the implementation
of the second library and not the stubs. After this change, if
the first library is also present in a second APEX but the second
library is not, then the common variant shared between the two
APEXes would use the stubs, not the implementation.
In a correctly configured set of build rules this change will
be irrelevant, because if the compilation worked for the second
APEX using stubs then it will work for the common variant using
stubs. However, if an incorrect change to the build rules is
made this could lead to confusing errors, as a previously-working
common variant could suddenly stop building when a module is added
to a new APEX without its dependencies that require implementation
APIs to compile.
This change reduces the number of modules in an AOSP arm64-userdebug
build by 3% (52242 to 50586), reduces the number of variants of the
libcutils module from 74 to 53, and reduces the number of variants
of the massive libart[d] modules from 44 to 32.
This relands I0529837476a253c32b3dfb98dcccf107427c742c with a fix
to always mark permissions XML files of java_sdk_library modules as
unique per apex since they contain the APEX filename, and a fix
to UpdateUniqueApexVariationsForDeps to check ApexInfo.InApexes
instead of DepIsInSameApex to check if two modules are in the same
apex to account for a module that depends on another in a way that
doesn't normally include the dependency in the APEX (e.g. a libs
property), but the dependency is directly included in the APEX.
Bug: 164216768
Test: go test ./build/soong/apex/...
Change-Id: I2ae170601f764e5b88d0be2e0e6adc84e3a4d9cc
2020-08-11 21:17:01 +02:00
|
|
|
t.Errorf("errs[%d] = %q", i, err)
|
2018-03-12 09:34:26 +01:00
|
|
|
}
|
|
|
|
}
|
2021-03-04 18:58:33 +01:00
|
|
|
|
|
|
|
return found
|
2018-03-12 09:34:26 +01:00
|
|
|
}
|
2019-04-04 00:47:29 +02:00
|
|
|
|
2019-08-05 16:07:57 +02:00
|
|
|
func CheckErrorsAgainstExpectations(t *testing.T, errs []error, expectedErrorPatterns []string) {
|
|
|
|
t.Helper()
|
|
|
|
|
|
|
|
if expectedErrorPatterns == nil {
|
|
|
|
FailIfErrored(t, errs)
|
|
|
|
} else {
|
|
|
|
for _, expectedError := range expectedErrorPatterns {
|
|
|
|
FailIfNoMatchingErrors(t, expectedError, errs)
|
|
|
|
}
|
|
|
|
if len(errs) > len(expectedErrorPatterns) {
|
|
|
|
t.Errorf("additional errors found, expected %d, found %d",
|
|
|
|
len(expectedErrorPatterns), len(errs))
|
|
|
|
for i, expectedError := range expectedErrorPatterns {
|
|
|
|
t.Errorf("expectedErrors[%d] = %s", i, expectedError)
|
|
|
|
}
|
|
|
|
for i, err := range errs {
|
|
|
|
t.Errorf("errs[%d] = %s", i, err)
|
|
|
|
}
|
2021-03-04 18:58:33 +01:00
|
|
|
t.FailNow()
|
2019-08-05 16:07:57 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-11-23 06:22:30 +01:00
|
|
|
func SetKatiEnabledForTests(config Config) {
|
|
|
|
config.katiEnabled = true
|
2020-03-04 21:15:08 +01:00
|
|
|
}
|
|
|
|
|
2020-07-03 22:18:24 +02:00
|
|
|
func AndroidMkEntriesForTest(t *testing.T, ctx *TestContext, mod blueprint.Module) []AndroidMkEntries {
|
2022-11-04 21:06:02 +01:00
|
|
|
t.Helper()
|
2019-04-04 00:47:29 +02:00
|
|
|
var p AndroidMkEntriesProvider
|
|
|
|
var ok bool
|
|
|
|
if p, ok = mod.(AndroidMkEntriesProvider); !ok {
|
2019-07-23 17:53:32 +02:00
|
|
|
t.Errorf("module does not implement AndroidMkEntriesProvider: " + mod.Name())
|
2019-04-04 00:47:29 +02:00
|
|
|
}
|
2019-12-03 05:24:29 +01:00
|
|
|
|
|
|
|
entriesList := p.AndroidMkEntries()
|
|
|
|
for i, _ := range entriesList {
|
2020-07-03 22:18:24 +02:00
|
|
|
entriesList[i].fillInEntries(ctx, mod)
|
2019-12-03 05:24:29 +01:00
|
|
|
}
|
|
|
|
return entriesList
|
2019-04-04 00:47:29 +02:00
|
|
|
}
|
2019-07-11 09:18:47 +02:00
|
|
|
|
2020-07-03 22:18:24 +02:00
|
|
|
func AndroidMkDataForTest(t *testing.T, ctx *TestContext, mod blueprint.Module) AndroidMkData {
|
2022-11-04 21:06:02 +01:00
|
|
|
t.Helper()
|
2019-07-11 09:18:47 +02:00
|
|
|
var p AndroidMkDataProvider
|
|
|
|
var ok bool
|
|
|
|
if p, ok = mod.(AndroidMkDataProvider); !ok {
|
2019-07-23 17:53:32 +02:00
|
|
|
t.Errorf("module does not implement AndroidMkDataProvider: " + mod.Name())
|
2019-07-11 09:18:47 +02:00
|
|
|
}
|
|
|
|
data := p.AndroidMk()
|
2020-07-03 22:18:24 +02:00
|
|
|
data.fillInData(ctx, mod)
|
2019-07-11 09:18:47 +02:00
|
|
|
return data
|
|
|
|
}
|
2019-12-10 14:41:51 +01:00
|
|
|
|
|
|
|
// Normalize the path for testing.
|
|
|
|
//
|
|
|
|
// If the path is relative to the build directory then return the relative path
|
|
|
|
// to avoid tests having to deal with the dynamically generated build directory.
|
|
|
|
//
|
|
|
|
// Otherwise, return the supplied path as it is almost certainly a source path
|
|
|
|
// that is relative to the root of the source tree.
|
|
|
|
//
|
|
|
|
// The build and source paths should be distinguishable based on their contents.
|
2021-03-16 02:21:34 +01:00
|
|
|
//
|
|
|
|
// deprecated: use PathRelativeToTop instead as it handles make install paths and differentiates
|
|
|
|
// between output and source properly.
|
2019-12-10 14:41:51 +01:00
|
|
|
func NormalizePathForTesting(path Path) string {
|
2020-11-02 18:32:38 +01:00
|
|
|
if path == nil {
|
|
|
|
return "<nil path>"
|
|
|
|
}
|
2019-12-10 14:41:51 +01:00
|
|
|
p := path.String()
|
|
|
|
if w, ok := path.(WritablePath); ok {
|
2021-08-26 15:07:24 +02:00
|
|
|
rel, err := filepath.Rel(w.getSoongOutDir(), p)
|
2019-12-10 14:41:51 +01:00
|
|
|
if err != nil {
|
|
|
|
panic(err)
|
|
|
|
}
|
|
|
|
return rel
|
|
|
|
}
|
|
|
|
return p
|
|
|
|
}
|
|
|
|
|
2021-03-16 02:21:34 +01:00
|
|
|
// NormalizePathsForTesting creates a slice of strings where each string is the result of applying
|
|
|
|
// NormalizePathForTesting to the corresponding Path in the input slice.
|
|
|
|
//
|
|
|
|
// deprecated: use PathsRelativeToTop instead as it handles make install paths and differentiates
|
|
|
|
// between output and source properly.
|
2019-12-10 14:41:51 +01:00
|
|
|
func NormalizePathsForTesting(paths Paths) []string {
|
|
|
|
var result []string
|
|
|
|
for _, path := range paths {
|
|
|
|
relative := NormalizePathForTesting(path)
|
|
|
|
result = append(result, relative)
|
|
|
|
}
|
|
|
|
return result
|
|
|
|
}
|
2021-03-16 02:21:34 +01:00
|
|
|
|
|
|
|
// PathRelativeToTop returns a string representation of the path relative to a notional top
|
|
|
|
// directory.
|
|
|
|
//
|
2021-03-24 11:18:18 +01:00
|
|
|
// It return "<nil path>" if the supplied path is nil, otherwise it returns the result of calling
|
|
|
|
// Path.RelativeToTop to obtain a relative Path and then calling Path.String on that to get the
|
|
|
|
// string representation.
|
2021-03-16 02:21:34 +01:00
|
|
|
func PathRelativeToTop(path Path) string {
|
|
|
|
if path == nil {
|
|
|
|
return "<nil path>"
|
|
|
|
}
|
2021-03-24 11:18:18 +01:00
|
|
|
return path.RelativeToTop().String()
|
2021-03-16 02:21:34 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// PathsRelativeToTop creates a slice of strings where each string is the result of applying
|
|
|
|
// PathRelativeToTop to the corresponding Path in the input slice.
|
|
|
|
func PathsRelativeToTop(paths Paths) []string {
|
|
|
|
var result []string
|
|
|
|
for _, path := range paths {
|
|
|
|
relative := PathRelativeToTop(path)
|
|
|
|
result = append(result, relative)
|
|
|
|
}
|
|
|
|
return result
|
|
|
|
}
|
|
|
|
|
|
|
|
// StringPathRelativeToTop returns a string representation of the path relative to a notional top
|
|
|
|
// directory.
|
|
|
|
//
|
2021-03-24 11:18:18 +01:00
|
|
|
// See Path.RelativeToTop for more details as to what `relative to top` means.
|
2021-03-16 02:21:34 +01:00
|
|
|
//
|
|
|
|
// This is provided for processing paths that have already been converted into a string, e.g. paths
|
|
|
|
// in AndroidMkEntries structures. As a result it needs to be supplied the soong output dir against
|
|
|
|
// which it can try and relativize paths. PathRelativeToTop must be used for process Path objects.
|
|
|
|
func StringPathRelativeToTop(soongOutDir string, path string) string {
|
2021-03-24 11:18:18 +01:00
|
|
|
ensureTestOnly()
|
2021-03-16 02:21:34 +01:00
|
|
|
|
|
|
|
// A relative path must be a source path so leave it as it is.
|
|
|
|
if !filepath.IsAbs(path) {
|
|
|
|
return path
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check to see if the path is relative to the soong out dir.
|
|
|
|
rel, isRel, err := maybeRelErr(soongOutDir, path)
|
|
|
|
if err != nil {
|
|
|
|
panic(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if isRel {
|
|
|
|
// The path is in the soong out dir so indicate that in the relative path.
|
|
|
|
return filepath.Join("out/soong", rel)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check to see if the path is relative to the top level out dir.
|
|
|
|
outDir := filepath.Dir(soongOutDir)
|
|
|
|
rel, isRel, err = maybeRelErr(outDir, path)
|
|
|
|
if err != nil {
|
|
|
|
panic(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if isRel {
|
|
|
|
// The path is in the out dir so indicate that in the relative path.
|
|
|
|
return filepath.Join("out", rel)
|
|
|
|
}
|
|
|
|
|
|
|
|
// This should never happen.
|
|
|
|
panic(fmt.Errorf("internal error: absolute path %s is not relative to the out dir %s", path, outDir))
|
|
|
|
}
|
|
|
|
|
|
|
|
// StringPathsRelativeToTop creates a slice of strings where each string is the result of applying
|
|
|
|
// StringPathRelativeToTop to the corresponding string path in the input slice.
|
|
|
|
//
|
|
|
|
// This is provided for processing paths that have already been converted into a string, e.g. paths
|
|
|
|
// in AndroidMkEntries structures. As a result it needs to be supplied the soong output dir against
|
|
|
|
// which it can try and relativize paths. PathsRelativeToTop must be used for process Paths objects.
|
|
|
|
func StringPathsRelativeToTop(soongOutDir string, paths []string) []string {
|
|
|
|
var result []string
|
|
|
|
for _, path := range paths {
|
|
|
|
relative := StringPathRelativeToTop(soongOutDir, path)
|
|
|
|
result = append(result, relative)
|
|
|
|
}
|
|
|
|
return result
|
|
|
|
}
|
2021-03-29 01:21:00 +02:00
|
|
|
|
|
|
|
// StringRelativeToTop will normalize a string containing paths, e.g. ninja command, by replacing
|
|
|
|
// any references to the test specific temporary build directory that changes with each run to a
|
|
|
|
// fixed path relative to a notional top directory.
|
|
|
|
//
|
|
|
|
// This is similar to StringPathRelativeToTop except that assumes the string is a single path
|
|
|
|
// containing at most one instance of the temporary build directory at the start of the path while
|
|
|
|
// this assumes that there can be any number at any position.
|
|
|
|
func StringRelativeToTop(config Config, command string) string {
|
|
|
|
return normalizeStringRelativeToTop(config, command)
|
|
|
|
}
|
2021-03-29 01:56:32 +02:00
|
|
|
|
|
|
|
// StringsRelativeToTop will return a new slice such that each item in the new slice is the result
|
|
|
|
// of calling StringRelativeToTop on the corresponding item in the input slice.
|
|
|
|
func StringsRelativeToTop(config Config, command []string) []string {
|
|
|
|
return normalizeStringArrayRelativeToTop(config, command)
|
|
|
|
}
|