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