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
|
package forge
import java.nio.{file => jnio}
import play.api.libs.json.Json
import sourcecode.Enclosing
import scala.collection.mutable
class Evaluator(workspacePath: jnio.Path,
enclosingBase: DefCtx){
/**
* Cache from the ID of the first terminal target in a group to the has of
* all the group's distinct inputs, and the results of the possibly-multiple
* terminal nodes
*/
val resultCache = mutable.Map.empty[String, (Int, Seq[String])]
def evaluate(targets: OSet[Target[_]]): Evaluator.Results = {
jnio.Files.createDirectories(workspacePath)
val sortedGroups = Evaluator.groupAroundNamedTargets(
Evaluator.topoSortedTransitiveTargets(targets)
)
val evaluated = new MutableOSet[Target[_]]
val results = mutable.Map.empty[Target[_], Any]
for (group <- sortedGroups){
val (newResults, newEvaluated) = evaluateGroup(group, results)
evaluated.appendAll(newEvaluated)
for((k, v) <- newResults) results.put(k, v)
}
Evaluator.Results(targets.items.map(results), evaluated)
}
def evaluateGroup(group: OSet[Target[_]],
results: collection.Map[Target[_], Any]) = {
val allInputs = group.items.flatMap(_.inputs)
val (internalInputs, externalInputs) = allInputs.partition(group.contains)
val internalInputSet = internalInputs.toSet
val inputResults = externalInputs.distinct.map(results).toIndexedSeq
val newResults = mutable.Map.empty[Target[_], Any]
val newEvaluated = mutable.Buffer.empty[Target[_]]
val terminals = group.filter(!internalInputSet(_))
val primeTerminal = terminals.items(0)
val enclosingStr = primeTerminal.defCtx.label
val targetDestPath = workspacePath.resolve(
jnio.Paths.get(enclosingStr.stripSuffix(enclosingBase.label))
)
val anyDirty = group.exists(_.dirty)
deleteRec(targetDestPath)
val inputsHash = inputResults.hashCode
resultCache.get(primeTerminal.defCtx.label) match{
case Some((hash, terminalResults))
if hash == inputsHash && !anyDirty =>
for((terminal, res) <- terminals.items.zip(terminalResults)){
newResults(terminal) = primeTerminal.formatter.reads(Json.parse(res)).get
}
case _ =>
val terminalResults = mutable.Buffer.empty[String]
for(target <- group.items){
newEvaluated.append(target)
val targetInputValues = target.inputs.toVector.map(x =>
newResults.getOrElse(x, results(x))
)
if (target.defCtx.anonId.isDefined) {
val res = target.evaluate(new Args(targetInputValues, targetDestPath))
newResults(target) = res
}else{
val (res, serialized) = target.evaluateAndWrite(
new Args(targetInputValues, targetDestPath)
)
if (!internalInputSet(target)){
terminalResults.append(serialized)
}
newResults(target) = res
}
}
resultCache(primeTerminal.defCtx.label) = (inputsHash, terminalResults)
}
(newResults, newEvaluated)
}
def deleteRec(path: jnio.Path) = {
if (jnio.Files.exists(path)){
import collection.JavaConverters._
jnio.Files.walk(path).iterator()
.asScala
.toArray
.reverseIterator
.map(jnio.Files.deleteIfExists)
}
}
}
object Evaluator{
class TopoSorted private[Evaluator] (val values: OSet[Target[_]])
case class Results(values: Seq[Any], evaluated: OSet[Target[_]])
def groupAroundNamedTargets(topoSortedTargets: TopoSorted): OSet[OSet[Target[_]]] = {
val grouping = new MultiBiMap[Int, Target[_]]()
var groupCount = 0
for(target <- topoSortedTargets.values.items.reverseIterator){
if (!grouping.containsValue(target)){
grouping.add(groupCount, target)
groupCount += 1
}
val targetGroup = grouping.lookupValue(target)
for(upstream <- target.inputs){
grouping.lookupValueOpt(upstream) match{
case None if upstream.defCtx.anonId.nonEmpty =>
grouping.add(targetGroup, upstream)
case Some(upstreamGroup) if upstreamGroup == targetGroup =>
val upstreamTargets = grouping.removeAll(upstreamGroup)
grouping.addAll(targetGroup, upstreamTargets)
case _ => //donothing
}
}
}
val output = mutable.Buffer.empty[OSet[Target[_]]]
for(target <- topoSortedTargets.values.items.reverseIterator){
for(targetGroup <- grouping.lookupValueOpt(target)){
output.append(
OSet.from(
grouping.removeAll(targetGroup)
.sortBy(topoSortedTargets.values.items.indexOf)
)
)
}
}
OSet.from(output.reverse)
}
/**
* Takes the given targets, finds
*/
def topoSortedTransitiveTargets(sourceTargets: OSet[Target[_]]): TopoSorted = {
val transitiveTargets = new MutableOSet[Target[_]]
def rec(t: Target[_]): Unit = {
if (transitiveTargets.contains(t)) () // do nothing
else {
transitiveTargets.append(t)
t.inputs.foreach(rec)
}
}
sourceTargets.items.foreach(rec)
val targetIndices = transitiveTargets.items.zipWithIndex.toMap
val numberedEdges =
for(t <- transitiveTargets.items)
yield t.inputs.map(targetIndices)
val sortedClusters = Tarjans(numberedEdges)
val nonTrivialClusters = sortedClusters.filter(_.length > 1)
assert(nonTrivialClusters.isEmpty, nonTrivialClusters)
new TopoSorted(OSet.from(sortedClusters.flatten.map(transitiveTargets.items)))
}
}
|
