future proofs: back to Future.fork_pri ~1 for improved parallelism;
authorwenzelm
Sun Jan 04 00:01:16 2009 +0100 (2009-01-04)
changeset 2934343ac99cdeb5b
parent 29342 23504001c4fb
child 29344 fc4a04a2970a
future proofs: back to Future.fork_pri ~1 for improved parallelism;
src/Pure/Isar/toplevel.ML
src/Pure/goal.ML
     1.1 --- a/src/Pure/Isar/toplevel.ML	Sun Jan 04 00:00:03 2009 +0100
     1.2 +++ b/src/Pure/Isar/toplevel.ML	Sun Jan 04 00:01:16 2009 +0100
     1.3 @@ -718,7 +718,7 @@
     1.4  
     1.5          val future_proof = Proof.future_proof
     1.6            (fn prf =>
     1.7 -            Future.fork_pri 1 (fn () =>
     1.8 +            Future.fork_pri ~1 (fn () =>
     1.9                let val (states, State (result_node, _)) =
    1.10                  (case st' of State (SOME (Proof (_, (_, orig_gthy)), exit), prev)
    1.11                    => State (SOME (Proof (ProofNode.init prf, (finish, orig_gthy)), exit), prev))
     2.1 --- a/src/Pure/goal.ML	Sun Jan 04 00:00:03 2009 +0100
     2.2 +++ b/src/Pure/goal.ML	Sun Jan 04 00:01:16 2009 +0100
     2.3 @@ -179,7 +179,7 @@
     2.4      val res =
     2.5        if immediate orelse #maxidx (Thm.rep_cterm stmt) >= 0 orelse not (Future.enabled ())
     2.6        then result ()
     2.7 -      else future_result ctxt' (Future.fork_pri 1 result) (Thm.term_of stmt);
     2.8 +      else future_result ctxt' (Future.fork_pri ~1 result) (Thm.term_of stmt);
     2.9    in
    2.10      Conjunction.elim_balanced (length props) res
    2.11      |> map (Assumption.export false ctxt' ctxt)