Return to look.fs CVS log

Up to [gforth] / gforth

added LATEST, replaced uses of LAST @ with uses of LATEST
renamed LASTXT to LATESTXT, and changed the uses
made >NAME the primary name for >HEAD
documentation changes

    1: \ LOOK.FS      xt -> lfa                               22may93jaw
    2: 
    3: \ Copyright (C) 1995,1996,1997,2000,2003 Free Software Foundation, Inc.
    4: 
    5: \ This file is part of Gforth.
    6: 
    7: \ Gforth is free software; you can redistribute it and/or
    8: \ modify it under the terms of the GNU General Public License
    9: \ as published by the Free Software Foundation; either version 2
   10: \ of the License, or (at your option) any later version.
   11: 
   12: \ This program is distributed in the hope that it will be useful,
   13: \ but WITHOUT ANY WARRANTY; without even the implied warranty of
   14: \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   15: \ GNU General Public License for more details.
   16: 
   17: \ You should have received a copy of the GNU General Public License
   18: \ along with this program; if not, write to the Free Software
   19: \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
   20: 
   21: \ Look checks first if the word is a primitive. If yes then the
   22: \ vocabulary in the primitive area is beeing searched, meaning
   23: \ creating for each word a xt and comparing it...
   24: 
   25: \ If a word is no primitive look searches backwards to find the nfa.
   26: \ Problems: A compiled xt via compile, might be created with noname:
   27: \           a noname: leaves now a empty name field
   28: 
   29: require stuff.fs
   30: require environ.fs
   31: 
   32: decimal
   33: 
   34: \ look                                                  17may93jaw
   35: 
   36: \ rename to discover!!!
   37: 
   38: : xt>threaded ( xt -- x )
   39: \G produces the threaded-code cell for the primitive xt
   40:     threading-method 0= if
   41: 	@
   42:     then ;
   43: 
   44: : search-name  ( xt startlfa -- nt|0 )
   45:     \ look up name of primitive with code at xt
   46:     swap
   47:     >r false swap
   48:     BEGIN
   49: 	@ dup
   50:     WHILE
   51: 	    dup name>int
   52: 	    r@ = IF
   53: 		nip dup
   54: 	    THEN
   55:     REPEAT
   56:     drop rdrop ;
   57: 
   58: : threaded>xt ( ca -- xt|0 )
   59: \G For the code address ca of a primitive, find the xt (or 0).
   60:     [IFDEF] decompile-prim
   61: 	decompile-prim
   62:     [THEN]
   63:      \ walk through the array of primitive CAs
   64:     >r ['] noop begin
   65: 	dup @ while
   66: 	    dup xt>threaded r@ = if
   67: 		rdrop exit
   68: 	    endif
   69: 	    cell+
   70:     repeat
   71:     drop rdrop 0 ;
   72: 
   73: \ !!! nicht optimal!
   74: [IFUNDEF] look
   75: has? ec [IF]
   76: 
   77: has? rom 
   78: [IF]
   79: : prim>name ( xt -- nt|0 )
   80:     forth-wordlist @ search-name ;
   81: 
   82: : look ( xt -- lfa flag )
   83:     dup [ unlock rom-dictionary area lock ] 
   84:     literal literal within
   85:     IF
   86: 	>head-noprim dup ?? <>
   87:     ELSE
   88: 	prim>name dup 0<>
   89:     THEN ;
   90: [ELSE]
   91: : look ( cfa -- lfa flag )
   92:     >head-noprim dup ??? <> ;
   93: [THEN]
   94: 
   95: [ELSE]
   96: 
   97: : PrimStart ['] true >head-noprim ;
   98: 
   99: : prim>name ( xt -- nt|0 )
  100:     PrimStart search-name ;
  101: 
  102: : look ( xt -- lfa flag )
  103:     dup in-dictionary?
  104:     IF
  105: 	>head-noprim dup ??? <>
  106:     ELSE
  107: 	prim>name dup 0<>
  108:     THEN ;
  109: 
  110: [THEN]
  111: [THEN]
  112: 
  113: : threaded>name ( ca -- nt|0 )
  114:     threaded>xt prim>name ;
  115: 
  116: : >name ( xt -- nt|0 ) \ gforth to-name
  117:     \G tries to find the name token @var{nt} of the word represented
  118:     \G by @var{xt}; returns 0 if it fails.  This word is not
  119:     \G absolutely reliable, it may give false positives and produce
  120:     \G wrong nts.
  121:     look and ;
  122: 
  123: ' >name ALIAS >head \ gforth to-head
  124: \G another name of @code{>name}