Annotation of gforth/kernel/int.fs, revision 1.66
1.1 pazsan 1: \ definitions needed for interpreter only
2:
1.52 pazsan 3: \ Copyright (C) 1995-2000 Free Software Foundation, Inc.
1.11 anton 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
1.63 anton 19: \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
1.11 anton 20:
1.1 pazsan 21: \ \ Revision-Log
22:
23: \ put in seperate file 14sep97jaw
24:
25: \ \ input stream primitives 23feb93py
26:
1.33 jwilke 27: require ./basics.fs \ bounds decimal hex ...
28: require ./io.fs \ type ...
29: require ./nio.fs \ . <# ...
30: require ./errore.fs \ .error ...
1.50 anton 31: require kernel/version.fs \ version-string
1.33 jwilke 32: require ./../chains.fs
33:
1.64 pazsan 34: has? new-input 0= [IF]
1.43 crook 35: : tib ( -- c-addr ) \ core-ext t-i-b
1.40 crook 36: \G @i{c-addr} is the address of the Terminal Input Buffer.
1.29 crook 37: \G OBSOLESCENT: @code{source} superceeds the function of this word.
1.1 pazsan 38: >tib @ ;
39:
1.29 crook 40: Defer source ( -- c-addr u ) \ core
1.1 pazsan 41: \ used by dodefer:, must be defer
1.40 crook 42: \G @i{c-addr} is the address of the input buffer and @i{u} is the
1.29 crook 43: \G number of characters in it.
1.1 pazsan 44:
1.29 crook 45: : (source) ( -- c-addr u )
1.1 pazsan 46: tib #tib @ ;
47: ' (source) IS source
1.64 pazsan 48: [THEN]
1.1 pazsan 49:
50: : (word) ( addr1 n1 char -- addr2 n2 )
51: dup >r skip 2dup r> scan nip - ;
52:
53: \ (word) should fold white spaces
54: \ this is what (parse-white) does
55:
56: \ word parse 23feb93py
57:
1.29 crook 58: : sword ( char -- addr len ) \ gforth s-word
1.40 crook 59: \G Parses like @code{word}, but the output is like @code{parse} output.
1.47 anton 60: \G @xref{core-idef}.
1.3 anton 61: \ this word was called PARSE-WORD until 0.3.0, but Open Firmware and
62: \ dpANS6 A.6.2.2008 have a word with that name that behaves
63: \ differently (like NAME).
1.1 pazsan 64: source 2dup >r >r >in @ over min /string
65: rot dup bl = IF drop (parse-white) ELSE (word) THEN
66: 2dup + r> - 1+ r> min >in ! ;
67:
1.29 crook 68: : word ( char "<chars>ccc<char>-- c-addr ) \ core
1.40 crook 69: \G Skip leading delimiters. Parse @i{ccc}, delimited by
70: \G @i{char}, in the parse area. @i{c-addr} is the address of a
1.29 crook 71: \G transient region containing the parsed string in
1.40 crook 72: \G counted-string format. If the parse area was empty or
1.29 crook 73: \G contained no characters other than delimiters, the resulting
74: \G string has zero length. A program may replace characters within
75: \G the counted string. OBSOLESCENT: the counted string has a
76: \G trailing space that is not included in its length.
77: sword here place bl here count + c! here ;
78:
79: : parse ( char "ccc<char>" -- c-addr u ) \ core-ext
1.40 crook 80: \G Parse @i{ccc}, delimited by @i{char}, in the parse
81: \G area. @i{c-addr u} specifies the parsed string within the
82: \G parse area. If the parse area was empty, @i{u} is 0.
1.29 crook 83: >r source >in @ over min /string over swap r> scan >r
1.1 pazsan 84: over - dup r> IF 1+ THEN >in +! ;
85:
86: \ name 13feb93py
87:
88: [IFUNDEF] (name) \ name might be a primitive
89:
1.40 crook 90: : (name) ( -- c-addr count ) \ gforth
1.1 pazsan 91: source 2dup >r >r >in @ /string (parse-white)
92: 2dup + r> - 1+ r> min >in ! ;
93: \ name count ;
94: [THEN]
95:
96: : name-too-short? ( c-addr u -- c-addr u )
97: dup 0= -&16 and throw ;
98:
99: : name-too-long? ( c-addr u -- c-addr u )
100: dup $1F u> -&19 and throw ;
101:
102: \ \ Number parsing 23feb93py
103:
104: \ number? number 23feb93py
105:
106: hex
107: const Create bases 10 , 2 , A , 100 ,
108: \ 16 2 10 character
109:
1.18 anton 110: \ !! protect BASE saving wrapper against exceptions
1.1 pazsan 111: : getbase ( addr u -- addr' u' )
112: over c@ [char] $ - dup 4 u<
113: IF
114: cells bases + @ base ! 1 /string
115: ELSE
116: drop
117: THEN ;
118:
1.20 pazsan 119: : sign? ( addr u -- addr u flag )
1.33 jwilke 120: over c@ [char] - = dup >r
1.1 pazsan 121: IF
122: 1 /string
123: THEN
1.20 pazsan 124: r> ;
125:
126: : s>unumber? ( addr u -- ud flag )
1.21 pazsan 127: base @ >r dpl on getbase
1.20 pazsan 128: 0. 2swap
1.18 anton 129: BEGIN ( d addr len )
1.1 pazsan 130: dup >r >number dup
1.18 anton 131: WHILE \ there are characters left
1.1 pazsan 132: dup r> -
1.18 anton 133: WHILE \ the last >number parsed something
134: dup 1- dpl ! over c@ [char] . =
135: WHILE \ the current char is '.'
1.1 pazsan 136: 1 /string
1.18 anton 137: REPEAT THEN \ there are unparseable characters left
1.21 pazsan 138: 2drop false
1.20 pazsan 139: ELSE
140: rdrop 2drop true
1.21 pazsan 141: THEN
142: r> base ! ;
1.20 pazsan 143:
144: \ ouch, this is complicated; there must be a simpler way - anton
145: : s>number? ( addr len -- d f )
146: \ converts string addr len into d, flag indicates success
1.21 pazsan 147: sign? >r
1.20 pazsan 148: s>unumber?
149: 0= IF
1.21 pazsan 150: rdrop false
1.18 anton 151: ELSE \ no characters left, all ok
1.20 pazsan 152: r>
1.1 pazsan 153: IF
154: dnegate
155: THEN
1.18 anton 156: true
1.21 pazsan 157: THEN ;
1.1 pazsan 158:
1.18 anton 159: : s>number ( addr len -- d )
160: \ don't use this, there is no way to tell success
161: s>number? drop ;
162:
1.1 pazsan 163: : snumber? ( c-addr u -- 0 / n -1 / d 0> )
1.18 anton 164: s>number? 0=
1.1 pazsan 165: IF
166: 2drop false EXIT
167: THEN
1.18 anton 168: dpl @ dup 0< IF
1.1 pazsan 169: nip
1.18 anton 170: ELSE
171: 1+
1.1 pazsan 172: THEN ;
173:
174: : number? ( string -- string 0 / n -1 / d 0> )
175: dup >r count snumber? dup if
176: rdrop
177: else
178: r> swap
179: then ;
180:
181: : number ( string -- d )
182: number? ?dup 0= abort" ?" 0<
183: IF
184: s>d
185: THEN ;
186:
187: \ \ Comments ( \ \G
188:
1.29 crook 189: : ( ( compilation 'ccc<close-paren>' -- ; run-time -- ) \ thisone- core,file paren
1.17 crook 190: \G ** this will not get annotated. The alias in glocals.fs will instead **
1.29 crook 191: \G It does not work to use "wordset-" prefix since this file is glossed
192: \G by cross.fs which doesn't have the same functionalty as makedoc.fs
1.1 pazsan 193: [char] ) parse 2drop ; immediate
194:
1.51 anton 195: : \ ( compilation 'ccc<newline>' -- ; run-time -- ) \ thisone- core-ext,block-ext backslash
1.29 crook 196: \G ** this will not get annotated. The alias in glocals.fs will instead **
197: \G It does not work to use "wordset-" prefix since this file is glossed
198: \G by cross.fs which doesn't have the same functionalty as makedoc.fs
1.12 pazsan 199: [ has? file [IF] ]
1.1 pazsan 200: blk @
201: IF
202: >in @ c/l / 1+ c/l * >in !
203: EXIT
204: THEN
1.12 pazsan 205: [ [THEN] ]
1.1 pazsan 206: source >in ! drop ; immediate
207:
1.51 anton 208: : \G ( compilation 'ccc<newline>' -- ; run-time -- ) \ gforth backslash-gee
1.19 crook 209: \G Equivalent to @code{\} but used as a tag to annotate definition
210: \G comments into documentation.
1.1 pazsan 211: POSTPONE \ ; immediate
212:
213: \ \ object oriented search list 17mar93py
214:
215: \ word list structure:
216:
217: struct
218: cell% field find-method \ xt: ( c_addr u wid -- nt )
219: cell% field reveal-method \ xt: ( nt wid -- ) \ used by dofield:, must be field
220: cell% field rehash-method \ xt: ( wid -- ) \ re-initializes a "search-data" (hashtables)
221: cell% field hash-method \ xt: ( wid -- ) \ initializes ""
222: \ \ !! what else
223: end-struct wordlist-map-struct
224:
225: struct
1.6 pazsan 226: cell% field wordlist-map \ pointer to a wordlist-map-struct
1.13 anton 227: cell% field wordlist-id \ linked list of words (for WORDS etc.)
1.1 pazsan 228: cell% field wordlist-link \ link field to other wordlists
1.13 anton 229: cell% field wordlist-extend \ wordlist extensions (eg bucket offset)
1.1 pazsan 230: end-struct wordlist-struct
231:
232: : f83find ( addr len wordlist -- nt / false )
1.6 pazsan 233: wordlist-id @ (f83find) ;
1.1 pazsan 234:
235: : initvoc ( wid -- )
236: dup wordlist-map @ hash-method perform ;
237:
238: \ Search list table: find reveal
239: Create f83search ( -- wordlist-map )
240: ' f83find A, ' drop A, ' drop A, ' drop A,
241:
1.6 pazsan 242: here G f83search T A, NIL A, NIL A, NIL A,
1.1 pazsan 243: AValue forth-wordlist \ variable, will be redefined by search.fs
244:
245: AVariable lookup forth-wordlist lookup !
246: \ !! last is user and lookup?! jaw
247: AVariable current ( -- addr ) \ gforth
1.43 crook 248: \G @code{Variable} -- holds the @i{wid} of the compilation word list.
1.1 pazsan 249: AVariable voclink forth-wordlist wordlist-link voclink !
1.38 anton 250: \ lookup AValue context ( -- addr ) \ gforth
251: Defer context ( -- addr ) \ gforth
1.43 crook 252: \G @code{context} @code{@@} is the @i{wid} of the word list at the
253: \G top of the search order.
1.1 pazsan 254:
1.38 anton 255: ' lookup is context
1.1 pazsan 256: forth-wordlist current !
257:
258: \ \ header, finding, ticks 17dec92py
259:
1.33 jwilke 260: hex
261: 80 constant alias-mask \ set when the word is not an alias!
262: 40 constant immediate-mask
263: 20 constant restrict-mask
1.1 pazsan 264:
265: \ higher level parts of find
266:
267: : flag-sign ( f -- 1|-1 )
268: \ true becomes 1, false -1
269: 0= 2* 1+ ;
270:
271: : compile-only-error ( ... -- )
272: -&14 throw ;
273:
274: : (cfa>int) ( cfa -- xt )
275: [ has? compiler [IF] ]
276: dup interpret/compile?
277: if
278: interpret/compile-int @
279: then
280: [ [THEN] ] ;
281:
282: : (x>int) ( cfa b -- xt )
283: \ get interpretation semantics of name
284: restrict-mask and
285: if
286: drop ['] compile-only-error
287: else
288: (cfa>int)
289: then ;
290:
291: : name>string ( nt -- addr count ) \ gforth head-to-string
1.40 crook 292: \g @i{addr count} is the name of the word represented by @i{nt}.
1.1 pazsan 293: cell+ count $1F and ;
294:
295: : ((name>)) ( nfa -- cfa )
296: name>string + cfaligned ;
297:
298: : (name>x) ( nfa -- cfa b )
299: \ cfa is an intermediate cfa and b is the flags byte of nfa
300: dup ((name>))
301: swap cell+ c@ dup alias-mask and 0=
302: IF
303: swap @ swap
304: THEN ;
305:
306: : name>int ( nt -- xt ) \ gforth
1.31 crook 307: \G @i{xt} represents the interpretation semantics of the word
308: \G @i{nt}. If @i{nt} has no interpretation semantics (i.e. is
309: \G @code{compile-only}), @i{xt} is the execution token for
310: \G @code{compile-only-error}, which performs @code{-14 throw}.
1.1 pazsan 311: (name>x) (x>int) ;
312:
313: : name?int ( nt -- xt ) \ gforth
1.31 crook 314: \G Like @code{name>int}, but perform @code{-14 throw} if @i{nt}
315: \G has no interpretation semantics.
1.1 pazsan 316: (name>x) restrict-mask and
317: if
318: compile-only-error \ does not return
319: then
320: (cfa>int) ;
321:
322: : (name>comp) ( nt -- w +-1 ) \ gforth
1.31 crook 323: \G @i{w xt} is the compilation token for the word @i{nt}.
1.1 pazsan 324: (name>x) >r
325: [ has? compiler [IF] ]
326: dup interpret/compile?
327: if
328: interpret/compile-comp @
329: then
330: [ [THEN] ]
331: r> immediate-mask and flag-sign
332: ;
333:
334: : (name>intn) ( nfa -- xt +-1 )
335: (name>x) tuck (x>int) ( b xt )
336: swap immediate-mask and flag-sign ;
337:
1.30 jwilke 338: const Create ??? 0 , 3 c, char ? c, char ? c, char ? c,
339: \ ??? is used by dovar:, must be created/:dovar
340:
341: [IFDEF] forthstart
342: \ if we have a forthstart we can define head? with it
343: \ otherwise leave out the head? check
344:
1.14 anton 345: : head? ( addr -- f )
346: \G heuristic check whether addr is a name token; may deliver false
347: \G positives; addr must be a valid address
348: \ we follow the link fields and check for plausibility; two
349: \ iterations should catch most false addresses: on the first
350: \ iteration, we may get an xt, on the second a code address (or
351: \ some code), which is typically not in the dictionary.
352: 2 0 do
1.41 anton 353: dup dup aligned <> if \ protect @ against unaligned accesses
354: drop false unloop exit
355: then
1.14 anton 356: dup @ dup
357: if ( addr addr1 )
358: dup rot forthstart within
359: if \ addr1 is outside forthstart..addr, not a head
360: drop false unloop exit
361: then ( addr1 )
362: else \ 0 in the link field, no further checks
363: 2drop true unloop exit
364: then
365: loop
366: \ in dubio pro:
367: drop true ;
368:
1.48 anton 369: : >head-noprim ( cfa -- nt ) \ gforth to-head-noprim
1.45 pazsan 370: $25 cell do ( cfa )
1.14 anton 371: dup i - count $9F and + cfaligned over alias-mask + =
372: if ( cfa )
373: dup i - cell - dup head?
374: if
375: nip unloop exit
376: then
377: drop
378: then
379: cell +loop
380: drop ??? ( wouldn't 0 be better? ) ;
1.1 pazsan 381:
1.30 jwilke 382: [ELSE]
383:
1.48 anton 384: : >head-noprim ( cfa -- nt ) \ gforth to-head-noprim
1.45 pazsan 385: $25 cell do ( cfa )
1.30 jwilke 386: dup i - count $9F and + cfaligned over alias-mask + =
387: if ( cfa ) i - cell - unloop exit
388: then
389: cell +loop
390: drop ??? ( wouldn't 0 be better? ) ;
391:
392: [THEN]
1.1 pazsan 393:
394: : body> 0 >body - ;
395:
1.31 crook 396: : (search-wordlist) ( addr count wid -- nt | false )
1.1 pazsan 397: dup wordlist-map @ find-method perform ;
398:
1.31 crook 399: : search-wordlist ( c-addr count wid -- 0 | xt +-1 ) \ search
1.53 anton 400: \G Search the word list identified by @i{wid} for the definition
401: \G named by the string at @i{c-addr count}. If the definition is
402: \G not found, return 0. If the definition is found return 1 (if
403: \G the definition is immediate) or -1 (if the definition is not
404: \G immediate) together with the @i{xt}. In Gforth, the @i{xt}
405: \G returned represents the interpretation semantics. ANS Forth
406: \G does not specify clearly what @i{xt} represents.
1.1 pazsan 407: (search-wordlist) dup if
408: (name>intn)
409: then ;
410:
1.31 crook 411: : find-name ( c-addr u -- nt | 0 ) \ gforth
412: \g Find the name @i{c-addr u} in the current search
413: \g order. Return its @i{nt}, if found, otherwise 0.
1.1 pazsan 414: lookup @ (search-wordlist) ;
415:
416: : sfind ( c-addr u -- 0 / xt +-1 ) \ gforth-obsolete
417: find-name dup
418: if ( nt )
419: state @
420: if
421: (name>comp)
422: else
423: (name>intn)
424: then
425: then ;
426:
1.31 crook 427: : find ( c-addr -- xt +-1 | c-addr 0 ) \ core,search
1.53 anton 428: \G Search all word lists in the current search order for the
429: \G definition named by the counted string at @i{c-addr}. If the
430: \G definition is not found, return 0. If the definition is found
431: \G return 1 (if the definition has non-default compilation
432: \G semantics) or -1 (if the definition has default compilation
433: \G semantics). The @i{xt} returned in interpret state represents
434: \G the interpretation semantics. The @i{xt} returned in compile
435: \G state represented either the compilation semantics (for
436: \G non-default compilation semantics) or the run-time semantics
437: \G that the compilation semantics would @code{compile,} (for
438: \G default compilation semantics). The ANS Forth standard does
439: \G not specify clearly what the returned @i{xt} represents (and
440: \G also talks about immediacy instead of non-default compilation
441: \G semantics), so this word is questionable in portable programs.
442: \G If non-portability is ok, @code{find-name} and friends are
443: \G better (@pxref{Name token}).
1.1 pazsan 444: dup count sfind dup
445: if
446: rot drop
447: then ;
448:
1.34 jwilke 449: \ ticks in interpreter
1.1 pazsan 450:
451: : (') ( "name" -- nt ) \ gforth
1.32 anton 452: name name-too-short?
1.28 anton 453: find-name dup 0=
1.1 pazsan 454: IF
1.42 anton 455: drop -&13 throw
1.1 pazsan 456: THEN ;
457:
458: : ' ( "name" -- xt ) \ core tick
1.31 crook 459: \g @i{xt} represents @i{name}'s interpretation
460: \g semantics. Perform @code{-14 throw} if the word has no
1.1 pazsan 461: \g interpretation semantics.
462: (') name?int ;
1.34 jwilke 463:
464: has? compiler 0= [IF] \ interpreter only version of IS and TO
465:
466: : IS ' >body ! ;
467: ' IS Alias TO
468:
469: [THEN]
1.1 pazsan 470:
471: \ \ the interpreter loop mar92py
472:
473: \ interpret 10mar92py
474:
1.37 anton 475: Defer parser ( c-addr u -- )
1.1 pazsan 476: Defer name ( -- c-addr count ) \ gforth
1.55 anton 477: \G Get the next word from the input buffer
1.1 pazsan 478: ' (name) IS name
479: Defer compiler-notfound ( c-addr count -- )
480: Defer interpreter-notfound ( c-addr count -- )
481:
482: : no.extensions ( addr u -- )
1.42 anton 483: 2drop -&13 throw ;
1.1 pazsan 484: ' no.extensions IS compiler-notfound
485: ' no.extensions IS interpreter-notfound
486:
1.66 ! anton 487: : interpret1 ( ... -- ... )
1.33 jwilke 488: [ has? backtrace [IF] ]
1.24 anton 489: rp@ backtrace-rp0 !
1.33 jwilke 490: [ [THEN] ]
1.1 pazsan 491: BEGIN
492: ?stack name dup
493: WHILE
494: parser
495: REPEAT
1.66 ! anton 496: 2drop ;
! 497:
! 498: : interpret ( ?? -- ?? ) \ gforth
! 499: \ interpret/compile the (rest of the) input buffer
! 500: [ has? backtrace [IF] ]
! 501: backtrace-rp0 @ >r
! 502: [ [THEN] ]
! 503: ['] interpret1 catch
1.65 anton 504: [ has? backtrace [IF] ]
505: r> backtrace-rp0 !
1.66 ! anton 506: [ [THEN] ]
! 507: throw ;
1.1 pazsan 508:
509: \ interpreter 30apr92py
510:
511: \ not the most efficient implementations of interpreter and compiler
1.33 jwilke 512: : interpreter ( c-addr u -- )
1.1 pazsan 513: 2dup find-name dup
514: if
515: nip nip name>int execute
516: else
517: drop
518: 2dup 2>r snumber?
519: IF
520: 2rdrop
521: ELSE
522: 2r> interpreter-notfound
523: THEN
524: then ;
525:
526: ' interpreter IS parser
527:
528: \ \ Query Evaluate 07apr93py
529:
530: has? file 0= [IF]
1.12 pazsan 531: : sourceline# ( -- n ) 1 ;
1.61 pazsan 532: [ELSE]
1.64 pazsan 533: has? new-input 0= [IF]
1.58 pazsan 534: Variable #fill-bytes
535: \G number of bytes read via (read-line) by the last refill
1.61 pazsan 536: [THEN]
1.64 pazsan 537: [THEN]
1.58 pazsan 538:
1.64 pazsan 539: has? new-input 0= [IF]
1.1 pazsan 540: : refill ( -- flag ) \ core-ext,block-ext,file-ext
1.29 crook 541: \G Attempt to fill the input buffer from the input source. When
542: \G the input source is the user input device, attempt to receive
543: \G input into the terminal input device. If successful, make the
544: \G result the input buffer, set @code{>IN} to 0 and return true;
545: \G otherwise return false. When the input source is a block, add 1
546: \G to the value of @code{BLK} to make the next block the input
547: \G source and current input buffer, and set @code{>IN} to 0;
548: \G return true if the new value of @code{BLK} is a valid block
549: \G number, false otherwise. When the input source is a text file,
550: \G attempt to read the next line from the file. If successful,
551: \G make the result the current input buffer, set @code{>IN} to 0
552: \G and return true; otherwise, return false. A successful result
553: \G includes receipt of a line containing 0 characters.
1.12 pazsan 554: [ has? file [IF] ]
555: blk @ IF 1 blk +! true 0 >in ! EXIT THEN
556: [ [THEN] ]
557: tib /line
558: [ has? file [IF] ]
559: loadfile @ ?dup
1.59 pazsan 560: IF (read-line) throw #fill-bytes !
1.12 pazsan 561: ELSE
562: [ [THEN] ]
563: sourceline# 0< IF 2drop false EXIT THEN
564: accept true
565: [ has? file [IF] ]
566: THEN
567: 1 loadline +!
568: [ [THEN] ]
569: swap #tib ! 0 >in ! ;
1.1 pazsan 570:
571: : query ( -- ) \ core-ext
1.29 crook 572: \G Make the user input device the input source. Receive input into
573: \G the Terminal Input Buffer. Set @code{>IN} to zero. OBSOLESCENT:
574: \G superceeded by @code{accept}.
1.12 pazsan 575: [ has? file [IF] ]
576: blk off loadfile off
577: [ [THEN] ]
1.64 pazsan 578: refill drop ;
579: [THEN]
1.1 pazsan 580:
581: \ save-mem extend-mem
582:
583: has? os [IF]
584: : save-mem ( addr1 u -- addr2 u ) \ gforth
585: \g copy a memory block into a newly allocated region in the heap
586: swap >r
587: dup allocate throw
588: swap 2dup r> -rot move ;
589:
590: : extend-mem ( addr1 u1 u -- addr addr2 u2 )
591: \ extend memory block allocated from the heap by u aus
592: \ the (possibly reallocated piece is addr2 u2, the extension is at addr
593: over >r + dup >r resize throw
594: r> over r> + -rot ;
595: [THEN]
596:
597: \ EVALUATE 17may93jaw
598:
1.64 pazsan 599: has? file 0= has? new-input 0= and [IF]
1.1 pazsan 600: : push-file ( -- ) r>
1.12 pazsan 601: tibstack @ >r >tib @ >r #tib @ >r
1.1 pazsan 602: >tib @ tibstack @ = IF r@ tibstack +! THEN
603: tibstack @ >tib ! >in @ >r >r ;
604:
605: : pop-file ( throw-code -- throw-code )
606: r>
1.12 pazsan 607: r> >in ! r> #tib ! r> >tib ! r> tibstack ! >r ;
1.1 pazsan 608: [THEN]
609:
1.64 pazsan 610: has? new-input 0= [IF]
1.29 crook 611: : evaluate ( c-addr u -- ) \ core,block
1.40 crook 612: \G Save the current input source specification. Store @code{-1} in
613: \G @code{source-id} and @code{0} in @code{blk}. Set @code{>IN} to
614: \G @code{0} and make the string @i{c-addr u} the input source
615: \G and input buffer. Interpret. When the parse area is empty,
616: \G restore the input source specification.
1.64 pazsan 617: [ has? file [IF] ]
1.56 anton 618: loadfilename# @ >r
1.60 anton 619: 1 loadfilename# ! \ "*evaluated string*"
1.64 pazsan 620: [ [THEN] ]
1.40 crook 621: push-file #tib ! >tib !
1.29 crook 622: >in off
623: [ has? file [IF] ]
624: blk off loadfile off -1 loadline !
625: [ [THEN] ]
626: ['] interpret catch
1.56 anton 627: pop-file
1.64 pazsan 628: [ has? file [IF] ]
1.56 anton 629: r> loadfilename# !
1.64 pazsan 630: [ [THEN] ]
1.56 anton 631: throw ;
1.64 pazsan 632: [THEN]
1.1 pazsan 633:
634: \ \ Quit 13feb93py
635:
636: Defer 'quit
637:
638: Defer .status
639:
640: : prompt state @ IF ." compiled" EXIT THEN ." ok" ;
641:
1.39 anton 642: : (quit) ( -- )
643: \ exits only through THROW etc.
1.42 anton 644: \ sp0 @ cell - handler @ &12 + ! \ !! kludge: fix the stack pointer
1.39 anton 645: \ stored in the system's CATCH frame, so the stack depth will be 0
646: \ after the next THROW it catches (it may be off due to BOUNCEs or
647: \ because process-args left something on the stack)
648: BEGIN
1.64 pazsan 649: .status cr query interpret prompt
1.39 anton 650: AGAIN ;
1.1 pazsan 651:
652: ' (quit) IS 'quit
653:
654: \ \ DOERROR (DOERROR) 13jun93jaw
655:
656: 8 Constant max-errors
657: Variable error-stack 0 error-stack !
1.64 pazsan 658: max-errors has? file [IF] 6 [ELSE] 4 [THEN] * cells allot
1.1 pazsan 659: \ format of one cell:
660: \ source ( addr u )
661: \ >in
662: \ line-number
663: \ Loadfilename ( addr u )
664:
1.64 pazsan 665: : error> ( -- addr u >in line# [addr u] )
666: -1 error-stack +!
667: error-stack dup @
668: [ has? file [IF] 6 [ELSE] 4 [THEN] ] Literal * cells + cell+
669: [ has? file [IF] 6 [ELSE] 4 [THEN] ] Literal cells bounds DO
670: I @
671: cell +LOOP ;
672: : >error ( addr u >in line# [addr u] -- )
673: error-stack dup @ dup 1+
674: max-errors 1- min error-stack !
675: [ has? file [IF] 6 [ELSE] 4 [THEN] ] Literal * cells + cell+
676: [ has? file [IF] 6 [ELSE] 4 [THEN] 1- ] Literal cells bounds swap DO
677: I !
678: -1 cells +LOOP ;
679:
1.1 pazsan 680: : dec. ( n -- ) \ gforth
1.40 crook 681: \G Display @i{n} as a signed decimal number, followed by a space.
682: \ !! not used...
1.1 pazsan 683: base @ decimal swap . base ! ;
684:
1.23 jwilke 685: : dec.r ( u -- ) \ gforth
1.40 crook 686: \G Display @i{u} as a unsigned decimal number
1.23 jwilke 687: base @ decimal swap 0 .r base ! ;
688:
1.1 pazsan 689: : hex. ( u -- ) \ gforth
1.40 crook 690: \G Display @i{u} as an unsigned hex number, prefixed with a "$" and
1.17 crook 691: \G followed by a space.
1.40 crook 692: \ !! not used...
1.33 jwilke 693: [char] $ emit base @ swap hex u. base ! ;
1.1 pazsan 694:
695: : typewhite ( addr u -- ) \ gforth
1.40 crook 696: \G Like type, but white space is printed instead of the characters.
1.1 pazsan 697: bounds ?do
698: i c@ #tab = if \ check for tab
699: #tab
700: else
701: bl
702: then
703: emit
704: loop ;
705:
706: DEFER DOERROR
1.33 jwilke 707:
708: has? backtrace [IF]
1.15 anton 709: Defer dobacktrace ( -- )
710: ' noop IS dobacktrace
1.33 jwilke 711: [THEN]
1.1 pazsan 712:
1.23 jwilke 713: : .error-string ( throw-code -- )
714: dup -2 =
715: IF "error @ ?dup IF count type THEN drop
716: ELSE .error
717: THEN ;
718:
1.64 pazsan 719: : .error-frame ( throwcode addr1 u1 n1 n2 [addr2 u2] -- throwcode )
720: \ addr2 u2: filename of included file - optional
1.23 jwilke 721: \ n2: line number
722: \ n1: error position in input line
723: \ addr1 u1: input line
1.1 pazsan 724: cr error-stack @
725: IF
1.64 pazsan 726: [ has? file [IF] ]
727: ." in file included from "
728: type ." :"
729: [ [THEN] ]
730: dec.r drop 2drop
1.1 pazsan 731: ELSE
1.64 pazsan 732: [ has? file [IF] ]
733: type ." :"
734: [ [THEN] ]
735: dup >r dec.r ." : " 3 pick .error-string
1.57 anton 736: r> IF \ if line# non-zero, there is a line
737: cr dup 2over type cr drop
738: nip -trailing 1- ( line-start index2 )
739: 0 >r BEGIN
740: 2dup + c@ bl > WHILE
741: r> 1+ >r 1- dup 0< UNTIL THEN 1+
742: ( line-start index1 )
743: typewhite
744: r> 1 max 0 ?do \ we want at least one "^", even if the length is 0
745: [char] ^ emit
746: loop
747: ELSE
748: 2drop drop
749: THEN
1.23 jwilke 750: THEN ;
1.1 pazsan 751:
752: : (DoError) ( throw-code -- )
753: [ has? os [IF] ]
1.8 pazsan 754: >stderr
1.1 pazsan 755: [ [THEN] ]
1.64 pazsan 756: source >in @ sourceline# [ has? file [IF] ]
757: sourcefilename
758: [ [THEN] ] .error-frame
1.1 pazsan 759: error-stack @ 0 ?DO
1.64 pazsan 760: error>
1.1 pazsan 761: .error-frame
762: LOOP
1.33 jwilke 763: drop
764: [ has? backtrace [IF] ]
765: dobacktrace
766: [ [THEN] ]
1.8 pazsan 767: normal-dp dpp ! ;
1.1 pazsan 768:
769: ' (DoError) IS DoError
770:
771: : quit ( ?? -- ?? ) \ core
1.27 crook 772: \G Empty the return stack, make the user input device
773: \G the input source, enter interpret state and start
774: \G the text interpreter.
1.64 pazsan 775: rp0 @ rp! handler off clear-tibstack
776: [ has? new-input 0= [IF] ] >tib @ >r [ [THEN] ]
1.1 pazsan 777: BEGIN
778: [ has? compiler [IF] ]
779: postpone [
780: [ [THEN] ]
781: ['] 'quit CATCH dup
782: WHILE
1.22 anton 783: <# \ reset hold area, or we may get another error
1.64 pazsan 784: DoError
785: [ has? new-input [IF] ] clear-tibstack
786: [ [ELSE] ] r@ >tib ! r@ tibstack !
787: [ [THEN] ]
1.1 pazsan 788: REPEAT
1.64 pazsan 789: drop [ has? new-input [IF] ] clear-tibstack
790: [ [ELSE] ] r> >tib !
791: [ [THEN] ] ;
1.1 pazsan 792:
793: \ \ Cold Boot 13feb93py
794:
795: : (bootmessage)
796: ." GForth " version-string type
1.52 pazsan 797: ." , Copyright (C) 1995-2000 Free Software Foundation, Inc." cr
1.1 pazsan 798: ." GForth comes with ABSOLUTELY NO WARRANTY; for details type `license'"
799: [ has? os [IF] ]
800: cr ." Type `bye' to exit"
801: [ [THEN] ] ;
802:
803: defer bootmessage
804: defer process-args
805:
806: ' (bootmessage) IS bootmessage
807:
1.10 anton 808: Defer 'cold ( -- ) \ gforth tick-cold
1.1 pazsan 809: \ hook (deferred word) for things to do right before interpreting the
810: \ command-line arguments
811: ' noop IS 'cold
812:
813:
814: Variable init8
815:
816: : cold ( -- ) \ gforth
1.44 anton 817: [ has? backtrace [IF] ]
818: rp@ backtrace-rp0 !
819: [ [THEN] ]
1.1 pazsan 820: [ has? file [IF] ]
821: pathstring 2@ fpath only-path
822: init-included-files
823: [ [THEN] ]
824: 'cold
825: init8 chainperform
826: [ has? file [IF] ]
1.62 anton 827: loadfilename# off
1.8 pazsan 828: process-args
1.12 pazsan 829: loadline off
1.1 pazsan 830: [ [THEN] ]
831: bootmessage
1.12 pazsan 832: quit ;
1.1 pazsan 833:
1.64 pazsan 834: has? new-input 0= [IF]
1.5 anton 835: : clear-tibstack ( -- )
836: [ has? glocals [IF] ]
837: lp@ forthstart 7 cells + @ -
838: [ [ELSE] ]
839: [ has? os [IF] ]
1.8 pazsan 840: r0 @ forthstart 6 cells + @ -
1.5 anton 841: [ [ELSE] ]
1.16 pazsan 842: sp@ $10 cells +
1.5 anton 843: [ [THEN] ]
844: [ [THEN] ]
845: dup >tib ! tibstack ! #tib off >in off ;
1.64 pazsan 846: [THEN]
1.5 anton 847:
1.64 pazsan 848: : boot ( path n **argv argc -- )
1.1 pazsan 849: main-task up!
850: [ has? os [IF] ]
851: stdout TO outfile-id
1.7 pazsan 852: stdin TO infile-id
1.1 pazsan 853: \ !! [ [THEN] ]
854: \ !! [ has? file [IF] ]
855: argc ! argv ! pathstring 2!
856: [ [THEN] ]
857: sp@ sp0 !
1.64 pazsan 858: [ has? new-input [IF] ]
859: current-input off
860: [ [THEN] ]
1.5 anton 861: clear-tibstack
1.1 pazsan 862: rp@ rp0 !
863: [ has? floating [IF] ]
864: fp@ fp0 !
865: [ [THEN] ]
1.46 anton 866: handler off
1.8 pazsan 867: ['] cold catch DoError cr
1.1 pazsan 868: [ has? os [IF] ]
1.35 anton 869: 1 (bye) \ !! determin exit code from throw code?
1.1 pazsan 870: [ [THEN] ]
871: ;
872:
873: has? os [IF]
874: : bye ( -- ) \ tools-ext
875: [ has? file [IF] ]
876: script? 0= IF cr THEN
877: [ [ELSE] ]
878: cr
879: [ [THEN] ]
880: 0 (bye) ;
881: [THEN]
882:
883: \ **argv may be scanned by the C starter to get some important
884: \ information, as -display and -geometry for an X client FORTH
885: \ or space and stackspace overrides
886:
887: \ 0 arg contains, however, the name of the program.
888:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to int.fs CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [gforth] / gforth / kernel