Home
last modified time | relevance | path

Searched refs:edge (Results 1 – 17 of 17) sorted by relevance

/build/make/tools/compliance/
Dpolicy_policy_test.go30 edge annotated
38edge: 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"}},
59edge: 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"}},
83edge: annotated{"apacheBin.meta_lic", "gplWithClasspathException.meta_lic", []…
89edge: annotated{"apacheBin.meta_lic", "gplWithClasspathException.meta_lic", []…
95edge: annotated{"dependentModule.meta_lic", "gplWithClasspathException.meta_li…
[all …]
Dpolicy_walk.go21 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 …]
Dreadgraph_test.go32 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())
Dpolicy_resolve.go78 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
Dgraph.go198 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 …]
Dtest_util.go146 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 …]
Dpolicy_shipped_test.go115 for _, edge := range lg.Edges() {
116 t.Logf(" %s", edge.String())
Dpolicy_shipped.go34 if !edgeIsDerivation(path[len(path)-1].edge) {
Dreadgraph.go236 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/
Dfrontend.proto35 // 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/
Dexec.bzl149 … cfg: [Incoming edge transition](https://bazel.build/extending/config#incoming-edge-transitions)
/build/bazel_common_rules/exec/impl/
Dexec.bzl128 … cfg: [Incoming edge transition](https://bazel.build/extending/config#incoming-edge-transitions)
/build/make/tools/compliance/cmd/dumpgraph/
Ddumpgraph.go97 edge in the license graph. When -dot flag given, outputs the nodes and
/build/bazel/rules/apex/
Dtransition.bzl20 top level APEX rule to its dependencies via an outgoing edge, so that the
Dcc.bzl251 # Propagate along the src edge
/build/bazel/rules/tradefed/
Dtradefed.bzl56 # used in the tradefed -> cc_test edge (for example).
/build/bazel/docs/
Dinternal_concepts.md615 dependent as though the dependent has a direct edge to the transitive