1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
|
package mill.eval
import ammonite.ops._
import mill.define.Task
import mill.discover.Labelled
import mill.util.{Args, MultiBiMap, OSet}
import play.api.libs.json.{Format, JsValue, Json}
import scala.collection.mutable
class Evaluator(workspacePath: Path,
labeling: Map[Task[_], Labelled[_]]){
def evaluate(goals: OSet[Task[_]]): Evaluator.Results = {
mkdir(workspacePath)
val transitive = Evaluator.transitiveTargets(goals)
val topoSorted = Evaluator.topoSorted(transitive)
val sortedGroups = Evaluator.groupAroundImportantTargets(
topoSorted,
t => labeling.contains(t) || goals.contains(t)
)
val evaluated = new OSet.Mutable[Task[_]]
val results = mutable.LinkedHashMap.empty[Task[_], Any]
for ((terminal, group)<- sortedGroups.items()){
val (newResults, newEvaluated) = evaluateGroupCached(terminal, group, results)
for(ev <- newEvaluated){
evaluated.append(ev)
}
for((k, v) <- newResults) results.put(k, v)
}
Evaluator.Results(goals.items.map(results), evaluated, transitive)
}
def resolveDestPaths(t: Task[_]): Option[(Path, Path)] = {
labeling.get(t) match{
case Some(labeling) =>
val targetDestPath = workspacePath / labeling.segments
val metadataPath = targetDestPath / up / (targetDestPath.last + ".mill.json")
Some((targetDestPath, metadataPath))
case None => None
}
}
def evaluateGroupCached(terminal: Task[_],
group: OSet[Task[_]],
results: collection.Map[Task[_], Any]): (collection.Map[Task[_], Any], Seq[Task[_]]) = {
val externalInputs = group.items.flatMap(_.inputs).filter(!group.contains(_))
val inputsHash =
externalInputs.toIterator.map(results).toVector.hashCode +
group.toIterator.map(_.sideHash).toVector.hashCode()
val destPaths = resolveDestPaths(terminal)
val (targetDestPath, metadataPath) = (destPaths.map(_._1), destPaths.map(_._2))
val cached = for{
metadataPath <- metadataPath
json <- scala.util.Try(Json.parse(read.getInputStream(metadataPath))).toOption
(cachedHash, terminalResult) <- Json.fromJson[(Int, JsValue)](json).asOpt
if cachedHash == inputsHash
} yield terminalResult
cached match{
case Some(terminalResult) =>
val newResults = mutable.LinkedHashMap.empty[Task[_], Any]
newResults(terminal) = labeling(terminal).format.reads(terminalResult).get
(newResults, Nil)
case _ =>
val labeled = group.collect(labeling)
if (labeled.nonEmpty){
println(fansi.Color.Blue("Running " + labeled.map(_.segments.mkString(".")).mkString(", ")))
}
val (newResults, newEvaluated, terminalResult) = evaluateGroup(group, results, targetDestPath)
metadataPath.foreach(
write.over(
_,
Json.prettyPrint(
Json.toJson(inputsHash -> terminalResult)
),
)
)
(newResults, newEvaluated)
}
}
def evaluateGroup(group: OSet[Task[_]],
results: collection.Map[Task[_], Any],
targetDestPath: Option[Path]) = {
targetDestPath.foreach(rm)
var terminalResult: JsValue = null
val newEvaluated = mutable.Buffer.empty[Task[_]]
val newResults = mutable.LinkedHashMap.empty[Task[_], Any]
for (target <- group.items if !results.contains(target)) {
newEvaluated.append(target)
val targetInputValues = target.inputs.toVector.map(x =>
newResults.getOrElse(x, results(x))
)
val args = new Args(targetInputValues, targetDestPath.orNull)
val res = target.evaluate(args)
for(targetLabel <- labeling.get(target)){
terminalResult = targetLabel
.format
.asInstanceOf[Format[Any]]
.writes(res.asInstanceOf[Any])
}
newResults(target) = res
}
(newResults, newEvaluated, terminalResult)
}
}
object Evaluator{
class TopoSorted private[Evaluator](val values: OSet[Task[_]])
case class Results(values: Seq[Any], evaluated: OSet[Task[_]], transitive: OSet[Task[_]])
def groupAroundImportantTargets(topoSortedTargets: TopoSorted,
important: Task[_] => Boolean): MultiBiMap[Task[_], Task[_]] = {
val output = new MultiBiMap.Mutable[Task[_], Task[_]]()
for (target <- topoSortedTargets.values if important(target)) {
val transitiveTargets = new OSet.Mutable[Task[_]]
def rec(t: Task[_]): Unit = {
if (transitiveTargets.contains(t)) () // do nothing
else if (important(t) && t != target) () // do nothing
else {
transitiveTargets.append(t)
t.inputs.foreach(rec)
}
}
rec(target)
output.addAll(target, topoSorted(transitiveTargets).values)
}
output
}
def transitiveTargets(sourceTargets: OSet[Task[_]]): OSet[Task[_]] = {
val transitiveTargets = new OSet.Mutable[Task[_]]
def rec(t: Task[_]): Unit = {
if (transitiveTargets.contains(t)) () // do nothing
else {
transitiveTargets.append(t)
t.inputs.foreach(rec)
}
}
sourceTargets.items.foreach(rec)
transitiveTargets
}
/**
* Takes the given targets, finds all the targets they transitively depend
* on, and sort them topologically. Fails if there are dependency cycles
*/
def topoSorted(transitiveTargets: OSet[Task[_]]): TopoSorted = {
val targetIndices = transitiveTargets.items.zipWithIndex.toMap
val numberedEdges =
for(t <- transitiveTargets.items)
yield t.inputs.collect(targetIndices)
val sortedClusters = Tarjans(numberedEdges)
val nonTrivialClusters = sortedClusters.filter(_.length > 1)
assert(nonTrivialClusters.isEmpty, nonTrivialClusters)
new TopoSorted(OSet.from(sortedClusters.flatten.map(transitiveTargets.items)))
}
}
|
