package coq-lsp
Language Server Protocol native server for Coq
Install
Dune Dependency
Authors
Maintainers
Sources
coq-lsp-0.1.5.8.16.tbz
sha256=5a0819d6ceb18cf031ece2c466eefd27f018d85c1c7472038bbb7c2663714b6e
sha512=be97b25db922014681dce75a68566b887f692c60208b698f03ce8b2fc0c1a2eab5c0c563d698eeb1d21dea5405468e958e67cce9a6c94a3106529f1b4ebfce13
doc/src/coq-lsp.fleche/doc.ml.html
Source file doc.ml
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 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799
(************************************************************************) (* Flèche => document manager: Document *) (* Copyright 2019 MINES ParisTech -- Dual License LGPL 2.1 / GPL3+ *) (* Copyright 2019-2023 Inria -- Dual License LGPL 2.1 / GPL3+ *) (* Written by: Emilio J. Gallego Arias *) (************************************************************************) (* Should be moved to the right place *) module Util = struct let hd_opt l = match l with | [] -> None | h :: _ -> Some h let build_span start_loc end_loc = Loc. { start_loc with line_nb_last = end_loc.line_nb_last ; bol_pos_last = end_loc.bol_pos_last ; ep = end_loc.ep } let print_stats () = (if !Config.v.mem_stats then let size = Memo.mem_stats () in Io.Log.trace "stats" (string_of_int size)); Io.Log.trace "cache" (Stats.to_string ()); Io.Log.trace "cache" (Memo.CacheStats.stats ()); (* this requires patches to Coq *) (* Io.Log.error "coq parsing" (CoqParsingStats.dump ()); *) (* CoqParsingStats.reset (); *) Memo.CacheStats.reset (); Stats.reset () let safe_sub s pos len = if pos < 0 || len < 0 || pos > String.length s - len then ( let s = String.sub s 0 (Stdlib.min 20 String.(length s - 1)) in Io.Log.trace "string_sub" (Format.asprintf "error for pos: %d len: %d str: %s" pos len s); None) else Some (String.sub s pos len) let pp_words fmt w = if w < 1024.0 then Format.fprintf fmt "%.0f w" w else if w < 1024.0 *. 1024.0 then Format.fprintf fmt "%.2f Kw" (w /. 1024.0) else Format.fprintf fmt "%.2f Mw" (w /. (1024.0 *. 1024.0)) end module DDebug = struct let parsed_sentence ~ast = let loc = Coq.Ast.loc ast |> Option.get in let line = "[l: " ^ string_of_int (loc.Loc.line_nb - 1) ^ "] " in Io.Log.trace "coq" ("parsed sentence: " ^ line ^ Pp.string_of_ppcmds (Coq.Ast.print ast)) let resume (last_tok : Lang.Range.t) version = Io.Log.trace "check" Format.( asprintf "resuming [v: %d], from: %d l: %d" version last_tok.end_.offset last_tok.end_.line) end (* [node list] is a very crude form of a meta-data map "loc -> data" , where for now [data] is only the goals. *) module Node = struct module Ast = struct type t = { v : Coq.Ast.t ; ast_info : Lang.Range.t Coq.Ast.Info.t list option } let to_coq { v; _ } = Coq.Ast.to_coq v end module Info = struct type t = { cache_hit : bool ; parsing_time : float ; time : float option ; mw_prev : float ; mw_after : float ; stats : Stats.t (** Info about cumulative stats *) } let make ?(cache_hit = false) ~parsing_time ?time ~mw_prev ~mw_after ~stats () = { cache_hit; parsing_time; time; mw_prev; mw_after; stats } let pp_time fmt = function | None -> Format.fprintf fmt "N/A" | Some time -> Format.fprintf fmt "%.3f" time let print { cache_hit; parsing_time; time; mw_prev; mw_after; stats } = let cptime = Stats.get_f stats ~kind:Stats.Kind.Parsing in let cetime = Stats.get_f stats ~kind:Stats.Kind.Exec in Format.asprintf "Cached: %b | P: %.3f / %.2f | E: %a / %.2f | M: %a | Diff: %a" cache_hit parsing_time cptime pp_time time cetime Util.pp_words mw_after Util.pp_words (mw_after -. mw_prev) end module Message = struct type t = Lang.Range.t option * int * Pp.t let feedback_to_message ~lines (loc, lvl, msg) = (Coq.Utils.to_orange ~lines loc, lvl, msg) end type t = { range : Lang.Range.t ; ast : Ast.t option (** Ast of node *) ; state : Coq.State.t (** (Full) State of node *) ; diags : Lang.Diagnostic.t list ; messages : Message.t list ; info : Info.t } let range { range; _ } = range let ast { ast; _ } = ast let state { state; _ } = state let diags { diags; _ } = diags let messages { messages; _ } = messages let info { info; _ } = info (* let with_state f n = Option.map (fun x -> (x, n.state)) (f n) *) end module Diags = struct let make ?extra range severity message = Lang.Diagnostic.{ range; severity; message; extra } (* ast-dependent error diagnostic generation *) let extra_diagnostics_of_ast ast = match (Node.Ast.to_coq ast).v with | Vernacexpr.{ expr = VernacRequire (prefix, _export, module_refs); _ } -> let refs = List.map fst module_refs in Some [ Lang.Diagnostic.Extra.FailedRequire { prefix; refs } ] | _ -> None let error ~range ~msg ~ast = let extra = extra_diagnostics_of_ast ast in make ?extra range 1 msg let of_feed ~drange (range, severity, message) = let range = Option.default drange range in make range severity message type partition_kind = | Left | Both | Right let partition ~f l = let rec part l r = function | [] -> (List.rev l, List.rev r) | x :: xs -> ( match f x with | Left -> part (x :: l) r xs | Both -> part (x :: l) (x :: l) xs | Right -> part l (x :: r) xs) in part [] [] l let of_messages ~drange fbs = (* TODO, replace this by a cutoff level *) let cutoff = if !Config.v.show_coq_info_messages then 5 else if !Config.v.show_notices_as_diagnostics then 4 else 3 in let f (_, lvl, _) = if lvl = 2 then Both else if lvl < cutoff then Left else Right in let diags, messages = partition ~f fbs in (List.map (of_feed ~drange) diags, messages) end module Completion = struct type t = | Yes of Lang.Range.t (** Location of the last token in the document *) | Stopped of Lang.Range.t (** Location of the last valid token *) | Failed of Lang.Range.t (** Critical failure, like an anomaly *) | FailedPermanent of Lang.Range.t (** Temporal Coq hack, avoids any computation *) let range = function | Yes range | Stopped range | Failed range | FailedPermanent range -> range let to_string = function | Yes _ -> "fully checked" | Stopped _ -> "stopped" | Failed _ -> "failed" | FailedPermanent _ -> "refused to create due to Coq parsing bug" end (* Private. A doc is a list of nodes for now. The first element in the list is assumed to be the tip of the document. The initial document is the empty list. *) type t = { uri : Lang.LUri.File.t ; version : int ; contents : Contents.t ; toc : Lang.Range.t Coq.Ast.Id.Map.t ; root : Coq.State.t ; nodes : Node.t list ; diags_dirty : bool (** Used to optimize `eager_diagnostics` *) ; completed : Completion.t } let mk_doc root_state workspace uri = Coq.Init.doc_init ~root_state ~workspace ~uri let asts doc = List.filter_map Node.ast doc.nodes (* TOC handling *) (* XXX add children *) let add_toc_info toc { Coq.Ast.Info.name; range; children = _; _ } = match name.v with | Names.Anonymous -> toc | Names.Name id -> Coq.Ast.Id.(Map.add (of_coq id) range toc) let update_toc_info toc ast_info = List.fold_left add_toc_info toc ast_info let update_toc_node toc node = match Node.ast node with | None -> toc | Some { Node.Ast.ast_info = None; _ } -> toc | Some { Node.Ast.ast_info = Some ast_info; _ } -> update_toc_info toc ast_info let rebuild_toc nodes = List.fold_left update_toc_node Coq.Ast.Id.Map.empty nodes let init_fname ~uri = let file = Lang.LUri.File.to_string_file uri in Loc.InFile { dirpath = None; file } let init_loc ~uri = Loc.initial (init_fname ~uri) let process_init_feedback ~stats range state messages = if not (CList.is_empty messages) then let diags, messages = Diags.of_messages ~drange:range messages in let parsing_time = 0.0 in let { Gc.major_words = mw_prev; _ } = Gc.quick_stat () in let info = Node.Info.make ~parsing_time ~mw_prev ~mw_after:mw_prev ~stats () in [ { Node.range; ast = None; state; diags; messages; info } ] else [] let create ~state ~workspace ~uri ~version ~contents = let () = Stats.reset () in let { Coq.Protect.E.r; feedback } = mk_doc state workspace uri in Coq.Protect.R.map r ~f:(fun root -> let init_loc = init_loc ~uri in let lines = contents.Contents.lines in let init_range = Coq.Utils.to_range ~lines init_loc in let feedback = List.map (Node.Message.feedback_to_message ~lines) feedback in let stats = Stats.dump () in let toc = Coq.Ast.Id.Map.empty in let nodes = process_init_feedback ~stats init_range root feedback in let diags_dirty = not (CList.is_empty nodes) in { uri ; contents ; toc ; version ; root ; nodes ; diags_dirty ; completed = Stopped init_range }) let create ~state ~workspace ~uri ~version ~raw = match Contents.make ~uri ~raw with | Error e -> Coq.Protect.R.error (Pp.str e) | Ok contents -> create ~state ~workspace ~uri ~version ~contents let create_failed_permanent ~state ~uri ~version ~raw = Contents.make ~uri ~raw |> Contents.R.map ~f:(fun contents -> let lines = contents.Contents.lines in let init_loc = init_loc ~uri in let range = Coq.Utils.to_range ~lines init_loc in { uri ; contents ; toc = Coq.Ast.Id.Map.empty ; version ; root = state ; nodes = [] ; diags_dirty = true ; completed = FailedPermanent range }) let recover_up_to_offset ~init_range doc offset = Io.Log.trace "prefix" (Format.asprintf "common prefix offset found at %d" offset); let rec find acc_nodes acc_range nodes = match nodes with | [] -> (List.rev acc_nodes, acc_range) | n :: ns -> if Debug.scan then Io.Log.trace "scan" (Format.asprintf "consider node at %a" Lang.Range.pp n.Node.range); if n.range.end_.offset >= offset then (List.rev acc_nodes, acc_range) else find (n :: acc_nodes) n.range ns in find [] init_range doc.nodes let compute_common_prefix ~init_range ~contents (prev : t) = let s1 = prev.contents.raw in let l1 = prev.contents.last.offset in let s2 = contents.Contents.raw in let l2 = contents.last.offset in let rec match_or_stop i = if i = l1 || i = l2 then i else if Char.equal s1.[i] s2.[i] then match_or_stop (i + 1) else i in let common_idx = match_or_stop 0 in let nodes, range = recover_up_to_offset ~init_range prev common_idx in let toc = rebuild_toc nodes in Io.Log.trace "prefix" ("resuming from " ^ Lang.Range.to_string range); let completed = Completion.Stopped range in (nodes, completed, toc) let bump_version ~init_range ~version ~contents doc = (* When a new document, we resume checking from a common prefix *) let nodes, completed, toc = compute_common_prefix ~init_range ~contents doc in (* Important: uri, root remain the same *) let uri = doc.uri in let root = doc.root in { uri ; version ; root ; nodes ; contents ; toc ; diags_dirty = true (* EJGA: Is it worth to optimize this? *) ; completed } let bump_version ~version ~(contents : Contents.t) doc = let init_loc = init_loc ~uri:doc.uri in let init_range = Coq.Utils.to_range ~lines:contents.lines init_loc in match doc.completed with (* We can do better, but we need to handle the case where the anomaly is when restoring / executing the first sentence *) | FailedPermanent _ -> doc | Failed _ -> { doc with version ; nodes = [] ; contents ; diags_dirty = true ; completed = Stopped init_range } | Stopped _ | Yes _ -> bump_version ~init_range ~version ~contents doc let bump_version ~version ~raw doc = let contents = Contents.make ~uri:doc.uri ~raw in Contents.R.map ~f:(fun contents -> bump_version ~version ~contents doc) contents let add_node ~node doc = let diags_dirty = if node.Node.diags <> [] then true else doc.diags_dirty in let toc = update_toc_node doc.toc node in { doc with nodes = node :: doc.nodes; toc; diags_dirty } let concat_diags doc = List.concat_map (fun node -> node.Node.diags) doc.nodes let send_eager_diagnostics ~ofmt ~uri ~version ~doc = (* this is too noisy *) (* let proc_diag = mk_diag loc 3 (Pp.str "Processing") in *) (* Io.Report.diagnostics ~uri ~version (proc_diag :: doc.diags)); *) if doc.diags_dirty && !Config.v.eager_diagnostics then ( let diags = concat_diags doc in Io.Report.diagnostics ~ofmt ~uri ~version diags; { doc with diags_dirty = false }) else doc let set_completion ~completed doc = { doc with completed } (* We approximate the remnants of the document. It would be easier if instead of reporting what is missing, we would report what is done, but for now we are trying this paradigm. As we are quite dynamic (for now) in terms of what we observe of the document (basically we observe it linearly), we must compute the final position with a bit of a hack. *) let compute_progress end_ (last_done : Lang.Range.t) = let start = last_done.end_ in let range = Lang.Range.{ start; end_ } in { Progress.Info.range; kind = 1 } let report_progress ~doc (last_tok : Lang.Range.t) = let progress = compute_progress doc.contents.last last_tok in Io.Report.fileProgress ~uri:doc.uri ~version:doc.version [ progress ] (* XXX: Save on close? *) (* let close_doc _modname = () *) let parse_stm ~st ps = let f ps = Coq.Parsing.parse ~st ps in Stats.record ~kind:Stats.Kind.Parsing ~f ps let rec find_recovery_for_failed_qed ~default nodes = match nodes with | [] -> Coq.Protect.E.ok (default, None) | { Node.ast = None; _ } :: ns -> find_recovery_for_failed_qed ~default ns | { ast = Some ast; state; range; _ } :: ns -> ( match (Node.Ast.to_coq ast).CAst.v.Vernacexpr.expr with | Vernacexpr.VernacStartTheoremProof _ -> ( if !Config.v.admit_on_bad_qed then Memo.interp_admitted ~st:state |> Coq.Protect.E.map ~f:(fun state -> (state, Some range)) else match ns with | [] -> Coq.Protect.E.ok (default, None) | n :: _ -> Coq.Protect.E.ok (n.state, Some n.range)) | _ -> find_recovery_for_failed_qed ~default ns) (* Simple heuristic for Qed. *) let state_recovery_heuristic doc st v = match (Node.Ast.to_coq v).CAst.v.Vernacexpr.expr with (* Drop the top proof state if we reach a faulty Qed. *) | Vernacexpr.VernacEndProof _ -> find_recovery_for_failed_qed ~default:st doc.nodes |> Coq.Protect.E.map ~f:(fun (st, range) -> let loc_msg = Option.cata Lang.Range.to_string "no loc" range in Io.Log.trace "recovery" (loc_msg ^ " " ^ Memo.input_info (v.v, st)); st) (* If a new focus (or unfocusing) fails, admit the proof and try again *) | Vernacexpr.VernacBullet _ | Vernacexpr.VernacEndSubproof -> Io.Log.trace "recovery" "bullet"; Coq.State.admit_goal ~st |> Coq.Protect.E.bind ~f:(fun st -> Coq.Interp.interp ~st v.v |> Coq.Protect.E.map ~f:(fun { Coq.Interp.Info.res } -> res)) | _ -> Coq.Protect.E.ok st let interp_and_info ~parsing_time ~st ast = let { Gc.major_words = mw_prev; _ } = Gc.quick_stat () in (* memo memory stats are disabled: slow and misleading *) let { Memo.Stats.res; cache_hit; memory = _; time } = Memo.interp_command ~st ast in let { Gc.major_words = mw_after; _ } = Gc.quick_stat () in let stats = Stats.dump () in let info = Node.Info.make ~cache_hit ~parsing_time ~time ~mw_prev ~mw_after ~stats () in (res, info) (* Copied from CLexer *) let clexer_after loc = Loc. { loc with line_nb = loc.line_nb_last ; bol_pos = loc.bol_pos_last ; bp = loc.ep } type parse_action = | EOF of Completion.t (* completed *) | Skip of Lang.Range.t * Lang.Range.t (* span of the skipped sentence + last valid token *) | Process of Coq.Ast.t (* success! *) (* Returns parse_action, diags, parsing_time *) let parse_action ~lines ~st last_tok doc_handle = let start_loc = Coq.Parsing.Parsable.loc doc_handle |> clexer_after in let parse_res, time = parse_stm ~st doc_handle in let f = Coq.Utils.to_range ~lines in let { Coq.Protect.E.r; feedback } = Coq.Protect.E.map_loc ~f parse_res in match r with | Coq.Protect.R.Interrupted -> (EOF (Stopped last_tok), [], feedback, time) | Coq.Protect.R.Completed res -> ( match res with | Ok None -> (* We actually need to fix Coq to return the location of the true file EOF, the below trick doesn't work. That will involved updating the type of `main_entry` *) let last_tok = Coq.Parsing.Parsable.loc doc_handle in let last_tok = Coq.Utils.to_range ~lines last_tok in (EOF (Yes last_tok), [], feedback, time) | Ok (Some ast) -> let () = if Debug.parsing then DDebug.parsed_sentence ~ast in (Process ast, [], feedback, time) | Error (Anomaly (_, msg)) | Error (User (None, msg)) -> (* We don't have a better altenative :(, usually missing error loc here means an anomaly, so we stop *) let err_range = last_tok in let parse_diags = [ Diags.make err_range 1 msg ] in (EOF (Failed last_tok), parse_diags, feedback, time) | Error (User (Some err_range, msg)) -> let parse_diags = [ Diags.make err_range 1 msg ] in Coq.Parsing.discard_to_dot doc_handle; let last_tok = Coq.Parsing.Parsable.loc doc_handle in let last_tok_range = Coq.Utils.to_range ~lines last_tok in let span_loc = Util.build_span start_loc last_tok in let span_range = Coq.Utils.to_range ~lines span_loc in (Skip (span_range, last_tok_range), parse_diags, feedback, time)) (* Result of node-building action *) type document_action = | Stop of Completion.t * Node.t | Continue of { state : Coq.State.t ; last_tok : Lang.Range.t ; node : Node.t } | Interrupted of Lang.Range.t let unparseable_node ~range ~parsing_diags ~parsing_feedback ~state ~parsing_time = let fb_diags, messages = Diags.of_messages ~drange:range parsing_feedback in let diags = fb_diags @ parsing_diags in let stats = Stats.dump () in let { Gc.major_words = mw_prev; _ } = Gc.quick_stat () in let info = Node.Info.make ~parsing_time ~mw_prev ~mw_after:mw_prev ~stats () in { Node.range; ast = None; diags; messages; state; info } let assemble_diags ~range ~parsing_diags ~parsing_feedback ~diags ~feedback = let parsing_fb_diags, parsing_messages = Diags.of_messages ~drange:range parsing_feedback in let fb_diags, fb_messages = Diags.of_messages ~drange:range feedback in let diags = parsing_diags @ parsing_fb_diags @ fb_diags @ diags in let messages = parsing_messages @ fb_messages in (diags, messages) let parsed_node ~range ~ast ~state ~parsing_diags ~parsing_feedback ~diags ~feedback ~info = let diags, messages = assemble_diags ~range ~parsing_diags ~parsing_feedback ~diags ~feedback in { Node.range; ast = Some ast; diags; messages; state; info } let stream_of_string ~offset text = let pad = String.make offset ' ' in let str = Stream.of_string (pad ^ text) in for _i = 1 to offset do Stream.junk str done; str let maybe_ok_diagnostics ~range = if !Config.v.ok_diagnostics then let ok_diag = Diags.make range 3 (Pp.str "OK") in [ ok_diag ] else [] let strategy_of_coq_err ~node ~state ~last_tok = function | Coq.Protect.Error.Anomaly _ -> Stop (Failed last_tok, node) | User _ -> Continue { state; last_tok; node } (* XXX: This should be refined. *) let recovery_interp ~doc ~st ~ast = let { Coq.Protect.E.r; feedback = _ } = state_recovery_heuristic doc st ast in match r with | Interrupted -> st | Completed (Ok st) -> st | Completed (Error _) -> st let node_of_coq_result ~doc ~range ~ast ~st ~parsing_diags ~parsing_feedback ~feedback ~info last_tok res = match res with | Ok { Coq.Interp.Info.res = state } -> let ok_diags = maybe_ok_diagnostics ~range in let node = parsed_node ~range ~ast ~state ~parsing_diags ~parsing_feedback ~diags:ok_diags ~feedback ~info in Continue { state; last_tok; node } | Error (Coq.Protect.Error.Anomaly (err_range, msg) as coq_err) | Error (User (err_range, msg) as coq_err) -> let err_range = Option.default range err_range in let err_diags = [ Diags.error ~range:err_range ~msg ~ast ] in let recovery_st = recovery_interp ~doc ~st ~ast in let node = parsed_node ~range ~ast ~state:recovery_st ~parsing_diags ~parsing_feedback ~diags:err_diags ~feedback ~info in strategy_of_coq_err ~node ~state:recovery_st ~last_tok coq_err (* Build a document node, possibly executing *) let document_action ~st ~parsing_diags ~parsing_feedback ~parsing_time ~doc last_tok doc_handle action = match action with (* End of file *) | EOF completed -> let range = Completion.range completed in let node = unparseable_node ~range ~parsing_diags ~parsing_feedback ~state:st ~parsing_time in Stop (completed, node) (* Parsing error *) | Skip (span_range, last_tok) -> let node = unparseable_node ~range:span_range ~parsing_diags ~parsing_feedback ~state:st ~parsing_time in Continue { state = st; last_tok; node } (* We can interpret the command now *) | Process ast -> ( let lines = doc.contents.lines in let process_res, info = interp_and_info ~parsing_time ~st ast in let f = Coq.Utils.to_range ~lines in let { Coq.Protect.E.r; feedback } = Coq.Protect.E.map_loc ~f process_res in match r with | Coq.Protect.R.Interrupted -> (* Exit *) Interrupted last_tok | Coq.Protect.R.Completed res -> let ast_loc = Coq.Ast.loc ast |> Option.get in let ast_range = Coq.Utils.to_range ~lines ast_loc in let ast = Node.Ast.{ v = ast; ast_info = Coq.Ast.make_info ~lines ~st ast } in (* The evaluation by Coq fully completed, then we can resume checking from this point then, hence the new last valid token last_tok_new *) let last_tok_new = Coq.Parsing.Parsable.loc doc_handle in let last_tok_new = Coq.Utils.to_range ~lines last_tok_new in node_of_coq_result ~doc ~range:ast_range ~ast ~st ~parsing_diags ~parsing_feedback ~feedback ~info last_tok_new res) module Target = struct type t = | End | Position of int * int let reached ~(range : Lang.Range.t) (line, col) = let reached_line = range.end_.line in let reached_col = range.end_.character in line < reached_line || (line = reached_line && col <= reached_col) end let beyond_target (range : Lang.Range.t) target = match target with | Target.End -> false | Position (cut_line, cut_col) -> Target.reached ~range (cut_line, cut_col) let pr_target = function | Target.End -> "end" | Target.Position (l, c) -> Format.asprintf "{cutpoint l: %02d | c: %02d" l c let log_beyond_target last_tok target = Io.Log.trace "beyond_target" ("target reached " ^ Lang.Range.to_string last_tok); Io.Log.trace "beyond_target" ("target is " ^ pr_target target) let max_errors_node ~state ~range = let msg = Pp.str "Maximum number of errors reached" in let parsing_diags = [ Diags.make range 1 msg ] in unparseable_node ~range ~parsing_diags ~parsing_feedback:[] ~state ~parsing_time:0.0 (* main interpretation loop *) let process_and_parse ~ofmt ~target ~uri ~version doc last_tok doc_handle = let rec stm doc st (last_tok : Lang.Range.t) acc_errors = (* Reporting of progress and diagnostics (if dirty) *) let doc = send_eager_diagnostics ~ofmt ~uri ~version ~doc in report_progress ~ofmt ~doc last_tok; if Debug.parsing then Io.Log.trace "coq" "parsing sentence"; if acc_errors > !Config.v.max_errors then let completed = Completion.Failed last_tok in let node = max_errors_node ~state:st ~range:last_tok in let doc = add_node ~node doc in set_completion ~completed doc else if beyond_target last_tok target then let () = log_beyond_target last_tok target in (* We set to Completed.Yes when we have reached the EOI *) let completed = if last_tok.end_.offset >= doc.contents.last.offset then Completion.Yes last_tok else Completion.Stopped last_tok in set_completion ~completed doc else (* Parsing *) let lines = doc.contents.lines in let action, parsing_diags, parsing_feedback, parsing_time = parse_action ~lines ~st last_tok doc_handle in (* Execution *) let action = document_action ~st ~parsing_diags ~parsing_feedback ~parsing_time ~doc last_tok doc_handle action in match action with | Interrupted last_tok -> set_completion ~completed:(Stopped last_tok) doc | Stop (completed, node) -> let doc = add_node ~node doc in set_completion ~completed doc | Continue { state; last_tok; node } -> let n_errors = CList.count Lang.Diagnostic.is_error node.Node.diags in let doc = add_node ~node doc in stm doc state last_tok (acc_errors + n_errors) in (* Set the document to "internal" mode, stm expects the node list to be in reveresed order *) let doc = { doc with nodes = List.rev doc.nodes } in (* Note that nodes and diags in reversed order here *) (match doc.nodes with | [] -> () | n :: _ -> Io.Log.trace "resume" ("last node :" ^ Lang.Range.to_string n.range)); let last_node = Util.hd_opt doc.nodes in let st, stats = Option.cata (fun { Node.state; info = { stats; _ }; _ } -> (state, stats)) (doc.root, Stats.zero ()) last_node in Stats.restore stats; let doc = stm doc st last_tok 0 in (* Set the document to "finished" mode: reverse the node list *) let doc = { doc with nodes = List.rev doc.nodes } in doc let log_doc_completion (completed : Completion.t) = let timestamp = Unix.gettimeofday () in let range = Completion.range completed in let status = Completion.to_string completed in Format.asprintf "done [%.2f]: document %s with pos %a" timestamp status Lang.Range.pp range |> Io.Log.trace "check" (* Rebuild a Coq loc from a range, this used to be done using [CLexer.after] but due to Fleche now being 100% based on unicode locations we implement our own *) let debug_loc_after line (r : Lang.Range.t) = if Debug.unicode then Io.Log.trace "loc_after" (Format.asprintf "str: '%s' | char: %d" line r.end_.character) let loc_after ~lines ~uri (r : Lang.Range.t) = let line_nb_last = r.end_.line + 1 in let end_index = let line = Array.get lines r.end_.line in debug_loc_after line r; match Coq.Utf8.index_of_char ~line ~char:r.end_.character with | None -> String.length line | Some index -> index in let bol_pos_last = r.end_.offset - end_index in { Loc.fname = init_fname ~uri ; line_nb = line_nb_last ; bol_pos = bol_pos_last ; line_nb_last ; bol_pos_last ; bp = r.end_.offset ; ep = r.end_.offset } (** Setup parser and call the main routine *) let resume_check ~ofmt ~(last_tok : Lang.Range.t) ~doc ~target = let uri, version, contents = (doc.uri, doc.version, doc.contents) in (* Compute resume point, basically [CLexer.after] + stream setup *) let lines = doc.contents.lines in let resume_loc = loc_after ~lines ~uri last_tok in let offset = resume_loc.Loc.bp in Coq.Parsing.bp_ := resume_loc.bp; let pcontent_len = contents.last.offset in match Util.safe_sub contents.text offset (pcontent_len - offset) with | None -> (* Guard against internal tricky eof errors *) let completed = Completion.Failed last_tok in set_completion ~completed doc | Some processed_content -> let handle = Coq.Parsing.Parsable.make ~loc:resume_loc (stream_of_string ~offset processed_content) in process_and_parse ~ofmt ~target ~uri ~version doc last_tok handle (** Check a document, if it was not completed already *) let check ~ofmt ~target ~doc () = match doc.completed with | Yes _ -> Io.Log.trace "check" "resuming, completed=yes, nothing to do"; doc | FailedPermanent _ | Failed _ -> Io.Log.trace "check" "can't resume, failed=yes, nothing to do"; doc | Stopped last_tok -> DDebug.resume last_tok doc.version; let doc = resume_check ~ofmt ~last_tok ~doc ~target in log_doc_completion doc.completed; Util.print_stats (); doc
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>