[gforth] / gforth / extend.fs  

gforth: gforth/extend.fs

Diff for /gforth/extend.fs between version 1.28 and 1.32

version 1.28, Thu Jul 31 16:17:09 1997 UTC version 1.32, Wed Feb 3 00:10:20 1999 UTC
Line 1 
Line 1 
 \ EXTEND.FS    CORE-EXT Word not fully tested!         12may93jaw  \ EXTEND.FS    CORE-EXT Word not fully tested!         12may93jaw
   
 \ Copyright (C) 1995 Free Software Foundation, Inc.  \ Copyright (C) 1995,1998 Free Software Foundation, Inc.
   
 \ This file is part of Gforth.  \ This file is part of Gforth.
   
Line 25 
Line 25 
   
 \ .(                                                    12may93jaw  \ .(                                                    12may93jaw
   
 : .(   ( compilation "...<paren>" -- ) \ core-ext dot-paren  : .(   ( "ccc<paren>" -- ) \ core-ext dot-paren
     \G Parse a string ccc delimited by a ) (right parenthesis). Display
     \G the string. This is often used to display progress information
     \G during compilation. See examples below.
     [char] ) parse type ; immediate      [char] ) parse type ; immediate
   
 \ VALUE 2>R 2R> 2R@                                     17may93jaw  \ VALUE 2>R 2R> 2R@                                     17may93jaw
Line 33 
Line 36 
 \ !! 2value  \ !! 2value
   
 : 2Literal ( compilation w1 w2 -- ; run-time  -- w1 w2 ) \ double two-literal  : 2Literal ( compilation w1 w2 -- ; run-time  -- w1 w2 ) \ double two-literal
       \G Compile appropriate code such that, at run-time, cell pair w1, w2 are
       \G placed on the stack. Interpretation semantics are undefined.
     swap postpone Literal  postpone Literal ; immediate restrict      swap postpone Literal  postpone Literal ; immediate restrict
   
 ' drop alias d>s ( d -- n ) \ double            d_to_s  ' drop alias d>s ( d -- n ) \ double            d_to_s
Line 70 
Line 75 
 : CLiteral  : CLiteral
     postpone (c") here over char+ allot  place align ; immediate restrict      postpone (c") here over char+ allot  place align ; immediate restrict
   
 : C" ( compilation "...<quote>" -- ; run-time  -- c-addr ) \ core-ext c-quote  : C" ( compilation "ccc<quote>" -- ; run-time  -- c-addr ) \ core-ext c-quote
       \G Compilation: parse a string ccc delimited by a " (double quote). At
       \G run-time, return c-addr which specifies the counted string ccc.
       \G Interpretation semantics are undefined.
     [char] " parse postpone CLiteral ; immediate restrict      [char] " parse postpone CLiteral ; immediate restrict
   
 \ [COMPILE]                                             17may93jaw  \ [COMPILE]                                             17may93jaw
Line 87 
Line 95 
 \ ERASE                                                 17may93jaw  \ ERASE                                                 17may93jaw
   
 : erase ( addr len -- ) \ core-ext  : erase ( addr len -- ) \ core-ext
       \G If len>0, clear all bits in each location of a memory region
       \G of len address units starting at address addr.
     \ !! dependence on "1 chars 1 ="      \ !! dependence on "1 chars 1 ="
     ( 0 1 chars um/mod nip )  0 fill ;      ( 0 1 chars um/mod nip )  0 fill ;
 : blank ( addr len -- ) \ string  : blank ( addr len -- ) \ string
       \G If len>0, store the character value for a space in each
       \G location of a memory region
       \G of len character units starting at address addr.
     bl fill ;      bl fill ;
   
 \ SEARCH                                                02sep94py  \ SEARCH                                                02sep94py
   
 : search ( c-addr1 u1 c-addr2 u2 -- c-addr3 u3 flag ) \ string  : search ( c-addr1 u1 c-addr2 u2 -- c-addr3 u3 flag ) \ string
       \G Search the string specified by c-addr1, u1 for the string
       \G speficied by c-addr2, u2. If flag is true: match was found
       \G at c-addr3 with u3 characters remaining. If flag is false:
       \G no match was found; c-addr3, u3 are equal to c-addr1, u1.
     \ not very efficient; but if we want efficiency, we'll do it as primitive      \ not very efficient; but if we want efficiency, we'll do it as primitive
     2>r 2dup      2>r 2dup
     begin      begin
Line 168 
Line 185 
 \ Marker creates a mark that is removed (including everything  \ Marker creates a mark that is removed (including everything
 \ defined afterwards) when executing the mark.  \ defined afterwards) when executing the mark.
   
 : marker, ( -- mark )  here dup A,  : included-files-mark ( -- u )
   voclink @ A, voclink      included-files 2@ nip
   BEGIN  @ dup WHILE  dup 0 wordlist-link - @ A,  REPEAT  drop      blk @ 0=
       if \ not input from blocks
           source-id 1 -1 within
           if \ input from file
               1- \ do not include the last file (hopefully this is the
                  \ currently included file)
           then
       then ;
   
   \ hmm, most of the saving appears to be pretty unnecessary: we could
   \ derive the wordlists and the words that have to be kept from the
   \ saved value of dp value. - anton
   
   : marker, ( -- mark )
       here
       included-files-mark ,
       dup A, \ here
       voclink @ A, \ vocabulary list start
       \ for all wordlists, remember wordlist-id (the linked list)
       voclink
       BEGIN
           @ dup
       WHILE
           dup 0 wordlist-link - wordlist-id @ A,
       REPEAT
       drop
       \ remember udp
   udp @ , ;    udp @ , ;
   
 : marker! ( mark -- )  : marker! ( mark -- )
     dup @ swap cell+      \ reset included files count; resize will happen on next add-included-file
       included-files 2@ drop over @ included-files 2! cell+
       \ rest of marker!
       dup @ swap cell+ ( here rest-of-marker )
     dup @ voclink ! cell+      dup @ voclink ! cell+
       \ restore wordlists to former words
     voclink      voclink
     BEGIN      BEGIN
         @ dup          @ dup
     WHILE      WHILE
         over @ over 0 wordlist-link - !          over @ over 0 wordlist-link - wordlist-id !
         swap cell+ swap          swap cell+ swap
     REPEAT      REPEAT
     drop  voclink      drop
       \ rehash wordlists to remove forgotten words
       \ why don't we do this in a single step? - anton
       voclink
     BEGIN      BEGIN
         @ dup          @ dup
     WHILE      WHILE
         dup 0 wordlist-link - rehash          dup 0 wordlist-link - rehash
     REPEAT      REPEAT
     drop      drop
     @ udp !  dp ! ;      \ restore udp and dp
       @ udp !  dp !
 : marker ( "mark" -- )      \ clean up vocabulary stack
       0 vp @ 0
       ?DO
           vp cell+ I cells + @ dup here >
           IF  drop  ELSE  swap 1+  THEN
       LOOP
       dup 0= or set-order \ -1 set-order if order is empty
       get-current here > IF
           forth-wordlist set-current
       THEN ;
   
   : marker ( "<spaces> name" -- ) \ core-ext
       \G Create a definition, @var{name} (called a @var{mark}) whose
       \G execution semantics are to remove itself and everything
       \G defined after it.
     marker, Create A,      marker, Create A,
 DOES> ( -- )  DOES> ( -- )
     @ marker! ;      @ marker! ;

Generate output suitable for use with a patch program
Legend:
Removed from v.1.28  
changed lines
  Added in v.1.32
CVS Admin

Powered by ViewCVS 1.0-dev 		(Powered by ViewCVS)

ViewCVS and CVS Help