- Dec 14, 1991
- Dec 13, 1991
-
-
wlott authored
-
wlott authored
-
wlott authored
was trying to print the stream to the structure instead of print the structure to the stream.
-
wlott authored
structure (was causing suffixes to be ignored with line abbrevs). Fixed an off-by-one error in desciding when to use line abbrevs. Fixed output-line to make sure the buffer is large enough to fit the prefix before we copy it in. Added several new keywords to pprint-logical-block as per my proposed cleanup. Changed pprint-function-call to put a fill-style newline between the the function and the first arg instead of a miser style newline.
-
wlott authored
to notice if the user structure printer also tried to do depth abbrevs and circularity detection, and blow it off 'cause we've already done it.
-
wlott authored
-
wlott authored
-
- Dec 12, 1991
-
-
ram authored
-
ram authored
-
ram authored
uses of 128 and 256 to be CHAR-CODE-LIMIT.
-
ram authored
to LEGAL-IMMEDIATE-CONSTANT-P in LTN from IR2-CONVERT-REF, since we must pick off potentially delayed constants there.
-
ram authored
delay references to hairy named constants.
-
wlott authored
when entering the debugger to make sure things print as expected.
-
wlott authored
instead of using the value directly.
-
wlott authored
-
- Dec 11, 1991
-
-
ram authored
-
ram authored
type of the result continuation, since the RETURN of functions that only do tail local calls will be deleted.
-
ram authored
-
ram authored
fact, why not always assign one, and just guard the return hackery with a test for whether this function has a return.
-
ram authored
edit.
-
ram authored
-
ram authored
:TYPE BOOLEAN.
-
ram authored
that all blocks have a NUMBER.
-
ram authored
Added an assertion that when we see a tail local call, the caller and callee tail sets had better be the same.
-
ram authored
MAYBE-CONVERT-TO-ASSIGNMENT and MAYBE-CONVERT-TAIL-LOCAL-CALL. Generalized let conversion to handle both assignments and normal LETs. Now local calls that we can prove will be TR are converted to jump directly to the function. We set NODE-TAIL-P to indicate this. RETURN nodes may be deleted because of this. We have to handle let conversion where the caller's RETURN was deleted due to tail recursion. Changed MERGE-LETS to remove the lambda from the tail-set and set the LAMBDA-TAIL-SET to NIL.
-
ram authored
Updated stuff to know that NODE-TAIL-P is no longer a tail set.
-
ram authored
new block which needs a DFN assigned. Added :ASSIGNMENT to various dispatches off of FUNCTIONAL-KIND. In DELETE-LAMBDA, remove the lambda from its tail-set. Whenever we try let conversion, try assignment conversion if it fails. Changed DELETE-RETURN not to delete the function from the tail set. Fixed DELETE-COMPONENT to set FUNCTIONAL-KIND to NIL before calling DELETE-LAMBDA so that we can delete random kinds of lambdas.
-
ram authored
is probably always a bug, but I don't want to use ASSERT until all the problems are fixed. Changed RETURN optimization to call MAYBE-CONVERT-TAIL-CALL. Updated for new tail-set semantics. Changed VALUES IR1 transform and SUBSTITUTE-SINGLE-USE-CONTINUATION to clear out the old NODE-DERIVED-TYPE so that the type doesn't spuriously go to NIL.
-
ram authored
but some may have a return type of NIL.
-
ram authored
:OPTIONAL entries, etc.) Changed to set NODE-TAIL-P to T instead of a tail set.
-
ram authored
out that return nodes can be deleted (by FIND-INITIAL-DFO).
-
ram authored
:ASSIGNMENT to the recognized function kinds.
-
ram authored
to functions in the same environment. Also, eliminated the assertion that NLX entry code doesn't reach the function's bind node. Instead, we just move the bind node to be first if it was reached.
-