Annotation of gforth/kernel/int.fs, revision 1.75
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 )
1.67 anton 100: dup lcount-mask u> -&19 and throw ;
1.1 pazsan 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.67 anton 233: wordlist-id @ (listlfind) ;
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.69 pazsan 260: \ The constants are defined as 32 bits, but then erased
261: \ and overwritten by the right ones
1.67 anton 262:
263: $80000000 constant alias-mask
1.69 pazsan 264: 1 bits/char 1 - lshift
265: -1 cells allot bigendian [IF] c, 0 1 cells 1- times
266: [ELSE] 0 1 cells 1- times c, [THEN]
1.67 anton 267: $40000000 constant immediate-mask
1.69 pazsan 268: 1 bits/char 2 - lshift
269: -1 cells allot bigendian [IF] c, 0 1 cells 1- times
270: [ELSE] 0 1 cells 1- times c, [THEN]
1.67 anton 271: $20000000 constant restrict-mask
1.69 pazsan 272: 1 bits/char 3 - lshift
273: -1 cells allot bigendian [IF] c, 0 1 cells 1- times
274: [ELSE] 0 1 cells 1- times c, [THEN]
1.67 anton 275: $1fffffff constant lcount-mask
1.69 pazsan 276: 1 bits/char 3 - lshift 1 -
1.71 pazsan 277: -1 cells allot bigendian [IF] c, -1 1 cells 1- times
278: [ELSE] -1 1 cells 1- times c, [THEN]
1.1 pazsan 279:
280: \ higher level parts of find
281:
282: : flag-sign ( f -- 1|-1 )
283: \ true becomes 1, false -1
284: 0= 2* 1+ ;
285:
286: : compile-only-error ( ... -- )
287: -&14 throw ;
288:
289: : (cfa>int) ( cfa -- xt )
290: [ has? compiler [IF] ]
291: dup interpret/compile?
292: if
293: interpret/compile-int @
294: then
295: [ [THEN] ] ;
296:
1.67 anton 297: : (x>int) ( cfa w -- xt )
1.1 pazsan 298: \ get interpretation semantics of name
299: restrict-mask and
300: if
301: drop ['] compile-only-error
302: else
303: (cfa>int)
304: then ;
305:
306: : name>string ( nt -- addr count ) \ gforth head-to-string
1.40 crook 307: \g @i{addr count} is the name of the word represented by @i{nt}.
1.67 anton 308: cell+ dup cell+ swap @ lcount-mask and ;
1.1 pazsan 309:
310: : ((name>)) ( nfa -- cfa )
311: name>string + cfaligned ;
312:
1.67 anton 313: : (name>x) ( nfa -- cfa w )
314: \ cfa is an intermediate cfa and w is the flags cell of nfa
1.1 pazsan 315: dup ((name>))
1.67 anton 316: swap cell+ @ dup alias-mask and 0=
1.1 pazsan 317: IF
318: swap @ swap
319: THEN ;
320:
321: : name>int ( nt -- xt ) \ gforth
1.31 crook 322: \G @i{xt} represents the interpretation semantics of the word
323: \G @i{nt}. If @i{nt} has no interpretation semantics (i.e. is
324: \G @code{compile-only}), @i{xt} is the execution token for
325: \G @code{compile-only-error}, which performs @code{-14 throw}.
1.1 pazsan 326: (name>x) (x>int) ;
327:
328: : name?int ( nt -- xt ) \ gforth
1.31 crook 329: \G Like @code{name>int}, but perform @code{-14 throw} if @i{nt}
330: \G has no interpretation semantics.
1.1 pazsan 331: (name>x) restrict-mask and
332: if
333: compile-only-error \ does not return
334: then
335: (cfa>int) ;
336:
337: : (name>comp) ( nt -- w +-1 ) \ gforth
1.31 crook 338: \G @i{w xt} is the compilation token for the word @i{nt}.
1.1 pazsan 339: (name>x) >r
340: [ has? compiler [IF] ]
341: dup interpret/compile?
342: if
343: interpret/compile-comp @
344: then
345: [ [THEN] ]
346: r> immediate-mask and flag-sign
347: ;
348:
349: : (name>intn) ( nfa -- xt +-1 )
1.67 anton 350: (name>x) tuck (x>int) ( w xt )
1.1 pazsan 351: swap immediate-mask and flag-sign ;
352:
1.72 pazsan 353: const Create ??? 0 , 3 , char ? c, char ? c, char ? c,
1.30 jwilke 354: \ ??? is used by dovar:, must be created/:dovar
355:
356: [IFDEF] forthstart
357: \ if we have a forthstart we can define head? with it
358: \ otherwise leave out the head? check
359:
1.14 anton 360: : head? ( addr -- f )
361: \G heuristic check whether addr is a name token; may deliver false
362: \G positives; addr must be a valid address
363: \ we follow the link fields and check for plausibility; two
364: \ iterations should catch most false addresses: on the first
365: \ iteration, we may get an xt, on the second a code address (or
366: \ some code), which is typically not in the dictionary.
1.75 ! anton 367: \ !! does not work se well for simple-see: trips on the first "0"
1.14 anton 368: 2 0 do
1.41 anton 369: dup dup aligned <> if \ protect @ against unaligned accesses
370: drop false unloop exit
371: then
1.14 anton 372: dup @ dup
373: if ( addr addr1 )
374: dup rot forthstart within
375: if \ addr1 is outside forthstart..addr, not a head
376: drop false unloop exit
377: then ( addr1 )
378: else \ 0 in the link field, no further checks
379: 2drop true unloop exit
380: then
381: loop
382: \ in dubio pro:
383: drop true ;
384:
1.48 anton 385: : >head-noprim ( cfa -- nt ) \ gforth to-head-noprim
1.67 anton 386: \ also heuristic; finds only names with up to 32 chars
1.45 pazsan 387: $25 cell do ( cfa )
1.70 pazsan 388: dup i - dup @ [ alias-mask lcount-mask or ] literal
389: [ 1 bits/char 3 - lshift 1 - 1 bits/char 1 - lshift or
1.71 pazsan 390: -1 cells allot bigendian [IF] c, -1 1 cells 1- times
391: [ELSE] -1 1 cells 1- times c, [THEN] ]
1.70 pazsan 392: and ( cfa len|alias )
1.67 anton 393: swap + cell + cfaligned over alias-mask + =
1.14 anton 394: if ( cfa )
395: dup i - cell - dup head?
396: if
397: nip unloop exit
398: then
399: drop
400: then
401: cell +loop
402: drop ??? ( wouldn't 0 be better? ) ;
1.1 pazsan 403:
1.30 jwilke 404: [ELSE]
405:
1.48 anton 406: : >head-noprim ( cfa -- nt ) \ gforth to-head-noprim
1.45 pazsan 407: $25 cell do ( cfa )
1.70 pazsan 408: dup i - dup @ [ alias-mask lcount-mask or ] literal
409: [ 1 bits/char 3 - lshift 1 - 1 bits/char 1 - lshift or
1.71 pazsan 410: -1 cells allot bigendian [IF] c, -1 1 cells 1- times
411: [ELSE] -1 1 cells 1- times c, [THEN] ]
1.70 pazsan 412: and ( cfa len|alias )
1.67 anton 413: swap + cell + cfaligned over alias-mask + =
1.30 jwilke 414: if ( cfa ) i - cell - unloop exit
415: then
416: cell +loop
417: drop ??? ( wouldn't 0 be better? ) ;
418:
419: [THEN]
1.1 pazsan 420:
421: : body> 0 >body - ;
422:
1.31 crook 423: : (search-wordlist) ( addr count wid -- nt | false )
1.1 pazsan 424: dup wordlist-map @ find-method perform ;
425:
1.31 crook 426: : search-wordlist ( c-addr count wid -- 0 | xt +-1 ) \ search
1.53 anton 427: \G Search the word list identified by @i{wid} for the definition
428: \G named by the string at @i{c-addr count}. If the definition is
429: \G not found, return 0. If the definition is found return 1 (if
430: \G the definition is immediate) or -1 (if the definition is not
431: \G immediate) together with the @i{xt}. In Gforth, the @i{xt}
432: \G returned represents the interpretation semantics. ANS Forth
433: \G does not specify clearly what @i{xt} represents.
1.1 pazsan 434: (search-wordlist) dup if
435: (name>intn)
436: then ;
437:
1.31 crook 438: : find-name ( c-addr u -- nt | 0 ) \ gforth
439: \g Find the name @i{c-addr u} in the current search
440: \g order. Return its @i{nt}, if found, otherwise 0.
1.1 pazsan 441: lookup @ (search-wordlist) ;
442:
443: : sfind ( c-addr u -- 0 / xt +-1 ) \ gforth-obsolete
444: find-name dup
445: if ( nt )
446: state @
447: if
448: (name>comp)
449: else
450: (name>intn)
451: then
452: then ;
453:
1.31 crook 454: : find ( c-addr -- xt +-1 | c-addr 0 ) \ core,search
1.53 anton 455: \G Search all word lists in the current search order for the
456: \G definition named by the counted string at @i{c-addr}. If the
457: \G definition is not found, return 0. If the definition is found
458: \G return 1 (if the definition has non-default compilation
459: \G semantics) or -1 (if the definition has default compilation
460: \G semantics). The @i{xt} returned in interpret state represents
461: \G the interpretation semantics. The @i{xt} returned in compile
462: \G state represented either the compilation semantics (for
463: \G non-default compilation semantics) or the run-time semantics
464: \G that the compilation semantics would @code{compile,} (for
465: \G default compilation semantics). The ANS Forth standard does
466: \G not specify clearly what the returned @i{xt} represents (and
467: \G also talks about immediacy instead of non-default compilation
468: \G semantics), so this word is questionable in portable programs.
469: \G If non-portability is ok, @code{find-name} and friends are
470: \G better (@pxref{Name token}).
1.1 pazsan 471: dup count sfind dup
472: if
473: rot drop
474: then ;
475:
1.34 jwilke 476: \ ticks in interpreter
1.1 pazsan 477:
478: : (') ( "name" -- nt ) \ gforth
1.32 anton 479: name name-too-short?
1.28 anton 480: find-name dup 0=
1.1 pazsan 481: IF
1.42 anton 482: drop -&13 throw
1.1 pazsan 483: THEN ;
484:
485: : ' ( "name" -- xt ) \ core tick
1.31 crook 486: \g @i{xt} represents @i{name}'s interpretation
487: \g semantics. Perform @code{-14 throw} if the word has no
1.1 pazsan 488: \g interpretation semantics.
489: (') name?int ;
1.34 jwilke 490:
491: has? compiler 0= [IF] \ interpreter only version of IS and TO
492:
493: : IS ' >body ! ;
494: ' IS Alias TO
495:
496: [THEN]
1.1 pazsan 497:
498: \ \ the interpreter loop mar92py
499:
500: \ interpret 10mar92py
501:
1.37 anton 502: Defer parser ( c-addr u -- )
1.1 pazsan 503: Defer name ( -- c-addr count ) \ gforth
1.55 anton 504: \G Get the next word from the input buffer
1.1 pazsan 505: ' (name) IS name
506: Defer compiler-notfound ( c-addr count -- )
507: Defer interpreter-notfound ( c-addr count -- )
508:
509: : no.extensions ( addr u -- )
1.42 anton 510: 2drop -&13 throw ;
1.1 pazsan 511: ' no.extensions IS compiler-notfound
512: ' no.extensions IS interpreter-notfound
513:
1.66 anton 514: : interpret1 ( ... -- ... )
1.33 jwilke 515: [ has? backtrace [IF] ]
1.24 anton 516: rp@ backtrace-rp0 !
1.33 jwilke 517: [ [THEN] ]
1.1 pazsan 518: BEGIN
519: ?stack name dup
520: WHILE
521: parser
522: REPEAT
1.66 anton 523: 2drop ;
524:
525: : interpret ( ?? -- ?? ) \ gforth
526: \ interpret/compile the (rest of the) input buffer
527: [ has? backtrace [IF] ]
528: backtrace-rp0 @ >r
529: [ [THEN] ]
530: ['] interpret1 catch
1.65 anton 531: [ has? backtrace [IF] ]
532: r> backtrace-rp0 !
1.66 anton 533: [ [THEN] ]
534: throw ;
1.1 pazsan 535:
536: \ interpreter 30apr92py
537:
538: \ not the most efficient implementations of interpreter and compiler
1.33 jwilke 539: : interpreter ( c-addr u -- )
1.1 pazsan 540: 2dup find-name dup
541: if
542: nip nip name>int execute
543: else
544: drop
545: 2dup 2>r snumber?
546: IF
547: 2rdrop
548: ELSE
549: 2r> interpreter-notfound
550: THEN
551: then ;
552:
553: ' interpreter IS parser
554:
555: \ \ Query Evaluate 07apr93py
556:
557: has? file 0= [IF]
1.12 pazsan 558: : sourceline# ( -- n ) 1 ;
1.61 pazsan 559: [ELSE]
1.64 pazsan 560: has? new-input 0= [IF]
1.58 pazsan 561: Variable #fill-bytes
562: \G number of bytes read via (read-line) by the last refill
1.61 pazsan 563: [THEN]
1.64 pazsan 564: [THEN]
1.58 pazsan 565:
1.64 pazsan 566: has? new-input 0= [IF]
1.1 pazsan 567: : refill ( -- flag ) \ core-ext,block-ext,file-ext
1.29 crook 568: \G Attempt to fill the input buffer from the input source. When
569: \G the input source is the user input device, attempt to receive
570: \G input into the terminal input device. If successful, make the
571: \G result the input buffer, set @code{>IN} to 0 and return true;
572: \G otherwise return false. When the input source is a block, add 1
573: \G to the value of @code{BLK} to make the next block the input
574: \G source and current input buffer, and set @code{>IN} to 0;
575: \G return true if the new value of @code{BLK} is a valid block
576: \G number, false otherwise. When the input source is a text file,
577: \G attempt to read the next line from the file. If successful,
578: \G make the result the current input buffer, set @code{>IN} to 0
579: \G and return true; otherwise, return false. A successful result
580: \G includes receipt of a line containing 0 characters.
1.12 pazsan 581: [ has? file [IF] ]
582: blk @ IF 1 blk +! true 0 >in ! EXIT THEN
583: [ [THEN] ]
584: tib /line
585: [ has? file [IF] ]
586: loadfile @ ?dup
1.59 pazsan 587: IF (read-line) throw #fill-bytes !
1.12 pazsan 588: ELSE
589: [ [THEN] ]
590: sourceline# 0< IF 2drop false EXIT THEN
591: accept true
592: [ has? file [IF] ]
593: THEN
594: 1 loadline +!
595: [ [THEN] ]
596: swap #tib ! 0 >in ! ;
1.1 pazsan 597:
598: : query ( -- ) \ core-ext
1.29 crook 599: \G Make the user input device the input source. Receive input into
600: \G the Terminal Input Buffer. Set @code{>IN} to zero. OBSOLESCENT:
601: \G superceeded by @code{accept}.
1.12 pazsan 602: [ has? file [IF] ]
603: blk off loadfile off
604: [ [THEN] ]
1.64 pazsan 605: refill drop ;
606: [THEN]
1.1 pazsan 607:
608: \ save-mem extend-mem
609:
610: has? os [IF]
611: : save-mem ( addr1 u -- addr2 u ) \ gforth
612: \g copy a memory block into a newly allocated region in the heap
613: swap >r
614: dup allocate throw
615: swap 2dup r> -rot move ;
616:
1.68 anton 617: : free-mem-var ( addr -- )
618: \ addr is the address of a 2variable containing address and size
619: \ of a memory range; frees memory and clears the 2variable.
620: dup 2@ drop dup
621: if ( addr mem-start )
622: free throw
623: 0 0 rot 2!
624: else
625: 2drop
626: then ;
627:
1.1 pazsan 628: : extend-mem ( addr1 u1 u -- addr addr2 u2 )
629: \ extend memory block allocated from the heap by u aus
630: \ the (possibly reallocated piece is addr2 u2, the extension is at addr
631: over >r + dup >r resize throw
632: r> over r> + -rot ;
633: [THEN]
634:
635: \ EVALUATE 17may93jaw
636:
1.64 pazsan 637: has? file 0= has? new-input 0= and [IF]
1.1 pazsan 638: : push-file ( -- ) r>
1.12 pazsan 639: tibstack @ >r >tib @ >r #tib @ >r
1.1 pazsan 640: >tib @ tibstack @ = IF r@ tibstack +! THEN
641: tibstack @ >tib ! >in @ >r >r ;
642:
643: : pop-file ( throw-code -- throw-code )
644: r>
1.12 pazsan 645: r> >in ! r> #tib ! r> >tib ! r> tibstack ! >r ;
1.1 pazsan 646: [THEN]
647:
1.64 pazsan 648: has? new-input 0= [IF]
1.29 crook 649: : evaluate ( c-addr u -- ) \ core,block
1.40 crook 650: \G Save the current input source specification. Store @code{-1} in
651: \G @code{source-id} and @code{0} in @code{blk}. Set @code{>IN} to
652: \G @code{0} and make the string @i{c-addr u} the input source
653: \G and input buffer. Interpret. When the parse area is empty,
654: \G restore the input source specification.
1.64 pazsan 655: [ has? file [IF] ]
1.56 anton 656: loadfilename# @ >r
1.60 anton 657: 1 loadfilename# ! \ "*evaluated string*"
1.64 pazsan 658: [ [THEN] ]
1.40 crook 659: push-file #tib ! >tib !
1.29 crook 660: >in off
661: [ has? file [IF] ]
662: blk off loadfile off -1 loadline !
663: [ [THEN] ]
664: ['] interpret catch
1.56 anton 665: pop-file
1.64 pazsan 666: [ has? file [IF] ]
1.56 anton 667: r> loadfilename# !
1.64 pazsan 668: [ [THEN] ]
1.56 anton 669: throw ;
1.64 pazsan 670: [THEN]
1.1 pazsan 671:
672: \ \ Quit 13feb93py
673:
674: Defer 'quit
675:
676: Defer .status
677:
678: : prompt state @ IF ." compiled" EXIT THEN ." ok" ;
679:
1.39 anton 680: : (quit) ( -- )
681: \ exits only through THROW etc.
1.42 anton 682: \ sp0 @ cell - handler @ &12 + ! \ !! kludge: fix the stack pointer
1.39 anton 683: \ stored in the system's CATCH frame, so the stack depth will be 0
684: \ after the next THROW it catches (it may be off due to BOUNCEs or
685: \ because process-args left something on the stack)
686: BEGIN
1.64 pazsan 687: .status cr query interpret prompt
1.39 anton 688: AGAIN ;
1.1 pazsan 689:
690: ' (quit) IS 'quit
691:
692: \ \ DOERROR (DOERROR) 13jun93jaw
693:
694: 8 Constant max-errors
695: Variable error-stack 0 error-stack !
1.64 pazsan 696: max-errors has? file [IF] 6 [ELSE] 4 [THEN] * cells allot
1.1 pazsan 697: \ format of one cell:
698: \ source ( addr u )
699: \ >in
700: \ line-number
701: \ Loadfilename ( addr u )
702:
1.64 pazsan 703: : error> ( -- addr u >in line# [addr u] )
704: -1 error-stack +!
705: error-stack dup @
706: [ has? file [IF] 6 [ELSE] 4 [THEN] ] Literal * cells + cell+
707: [ has? file [IF] 6 [ELSE] 4 [THEN] ] Literal cells bounds DO
708: I @
709: cell +LOOP ;
710: : >error ( addr u >in line# [addr u] -- )
711: error-stack dup @ dup 1+
712: max-errors 1- min error-stack !
713: [ has? file [IF] 6 [ELSE] 4 [THEN] ] Literal * cells + cell+
714: [ has? file [IF] 6 [ELSE] 4 [THEN] 1- ] Literal cells bounds swap DO
715: I !
716: -1 cells +LOOP ;
717:
1.1 pazsan 718: : dec. ( n -- ) \ gforth
1.40 crook 719: \G Display @i{n} as a signed decimal number, followed by a space.
720: \ !! not used...
1.1 pazsan 721: base @ decimal swap . base ! ;
722:
1.23 jwilke 723: : dec.r ( u -- ) \ gforth
1.40 crook 724: \G Display @i{u} as a unsigned decimal number
1.23 jwilke 725: base @ decimal swap 0 .r base ! ;
726:
1.1 pazsan 727: : hex. ( u -- ) \ gforth
1.40 crook 728: \G Display @i{u} as an unsigned hex number, prefixed with a "$" and
1.17 crook 729: \G followed by a space.
1.40 crook 730: \ !! not used...
1.33 jwilke 731: [char] $ emit base @ swap hex u. base ! ;
1.1 pazsan 732:
733: : typewhite ( addr u -- ) \ gforth
1.40 crook 734: \G Like type, but white space is printed instead of the characters.
1.1 pazsan 735: bounds ?do
736: i c@ #tab = if \ check for tab
737: #tab
738: else
739: bl
740: then
741: emit
742: loop ;
743:
744: DEFER DOERROR
1.33 jwilke 745:
746: has? backtrace [IF]
1.15 anton 747: Defer dobacktrace ( -- )
748: ' noop IS dobacktrace
1.33 jwilke 749: [THEN]
1.1 pazsan 750:
1.23 jwilke 751: : .error-string ( throw-code -- )
752: dup -2 =
753: IF "error @ ?dup IF count type THEN drop
754: ELSE .error
755: THEN ;
756:
1.64 pazsan 757: : .error-frame ( throwcode addr1 u1 n1 n2 [addr2 u2] -- throwcode )
758: \ addr2 u2: filename of included file - optional
1.23 jwilke 759: \ n2: line number
760: \ n1: error position in input line
761: \ addr1 u1: input line
1.1 pazsan 762: cr error-stack @
763: IF
1.64 pazsan 764: [ has? file [IF] ]
765: ." in file included from "
766: type ." :"
767: [ [THEN] ]
768: dec.r drop 2drop
1.1 pazsan 769: ELSE
1.64 pazsan 770: [ has? file [IF] ]
771: type ." :"
772: [ [THEN] ]
773: dup >r dec.r ." : " 3 pick .error-string
1.57 anton 774: r> IF \ if line# non-zero, there is a line
775: cr dup 2over type cr drop
776: nip -trailing 1- ( line-start index2 )
777: 0 >r BEGIN
778: 2dup + c@ bl > WHILE
779: r> 1+ >r 1- dup 0< UNTIL THEN 1+
780: ( line-start index1 )
781: typewhite
782: r> 1 max 0 ?do \ we want at least one "^", even if the length is 0
783: [char] ^ emit
784: loop
785: ELSE
786: 2drop drop
787: THEN
1.23 jwilke 788: THEN ;
1.1 pazsan 789:
790: : (DoError) ( throw-code -- )
791: [ has? os [IF] ]
1.8 pazsan 792: >stderr
1.1 pazsan 793: [ [THEN] ]
1.64 pazsan 794: source >in @ sourceline# [ has? file [IF] ]
795: sourcefilename
796: [ [THEN] ] .error-frame
1.1 pazsan 797: error-stack @ 0 ?DO
1.64 pazsan 798: error>
1.1 pazsan 799: .error-frame
800: LOOP
1.33 jwilke 801: drop
802: [ has? backtrace [IF] ]
803: dobacktrace
804: [ [THEN] ]
1.8 pazsan 805: normal-dp dpp ! ;
1.1 pazsan 806:
807: ' (DoError) IS DoError
808:
809: : quit ( ?? -- ?? ) \ core
1.27 crook 810: \G Empty the return stack, make the user input device
811: \G the input source, enter interpret state and start
812: \G the text interpreter.
1.64 pazsan 813: rp0 @ rp! handler off clear-tibstack
814: [ has? new-input 0= [IF] ] >tib @ >r [ [THEN] ]
1.1 pazsan 815: BEGIN
816: [ has? compiler [IF] ]
817: postpone [
818: [ [THEN] ]
819: ['] 'quit CATCH dup
820: WHILE
1.22 anton 821: <# \ reset hold area, or we may get another error
1.64 pazsan 822: DoError
823: [ has? new-input [IF] ] clear-tibstack
824: [ [ELSE] ] r@ >tib ! r@ tibstack !
825: [ [THEN] ]
1.1 pazsan 826: REPEAT
1.64 pazsan 827: drop [ has? new-input [IF] ] clear-tibstack
828: [ [ELSE] ] r> >tib !
829: [ [THEN] ] ;
1.1 pazsan 830:
831: \ \ Cold Boot 13feb93py
832:
833: : (bootmessage)
834: ." GForth " version-string type
1.52 pazsan 835: ." , Copyright (C) 1995-2000 Free Software Foundation, Inc." cr
1.1 pazsan 836: ." GForth comes with ABSOLUTELY NO WARRANTY; for details type `license'"
837: [ has? os [IF] ]
838: cr ." Type `bye' to exit"
839: [ [THEN] ] ;
840:
841: defer bootmessage
842: defer process-args
843:
844: ' (bootmessage) IS bootmessage
845:
1.10 anton 846: Defer 'cold ( -- ) \ gforth tick-cold
1.1 pazsan 847: \ hook (deferred word) for things to do right before interpreting the
848: \ command-line arguments
849: ' noop IS 'cold
850:
851:
852: Variable init8
853:
854: : cold ( -- ) \ gforth
1.44 anton 855: [ has? backtrace [IF] ]
856: rp@ backtrace-rp0 !
857: [ [THEN] ]
1.1 pazsan 858: [ has? file [IF] ]
859: pathstring 2@ fpath only-path
860: init-included-files
861: [ [THEN] ]
862: 'cold
863: init8 chainperform
864: [ has? file [IF] ]
1.62 anton 865: loadfilename# off
1.8 pazsan 866: process-args
1.12 pazsan 867: loadline off
1.1 pazsan 868: [ [THEN] ]
869: bootmessage
1.12 pazsan 870: quit ;
1.1 pazsan 871:
1.64 pazsan 872: has? new-input 0= [IF]
1.5 anton 873: : clear-tibstack ( -- )
874: [ has? glocals [IF] ]
875: lp@ forthstart 7 cells + @ -
876: [ [ELSE] ]
877: [ has? os [IF] ]
1.8 pazsan 878: r0 @ forthstart 6 cells + @ -
1.5 anton 879: [ [ELSE] ]
1.16 pazsan 880: sp@ $10 cells +
1.5 anton 881: [ [THEN] ]
882: [ [THEN] ]
883: dup >tib ! tibstack ! #tib off >in off ;
1.64 pazsan 884: [THEN]
1.5 anton 885:
1.64 pazsan 886: : boot ( path n **argv argc -- )
1.1 pazsan 887: main-task up!
888: [ has? os [IF] ]
889: stdout TO outfile-id
1.7 pazsan 890: stdin TO infile-id
1.1 pazsan 891: \ !! [ [THEN] ]
892: \ !! [ has? file [IF] ]
893: argc ! argv ! pathstring 2!
894: [ [THEN] ]
895: sp@ sp0 !
1.74 pazsan 896: [ has? peephole [IF] ]
1.73 anton 897: primtable prepare-peephole-table TO peeptable
1.74 pazsan 898: [ [THEN] ]
1.64 pazsan 899: [ has? new-input [IF] ]
900: current-input off
901: [ [THEN] ]
1.5 anton 902: clear-tibstack
1.1 pazsan 903: rp@ rp0 !
904: [ has? floating [IF] ]
905: fp@ fp0 !
906: [ [THEN] ]
1.46 anton 907: handler off
1.8 pazsan 908: ['] cold catch DoError cr
1.1 pazsan 909: [ has? os [IF] ]
1.35 anton 910: 1 (bye) \ !! determin exit code from throw code?
1.1 pazsan 911: [ [THEN] ]
912: ;
913:
914: has? os [IF]
915: : bye ( -- ) \ tools-ext
916: [ has? file [IF] ]
917: script? 0= IF cr THEN
918: [ [ELSE] ]
919: cr
920: [ [THEN] ]
921: 0 (bye) ;
922: [THEN]
923:
924: \ **argv may be scanned by the C starter to get some important
925: \ information, as -display and -geometry for an X client FORTH
926: \ or space and stackspace overrides
927:
928: \ 0 arg contains, however, the name of the program.
929:
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