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