wenzelm@28165
|
1 |
(* Title: Pure/Concurrent/task_queue.ML
|
wenzelm@28165
|
2 |
Author: Makarius
|
wenzelm@28165
|
3 |
|
wenzelm@28165
|
4 |
Ordered queue of grouped tasks.
|
wenzelm@28165
|
5 |
*)
|
wenzelm@28165
|
6 |
|
wenzelm@28165
|
7 |
signature TASK_QUEUE =
|
wenzelm@28165
|
8 |
sig
|
wenzelm@29340
|
9 |
type group
|
wenzelm@32221
|
10 |
val new_group: group option -> group
|
wenzelm@32052
|
11 |
val group_id: group -> int
|
wenzelm@29340
|
12 |
val eq_group: group * group -> bool
|
wenzelm@32221
|
13 |
val cancel_group: group -> exn -> unit
|
wenzelm@32221
|
14 |
val is_canceled: group -> bool
|
wenzelm@32121
|
15 |
val group_status: group -> exn list
|
wenzelm@28179
|
16 |
val str_of_group: group -> string
|
wenzelm@42563
|
17 |
type task
|
wenzelm@42563
|
18 |
val dummy_task: unit -> task
|
wenzelm@42563
|
19 |
val group_of_task: task -> group
|
wenzelm@42563
|
20 |
val name_of_task: task -> string
|
wenzelm@42563
|
21 |
val pri_of_task: task -> int
|
wenzelm@42563
|
22 |
val str_of_task: task -> string
|
wenzelm@42563
|
23 |
val timing_of_task: task -> Time.time * Time.time * string list
|
wenzelm@42566
|
24 |
val running: task -> (unit -> 'a) -> 'a
|
wenzelm@42566
|
25 |
val joining: task -> (unit -> 'a) -> 'a
|
wenzelm@42566
|
26 |
val waiting: task -> task list -> (unit -> 'a) -> 'a
|
wenzelm@28165
|
27 |
type queue
|
wenzelm@28165
|
28 |
val empty: queue
|
wenzelm@42579
|
29 |
val known_task: queue -> task -> bool
|
wenzelm@34277
|
30 |
val all_passive: queue -> bool
|
wenzelm@34277
|
31 |
val status: queue -> {ready: int, pending: int, running: int, passive: int}
|
wenzelm@34280
|
32 |
val cancel: queue -> group -> bool
|
wenzelm@34280
|
33 |
val cancel_all: queue -> group list
|
wenzelm@42561
|
34 |
val finish: task -> queue -> bool * queue
|
wenzelm@38122
|
35 |
val enqueue_passive: group -> (unit -> bool) -> queue -> task * queue
|
wenzelm@42579
|
36 |
val enqueue: string -> group -> task list -> int -> (bool -> bool) -> queue -> task * queue
|
wenzelm@29369
|
37 |
val extend: task -> (bool -> bool) -> queue -> queue option
|
wenzelm@39520
|
38 |
val dequeue_passive: Thread.thread -> task -> queue -> bool * queue
|
wenzelm@42563
|
39 |
val dequeue: Thread.thread -> queue -> (task * (bool -> bool) list) option * queue
|
wenzelm@42566
|
40 |
val dequeue_deps: Thread.thread -> task list -> queue ->
|
wenzelm@42566
|
41 |
(((task * (bool -> bool) list) option * task list) * queue)
|
wenzelm@28165
|
42 |
end;
|
wenzelm@28165
|
43 |
|
wenzelm@35242
|
44 |
structure Task_Queue: TASK_QUEUE =
|
wenzelm@28165
|
45 |
struct
|
wenzelm@28165
|
46 |
|
wenzelm@40707
|
47 |
val new_id = Synchronized.counter ();
|
wenzelm@40707
|
48 |
|
wenzelm@40707
|
49 |
|
wenzelm@42563
|
50 |
(** nested groups of tasks **)
|
wenzelm@42563
|
51 |
|
wenzelm@42563
|
52 |
(* groups *)
|
wenzelm@42563
|
53 |
|
wenzelm@42563
|
54 |
abstype group = Group of
|
wenzelm@42563
|
55 |
{parent: group option,
|
wenzelm@42563
|
56 |
id: int,
|
wenzelm@42563
|
57 |
status: exn list Synchronized.var}
|
wenzelm@42563
|
58 |
with
|
wenzelm@42563
|
59 |
|
wenzelm@42563
|
60 |
fun make_group (parent, id, status) = Group {parent = parent, id = id, status = status};
|
wenzelm@42563
|
61 |
|
wenzelm@42563
|
62 |
fun new_group parent = make_group (parent, new_id (), Synchronized.var "group" []);
|
wenzelm@42563
|
63 |
|
wenzelm@42563
|
64 |
fun group_id (Group {id, ...}) = id;
|
wenzelm@42563
|
65 |
fun eq_group (group1, group2) = group_id group1 = group_id group2;
|
wenzelm@42563
|
66 |
|
wenzelm@42580
|
67 |
fun group_ancestry f (Group {parent = NONE, id, ...}) a = f id a
|
wenzelm@42580
|
68 |
| group_ancestry f (Group {parent = SOME group, id, ...}) a = group_ancestry f group (f id a);
|
wenzelm@42563
|
69 |
|
wenzelm@42563
|
70 |
|
wenzelm@42563
|
71 |
(* group status *)
|
wenzelm@42563
|
72 |
|
wenzelm@42563
|
73 |
fun cancel_group (Group {status, ...}) exn =
|
wenzelm@42563
|
74 |
Synchronized.change status
|
wenzelm@42563
|
75 |
(fn exns =>
|
wenzelm@42563
|
76 |
if not (Exn.is_interrupt exn) orelse null exns then exn :: exns
|
wenzelm@42563
|
77 |
else exns);
|
wenzelm@42563
|
78 |
|
wenzelm@42563
|
79 |
fun is_canceled (Group {parent, status, ...}) =
|
wenzelm@42563
|
80 |
not (null (Synchronized.value status)) orelse
|
wenzelm@42563
|
81 |
(case parent of NONE => false | SOME group => is_canceled group);
|
wenzelm@42563
|
82 |
|
wenzelm@42563
|
83 |
fun group_status (Group {parent, status, ...}) =
|
wenzelm@42563
|
84 |
Synchronized.value status @
|
wenzelm@42563
|
85 |
(case parent of NONE => [] | SOME group => group_status group);
|
wenzelm@42563
|
86 |
|
wenzelm@42563
|
87 |
fun str_of_group group =
|
wenzelm@42563
|
88 |
(is_canceled group ? enclose "(" ")") (string_of_int (group_id group));
|
wenzelm@42563
|
89 |
|
wenzelm@42563
|
90 |
end;
|
wenzelm@42563
|
91 |
|
wenzelm@42541
|
92 |
|
wenzelm@42561
|
93 |
(* tasks *)
|
wenzelm@42561
|
94 |
|
wenzelm@42561
|
95 |
type timing = Time.time * Time.time * string list; (*run, wait, wait dependencies*)
|
wenzelm@42541
|
96 |
|
wenzelm@42541
|
97 |
fun new_timing () =
|
wenzelm@42560
|
98 |
Synchronized.var "timing" ((Time.zeroTime, Time.zeroTime, []): timing);
|
wenzelm@42541
|
99 |
|
wenzelm@42544
|
100 |
abstype task = Task of
|
wenzelm@42563
|
101 |
{group: group,
|
wenzelm@42563
|
102 |
name: string,
|
wenzelm@42544
|
103 |
id: int,
|
wenzelm@42544
|
104 |
pri: int option,
|
wenzelm@42544
|
105 |
timing: timing Synchronized.var}
|
wenzelm@35242
|
106 |
with
|
wenzelm@35242
|
107 |
|
wenzelm@42563
|
108 |
fun dummy_task () =
|
wenzelm@42563
|
109 |
Task {group = new_group NONE, name = "", id = 0, pri = NONE, timing = new_timing ()};
|
wenzelm@29003
|
110 |
|
wenzelm@42563
|
111 |
fun new_task group name pri =
|
wenzelm@42563
|
112 |
Task {group = group, name = name, id = new_id (), pri = pri, timing = new_timing ()};
|
wenzelm@42563
|
113 |
|
wenzelm@42563
|
114 |
fun group_of_task (Task {group, ...}) = group;
|
wenzelm@42561
|
115 |
fun name_of_task (Task {name, ...}) = name;
|
wenzelm@42544
|
116 |
fun pri_of_task (Task {pri, ...}) = the_default 0 pri;
|
wenzelm@42544
|
117 |
fun str_of_task (Task {name, id, ...}) =
|
wenzelm@42544
|
118 |
if name = "" then string_of_int id else string_of_int id ^ " (" ^ name ^ ")";
|
wenzelm@28165
|
119 |
|
wenzelm@42544
|
120 |
fun timing_of_task (Task {timing, ...}) = Synchronized.value timing;
|
wenzelm@42559
|
121 |
|
wenzelm@42561
|
122 |
fun update_timing update (Task {timing, ...}) e =
|
wenzelm@42576
|
123 |
uninterruptible (fn restore_attributes => fn () =>
|
wenzelm@42576
|
124 |
let
|
wenzelm@42576
|
125 |
val start = Time.now ();
|
wenzelm@42576
|
126 |
val result = Exn.capture (restore_attributes e) ();
|
wenzelm@42576
|
127 |
val t = Time.- (Time.now (), start);
|
wenzelm@42576
|
128 |
val _ = Synchronized.change timing (update t);
|
wenzelm@42576
|
129 |
in Exn.release result end) ();
|
wenzelm@42541
|
130 |
|
wenzelm@42544
|
131 |
fun task_ord (Task {id = id1, pri = pri1, ...}, Task {id = id2, pri = pri2, ...}) =
|
wenzelm@42544
|
132 |
prod_ord (rev_order o option_ord int_ord) int_ord ((pri1, id1), (pri2, id2));
|
wenzelm@42541
|
133 |
|
wenzelm@35242
|
134 |
end;
|
wenzelm@35242
|
135 |
|
wenzelm@42580
|
136 |
structure Tasks = Table(type key = task val ord = task_ord);
|
wenzelm@31972
|
137 |
structure Task_Graph = Graph(type key = task val ord = task_ord);
|
wenzelm@29122
|
138 |
|
wenzelm@29122
|
139 |
|
wenzelm@42566
|
140 |
(* timing *)
|
wenzelm@42566
|
141 |
|
wenzelm@42566
|
142 |
fun running task =
|
wenzelm@42566
|
143 |
update_timing (fn t => fn (a, b, ds) => (Time.+ (a, t), b, ds)) task;
|
wenzelm@42566
|
144 |
|
wenzelm@42566
|
145 |
fun joining task =
|
wenzelm@42566
|
146 |
update_timing (fn t => fn (a, b, ds) => (Time.- (a, t), b, ds)) task;
|
wenzelm@42566
|
147 |
|
wenzelm@42566
|
148 |
fun waiting task deps =
|
wenzelm@42566
|
149 |
update_timing (fn t => fn (a, b, ds) =>
|
wenzelm@42576
|
150 |
(Time.- (a, t), Time.+ (b, t),
|
wenzelm@42576
|
151 |
if ! Multithreading.trace > 0
|
wenzelm@42576
|
152 |
then fold (insert (op =) o name_of_task) deps ds else ds)) task;
|
wenzelm@42566
|
153 |
|
wenzelm@42566
|
154 |
|
wenzelm@28165
|
155 |
|
wenzelm@42561
|
156 |
(** queue of jobs and groups **)
|
wenzelm@42561
|
157 |
|
wenzelm@42580
|
158 |
(* known group members *)
|
wenzelm@42580
|
159 |
|
wenzelm@42580
|
160 |
type groups = unit Tasks.table Inttab.table;
|
wenzelm@42580
|
161 |
|
wenzelm@42580
|
162 |
fun get_tasks (groups: groups) gid =
|
wenzelm@42580
|
163 |
the_default Tasks.empty (Inttab.lookup groups gid);
|
wenzelm@42580
|
164 |
|
wenzelm@42580
|
165 |
fun add_task (gid, task) groups =
|
wenzelm@42580
|
166 |
Inttab.update (gid, Tasks.update (task, ()) (get_tasks groups gid)) groups;
|
wenzelm@42580
|
167 |
|
wenzelm@42580
|
168 |
fun del_task (gid, task) groups =
|
wenzelm@42580
|
169 |
let val tasks = Tasks.delete_safe task (get_tasks groups gid) in
|
wenzelm@42580
|
170 |
if Tasks.is_empty tasks then Inttab.delete_safe gid groups
|
wenzelm@42580
|
171 |
else Inttab.update (gid, tasks) groups
|
wenzelm@42580
|
172 |
end;
|
wenzelm@42580
|
173 |
|
wenzelm@42580
|
174 |
|
wenzelm@42580
|
175 |
(* job dependency graph *)
|
wenzelm@28165
|
176 |
|
wenzelm@28165
|
177 |
datatype job =
|
wenzelm@29369
|
178 |
Job of (bool -> bool) list |
|
wenzelm@34277
|
179 |
Running of Thread.thread |
|
wenzelm@38122
|
180 |
Passive of unit -> bool;
|
wenzelm@28165
|
181 |
|
wenzelm@42563
|
182 |
type jobs = job Task_Graph.T;
|
wenzelm@28176
|
183 |
|
wenzelm@42563
|
184 |
fun get_job (jobs: jobs) task = Task_Graph.get_node jobs task;
|
wenzelm@42563
|
185 |
fun set_job task job (jobs: jobs) = Task_Graph.map_node task (K job) jobs;
|
wenzelm@28202
|
186 |
|
wenzelm@32254
|
187 |
fun add_job task dep (jobs: jobs) =
|
wenzelm@32254
|
188 |
Task_Graph.add_edge (dep, task) jobs handle Task_Graph.UNDEF _ => jobs;
|
wenzelm@32254
|
189 |
|
wenzelm@28176
|
190 |
|
wenzelm@42561
|
191 |
(* queue *)
|
wenzelm@28176
|
192 |
|
wenzelm@42580
|
193 |
datatype queue = Queue of {groups: groups, jobs: jobs};
|
wenzelm@28165
|
194 |
|
wenzelm@34280
|
195 |
fun make_queue groups jobs = Queue {groups = groups, jobs = jobs};
|
wenzelm@34280
|
196 |
val empty = make_queue Inttab.empty Task_Graph.empty;
|
wenzelm@34277
|
197 |
|
wenzelm@42579
|
198 |
fun known_task (Queue {jobs, ...}) task = can (Task_Graph.get_entry jobs) task;
|
wenzelm@42579
|
199 |
|
wenzelm@38122
|
200 |
|
wenzelm@38122
|
201 |
(* job status *)
|
wenzelm@38122
|
202 |
|
wenzelm@42563
|
203 |
fun ready_job task (Job list, ([], _)) = SOME (task, rev list)
|
wenzelm@42563
|
204 |
| ready_job task (Passive abort, ([], _)) =
|
wenzelm@42563
|
205 |
if is_canceled (group_of_task task) then SOME (task, [fn _ => abort ()])
|
wenzelm@38122
|
206 |
else NONE
|
wenzelm@38122
|
207 |
| ready_job _ _ = NONE;
|
wenzelm@38122
|
208 |
|
wenzelm@42563
|
209 |
fun active_job (_, (Job _, _)) = SOME ()
|
wenzelm@42563
|
210 |
| active_job (_, (Running _, _)) = SOME ()
|
wenzelm@42563
|
211 |
| active_job (task, (Passive _, _)) =
|
wenzelm@42563
|
212 |
if is_canceled (group_of_task task) then SOME () else NONE;
|
wenzelm@38122
|
213 |
|
wenzelm@42563
|
214 |
fun all_passive (Queue {jobs, ...}) = is_none (Task_Graph.get_first active_job jobs);
|
wenzelm@28165
|
215 |
|
wenzelm@28165
|
216 |
|
wenzelm@32121
|
217 |
(* queue status *)
|
wenzelm@32052
|
218 |
|
wenzelm@32052
|
219 |
fun status (Queue {jobs, ...}) =
|
wenzelm@32052
|
220 |
let
|
wenzelm@34277
|
221 |
val (x, y, z, w) =
|
wenzelm@42563
|
222 |
Task_Graph.fold (fn (_, (job, (deps, _))) => fn (x, y, z, w) =>
|
wenzelm@32052
|
223 |
(case job of
|
wenzelm@38122
|
224 |
Job _ => if null deps then (x + 1, y, z, w) else (x, y + 1, z, w)
|
wenzelm@34277
|
225 |
| Running _ => (x, y, z + 1, w)
|
wenzelm@38122
|
226 |
| Passive _ => (x, y, z, w + 1)))
|
wenzelm@34277
|
227 |
jobs (0, 0, 0, 0);
|
wenzelm@34277
|
228 |
in {ready = x, pending = y, running = z, passive = w} end;
|
wenzelm@32052
|
229 |
|
wenzelm@32052
|
230 |
|
wenzelm@42561
|
231 |
|
wenzelm@42561
|
232 |
(** task queue operations **)
|
wenzelm@42561
|
233 |
|
wenzelm@32121
|
234 |
(* cancel -- peers and sub-groups *)
|
wenzelm@32121
|
235 |
|
wenzelm@34280
|
236 |
fun cancel (Queue {groups, jobs}) group =
|
wenzelm@32121
|
237 |
let
|
wenzelm@32121
|
238 |
val _ = cancel_group group Exn.Interrupt;
|
wenzelm@32121
|
239 |
val running =
|
wenzelm@42580
|
240 |
Tasks.fold (#1 #> get_job jobs #> (fn Running t => insert Thread.equal t | _ => I))
|
wenzelm@42580
|
241 |
(get_tasks groups (group_id group)) [];
|
wenzelm@37216
|
242 |
val _ = List.app Simple_Thread.interrupt running;
|
wenzelm@34280
|
243 |
in null running end;
|
wenzelm@32121
|
244 |
|
wenzelm@38122
|
245 |
fun cancel_all (Queue {jobs, ...}) =
|
wenzelm@32121
|
246 |
let
|
wenzelm@42563
|
247 |
fun cancel_job (task, (job, _)) (groups, running) =
|
wenzelm@42563
|
248 |
let
|
wenzelm@42563
|
249 |
val group = group_of_task task;
|
wenzelm@42563
|
250 |
val _ = cancel_group group Exn.Interrupt;
|
wenzelm@42563
|
251 |
in
|
wenzelm@34277
|
252 |
(case job of
|
wenzelm@34277
|
253 |
Running t => (insert eq_group group groups, insert Thread.equal t running)
|
wenzelm@42563
|
254 |
| _ => (groups, running))
|
wenzelm@42563
|
255 |
end;
|
wenzelm@42563
|
256 |
val (running_groups, running) = Task_Graph.fold cancel_job jobs ([], []);
|
wenzelm@37216
|
257 |
val _ = List.app Simple_Thread.interrupt running;
|
wenzelm@34280
|
258 |
in running_groups end;
|
wenzelm@32121
|
259 |
|
wenzelm@32121
|
260 |
|
wenzelm@42561
|
261 |
(* finish *)
|
wenzelm@42561
|
262 |
|
wenzelm@42561
|
263 |
fun finish task (Queue {groups, jobs}) =
|
wenzelm@42561
|
264 |
let
|
wenzelm@42563
|
265 |
val group = group_of_task task;
|
wenzelm@42580
|
266 |
val groups' = group_ancestry (fn gid => del_task (gid, task)) group groups;
|
wenzelm@42561
|
267 |
val jobs' = Task_Graph.del_node task jobs;
|
wenzelm@42561
|
268 |
val maximal = null (Task_Graph.imm_succs jobs task);
|
wenzelm@42561
|
269 |
in (maximal, make_queue groups' jobs') end;
|
wenzelm@42561
|
270 |
|
wenzelm@42561
|
271 |
|
wenzelm@28185
|
272 |
(* enqueue *)
|
wenzelm@28165
|
273 |
|
wenzelm@38122
|
274 |
fun enqueue_passive group abort (Queue {groups, jobs}) =
|
wenzelm@34277
|
275 |
let
|
wenzelm@42563
|
276 |
val task = new_task group "passive" NONE;
|
wenzelm@42580
|
277 |
val groups' = group_ancestry (fn gid => add_task (gid, task)) group groups;
|
wenzelm@42563
|
278 |
val jobs' = jobs |> Task_Graph.new_node (task, Passive abort);
|
wenzelm@34280
|
279 |
in (task, make_queue groups' jobs') end;
|
wenzelm@34277
|
280 |
|
wenzelm@42544
|
281 |
fun enqueue name group deps pri job (Queue {groups, jobs}) =
|
wenzelm@28165
|
282 |
let
|
wenzelm@42563
|
283 |
val task = new_task group name (SOME pri);
|
wenzelm@42580
|
284 |
val groups' = group_ancestry (fn gid => add_task (gid, task)) group groups;
|
wenzelm@28185
|
285 |
val jobs' = jobs
|
wenzelm@42563
|
286 |
|> Task_Graph.new_node (task, Job [job])
|
wenzelm@42564
|
287 |
|> fold (add_job task) deps;
|
wenzelm@42579
|
288 |
in (task, make_queue groups' jobs') end;
|
wenzelm@28165
|
289 |
|
wenzelm@34280
|
290 |
fun extend task job (Queue {groups, jobs}) =
|
wenzelm@29369
|
291 |
(case try (get_job jobs) task of
|
wenzelm@34280
|
292 |
SOME (Job list) => SOME (make_queue groups (set_job task (Job (job :: list)) jobs))
|
wenzelm@29369
|
293 |
| _ => NONE);
|
wenzelm@29369
|
294 |
|
wenzelm@28185
|
295 |
|
wenzelm@28185
|
296 |
(* dequeue *)
|
wenzelm@28185
|
297 |
|
wenzelm@39520
|
298 |
fun dequeue_passive thread task (queue as Queue {groups, jobs}) =
|
wenzelm@39520
|
299 |
(case try (get_job jobs) task of
|
wenzelm@39520
|
300 |
SOME (Passive _) =>
|
wenzelm@39520
|
301 |
let val jobs' = set_job task (Running thread) jobs
|
wenzelm@39520
|
302 |
in (true, make_queue groups jobs') end
|
wenzelm@39520
|
303 |
| _ => (false, queue));
|
wenzelm@39520
|
304 |
|
wenzelm@34280
|
305 |
fun dequeue thread (queue as Queue {groups, jobs}) =
|
wenzelm@38122
|
306 |
(case Task_Graph.get_first (uncurry ready_job) jobs of
|
wenzelm@42563
|
307 |
SOME (result as (task, _)) =>
|
wenzelm@38122
|
308 |
let val jobs' = set_job task (Running thread) jobs
|
wenzelm@39520
|
309 |
in (SOME result, make_queue groups jobs') end
|
wenzelm@39520
|
310 |
| NONE => (NONE, queue));
|
wenzelm@28202
|
311 |
|
wenzelm@28176
|
312 |
|
wenzelm@42561
|
313 |
(* dequeue wrt. dynamic dependencies *)
|
wenzelm@32071
|
314 |
|
wenzelm@42566
|
315 |
fun dequeue_deps thread deps (queue as Queue {groups, jobs}) =
|
wenzelm@32071
|
316 |
let
|
wenzelm@42564
|
317 |
fun ready [] rest = (NONE, rev rest)
|
wenzelm@42564
|
318 |
| ready (task :: tasks) rest =
|
wenzelm@42564
|
319 |
(case try (Task_Graph.get_entry jobs) task of
|
wenzelm@42564
|
320 |
NONE => ready tasks rest
|
wenzelm@44700
|
321 |
| SOME (_, entry) =>
|
wenzelm@42564
|
322 |
(case ready_job task entry of
|
wenzelm@42564
|
323 |
NONE => ready tasks (task :: rest)
|
wenzelm@42564
|
324 |
| some => (some, List.revAppend (rest, tasks))));
|
wenzelm@42564
|
325 |
|
wenzelm@42564
|
326 |
fun ready_dep _ [] = NONE
|
wenzelm@42564
|
327 |
| ready_dep seen (task :: tasks) =
|
wenzelm@42580
|
328 |
if Tasks.defined seen task then ready_dep seen tasks
|
wenzelm@42564
|
329 |
else
|
wenzelm@44700
|
330 |
let val entry as (_, (ds, _)) = #2 (Task_Graph.get_entry jobs task) in
|
wenzelm@42564
|
331 |
(case ready_job task entry of
|
wenzelm@42580
|
332 |
NONE => ready_dep (Tasks.update (task, ()) seen) (ds @ tasks)
|
wenzelm@42564
|
333 |
| some => some)
|
wenzelm@42564
|
334 |
end;
|
wenzelm@42564
|
335 |
|
wenzelm@42564
|
336 |
fun result (res as (task, _)) deps' =
|
wenzelm@34280
|
337 |
let val jobs' = set_job task (Running thread) jobs
|
wenzelm@42566
|
338 |
in ((SOME res, deps'), make_queue groups jobs') end;
|
wenzelm@32071
|
339 |
in
|
wenzelm@42564
|
340 |
(case ready deps [] of
|
wenzelm@42564
|
341 |
(SOME res, deps') => result res deps'
|
wenzelm@42564
|
342 |
| (NONE, deps') =>
|
wenzelm@42580
|
343 |
(case ready_dep Tasks.empty deps' of
|
wenzelm@42564
|
344 |
SOME res => result res deps'
|
wenzelm@42566
|
345 |
| NONE => ((NONE, deps'), queue)))
|
wenzelm@32071
|
346 |
end;
|
wenzelm@32071
|
347 |
|
wenzelm@42561
|
348 |
end;
|