/[cmucl]/src/compiler/checkgen.lisp
ViewVC logotype

Contents of /src/compiler/checkgen.lisp

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1.24.2.2 - (hide annotations)
Tue May 23 16:37:01 2000 UTC (13 years, 11 months ago) by pw
Branch: RELENG_18
Changes since 1.24.2.1: +7 -1 lines
This set of revisions brings the RELENG_18 branch up to HEAD in preparation
for an 18c release.
1 wlott 1.1 ;;; -*- Package: C; Log: C.Log -*-
2     ;;;
3     ;;; **********************************************************************
4 ram 1.17 ;;; This code was written as part of the CMU Common Lisp project at
5     ;;; Carnegie Mellon University, and has been placed in the public domain.
6     ;;;
7     (ext:file-comment
8 pw 1.24.2.2 "$Header: /tiger/var/lib/cvsroots/cmucl/src/compiler/checkgen.lisp,v 1.24.2.2 2000/05/23 16:37:01 pw Exp $")
9 ram 1.17 ;;;
10 wlott 1.1 ;;; **********************************************************************
11     ;;;
12     ;;; This file implements type check generation. This is a phase that runs
13     ;;; at the very end of IR1. If a type check is too complex for the back end to
14     ;;; directly emit in-line, then we transform the check into an explicit
15     ;;; conditional using TYPEP.
16     ;;;
17     ;;; Written by Rob MacLachlan
18     ;;;
19 ram 1.22 (in-package "C")
20 wlott 1.1
21    
22     ;;;; Cost estimation:
23    
24    
25     ;;; Function-Cost -- Internal
26     ;;;
27     ;;; Return some sort of guess about the cost of a call to a function. If
28     ;;; the function has some templates, we return the cost of the cheapest one,
29     ;;; otherwise we return the cost of CALL-NAMED. Calling this with functions
30     ;;; that have transforms can result in relatively meaningless results
31     ;;; (exaggerated costs.)
32     ;;;
33     ;;; We randomly special-case NULL, since it does have a source tranform and is
34     ;;; interesting to us.
35     ;;;
36     (defun function-cost (name)
37     (declare (symbol name))
38     (let ((info (info function info name))
39 wlott 1.15 (call-cost (template-cost (template-or-lose 'call-named *backend*))))
40 wlott 1.1 (if info
41     (let ((templates (function-info-templates info)))
42     (if templates
43     (template-cost (first templates))
44     (case name
45 wlott 1.15 (null (template-cost (template-or-lose 'if-eq *backend*)))
46 wlott 1.1 (t call-cost))))
47     call-cost)))
48    
49    
50     ;;; Type-Test-Cost -- Internal
51     ;;;
52     ;;; Return some sort of guess for the cost of doing a test against TYPE.
53     ;;; The result need not be precise as long as it isn't way out in space. The
54     ;;; units are based on the costs specified for various templates in the VM
55     ;;; definition.
56     ;;;
57     (defun type-test-cost (type)
58     (declare (type ctype type))
59     (or (let ((check (type-check-template type)))
60     (if check
61     (template-cost check)
62 wlott 1.19 (let ((found (cdr (assoc type (backend-type-predicates *backend*)
63     :test #'type=))))
64 wlott 1.1 (if found
65 ram 1.16 (+ (function-cost found) (function-cost 'eq))
66 wlott 1.1 nil))))
67     (typecase type
68     (union-type
69     (collect ((res 0 +))
70     (dolist (mem (union-type-types type))
71     (res (type-test-cost mem)))
72     (res)))
73     (member-type
74     (* (length (member-type-members type))
75     (function-cost 'eq)))
76     (numeric-type
77     (* (if (numeric-type-complexp type) 2 1)
78     (function-cost
79     (if (csubtypep type (specifier-type 'fixnum)) 'fixnump 'numberp))
80     (+ 1
81     (if (numeric-type-low type) 1 0)
82     (if (numeric-type-high type) 1 0))))
83 pw 1.24.2.2 (cons-type
84     (+ (type-test-cost (specifier-type 'cons))
85     (function-cost 'car)
86     (type-test-cost (cons-type-car-type type))
87     (function-cost 'cdr)
88     (type-test-cost (cons-type-cdr-type type))))
89 wlott 1.1 (t
90     (function-cost 'typep)))))
91    
92    
93     ;;;; Checking strategy determination:
94    
95    
96 ram 1.3 ;;; MAYBE-WEAKEN-CHECK -- Internal
97     ;;;
98     ;;; Return the type we should test for when we really want to check for
99     ;;; Type. If speed, space or compilation speed is more important than safety,
100     ;;; then we return a weaker type if it is easier to check. First we try the
101     ;;; defined type weakenings, then look for any predicate that is cheaper.
102     ;;;
103     ;;; If the supertype is equal in cost to the type, we prefer the supertype.
104     ;;; This produces a closer approximation of the right thing in the presence of
105     ;;; poor cost info.
106     ;;;
107     (defun maybe-weaken-check (type cont)
108     (declare (type ctype type) (type continuation cont))
109     (cond ((policy (continuation-dest cont)
110     (<= speed safety) (<= space safety) (<= cspeed safety))
111     type)
112     (t
113     (let ((min-cost (type-test-cost type))
114     (min-type type)
115     (found-super nil))
116 wlott 1.19 (dolist (x (backend-type-predicates *backend*))
117 ram 1.3 (let ((stype (car x)))
118 ram 1.5 (when (and (csubtypep type stype)
119     (not (union-type-p stype))) ;Not #!% COMMON type.
120 ram 1.3 (let ((stype-cost (type-test-cost stype)))
121 ram 1.8 (when (or (< stype-cost min-cost)
122     (type= stype type))
123 ram 1.5 (setq found-super t)
124 ram 1.3 (setq min-type stype min-cost stype-cost))))))
125     (if found-super
126     min-type
127     *universal-type*)))))
128    
129    
130 ram 1.9 ;;; NO-FUNCTION-VALUES-TYPES -- Internal
131     ;;;
132     ;;; Like VALUES-TYPES, only mash any complex function types to FUNCTION.
133     ;;;
134     (defun no-function-values-types (type)
135     (declare (type ctype type))
136     (multiple-value-bind (res count)
137     (values-types type)
138     (values (mapcar #'(lambda (type)
139     (if (function-type-p type)
140     (specifier-type 'function)
141     type))
142     res)
143     count)))
144    
145    
146 ram 1.18 ;;; Switch to disable check complementing, for evaluation.
147     ;;;
148     (defvar *complement-type-checks* t)
149    
150 wlott 1.1 ;;; MAYBE-NEGATE-CHECK -- Internal
151     ;;;
152     ;;; Cont is a continuation we are doing a type check on and Types is a list
153     ;;; of types that we are checking its values against. If we have proven
154     ;;; that Cont generates a fixed number of values, then for each value, we check
155 pw 1.24.2.1 ;;; whether it is cheaper to then difference between the proven type and
156 wlott 1.1 ;;; the corresponding type in Types. If so, we opt for a :HAIRY check with
157     ;;; that test negated. Otherwise, we try to do a simple test, and if that is
158 ram 1.13 ;;; impossible, we do a hairy test with non-negated types. If true,
159     ;;; Force-Hairy forces a hairy type check.
160 wlott 1.1 ;;;
161 ram 1.16 ;;; When doing a non-negated check, we call MAYBE-WEAKEN-CHECK to weaken the
162     ;;; test to a convenient supertype (conditional on policy.) If debug-info is
163     ;;; not particularly important (debug <= 1) or speed is 3, then we allow
164     ;;; weakened checks to be simple, resulting in less informative error messages,
165     ;;; but saving space and possibly time.
166 ram 1.7 ;;;
167 ram 1.13 (defun maybe-negate-check (cont types force-hairy)
168 wlott 1.1 (declare (type continuation cont) (list types))
169 ram 1.9 (multiple-value-bind
170     (ptypes count)
171     (no-function-values-types (continuation-proven-type cont))
172 wlott 1.1 (if (eq count :unknown)
173 ram 1.13 (if (and (every #'type-check-template types) (not force-hairy))
174 wlott 1.1 (values :simple types)
175 ram 1.3 (values :hairy
176     (mapcar #'(lambda (x)
177     (list nil (maybe-weaken-check x cont) x))
178     types)))
179 wlott 1.1 (let ((res (mapcar #'(lambda (p c)
180 ram 1.7 (let ((diff (type-difference p c))
181     (weak (maybe-weaken-check c cont)))
182 wlott 1.1 (if (and diff
183     (< (type-test-cost diff)
184 ram 1.18 (type-test-cost weak))
185     *complement-type-checks*)
186 ram 1.7 (list t diff c)
187     (list nil weak c))))
188 wlott 1.1 ptypes types)))
189 ram 1.16 (cond ((or force-hairy (find-if #'first res))
190     (values :hairy res))
191     ((every #'type-check-template types)
192     (values :simple types))
193     ((policy (continuation-dest cont)
194     (or (<= debug 1) (and (= speed 3) (/= debug 3))))
195     (let ((weakened (mapcar #'second res)))
196     (if (every #'type-check-template weakened)
197     (values :simple weakened)
198     (values :hairy res))))
199     (t
200     (values :hairy res)))))))
201 wlott 1.1
202    
203     ;;; CONTINUATION-CHECK-TYPES -- Interface
204     ;;;
205     ;;; Determines whether Cont's assertion is:
206     ;;; -- Checkable by the back end (:SIMPLE), or
207     ;;; -- Not checkable by the back end, but checkable via an explicit test in
208     ;;; type check conversion (:HAIRY), or
209     ;;; -- not reasonably checkable at all (:TOO-HAIRY).
210     ;;;
211     ;;; A type is checkable if it either represents a fixed number of values (as
212     ;;; determined by VALUES-TYPES), or it is the assertion for an MV-Bind. A type
213     ;;; is simply checkable if all the type assertions have a TYPE-CHECK-TEMPLATE.
214     ;;; In this :SIMPLE case, the second value is a list of the type restrictions
215     ;;; specified for the leading positional values.
216     ;;;
217 ram 1.13 ;;; We force a check to be hairy even when there are fixed values if we are in
218     ;;; a context where we may be forced to use the unknown values convention
219     ;;; anyway. This is because IR2tran can't generate type checks for unknown
220     ;;; values continuations but people could still be depending on the check being
221     ;;; done. We only care about EXIT and RETURN (not MV-COMBINATION) since these
222     ;;; are the only contexts where the ultimate values receiver
223     ;;;
224 wlott 1.1 ;;; In the :HAIRY case, the second value is a list of triples of the form:
225     ;;; (Not-P Type Original-Type)
226     ;;;
227     ;;; If true, the Not-P flag indicates a test that the corresponding value is
228     ;;; *not* of the specified Type. Original-Type is the type asserted on this
229     ;;; value in the continuation, for use in error messages. When Not-P is true,
230     ;;; this will be different from Type.
231     ;;;
232     ;;; This allows us to take what has been proven about Cont's type into
233     ;;; consideration. If it is cheaper to test for the difference between the
234     ;;; derived type and the asserted type, then we check for the negation of this
235     ;;; type instead.
236     ;;;
237     (defun continuation-check-types (cont)
238     (declare (type continuation cont))
239     (let ((type (continuation-asserted-type cont))
240     (dest (continuation-dest cont)))
241     (assert (not (eq type *wild-type*)))
242     (multiple-value-bind (types count)
243 ram 1.9 (no-function-values-types type)
244 wlott 1.1 (cond ((not (eq count :unknown))
245 ram 1.13 (if (or (exit-p dest)
246     (and (return-p dest)
247     (multiple-value-bind
248     (ignore count)
249     (values-types (return-result-type dest))
250     (declare (ignore ignore))
251     (eq count :unknown))))
252     (maybe-negate-check cont types t)
253     (maybe-negate-check cont types nil)))
254 wlott 1.1 ((and (mv-combination-p dest)
255     (eq (basic-combination-kind dest) :local))
256     (assert (values-type-p type))
257 ram 1.13 (maybe-negate-check cont (args-type-optional type) nil))
258 wlott 1.1 (t
259     (values :too-hairy nil))))))
260    
261    
262     ;;; Probable-Type-Check-P -- Internal
263     ;;;
264     ;;; Return true if Cont is a continuation whose type the back end is likely
265     ;;; to want to check. Since we don't know what template the back end is going
266     ;;; to choose to implement the continuation's DEST, we use a heuristic. We
267     ;;; always return T unless:
268     ;;; -- Nobody uses the value, or
269 ram 1.3 ;;; -- Safety is totally unimportant, or
270 wlott 1.1 ;;; -- the continuation is an argument to an unknown function, or
271     ;;; -- the continuation is an argument to a known function that has no
272     ;;; IR2-Convert method or :fast-safe templates that are compatible with the
273     ;;; call's type.
274     ;;;
275     ;;; We must only return nil when it is *certain* that a check will not be done,
276     ;;; since if we pass up this chance to do the check, it will be too late. The
277     ;;; penalty for being too conservative is duplicated type checks.
278     ;;;
279 ram 1.13 ;;; If there is a compile-time type error, then we always return true unless
280     ;;; the DEST is a full call. With a full call, the theory is that the type
281     ;;; error is probably from a declaration in (or on) the callee, so the callee
282     ;;; should be able to do the check. We want to let the callee do the check,
283     ;;; because it is possible that the error is really in the callee, not the
284     ;;; caller. We don't want to make people recompile all calls to a function
285     ;;; when they were originally compiled with a bad declaration (or an old type
286     ;;; assertion derived from a definition appearing after the call.)
287 wlott 1.1 ;;;
288     (defun probable-type-check-p (cont)
289     (declare (type continuation cont))
290     (let ((dest (continuation-dest cont)))
291 ram 1.13 (cond ((eq (continuation-type-check cont) :error)
292 ram 1.22 (if (and (combination-p dest) (eq (combination-kind dest) :error))
293 ram 1.13 nil
294     t))
295 wlott 1.1 ((or (not dest)
296 ram 1.3 (policy dest (zerop safety)))
297 wlott 1.1 nil)
298     ((basic-combination-p dest)
299     (let ((kind (basic-combination-kind dest)))
300     (cond ((eq cont (basic-combination-fun dest)) t)
301     ((eq kind :local) t)
302 ram 1.22 ((member kind '(:full :error)) nil)
303 wlott 1.1 ((function-info-ir2-convert kind) t)
304     (t
305     (dolist (template (function-info-templates kind) nil)
306 ram 1.6 (when (eq (template-policy template) :fast-safe)
307     (multiple-value-bind
308     (val win)
309     (valid-function-use dest (template-type template))
310     (when (or val (not win)) (return t)))))))))
311 wlott 1.1 (t t))))
312    
313    
314     ;;; Make-Type-Check-Form -- Internal
315     ;;;
316     ;;; Return a form that we can convert to do a hairy type check of the
317     ;;; specified Types. Types is a list of the format returned by
318     ;;; Continuation-Check-Types in the :HAIRY case. In place of the actual
319     ;;; value(s) we are to check, we use 'Dummy. This constant reference is later
320     ;;; replaced with the actual values continuation.
321     ;;;
322     ;;; Note that we don't attempt to check for required values being unsupplied.
323     ;;; Such checking is impossible to efficiently do at the source level because
324     ;;; our fixed-values conventions are optimized for the common MV-Bind case.
325     ;;;
326     ;;; We can always use Multiple-Value-Bind, since the macro is clever about
327     ;;; binding a single variable.
328     ;;;
329     (defun make-type-check-form (types)
330     (collect ((temps))
331     (dotimes (i (length types))
332     (temps (gensym)))
333    
334     `(multiple-value-bind ,(temps)
335     'dummy
336     ,@(mapcar #'(lambda (temp type)
337 ram 1.10 (let* ((spec
338     (let ((*unparse-function-type-simplify* t))
339     (type-specifier (second type))))
340 wlott 1.1 (test (if (first type) `(not ,spec) spec)))
341     `(unless (typep ,temp ',test)
342     (%type-check-error
343     ,temp
344     ',(type-specifier (third type))))))
345     (temps) types)
346     (values ,@(temps)))))
347    
348    
349     ;;; Convert-Type-Check -- Internal
350     ;;;
351     ;;; Splice in explicit type check code immediately before the node that its
352     ;;; Cont's Dest. This code receives the value(s) that were being passed to
353     ;;; Cont, checks the type(s) of the value(s), then passes them on to Cont.
354     ;;; We:
355     ;;; -- Ensure that Cont starts a block, so that we can freely manipulate its
356     ;;; uses.
357     ;;; -- Make a new continuation and move Cont's uses to it. Set type set
358     ;;; Type-Check in Cont to :DELETED to indicate that the check has been
359     ;;; done.
360     ;;; -- Make the Dest node start its block so that we can splice in the type
361     ;;; check code.
362     ;;; -- Splice in a new block before the Dest block, giving it all the Dest's
363     ;;; predecessors.
364     ;;; -- Convert the check form, using the new block start as Start and a dummy
365     ;;; continuation as Cont.
366     ;;; -- Set the new block's start and end cleanups to the *start* cleanup of
367     ;;; Prev's block. This overrides the incorrect default from
368     ;;; With-IR1-Environment.
369     ;;; -- Finish off the dummy continuation's block, and change the use to a use
370     ;;; of Cont. (we need to use the dummy continuation to get the control
371     ;;; transfer right, since we want to go to Prev's block, not Cont's.)
372     ;;; Link the new block to Prev's block.
373     ;;; -- Substitute the new continuation for the dummy placeholder argument.
374     ;;; Since no let conversion has been done yet, we can find the placeholder.
375     ;;; The [mv-]combination node from the mv-bind in the check form will be
376     ;;; the Use of the new check continuation. We substitute for the first
377     ;;; argument of this node.
378     ;;; -- Invoke local call analysis to convert the call to a let.
379     ;;;
380     (defun convert-type-check (cont types)
381     (declare (type continuation cont) (list types))
382     (with-ir1-environment (continuation-dest cont)
383     (ensure-block-start cont)
384     (let* ((new-start (make-continuation))
385     (dest (continuation-dest cont))
386     (prev (node-prev dest)))
387     (continuation-starts-block new-start)
388     (substitute-continuation-uses new-start cont)
389     (setf (continuation-%type-check cont) :deleted)
390    
391     (when (continuation-use prev)
392     (node-ends-block (continuation-use prev)))
393    
394     (let* ((prev-block (continuation-block prev))
395     (new-block (continuation-block new-start))
396     (dummy (make-continuation)))
397     (dolist (block (block-pred prev-block))
398     (change-block-successor block prev-block new-block))
399     (ir1-convert new-start dummy (make-type-check-form types))
400     (assert (eq (continuation-block dummy) new-block))
401    
402     (let ((node (continuation-use dummy)))
403     (setf (block-last new-block) node)
404     (delete-continuation-use node)
405     (add-continuation-use node cont))
406     (link-blocks new-block prev-block))
407    
408     (let* ((node (continuation-use cont))
409     (args (basic-combination-args node))
410     (victim (first args)))
411     (assert (and (= (length args) 1)
412     (eq (constant-value
413     (ref-leaf
414     (continuation-use victim)))
415     'dummy)))
416     (substitute-continuation new-start victim)))
417    
418     (local-call-analyze *current-component*))
419    
420     (undefined-value))
421    
422    
423 ram 1.13 ;;; DO-TYPE-WARNING -- Internal
424     ;;;
425     ;;; Emit a type warning for Node. If the value of node is being used for a
426     ;;; variable binding, we figure out which one for source context. If the value
427 ram 1.14 ;;; is a constant, we print it specially. We ignore nodes whose type is NIL,
428     ;;; since they are supposed to never return.
429 ram 1.13 ;;;
430     (defun do-type-warning (node)
431     (declare (type node node))
432     (let* ((*compiler-error-context* node)
433     (cont (node-cont node))
434     (atype-spec (type-specifier (continuation-asserted-type cont)))
435     (dtype (node-derived-type node))
436     (dest (continuation-dest cont))
437     (what (when (and (combination-p dest)
438     (eq (combination-kind dest) :local))
439     (let ((lambda (combination-lambda dest))
440 ram 1.23 (pos (eposition cont (combination-args dest))))
441 ram 1.13 (format nil "~:[A possible~;The~] binding of ~S"
442     (and (continuation-use cont)
443     (eq (functional-kind lambda) :let))
444     (leaf-name (elt (lambda-vars lambda) pos)))))))
445 ram 1.14 (cond ((eq dtype *empty-type*))
446     ((and (ref-p node) (constant-p (ref-leaf node)))
447     (compiler-warning "~:[This~;~:*~A~] is not a ~<~%~9T~:;~S:~>~% ~S"
448 ram 1.13 what atype-spec (constant-value (ref-leaf node))))
449 ram 1.14 (t
450     (compiler-warning
451     "~:[Result~;~:*~A~] is a ~S, ~<~%~9T~:;not a ~S.~>"
452     what (type-specifier dtype) atype-spec))))
453 ram 1.13 (undefined-value))
454    
455    
456     ;;; MARK-ERROR-CONTINUATION -- Internal
457     ;;;
458     ;;; Mark Cont as being a continuation with a manifest type error. We set
459     ;;; the kind to :ERROR, and clear any FUNCTION-INFO if the continuation is an
460     ;;; argument to a known call. The last is done so that the back end doesn't
461     ;;; have to worry about type errors in arguments to known functions. This
462     ;;; clearing is inhibited for things with IR2-CONVERT methods, since we can't
463     ;;; do a full call to funny functions.
464     ;;;
465     (defun mark-error-continuation (cont)
466     (declare (type continuation cont))
467     (setf (continuation-%type-check cont) :error)
468     (let ((dest (continuation-dest cont)))
469     (when (and (combination-p dest)
470 ram 1.22 (let ((kind (basic-combination-kind dest)))
471     (or (eq kind :full)
472     (and (function-info-p kind)
473     (not (function-info-ir2-convert kind))))))
474     (setf (basic-combination-kind dest) :error)))
475 ram 1.13 (undefined-value))
476    
477    
478 wlott 1.1 ;;; Generate-Type-Checks -- Interface
479     ;;;
480     ;;; Loop over all blocks in Component that have TYPE-CHECK set, looking for
481     ;;; continuations with TYPE-CHECK T. We do two mostly unrelated things: detect
482     ;;; compile-time type errors and determine if and how to do run-time type
483     ;;; checks.
484     ;;;
485 ram 1.13 ;;; If there is a compile-time type error, then we mark the continuation and
486     ;;; emit a warning if appropriate. This part loops over all the uses of the
487     ;;; continuation, since after we convert the check, the :DELETED kind will
488     ;;; inhibit warnings about the types of other uses.
489 ram 1.2 ;;;
490 wlott 1.1 ;;; If a continuation is too complex to be checked by the back end, or is
491     ;;; better checked with explicit code, then convert to an explicit test.
492     ;;; Assertions that can checked by the back end are passed through. Assertions
493     ;;; that can't be tested are flamed about and marked as not needing to be
494     ;;; checked.
495     ;;;
496     ;;; If we determine that a type check won't be done, then we set TYPE-CHECK
497     ;;; to :NO-CHECK. In the non-hairy cases, this is just to prevent us from
498     ;;; wasting time coming to the same conclusion again on a later iteration. In
499     ;;; the hairy case, we must indicate to LTN that it must choose a safe
500     ;;; implementation, since IR2 conversion will choke on the check.
501     ;;;
502 pw 1.24.2.1 ;;; The generation of the type checks is delayed until all the type
503     ;;; check decisions have been made because the generation of the type
504     ;;; checks creates new nodes who's derived types aren't always updated
505     ;;; which may lead to inappropriate template choices due to the
506     ;;; modification of argument types.
507     ;;;
508 wlott 1.1 (defun generate-type-checks (component)
509 pw 1.24.2.1 (collect ((conts))
510     (do-blocks (block component)
511     (when (block-type-check block)
512     (do-nodes (node cont block)
513     (let ((type-check (continuation-type-check cont)))
514     (unless (member type-check '(nil :error :deleted))
515     (let ((atype (continuation-asserted-type cont)))
516     (do-uses (use cont)
517     (unless (values-types-intersect (node-derived-type use)
518     atype)
519     (mark-error-continuation cont)
520     (unless (policy node (= brevity 3))
521     (do-type-warning use))))))
522     (when (and (eq type-check t)
523     (not *byte-compiling*))
524     (if (probable-type-check-p cont)
525     (conts cont)
526     (setf (continuation-%type-check cont) :no-check)))))
527    
528     (setf (block-type-check block) nil)))
529    
530     (dolist (cont (conts))
531     (multiple-value-bind (check types)
532     (continuation-check-types cont)
533     (ecase check
534     (:simple)
535     (:hairy
536     (convert-type-check cont types))
537     (:too-hairy
538     (let* ((context (continuation-dest cont))
539     (*compiler-error-context* context))
540     (when (policy context (>= safety brevity))
541     (compiler-note
542     "Type assertion too complex to check:~% ~S."
543     (type-specifier (continuation-asserted-type cont)))))
544     (setf (continuation-%type-check cont) :deleted))))))
545    
546 wlott 1.1 (undefined-value))

  ViewVC Help
Powered by ViewVC 1.1.5