1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156
|
\ definitions needed for interpreter only
\ Copyright (C) 1995-2000,2004,2005,2007 Free Software Foundation, Inc.
\ This file is part of Gforth.
\ Gforth is free software; you can redistribute it and/or
\ modify it under the terms of the GNU General Public License
\ as published by the Free Software Foundation, either version 3
\ of the License, or (at your option) any later version.
\ This program is distributed in the hope that it will be useful,
\ but WITHOUT ANY WARRANTY; without even the implied warranty of
\ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\ GNU General Public License for more details.
\ You should have received a copy of the GNU General Public License
\ along with this program. If not, see http://www.gnu.org/licenses/.
\ \ Revision-Log
\ put in seperate file 14sep97jaw
\ \ input stream primitives 23feb93py
require ./basics.fs \ bounds decimal hex ...
require ./io.fs \ type ...
require ./nio.fs \ . <# ...
require ./errore.fs \ .error ...
require kernel/version.fs \ version-string
has? new-input 0= [IF]
: tib ( -- c-addr ) \ core-ext t-i-b
\G @i{c-addr} is the address of the Terminal Input Buffer.
\G OBSOLESCENT: @code{source} superceeds the function of this word.
>tib @ ;
Defer source ( -- c-addr u ) \ core
\ used by dodefer:, must be defer
\G @i{c-addr} is the address of the input buffer and @i{u} is the
\G number of characters in it.
: (source) ( -- c-addr u )
tib #tib @ ;
' (source) IS source
[THEN]
: (word) ( addr1 n1 char -- addr2 n2 )
dup >r skip 2dup r> scan nip - ;
\ (word) should fold white spaces
\ this is what (parse-white) does
\ word parse 23feb93py
: sword ( char -- addr len ) \ gforth-obsolete s-word
\G Parses like @code{word}, but the output is like @code{parse} output.
\G @xref{core-idef}.
\ this word was called PARSE-WORD until 0.3.0, but Open Firmware and
\ dpANS6 A.6.2.2008 have a word with that name that behaves
\ differently (like NAME).
source 2dup >r >r >in @ over min /string
rot dup bl = IF
drop (parse-white)
ELSE
(word)
THEN
[ has? new-input [IF] ]
2dup input-lexeme!
[ [THEN] ]
2dup + r> - 1+ r> min >in ! ;
: word ( char "<chars>ccc<char>-- c-addr ) \ core
\G Skip leading delimiters. Parse @i{ccc}, delimited by
\G @i{char}, in the parse area. @i{c-addr} is the address of a
\G transient region containing the parsed string in
\G counted-string format. If the parse area was empty or
\G contained no characters other than delimiters, the resulting
\G string has zero length. A program may replace characters within
\G the counted string. OBSOLESCENT: the counted string has a
\G trailing space that is not included in its length.
sword here place bl here count + c! here ;
: parse ( char "ccc<char>" -- c-addr u ) \ core-ext
\G Parse @i{ccc}, delimited by @i{char}, in the parse
\G area. @i{c-addr u} specifies the parsed string within the
\G parse area. If the parse area was empty, @i{u} is 0.
>r source >in @ over min /string ( c-addr1 u1 )
over swap r> scan >r
over - dup r> IF 1+ THEN >in +!
[ has? new-input [IF] ]
2dup input-lexeme!
[ [THEN] ] ;
\ name 13feb93py
[IFUNDEF] (name) \ name might be a primitive
: (name) ( -- c-addr count ) \ gforth
source 2dup >r >r >in @ /string (parse-white)
[ has? new-input [IF] ]
2dup input-lexeme!
[ [THEN] ]
2dup + r> - 1+ r> min >in ! ;
\ name count ;
[THEN]
: name-too-short? ( c-addr u -- c-addr u )
dup 0= -&16 and throw ;
: name-too-long? ( c-addr u -- c-addr u )
dup lcount-mask u> -&19 and throw ;
\ \ Number parsing 23feb93py
\ number? number 23feb93py
hex
const Create bases 0A , 10 , 2 , 0A ,
\ 10 16 2 10
\ !! protect BASE saving wrapper against exceptions
: getbase ( addr u -- addr' u' )
2dup s" 0x" string-prefix? >r
2dup s" 0X" string-prefix? r> or
base @ &34 < and if
hex 2 /string
endif
over c@ [char] # - dup 4 u<
IF
cells bases + @ base ! 1 /string
ELSE
drop
THEN ;
: sign? ( addr u -- addr1 u1 flag )
over c@ [char] - = dup >r
IF
1 /string
THEN
r> ;
: ?dnegate ( d1 f -- d2 )
if
dnegate
then ;
has? os 0= [IF]
: x@+/string ( addr u -- addr' u' c )
over c@ >r 1 /string r> ;
[THEN]
: s'>unumber? ( addr u -- ud flag )
\ convert string "C" or "C'" to character code
dup 0= if
false exit
endif
x@+/string 0 s" '" 2rot string-prefix? ;
: s>unumber? ( c-addr u -- ud flag ) \ gforth
\G converts string c-addr u into ud, flag indicates success
dpl on
over c@ '' = if
1 /string s'>unumber? exit
endif
base @ >r getbase sign?
over if
>r 0. 2swap
BEGIN ( d addr len )
dup >r >number dup
WHILE \ there are characters left
dup r> -
WHILE \ the last >number parsed something
dup 1- dpl ! over c@ [char] . =
WHILE \ the current char is '.'
1 /string
REPEAT THEN \ there are unparseable characters left
2drop rdrop false
ELSE
rdrop 2drop r> ?dnegate true
THEN
ELSE
drop 2drop 0. false THEN
r> base ! ;
\ ouch, this is complicated; there must be a simpler way - anton
: s>number? ( addr u -- d f ) \ gforth
\G converts string addr u into d, flag indicates success
sign? >r
s>unumber?
0= IF
rdrop false
ELSE \ no characters left, all ok
r> ?dnegate
true
THEN ;
: s>number ( addr len -- d )
\ don't use this, there is no way to tell success
s>number? drop ;
: snumber? ( c-addr u -- 0 / n -1 / d 0> )
s>number? 0=
IF
2drop false EXIT
THEN
dpl @ dup 0< IF
nip
ELSE
1+
THEN ;
: number? ( string -- string 0 / n -1 / d 0> )
dup >r count snumber? dup if
rdrop
else
r> swap
then ;
: number ( string -- d )
number? ?dup 0= abort" ?" 0<
IF
s>d
THEN ;
\ \ Comments ( \ \G
: ( ( compilation 'ccc<close-paren>' -- ; run-time -- ) \ thisone- core,file paren
\G ** this will not get annotated. The alias in glocals.fs will instead **
\G It does not work to use "wordset-" prefix since this file is glossed
\G by cross.fs which doesn't have the same functionalty as makedoc.fs
[char] ) parse 2drop ; immediate
: \ ( compilation 'ccc<newline>' -- ; run-time -- ) \ thisone- core-ext,block-ext backslash
\G ** this will not get annotated. The alias in glocals.fs will instead **
\G It does not work to use "wordset-" prefix since this file is glossed
\G by cross.fs which doesn't have the same functionalty as makedoc.fs
[ has? file [IF] ]
blk @
IF
>in @ c/l / 1+ c/l * >in !
EXIT
THEN
[ [THEN] ]
source >in ! drop ; immediate
: \G ( compilation 'ccc<newline>' -- ; run-time -- ) \ gforth backslash-gee
\G Equivalent to @code{\} but used as a tag to annotate definition
\G comments into documentation.
POSTPONE \ ; immediate
has? ec [IF]
AVariable forth-wordlist
: find-name ( c-addr u -- nt | 0 ) \ gforth
\g Find the name @i{c-addr u} in the current search
\g order. Return its @i{nt}, if found, otherwise 0.
forth-wordlist (f83find) ;
[ELSE]
\ \ object oriented search list 17mar93py
\ word list structure:
struct
cell% field find-method \ xt: ( c_addr u wid -- nt )
cell% field reveal-method \ xt: ( nt wid -- ) \ used by dofield:, must be field
cell% field rehash-method \ xt: ( wid -- ) \ re-initializes a "search-data" (hashtables)
cell% field hash-method \ xt: ( wid -- ) \ initializes ""
\ \ !! what else
end-struct wordlist-map-struct
struct
cell% field wordlist-map \ pointer to a wordlist-map-struct
cell% field wordlist-id \ linked list of words (for WORDS etc.)
cell% field wordlist-link \ link field to other wordlists
cell% field wordlist-extend \ wordlist extensions (eg bucket offset)
end-struct wordlist-struct
has? f83headerstring [IF]
: f83find ( addr len wordlist -- nt / false )
wordlist-id @ (f83find) ;
[ELSE]
: f83find ( addr len wordlist -- nt / false )
wordlist-id @ (listlfind) ;
[THEN]
: initvoc ( wid -- )
dup wordlist-map @ hash-method perform ;
\ Search list table: find reveal
Create f83search ( -- wordlist-map )
' f83find A, ' drop A, ' drop A, ' drop A,
here G f83search T A, NIL A, NIL A, NIL A,
AValue forth-wordlist \ variable, will be redefined by search.fs
AVariable lookup forth-wordlist lookup !
\ !! last is user and lookup?! jaw
AVariable current ( -- addr ) \ gforth
\G @code{Variable} -- holds the @i{wid} of the compilation word list.
AVariable voclink forth-wordlist wordlist-link voclink !
\ lookup AValue context ( -- addr ) \ gforth
Defer context ( -- addr ) \ gforth
\G @code{context} @code{@@} is the @i{wid} of the word list at the
\G top of the search order.
' lookup is context
forth-wordlist current !
: (search-wordlist) ( addr count wid -- nt | false )
dup wordlist-map @ find-method perform ;
: search-wordlist ( c-addr count wid -- 0 | xt +-1 ) \ search
\G Search the word list identified by @i{wid} for the definition
\G named by the string at @i{c-addr count}. If the definition is
\G not found, return 0. If the definition is found return 1 (if
\G the definition is immediate) or -1 (if the definition is not
\G immediate) together with the @i{xt}. In Gforth, the @i{xt}
\G returned represents the interpretation semantics. ANS Forth
\G does not specify clearly what @i{xt} represents.
(search-wordlist) dup if
(name>intn)
then ;
: find-name ( c-addr u -- nt | 0 ) \ gforth
\g Find the name @i{c-addr u} in the current search
\g order. Return its @i{nt}, if found, otherwise 0.
lookup @ (search-wordlist) ;
[THEN]
\ \ header, finding, ticks 17dec92py
\ The constants are defined as 32 bits, but then erased
\ and overwritten by the right ones
has? f83headerstring [IF]
\ to save space, Gforth EC limits words to 31 characters
$80 constant alias-mask
$40 constant immediate-mask
$20 constant restrict-mask
$1f constant lcount-mask
[ELSE]
$80000000 constant alias-mask
1 bits/char 1 - lshift
-1 cells allot bigendian [IF] c, 0 1 cells 1- times
[ELSE] 0 1 cells 1- times c, [THEN]
$40000000 constant immediate-mask
1 bits/char 2 - lshift
-1 cells allot bigendian [IF] c, 0 1 cells 1- times
[ELSE] 0 1 cells 1- times c, [THEN]
$20000000 constant restrict-mask
1 bits/char 3 - lshift
-1 cells allot bigendian [IF] c, 0 1 cells 1- times
[ELSE] 0 1 cells 1- times c, [THEN]
$1fffffff constant lcount-mask
1 bits/char 3 - lshift 1 -
-1 cells allot bigendian [IF] c, -1 1 cells 1- times
[ELSE] -1 1 cells 1- times c, [THEN]
[THEN]
\ higher level parts of find
: flag-sign ( f -- 1|-1 )
\ true becomes 1, false -1
0= 2* 1+ ;
: ticking-compile-only-error ( ... -- )
-&2048 throw ;
: compile-only-error ( ... -- )
-&14 throw ;
: (cfa>int) ( cfa -- xt )
[ has? compiler [IF] ]
dup interpret/compile?
if
interpret/compile-int @
then
[ [THEN] ] ;
: (x>int) ( cfa w -- xt )
\ get interpretation semantics of name
restrict-mask and [ has? rom [IF] ] 0= [ [THEN] ]
if
drop ['] compile-only-error
else
(cfa>int)
then ;
has? f83headerstring [IF]
: name>string ( nt -- addr count ) \ gforth name-to-string
\g @i{addr count} is the name of the word represented by @i{nt}.
cell+ count lcount-mask and ;
: ((name>)) ( nfa -- cfa )
name>string + cfaligned ;
: (name>x) ( nfa -- cfa w )
\ cfa is an intermediate cfa and w is the flags cell of nfa
dup ((name>))
swap cell+ c@ dup alias-mask and 0=
IF
swap @ swap
THEN ;
[ELSE]
: name>string ( nt -- addr count ) \ gforth name-to-string
\g @i{addr count} is the name of the word represented by @i{nt}.
cell+ dup cell+ swap @ lcount-mask and ;
: ((name>)) ( nfa -- cfa )
name>string + cfaligned ;
: (name>x) ( nfa -- cfa w )
\ cfa is an intermediate cfa and w is the flags cell of nfa
dup ((name>))
swap cell+ @ dup alias-mask and 0=
IF
swap @ swap
THEN ;
[THEN]
: name>int ( nt -- xt ) \ gforth name-to-int
\G @i{xt} represents the interpretation semantics of the word
\G @i{nt}. If @i{nt} has no interpretation semantics (i.e. is
\G @code{compile-only}), @i{xt} is the execution token for
\G @code{ticking-compile-only-error}, which performs @code{-2048 throw}.
(name>x) (x>int) ;
: name?int ( nt -- xt ) \ gforth name-question-int
\G Like @code{name>int}, but perform @code{-2048 throw} if @i{nt}
\G has no interpretation semantics.
(name>x) restrict-mask and [ has? rom [IF] ] 0= [ [THEN] ]
if
ticking-compile-only-error \ does not return
then
(cfa>int) ;
: (name>comp) ( nt -- w +-1 ) \ gforth
\G @i{w xt} is the compilation token for the word @i{nt}.
(name>x) >r
[ has? compiler [IF] ]
dup interpret/compile?
if
interpret/compile-comp @
then
[ [THEN] ]
r> immediate-mask and [ has? rom [IF] ] 0= [ [THEN] ] flag-sign
;
: (name>intn) ( nfa -- xt +-1 )
(name>x) tuck (x>int) ( w xt )
swap immediate-mask and [ has? rom [IF] ] 0= [ [THEN] ] flag-sign ;
const Create ??? 0 , 3 , char ? c, char ? c, char ? c,
\ ??? is used by dovar:, must be created/:dovar
[IFDEF] forthstart
\ if we have a forthstart we can define head? with it
\ otherwise leave out the head? check
: head? ( addr -- f )
\G heuristic check whether addr is a name token; may deliver false
\G positives; addr must be a valid address; returns 1 for
\G particularly unsafe positives
\ we follow the link fields and check for plausibility; two
\ iterations should catch most false addresses: on the first
\ iteration, we may get an xt, on the second a code address (or
\ some code), which is typically not in the dictionary.
\ we added a third iteration for working with code and ;code words.
3 0 do
dup dup aligned <> if \ protect @ against unaligned accesses
drop false unloop exit
then
dup @ dup
if ( addr addr1 )
dup rot forthstart within
if \ addr1 is outside forthstart..addr, not a head
drop false unloop exit
then ( addr1 )
else \ 0 in the link field, no further checks
2drop 1 unloop exit \ this is very unsure, so return 1
then
loop
\ in dubio pro:
drop true ;
: >head-noprim ( cfa -- nt ) \ gforth to-head-noprim
\ also heuristic
dup forthstart - max-name-length @
[ has? float [IF] ] float+ [ [ELSE] ] cell+ [ [THEN] ] cell+ min
cell max cell ?do ( cfa )
dup i - dup @ [ alias-mask lcount-mask or ] literal
[ 1 bits/char 3 - lshift 1 - 1 bits/char 1 - lshift or
-1 cells allot bigendian [IF] c, -1 1 cells 1- times
[ELSE] -1 1 cells 1- times c, [THEN] ]
and ( cfa len|alias )
swap + cell+ cfaligned over alias-mask + =
if ( cfa )
dup i - cell - dup head?
if
nip unloop exit
then
drop
then
cell +loop
drop ??? ( wouldn't 0 be better? ) ;
[ELSE]
: >head-noprim ( cfa -- nt ) \ gforth to-head-noprim
$25 cell do ( cfa )
dup i - dup @ [ alias-mask lcount-mask or ] literal
[ 1 bits/char 3 - lshift 1 - 1 bits/char 1 - lshift or
-1 cells allot bigendian [IF] c, -1 1 cells 1- times
[ELSE] -1 1 cells 1- times c, [THEN] ]
and ( cfa len|alias )
swap + cell + cfaligned over alias-mask + =
if ( cfa ) i - cell - unloop exit
then
cell +loop
drop ??? ( wouldn't 0 be better? ) ;
[THEN]
cell% 2* 0 0 field >body ( xt -- a_addr ) \ core to-body
\G Get the address of the body of the word represented by @i{xt} (the
\G address of the word's data field).
drop drop
cell% -2 * 0 0 field body> ( xt -- a_addr )
drop drop
has? standardthreading has? compiler and [IF]
' @ alias >code-address ( xt -- c_addr ) \ gforth
\G @i{c-addr} is the code address of the word @i{xt}.
: >does-code ( xt -- a_addr ) \ gforth
\G If @i{xt} is the execution token of a child of a @code{DOES>} word,
\G @i{a-addr} is the start of the Forth code after the @code{DOES>};
\G Otherwise @i{a-addr} is 0.
dup @ dodoes: = if
cell+ @
else
drop 0
endif ;
has? prims [IF]
: flash! ! ;
: flashc! c! ;
[THEN]
has? flash [IF] ' flash! [ELSE] ' ! [THEN]
alias code-address! ( c_addr xt -- ) \ gforth
\G Create a code field with code address @i{c-addr} at @i{xt}.
: does-code! ( a_addr xt -- ) \ gforth
\G Create a code field at @i{xt} for a child of a @code{DOES>}-word;
\G @i{a-addr} is the start of the Forth code after @code{DOES>}.
[ has? flash [IF] ]
dodoes: over flash! cell+ flash!
[ [ELSE] ]
dodoes: over ! cell+ !
[ [THEN] ] ;
' drop alias does-handler! ( a_addr -- ) \ gforth
\G Create a @code{DOES>}-handler at address @i{a-addr}. Normally,
\G @i{a-addr} points just behind a @code{DOES>}.
2 cells constant /does-handler ( -- n ) \ gforth
\G The size of a @code{DOES>}-handler (includes possible padding).
[THEN]
: sfind ( c-addr u -- 0 / xt +-1 ) \ gforth-obsolete
find-name dup
if ( nt )
state @
if
(name>comp)
else
(name>intn)
then
then ;
: find ( c-addr -- xt +-1 | c-addr 0 ) \ core,search
\G Search all word lists in the current search order for the
\G definition named by the counted string at @i{c-addr}. If the
\G definition is not found, return 0. If the definition is found
\G return 1 (if the definition has non-default compilation
\G semantics) or -1 (if the definition has default compilation
\G semantics). The @i{xt} returned in interpret state represents
\G the interpretation semantics. The @i{xt} returned in compile
\G state represented either the compilation semantics (for
\G non-default compilation semantics) or the run-time semantics
\G that the compilation semantics would @code{compile,} (for
\G default compilation semantics). The ANS Forth standard does
\G not specify clearly what the returned @i{xt} represents (and
\G also talks about immediacy instead of non-default compilation
\G semantics), so this word is questionable in portable programs.
\G If non-portability is ok, @code{find-name} and friends are
\G better (@pxref{Name token}).
dup count sfind dup
if
rot drop
then ;
\ ticks in interpreter
: (') ( "name" -- nt ) \ gforth
parse-name name-too-short?
find-name dup 0=
IF
drop -&13 throw
THEN ;
: ' ( "name" -- xt ) \ core tick
\g @i{xt} represents @i{name}'s interpretation
\g semantics. Perform @code{-14 throw} if the word has no
\g interpretation semantics.
(') name?int ;
has? compiler 0= [IF] \ interpreter only version of IS and TO
: IS ' >body ! ;
' IS Alias TO
[THEN]
\ \ the interpreter loop mar92py
\ interpret 10mar92py
Defer parser1 ( c-addr u -- ... xt)
\ "... xt" is the action to be performed by the text-interpretation of c-addr u
: parser ( c-addr u -- ... )
\ text-interpret the word/number c-addr u, possibly producing a number
parser1 execute ;
has? ec [IF]
' (name) Alias parse-name
: no.extensions 2drop -&13 throw ;
' no.extensions Alias compiler-notfound1
' no.extensions Alias interpreter-notfound1
[ELSE]
Defer parse-name ( "name" -- c-addr u ) \ gforth
\G Get the next word from the input buffer
' (name) IS parse-name
' parse-name alias parse-word ( -- c-addr u ) \ gforth-obsolete
\G old name for @code{parse-name}
' parse-name alias name ( -- c-addr u ) \ gforth-obsolete
\G old name for @code{parse-name}
Defer compiler-notfound1 ( c-addr count -- ... xt )
Defer interpreter-notfound1 ( c-addr count -- ... xt )
: no.extensions ( addr u -- )
2drop -&13 throw ;
' no.extensions IS compiler-notfound1
' no.extensions IS interpreter-notfound1
Defer before-word ( -- ) \ gforth
\ called before the text interpreter parses the next word
' noop IS before-word
[THEN]
has? backtrace [IF]
: interpret1 ( ... -- ... )
rp@ backtrace-rp0 !
BEGIN
?stack [ has? EC 0= [IF] ] before-word [ [THEN] ] parse-name dup
WHILE
parser1 execute
REPEAT
2drop ;
: interpret ( ?? -- ?? ) \ gforth
\ interpret/compile the (rest of the) input buffer
backtrace-rp0 @ >r
['] interpret1 catch
r> backtrace-rp0 !
throw ;
[ELSE]
: interpret ( ... -- ... )
BEGIN
?stack [ has? EC 0= [IF] ] before-word [ [THEN] ] parse-name dup
WHILE
parser1 execute
REPEAT
2drop ;
[THEN]
\ interpreter 30apr92py
\ not the most efficient implementations of interpreter and compiler
: interpreter1 ( c-addr u -- ... xt )
2dup find-name dup
if
nip nip name>int
else
drop
2dup 2>r snumber?
IF
2rdrop ['] noop
ELSE
2r> interpreter-notfound1
THEN
then ;
' interpreter1 IS parser1
\ \ Query Evaluate 07apr93py
has? file 0= [IF]
: sourceline# ( -- n ) 1 ;
[ELSE]
has? new-input 0= [IF]
Variable #fill-bytes
\G number of bytes read via (read-line) by the last refill
[THEN]
[THEN]
has? new-input 0= [IF]
: input-start-line ( -- ) >in off ;
: refill ( -- flag ) \ core-ext,block-ext,file-ext
\G Attempt to fill the input buffer from the input source. When
\G the input source is the user input device, attempt to receive
\G input into the terminal input device. If successful, make the
\G result the input buffer, set @code{>IN} to 0 and return true;
\G otherwise return false. When the input source is a block, add 1
\G to the value of @code{BLK} to make the next block the input
\G source and current input buffer, and set @code{>IN} to 0;
\G return true if the new value of @code{BLK} is a valid block
\G number, false otherwise. When the input source is a text file,
\G attempt to read the next line from the file. If successful,
\G make the result the current input buffer, set @code{>IN} to 0
\G and return true; otherwise, return false. A successful result
\G includes receipt of a line containing 0 characters.
[ has? file [IF] ]
blk @ IF 1 blk +! true EXIT THEN
[ [THEN] ]
tib /line
[ has? file [IF] ]
loadfile @ ?dup
IF (read-line) throw #fill-bytes !
ELSE
[ [THEN] ]
sourceline# 0< IF 2drop false EXIT THEN
accept eof @ 0=
[ has? file [IF] ]
THEN
1 loadline +!
[ [THEN] ]
swap #tib !
input-start-line ;
: query ( -- ) \ core-ext
\G Make the user input device the input source. Receive input into
\G the Terminal Input Buffer. Set @code{>IN} to zero. OBSOLESCENT:
\G superceeded by @code{accept}.
[ has? file [IF] ]
blk off loadfile off
[ [THEN] ]
refill drop ;
[THEN]
\ save-mem extend-mem
has? os [IF]
: save-mem ( addr1 u -- addr2 u ) \ gforth
\g copy a memory block into a newly allocated region in the heap
swap >r
dup allocate throw
swap 2dup r> -rot move ;
: free-mem-var ( addr -- )
\ addr is the address of a 2variable containing address and size
\ of a memory range; frees memory and clears the 2variable.
dup 2@ drop dup
if ( addr mem-start )
free throw
0 0 rot 2!
else
2drop
then ;
: extend-mem ( addr1 u1 u -- addr addr2 u2 )
\ extend memory block allocated from the heap by u aus
\ the (possibly reallocated) piece is addr2 u2, the extension is at addr
over >r + dup >r resize throw
r> over r> + -rot ;
[THEN]
\ EVALUATE 17may93jaw
has? file 0= has? new-input 0= and [IF]
: push-file ( -- ) r>
tibstack @ >r >tib @ >r #tib @ >r
>tib @ tibstack @ = IF r@ tibstack +! THEN
tibstack @ >tib ! >in @ >r >r ;
: pop-file ( throw-code -- throw-code )
r>
r> >in ! r> #tib ! r> >tib ! r> tibstack ! >r ;
[THEN]
has? new-input 0= [IF]
: evaluate ( c-addr u -- ) \ core,block
\G Save the current input source specification. Store @code{-1} in
\G @code{source-id} and @code{0} in @code{blk}. Set @code{>IN} to
\G @code{0} and make the string @i{c-addr u} the input source
\G and input buffer. Interpret. When the parse area is empty,
\G restore the input source specification.
[ has? file [IF] ]
s" *evaluated string*" loadfilename>r
[ [THEN] ]
push-file #tib ! >tib !
input-start-line
[ has? file [IF] ]
blk off loadfile off -1 loadline !
[ [THEN] ]
['] interpret catch
pop-file
[ has? file [IF] ]
r>loadfilename
[ [THEN] ]
throw ;
[THEN]
\ \ Quit 13feb93py
Defer 'quit
has? os [IF]
Defer .status
[ELSE]
[IFUNDEF] bye
: (bye) ( 0 -- ) \ back to DOS
drop 5 emit ;
: bye ( -- ) 0 (bye) ;
[THEN]
[THEN]
: prompt state @ IF ." compiled" EXIT THEN ." ok" ;
: (quit) ( -- )
\ exits only through THROW etc.
BEGIN
[ has? ec [IF] ] cr [ [ELSE] ]
.status ['] cr catch if
[ has? OS [IF] ] >stderr [ [THEN] ]
cr ." Can't print to stdout, leaving" cr
\ if stderr does not work either, already DoError causes a hang
2 (bye)
endif [ [THEN] ]
refill WHILE
interpret prompt
REPEAT
bye ;
' (quit) IS 'quit
\ \ DOERROR (DOERROR) 13jun93jaw
has? os [IF]
8 Constant max-errors
5 has? file 2 and + Constant /error
Variable error-stack 0 error-stack !
max-errors /error * cells allot
\ format of one cell:
\ source ( c-addr u )
\ last parsed lexeme ( c-addr u )
\ line-number
\ Loadfilename ( addr u )
: error> ( -- c-addr1 u1 c-addr2 u2 line# [addr u] )
-1 error-stack +!
error-stack dup @
/error * cells + cell+
/error cells bounds DO
I @
cell +LOOP ;
: >error ( c-addr1 u1 c-addr2 u2 line# [addr u] -- )
error-stack dup @ dup 1+
max-errors 1- min error-stack !
/error * cells + cell+
/error 1- cells bounds swap DO
I !
-1 cells +LOOP ;
: input-error-data ( -- c-addr1 u1 c-addr2 u2 line# [addr u] )
\ error data for the current input, to be used by >error or .error-frame
source input-lexeme 2@ sourceline#
[ has? file [IF] ] sourcefilename [ [THEN] ] ;
: dec. ( n -- ) \ gforth
\G Display @i{n} as a signed decimal number, followed by a space.
\ !! not used...
base @ decimal swap . base ! ;
: dec.r ( u n -- ) \ gforth
\G Display @i{u} as a unsigned decimal number in a field @i{n}
\G characters wide.
base @ >r decimal .r r> base ! ;
: hex. ( u -- ) \ gforth
\G Display @i{u} as an unsigned hex number, prefixed with a "$" and
\G followed by a space.
\ !! not used...
[char] $ emit base @ swap hex u. base ! ;
: -trailing ( c_addr u1 -- c_addr u2 ) \ string dash-trailing
\G Adjust the string specified by @i{c-addr, u1} to remove all
\G trailing spaces. @i{u2} is the length of the modified string.
BEGIN
dup
WHILE
1- 2dup + c@ bl <>
UNTIL 1+ THEN ;
DEFER DOERROR
has? backtrace [IF]
Defer dobacktrace ( -- )
' noop IS dobacktrace
[THEN]
: .error-string ( throw-code -- )
dup -2 =
IF "error @ ?dup IF count type THEN drop
ELSE .error
THEN ;
: umin ( u1 u2 -- u )
2dup u>
if
swap
then
drop ;
Defer mark-start
Defer mark-end
:noname ." >>>" ; IS mark-start
:noname ." <<<" ; IS mark-end
: part-type ( addr1 u1 u -- addr2 u2 )
\ print first u characters of addr1 u1, addr2 u2 is the rest
over umin 2 pick over type /string ;
: .error-line ( c-addr1 u1 c-addr2 u2 -- )
\ print error in line c-addr1 u1, where the error-causing lexeme
\ is c-addr2 u2
>r 2 pick - part-type ( c-addr3 u3 R: u2 )
mark-start r> part-type mark-end ( c-addr4 u4 )
type ;
: .error-frame ( throwcode addr1 u1 addr2 u2 n2 [addr3 u3] -- throwcode )
\ addr3 u3: filename of included file - optional
\ n2: line number
\ addr2 u2: parsed lexeme (should be marked as causing the error)
\ addr1 u1: input line
error-stack @
IF ( throwcode addr1 u1 n0 n1 n2 [addr2 u2] )
[ has? file [IF] ] \ !! unbalanced stack effect
over IF
cr ." in file included from "
type ." :"
0 dec.r 2drop 2drop
ELSE
2drop 2drop 2drop drop
THEN
[ [THEN] ] ( throwcode addr1 u1 n0 n1 n2 )
ELSE ( throwcode addr1 u1 n0 n1 n2 [addr2 u2] )
[ has? file [IF] ]
cr type ." :"
[ [THEN] ] ( throwcode addr1 u1 n0 n1 n2 )
dup 0 dec.r ." : " 5 pick .error-string
IF \ if line# non-zero, there is a line
cr .error-line
ELSE
2drop 2drop
THEN
THEN ;
: (DoError) ( throw-code -- )
[ has? os [IF] ]
>stderr
[ [THEN] ]
input-error-data .error-frame
error-stack @ 0 ?DO
error>
.error-frame
LOOP
drop
[ has? backtrace [IF] ]
dobacktrace
[ [THEN] ]
normal-dp dpp ! ;
' (DoError) IS DoError
[ELSE]
: dec. base @ >r decimal . r> base ! ;
: DoError ( throw-code -- )
cr source drop >in @ type ." <<< "
dup -2 = IF "error @ type drop EXIT THEN
.error ;
[THEN]
: quit ( ?? -- ?? ) \ core
\G Empty the return stack, make the user input device
\G the input source, enter interpret state and start
\G the text interpreter.
rp0 @ rp! handler off clear-tibstack
[ has? new-input 0= [IF] ] >tib @ >r [ [THEN] ]
BEGIN
[ has? compiler [IF] ]
[compile] [
[ [THEN] ]
\ stack depths may be arbitrary here
['] 'quit CATCH dup
WHILE
<# \ reset hold area, or we may get another error
DoError
\ stack depths may be arbitrary still (or again), so clear them
clearstacks
[ has? new-input [IF] ] clear-tibstack
[ [ELSE] ] r@ >tib ! r@ tibstack !
[ [THEN] ]
REPEAT
drop [ has? new-input [IF] ] clear-tibstack
[ [ELSE] ] r> >tib !
[ [THEN] ] ;
\ \ Cold Boot 13feb93py
: (bootmessage) ( -- )
." Gforth " version-string type
." , Copyright (C) 1995-2008 Free Software Foundation, Inc." cr
." Gforth comes with ABSOLUTELY NO WARRANTY; for details type `license'"
[ has? os [IF] ]
cr ." Type `bye' to exit"
[ [THEN] ] ;
defer bootmessage ( -- ) \ gforth
\G Hook (deferred word) executed right after interpreting the OS
\G command-line arguments. Normally prints the Gforth startup
\G message.
has? file [IF]
defer process-args
[THEN]
' (bootmessage) IS bootmessage
has? os [IF]
Defer 'cold ( -- ) \ gforth tick-cold
\G Hook (deferred word) for things to do right before interpreting the
\G OS command-line arguments. Normally does some initializations that
\G you also want to perform.
' noop IS 'cold
[THEN]
: cold ( -- ) \ gforth
[ has? backtrace [IF] ]
rp@ backtrace-rp0 !
[ [THEN] ]
[ has? file [IF] ]
os-cold
[ [THEN] ]
[ has? os [IF] ]
set-encoding-fixed-width
'cold
[ [THEN] ]
[ has? file [IF] ]
process-args
loadline off
[ [THEN] ]
bootmessage
quit ;
has? new-input 0= [IF]
: clear-tibstack ( -- )
[ has? glocals [IF] ]
lp@ forthstart 7 cells + @ -
[ [ELSE] ]
[ has? os [IF] ]
r0 @ forthstart 6 cells + @ -
[ [ELSE] ]
sp@ cell+
[ [THEN] ]
[ [THEN] ]
dup >tib ! tibstack ! #tib off
input-start-line ;
[THEN]
: boot ( path n **argv argc -- )
[ has? no-userspace 0= [IF] ]
main-task up!
[ [THEN] ]
[ has? os [IF] ]
os-boot
[ [THEN] ]
[ has? rom [IF] ]
ram-shadow dup @ dup -1 <> >r u> r> and IF
ram-shadow 2@ ELSE
ram-mirror ram-size THEN ram-start swap move
[ [THEN] ]
sp@ sp0 !
[ has? peephole [IF] ]
\ only needed for greedy static superinstruction selection
\ primtable prepare-peephole-table TO peeptable
[ [THEN] ]
[ has? new-input [IF] ]
current-input off
[ [THEN] ]
clear-tibstack
0 0 includefilename 2!
rp@ rp0 !
[ has? floating [IF] ]
fp@ fp0 !
[ [THEN] ]
[ has? os [IF] ]
handler off
['] cold catch dup -&2049 <> if \ broken pipe?
DoError cr
endif
[ [ELSE] ]
cold
[ [THEN] ]
[ has? os [IF] ]
1 (bye) \ !! determin exit code from throw code?
[ [THEN] ]
;
has? os [IF]
: bye ( -- ) \ tools-ext
[ has? file [IF] ]
script? 0= IF cr THEN
[ [ELSE] ]
cr
[ [THEN] ]
0 (bye) ;
[THEN]
\ **argv may be scanned by the C starter to get some important
\ information, as -display and -geometry for an X client FORTH
\ or space and stackspace overrides
\ 0 arg contains, however, the name of the program.
|