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
|
;;;-*- Mode:LISP; Package:CHAOS; Base:10; Syntax:Common-lisp -*-
;;;
;;; Copyright (c) 2000-2015, Toshimi Sawada. All rights reserved.
;;;
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are permitted provided that the following conditions
;;; are met:
;;;
;;; * Redistributions of source code must retain the above copyright
;;; notice, this list of conditions and the following disclaimer.
;;;
;;; * Redistributions in binary form must reproduce the above
;;; copyright notice, this list of conditions and the following
;;; disclaimer in the documentation and/or other materials
;;; provided with the distribution.
;;;
;;; THIS SOFTWARE IS PROVIDED BY THE AUTHOR 'AS IS' AND ANY EXPRESSED
;;; OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
;;; WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
;;; ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
;;; DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
;;; DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
;;; GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
;;; INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
;;; WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
;;; NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
;;; SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
;;;
(in-package :chaos)
#|==============================================================================
System: CHAOS
Module: tools
File: sort-tree.lisp
==============================================================================|#
#-:chaos-debug
(declaim (optimize (speed 3) (safety 0) #-GCL (debug 0)))
#+:chaos-debug
(declaim (optimize (speed 1) (safety 3) #-GCL (debug 3)))
(defun make-module-sort-tree (mod)
(prepare-for-parsing mod)
(let* ((sorder (module-sort-order mod))
(kinds (get-kinds sorder))
(sls (module-sort-relations mod)))
(labels ((make-tree (s)
(let ((sl (assq s sls)))
(if sl
(cons s (mapcar #'(lambda (x) (make-tree x))
(maximal-sorts (_subsorts sl) sorder)))
(list s)))))
(mapc #'(lambda (k)
(setf (cdr k)
(maximal-sorts (cdr k) sorder)))
kinds)
(mapc #'(lambda (k)
(setf (cdr k)
(mapcar #'(lambda (x) (make-tree x))
(cdr k))))
kinds)
kinds)))
(defun make-sort-tree (sort &optional (mod (get-object-context sort)))
(let* ((so (module-sort-order mod))
(kind (the-err-sort sort so))
(sls (module-sort-relations mod))
(fam (maximal-sorts (get-family kind so) so)))
(labels ((make-tree (s)
(let ((sl (assq s sls)))
(if sl
(cons s (mapcar #'(lambda (x) (make-tree x))
(maximal-sorts (_subsorts sl) so)))
(list s)))))
(cons kind
(mapcar #'(lambda (x) (make-tree x)) fam)))))
;;; PRINT-SORT-TREE
(defun print-sort-tree (sort &optional
(stream *standard-output*)
(mod (get-object-context sort)))
(!print-sort-tree sort stream mod nil))
(defun print-sort-graph (sort &optional
(stream *standard-output*)
(mod (get-object-context sort)))
(!print-sort-tree sort stream mod t))
(defun !print-sort-tree (sort stream mod show-as-graph)
(let* ((leaf? #'(lambda (tree) (null (cdr tree))))
(leaf-name #'(lambda (tree)
(with-output-to-string (str)
(print-sort-name (car tree) mod str)
str)))
(leaf-info #'(lambda (tree) (declare (ignore tree)) t))
(int-node-name #'(lambda (tree)
(funcall leaf-name tree)))
(int-node-children #'(lambda (tree) (cdr tree))))
(force-output stream)
(print-next nil *print-indent* stream)
(print-trees (list (if show-as-graph
(augment-tree-as-graph (make-sort-tree sort mod))
(augment-tree (make-sort-tree sort mod))))
stream)))
;;; PRINT-MODULE-SORT-TREE
(defun print-module-sort-tree (&optional (mod (get-context-module))
(stream *standard-output*))
(!print-module-sort-tree mod stream nil))
(defun print-module-sort-graph (&optional (mod (get-context-module))
(stream *standard-output*))
(!print-module-sort-tree mod stream t))
(defun !print-module-sort-tree (mod stream show-as-graph)
(let* ((leaf? #'(lambda (tree) (null (cdr tree))))
(leaf-name #'(lambda (tree)
(with-output-to-string (str)
(print-sort-name (car tree) mod str)
str)))
(leaf-info #'(lambda (tree) (declare (ignore tree)) t))
(int-node-name #'(lambda (tree)
(funcall leaf-name tree)))
(int-node-children #'(lambda (tree) (cdr tree))))
(dolist (tree (make-module-sort-tree mod))
(force-output stream)
(print-next nil *print-indent* stream)
(princ "------------------------------------------------------------")
(print-next nil *print-indent* stream)
(print-trees (list (if show-as-graph
(augment-tree-as-graph tree)
(augment-tree tree)))
stream))))
;;; EOF
|
