The VLIST command had been present in FIG and other forth
implementations. It has to list all accessible words. In PFE
it list all words in the search order. Well, the point is,
that we do really just look into the search order and are
then calling WORDS on that Wordl. That way you can see
all accessible words in the order they might be found.
Uses ?CR
Search the dictionary for _name_. If _name_ is found,
return TRUE; otherwise return FALSE. Immediate for use in
definitions.
[DEFINED] word ( -- nfa|0 ) immediate
does check for the word using find (so it does not throw like ' )
and puts it on stack. As it is immediate it does work in compile-mode
too, so it places its argument in the cs-stack then. This is most
useful with a directly following [IF] clause, so that sth. like
an [IFDEF] word can be simulated through [DEFINED] word [IF]
the upper limit of the forth writeable memory space,
the variable DICTLIMIT must be below this line.
stack-space and other space-areas are often allocated
above DICTLIMIT upto this constant.
DICTFENCE is the lower end of the writeable dictionary
the lower limit of the forth writeable memory space,
the variable DICTFENCE must be above this line.
Some code-areas are often moved in between DICTFENCE and
this constant. To guard normal Forth code from deletion
the usual practice goes with the FENCE variable
DICTLIMIT is the upper end of the writeable dictionary
EXTENSIONStools_miscordinary primitive
/** implementation specific magic - used by control words */