File: bview2.lisp

package info (click to toggle)
cafeobj 1.6.0-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, sid
  • size: 19,900 kB
  • sloc: lisp: 85,055; sh: 659; makefile: 437; perl: 147
file content (270 lines) | stat: -rw-r--r-- 10,334 bytes parent folder | download | duplicates (2)
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
;;;-*- 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: primitives
                                File: bview.lisp
==============================================================================|#
#-:chaos-debug
(declaim (optimize (speed 3) (safety 0) #-GCL (debug 0)))
#+:chaos-debug
(declaim (optimize (speed 1) (safety 3) #-GCL (debug 3)))

;;; ****************************************************************************
;;; ************* INTERNAL STRUCTURE OF VIEW & BASIC OPERATIONS ****************
;;; ****************************************************************************

;;; ****
;;; VIEW _______________________________________________________________________
;;; ****
;;;  - source & target modules are evaluated.
;;;  - sorts "found".
;;;  - terms parsed, operator references are resolved.
;;;  - variables are eliminated.
;;;-----------------------------------------------------------------------------
;;; accessors, all are setf'able

(defmacro view-name (_view) `(view-struct-name ,_view))
(defmacro view-src (_view) `(view-struct-src ,_view))
(defmacro view-source (_view) `(view-struct-src ,_view)) ; synonym
(defmacro view-target (_view) `(view-struct-target ,_view))
(defmacro view-sort-maps (_view) `(view-struct-sort-maps ,_view))
(defmacro view-op-maps (_view) `(view-struct-op-maps ,_view))
(defmacro view-decl-form (_view) `(object-decl-form ,_view))
(defmacro view-interface (_view) `(view-struct-interface ,_view))
(defmacro view-exporting-objects (_view) `(object-exporting-objects ,_view))
(defmacro view-status (_view) `(object-status ,_view))

;;; view status
(defun mark-view-as-consistent (view)
  (declare (type view-struct view)
           (values fixnum))
  (setf (object-status view) 1))

;;; change propagation
;;; NOTE: this is not enough, now defined in module.lisp
;;; (defun propagate-view-change (view)
;;;   (declare (type view-struct view)
;;;        (values t))
;;;   (propagate-object-change (view-exporting-objects view)))

;;; copy
(defun copy-view (from to)
  (declare (type view-struct from to)
           (values t))
  (setf (view-name to) (view-name from)
        (view-decl-form to) (view-decl-form from)
        (view-src to) (view-src from)
        (view-target to) (view-target from)
        (view-sort-maps to) (view-sort-maps from)
        (view-op-maps to) (view-op-maps from)
        (view-interface to) (view-interface from)))

;;; initialization
(defun initialize-view (view)
  (declare (type view-struct view)
           (values t))
  (setf (view-status view) -1)
  (if (the (or null ex-interface) (view-interface view))
      (initialize-object-interface (view-interface view))
      (setf (view-interface view) (make-ex-interface)))
  (setf (view-src view) nil
        (view-target view) nil
        (view-sort-maps view) nil
        (view-op-maps view) nil
        (view-decl-form view) nil
        ))

(defun clean-up-view (view)
  (declare (type view-struct view)
           (values t))
  (setf (view-name view) nil)
  (setf (view-status view) 0)
  (if (view-interface view)
      (clean-up-ex-interface (view-interface view)))
  (setf (view-interface view) nil)
  (setf (view-src view) nil
        (view-target view) nil
        (view-sort-maps view) nil
        (view-op-maps view) nil
        (view-decl-form view) nil
        ))


;;; UTILS \\\\\\\\\\\\\\\\

;;; SAME-TOP-LEVEL : Module-Expression Module-Expression -> Bool
;;; - checks if two module expressions the same assuming that they have
;;;   been canonicalized below the top level.
;;; - cannot expect all parts of module expressions that have been put in
;;;   normal form to be equal.
;;;
(defun module-eq (x y)
  (declare (type t x y)
           (values (or null t)))
  (or (equal x y)
      (and (module-p x) (module-eq (module-name x) y))
      (and (module-p y) (module-eq x (module-name y)))))

(defmacro same-renamed-module (_r1 _r2) `(outer-equal ,_r1 ,_r2))

(defmacro same-view-mapping (_v1 _v2) `(outer-equal ,_v1 ,_v2))

(defun outer-equal (x y)
  (declare (type t x y)
           (values (or null t)))
  (cond ((stringp x) (equal x y))
        ((atom x) (eq x y))             ;note this includes structures and vectors
        ((consp x)
         (cond ((term? x) (eq x y))
               (t 
                (and (consp y)
                     (do ((xl x (cdr xl))
                          (yl y (cdr yl))
                          (flag t))
                         ((or (when (or (atom xl) (atom yl))
                                (setq flag (eq xl yl))
                                t)
                              (when (not (outer-equal (car xl) (car yl)))
                                (setq flag nil)
                                t))
                          flag))))))
        (t nil)))

(defun same-top-level (me1 me2)
  (declare (type t me1 me2)
           (values (or null t)))
  (or (module-eq me1 me2)
      (if (and (chaos-ast? me1) (chaos-ast? me2))
          (cond
            (;; me1 is renaming 
             (%is-rename me1)
             (and (%is-rename me2)
                  (module-eq (%rename-module me1) (%rename-module me2))
                  (same-renamed-module (%rename-map me1) (%rename-map me2))))
            
            (;; me1 is instantiation
             (%is-instantiation me1)
             (and (%is-instantiation me2)
                  (module-eq (%instantiation-module me1)
                             (%instantiation-module me2))
                  (let ((args1 (%instantiation-args me1))
                        (args2 (%instantiation-args me2)))
                    (declare (type list args1 args2))
                    (and (= (length args1) (length args2))
                         (every #'eq args1 args2)))))
            
            (;; me1 is module sum
             (%is-plus me1)
             (and (%is-plus me2)
                  (equal (%plus-args me1) (%plus-args me2))))
            ;; 
            ;; view
            ((or (%is-view me1)
                 (%is-view me2))
             (and (module-eq (%view-module me1) (%view-module me2))
                  (module-eq (%view-target me1) (%view-target me2))
                  (same-view-mapping (%view-map me1)
                                     (%view-map me2))))
            
            (t nil))
          (if (and (view-p me1) (view-p me2))
              (and (module-eq (view-src me1)
                              (view-src me2))
                   (module-eq (view-target me1)
                              (view-target me2))
                   (same-view-mapping (view-sort-maps me1)
                                      (view-sort-maps me2))
                   (same-view-mapping (view-op-maps me1) (view-op-maps me2)))
              ;;
              ;; non pure chaos-object
              ;;
              (cond ((and (consp me1) (consp me2))
                     (= (length (the cons me1))
                        (length (the cons me2)))
                     (every #'eql me1 me2))
                    ((equal me1 me2) t)
                    ((or (and (atom me2) (not (chaos-ast? me2)))
                         (not (listp me1))
                         (not (listp me2))
                         (not (= (length me1) (length me2))))
                     nil)
                    (t nil)
                    )))))

;;; ************
;;; DUMMY MODULE________________________________________________________________
;;; ************

;;; dymmy module is used for delays the identification of module to which mapped
;;; (renamed) sorts or operators belog.

(defmacro get-rename-info (*_*mod) `(getf (object-misc-info ,*_*mod) 'rename-mod))

(defun create-dummy-module (map mod info)
  (declare (type modmorph map)
           (type module mod)
           (type t info)
           (values module))
  (let ((val (assq mod (modmorph-module map))))
    (if val
        (cdr val)
        (let ((newmod (make-module :name "DUMMY")))
          (initialize-module newmod)
          (setf (get-rename-info newmod) (cons mod info))
          newmod))))

(defun create-dummy-module-then-map (map mod info)
  (declare (type modmorph map)
           (type module mod)
           (type t info)
           (values module))
  (let ((dmod (create-dummy-module map mod info)))
    (pushnew (cons mod dmod) (modmorph-module map)
             :key #'car :test #'eq)
    dmod))

(defun module-is-rename-dummy-for (mod1 mod)
  (declare (type module mod1 mod)
           (values (or null t)))
  (if (equal "DUMMY" (module-name mod1))
      (let* ((info (get-rename-info mod))
             (oldmod (car info)))
        (eq oldmod mod))
      ))

(defun is-dummy-module (mod)
  (declare (type t mod)
           (values (or null t)))
  (and (module-p mod)
       (equal "DUMMY" (module-name mod))))


;;; EOF