Annotation of gforth/kernel/basics.fs, revision 1.43
1.1 anton 1: \ kernel.fs GForth kernel 17dec92py
2:
1.38 anton 3: \ Copyright (C) 1995,1998,2000,2003 Free Software Foundation, Inc.
1.1 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.29 anton 19: \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
1.1 anton 20:
21: \ Idea and implementation: Bernd Paysan (py)
22:
1.16 jwilke 23: \ Needs:
24:
25: require ./vars.fs
1.32 anton 26: require ../compat/strcomp.fs
1.16 jwilke 27:
28: hex
1.1 anton 29:
30: \ labels for some code addresses
31:
32: \- NIL NIL AConstant NIL \ gforth
33:
34: \ Aliases
35:
1.4 jwilke 36: [IFUNDEF] r@
1.1 anton 37: ' i Alias r@ ( -- w ; R: w -- w ) \ core r-fetch
1.4 jwilke 38: [THEN]
1.1 anton 39:
40: \ !! this is machine-dependent, but works on all but the strangest machines
41:
1.23 anton 42: : maxaligned ( addr1 -- addr2 ) \ gforth
43: \G @i{addr2} is the first address after @i{addr1} that satisfies
44: \G all alignment restrictions.
1.1 anton 45: [ /maxalign 1 - ] Literal + [ 0 /maxalign - ] Literal and ;
1.23 anton 46: \ !! machine-dependent and won't work if "0 >body" <> "0 >body
47: \G maxaligned"
1.1 anton 48: ' maxaligned Alias cfaligned ( addr1 -- addr2 ) \ gforth
1.23 anton 49: \G @i{addr2} is the first address after @i{addr1} that is aligned for
50: \G a code field (i.e., such that the corresponding body is maxaligned).
1.1 anton 51:
52: : chars ( n1 -- n2 ) \ core
1.23 anton 53: \G @i{n2} is the number of address units of @i{n1} chars.""
1.1 anton 54: ; immediate
55:
56:
57: \ : A! ( addr1 addr2 -- ) \ gforth
58: \ dup relon ! ;
59: \ : A, ( addr -- ) \ gforth
60: \ here cell allot A! ;
61: ' ! alias A! ( addr1 addr2 -- ) \ gforth
62:
1.2 anton 63: \ UNUSED 17may93jaw
64:
1.41 pazsan 65: has? ec [IF]
1.30 jwilke 66: unlock ram-dictionary borders nip lock
67: AConstant dictionary-end
1.4 jwilke 68: [ELSE]
1.35 pazsan 69: has? header [IF]
70: : dictionary-end ( -- addr )
71: forthstart [ 3 cells image-header + ] Aliteral @ + ;
72: [ELSE]
73: : forthstart 0 ;
74: : dictionary-end ( -- addr )
75: forthstart [ has? kernel-size ] Literal + ;
76: [THEN]
1.4 jwilke 77: [THEN]
1.2 anton 78:
1.14 anton 79: : usable-dictionary-end ( -- addr )
80: dictionary-end [ word-pno-size pad-minsize + ] Literal - ;
81:
1.2 anton 82: : unused ( -- u ) \ core-ext
1.13 crook 83: \G Return the amount of free space remaining (in address units) in
84: \G the region addressed by @code{here}.
1.14 anton 85: usable-dictionary-end here - ;
1.2 anton 86:
1.40 pazsan 87: has? ec [IF]
88: : in-dictionary? ( x -- f )
1.41 pazsan 89: dictionary-end u< ;
1.40 pazsan 90: [ELSE]
1.34 anton 91: : in-dictionary? ( x -- f )
92: forthstart dictionary-end within ;
1.40 pazsan 93: [THEN]
1.34 anton 94:
1.1 anton 95: \ here is used for pad calculation!
96:
97: : dp ( -- addr ) \ gforth
98: dpp @ ;
1.13 crook 99: : here ( -- addr ) \ core
100: \G Return the address of the next free location in data space.
1.1 anton 101: dp @ ;
102:
103: \ on off 23feb93py
104:
1.4 jwilke 105: \ on is used by docol:
1.15 crook 106: : on ( a-addr -- ) \ gforth
107: \G Set the (value of the) variable at @i{a-addr} to @code{true}.
1.1 anton 108: true swap ! ;
1.15 crook 109: : off ( a-addr -- ) \ gforth
110: \G Set the (value of the) variable at @i{a-addr} to @code{false}.
1.1 anton 111: false swap ! ;
112:
113: \ dabs roll 17may93jaw
114:
1.24 anton 115: : dabs ( d -- ud ) \ double d-abs
1.1 anton 116: dup 0< IF dnegate THEN ;
117:
118: : roll ( x0 x1 .. xn n -- x1 .. xn x0 ) \ core-ext
119: dup 1+ pick >r
120: cells sp@ cell+ dup cell+ rot move drop r> ;
121:
122: \ place bounds 13feb93py
123:
124: : place ( addr len to -- ) \ gforth
125: over >r rot over 1+ r> move c! ;
1.27 anton 126: : bounds ( addr u -- addr+u addr ) \ gforth
127: \G Given a memory block represented by starting address @i{addr}
128: \G and length @i{u} in aus, produce the end address @i{addr+u} and
129: \G the start address in the right order for @code{u+do} or
130: \G @code{?do}.
1.1 anton 131: over + swap ;
132:
133: \ (word) 22feb93py
134:
135: : scan ( addr1 n1 char -- addr2 n2 ) \ gforth
1.43 ! anton 136: \G skip all characters not equal to char
1.1 anton 137: >r
138: BEGIN
139: dup
140: WHILE
141: over c@ r@ <>
142: WHILE
143: 1 /string
144: REPEAT THEN
145: rdrop ;
146: : skip ( addr1 n1 char -- addr2 n2 ) \ gforth
1.43 ! anton 147: \G skip all characters equal to char
1.1 anton 148: >r
149: BEGIN
150: dup
151: WHILE
152: over c@ r@ =
153: WHILE
154: 1 /string
155: REPEAT THEN
156: rdrop ;
157:
158: \ digit? 17dec92py
159:
160: : digit? ( char -- digit true/ false ) \ gforth
161: base @ $100 =
162: IF
163: true EXIT
164: THEN
165: toupper [char] 0 - dup 9 u> IF
1.16 jwilke 166: [ char A char 9 1 + - ] literal -
1.1 anton 167: dup 9 u<= IF
168: drop false EXIT
169: THEN
170: THEN
171: dup base @ u>= IF
172: drop false EXIT
173: THEN
174: true ;
175:
176: : accumulate ( +d0 addr digit - +d1 addr )
1.40 pazsan 177: swap >r swap base @ um* drop rot base @ um* d+ r> ;
1.1 anton 178:
1.18 crook 179: : >number ( ud1 c-addr1 u1 -- ud2 c-addr2 u2 ) \ core to-number
1.22 anton 180: \G Attempt to convert the character string @var{c-addr1 u1} to an
1.13 crook 181: \G unsigned number in the current number base. The double
182: \G @var{ud1} accumulates the result of the conversion to form
183: \G @var{ud2}. Conversion continues, left-to-right, until the whole
184: \G string is converted or a character that is not convertable in
185: \G the current number base is encountered (including + or -). For
186: \G each convertable character, @var{ud1} is first multiplied by
187: \G the value in @code{BASE} and then incremented by the value
188: \G represented by the character. @var{c-addr2} is the location of
189: \G the first unconverted character (past the end of the string if
190: \G the whole string was converted). @var{u2} is the number of
191: \G unconverted characters in the string. Overflow is not detected.
1.1 anton 192: 0
193: ?DO
194: count digit?
195: WHILE
196: accumulate
197: LOOP
198: 0
199: ELSE
200: 1- I' I -
201: UNLOOP
202: THEN ;
203:
204: \ s>d um/mod 21mar93py
205:
206: : s>d ( n -- d ) \ core s-to-d
207: dup 0< ;
208:
209: : ud/mod ( ud1 u2 -- urem udquot ) \ gforth
210: >r 0 r@ um/mod r> swap >r
211: um/mod r> ;
212:
213: \ catch throw 23feb93py
214:
1.5 jwilke 215: has? glocals [IF]
1.12 crook 216: : lp@ ( -- addr ) \ gforth lp-fetch
1.1 anton 217: laddr# [ 0 , ] ;
218: [THEN]
219:
1.17 anton 220: defer catch ( x1 .. xn xt -- y1 .. ym 0 / z1 .. zn error ) \ exception
1.24 anton 221: \G @code{Executes} @i{xt}. If execution returns normally,
222: \G @code{catch} pushes 0 on the stack. If execution returns through
223: \G @code{throw}, all the stacks are reset to the depth on entry to
224: \G @code{catch}, and the TOS (the @i{xt} position) is replaced with
225: \G the throw code.
226:
1.17 anton 227: :noname ( ... xt -- ... 0 )
228: execute 0 ;
229: is catch
1.1 anton 230:
1.24 anton 231: defer throw ( y1 .. ym nerror -- y1 .. ym / z1 .. zn error ) \ exception
232: \G If @i{nerror} is 0, drop it and continue. Otherwise, transfer
233: \G control to the next dynamically enclosing exception handler, reset
234: \G the stacks accordingly, and push @i{nerror}.
235:
236: :noname ( y1 .. ym error -- y1 .. ym / z1 .. zn error )
1.19 anton 237: ?dup if
1.35 pazsan 238: [ has? header [IF] here image-header 9 cells + ! [THEN] ]
1.21 pazsan 239: cr .error cr
240: [ has? file [IF] ] script? IF 1 (bye) ELSE quit THEN
241: [ [ELSE] ] quit [ [THEN] ]
1.19 anton 242: then ;
243: is throw
244:
1.1 anton 245: \ (abort")
246:
1.33 anton 247: : c(abort") ( c-addr -- )
248: "error ! -2 throw ;
249:
1.1 anton 250: : (abort")
251: "lit >r
252: IF
253: r> "error ! -2 throw
254: THEN
255: rdrop ;
1.6 pazsan 256:
257: : abort ( ?? -- ?? ) \ core,exception-ext
1.12 crook 258: \G @code{-1 throw}.
1.6 pazsan 259: -1 throw ;
1.1 anton 260:
261: \ ?stack 23feb93py
262:
263: : ?stack ( ?? -- ?? ) \ gforth
1.3 jwilke 264: sp@ sp0 @ u> IF -4 throw THEN
1.5 jwilke 265: [ has? floating [IF] ]
1.3 jwilke 266: fp@ fp0 @ u> IF -&45 throw THEN
1.1 anton 267: [ [THEN] ]
268: ;
269: \ ?stack should be code -- it touches an empty stack!
270:
271: \ DEPTH 9may93jaw
272:
1.9 crook 273: : depth ( -- +n ) \ core depth
1.12 crook 274: \G @var{+n} is the number of values that were on the data stack before
275: \G @var{+n} itself was placed on the stack.
1.3 jwilke 276: sp@ sp0 @ swap - cell / ;
1.9 crook 277:
278: : clearstack ( ... -- ) \ gforth clear-stack
1.42 anton 279: \G remove and discard all/any items from the data stack.
1.3 jwilke 280: sp0 @ sp! ;
1.42 anton 281:
282: : clearstacks ( ... -- ) \ gforth clear-stacks
283: \G empty data and FP stack
284: clearstack fp0 @ fp! ;
1.1 anton 285:
286: \ Strings 22feb93py
287:
288: : "lit ( -- addr )
289: r> r> dup count + aligned >r swap >r ;
290:
291: \ */MOD */ 17may93jaw
292:
293: \ !! I think */mod should have the same rounding behaviour as / - anton
294: : */mod ( n1 n2 n3 -- n4 n5 ) \ core star-slash-mod
1.24 anton 295: \G n1*n2=n3*n5+n4, with the intermediate result (n1*n2) being double.
1.1 anton 296: >r m* r> sm/rem ;
297:
298: : */ ( n1 n2 n3 -- n4 ) \ core star-slash
1.23 anton 299: \G n4=(n1*n2)/n3, with the intermediate result being double.
1.1 anton 300: */mod nip ;
301:
302: \ HEX DECIMAL 2may93jaw
303:
304: : decimal ( -- ) \ core
1.26 anton 305: \G Set @code{base} to &10 (decimal).
1.1 anton 306: a base ! ;
307: : hex ( -- ) \ core-ext
1.26 anton 308: \G Set @code{base} to &16 (hexadecimal).
1.1 anton 309: 10 base ! ;
310:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>