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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
"""SCons.Taskmaster
Generic Taskmaster.
"""
#
# Copyright (c) 2001, 2002, 2003 Steven Knight
#
# Permission is hereby granted, free of charge, to any person obtaining
# a copy of this software and associated documentation files (the
# "Software"), to deal in the Software without restriction, including
# without limitation the rights to use, copy, modify, merge, publish,
# distribute, sublicense, and/or sell copies of the Software, and to
# permit persons to whom the Software is furnished to do so, subject to
# the following conditions:
#
# The above copyright notice and this permission notice shall be included
# in all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
# KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
# WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
# LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
# OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
# WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#
__revision__ = "__FILE__ __REVISION__ __DATE__ __DEVELOPER__"
import string
import sys
import SCons.Node
import SCons.Errors
class Task:
"""Default SCons build engine task.
This controls the interaction of the actual building of node
and the rest of the engine.
This is expected to handle all of the normally-customizable
aspects of controlling a build, so any given application
*should* be able to do what it wants by sub-classing this
class and overriding methods as appropriate. If an application
needs to customze something by sub-classing Taskmaster (or
some other build engine class), we should first try to migrate
that functionality into this class.
Note that it's generally a good idea for sub-classes to call
these methods explicitly to update state, etc., rather than
roll their own interaction with Taskmaster from scratch."""
def __init__(self, tm, targets, top, node):
self.tm = tm
self.targets = targets
self.top = top
self.node = node
def prepare(self):
"""Called just before the task is executed.
This unlinks all targets and makes all directories before
building anything."""
if self.targets[0].get_state() != SCons.Node.up_to_date:
for t in self.targets:
t.prepare()
def execute(self):
"""Called to execute the task.
This method is called from multiple threads in a parallel build,
so only do thread safe stuff here. Do thread unsafe stuff in
prepare(), executed() or failed()."""
try:
self.targets[0].build()
except KeyboardInterrupt:
raise
except SCons.Errors.UserError:
raise
except SCons.Errors.BuildError:
raise
except:
raise SCons.Errors.BuildError(self.targets[0],
"Exception",
sys.exc_type,
sys.exc_value,
sys.exc_traceback)
def get_target(self):
"""Fetch the target being built or updated by this task.
"""
return self.node
def executed(self):
"""Called when the task has been successfully executed.
This may have been a do-nothing operation (to preserve
build order), so check the node's state before updating
things. Most importantly, this calls back to the
Taskmaster to put any node tasks waiting on this one
back on the pending list."""
if self.targets[0].get_state() == SCons.Node.executing:
for t in self.targets:
for side_effect in t.side_effects:
side_effect.set_state(None)
t.set_state(SCons.Node.executed)
t.built()
self.tm.executed(self.node)
def failed(self):
"""Default action when a task fails: stop the build."""
self.fail_stop()
def fail_stop(self):
"""Explicit stop-the-build failure."""
for t in self.targets:
t.set_state(SCons.Node.failed)
self.tm.stop()
def fail_continue(self):
"""Explicit continue-the-build failure.
This sets failure status on the target nodes and all of
their dependent parent nodes.
"""
for t in self.targets:
def get_parents(node, parent): return node.get_parents()
def set_state(node, parent): node.set_state(SCons.Node.failed)
walker = SCons.Node.Walker(t, get_parents, eval_func=set_state)
n = walker.next()
while n:
n = walker.next()
self.tm.executed(self.node)
def make_ready(self):
"""Make a task ready for execution."""
state = SCons.Node.up_to_date
for t in self.targets:
if not t.current(self.tm.calc):
state = SCons.Node.executing
for t in self.targets:
if state == SCons.Node.executing:
for side_effect in t.side_effects:
side_effect.set_state(state)
t.set_state(state)
class Calc:
def bsig(self, node):
"""
"""
return None
def current(self, node, sig):
"""Default SCons build engine is-it-current function.
This returns "always out of date," so every node is always
built/visited.
"""
return 0
class Taskmaster:
"""A generic Taskmaster for handling a bunch of targets.
Classes that override methods of this class should call
the base class method, so this class can do its thing.
"""
def __init__(self, targets=[], tasker=Task, calc=Calc()):
self.targets = targets # top level targets
self.candidates = targets[:] # nodes that might be ready to be executed
self.candidates.reverse()
self.executing = [] # nodes that are currently executing
self.pending = [] # nodes that depend on a currently executing node
self.tasker = tasker
self.ready = None # the next task that is ready to be executed
self.calc = calc
def _find_next_ready_node(self):
"""Find the next node that is ready to be built"""
if self.ready:
return
while self.candidates:
node = self.candidates[-1]
state = node.get_state()
# Skip nodes that have already been executed:
if state != None and state != SCons.Node.stack:
self.candidates.pop()
continue
# keep track of which nodes are in the execution stack:
node.set_state(SCons.Node.stack)
children = node.children()
# detect dependency cycles:
def in_stack(node): return node.get_state() == SCons.Node.stack
cycle = filter(in_stack, children)
if cycle:
nodes = filter(in_stack, self.candidates) + cycle
nodes.reverse()
desc = "Dependency cycle: " + string.join(map(str, nodes), " -> ")
raise SCons.Errors.UserError, desc
# Add non-derived files that have not been built
# to the candidates list:
def derived(node):
return (node.has_builder() or node.side_effect) and node.get_state() == None
derived = filter(derived, children)
if derived:
derived.reverse()
self.candidates.extend(derived)
continue
# Skip nodes whose side-effects are currently being built:
cont = 0
for side_effect in node.side_effects:
if side_effect.get_state() == SCons.Node.executing:
self.pending.append(node)
node.set_state(SCons.Node.pending)
self.candidates.pop()
cont = 1
break
if cont: continue
# Skip nodes that are pending on a currently executing node:
if node.depends_on(self.executing) or node.depends_on(self.pending):
self.pending.append(node)
node.set_state(SCons.Node.pending)
self.candidates.pop()
continue
else:
self.candidates.pop()
self.ready = node
break
def next_task(self):
"""Return the next task to be executed."""
self._find_next_ready_node()
node = self.ready
if node is None:
return None
try:
tlist = node.builder.targets(node)
except AttributeError:
tlist = [node]
self.executing.extend(tlist)
self.executing.extend(node.side_effects)
task = self.tasker(self, tlist, node in self.targets, node)
task.make_ready()
self.ready = None
return task
def is_blocked(self):
self._find_next_ready_node()
return not self.ready and self.pending
def stop(self):
"""Stop the current build completely."""
self.candidates = []
self.ready = None
self.pending = []
def executed(self, node):
try:
tlist = node.builder.targets(node)
except AttributeError:
tlist = [node]
for t in tlist:
self.executing.remove(t)
for side_effect in node.side_effects:
self.executing.remove(side_effect)
# move the current pending nodes to the candidates list:
# (they may not all be ready to build, but _find_next_ready_node()
# will figure out which ones are really ready)
for node in self.pending:
node.set_state(None)
self.pending.reverse()
self.candidates.extend(self.pending)
self.pending = []
|