Searched refs:edge (Results 1 – 17 of 17) sorted by relevance
/build/make/tools/compliance/ |
D | policy_policy_test.go | 30 edge annotated 38 …edge: annotated{"apacheBin.meta_lic", "apacheLib.meta_lic", []string{"static"}… 44 edge: annotated{"mitBin.meta_lic", "mitLib.meta_lic", []string{"static"}}, 50 edge: annotated{"apacheBin.meta_lic", "lgplLib.meta_lic", []string{"static"}}, 59 …edge: annotated{"apacheBin.meta_lic", "lgplLib.meta_lic", []string{"dynamic"}}, 65 edge: annotated{"apacheBin.meta_lic", "gplLib.meta_lic", []string{"static"}}, 74 edge: annotated{"apacheBin.meta_lic", "gplLib.meta_lic", []string{"dynamic"}}, 83 …edge: annotated{"apacheBin.meta_lic", "gplWithClasspathException.meta_lic", []… 89 …edge: annotated{"apacheBin.meta_lic", "gplWithClasspathException.meta_lic", []… 95 …edge: annotated{"dependentModule.meta_lic", "gplWithClasspathException.meta_li… [all …]
|
D | policy_walk.go | 21 Context(lg *LicenseGraph, path TargetEdgePath, edge *TargetEdge) interface{} 28 func (ctx NoEdgeContext) Context(lg *LicenseGraph, path TargetEdgePath, edge *TargetEdge) interface… 39 func (ctx ApplicableConditionsContext) Context(lg *LicenseGraph, path TargetEdgePath, edge *TargetE… 44 return conditionsAttachingAcrossEdge(lg, edge, universe) 63 for _, edge := range fnode.edges { 68 edgeContext = ctx.Context(lg, *path, edge) 70 path.Push(edge, edgeContext) 71 walk(edge.dependency) 90 for _, edge := range fnode.edges { 95 edgeContext = ctx.Context(lg, *path, edge) [all …]
|
D | readgraph_test.go | 32 expectedEdges []edge 41 expectedEdges: []edge{}, 67 expectedEdges: []edge{{"app.meta_lic", "lib.meta_lic"}}, 79 expectedEdges: []edge{ 107 actualEdges := make([]edge, 0) 109 actualEdges = append(actualEdges, edge{e.Target().Name(), e.Dependency().Name()}) 114 for _, edge := range actualEdges { 115 t.Logf(" %s", edge.String()) 118 for _, edge := range actualEdges { 119 t.Logf(" %s", edge.String())
|
D | policy_resolve.go | 78 for _, edge := range target.edges { 80 dcs := walk(edge.dependency, treatAsAggregate && edge.dependency.IsContainer()) 83 dcs = depConditionsPropagatingToTarget(lg, edge, dcs, treatAsAggregate) 158 for _, edge := range fnode.edges { 160 dcs := targetConditionsPropagatingToDep(lg, edge, cs, treatAsAggregate, conditionsFn) 161 dnode := edge.dependency
|
D | graph.go | 198 edge *TargetEdge member 206 return s.edge.target 213 return s.edge.dependency 218 return s.edge 228 return s.edge.annotations 239 …return fmt.Sprintf("%s -[%s]> %s", s.edge.target.name, strings.Join(s.edge.annotations.AsList(), "… 254 func (p *TargetEdgePath) Push(edge *TargetEdge, ctx interface{}) { 256 *p = append(*p, TargetEdgePathSegment{edge, ctx}) 259 if (*p)[len(*p)-1].edge.dependency != edge.target { 260 panic(fmt.Errorf("disjoint path %s does not end at %s", p.String(), edge.target.name)) [all …]
|
D | test_util.go | 146 type edge struct { struct 151 func (e edge) String() string { argument 156 type byEdge []edge 213 for _, edge := range edges { 214 if prev, ok := deps[edge.target]; ok { 215 deps[edge.target] = append(prev, edge) 217 deps[edge.target] = []annotated{edge} 219 if _, ok := deps[edge.dep]; !ok { 220 deps[edge.dep] = []annotated{} 226 for _, edge := range edges { [all …]
|
D | policy_shipped_test.go | 115 for _, edge := range lg.Edges() { 116 t.Logf(" %s", edge.String())
|
D | policy_shipped.go | 34 if !edgeIsDerivation(path[len(path)-1].edge) {
|
D | readgraph.go | 236 edge := &TargetEdge{tn, dtn, annotations} 237 lg.edges = append(lg.edges, edge) 238 tn.edges = append(tn.edges, edge)
|
/build/soong/ui/status/ninja_frontend/ |
D | frontend.proto | 35 // Total running time of every need-to-build edge in milliseconds 47 // List of edge inputs. 49 // List of edge outputs. 51 // Description field from the edge. 53 // Command field from the edge.
|
/build/bazel_common_rules/exec/ |
D | exec.bzl | 149 … cfg: [Incoming edge transition](https://bazel.build/extending/config#incoming-edge-transitions)
|
/build/bazel_common_rules/exec/impl/ |
D | exec.bzl | 128 … cfg: [Incoming edge transition](https://bazel.build/extending/config#incoming-edge-transitions)
|
/build/make/tools/compliance/cmd/dumpgraph/ |
D | dumpgraph.go | 97 edge in the license graph. When -dot flag given, outputs the nodes and
|
/build/bazel/rules/apex/ |
D | transition.bzl | 20 top level APEX rule to its dependencies via an outgoing edge, so that the
|
D | cc.bzl | 251 # Propagate along the src edge
|
/build/bazel/rules/tradefed/ |
D | tradefed.bzl | 56 # used in the tradefed -> cc_test edge (for example).
|
/build/bazel/docs/ |
D | internal_concepts.md | 615 dependent as though the dependent has a direct edge to the transitive
|