File: typegraph.lisp

package info (click to toggle)
acl2 8.5dfsg-5
  • links: PTS
  • area: main
  • in suites: bookworm
  • size: 991,452 kB
  • sloc: lisp: 15,567,759; javascript: 22,820; cpp: 13,929; ansic: 12,092; perl: 7,150; java: 4,405; xml: 3,884; makefile: 3,507; sh: 3,187; ruby: 2,633; ml: 763; python: 746; yacc: 723; awk: 295; csh: 186; php: 171; lex: 154; tcl: 49; asm: 23; haskell: 17
file content (336 lines) | stat: -rw-r--r-- 14,483 bytes parent folder | download | duplicates (4)
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
; Centaur Miscellaneous Books
; Copyright (C) 2018 Centaur Technology
;
; Contact:
;   Centaur Technology Formal Verification Group
;   7600-C N. Capital of Texas Highway, Suite 300, Austin, TX 78731, USA.
;   http://www.centtech.com/
;
; License: (An MIT/X11-style license)
;
;   Permission is hereby granted, free of charge, to any person obtaining a
;   copy of this software and associated documentation files (the "Software"),
;   to deal in the Software without restriction, including without limitation
;   the rights to use, copy, modify, merge, publish, distribute, sublicense,
;   and/or sell copies of the Software, and to permit persons to whom the
;   Software is furnished to do so, subject to the following conditions:
;
;   The above copyright notice and this permission notice shall be included in
;   all copies or substantial portions of the Software.
;
;   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
;   IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
;   FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
;   AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
;   LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
;   FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
;   DEALINGS IN THE SOFTWARE.
;
; Original author: Sol Swords <sswords@centtech.com>

(in-package "FTY")
(include-book "centaur/misc/graphviz" :dir :system)
(include-book "baselists")
(include-book "visitor")       

(fty::defalist typegraph-atts-alist :key-type symbol :val-type viz::att-list :true-listp t)


(defconst *typegraph-edge-atts*
  `((:constructor . ,(list (viz::make-att :lhs "weight" :rhs "1")))
    (:sum . ,(list (viz::make-att :lhs "weight" :rhs "2")))
    (:transsum . ,(list (viz::make-att :lhs "weight" :rhs "1")))
    (:product . ,(list (viz::make-att :lhs "weight" :rhs "1")))
    (:list . ,(list (viz::make-att :lhs "weight" :rhs "2")))
    (:alist . ,(list (viz::make-att :lhs "weight" :rhs "1")))
    (:option . ,(list (viz::make-att :lhs "weight" :rhs "2")))))

(defconst *typegraph-node-atts*
  `((:constructor . ,(list (viz::make-att :lhs "shape" :rhs "diamond")))
    (:sum . ,(list (viz::make-att :lhs "shape" :rhs "invhouse")))
    (:transsum . ,(list (viz::make-att :lhs "shape" :rhs "invhouse") (viz::make-att :lhs "style" :rhs "dotted")))
    (:product . ,(list (viz::make-att :lhs "shape" :rhs "house")))
    (:list . ,(list (viz::make-att :lhs "shape" :rhs "box")))
    (:alist . ,(list (viz::make-att :lhs "shape" :rhs "trapezium")))
    (:option . ,(list (viz::make-att :lhs "shape" :rhs "oval") (viz::make-att :lhs "style" :rhs "dotted")))))

(defprod typegraph-props
  ((omits symbol-listp)
   (leaves symbol-listp)
   (types symbol-listp)
   (graphname stringp)
   (edge-atts typegraph-atts-alist :default *typegraph-edge-atts*)
   (node-atts typegraph-atts-alist :default *typegraph-node-atts*)))


(program)

