| author | wenzelm | 
| Sun, 17 Feb 2019 22:15:02 +0100 | |
| changeset 69817 | 5f160df596c1 | 
| parent 69255 | 800b1ce96fce | 
| child 69818 | 60d0ee8f2ddb | 
| permissions | -rw-r--r-- | 
| 68758 | 1 | /* Title: Pure/PIDE/document_status.scala | 
| 2 | Author: Makarius | |
| 3 | ||
| 4 | Document status based on markup information. | |
| 5 | */ | |
| 6 | ||
| 7 | package isabelle | |
| 8 | ||
| 9 | ||
| 10 | object Document_Status | |
| 11 | {
 | |
| 12 | /* command status */ | |
| 13 | ||
| 14 | object Command_Status | |
| 15 |   {
 | |
| 16 | val proper_elements: Markup.Elements = | |
| 17 | Markup.Elements(Markup.ACCEPTED, Markup.FORKED, Markup.JOINED, Markup.RUNNING, | |
| 68871 
f5c76072db55
more explicit status for "canceled" command within theory node;
 wenzelm parents: 
68770diff
changeset | 18 | Markup.FINISHED, Markup.FAILED, Markup.CANCELED) | 
| 68758 | 19 | |
| 20 | val liberal_elements: Markup.Elements = | |
| 21 | proper_elements + Markup.WARNING + Markup.LEGACY + Markup.ERROR | |
| 22 | ||
| 23 | def make(markup_iterator: Iterator[Markup]): Command_Status = | |
| 24 |     {
 | |
| 25 | var touched = false | |
| 26 | var accepted = false | |
| 27 | var warned = false | |
| 28 | var failed = false | |
| 68871 
f5c76072db55
more explicit status for "canceled" command within theory node;
 wenzelm parents: 
68770diff
changeset | 29 | var canceled = false | 
| 68884 
9b97d0b20d95
clarified quasi_consolidated state: ensure that exports are present for ok nodes;
 wenzelm parents: 
68883diff
changeset | 30 | var finalized = false | 
| 68758 | 31 | var forks = 0 | 
| 32 | var runs = 0 | |
| 33 |       for (markup <- markup_iterator) {
 | |
| 34 |         markup.name match {
 | |
| 35 | case Markup.ACCEPTED => accepted = true | |
| 36 | case Markup.FORKED => touched = true; forks += 1 | |
| 37 | case Markup.JOINED => forks -= 1 | |
| 38 | case Markup.RUNNING => touched = true; runs += 1 | |
| 39 | case Markup.FINISHED => runs -= 1 | |
| 40 | case Markup.WARNING | Markup.LEGACY => warned = true | |
| 41 | case Markup.FAILED | Markup.ERROR => failed = true | |
| 68871 
f5c76072db55
more explicit status for "canceled" command within theory node;
 wenzelm parents: 
68770diff
changeset | 42 | case Markup.CANCELED => canceled = true | 
| 68884 
9b97d0b20d95
clarified quasi_consolidated state: ensure that exports are present for ok nodes;
 wenzelm parents: 
68883diff
changeset | 43 | case Markup.FINALIZED => finalized = true | 
| 68758 | 44 | case _ => | 
| 45 | } | |
| 46 | } | |
| 68887 | 47 | Command_Status( | 
| 48 | touched = touched, | |
| 49 | accepted = accepted, | |
| 50 | warned = warned, | |
| 51 | failed = failed, | |
| 52 | canceled = canceled, | |
| 53 | finalized = finalized, | |
| 54 | forks = forks, | |
| 55 | runs = runs) | |
| 68758 | 56 | } | 
| 57 | ||
| 58 | val empty = make(Iterator.empty) | |
| 59 | ||
| 60 | def merge(status_iterator: Iterator[Command_Status]): Command_Status = | |
| 61 |       if (status_iterator.hasNext) {
 | |
| 62 | val status0 = status_iterator.next | |
| 63 | (status0 /: status_iterator)(_ + _) | |
| 64 | } | |
| 65 | else empty | |
| 66 | } | |
| 67 | ||
| 68 | sealed case class Command_Status( | |
| 69 | private val touched: Boolean, | |
| 70 | private val accepted: Boolean, | |
| 71 | private val warned: Boolean, | |
| 72 | private val failed: Boolean, | |
| 68871 
f5c76072db55
more explicit status for "canceled" command within theory node;
 wenzelm parents: 
68770diff
changeset | 73 | private val canceled: Boolean, | 
| 68884 
9b97d0b20d95
clarified quasi_consolidated state: ensure that exports are present for ok nodes;
 wenzelm parents: 
68883diff
changeset | 74 | private val finalized: Boolean, | 
| 68758 | 75 | forks: Int, | 
| 76 | runs: Int) | |
| 77 |   {
 | |
| 78 | def + (that: Command_Status): Command_Status = | |
| 79 | Command_Status( | |
| 68887 | 80 | touched = touched || that.touched, | 
| 81 | accepted = accepted || that.accepted, | |
| 82 | warned = warned || that.warned, | |
| 83 | failed = failed || that.failed, | |
| 84 | canceled = canceled || that.canceled, | |
| 85 | finalized = finalized || that.finalized, | |
| 86 | forks = forks + that.forks, | |
| 87 | runs = runs + that.runs) | |
| 68758 | 88 | |
| 89 | def is_unprocessed: Boolean = accepted && !failed && (!touched || (forks != 0 && runs == 0)) | |
| 90 | def is_running: Boolean = runs != 0 | |
| 91 | def is_warned: Boolean = warned | |
| 92 | def is_failed: Boolean = failed | |
| 93 | def is_finished: Boolean = !failed && touched && forks == 0 && runs == 0 | |
| 68871 
f5c76072db55
more explicit status for "canceled" command within theory node;
 wenzelm parents: 
68770diff
changeset | 94 | def is_canceled: Boolean = canceled | 
| 68884 
9b97d0b20d95
clarified quasi_consolidated state: ensure that exports are present for ok nodes;
 wenzelm parents: 
68883diff
changeset | 95 | def is_finalized: Boolean = finalized | 
| 68881 | 96 | def is_terminated: Boolean = canceled || touched && forks == 0 && runs == 0 | 
| 68758 | 97 | } | 
| 98 | ||
| 99 | ||
| 100 | /* node status */ | |
| 101 | ||
| 102 | object Node_Status | |
| 103 |   {
 | |
| 104 | def make( | |
| 105 | state: Document.State, | |
| 106 | version: Document.Version, | |
| 107 | name: Document.Node.Name): Node_Status = | |
| 108 |     {
 | |
| 109 | val node = version.nodes(name) | |
| 110 | ||
| 111 | var unprocessed = 0 | |
| 112 | var running = 0 | |
| 113 | var warned = 0 | |
| 114 | var failed = 0 | |
| 115 | var finished = 0 | |
| 68871 
f5c76072db55
more explicit status for "canceled" command within theory node;
 wenzelm parents: 
68770diff
changeset | 116 | var canceled = false | 
| 68892 | 117 | var terminated = true | 
| 68884 
9b97d0b20d95
clarified quasi_consolidated state: ensure that exports are present for ok nodes;
 wenzelm parents: 
68883diff
changeset | 118 | var finalized = false | 
| 68758 | 119 |       for (command <- node.commands.iterator) {
 | 
| 120 | val states = state.command_states(version, command) | |
| 121 | val status = Command_Status.merge(states.iterator.map(_.document_status)) | |
| 122 | ||
| 123 | if (status.is_running) running += 1 | |
| 124 | else if (status.is_failed) failed += 1 | |
| 125 | else if (status.is_warned) warned += 1 | |
| 126 | else if (status.is_finished) finished += 1 | |
| 127 | else unprocessed += 1 | |
| 68871 
f5c76072db55
more explicit status for "canceled" command within theory node;
 wenzelm parents: 
68770diff
changeset | 128 | |
| 
f5c76072db55
more explicit status for "canceled" command within theory node;
 wenzelm parents: 
68770diff
changeset | 129 | if (status.is_canceled) canceled = true | 
| 68892 | 130 | if (!status.is_terminated) terminated = false | 
| 68884 
9b97d0b20d95
clarified quasi_consolidated state: ensure that exports are present for ok nodes;
 wenzelm parents: 
68883diff
changeset | 131 | if (status.is_finalized) finalized = true | 
| 68758 | 132 | } | 
| 133 | val initialized = state.node_initialized(version, name) | |
| 134 | val consolidated = state.node_consolidated(version, name) | |
| 135 | ||
| 68887 | 136 | Node_Status( | 
| 137 | unprocessed = unprocessed, | |
| 138 | running = running, | |
| 139 | warned = warned, | |
| 140 | failed = failed, | |
| 141 | finished = finished, | |
| 142 | canceled = canceled, | |
| 143 | terminated = terminated, | |
| 68889 | 144 | initialized = initialized, | 
| 68887 | 145 | finalized = finalized, | 
| 146 | consolidated = consolidated) | |
| 68758 | 147 | } | 
| 148 | } | |
| 149 | ||
| 150 | sealed case class Node_Status( | |
| 68887 | 151 | unprocessed: Int, | 
| 152 | running: Int, | |
| 153 | warned: Int, | |
| 154 | failed: Int, | |
| 155 | finished: Int, | |
| 156 | canceled: Boolean, | |
| 157 | terminated: Boolean, | |
| 68889 | 158 | initialized: Boolean, | 
| 68887 | 159 | finalized: Boolean, | 
| 68884 
9b97d0b20d95
clarified quasi_consolidated state: ensure that exports are present for ok nodes;
 wenzelm parents: 
68883diff
changeset | 160 | consolidated: Boolean) | 
| 68758 | 161 |   {
 | 
| 162 | def ok: Boolean = failed == 0 | |
| 163 | def total: Int = unprocessed + running + warned + failed + finished | |
| 164 | ||
| 68897 | 165 | def quasi_consolidated: Boolean = !finalized && terminated | 
| 166 | ||
| 68898 | 167 | def percentage: Int = | 
| 168 | if (consolidated) 100 | |
| 169 | else if (total == 0) 0 | |
| 170 | else (((total - unprocessed).toDouble / total) * 100).toInt min 99 | |
| 171 | ||
| 68758 | 172 | def json: JSON.Object.T = | 
| 173 |       JSON.Object("ok" -> ok, "total" -> total, "unprocessed" -> unprocessed,
 | |
| 174 | "running" -> running, "warned" -> warned, "failed" -> failed, "finished" -> finished, | |
| 68898 | 175 | "canceled" -> canceled, "consolidated" -> consolidated, | 
| 176 | "percentage" -> percentage) | |
| 68758 | 177 | } | 
| 178 | ||
| 179 | ||
| 180 | /* node timing */ | |
| 181 | ||
| 182 | object Node_Timing | |
| 183 |   {
 | |
| 184 | val empty: Node_Timing = Node_Timing(0.0, Map.empty) | |
| 185 | ||
| 186 | def make( | |
| 187 | state: Document.State, | |
| 188 | version: Document.Version, | |
| 189 | node: Document.Node, | |
| 190 | threshold: Double): Node_Timing = | |
| 191 |     {
 | |
| 192 | var total = 0.0 | |
| 193 | var commands = Map.empty[Command, Double] | |
| 194 |       for {
 | |
| 195 | command <- node.commands.iterator | |
| 196 | st <- state.command_states(version, command) | |
| 197 |       } {
 | |
| 198 | val command_timing = | |
| 199 |           (0.0 /: st.status)({
 | |
| 200 | case (timing, Markup.Timing(t)) => timing + t.elapsed.seconds | |
| 201 | case (timing, _) => timing | |
| 202 | }) | |
| 203 | total += command_timing | |
| 204 | if (command_timing >= threshold) commands += (command -> command_timing) | |
| 205 | } | |
| 206 | Node_Timing(total, commands) | |
| 207 | } | |
| 208 | } | |
| 209 | ||
| 210 | sealed case class Node_Timing(total: Double, commands: Map[Command, Double]) | |
| 68759 | 211 | |
| 212 | ||
| 213 | /* nodes status */ | |
| 214 | ||
| 215 | object Overall_Node_Status extends Enumeration | |
| 216 |   {
 | |
| 217 | val ok, failed, pending = Value | |
| 218 | } | |
| 219 | ||
| 220 | object Nodes_Status | |
| 221 |   {
 | |
| 68903 | 222 | val empty: Nodes_Status = new Nodes_Status(Map.empty, Document.Nodes.empty) | 
| 68759 | 223 | } | 
| 224 | ||
| 68903 | 225 | final class Nodes_Status private( | 
| 226 | private val rep: Map[Document.Node.Name, Node_Status], | |
| 227 | nodes: Document.Nodes) | |
| 68759 | 228 |   {
 | 
| 68770 
add44e2b8cb0
optional notification of nodes_status (via progress);
 wenzelm parents: 
68769diff
changeset | 229 | def is_empty: Boolean = rep.isEmpty | 
| 
add44e2b8cb0
optional notification of nodes_status (via progress);
 wenzelm parents: 
68769diff
changeset | 230 | def apply(name: Document.Node.Name): Node_Status = rep(name) | 
| 68759 | 231 | def get(name: Document.Node.Name): Option[Node_Status] = rep.get(name) | 
| 232 | ||
| 69817 
5f160df596c1
clarified Node_Status vs. is_suppressed, e.g. relevant for purged nodes in Theories_Dockable after 0626cae56b6f;
 wenzelm parents: 
69255diff
changeset | 233 | def present(snapshot: Document.Snapshot): List[(Document.Node.Name, Node_Status)] = | 
| 
5f160df596c1
clarified Node_Status vs. is_suppressed, e.g. relevant for purged nodes in Theories_Dockable after 0626cae56b6f;
 wenzelm parents: 
69255diff
changeset | 234 |       (for {
 | 
| 
5f160df596c1
clarified Node_Status vs. is_suppressed, e.g. relevant for purged nodes in Theories_Dockable after 0626cae56b6f;
 wenzelm parents: 
69255diff
changeset | 235 | name <- nodes.topological_order.iterator | 
| 
5f160df596c1
clarified Node_Status vs. is_suppressed, e.g. relevant for purged nodes in Theories_Dockable after 0626cae56b6f;
 wenzelm parents: 
69255diff
changeset | 236 | node_status <- get(name) | 
| 
5f160df596c1
clarified Node_Status vs. is_suppressed, e.g. relevant for purged nodes in Theories_Dockable after 0626cae56b6f;
 wenzelm parents: 
69255diff
changeset | 237 | if !snapshot.version.nodes.is_suppressed(name) | 
| 
5f160df596c1
clarified Node_Status vs. is_suppressed, e.g. relevant for purged nodes in Theories_Dockable after 0626cae56b6f;
 wenzelm parents: 
69255diff
changeset | 238 | } yield (name, node_status)).toList | 
| 68903 | 239 | |
| 68884 
9b97d0b20d95
clarified quasi_consolidated state: ensure that exports are present for ok nodes;
 wenzelm parents: 
68883diff
changeset | 240 | def quasi_consolidated(name: Document.Node.Name): Boolean = | 
| 68883 
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
 wenzelm parents: 
68881diff
changeset | 241 |       rep.get(name) match {
 | 
| 68897 | 242 | case Some(st) => st.quasi_consolidated | 
| 68883 
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
 wenzelm parents: 
68881diff
changeset | 243 | case None => false | 
| 
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
 wenzelm parents: 
68881diff
changeset | 244 | } | 
| 
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
 wenzelm parents: 
68881diff
changeset | 245 | |
| 68759 | 246 | def overall_node_status(name: Document.Node.Name): Overall_Node_Status.Value = | 
| 247 |       rep.get(name) match {
 | |
| 248 | case Some(st) if st.consolidated => | |
| 249 | if (st.ok) Overall_Node_Status.ok else Overall_Node_Status.failed | |
| 250 | case _ => Overall_Node_Status.pending | |
| 251 | } | |
| 252 | ||
| 68763 | 253 | def update( | 
| 69255 
800b1ce96fce
more general support for Isabelle/PIDE file formats -- less hardwired Bibtex operations;
 wenzelm parents: 
68904diff
changeset | 254 | resources: Resources, | 
| 68763 | 255 | state: Document.State, | 
| 256 | version: Document.Version, | |
| 68769 | 257 | domain: Option[Set[Document.Node.Name]] = None, | 
| 68903 | 258 | trim: Boolean = false): (Boolean, Nodes_Status) = | 
| 68763 | 259 |     {
 | 
| 68903 | 260 | val nodes1 = version.nodes | 
| 68763 | 261 | val update_iterator = | 
| 262 |         for {
 | |
| 68903 | 263 | name <- domain.getOrElse(nodes1.domain).iterator | 
| 69817 
5f160df596c1
clarified Node_Status vs. is_suppressed, e.g. relevant for purged nodes in Theories_Dockable after 0626cae56b6f;
 wenzelm parents: 
69255diff
changeset | 264 | if !resources.is_hidden(name) && !resources.session_base.loaded_theory(name) | 
| 68763 | 265 | st = Document_Status.Node_Status.make(state, version, name) | 
| 266 | if !rep.isDefinedAt(name) || rep(name) != st | |
| 267 | } yield (name -> st) | |
| 268 | val rep1 = rep ++ update_iterator | |
| 68903 | 269 | val rep2 = if (trim) rep1 -- rep1.keysIterator.filterNot(nodes1.domain) else rep1 | 
| 68764 | 270 | |
| 68903 | 271 | (rep != rep2, new Nodes_Status(rep2, nodes1)) | 
| 68763 | 272 | } | 
| 68761 | 273 | |
| 68759 | 274 | override def hashCode: Int = rep.hashCode | 
| 275 | override def equals(that: Any): Boolean = | |
| 276 |       that match {
 | |
| 277 | case other: Nodes_Status => rep == other.rep | |
| 278 | case _ => false | |
| 279 | } | |
| 68765 | 280 | |
| 281 | override def toString: String = | |
| 282 |     {
 | |
| 283 | var ok = 0 | |
| 284 | var failed = 0 | |
| 285 | var pending = 0 | |
| 68873 | 286 | var canceled = 0 | 
| 68765 | 287 |       for (name <- rep.keysIterator) {
 | 
| 288 |         overall_node_status(name) match {
 | |
| 289 | case Overall_Node_Status.ok => ok += 1 | |
| 290 | case Overall_Node_Status.failed => failed += 1 | |
| 291 | case Overall_Node_Status.pending => pending += 1 | |
| 292 | } | |
| 68873 | 293 | if (apply(name).canceled) canceled += 1 | 
| 68765 | 294 | } | 
| 68873 | 295 | "Nodes_Status(ok = " + ok + ", failed = " + failed + ", pending = " + pending + | 
| 296 | ", canceled = " + canceled + ")" | |
| 68765 | 297 | } | 
| 68759 | 298 | } | 
| 68758 | 299 | } |