wenzelm@28165
|
1 |
(* Title: Pure/Concurrent/task_queue.ML
|
wenzelm@28165
|
2 |
ID: $Id$
|
wenzelm@28165
|
3 |
Author: Makarius
|
wenzelm@28165
|
4 |
|
wenzelm@28165
|
5 |
Ordered queue of grouped tasks.
|
wenzelm@28165
|
6 |
*)
|
wenzelm@28165
|
7 |
|
wenzelm@28165
|
8 |
signature TASK_QUEUE =
|
wenzelm@28165
|
9 |
sig
|
wenzelm@28165
|
10 |
eqtype task
|
wenzelm@29003
|
11 |
val new_task: unit -> task
|
wenzelm@28196
|
12 |
val str_of_task: task -> string
|
wenzelm@28165
|
13 |
eqtype group
|
wenzelm@28165
|
14 |
val new_group: unit -> group
|
wenzelm@28551
|
15 |
val invalidate_group: group -> unit
|
wenzelm@28179
|
16 |
val str_of_group: group -> string
|
wenzelm@28165
|
17 |
type queue
|
wenzelm@28165
|
18 |
val empty: queue
|
wenzelm@28204
|
19 |
val is_empty: queue -> bool
|
wenzelm@28304
|
20 |
val enqueue: group -> task list -> bool -> (bool -> bool) -> queue -> task * queue
|
wenzelm@28185
|
21 |
val depend: task list -> task -> queue -> queue
|
wenzelm@28202
|
22 |
val focus: task list -> queue -> queue
|
wenzelm@28185
|
23 |
val dequeue: queue -> (task * group * (unit -> bool)) option * queue
|
wenzelm@28384
|
24 |
val dequeue_towards: task list -> queue ->
|
wenzelm@28384
|
25 |
(((task * group * (unit -> bool)) * task list) option * queue)
|
wenzelm@28190
|
26 |
val interrupt: queue -> task -> unit
|
wenzelm@28190
|
27 |
val interrupt_external: queue -> string -> unit
|
wenzelm@28176
|
28 |
val finish: task -> queue -> queue
|
wenzelm@28190
|
29 |
val cancel: queue -> group -> bool
|
wenzelm@28165
|
30 |
end;
|
wenzelm@28165
|
31 |
|
wenzelm@28171
|
32 |
structure TaskQueue: TASK_QUEUE =
|
wenzelm@28165
|
33 |
struct
|
wenzelm@28165
|
34 |
|
wenzelm@28168
|
35 |
(* identifiers *)
|
wenzelm@28165
|
36 |
|
wenzelm@28165
|
37 |
datatype task = Task of serial;
|
wenzelm@29003
|
38 |
fun new_task () = Task (serial ());
|
wenzelm@29003
|
39 |
|
wenzelm@28190
|
40 |
fun str_of_task (Task i) = string_of_int i;
|
wenzelm@28165
|
41 |
|
wenzelm@29003
|
42 |
|
wenzelm@28190
|
43 |
datatype group = Group of serial * bool ref;
|
wenzelm@28551
|
44 |
|
wenzelm@28190
|
45 |
fun new_group () = Group (serial (), ref true);
|
wenzelm@28551
|
46 |
fun invalidate_group (Group (_, ok)) = ok := false;
|
wenzelm@28165
|
47 |
|
wenzelm@28190
|
48 |
fun str_of_group (Group (i, ref ok)) =
|
wenzelm@28190
|
49 |
if ok then string_of_int i else enclose "(" ")" (string_of_int i);
|
wenzelm@28179
|
50 |
|
wenzelm@28165
|
51 |
|
wenzelm@28176
|
52 |
(* jobs *)
|
wenzelm@28165
|
53 |
|
wenzelm@28165
|
54 |
datatype job =
|
wenzelm@28304
|
55 |
Job of bool * (bool -> bool) | (*priority, job: status -> status*)
|
wenzelm@28165
|
56 |
Running of Thread.thread;
|
wenzelm@28165
|
57 |
|
wenzelm@28176
|
58 |
type jobs = (group * job) IntGraph.T;
|
wenzelm@28176
|
59 |
|
wenzelm@28176
|
60 |
fun get_group (jobs: jobs) (Task id) = #1 (IntGraph.get_node jobs id);
|
wenzelm@28176
|
61 |
fun get_job (jobs: jobs) (Task id) = #2 (IntGraph.get_node jobs id);
|
wenzelm@28176
|
62 |
fun map_job (Task id) f (jobs: jobs) = IntGraph.map_node id (apsnd f) jobs;
|
wenzelm@28202
|
63 |
|
wenzelm@28185
|
64 |
fun add_job (Task id) (Task dep) (jobs: jobs) =
|
wenzelm@29117
|
65 |
IntGraph.add_edge (dep, id) jobs handle IntGraph.UNDEF _ => jobs;
|
wenzelm@29117
|
66 |
|
wenzelm@29117
|
67 |
fun add_job_acyclic (Task id) (Task dep) (jobs: jobs) =
|
wenzelm@28185
|
68 |
IntGraph.add_edge_acyclic (dep, id) jobs handle IntGraph.UNDEF _ => jobs;
|
wenzelm@28176
|
69 |
|
wenzelm@28202
|
70 |
fun check_job (jobs: jobs) (task as Task id) =
|
wenzelm@28202
|
71 |
if can (IntGraph.get_node jobs) id then SOME task else NONE;
|
wenzelm@28202
|
72 |
|
wenzelm@28176
|
73 |
|
wenzelm@28176
|
74 |
(* queue of grouped jobs *)
|
wenzelm@28176
|
75 |
|
wenzelm@28165
|
76 |
datatype queue = Queue of
|
wenzelm@28184
|
77 |
{groups: task list Inttab.table, (*groups with presently active members*)
|
wenzelm@28202
|
78 |
jobs: jobs, (*job dependency graph*)
|
wenzelm@28202
|
79 |
focus: task list}; (*particular collection of high-priority tasks*)
|
wenzelm@28165
|
80 |
|
wenzelm@28202
|
81 |
fun make_queue groups jobs focus = Queue {groups = groups, jobs = jobs, focus = focus};
|
wenzelm@28204
|
82 |
|
wenzelm@28202
|
83 |
val empty = make_queue Inttab.empty IntGraph.empty [];
|
wenzelm@28204
|
84 |
fun is_empty (Queue {jobs, ...}) = IntGraph.is_empty jobs;
|
wenzelm@28165
|
85 |
|
wenzelm@28165
|
86 |
|
wenzelm@28185
|
87 |
(* enqueue *)
|
wenzelm@28165
|
88 |
|
wenzelm@28304
|
89 |
fun enqueue (group as Group (gid, _)) deps pri job (Queue {groups, jobs, focus}) =
|
wenzelm@28165
|
90 |
let
|
wenzelm@29003
|
91 |
val task as Task id = new_task ();
|
wenzelm@28176
|
92 |
val groups' = Inttab.cons_list (gid, task) groups;
|
wenzelm@28185
|
93 |
val jobs' = jobs
|
wenzelm@28304
|
94 |
|> IntGraph.new_node (id, (group, Job (pri, job))) |> fold (add_job task) deps;
|
wenzelm@28202
|
95 |
in (task, make_queue groups' jobs' focus) end;
|
wenzelm@28165
|
96 |
|
wenzelm@28202
|
97 |
fun depend deps task (Queue {groups, jobs, focus}) =
|
wenzelm@29117
|
98 |
make_queue groups (fold (add_job_acyclic task) deps jobs) focus;
|
wenzelm@28202
|
99 |
|
wenzelm@28202
|
100 |
fun focus tasks (Queue {groups, jobs, ...}) =
|
wenzelm@28202
|
101 |
make_queue groups jobs (map_filter (check_job jobs) tasks);
|
wenzelm@28185
|
102 |
|
wenzelm@28185
|
103 |
|
wenzelm@28185
|
104 |
(* dequeue *)
|
wenzelm@28185
|
105 |
|
wenzelm@28202
|
106 |
local
|
wenzelm@28202
|
107 |
|
wenzelm@28202
|
108 |
fun dequeue_result NONE queue = (NONE, queue)
|
wenzelm@28202
|
109 |
| dequeue_result (SOME (result as (task, _, _))) (Queue {groups, jobs, focus}) =
|
wenzelm@28202
|
110 |
(SOME result, make_queue groups (map_job task (K (Running (Thread.self ()))) jobs) focus);
|
wenzelm@28202
|
111 |
|
wenzelm@28304
|
112 |
fun dequeue_global req_pri (queue as Queue {jobs, ...}) =
|
wenzelm@28165
|
113 |
let
|
wenzelm@28304
|
114 |
fun ready (id, ((group as Group (_, ref ok), Job (pri, job)), ([], _))) =
|
wenzelm@28304
|
115 |
if pri = req_pri then SOME (Task id, group, (fn () => job ok)) else NONE
|
wenzelm@28184
|
116 |
| ready _ = NONE;
|
wenzelm@28202
|
117 |
in dequeue_result (IntGraph.get_first ready jobs) queue end;
|
wenzelm@28165
|
118 |
|
wenzelm@28202
|
119 |
fun dequeue_local focus (queue as Queue {jobs, ...}) =
|
wenzelm@28202
|
120 |
let
|
wenzelm@28202
|
121 |
fun ready id =
|
wenzelm@28202
|
122 |
(case IntGraph.get_node jobs id of
|
wenzelm@28304
|
123 |
(group as Group (_, ref ok), Job (_, job)) =>
|
wenzelm@28202
|
124 |
if null (IntGraph.imm_preds jobs id) then SOME (Task id, group, (fn () => job ok))
|
wenzelm@28202
|
125 |
else NONE
|
wenzelm@28202
|
126 |
| _ => NONE);
|
wenzelm@28202
|
127 |
val ids = map (fn Task id => id) focus;
|
wenzelm@28202
|
128 |
in dequeue_result (get_first ready (IntGraph.all_preds jobs ids)) queue end;
|
wenzelm@28202
|
129 |
|
wenzelm@28202
|
130 |
in
|
wenzelm@28202
|
131 |
|
wenzelm@28202
|
132 |
fun dequeue (queue as Queue {focus, ...}) =
|
wenzelm@28304
|
133 |
(case dequeue_local focus queue of
|
wenzelm@28304
|
134 |
(NONE, _) =>
|
wenzelm@28304
|
135 |
(case dequeue_global true queue of (NONE, _) => dequeue_global false queue | res => res)
|
wenzelm@28304
|
136 |
| res => res);
|
wenzelm@28185
|
137 |
|
wenzelm@28185
|
138 |
fun dequeue_towards tasks (queue as Queue {jobs, ...}) =
|
wenzelm@28384
|
139 |
let val tasks' = map_filter (check_job jobs) tasks in
|
wenzelm@28384
|
140 |
(case dequeue_local tasks' queue of
|
wenzelm@28384
|
141 |
(NONE, queue') => (NONE, queue')
|
wenzelm@28384
|
142 |
| (SOME work, queue') => (SOME (work, tasks'), queue'))
|
wenzelm@28384
|
143 |
end;
|
wenzelm@28202
|
144 |
|
wenzelm@28202
|
145 |
end;
|
wenzelm@28185
|
146 |
|
wenzelm@28176
|
147 |
|
wenzelm@28190
|
148 |
(* sporadic interrupts *)
|
wenzelm@28190
|
149 |
|
wenzelm@28190
|
150 |
fun interrupt (Queue {jobs, ...}) task =
|
wenzelm@28551
|
151 |
(case try (get_job jobs) task of SOME (Running thread) => SimpleThread.interrupt thread | _ => ());
|
wenzelm@28190
|
152 |
|
wenzelm@28190
|
153 |
fun interrupt_external queue str =
|
wenzelm@28190
|
154 |
(case Int.fromString str of SOME id => interrupt queue (Task id) | NONE => ());
|
wenzelm@28190
|
155 |
|
wenzelm@28190
|
156 |
|
wenzelm@28202
|
157 |
(* misc operations *)
|
wenzelm@28176
|
158 |
|
wenzelm@28551
|
159 |
fun cancel (Queue {groups, jobs, ...}) (group as Group (gid, _)) =
|
wenzelm@28165
|
160 |
let
|
wenzelm@28551
|
161 |
val _ = invalidate_group group;
|
wenzelm@28176
|
162 |
val tasks = Inttab.lookup_list groups gid;
|
wenzelm@28176
|
163 |
val running = fold (get_job jobs #> (fn Running thread => cons thread | _ => I)) tasks [];
|
wenzelm@28551
|
164 |
val _ = List.app SimpleThread.interrupt running;
|
wenzelm@28190
|
165 |
in null running end;
|
wenzelm@28176
|
166 |
|
wenzelm@28202
|
167 |
fun finish (task as Task id) (Queue {groups, jobs, focus}) =
|
wenzelm@28176
|
168 |
let
|
wenzelm@28190
|
169 |
val Group (gid, _) = get_group jobs task;
|
wenzelm@28176
|
170 |
val groups' = Inttab.remove_list (op =) (gid, task) groups;
|
wenzelm@28332
|
171 |
val jobs' = IntGraph.del_node id jobs;
|
wenzelm@28202
|
172 |
val focus' = remove (op =) task focus;
|
wenzelm@28202
|
173 |
in make_queue groups' jobs' focus' end;
|
wenzelm@28165
|
174 |
|
wenzelm@28165
|
175 |
end;
|