(table std::define 'std::default-post-hooks nil)


(define typegraph-membertype-collect-member-types (type x wrld)
  (b* (((typegraph-props x))
       (type (fty::visitor-normalize-fixtype type wrld))
       (omit (member type x.omits))
       ((when omit) nil))
    (list type)))

(define typegraph-membertypes-collect-member-types (types x wrld)
  :mode :program :hooks nil
  (b* (((when (atom types)) nil))
    (union-eq (typegraph-membertype-collect-member-types (car types) x wrld)
              (typegraph-membertypes-collect-member-types (cdr types) x wrld))))

(define typegraph-field-collect-member-types (field x wrld)
  (b* (((fty::flexprod-field field)))
    (typegraph-membertype-collect-member-types field.type x wrld)))

(define typegraph-fields-collect-member-types (fields x wrld)
  (b* (((when (atom fields)) nil)
       (subtypes1
        (typegraph-field-collect-member-types (car fields) x wrld))
       (subtypes2
        (typegraph-fields-collect-member-types (cdr fields) x wrld)))
    (union-eq subtypes1 subtypes2)))



;; (defmacro typegraph-edge-stmt (node1 node2 kind)
;;   `(make-edge-stmt
;;     :nodes (list ,node1 ,node2)
;;     :atts (list (cdr (assoc ,kind *typegraph-edge-atts*)))))

(logic)

(define typegraph-edges-from-node-aux ((node viz::node-or-subgraph-p)
                                       (children symbol-listp)
                                       (atts viz::att-list-p))
  :mode :logic :hooks (:fix)
  :returns (edges viz::stmtlist-p)
  (if (atom children)
      nil
    (cons (viz::make-edge-stmt :nodes
                               (list node
                                     (viz::make-node-or-subgraph-node
                                      :id (viz::make-node-id :name (symbol-name (car children)))))
                               :atts (list atts))
          (typegraph-edges-from-node-aux node (cdr children) atts))))

(local (defthm alistp-when-typegraph-atts-alist-p-rw
         (implies (typegraph-atts-alist-p x)
                  (alistp x))))

(local (defthm assoc-when-alistp
         (implies (alistp x)
                  (equal (assoc k x)
                         (hons-assoc-equal k x)))))

(define typegraph-edges-from-node ((node viz::node-id-p)
                                   (children symbol-listp)
                                   (kind symbolp)
                                   (props typegraph-props-p))
  :mode :logic :hooks (:fix)
  :returns (edges viz::stmtlist-p)
  (typegraph-edges-from-node-aux (viz::make-node-or-subgraph-node :id node)
                                 children
                                 (cdr (assoc (mbe :logic (acl2::symbol-fix kind) :exec kind)
                                             (typegraph-props->edge-atts props)))))





(defmacro typegraph-node-stmt (node kind props)
  `(viz::make-node-stmt
    :id ,node
    :atts (list (cdr (assoc ,kind (typegraph-props->node-atts ,props))))))


(program)

(define typegraph-prods-collect-member-types (prods x wrld)
  :returns (mv viz-stmts member-types)
  (b* (((when (atom prods)) (mv nil nil))
       ((fty::flexprod prod1) (car prods))
       (node (viz::make-node-id :name (symbol-name prod1.type-name)))
       (node-stmt (typegraph-node-stmt node :constructor x))
       (subtypes1 (typegraph-fields-collect-member-types prod1.fields x wrld))
       (edge-stmts (typegraph-edges-from-node node subtypes1 :constructor x))
       ((mv stmts subtypes2) (typegraph-prods-collect-member-types (cdr prods) x wrld)))
    (mv (cons node-stmt (append edge-stmts stmts))
        (union-eq subtypes1 subtypes2))))


(define typegraph-sumtype-collect-member-types (type x wrld)
  :returns (mv viz-stmts member-types)
  (b* (((fty::flexsum type))
       (node (viz::make-node-id :name (symbol-name type.name)))
       (productp (eql (len type.prods) 1))
       (optionp (eq type.typemacro 'fty::defoption))
       (node-stmt (cond (productp (typegraph-node-stmt node :product x))
                        (optionp (typegraph-node-stmt node :option x))
                        (t (typegraph-node-stmt node :sum x))))
       ((typegraph-props x))
       ((when (member type.name x.leaves)) (mv (list node-stmt) nil))
       ((when productp)
        (b* (((fty::flexprod prod) (car type.prods))
             (subtypes (typegraph-fields-collect-member-types prod.fields x wrld))
             (edge-stmts (typegraph-edges-from-node node subtypes :product x)))
          (mv (cons node-stmt edge-stmts) subtypes)))
       ((when optionp)
        (b* (((fty::flexprod prod) (cadr type.prods))
             (subtypes (typegraph-fields-collect-member-types prod.fields x wrld))
             (edge-stmts (typegraph-edges-from-node node subtypes :option x)))
          (mv (cons node-stmt edge-stmts) subtypes)))
       (prod-types (fty::flexprodlist->type-names type.prods))
       (edge-stmts (typegraph-edges-from-node node prod-types :sum x))
       ((mv stmts member-types) (typegraph-prods-collect-member-types type.prods x wrld)))
    (mv (cons node-stmt (append edge-stmts stmts))
        member-types)))
       

(define typegraph-listtype-collect-member-types (type x wrld)
  :returns (mv viz-stmts member-types)
  (b* (((fty::flexlist type))
       (node (viz::make-node-id :name (symbol-name type.name)))
       (node-stmt (typegraph-node-stmt node :list x))
       ((typegraph-props x))
       ((when (member type.name x.leaves)) (mv (list node-stmt) nil))
       (member-types (typegraph-membertype-collect-member-types type.elt-type x wrld))
       (edge-stmts (typegraph-edges-from-node node member-types :list x)))
    (mv (cons node-stmt edge-stmts) member-types)))
       

(define typegraph-alisttype-collect-member-types (type x wrld)
  :returns (mv viz-stmts member-types)
  (b* (((fty::flexalist type))
       (node (viz::make-node-id :name (symbol-name type.name)))
       (node-stmt (typegraph-node-stmt node :alist x))
       (member-types1 (typegraph-membertype-collect-member-types type.key-type x wrld))
       (member-types2 (typegraph-membertype-collect-member-types type.val-type x wrld))
       (member-types (union-eq member-types1 member-types2))
       (edge-stmts (typegraph-edges-from-node node member-types :alist x)))
    (mv (cons node-stmt edge-stmts) member-types)))

;; (define typegraph-transsum-members-without-actions (typenames x)
;;   ;; Which member types of a transsum should we recur through when we are marking
;;   ;; types to be visited?  Only the ones where the action is NONE.
;;   (b* (((when (atom typenames))
;;         nil)
;;        ((typegraph-props x))
;;        (type-entry (assoc (car typenames) x.type-fns))
;;        ((when (cdr type-entry))
;;         ;; The action is not NONE.
;;         (typegraph-transsum-members-without-actions (cdr typenames) x)))
;;     (cons (car typenames)
;;           (typegraph-transsum-members-without-actions (cdr typenames) x))))

;; (define typegraph-transsum-is-leaf (typenames x)
;;   ;; When should the transsum be considered a leaf?  When it has any member that
;;   ;; has an action that is not SKIP and not NONE.
;;   (b* (((when (atom typenames)) nil)
;;        ((typegraph-props x))
;;        (type (car typenames))
;;        (type-entry (assoc type x.type-fns))
;;        ((when (and (cdr type-entry)
;;                    (not (eq (cdr type-entry) :skip))))
;;         t))
;;     (typegraph-transsum-is-leaf (cdr typenames) x)))

(define typegraph-transsumtype-collect-member-types (type x wrld)
  :returns (mv viz-stmts member-types)
  (b* (((fty::flextranssum type))
       (node (viz::make-node-id :name (symbol-name type.name)))
       (node-stmt (typegraph-node-stmt node :transsum x))
       (subtypes (typegraph-membertypes-collect-member-types
                  (fty::flextranssum-memberlist->typenames type.members)
                  x wrld))
       (edge-stmts (typegraph-edges-from-node node subtypes :transsum x)))
    (mv (cons node-stmt edge-stmts) subtypes)))

(define typegraph-type-collect-member-types ((typename)
                                           (x "The typegraph-props object.")
                                           wrld)
  (b* (((mv ?fty type-obj)
        (fty::search-deftypes-table typename (table-alist 'fty::flextypes-table wrld)))
       ((unless type-obj)
        (mv nil nil)))
    (case (tag type-obj)
      ;; bozo should be using with-flextype-bindings eh?
      (:sum      (typegraph-sumtype-collect-member-types type-obj x wrld))
      (:list     (typegraph-listtype-collect-member-types type-obj x wrld))
      (:alist    (typegraph-alisttype-collect-member-types type-obj x wrld))
      (:transsum (typegraph-transsumtype-collect-member-types type-obj x wrld))
      (otherwise (mv nil nil)))))


(mutual-recursion
 (defun typegraph-type-make-type-graph (typename
                                      x           ;; typegraph-props template
                                      wrld
                                      type-graph
                                      seen)
   (b* (((when (hons-get typename seen))
         ;; already seen
         (mv type-graph seen))
        (seen (hons-acons typename nil seen))
        ((mv graph-stmts subtypes) (typegraph-type-collect-member-types typename x wrld))
        (type-graph (revappend graph-stmts type-graph)))
     (typegraph-types-make-type-graph subtypes x wrld type-graph seen)))

 (defun typegraph-types-make-type-graph (types x wrld type-graph seen)
   (b* (((when (atom types)) (mv type-graph seen))
        ((mv type-graph seen)
         (typegraph-type-make-type-graph (car types) x wrld type-graph seen)))
     (typegraph-types-make-type-graph (cdr types) x wrld type-graph seen))))

(define make-typegraph (typegraph-props
                        state)
  (b* (((typegraph-props typegraph-props))
       ((mv stmts seen)
        (typegraph-types-make-type-graph typegraph-props.types typegraph-props  (w state) nil nil))
       (- (fast-alist-free seen)))
    (viz::make-graph :directedp t :name typegraph-props.graphname :stmts (reverse stmts))))

(define typegraph-string (typegraph-props
                          state)
  (b* ((stmts (make-typegraph typegraph-props state)))
    (viz::graph-to-string stmts)))


(define print-typegraph-to-channel (typegraph-props
                                    channel
                                    state)
  :guard (open-output-channel-p channel :character state)
  (princ$ (typegraph-string typegraph-props state) channel state))
                          

(define print-typegraph (typegraph-props
                         state)
  (print-typegraph-to-channel typegraph-props (standard-co state) state))

(define print-typegraph-to-file (typegraph-props
                                 filename
                                 state)
  (b* (((mv channel state) (open-output-channel filename :character state))
       ((unless channel)
        (er hard? 'print-typgegraph-to-file "Couldn't open output file: ~s0~%" filename)
        state)
       (state (print-typegraph-to-channel typegraph-props channel state)))
    (close-output-channel channel state)))

;; Render for presentation:
;; dot filename.dot -Tjpeg -Gratio=0.55 -Gsize=8.0 -Gdpi=150 -Epenwidth=3.0 -Npenwidth=4.0 > filename.jpg

;; Render as PDF:
;; dot filename.dot -Tpdf -Gratio=0.55 -Gsize=8.0 -Gdpi=150 -Epenwidth=3.0 -Npenwidth=4.0 > filename.pdf

;; View in x11:
;; dot filename.dot -Tx11 -Gratio=0.55 -Gsize=8.0 -Gdpi=150 -Epenwidth=3.0 -Npenwidth=4.0