/usr/share/emacs/site-lisp/acl2/acl2-doc.el is in acl2-emacs 7.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 | ; ACL2 Version 7.1 -- A Computational Logic for Applicative Common Lisp
; Copyright (C) 2015, Regents of the University of Texas
; This version of ACL2 is a descendent of ACL2 Version 1.9, Copyright
; (C) 1997 Computational Logic, Inc. See the documentation topic NOTES-2-0.
; This program is free software; you can redistribute it and/or modify
; it under the terms of Version 2 of the GNU General Public License as
; published by the Free Software Foundation.
; This program is distributed in the hope that it will be useful,
; but WITHOUT ANY WARRANTY; without even the implied warranty of
; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
; GNU General Public License for more details.
; You should have received a copy of the GNU General Public License
; along with this program; if not, write to the Free Software
; Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
; Written by: Matt Kaufmann and J Strother Moore
; email: Kaufmann@cs.utexas.edu and Moore@cs.utexas.edu
; Department of Computer Sciences
; University of Texas at Austin
; Austin, TX 78712-1188 U.S.A.
; This file contains code for browsing ACL2 community book
; system/doc/acl2-doc.lisp, which contains the ACL2 system
; documentation.
; The first two forms are copied from emacs-acl2.el. Keep them in
; sync with the definitions there.
(defvar *acl2-sources-dir*)
; Attempt to set *acl2-sources-dir*.
; WARNING: If you change this form, then also change the same form in
; emacs-acl2.el.
(if (and (not (boundp '*acl2-sources-dir*))
(file-name-absolute-p load-file-name))
(let ((pattern (if (string-match "[\\]" load-file-name)
"\[^\\]+\\*$"
"/[^/]+/*$"))
(dir (file-name-directory load-file-name)))
(let ((posn (string-match pattern dir)))
(if posn
(setq *acl2-sources-dir*
(substring dir 0 (1+ posn)))))))
(defmacro defv (var form)
`(progn (defvar ,var)
(setq ,var ,form)))
(defmacro acl2-doc-init-vars ()
'(progn
(defv *acl2-doc-buffer-name*
"acl2-doc")
(defv *acl2-doc-index-buffer-name*
"acl2-doc-index")
(defv *acl2-doc-index-name* nil)
(defv *acl2-doc-index-name-found-p* nil)
(defv *acl2-doc-search-buffer-name*
"acl2-doc-search")
(defv *acl2-doc-search-string* nil)
(defv *acl2-doc-search-regexp-p* nil)
(defv *acl2-doc-search-separator* "###---###---###---###---###")
(defv *acl2-doc-history* nil)
(defv *acl2-doc-history-buffer-name*
"acl2-doc-history")
(defv *acl2-doc-return* nil)
(defv *acl2-doc-all-topics-rev* nil)
(defv *acl2-doc-state* nil)
(defv *acl2-doc-limit-topic* nil)
(defv *acl2-doc-topics-ht* nil)
(defv *acl2-doc-children-ht* nil)))
(acl2-doc-init-vars)
; We define the following variable outside acl2-doc-init-vars, so that it is
; not smashed by invoking that macro after running acl2-doc-alist-create.
(defvar *acl2-doc-directory* nil)
; The following variables can be set before loading this file, for
; example in a user's .emacs file.
(defvar *acl2-doc-rendered-combined-pathname*
(concat *acl2-sources-dir*
"books/system/doc/rendered-doc-combined.lsp"))
(defvar *acl2-doc-rendered-combined-pathname-gzipped*
(concat *acl2-doc-rendered-combined-pathname* ".gz"))
(defvar *acl2-doc-rendered-pathname*
(concat *acl2-sources-dir*
"doc.lisp"))
(defvar *acl2-doc-rendered-combined-url*
; "Bleeding-edge" combined manual.
"http://www.cs.utexas.edu/users/moore/acl2/manuals/current/rendered-doc-combined.lsp.gz")
; Set the following to 'ACL2 to get to the ACL2 User's Manual at
; startup, but to 'TOP to get to the ACL2+Books Manual. Here we set
; it to nil, which goes to the ACL2+Books Manual if it exists, and
; otherwise offers a choice.
(defvar *acl2-doc-top-default* nil)
(defun acl2-doc-fix-alist (alist)
;;; We delete topics whose names start with a vertical bar. Most of
;;; these are for the tours anyhow. We also lose release notes topics
;;; for ACL2(r) from July 2011 and before, but that seems minor
;;; compared to the pain of dealing with these topics, since Emacs
;;; Lisp doesn't seem to use |..| for escaping.
(let ((ans nil))
(while alist
(let* ((entry (pop alist))
(sym (car entry)))
(if (and (symbolp sym) ; always true?
(not (equal (aref (symbol-name sym) 0) ?|)))
(push entry ans))))
(reverse ans)))
(defun acl2-doc-alist-create (rendered-pathname)
(when (not (file-exists-p rendered-pathname))
(error "File %s is missing!" rendered-pathname))
(let* ((large-file-warning-threshold
; As of April 2015, file books/system/doc/rendered-doc-combined.lsp is nearly
; 55M. (It was just under 15M in November 2013.) We take a guess here that
; modern platforms can handle somewhat more than the current size, so we rather
; arbitrarily bump up the threshold for a warning, to provide a modest cushion
; for avoiding the warning.
(max large-file-warning-threshold 70000000))
(buf0 (find-buffer-visiting rendered-pathname))
; We could let buf = buf0 if buf0 is non-nil. But if the file was changed
; after loading it into buf0, then we would be operating on a stale buffer. So
; we ignore buf0 other than to decide whether to delete the buffer just before
; returning from this function.
(buf (find-file-noselect rendered-pathname)))
(with-current-buffer
buf
; Warren Hunt asked that the acl2-doc buffer be put in the same directory as
; the file from which it was derived. One basic advantage of this idea is that
; the directory won't depend on where acl2-doc was invoked.
(setq *acl2-doc-directory* default-directory)
(save-excursion
(lisp-mode)
(goto-char (point-min))
(forward-sexp 1)
(forward-line 3)
(prog1 (acl2-doc-fix-alist (read buf))
(when (not buf0)
(kill-buffer buf))
(message "Refreshed from %s" rendered-pathname))))))
(defun acl2-doc-state-initialized-p ()
(not (null *acl2-doc-state*)))
(defun acl2-doc-rendered-combined-download ()
"Download the ``bleeding edge'' ACL2+Books Manual from the web;
then restart the ACL2-Doc browser to view that manual."
(interactive)
(cond ((file-exists-p *acl2-doc-rendered-combined-pathname*)
(message "Renaming %s to %s.backup"
*acl2-doc-rendered-combined-pathname*
*acl2-doc-rendered-combined-pathname*)
(rename-file *acl2-doc-rendered-combined-pathname*
(concat *acl2-doc-rendered-combined-pathname* ".backup")
0)))
(message "Preparing to download %s"
*acl2-doc-rendered-combined-url*)
(url-copy-file
*acl2-doc-rendered-combined-url*
*acl2-doc-rendered-combined-pathname-gzipped*)
(cond ((file-exists-p *acl2-doc-rendered-combined-pathname-gzipped*)
(cond
((eql 0 (nth 7
(file-attributes ; size
*acl2-doc-rendered-combined-pathname-gzipped*)))
(error
"Download/install failed (zero-length file, %s, will be deleted)."
*acl2-doc-rendered-combined-pathname-gzipped*)
(delete-file *acl2-doc-rendered-combined-pathname-gzipped*))
(t
(shell-command-to-string
(format "gunzip %s"
*acl2-doc-rendered-combined-pathname-gzipped*))
(or (file-exists-p *acl2-doc-rendered-combined-pathname*)
(error "Gunzip failed."))
;;; The following call of acl2-doc-reset may appear to have the
;;; potential to cause a loop: acl2-doc-reset calls
;;; acl2-doc-state-create, which calls
;;; acl2-doc-rendered-combined-fetch, which calls the present
;;; function. However, acl2-doc-rendered-combined-fetch is
;;; essentially a no-op in this case because of the file-exists-p
;;; check just above.
(acl2-doc-reset 'TOP)
(acl2-doc-top))))
(t (error "Download/install failed.")
nil)))
(defun acl2-doc-rendered-combined-fetch ()
(or (file-exists-p *acl2-doc-rendered-combined-pathname*)
(cond
((and (file-exists-p *acl2-doc-rendered-combined-pathname-gzipped*)
(y-or-n-p
(format "Run gunzip on %s? "
*acl2-doc-rendered-combined-pathname-gzipped*
*acl2-doc-rendered-combined-pathname*)))
(shell-command-to-string
(format "gunzip %s"
*acl2-doc-rendered-combined-pathname-gzipped*))
(or (file-exists-p *acl2-doc-rendered-combined-pathname*)
(error "Execution of gunzip seems to have failed!")))
((y-or-n-p
(format "Download %s and install as %s? "
*acl2-doc-rendered-combined-url*
*acl2-doc-rendered-combined-pathname*))
(acl2-doc-rendered-combined-download)))))
(defun acl2-doc-state-create (top-name)
;;; The given top-name is 'ACL2, 'TOP, or nil. If nil, then we use
;;; the current top-name if one exists; otherwise we use
;;; *acl2-doc-top-default* if specified; otherwise we query.
(cond
((eq top-name 'ACL2)
(list top-name
(acl2-doc-alist-create *acl2-doc-rendered-pathname*)))
((and (eq top-name 'TOP)
(acl2-doc-rendered-combined-fetch))
(list top-name
(acl2-doc-alist-create *acl2-doc-rendered-combined-pathname*)))
((eq top-name 'TOP)
(error "ACL2+Books Manual not loaded for browsing"))
((acl2-doc-rendered-combined-fetch) ; top-name is nil
(list 'TOP
(acl2-doc-alist-create *acl2-doc-rendered-combined-pathname*)))
((y-or-n-p
" Do you want to browse the ACL2 User's Manual even though it
does not include documentation for the ACL2 community books?
Note: If your answer is \"y\", then avoid this query by placing the form
(setq *acl2-doc-top-default* 'ACL2) in your .emacs file. ")
(list 'ACL2
(acl2-doc-alist-create *acl2-doc-rendered-pathname*)))
(t
(error "No manual loaded for browsing"))))
(defun acl2-doc-reset (top-name)
;;; The given top-name is 'ACL2, 'TOP, or nil. See acl2-doc-state-create.
(let* ((top-name (or top-name
(cond
((acl2-doc-state-initialized-p)
;;; The following expression is (acl2-doc-state-top-name), except that we
;;; haven't yet defined that function because we haven't yet defined the
;;; function acl2-doc-maybe-reset.
(nth 0 *acl2-doc-state*))
(*acl2-doc-top-default*))))
(new-state (acl2-doc-state-create top-name)))
(when (get-buffer *acl2-doc-index-buffer-name*)
(kill-buffer *acl2-doc-index-buffer-name*))
(when (get-buffer *acl2-doc-search-buffer-name*)
(kill-buffer *acl2-doc-search-buffer-name*))
(acl2-doc-init-vars)
(setq *acl2-doc-state* new-state)
t))
(defun acl2-doc-maybe-reset ()
(cond ((not (acl2-doc-state-initialized-p))
(acl2-doc-reset nil)
t)
(t nil)))
(defun acl2-doc-state-top-name ()
(acl2-doc-maybe-reset)
(nth 0 *acl2-doc-state*))
(defun acl2-doc-state-alist ()
(acl2-doc-maybe-reset)
(nth 1 *acl2-doc-state*))
; Based on http://ergoemacs.org/emacs/elisp_syntax_coloring.html:
(setq acl2-doc-keywords
'(("\\[\\([^ \t]*\\)\\]"
. 1)))
; Can be modified by user; set to the desired link color, or nil if none.
(defvar *acl2-doc-link-color* "#0000FF") ; blue
(make-face 'acl2-doc-link-face)
(define-derived-mode acl2-doc-mode
fundamental-mode
"ACL2-Doc"
"Major mode for acl2-doc buffer."
; By using lisp-mode-syntax-table, we arrange that the use of colon
; (:) doesn't break up an s-expression. So for example,
; ACL2-PC::REWRITE is a single s-expression. This matters because we
; define the function acl2-doc-topic-at-point in terms of
; backward-sexp. Of course, we could instead evaluate the form
; (modify-syntax-entry ?: "w" acl2-doc-mode-syntax-table) but we start
; this way, in case other characters are missing and also because this
; approach might conceivably be useful for people who are navigating
; lisp forms in the acl2-doc buffer.
:syntax-table (copy-syntax-table lisp-mode-syntax-table))
(add-hook 'acl2-doc-mode-hook
(lambda ()
(when *acl2-doc-link-color*
(set-face-foreground 'acl2-doc-link-face *acl2-doc-link-color*)
(setq font-lock-defaults '(acl2-doc-keywords t))
(set (make-local-variable 'font-lock-keyword-face)
'acl2-doc-link-face))))
; Arrange that files ending in .acl2-doc come up in acl2-doc mode.
; See also the emacs documentation for auto-mode-alist.
(if (not (assoc "\\.acl2-doc\\'" auto-mode-alist))
(push '("\\.acl2-doc\\'" . acl2-doc-mode) auto-mode-alist))
(defun switch-to-acl2-doc-buffer ()
(switch-to-buffer *acl2-doc-buffer-name*)
;;; The next two forms need only be evaluated when the buffer is first
;;; created, but it is likely harmless to go ahead and evaluate them
;;; every time.
(acl2-doc-mode)
(setq default-directory *acl2-doc-directory*)
t)
(defun acl2-doc-print-topic (tuple)
; Warning: Do not set the buffer to read-only here, because this
; function may be called repeatedly for the same buffer, e.g., by
; function acl2-doc-search-buffer.
(insert (format "Topic: %s\nParent list: %s\n%s\n%s\n"
(nth 0 tuple)
(nth 1 tuple)
(if (equal (length tuple) 4)
(if (eq (nth 0 tuple) 'TOP)
""
(format "Source: %s\n" (nth 3 tuple)))
(if (eq (acl2-doc-state-top-name) 'ACL2)
""
"Source: ACL2 Sources\n"))
(nth 2 tuple)))
(set-buffer-modified-p nil)
(force-mode-line-update))
(defun acl2-doc-display-message (entry)
(let ((name (car (cdr entry)))
(manual-name (if (eq (acl2-doc-state-top-name) 'ACL2)
"ACL2 User's Manual"
"ACL2+Books Manual")))
(if (eq (acl2-doc-state-top-name) name)
(message "At the top node of the %s"
manual-name)
(message "Topic: %s (%s)" name manual-name))))
(defun acl2-doc-where ()
(interactive)
(cond ((consp *acl2-doc-history*)
(acl2-doc-display-message (car *acl2-doc-history*)))
(t (error "Empty history: No `where' to display!"))))
(defun acl2-doc-display-basic (entry)
;;; Entry is a history entry, hence of the form (point name parents
;;; string).
;;; The first form below is unnecessary if the caller is
;;; acl2-doc-display, but it's cheap.
(switch-to-acl2-doc-buffer)
(setq buffer-read-only nil)
(erase-buffer)
(acl2-doc-print-topic (cdr entry)) ; entry is (cons position tuple)
(setq buffer-read-only t)
(goto-char (nth 0 entry))
(push (car (cdr entry)) *acl2-doc-all-topics-rev*)
(acl2-doc-display-message entry))
(defun acl2-doc-display (name)
;;; Name should be a symbol. We display the topic and adjust the
;;; history and return history. Do not use this for the "l" or "r"
;;; commands; use acl2-doc-display-basic instead, which does not mess
;;; with those history variables.
(let ((tuple (assoc name (acl2-doc-state-alist))))
(cond (tuple (switch-to-acl2-doc-buffer)
(let ((new-entry (cons 0 tuple)))
(if *acl2-doc-history*
(let ((old-entry (pop *acl2-doc-history*)))
(push (cons (point) (cdr old-entry))
*acl2-doc-history*)))
(push new-entry *acl2-doc-history*)
(setq *acl2-doc-return* nil)
(acl2-doc-display-basic new-entry)))
(t (error "Not found: %s" name)))))
(defun acl2-doc-topic-at-point ()
;;; This function returns nil if the s-expression at point isn't a
;;; symbol. Otherwise, it returns that symbol in upper case, except
;;; that it removes the leading and trailing bracket for [...].
(let ((sym (sexp-at-point))
(go t)
(arrayp nil))
(while go
(cond ((and (consp sym)
(equal (length sym) 2)
(member (car sym)
'(\` quote)))
(setq sym (car (cdr sym))))
(t (setq go nil))))
;;; Deal with array case.
(cond
((null sym)
;;; We have found that (sexp-at-point) returns nil when standing in
;;; text that ends in a square bracket followed by a period, e.g.,
;;; "[loop-stopper]." So we try again.
(setq sym
(save-excursion
(if (< (point) (point-max))
(forward-char 1)) ; in case we are at "["
(let* ((saved-point (point))
(start (and (re-search-backward "[^]]*[[]" nil t)
(match-beginning 0))))
(and start
(let ((end (and (re-search-forward "[^ ]*]" nil t)
(match-end 0))))
(and end
(<= saved-point end)
(goto-char (1+ start))
(read (current-buffer))))))))
(when sym
(setq arrayp t)))
((arrayp sym) ;; [...]
(setq sym (and (not (equal sym []))
(aref sym 0)))
(when sym
(setq arrayp t))))
;;; Now we have sym and arrayp.
(cond (arrayp ;; [...]
(let ((tmp (and (symbolp sym)
(intern (upcase (symbol-name sym))))))
(cond ((assoc tmp (acl2-doc-state-alist))
tmp)
(t 'BROKEN-LINK))))
((not (and sym (symbolp sym)))
nil)
(t
(let* ((name (symbol-name sym))
(max-orig (1- (length name)))
(max max-orig)
(name (cond ((equal (aref name 0) ?:)
(setq max (1- max))
(substring name 1))
(t name)))
(go t))
(while (and go (< 1 max))
(cond ((member (aref name max)
'(?. ?\' ?:))
(setq max (1- max)))
(t (setq go nil))))
(intern (upcase (cond ((equal max max-orig)
name)
(t (substring name 0 (1+ max)))))))))))
(defun acl2-doc-completing-read (prompt silent-error-p)
(let* ((completion-ignore-case t)
(default (acl2-doc-topic-at-point))
(default (and (or (eq default 'BROKEN-LINK) ; optimization
(assoc default (acl2-doc-state-alist)))
default))
(value-read (completing-read
(if default
(format "%s (default %s): " prompt default)
(format "%s: " prompt))
(acl2-doc-state-alist)
nil nil nil nil
default)))
(list (cond ((equal value-read default) ;; i.e., (symbolp value-read)
default)
((and (not silent-error-p)
(equal value-read ""))
(error "No default topic name found at point"))
(t (intern (upcase value-read)))))))
(defun acl2-doc-go (name)
"Go to the specified topic; performs completion."
(interactive (acl2-doc-completing-read "Go to topic" nil))
(acl2-doc-display name))
(defun acl2-doc-go-from-anywhere (name)
"Go to the specified topic even if not within ACL2-Doc; performs completion."
(interactive (with-syntax-table lisp-mode-syntax-table
(acl2-doc-completing-read "Go to topic" nil)))
(acl2-doc-display name))
(defun acl2-doc-go! ()
"Go to the topic occurring at the cursor position."
(interactive)
(let ((name (acl2-doc-topic-at-point)))
(cond (name (acl2-doc-display name))
(t (error "Cursor is not on a name")))))
(defun acl2-doc-top ()
"Go to the top topic."
(interactive)
(acl2-doc-go (acl2-doc-state-top-name))
(let ((manual-name (if (eq (acl2-doc-state-top-name) 'ACL2)
"ACL2 User's Manual"
"ACL2+Books Manual")))
(message "At the top node of the %s; type h for help"
manual-name)))
(defun acl2-doc (&optional clear)
"Go to the ACL2-Doc browser; prefix argument clears state.
See the documentation topic for ACL2-Doc for more
information, either by starting ACL2-Doc and typing `h'
\(help), by viewing the ACL2-DOC topic in a web browser, or by
typing `:doc acl2-doc' in the ACL2 read-eval-print loop.
\\{acl2-doc-mode-map}"
(interactive "P")
(cond (clear
(acl2-doc-reset nil)
(acl2-doc-top))
(*acl2-doc-history*
(acl2-doc-display-basic (car *acl2-doc-history*)))
(t
(acl2-doc-maybe-reset)
(acl2-doc-top))))
(defun acl2-doc-last ()
"Go to the last topic visited."
(interactive)
(cond ((cdr *acl2-doc-history*)
(push (pop *acl2-doc-history*)
*acl2-doc-return*)
(acl2-doc-display-basic (car *acl2-doc-history*)))
(t (error "No last page visited"))))
(defun acl2-doc-return ()
"Return to the last topic visited, popping the stack of
visited topics."
(interactive)
(cond (*acl2-doc-return*
(let ((entry (pop *acl2-doc-return*)))
(push entry *acl2-doc-history*)
(acl2-doc-display-basic entry)))
(t (error "Nothing to return to"))))
(defun acl2-doc-read-line ()
; Return the current line, and go to the end of it.
(forward-line 0)
(let ((beg (point)))
(end-of-line)
(buffer-substring beg (point))))
(defun acl2-doc-up ()
"Go to the parent of the current topic."
(interactive)
(switch-to-acl2-doc-buffer)
(let ((first-parent
(save-excursion
(goto-char (point-min))
(and (search-forward "Parent list: (" nil t)
(acl2-doc-topic-at-point)))))
(cond ((and (eq first-parent 'TOP)
(eq (nth 0 *acl2-doc-state*) 'ACL2)
(save-excursion
(goto-char (point-min))
(and (search-forward "Parent list: (TOP " nil t)
(setq first-parent (acl2-doc-topic-at-point)))))
(acl2-doc-display first-parent))
((null first-parent)
(cond ((save-excursion
(goto-char (point-min))
(forward-line 1)
(member (acl2-doc-read-line)
'("Parent list: NIL"
"Parent list: ()")))
(error "Already at the root node of the manual"))
(t (error "Internal ACL2-Doc error in acl2-doc-up.
Please report this error to the ACL2 implementors."))))
(t (acl2-doc-display first-parent)))))
(defun acl2-doc-update-top-history-entry ()
(cond ((null *acl2-doc-history*)
(error "Empty history!"))
(t (with-current-buffer
*acl2-doc-buffer-name* ; error if this was killed!
(setq *acl2-doc-history*
(cons (cons (point) (cdr (car *acl2-doc-history*)))
(cdr *acl2-doc-history*)))))))
(defun acl2-doc-quit ()
"Quit the ACL2-Doc browser."
(interactive)
(if (not (equal (buffer-name) *acl2-doc-buffer-name*))
(error
"Return to %s buffer (e.g., using C-t g) before running acl2-doc-quit"
*acl2-doc-buffer-name*))
(acl2-doc-update-top-history-entry)
(quit-window))
(defun acl2-doc-initialize (&optional toggle)
"Restart the ACL2-Doc browser, clearing its state. With
prefix argument, toggle between the ACL2 User's Manual (the
default) and the ACL2+Books Manual. For the latter,
it will be necessary first to create file
books/system/doc/rendered-doc-combined.lsp; see :DOC
acl2-doc."
(interactive "P")
(acl2-doc-reset
(and toggle
(acl2-doc-state-initialized-p)
(if (eq (acl2-doc-state-top-name) 'ACL2) 'TOP 'ACL2)))
(acl2-doc-top))
; Start code for setting the limit topic.
;;; When *acl2-doc-limit-topic* is non-nil, it is the "limit topic": we want
;;; searches (including index operations) to be restricted to topics with a
;;; parent chain leading to the limit topic. We'll call such topics
;;; "descendents".
;;; When *acl2-doc-topics-ht* is non-nil, this is a hash table mapping each
;;; descendent of *acl2-doc-limit-topic* to t.
;;; When *acl2-doc-children-ht* is non-nil, this variable is a hash table that
;;; maps each topic name to a hash table, which in turn maps children of that
;;; key to t.
(defun acl2-doc-topics-ht-1 (topic ht children-ht)
;;; We mark each node reachable from topic by a path following children-ht,
;;; stopping our exploration when we reach a node that is already marked. A
;;; key idea is to avoid looping by marking the topic before exploring its
;;; children.
;;; It seems plausible that this algorithm marks in ht every node reachable
;;; from topic. At some point maybe a proof will appear here. Here we present
;;; an informal argument by induction on the length of a path from the
;;; top-level topic to a reachable node N. For consider the first call of this
;;; function on N. There is a call on some parent P, so by induction, P is
;;; marked; but the first mark of P will lead to a call of this function that
;;; marks N.
(when (not (gethash topic ht)) ; otherwise we could loop
(puthash topic t ht)
(let ((topic-children-ht (gethash topic children-ht)))
(when topic-children-ht
(maphash (lambda (child val)
(when (null (gethash child ht))
(acl2-doc-topics-ht-1 child ht children-ht)))
topic-children-ht)))))
(defun acl2-doc-topics-ht-init (topic)
(cond
((eq topic (acl2-doc-state-top-name)) ; no limitations
(setq *acl2-doc-topics-ht* nil))
(t ;; Set up initial *acl2-doc-children-ht*, mapping parents to children.
(setq *acl2-doc-topics-ht* (make-hash-table :test 'eq))
(when (null *acl2-doc-children-ht*)
(setq *acl2-doc-children-ht* (make-hash-table :test 'eq)))
;; Map each parent to its children in *acl2-doc-children-ht*.
(dolist (tup (acl2-doc-state-alist))
(let ((topic (car tup))
(parents (cadr tup)))
(when (not (member parents '(NIL ())))
(dolist (parent parents)
(let ((ht (cond ((gethash parent *acl2-doc-children-ht*))
(t (let ((ht (make-hash-table :test 'eq)))
(puthash parent
ht
*acl2-doc-children-ht*)
ht)))))
(puthash topic t ht))))))
(acl2-doc-topics-ht-1 topic *acl2-doc-topics-ht* *acl2-doc-children-ht*)
(puthash topic t *acl2-doc-topics-ht*)
*acl2-doc-topics-ht*)))
(defun acl2-doc-set-limit-topic (do-it)
(cond
((null do-it)
(setq *acl2-doc-limit-topic* nil
*acl2-doc-topics-ht* nil))
(t
(let ((name
(car (acl2-doc-completing-read
"Search or index only under topic"
t))))
(cond ((or (equal (symbol-name name) "")
(eq name *acl2-doc-limit-topic*))) ; nothing to do
(t
(let ((found-p (assoc name (acl2-doc-state-alist))))
(cond (found-p (setq *acl2-doc-limit-topic* name)
(acl2-doc-topics-ht-init name))
(t (error "Unknown topic name: %s" name))))))))))
(defun acl2-doc-under-limit-topic-p (topic)
(or (null *acl2-doc-topics-ht*)
(gethash topic *acl2-doc-topics-ht*)))
; End code for setting the limit topic.
(defun acl2-doc-index-buffer ()
(or (get-buffer *acl2-doc-index-buffer-name*)
(let ((buf (get-buffer-create *acl2-doc-index-buffer-name*))
(alist (acl2-doc-state-alist)))
(with-current-buffer
buf
(when *acl2-doc-directory* ; probably always true
(setq default-directory *acl2-doc-directory*))
(while alist
(insert (format "%s\n" (car (pop alist)))))
(acl2-doc-mode)
(set-buffer-modified-p nil)
(setq buffer-read-only t))
buf)))
(defun acl2-doc-index-main (name)
(interactive (acl2-doc-completing-read
(format "Find topic%s (then type , for next match) "
(if *acl2-doc-limit-topic*
(format " under %s"
*acl2-doc-limit-topic*)
""))
t))
(let ((buf (acl2-doc-index-buffer)))
(cond
((equal (symbol-name name) "")
(switch-to-buffer *acl2-doc-index-buffer-name*)
(goto-char (point-min)))
(t
(let ((found-p (and (acl2-doc-under-limit-topic-p name)
(assoc name (acl2-doc-state-alist)))))
(setq *acl2-doc-index-name-found-p* found-p) ; a cons
(setq *acl2-doc-index-name* (symbol-name name))
(cond
(found-p (with-current-buffer
buf
(goto-char (point-min)))
(acl2-doc-display name))
(t (let (topic)
(with-current-buffer
buf
(goto-char (point-min))
(while (null topic)
(cond ((search-forward (symbol-name name) nil t)
(let ((sym (intern (acl2-doc-read-line))))
(when (acl2-doc-under-limit-topic-p sym)
(setq topic sym))))
(t ;; set to failure indicator, 0
(setq topic 0)))))
(cond ((and topic (not (equal topic 0)))
(acl2-doc-display topic))
(t (setq *acl2-doc-index-name* nil)
(error "No matching topic found%s"
(if *acl2-doc-limit-topic*
(format " under %s"
*acl2-doc-limit-topic*)
""))))))))))))
(defun acl2-doc-index (&optional arg)
"Go to the specified topic or else one containing it as a
substring; performs completion. If the empty string is supplied,
then go to the index buffer. Otherwise, with prefix argument,
consider only descendents of the topic supplied in response to a
prompt. Note that the index buffer is in ACL2-Doc mode; thus, in
particular, you can type <RETURN> while standing on a topic in
order to go directly to that topic."
(interactive "P")
(acl2-doc-set-limit-topic arg)
(call-interactively 'acl2-doc-index-main))
(defun acl2-doc-index-continue (previous-p)
(let ((buf (get-buffer *acl2-doc-index-buffer-name*)))
(when (null buf)
(error "Need to initiate index search"))
(let* (topic
(acl2-doc-index-sym
(and *acl2-doc-index-name-found-p* ; optimization
(intern *acl2-doc-index-name*))))
(with-current-buffer
buf
(when previous-p
;;; If this is the first use of "," or "<" after "i", and the match was exact,
;;; then start the search backward in the index buffer from that match.
;;; (Otherwise we go forward from the current position, which is presumably the
;;; beginning of the index buffer.)
(when (consp *acl2-doc-index-name-found-p*) ; start from the hit
(when (equal (point) (point-min)) ; presumably true
(search-forward (format "\n%s\n" *acl2-doc-index-name*))
(backward-char 1) ; to previous line
(setq *acl2-doc-index-name-found-p* nil))))
;;; Note that subsequent uses of "," or "<" (after the same "i") are not the
;;; first.
(setq *acl2-doc-index-name-found-p*
(and *acl2-doc-index-name-found-p* t))
(while (null topic)
(cond ((cond (previous-p
(beginning-of-line)
(search-backward *acl2-doc-index-name* nil t))
(t
(end-of-line)
(search-forward *acl2-doc-index-name* nil t)))
(let ((sym (intern (acl2-doc-read-line))))
(when (acl2-doc-under-limit-topic-p sym)
(setq topic sym))))
(t ;; set to failure indicator, 0
(setq topic 0)))))
(cond ((not (equal topic 0)) ; success
(cond ((and *acl2-doc-index-name-found-p*
(eq topic acl2-doc-index-sym))
(setq *acl2-doc-index-name-found-p* nil)
(acl2-doc-index-continue previous-p))
(t (acl2-doc-display topic))))
(t (with-current-buffer
buf
(goto-char (if previous-p (point-max) (point-min))))
(error
"No more matches%s; repeat to re-start index search"
(if *acl2-doc-limit-topic*
(format " under %s"
*acl2-doc-limit-topic*)
"")))))))
(defun acl2-doc-index-next ()
"Find the next topic containing, as a substring, the topic of
the most recent i command. Note: if this is the first \",\" or
\"<\" after an exact match from \"i\", then start the topic
search alphabetically from the beginning, but avoid a second hit
on the original topic."
(interactive)
(acl2-doc-index-continue nil))
(defun acl2-doc-index-previous ()
"Find the previous topic containing, as a substring, the topic of
the most recent i command. Note: if this is the first \",\" or \"<\"
after an exact match from \"i\", then start the topic search
alphabetically (backwards) from that exact match."
(interactive)
(acl2-doc-index-continue t))
(defun acl2-doc-search-buffer ()
;;; Return the search buffer, which contains all :doc topics, creating it first
;;; (with those topics inserted) if necessary.
(or (get-buffer *acl2-doc-search-buffer-name*)
(let ((buf (get-buffer-create *acl2-doc-search-buffer-name*))
(alist (acl2-doc-state-alist)))
(with-current-buffer
buf
(while alist
(insert "\n")
(insert *acl2-doc-search-separator*)
(insert "\n")
(acl2-doc-print-topic (pop alist)))
(setq buffer-read-only t))
buf)))
(defun acl2-doc-search-aux-1 (continue-p str regexp-p)
; Returns a pair (position . topic-symbol) if we find str in the current
; (index) buffer, else nil.
(cond
((if (eq continue-p :previous)
;;; In order to avoid sticking on the same result when changing directions, we
;;; always leave the cursor at the end of the match. This takes a bit of extra
;;; code when searching backwards.
(cond (regexp-p
(and (save-excursion
(backward-char 1)
(re-search-backward str nil t))
(progn (goto-char (match-end 0))
t)))
(t
(and (save-excursion
(backward-char 1)
(search-backward str nil t))
(progn (goto-char (match-end 0))
t))))
(if regexp-p
(re-search-forward str nil t)
(search-forward str nil t)))
(save-excursion
(let ((point-found (match-end 0)))
(search-backward *acl2-doc-search-separator*)
(forward-line 1)
(let ((point-start (point)))
(cons (1+ (- point-found point-start)) ;; (point-min) = 1
(let ((beg (+ point-start 7))) ;;"Topic: "
(end-of-line)
(intern (buffer-substring beg (point)))))))))
(t nil)))
(defun acl2-doc-search-aux (str regexp-p)
(when (equal str "")
(error "Input a search string, or type \"n\" to continue previous search"))
(let* ((buf (acl2-doc-search-buffer))
(continue-p (and (or (eq regexp-p :next)
(eq regexp-p :previous))
regexp-p))
(str (cond
((not continue-p) str)
(t (or *acl2-doc-search-string*
(error "There is no previous search to continue")))))
(regexp-p (if continue-p
*acl2-doc-search-regexp-p*
regexp-p))
(pair nil))
(with-current-buffer
buf
(when (not continue-p)
(goto-char (point-min)))
(let (done)
(while (not done)
(let ((tmp (acl2-doc-search-aux-1 continue-p str regexp-p)))
(cond ((null tmp)
(setq done t))
((acl2-doc-under-limit-topic-p (cdr tmp))
(setq pair tmp done t)))))))
(cond (pair
;; The first two assignments are redundant if continue-p is true.
(setq *acl2-doc-search-string* str)
(setq *acl2-doc-search-regexp-p* regexp-p)
(let ((topic (cdr pair)))
(cond
((and (equal (buffer-name) *acl2-doc-buffer-name*)
*acl2-doc-history*
(eq topic (car (cdr (car *acl2-doc-history*)))))
(acl2-doc-display-message (car *acl2-doc-history*)))
(t (acl2-doc-display topic))))
(goto-char (car pair))
(acl2-doc-update-top-history-entry))
(continue-p (with-current-buffer
buf
(goto-char (if (eq continue-p :previous)
(point-max)
(point-min))))
(error "Try again for wrapped search"))
(t (error "Not found: %s" str)))))
(defun acl2-doc-search-main (str)
(interactive
(list
(read-from-minibuffer
(format "Search%s (then type n for next match): "
(if *acl2-doc-limit-topic*
(format " under %s"
*acl2-doc-limit-topic*)
"")))))
(acl2-doc-search-aux str nil))
(defun acl2-doc-search (&optional arg)
"Search forward from the top of the manual for the input string. If
the search succeeds, then go to that topic with the cursor put
immediately after the found text, with the topic name displayed in the
minibuffer. With prefix argument, consider (also for subsequent \"n\"
and \"p\" commands) only descendents of the topic supplied in response
to a prompt."
(interactive "P")
(acl2-doc-set-limit-topic arg)
(call-interactively 'acl2-doc-search-main))
(defun acl2-doc-re-search-main (str)
(interactive
(list
(read-from-minibuffer
(format "Regular Expression Search%s (then type n for next match): "
(if *acl2-doc-limit-topic*
(format " under %s"
*acl2-doc-limit-topic*)
"")))))
(acl2-doc-search-aux str t))
(defun acl2-doc-re-search (str)
"Perform a regular expression search, forward from the top of the
manual, for the input string. If the search succeeds, then go to that
topic with the cursor put immediately after the found text, with the
topic name displayed in the minibuffer. With prefix argument,
consider (also for subsequent \"n\" and \"p\" commands) only
descendents of the topic supplied in response to a prompt."
(interactive "P")
(acl2-doc-set-limit-topic arg)
(call-interactively 'acl2-doc-re-search-main))
(defun acl2-doc-search-next ()
"Find the next occurrence for the most recent search or regular
expression search."
(interactive)
(acl2-doc-search-aux nil :next))
(defun acl2-doc-search-previous ()
"Find the previous occurrence for the most recent search or regular
expression search. Note: as for \"n\", the cursor will end up at the end
of the match."
(interactive)
(acl2-doc-search-aux nil :previous))
(defun acl2-doc-tab ()
"Visit the next link after the cursor on the current page,
searching from the top if no link is below the cursor."
(interactive)
(switch-to-acl2-doc-buffer)
(cond ((or (re-search-forward "[[][^ ]+]" nil t)
(progn (goto-char (point-min))
(re-search-forward "[[][^ ]+]" nil t)))
(search-backward "[")
(forward-char 1))
(t (error "There are no links on this page."))))
(defun acl2-doc-tab-back ()
"Visit the previous link before the cursor on the current page,
searching from the bottom if no link is below the cursor."
(interactive)
(switch-to-acl2-doc-buffer)
(cond ((or (re-search-backward "[[][^ ]+]" nil t)
(progn (goto-char (point-max))
(re-search-backward "[[][^ ]+]" nil t)))
(forward-char 1))
(t (error "There are no links on this page."))))
(defun strip-cadrs (x)
(let ((ans nil))
(while x
(push (cadr (car x)) ans)
(setq x (cdr x)))
(reverse ans)))
(defun acl2-doc-history-buffer ()
;;; Return the history buffer, creating it first if necessary.
(or (get-buffer *acl2-doc-history-buffer-name*)
(let ((buf (get-buffer-create *acl2-doc-history-buffer-name*))
(alist (acl2-doc-state-alist)))
(with-current-buffer
buf
(while alist
(insert "\n")
(insert *acl2-doc-search-separator*)
(insert "\n")
(acl2-doc-print-topic (pop alist)))
(setq buffer-read-only t))
buf)))
(defun acl2-doc-history ()
"Visit a buffer that displays the names of all visited
topics in order, newest at the bottom. That buffer is in
acl2-doc mode; thus the usual acl2-doc commands may be used.
In particular, you can visit a displayed topic name by
putting your cursor on it and typing <RETURN>."
(interactive)
(let* ((buf0 (get-buffer *acl2-doc-history-buffer-name*))
(buf (or buf0
(get-buffer-create *acl2-doc-history-buffer-name*)))
(all (reverse *acl2-doc-all-topics-rev*)))
(switch-to-buffer *acl2-doc-history-buffer-name*)
(acl2-doc-mode)
(cond (buf0
(setq buffer-read-only nil)
(delete-region (point-min) (point-max))))
(insert "List of all visited topics in order, newest at the bottom:\n")
(insert "=========================================================\n")
(while all
(insert (format "%s" (pop all)))
(insert "\n"))
;;; We could bind x to *acl2-doc-history* and execute the commented-out form just
;;; below, after printing a separator such as the one above. If someone asks for
;;; this, we should think about printing the topics in *acl2-doc-return* as well,
;;; and maybe even display a single list if we can figure out a reasonable way to
;;; do so while indicating "last" and "return" information.
;;; (while x
;;; (insert (format "%s" (cadr (pop x))))
;;; (insert "\n"))
(setq buffer-read-only t)
(set-buffer-modified-p nil)
(goto-char (point-max))
(recenter -1)
(message "List of all visited topics in order, newest at the bottom")))
(defun acl2-doc-help ()
"Go to the ACL2-DOC topic to read about how to use the
ACL2-Doc browser."
(interactive)
(acl2-doc-go 'ACL2-DOC))
(when (not (boundp 'ctl-t-keymap))
; Warning: Keep this in sync with the introduction of ctl-t-keymap in
; emacs-acl2.el.
; Note that ctl-t-keymap will already be defined if this file is loaded
; from emacs-acl2.el. But if not, then we define it here.
; This trick probably came from Bob Boyer, to define a new keymap; so now
; control-t is the first character of a complex command.
(defvar ctl-t-keymap)
(setq ctl-t-keymap (make-sparse-keymap))
(define-key (current-global-map) "\C-T" ctl-t-keymap)
; Control-t t now transposes characters, instead of the former control-t.
(define-key ctl-t-keymap "\C-T" 'transpose-chars)
(define-key ctl-t-keymap "\C-t" 'transpose-chars)
)
(define-key global-map "\C-tg" 'acl2-doc)
(define-key global-map "\C-t." 'acl2-doc-go-from-anywhere)
(define-key acl2-doc-mode-map "g" 'acl2-doc-go)
(define-key acl2-doc-mode-map "\C-M" 'acl2-doc-go!)
(define-key acl2-doc-mode-map "i" 'acl2-doc-index)
(define-key acl2-doc-mode-map "," 'acl2-doc-index-next)
(define-key acl2-doc-mode-map "<" 'acl2-doc-index-previous)
(define-key acl2-doc-mode-map "I" 'acl2-doc-initialize)
(define-key acl2-doc-mode-map "h" 'acl2-doc-help)
(define-key acl2-doc-mode-map "l" 'acl2-doc-last)
(define-key acl2-doc-mode-map "n" 'acl2-doc-search-next)
(define-key acl2-doc-mode-map "p" 'acl2-doc-search-previous)
(define-key acl2-doc-mode-map "r" 'acl2-doc-return)
(define-key acl2-doc-mode-map "s" 'acl2-doc-search)
(define-key acl2-doc-mode-map "S" 'acl2-doc-re-search)
(define-key acl2-doc-mode-map "t" 'acl2-doc-top)
(define-key acl2-doc-mode-map "u" 'acl2-doc-up)
(define-key acl2-doc-mode-map "q" 'acl2-doc-quit)
(define-key acl2-doc-mode-map " " 'scroll-up)
(define-key acl2-doc-mode-map "D" 'acl2-doc-rendered-combined-download)
(define-key acl2-doc-mode-map "\t" 'acl2-doc-tab)
(define-key acl2-doc-mode-map (kbd "C-<tab>") 'acl2-doc-tab-back)
(define-key acl2-doc-mode-map "H" 'acl2-doc-history)
(define-key acl2-doc-mode-map "w" 'acl2-doc-where)
|