version 1.22, 1999/02/03 00:10:21
|
version 1.34, 1999/05/17 13:12:05
|
Line 115 INC_IP(1);
|
Line 115 INC_IP(1);
|
r> dup @ swap cell+ >r ; |
r> dup @ swap cell+ >r ; |
|
|
execute xt -- core |
execute xt -- core |
""Perform the semantics represented by the execution token, xt."" |
""Perform the semantics represented by the execution token, @i{xt}."" |
ip=IP; |
ip=IP; |
IF_TOS(TOS = sp[0]); |
IF_TOS(TOS = sp[0]); |
EXEC(xt); |
EXEC(xt); |
Line 129 EXEC(*(Xt *)a_addr);
|
Line 129 EXEC(*(Xt *)a_addr);
|
: |
: |
@ execute ; |
@ execute ; |
|
|
|
\fhas? skipbranchprims 0= [IF] |
\+glocals |
\+glocals |
|
|
branch-lp+!# -- gforth branch_lp_plus_store_number |
branch-lp+!# -- gforth branch_lp_plus_store_number |
Line 141 goto branch;
|
Line 142 goto branch;
|
|
|
branch -- gforth |
branch -- gforth |
branch: |
branch: |
ip = (Xt *)(((Cell)IP)+(Cell)NEXT_INST); |
SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
NEXT_P0; |
|
: |
: |
r> dup @ + >r ; |
r> dup @ + >r ; |
|
|
Line 150 NEXT_P0;
|
Line 150 NEXT_P0;
|
\ this is non-syntactical: code must open a brace that is closed by the macro |
\ this is non-syntactical: code must open a brace that is closed by the macro |
define(condbranch, |
define(condbranch, |
$1 $2 |
$1 $2 |
$3 ip = (Xt *)(((Cell)IP)+(Cell)NEXT_INST); |
$3 SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
NEXT_P0; |
|
NEXT; |
NEXT; |
} |
} |
else |
else |
Line 189 if (f==0) {
|
Line 188 if (f==0) {
|
if (f==0) { |
if (f==0) { |
sp++; |
sp++; |
IF_TOS(TOS = sp[0]); |
IF_TOS(TOS = sp[0]); |
ip = (Xt *)(((Cell)IP)+(Cell)NEXT_INST); |
SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
NEXT_P0; |
|
NEXT; |
NEXT; |
} |
} |
else |
else |
Line 204 few cycles in that case, but is easy to
|
Line 202 few cycles in that case, but is easy to
|
invocation */ |
invocation */ |
if (f!=0) { |
if (f!=0) { |
sp--; |
sp--; |
ip = (Xt *)(((Cell)IP)+(Cell)NEXT_INST); |
SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
NEXT_P0; |
|
NEXT; |
NEXT; |
} |
} |
else |
else |
INC_IP(1); |
INC_IP(1); |
|
|
\+ |
\+ |
|
\f[THEN] |
|
\fhas? skiploopprims 0= [IF] |
|
|
condbranch((next),-- cmFORTH paren_next, |
condbranch((next),-- cmFORTH paren_next, |
if ((*rp)--) { |
if ((*rp)--) { |
Line 441 n = rp[4];
|
Line 440 n = rp[4];
|
r> r> r> r> r> r> dup itmp ! >r >r >r >r >r >r itmp @ ; |
r> r> r> r> r> r> dup itmp ! >r >r >r >r >r >r itmp @ ; |
[IFUNDEF] itmp variable itmp [THEN] |
[IFUNDEF] itmp variable itmp [THEN] |
|
|
|
\f[THEN] |
|
|
\ digit is high-level: 0/0% |
\ digit is high-level: 0/0% |
|
|
move c_from c_to ucount -- core |
move c_from c_to ucount -- core |
"" If ucount>0, copy the contents of ucount address units |
""Copy the contents of @i{ucount} address units at @i{c-from} to |
at c-from to c-to. @code{move} chooses its copy direction |
@i{c-to}. @code{move} works correctly even if the two areas overlap."" |
to avoid problems when c-from, c-to overlap."" |
|
memmove(c_to,c_from,ucount); |
memmove(c_to,c_from,ucount); |
/* make an Ifdef for bsd and others? */ |
/* make an Ifdef for bsd and others? */ |
: |
: |
>r 2dup u< IF r> cmove> ELSE r> cmove THEN ; |
>r 2dup u< IF r> cmove> ELSE r> cmove THEN ; |
|
|
cmove c_from c_to u -- string |
cmove c_from c_to u -- string |
"" If u>0, copy the contents of ucount characters from |
""Copy the contents of @i{ucount} characters from data space at |
data space at c-from to c-to. The copy proceeds @code{char}-by-@code{char} |
@i{c-from} to @i{c-to}. The copy proceeds @code{char}-by-@code{char} |
from low address to high address."" |
from low address to high address; i.e., for overlapping areas it is |
|
safe if @i{c-to}=<@i{c-from}."" |
while (u-- > 0) |
while (u-- > 0) |
*c_to++ = *c_from++; |
*c_to++ = *c_from++; |
: |
: |
bounds ?DO dup c@ I c! 1+ LOOP drop ; |
bounds ?DO dup c@ I c! 1+ LOOP drop ; |
|
|
cmove> c_from c_to u -- string c_move_up |
cmove> c_from c_to u -- string c_move_up |
"" If u>0, copy the contents of ucount characters from |
""Copy the contents of @i{ucount} characters from data space at |
data space at c-from to c-to. The copy proceeds @code{char}-by-@code{char} |
@i{c-from} to @i{c-to}. The copy proceeds @code{char}-by-@code{char} |
from high address to low address."" |
from high address to low address; i.e., for overlapping areas it is |
|
safe if @i{c-to}>=@i{c-from}."" |
while (u-- > 0) |
while (u-- > 0) |
c_to[u] = c_from[u]; |
c_to[u] = c_from[u]; |
: |
: |
Line 473 while (u-- > 0)
|
Line 475 while (u-- > 0)
|
DO 1- dup c@ I c! -1 +LOOP drop ; |
DO 1- dup c@ I c! -1 +LOOP drop ; |
|
|
fill c_addr u c -- core |
fill c_addr u c -- core |
"" If u>0, store character c in each of u consecutive |
"" If @i{u}>0, store character @i{c} in each of @i{u} consecutive |
@code{char} addresses in memory, starting at address c-addr."" |
@code{char} addresses in memory, starting at address @i{c-addr}."" |
memset(c_addr,c,u); |
memset(c_addr,c,u); |
: |
: |
-rot bounds |
-rot bounds |
?DO dup I c! LOOP drop ; |
?DO dup I c! LOOP drop ; |
|
|
compare c_addr1 u1 c_addr2 u2 -- n string |
compare c_addr1 u1 c_addr2 u2 -- n string |
""Compare two strings lexicographically. If they are equal, n is 0; if |
""Compare two strings lexicographically. If they are equal, @i{n} is 0; if |
the first string is smaller, n is -1; if the first string is larger, n |
the first string is smaller, @i{n} is -1; if the first string is larger, @i{n} |
is 1. Currently this is based on the machine's character |
is 1. Currently this is based on the machine's character |
comparison. In the future, this may change to considering the current |
comparison. In the future, this may change to consider the current |
locale and its collation order."" |
locale and its collation order."" |
n = memcmp(c_addr1, c_addr2, u1<u2 ? u1 : u2); |
n = memcmp(c_addr1, c_addr2, u1<u2 ? u1 : u2); |
if (n==0) |
if (n==0) |
Line 516 else if (n>0)
|
Line 518 else if (n>0)
|
dup 0< IF drop -1 ELSE 0> 1 and THEN ; |
dup 0< IF drop -1 ELSE 0> 1 and THEN ; |
|
|
toupper c1 -- c2 gforth |
toupper c1 -- c2 gforth |
|
""If @i{c1} is a lower-case character (in the current locale), @i{c2} |
|
is the equivalent upper-case character. All other characters are unchanged."" |
c2 = toupper(c1); |
c2 = toupper(c1); |
: |
: |
dup [char] a - [ char z char a - 1 + ] Literal u< bl and - ; |
dup [char] a - [ char z char a - 1 + ] Literal u< bl and - ; |
Line 534 else if (n>0)
|
Line 538 else if (n>0)
|
ELSE c@ toupper I c@ toupper - unloop THEN -text-flag ; |
ELSE c@ toupper I c@ toupper - unloop THEN -text-flag ; |
|
|
-trailing c_addr u1 -- c_addr u2 string dash_trailing |
-trailing c_addr u1 -- c_addr u2 string dash_trailing |
|
""Adjust the string specified by @i{c-addr, u1} to remove all trailing |
|
spaces. @i{u2} is the length of the modified string."" |
u2 = u1; |
u2 = u1; |
while (u2>0 && c_addr[u2-1] == ' ') |
while (u2>0 && c_addr[u2-1] == ' ') |
u2--; |
u2--; |
Line 542 while (u2>0 && c_addr[u2-1] == ' ')
|
Line 548 while (u2>0 && c_addr[u2-1] == ' ')
|
dup 0= UNTIL ELSE 1+ THEN ; |
dup 0= UNTIL ELSE 1+ THEN ; |
|
|
/string c_addr1 u1 n -- c_addr2 u2 string slash_string |
/string c_addr1 u1 n -- c_addr2 u2 string slash_string |
|
""Adjust the string specified by @i{c-addr1, u1} to remove @i{n} |
|
characters from the start of the string."" |
c_addr2 = c_addr1+n; |
c_addr2 = c_addr1+n; |
u2 = u1-n; |
u2 = u1-n; |
: |
: |
Line 552 n = n1+n2;
|
Line 560 n = n1+n2;
|
|
|
\ PFE-0.9.14 has it differently, but the next release will have it as follows |
\ PFE-0.9.14 has it differently, but the next release will have it as follows |
under+ n1 n2 n3 -- n n2 gforth under_plus |
under+ n1 n2 n3 -- n n2 gforth under_plus |
""add @var{n3} to @var{n1} (giving @var{n})"" |
""add @i{n3} to @i{n1} (giving @i{n})"" |
n = n1+n3; |
n = n1+n3; |
: |
: |
rot + swap ; |
rot + swap ; |
Line 639 n2 = n1>>1;
|
Line 647 n2 = n1>>1;
|
LOOP nip ; |
LOOP nip ; |
|
|
fm/mod d1 n1 -- n2 n3 core f_m_slash_mod |
fm/mod d1 n1 -- n2 n3 core f_m_slash_mod |
""floored division: d1 = n3*n1+n2, n1>n2>=0 or 0>=n2>n1"" |
""Floored division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, @i{n1}>@i{n2}>=0 or 0>=@i{n2}>@i{n1}."" |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LONG_LONG |
DCell r = fmdiv(d1,n1); |
DCell r = fmdiv(d1,n1); |
n2=r.hi; |
n2=r.hi; |
Line 661 if (1%-3>0 && (d1<0) != (n1<0) && n2!=0)
|
Line 669 if (1%-3>0 && (d1<0) != (n1<0) && n2!=0)
|
r> 0< IF swap negate swap THEN ; |
r> 0< IF swap negate swap THEN ; |
|
|
sm/rem d1 n1 -- n2 n3 core s_m_slash_rem |
sm/rem d1 n1 -- n2 n3 core s_m_slash_rem |
""symmetric division: d1 = n3*n1+n2, sign(n2)=sign(d1) or 0"" |
""Symmetric division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, sign(@i{n2})=sign(@i{d1}) or 0."" |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LONG_LONG |
DCell r = smdiv(d1,n1); |
DCell r = smdiv(d1,n1); |
n2=r.hi; |
n2=r.hi; |
Line 711 ud = (UDCell)u1 * (UDCell)u2;
|
Line 719 ud = (UDCell)u1 * (UDCell)u2;
|
and >r >r 2dup d+ swap r> + swap r> ; |
and >r >r 2dup d+ swap r> + swap r> ; |
|
|
um/mod ud u1 -- u2 u3 core u_m_slash_mod |
um/mod ud u1 -- u2 u3 core u_m_slash_mod |
|
""ud=u3*u1+u2, u1>u2>=0"" |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LONG_LONG |
UDCell r = umdiv(ud,u1); |
UDCell r = umdiv(ud,u1); |
u2=r.hi; |
u2=r.hi; |
Line 926 dcomparisons(du, ud1 ud2, d_u_, ud1, ud2
|
Line 935 dcomparisons(du, ud1 ud2, d_u_, ud1, ud2
|
\+ |
\+ |
|
|
within u1 u2 u3 -- f core-ext |
within u1 u2 u3 -- f core-ext |
|
""u2=<u1<u3 or: u3=<u2 and u1 is not in [u3,u2). This works for |
|
unsigned and signed numbers (but not a mixture). Another way to think |
|
about this word is to consider the numbers as a circle (wrapping |
|
around from @code{max-u} to 0 for unsigned, and from @code{max-n} to |
|
min-n for signed numbers); now consider the range from u2 towards |
|
increasing numbers up to and excluding u3 (giving an empty range if |
|
u2=u3; if u1 is in this range, @code{within} returns true."" |
f = FLAG(u1-u2 < u3-u2); |
f = FLAG(u1-u2 < u3-u2); |
: |
: |
over - >r - r> u< ; |
over - >r - r> u< ; |
|
|
sp@ -- a_addr gforth spat |
sp@ -- a_addr gforth sp_fetch |
a_addr = sp+1; |
a_addr = sp+1; |
|
|
sp! a_addr -- gforth spstore |
sp! a_addr -- gforth sp_store |
sp = a_addr; |
sp = a_addr; |
/* works with and without TOS caching */ |
/* works with and without TOS caching */ |
|
|
rp@ -- a_addr gforth rpat |
rp@ -- a_addr gforth rp_fetch |
a_addr = rp; |
a_addr = rp; |
|
|
rp! a_addr -- gforth rpstore |
rp! a_addr -- gforth rp_store |
rp = a_addr; |
rp = a_addr; |
|
|
\+floating |
\+floating |
Line 955 fp = f_addr;
|
Line 971 fp = f_addr;
|
|
|
;s -- gforth semis |
;s -- gforth semis |
""The primitive compiled by @code{EXIT}."" |
""The primitive compiled by @code{EXIT}."" |
ip = (Xt *)(*rp++); |
SET_IP((Xt *)(*rp++)); |
NEXT_P0; |
|
|
|
>r w -- core to_r |
>r w -- core to_r |
*--rp = w; |
*--rp = w; |
Line 1082 w = sp[u+1];
|
Line 1097 w = sp[u+1];
|
\ toggle is high-level: 0.11/0.42% |
\ toggle is high-level: 0.11/0.42% |
|
|
@ a_addr -- w core fetch |
@ a_addr -- w core fetch |
|
"" Read from the cell at address @i{a-addr}, and return its contents, @i{w}."" |
w = *a_addr; |
w = *a_addr; |
|
|
! w a_addr -- core store |
! w a_addr -- core store |
|
"" Write the value @i{w} to the cell at address @i{a-addr}."" |
*a_addr = w; |
*a_addr = w; |
|
|
+! n a_addr -- core plus_store |
+! n a_addr -- core plus_store |
|
"" Add @i{n} to the value stored in the cell at address @i{a-addr}."" |
*a_addr += n; |
*a_addr += n; |
: |
: |
tuck @ + swap ! ; |
tuck @ + swap ! ; |
|
|
c@ c_addr -- c core cfetch |
c@ c_addr -- c core c_fetch |
|
"" Read from the char at address @i{c-addr}, and return its contents, @i{c}."" |
c = *c_addr; |
c = *c_addr; |
: |
: |
[ bigendian [IF] ] |
[ bigendian [IF] ] |
Line 1117 c = *c_addr;
|
Line 1136 c = *c_addr;
|
; |
; |
: 8>> 2/ 2/ 2/ 2/ 2/ 2/ 2/ 2/ ; |
: 8>> 2/ 2/ 2/ 2/ 2/ 2/ 2/ 2/ ; |
|
|
c! c c_addr -- core cstore |
c! c c_addr -- core c_store |
|
"" Write the value @i{c} to the char at address @i{c-addr}."" |
*c_addr = c; |
*c_addr = c; |
: |
: |
[ bigendian [IF] ] |
[ bigendian [IF] ] |
Line 1147 c! c c_addr -- core cstore
|
Line 1167 c! c c_addr -- core cstore
|
: 8<< 2* 2* 2* 2* 2* 2* 2* 2* ; |
: 8<< 2* 2* 2* 2* 2* 2* 2* 2* ; |
|
|
2! w1 w2 a_addr -- core two_store |
2! w1 w2 a_addr -- core two_store |
|
"" Write the value @i{w1, w2} to the double at address @i{a-addr}."" |
a_addr[0] = w2; |
a_addr[0] = w2; |
a_addr[1] = w1; |
a_addr[1] = w1; |
: |
: |
tuck ! cell+ ! ; |
tuck ! cell+ ! ; |
|
|
2@ a_addr -- w1 w2 core two_fetch |
2@ a_addr -- w1 w2 core two_fetch |
|
"" Read from the double at address @i{a-addr}, and return its contents, @i{w1, w2}."" |
w2 = a_addr[0]; |
w2 = a_addr[0]; |
w1 = a_addr[1]; |
w1 = a_addr[1]; |
: |
: |
dup cell+ @ swap @ ; |
dup cell+ @ swap @ ; |
|
|
cell+ a_addr1 -- a_addr2 core cell_plus |
cell+ a_addr1 -- a_addr2 core cell_plus |
|
"" Increment @i{a-addr1} by the number of address units corresponding to the size of |
|
one cell, to give @i{a-addr2}."" |
a_addr2 = a_addr1+1; |
a_addr2 = a_addr1+1; |
: |
: |
cell + ; |
cell + ; |
|
|
cells n1 -- n2 core |
cells n1 -- n2 core |
|
"" @i{n2} is the number of address units corresponding to @i{n1} cells."" |
n2 = n1 * sizeof(Cell); |
n2 = n1 * sizeof(Cell); |
: |
: |
[ cell |
[ cell |
Line 1173 n2 = n1 * sizeof(Cell);
|
Line 1198 n2 = n1 * sizeof(Cell);
|
2/ dup [IF] ] 2* [ [THEN] |
2/ dup [IF] ] 2* [ [THEN] |
drop ] ; |
drop ] ; |
|
|
char+ c_addr1 -- c_addr2 core care_plus |
char+ c_addr1 -- c_addr2 core char_plus |
|
"" Increment @i{c-addr1} by the number of address units corresponding to the size of |
|
one char, to give @i{c-addr2}."" |
c_addr2 = c_addr1 + 1; |
c_addr2 = c_addr1 + 1; |
: |
: |
1+ ; |
1+ ; |
|
|
(chars) n1 -- n2 gforth paren_cares |
(chars) n1 -- n2 gforth paren_chars |
n2 = n1 * sizeof(Char); |
n2 = n1 * sizeof(Char); |
: |
: |
; |
; |
|
|
count c_addr1 -- c_addr2 u core |
count c_addr1 -- c_addr2 u core |
"" If c-add1 is the address of a counted string return the length of |
"" If @i{c-add1} is the address of a counted string return the length of |
the string, u, and the address of its first character, c-addr2."" |
the string, @i{u}, and the address of its first character, @i{c-addr2}."" |
u = *c_addr1; |
u = *c_addr1; |
c_addr2 = c_addr1+1; |
c_addr2 = c_addr1+1; |
: |
: |
Line 1310 else {
|
Line 1337 else {
|
REPEAT THEN nip - ; |
REPEAT THEN nip - ; |
|
|
aligned c_addr -- a_addr core |
aligned c_addr -- a_addr core |
|
"" @i{a-addr} is the first aligned address greater than or equal to @i{c-addr}."" |
a_addr = (Cell *)((((Cell)c_addr)+(sizeof(Cell)-1))&(-sizeof(Cell))); |
a_addr = (Cell *)((((Cell)c_addr)+(sizeof(Cell)-1))&(-sizeof(Cell))); |
: |
: |
[ cell 1- ] Literal + [ -1 cells ] Literal and ; |
[ cell 1- ] Literal + [ -1 cells ] Literal and ; |
|
|
faligned c_addr -- f_addr float f_aligned |
faligned c_addr -- f_addr float f_aligned |
|
"" @i{f-addr} is the first float-aligned address greater than or equal to @i{c-addr}."" |
f_addr = (Float *)((((Cell)c_addr)+(sizeof(Float)-1))&(-sizeof(Float))); |
f_addr = (Float *)((((Cell)c_addr)+(sizeof(Float)-1))&(-sizeof(Float))); |
: |
: |
[ 1 floats 1- ] Literal + [ -1 floats ] Literal and ; |
[ 1 floats 1- ] Literal + [ -1 floats ] Literal and ; |
Line 1324 a_addr = PFA(xt);
|
Line 1353 a_addr = PFA(xt);
|
: |
: |
2 cells + ; |
2 cells + ; |
|
|
|
\+standardthreading |
|
|
>code-address xt -- c_addr gforth to_code_address |
>code-address xt -- c_addr gforth to_code_address |
""c_addr is the code address of the word xt"" |
""@i{c-addr} is the code address of the word @i{xt}."" |
/* !! This behaves installation-dependently for DOES-words */ |
/* !! This behaves installation-dependently for DOES-words */ |
c_addr = (Address)CODE_ADDRESS(xt); |
c_addr = (Address)CODE_ADDRESS(xt); |
: |
: |
@ ; |
@ ; |
|
|
>does-code xt -- a_addr gforth to_does_code |
>does-code xt -- a_addr gforth to_does_code |
""If xt ist the execution token of a defining-word-defined word, |
""If @i{xt} is the execution token of a defining-word-defined word, |
a_addr is the start of the Forth code after the @code{DOES>}; |
@i{a-addr} is the start of the Forth code after the @code{DOES>}; |
Otherwise a_addr is 0."" |
Otherwise @i{a-addr} is 0."" |
a_addr = (Cell *)DOES_CODE(xt); |
a_addr = (Cell *)DOES_CODE(xt); |
: |
: |
cell+ @ ; |
cell+ @ ; |
|
|
code-address! c_addr xt -- gforth code_address_store |
code-address! c_addr xt -- gforth code_address_store |
""Creates a code field with code address c_addr at xt"" |
""Create a code field with code address @i{c-addr} at @i{xt}."" |
MAKE_CF(xt, c_addr); |
MAKE_CF(xt, c_addr); |
CACHE_FLUSH(xt,(size_t)PFA(0)); |
CACHE_FLUSH(xt,(size_t)PFA(0)); |
: |
: |
! ; |
! ; |
|
|
does-code! a_addr xt -- gforth does_code_store |
does-code! a_addr xt -- gforth does_code_store |
""creates a code field at xt for a defining-word-defined word; a_addr |
""Create a code field at @i{xt} for a defining-word-defined word; @i{a-addr} |
is the start of the Forth code after DOES>"" |
is the start of the Forth code after @code{DOES>}."" |
MAKE_DOES_CF(xt, a_addr); |
MAKE_DOES_CF(xt, a_addr); |
CACHE_FLUSH(xt,(size_t)PFA(0)); |
CACHE_FLUSH(xt,(size_t)PFA(0)); |
: |
: |
dodoes: over ! cell+ ! ; |
dodoes: over ! cell+ ! ; |
|
|
does-handler! a_addr -- gforth does_handler_store |
does-handler! a_addr -- gforth does_handler_store |
""creates a DOES>-handler at address a_addr. a_addr usually points |
""Create a @code{DOES>}-handler at address @i{a-addr}. Usually, @i{a-addr} points |
just behind a DOES>."" |
just behind a @code{DOES>}."" |
MAKE_DOES_HANDLER(a_addr); |
MAKE_DOES_HANDLER(a_addr); |
CACHE_FLUSH((caddr_t)a_addr,DOES_HANDLER_SIZE); |
CACHE_FLUSH((caddr_t)a_addr,DOES_HANDLER_SIZE); |
: |
: |
drop ; |
drop ; |
|
|
/does-handler -- n gforth slash_does_handler |
/does-handler -- n gforth slash_does_handler |
""the size of a does-handler (includes possible padding)"" |
""The size of a @code{DOES>}-handler (includes possible padding)."" |
/* !! a constant or environmental query might be better */ |
/* !! a constant or environmental query might be better */ |
n = DOES_HANDLER_SIZE; |
n = DOES_HANDLER_SIZE; |
: |
: |
Line 1384 n=1;
|
Line 1415 n=1;
|
: |
: |
1 ; |
1 ; |
|
|
|
\+ |
|
|
key-file wfileid -- n gforth paren_key_file |
key-file wfileid -- n gforth paren_key_file |
#ifdef HAS_FILE |
#ifdef HAS_FILE |
fflush(stdout); |
fflush(stdout); |
Line 1421 ucols=cols;
|
Line 1454 ucols=cols;
|
|
|
flush-icache c_addr u -- gforth flush_icache |
flush-icache c_addr u -- gforth flush_icache |
""Make sure that the instruction cache of the processor (if there is |
""Make sure that the instruction cache of the processor (if there is |
one) does not contain stale data at @var{c_addr} and @var{u} bytes |
one) does not contain stale data at @i{c-addr} and @i{u} bytes |
afterwards. @code{END-CODE} performs a @code{flush-icache} |
afterwards. @code{END-CODE} performs a @code{flush-icache} |
automatically. Caveat: @code{flush-icache} might not work on your |
automatically. Caveat: @code{flush-icache} might not work on your |
installation; this is usually the case if direct threading is not |
installation; this is usually the case if direct threading is not |
Line 1447 if (old_tp)
|
Line 1480 if (old_tp)
|
#endif |
#endif |
|
|
getenv c_addr1 u1 -- c_addr2 u2 gforth |
getenv c_addr1 u1 -- c_addr2 u2 gforth |
|
""The string @i{c-addr1 u1} specifies an environment variable. The string @i{c-addr2 u2} |
|
is the host operating system's expansion of that environment variable. If the |
|
environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters |
|
in length."" |
c_addr2 = getenv(cstr(c_addr1,u1,1)); |
c_addr2 = getenv(cstr(c_addr1,u1,1)); |
u2 = (c_addr2 == NULL ? 0 : strlen(c_addr2)); |
u2 = (c_addr2 == NULL ? 0 : strlen(c_addr2)); |
|
|
Line 1478 timeout.tv_usec=1000*(n%1000);
|
Line 1515 timeout.tv_usec=1000*(n%1000);
|
(void)select(0,0,0,0,&timeout); |
(void)select(0,0,0,0,&timeout); |
|
|
allocate u -- a_addr wior memory |
allocate u -- a_addr wior memory |
|
""Allocate @i{u} address units of contiguous data space. The initial |
|
contents of the data space is undefined. If the allocation is successful, |
|
@i{a-addr} is the start address of the allocated region and @i{wior} |
|
is 0. If the allocation fails, @i{a-addr} is undefined and @i{wior} |
|
is an implementation-defined I/O result code."" |
a_addr = (Cell *)malloc(u?u:1); |
a_addr = (Cell *)malloc(u?u:1); |
wior = IOR(a_addr==NULL); |
wior = IOR(a_addr==NULL); |
|
|
free a_addr -- wior memory |
free a_addr -- wior memory |
|
""Return the region of data space starting at @i{a-addr} to the system. |
|
The regon must originally have been obtained using @code{allocate} or |
|
@code{resize}. If the operational is successful, @i{wior} is 0. |
|
If the operation fails, @i{wior} is an implementation-defined |
|
I/O result code."" |
free(a_addr); |
free(a_addr); |
wior = 0; |
wior = 0; |
|
|
resize a_addr1 u -- a_addr2 wior memory |
resize a_addr1 u -- a_addr2 wior memory |
""Change the size of the allocated area at @i{a_addr1} to @i{u} |
""Change the size of the allocated area at @i{a-addr1} to @i{u} |
address units, possibly moving the contents to a different |
address units, possibly moving the contents to a different |
area. @i{a_addr2} is the address of the resulting area. If |
area. @i{a-addr2} is the address of the resulting area. |
@code{a_addr1} is 0, Gforth's (but not the standard) @code{resize} |
If the operational is successful, @i{wior} is 0. |
@code{allocate}s @i{u} address units."" |
If the operation fails, @i{wior} is an implementation-defined |
|
I/O result code. If @i{a-addr1} is 0, Gforth's (but not the Standard) |
|
@code{resize} @code{allocate}s @i{u} address units."" |
/* the following check is not necessary on most OSs, but it is needed |
/* the following check is not necessary on most OSs, but it is needed |
on SunOS 4.1.2. */ |
on SunOS 4.1.2. */ |
if (a_addr1==NULL) |
if (a_addr1==NULL) |
Line 1555 delete-file c_addr u -- wior file delet
|
Line 1604 delete-file c_addr u -- wior file delet
|
wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1); |
wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1); |
|
|
rename-file c_addr1 u1 c_addr2 u2 -- wior file-ext rename_file |
rename-file c_addr1 u1 c_addr2 u2 -- wior file-ext rename_file |
""rename file c_addr1 u1 to new name c_addr2 u2"" |
""Rename file @i{c_addr1 u1} to new name @i{c_addr2 u2}"" |
char *s1=tilde_cstr(c_addr2, u2, 1); |
char *s1=tilde_cstr(c_addr2, u2, 1); |
wior = IOR(rename(tilde_cstr(c_addr1, u1, 0), s1)==-1); |
wior = IOR(rename(tilde_cstr(c_addr1, u1, 0), s1)==-1); |
|
|
Line 1601 wior=FILEIO(ferror((FILE *)wfileid));
|
Line 1650 wior=FILEIO(ferror((FILE *)wfileid));
|
*/ |
*/ |
if ((flag=FLAG(!feof((FILE *)wfileid) && |
if ((flag=FLAG(!feof((FILE *)wfileid) && |
fgets(c_addr,u1+1,(FILE *)wfileid) != NULL))) { |
fgets(c_addr,u1+1,(FILE *)wfileid) != NULL))) { |
wior=FILEIO(ferror((FILE *)wfileid)); /* !! ior? */ |
wior=FILEIO(ferror((FILE *)wfileid)!=0); /* !! ior? */ |
if (wior) |
if (wior) |
clearerr((FILE *)wfileid); |
clearerr((FILE *)wfileid); |
u2 = strlen(c_addr); |
u2 = strlen(c_addr); |
Line 1687 d = r;
|
Line 1736 d = r;
|
#endif |
#endif |
|
|
f! r f_addr -- float f_store |
f! r f_addr -- float f_store |
|
"" Store the floating-point value @i{r} to address @i{f-addr}."" |
*f_addr = r; |
*f_addr = r; |
|
|
f@ f_addr -- r float f_fetch |
f@ f_addr -- r float f_fetch |
|
"" Fetch floating-point value @i{r} from address @i{f-addr}."" |
r = *f_addr; |
r = *f_addr; |
|
|
df@ df_addr -- r float-ext d_f_fetch |
df@ df_addr -- r float-ext d_f_fetch |
|
"" Fetch the double-precision IEEE floating-point value @i{r} from the address @i{df-addr}."" |
#ifdef IEEE_FP |
#ifdef IEEE_FP |
r = *df_addr; |
r = *df_addr; |
#else |
#else |
Line 1700 r = *df_addr;
|
Line 1752 r = *df_addr;
|
#endif |
#endif |
|
|
df! r df_addr -- float-ext d_f_store |
df! r df_addr -- float-ext d_f_store |
|
"" Store the double-precision IEEE floating-point value @i{r} to the address @i{df-addr}."" |
#ifdef IEEE_FP |
#ifdef IEEE_FP |
*df_addr = r; |
*df_addr = r; |
#else |
#else |
Line 1707 df! r df_addr -- float-ext d_f_store
|
Line 1760 df! r df_addr -- float-ext d_f_store
|
#endif |
#endif |
|
|
sf@ sf_addr -- r float-ext s_f_fetch |
sf@ sf_addr -- r float-ext s_f_fetch |
|
"" Fetch the single-precision IEEE floating-point value @i{r} from the address @i{sf-addr}."" |
#ifdef IEEE_FP |
#ifdef IEEE_FP |
r = *sf_addr; |
r = *sf_addr; |
#else |
#else |
Line 1714 r = *sf_addr;
|
Line 1768 r = *sf_addr;
|
#endif |
#endif |
|
|
sf! r sf_addr -- float-ext s_f_store |
sf! r sf_addr -- float-ext s_f_store |
|
"" Store the single-precision IEEE floating-point value @i{r} to the address @i{sf-addr}."" |
#ifdef IEEE_FP |
#ifdef IEEE_FP |
*sf_addr = r; |
*sf_addr = r; |
#else |
#else |
Line 1733 f/ r1 r2 -- r3 float f_slash
|
Line 1788 f/ r1 r2 -- r3 float f_slash
|
r3 = r1/r2; |
r3 = r1/r2; |
|
|
f** r1 r2 -- r3 float-ext f_star_star |
f** r1 r2 -- r3 float-ext f_star_star |
""@i{r3} is @i{r1} raised to the @i{r2}th power"" |
""@i{r3} is @i{r1} raised to the @i{r2}th power."" |
r3 = pow(r1,r2); |
r3 = pow(r1,r2); |
|
|
fnegate r1 -- r2 float |
fnegate r1 -- r2 float |
Line 1754 fnip r1 r2 -- r2 gforth
|
Line 1809 fnip r1 r2 -- r2 gforth
|
ftuck r1 r2 -- r2 r1 r2 gforth |
ftuck r1 r2 -- r2 r1 r2 gforth |
|
|
float+ f_addr1 -- f_addr2 float float_plus |
float+ f_addr1 -- f_addr2 float float_plus |
|
"" Increment @i{f-addr1} by the number of address units corresponding to the size of |
|
one floating-point number, to give @i{f-addr2}."" |
f_addr2 = f_addr1+1; |
f_addr2 = f_addr1+1; |
|
|
floats n1 -- n2 float |
floats n1 -- n2 float |
|
""@i{n2} is the number of address units corresponding to @i{n1} floating-point numbers."" |
n2 = n1*sizeof(Float); |
n2 = n1*sizeof(Float); |
|
|
floor r1 -- r2 float |
floor r1 -- r2 float |
""round towards the next smaller integral value, i.e., round toward negative infinity"" |
""Round towards the next smaller integral value, i.e., round toward negative infinity."" |
/* !! unclear wording */ |
/* !! unclear wording */ |
r2 = floor(r1); |
r2 = floor(r1); |
|
|
fround r1 -- r2 float |
fround r1 -- r2 float |
""round to the nearest integral value"" |
""Round to the nearest integral value."" |
/* !! unclear wording */ |
/* !! unclear wording */ |
#ifdef HAVE_RINT |
#ifdef HAVE_RINT |
r2 = rint(r1); |
r2 = rint(r1); |
Line 1797 f2=FLAG(isdigit((unsigned)(sig[0]))!=0);
|
Line 1855 f2=FLAG(isdigit((unsigned)(sig[0]))!=0);
|
memmove(c_addr,sig,u); |
memmove(c_addr,sig,u); |
|
|
>float c_addr u -- flag float to_float |
>float c_addr u -- flag float to_float |
|
""Attempt to convert the character string @i{c-addr u} to |
|
internal floating-point representation. If the string |
|
represents a valid floating-point number @i{r} is placed |
|
on the floating-point stack and @i{flag} is true. Otherwise, |
|
@i{flag} is false. A string of blanks is a special case |
|
and represents the flotaing-point number 0."" |
/* real signature: c_addr u -- r t / f */ |
/* real signature: c_addr u -- r t / f */ |
Float r; |
Float r; |
char *number=cstr(c_addr, u, 1); |
char *number=cstr(c_addr, u, 1); |
Line 1843 fatan r1 -- r2 float-ext
|
Line 1907 fatan r1 -- r2 float-ext
|
r2 = atan(r1); |
r2 = atan(r1); |
|
|
fatan2 r1 r2 -- r3 float-ext |
fatan2 r1 r2 -- r3 float-ext |
""@i{r1/r2}=tan@i{r3}. The standard does not require, but probably |
""@i{r1/r2}=tan(@i{r3}). ANS Forth does not require, but probably |
intends this to be the inverse of @code{fsincos}. In gforth it is."" |
intends this to be the inverse of @code{fsincos}. In gforth it is."" |
r3 = atan2(r1,r2); |
r3 = atan2(r1,r2); |
|
|
Line 1883 r2 = log(r1+1.);
|
Line 1947 r2 = log(r1+1.);
|
#endif |
#endif |
|
|
flog r1 -- r2 float-ext |
flog r1 -- r2 float-ext |
""the decimal logarithm"" |
""The decimal logarithm."" |
r2 = log10(r1); |
r2 = log10(r1); |
|
|
falog r1 -- r2 float-ext |
falog r1 -- r2 float-ext |
Line 1939 r2 = atanh(r1);
|
Line 2003 r2 = atanh(r1);
|
r> IF fnegate THEN ; |
r> IF fnegate THEN ; |
|
|
sfloats n1 -- n2 float-ext s_floats |
sfloats n1 -- n2 float-ext s_floats |
|
""@i{n2} is the number of address units corresponding to @i{n1} |
|
single-precision IEEE floating-point numbers."" |
n2 = n1*sizeof(SFloat); |
n2 = n1*sizeof(SFloat); |
|
|
dfloats n1 -- n2 float-ext d_floats |
dfloats n1 -- n2 float-ext d_floats |
|
""@i{n2} is the number of address units corresponding to @i{n1} |
|
double-precision IEEE floating-point numbers."" |
n2 = n1*sizeof(DFloat); |
n2 = n1*sizeof(DFloat); |
|
|
sfaligned c_addr -- sf_addr float-ext s_f_aligned |
sfaligned c_addr -- sf_addr float-ext s_f_aligned |
|
"" @i{sf-addr} is the first single-float-aligned address greater |
|
than or equal to @i{c-addr}."" |
sf_addr = (SFloat *)((((Cell)c_addr)+(sizeof(SFloat)-1))&(-sizeof(SFloat))); |
sf_addr = (SFloat *)((((Cell)c_addr)+(sizeof(SFloat)-1))&(-sizeof(SFloat))); |
: |
: |
[ 1 sfloats 1- ] Literal + [ -1 sfloats ] Literal and ; |
[ 1 sfloats 1- ] Literal + [ -1 sfloats ] Literal and ; |
|
|
dfaligned c_addr -- df_addr float-ext d_f_aligned |
dfaligned c_addr -- df_addr float-ext d_f_aligned |
|
"" @i{df-addr} is the first double-float-aligned address greater |
|
than or equal to @i{c-addr}."" |
df_addr = (DFloat *)((((Cell)c_addr)+(sizeof(DFloat)-1))&(-sizeof(DFloat))); |
df_addr = (DFloat *)((((Cell)c_addr)+(sizeof(DFloat)-1))&(-sizeof(DFloat))); |
: |
: |
[ 1 dfloats 1- ] Literal + [ -1 dfloats ] Literal and ; |
[ 1 dfloats 1- ] Literal + [ -1 dfloats ] Literal and ; |
Line 2106 UP=up=(char *)a_addr;
|
Line 2178 UP=up=(char *)a_addr;
|
: |
: |
up ! ; |
up ! ; |
Variable UP |
Variable UP |
|
|
|
wcall u -- gforth |
|
IF_FTOS(fp[0]=FTOS); |
|
FP=fp; |
|
sp=(SYSCALL(Cell(*)(Cell *, void *))u)(sp, &FP); |
|
fp=FP; |
|
IF_TOS(TOS=sp[0];) |
|
IF_FTOS(FTOS=fp[0]); |
|
|