version 1.11, 1998/10/07 18:29:38
|
version 1.27, 1999/03/29 22:52:28
|
Line 1
|
Line 1
|
\ Gforth primitives |
\ Gforth primitives |
|
|
\ Copyright (C) 1995,1996 Free Software Foundation, Inc. |
\ Copyright (C) 1995,1996,1997,1998 Free Software Foundation, Inc. |
|
|
\ This file is part of Gforth. |
\ This file is part of Gforth. |
|
|
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, @var{xt}."" |
ip=IP; |
ip=IP; |
IF_TOS(TOS = sp[0]); |
IF_TOS(TOS = sp[0]); |
EXEC(xt); |
EXEC(xt); |
|
|
perform a_addr -- gforth |
perform a_addr -- gforth |
""equivalent to @code{@ execute}"" |
""Equivalent to @code{@ execute}."" |
/* and pfe */ |
/* and pfe */ |
ip=IP; |
ip=IP; |
IF_TOS(TOS = sp[0]); |
IF_TOS(TOS = sp[0]); |
Line 128 EXEC(*(Xt *)a_addr);
|
Line 129 EXEC(*(Xt *)a_addr);
|
: |
: |
@ execute ; |
@ execute ; |
|
|
\+has? glocals [IF] |
\+glocals |
|
|
branch-lp+!# -- gforth branch_lp_plus_store_number |
branch-lp+!# -- gforth branch_lp_plus_store_number |
/* this will probably not be used */ |
/* this will probably not be used */ |
Line 136 branch_adjust_lp:
|
Line 137 branch_adjust_lp:
|
lp += (Cell)(IP[1]); |
lp += (Cell)(IP[1]); |
goto branch; |
goto branch; |
|
|
\+[THEN] |
\+ |
|
|
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 149 NEXT_P0;
|
Line 149 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 |
INC_IP(1); |
INC_IP(1); |
$4 |
$4 |
|
|
\+has? glocals [IF] |
\+glocals |
|
|
$1-lp+!# $2_lp_plus_store_number |
$1-lp+!# $2_lp_plus_store_number |
$3 goto branch_adjust_lp; |
$3 goto branch_adjust_lp; |
Line 165 $3 goto branch_adjust_lp;
|
Line 164 $3 goto branch_adjust_lp;
|
else |
else |
INC_IP(2); |
INC_IP(2); |
|
|
\+[THEN] |
\+ |
) |
) |
|
|
condbranch(?branch,f -- f83 question_branch, |
condbranch(?branch,f -- f83 question_branch, |
Line 181 if (f==0) {
|
Line 180 if (f==0) {
|
\ we don't need an lp_plus_store version of the ?dup-stuff, because it |
\ we don't need an lp_plus_store version of the ?dup-stuff, because it |
\ is only used in if's (yet) |
\ is only used in if's (yet) |
|
|
\+has? xconds [IF] |
\+xconds |
|
|
?dup-?branch f -- f new question_dupe_question_branch |
?dup-?branch f -- f new question_dupe_question_branch |
""The run-time procedure compiled by @code{?DUP-IF}."" |
""The run-time procedure compiled by @code{?DUP-IF}."" |
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 203 few cycles in that case, but is easy to
|
Line 201 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); |
|
|
\+[THEN] |
\+ |
|
|
condbranch((next),-- cmFORTH paren_next, |
condbranch((next),-- cmFORTH paren_next, |
if ((*rp)--) { |
if ((*rp)--) { |
Line 250 if ((olddiff^(olddiff+n))>=0 /* the li
|
Line 247 if ((olddiff^(olddiff+n))>=0 /* the li
|
IF >r + >r dup @ + >r |
IF >r + >r dup @ + >r |
ELSE >r >r drop cell+ >r THEN ;) |
ELSE >r >r drop cell+ >r THEN ;) |
|
|
\+has? xconds [IF] |
\+xconds |
|
|
condbranch((-loop),u -- gforth paren_minus_loop, |
condbranch((-loop),u -- gforth paren_minus_loop, |
/* !! check this thoroughly */ |
/* !! check this thoroughly */ |
Line 286 if (diff>=0 || newdiff<0) {
|
Line 283 if (diff>=0 || newdiff<0) {
|
IF_TOS(TOS = sp[0]); |
IF_TOS(TOS = sp[0]); |
,) |
,) |
|
|
\+[THEN] |
\+ |
|
|
unloop -- core |
unloop -- core |
rp += 2; |
rp += 2; |
Line 325 else {
|
Line 322 else {
|
cell+ >r |
cell+ >r |
THEN ; \ --> CORE-EXT |
THEN ; \ --> CORE-EXT |
|
|
\+has? xconds [IF] |
\+xconds |
|
|
(+do) nlimit nstart -- gforth paren_plus_do |
(+do) nlimit nstart -- gforth paren_plus_do |
*--rp = nlimit; |
*--rp = nlimit; |
Line 407 else {
|
Line 404 else {
|
cell+ |
cell+ |
THEN >r ; |
THEN >r ; |
|
|
\+[THEN] |
\+ |
|
|
\ don't make any assumptions where the return stack is!! |
\ don't make any assumptions where the return stack is!! |
\ implement this in machine code if it should run quickly! |
\ implement this in machine code if it should run quickly! |
Line 443 n = rp[4];
|
Line 440 n = rp[4];
|
\ 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 @var{ucount}>0, copy the contents of @var{ucount} address units |
|
at @var{c-from} to @var{c-to}. @code{move} chooses its copy direction |
|
to avoid problems when @var{c-from}, @var{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 @var{u}>0, copy the contents of @var{ucount} characters from |
|
data space at @var{c-from} to @var{c-to}. The copy proceeds @code{char}-by-@code{char} |
|
from low address to high address."" |
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 @var{u}>0, copy the contents of @var{ucount} characters from |
|
data space at @var{c-from} to @var{c-to}. The copy proceeds @code{char}-by-@code{char} |
|
from high address to low address."" |
while (u-- > 0) |
while (u-- > 0) |
c_to[u] = c_from[u]; |
c_to[u] = c_from[u]; |
: |
: |
Line 463 while (u-- > 0)
|
Line 469 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 @var{u}>0, store character @var{c} in each of @var{u} consecutive |
|
@code{char} addresses in memory, starting at address @var{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 the strings lexicographically. If they are equal, n is 0; if |
""Compare two strings lexicographically. If they are equal, @var{n} is 0; if |
the first string is smaller, n is -1; if the first string is larger, n |
the first string is smaller, @var{n} is -1; if the first string is larger, @var{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 504 else if (n>0)
|
Line 512 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 @var{c1} is a lower-case character (in the current locale), @var{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 522 else if (n>0)
|
Line 532 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 @var{c-addr, u1} to remove all trailing |
|
spaces. @var{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 530 while (u2>0 && c_addr[u2-1] == ' ')
|
Line 542 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 @var{c-addr1, u1} to remove @var{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 627 n2 = n1>>1;
|
Line 641 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: @var{d1} = @var{n3}*@var{n1}+@var{n2}, @var{n1}>@var{n2}>=0 or 0>=@var{n2}>@var{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 649 if (1%-3>0 && (d1<0) != (n1<0) && n2!=0)
|
Line 663 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: @var{d1} = @var{n3}*@var{n1}+@var{n2}, sign(@var{n2})=sign(@var{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 905 f = FLAG($4>=$5);
|
Line 919 f = FLAG($4>=$5);
|
|
|
) |
) |
|
|
\+has? dcomps [IF] |
\+dcomps |
|
|
dcomparisons(d, d1 d2, d_, d1, d2, double, gforth, double, gforth) |
dcomparisons(d, d1 d2, d_, d1, d2, double, gforth, double, gforth) |
dcomparisons(d0, d, d_zero_, d, DZERO, double, gforth, double, gforth) |
dcomparisons(d0, d, d_zero_, d, DZERO, double, gforth, double, gforth) |
dcomparisons(du, ud1 ud2, d_u_, ud1, ud2, gforth, gforth, double-ext, gforth) |
dcomparisons(du, ud1 ud2, d_u_, ud1, ud2, gforth, gforth, double-ext, gforth) |
|
|
\+[THEN] |
\+ |
|
|
within u1 u2 u3 -- f core-ext |
within u1 u2 u3 -- f core-ext |
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; |
|
|
\+has? floating [IF] |
\+floating |
|
|
fp@ -- f_addr gforth fp_fetch |
fp@ -- f_addr gforth fp_fetch |
f_addr = fp; |
f_addr = fp; |
Line 939 f_addr = fp;
|
Line 953 f_addr = fp;
|
fp! f_addr -- gforth fp_store |
fp! f_addr -- gforth fp_store |
fp = f_addr; |
fp = f_addr; |
|
|
\+[THEN] |
\+ |
|
|
;s -- gforth semis |
;s -- gforth semis |
ip = (Xt *)(*rp++); |
""The primitive compiled by @code{EXIT}."" |
NEXT_P0; |
SET_IP((Xt *)(*rp++)); |
|
|
>r w -- core to_r |
>r w -- core to_r |
*--rp = w; |
*--rp = w; |
Line 1079 w = *a_addr;
|
Line 1093 w = *a_addr;
|
: |
: |
tuck @ + swap ! ; |
tuck @ + swap ! ; |
|
|
c@ c_addr -- c core cfetch |
c@ c_addr -- c core c_fetch |
c = *c_addr; |
c = *c_addr; |
: |
: |
[ bigendian [IF] ] |
[ bigendian [IF] ] |
Line 1104 c = *c_addr;
|
Line 1118 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 |
*c_addr = c; |
*c_addr = c; |
: |
: |
[ bigendian [IF] ] |
[ bigendian [IF] ] |
Line 1171 n2 = n1 * sizeof(Char);
|
Line 1185 n2 = n1 * sizeof(Char);
|
; |
; |
|
|
count c_addr1 -- c_addr2 u core |
count c_addr1 -- c_addr2 u core |
|
"" If @var{c-add1} is the address of a counted string return the length of |
|
the string, @var{u}, and the address of its first character, @var{c-addr2}."" |
u = *c_addr1; |
u = *c_addr1; |
c_addr2 = c_addr1+1; |
c_addr2 = c_addr1+1; |
: |
: |
dup 1+ swap c@ ; |
dup 1+ swap c@ ; |
|
|
(f83find) c_addr u f83name1 -- f83name2 new paren_f83find |
(f83find) c_addr u f83name1 -- f83name2 new paren_f83find |
for (; f83name1 != NULL; f83name1 = f83name1->next) |
for (; f83name1 != NULL; f83name1 = (struct F83Name *)(f83name1->next)) |
if ((UCell)F83NAME_COUNT(f83name1)==u && |
if ((UCell)F83NAME_COUNT(f83name1)==u && |
memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
break; |
break; |
Line 1191 f83name2=f83name1;
|
Line 1207 f83name2=f83name1;
|
: (find-samelen) ( u f83name1 -- u f83name2/0 ) |
: (find-samelen) ( u f83name1 -- u f83name2/0 ) |
BEGIN 2dup cell+ c@ $1F and <> WHILE @ dup 0= UNTIL THEN ; |
BEGIN 2dup cell+ c@ $1F and <> WHILE @ dup 0= UNTIL THEN ; |
|
|
\+has? hash [IF] |
\+hash |
|
|
(hashfind) c_addr u a_addr -- f83name2 new paren_hashfind |
(hashfind) c_addr u a_addr -- f83name2 new paren_hashfind |
F83Name *f83name1; |
struct F83Name *f83name1; |
f83name2=NULL; |
f83name2=NULL; |
while(a_addr != NULL) |
while(a_addr != NULL) |
{ |
{ |
f83name1=(F83Name *)(a_addr[1]); |
f83name1=(struct F83Name *)(a_addr[1]); |
a_addr=(Cell *)(a_addr[0]); |
a_addr=(Cell *)(a_addr[0]); |
if ((UCell)F83NAME_COUNT(f83name1)==u && |
if ((UCell)F83NAME_COUNT(f83name1)==u && |
memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
Line 1217 while(a_addr != NULL)
|
Line 1233 while(a_addr != NULL)
|
|
|
(tablefind) c_addr u a_addr -- f83name2 new paren_tablefind |
(tablefind) c_addr u a_addr -- f83name2 new paren_tablefind |
""A case-sensitive variant of @code{(hashfind)}"" |
""A case-sensitive variant of @code{(hashfind)}"" |
F83Name *f83name1; |
struct F83Name *f83name1; |
f83name2=NULL; |
f83name2=NULL; |
while(a_addr != NULL) |
while(a_addr != NULL) |
{ |
{ |
f83name1=(F83Name *)(a_addr[1]); |
f83name1=(struct F83Name *)(a_addr[1]); |
a_addr=(Cell *)(a_addr[0]); |
a_addr=(Cell *)(a_addr[0]); |
if ((UCell)F83NAME_COUNT(f83name1)==u && |
if ((UCell)F83NAME_COUNT(f83name1)==u && |
memcmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
memcmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
Line 1272 Create rot-values
|
Line 1288 Create rot-values
|
7 c, 5 c, 5 c, 5 c, 5 c, 6 c, 5 c, 5 c, 5 c, 5 c, |
7 c, 5 c, 5 c, 5 c, 5 c, 6 c, 5 c, 5 c, 5 c, 5 c, |
7 c, 5 c, 5 c, |
7 c, 5 c, 5 c, |
|
|
\+[THEN] |
\+ |
|
|
(parse-white) c_addr1 u1 -- c_addr2 u2 gforth paren_parse_white |
(parse-white) c_addr1 u1 -- c_addr2 u2 gforth paren_parse_white |
/* use !isgraph instead of isspace? */ |
/* use !isgraph instead of isspace? */ |
Line 1310 a_addr = PFA(xt);
|
Line 1326 a_addr = PFA(xt);
|
2 cells + ; |
2 cells + ; |
|
|
>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"" |
""@var{c-addr} is the code address of the word @var{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 @var{xt} is the execution token of a defining-word-defined word, |
a_addr is the start of the Forth code after the DOES>; |
@var{a-addr} is the start of the Forth code after the @code{DOES>}; |
Otherwise a_addr is 0."" |
Otherwise @var{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 @var{c-addr} at @var{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 @var{xt} for a defining-word-defined word; @var{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 @var{a-addr}. Usually, @var{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 1369 n=1;
|
Line 1385 n=1;
|
: |
: |
1 ; |
1 ; |
|
|
\+has? os [IF] |
key-file wfileid -- n gforth paren_key_file |
|
#ifdef HAS_FILE |
(key) -- n gforth paren_key |
|
fflush(stdout); |
fflush(stdout); |
/* !! noecho */ |
n = key((FILE*)wfileid); |
n = key(); |
#else |
|
n = key(stdin); |
|
#endif |
|
|
key? -- n facility key_q |
key?-file wfileid -- n facility key_q_file |
|
#ifdef HAS_FILE |
fflush(stdout); |
fflush(stdout); |
n = key_query; |
n = key_query((FILE*)wfileid); |
|
#else |
|
n = key_query(stdin); |
|
#endif |
|
|
|
\+os |
|
|
|
stdin -- wfileid gforth |
|
wfileid = (Cell)stdin; |
|
|
stdout -- wfileid gforth |
stdout -- wfileid gforth |
wfileid = (Cell)stdout; |
wfileid = (Cell)stdout; |
Line 1396 ucols=cols;
|
Line 1422 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 @var{c-addr} and @var{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 1410 FLUSH_ICACHE(c_addr,u);
|
Line 1436 FLUSH_ICACHE(c_addr,u);
|
return (Label *)n; |
return (Label *)n; |
|
|
(system) c_addr u -- wretval wior gforth peren_system |
(system) c_addr u -- wretval wior gforth peren_system |
|
#ifndef MSDOS |
int old_tp=terminal_prepped; |
int old_tp=terminal_prepped; |
deprep_terminal(); |
deprep_terminal(); |
|
#endif |
wretval=system(cstr(c_addr,u,1)); /* ~ expansion on first part of string? */ |
wretval=system(cstr(c_addr,u,1)); /* ~ expansion on first part of string? */ |
wior = IOR(wretval==-1 || (wretval==127 && errno != 0)); |
wior = IOR(wretval==-1 || (wretval==127 && errno != 0)); |
|
#ifndef MSDOS |
if (old_tp) |
if (old_tp) |
prep_terminal(); |
prep_terminal(); |
|
#endif |
|
|
getenv c_addr1 u1 -- c_addr2 u2 gforth |
getenv c_addr1 u1 -- c_addr2 u2 gforth |
|
""The string @var{c-addr1 u1} specifies an environment variable. The string @var{c-addr2 u2} |
|
is the host operating system's expansion of that environment variable. If the |
|
environment variable does not exist, @var{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 1449 timeout.tv_usec=1000*(n%1000);
|
Line 1483 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 @var{u} address units of contiguous data space. The initial |
|
contents of the data space is undefined. If the allocation is successful, |
|
@var{a-addr} is the start address of the allocated region and @var{wior} |
|
is 0. If the allocation fails, @var{a-addr} is undefined and @var{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 @var{a-addr} to the system. |
|
The regon must originally have been obtained using @code{allocate} or |
|
@code{resize}. If the operational is successful, @var{wior} is 0. |
|
If the operation fails, @var{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, @var{wior} is 0. |
@code{allocate}s @i{u} address units."" |
If the operation fails, @var{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 1493 fp=FP;
|
Line 1539 fp=FP;
|
IF_TOS(TOS=sp[0]); |
IF_TOS(TOS=sp[0]); |
IF_FTOS(FTOS=fp[0]); |
IF_FTOS(FTOS=fp[0]); |
|
|
\+[THEN] ( has? os ) has? file [IF] |
\+ |
|
\+file |
|
|
close-file wfileid -- wior file close_file |
close-file wfileid -- wior file close_file |
wior = IOR(fclose((FILE *)wfileid)==EOF); |
wior = IOR(fclose((FILE *)wfileid)==EOF); |
|
|
open-file c_addr u ntype -- w2 wior file open_file |
open-file c_addr u ntype -- wfileid wior file open_file |
w2 = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[ntype]); |
wfileid = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[ntype]); |
wior = IOR(w2 == 0); |
#if defined(GO32) && defined(MSDOS) |
|
if(wfileid && !(ntype & 1)) |
|
setbuf((FILE*)wfileid, NULL); |
|
#endif |
|
wior = IOR(wfileid == 0); |
|
|
create-file c_addr u ntype -- w2 wior file create_file |
create-file c_addr u ntype -- wfileid wior file create_file |
Cell fd; |
Cell fd; |
fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[ntype], 0666); |
fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[ntype], 0666); |
if (fd != -1) { |
if (fd != -1) { |
w2 = (Cell)fdopen(fd, fileattr[ntype]); |
wfileid = (Cell)fdopen(fd, fileattr[ntype]); |
wior = IOR(w2 == 0); |
#if defined(GO32) && defined(MSDOS) |
|
if(wfileid && !(ntype & 1)) |
|
setbuf((FILE*)wfileid, NULL); |
|
#endif |
|
wior = IOR(wfileid == 0); |
} else { |
} else { |
w2 = 0; |
wfileid = 0; |
wior = IOR(1); |
wior = IOR(1); |
} |
} |
|
|
Line 1517 delete-file c_addr u -- wior file delet
|
Line 1572 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 @var{c_addr1 u1} to new name @var{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 1529 reposition-file ud wfileid -- wior file
|
Line 1585 reposition-file ud wfileid -- wior file
|
wior = IOR(fseek((FILE *)wfileid, UD2LONG(ud), SEEK_SET)==-1); |
wior = IOR(fseek((FILE *)wfileid, UD2LONG(ud), SEEK_SET)==-1); |
|
|
file-size wfileid -- ud wior file file_size |
file-size wfileid -- ud wior file file_size |
#include <sys/stat.h> |
|
struct stat buf; |
struct stat buf; |
wior = IOR(fstat(fileno((FILE *)wfileid), &buf)==-1); |
wior = IOR(fstat(fileno((FILE *)wfileid), &buf)==-1); |
ud = LONG2UD(buf.st_size); |
ud = LONG2UD(buf.st_size); |
Line 1574 else {
|
Line 1629 else {
|
u2=0; |
u2=0; |
} |
} |
|
|
\+[THEN] has? file [IF] -1 [ELSE] has? os [THEN] [IF] |
\+ |
|
\+file |
|
|
write-file c_addr u1 wfileid -- wior file write_file |
write-file c_addr u1 wfileid -- wior file write_file |
/* !! fwrite does not guarantee enough */ |
/* !! fwrite does not guarantee enough */ |
Line 1585 write-file c_addr u1 wfileid -- wior fil
|
Line 1641 write-file c_addr u1 wfileid -- wior fil
|
clearerr((FILE *)wfileid); |
clearerr((FILE *)wfileid); |
} |
} |
|
|
|
\+ |
|
|
emit-file c wfileid -- wior gforth emit_file |
emit-file c wfileid -- wior gforth emit_file |
|
#ifdef HAS_FILE |
wior = FILEIO(putc(c, (FILE *)wfileid)==EOF); |
wior = FILEIO(putc(c, (FILE *)wfileid)==EOF); |
if (wior) |
if (wior) |
clearerr((FILE *)wfileid); |
clearerr((FILE *)wfileid); |
|
#else |
|
putc(c, stdout); |
|
#endif |
|
|
\+[THEN] has? file [IF] |
\+file |
|
|
flush-file wfileid -- wior file-ext flush_file |
flush-file wfileid -- wior file-ext flush_file |
wior = IOR(fflush((FILE *) wfileid)==EOF); |
wior = IOR(fflush((FILE *) wfileid)==EOF); |
Line 1619 else {
|
Line 1681 else {
|
wior=0; |
wior=0; |
} |
} |
|
|
\+[THEN] ( has? file ) has? floating [IF] |
\+ |
|
\+floating |
|
|
comparisons(f, r1 r2, f_, r1, r2, gforth, gforth, float, gforth) |
comparisons(f, r1 r2, f_, r1, r2, gforth, gforth, float, gforth) |
comparisons(f0, r, f_zero_, r, 0., float, gforth, float, gforth) |
comparisons(f0, r, f_zero_, r, 0., float, gforth, float, gforth) |
Line 1634 r = d;
|
Line 1697 r = d;
|
|
|
f>d r -- d float f_to_d |
f>d r -- d float f_to_d |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LONG_LONG |
d.hi = ldexp(r,-CELL_BITS) - (r<0); |
d.hi = ldexp(r,-(int)(CELL_BITS)) - (r<0); |
d.lo = r-ldexp((Float)d.hi,CELL_BITS); |
d.lo = r-ldexp((Float)d.hi,CELL_BITS); |
#else |
#else |
d = r; |
d = r; |
Line 1687 f/ r1 r2 -- r3 float f_slash
|
Line 1750 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 1714 floats n1 -- n2 float
|
Line 1777 floats n1 -- n2 float
|
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 1747 int decpt;
|
Line 1810 int decpt;
|
sig=ecvt(r, u, &decpt, &flag); |
sig=ecvt(r, u, &decpt, &flag); |
n=(r==0 ? 1 : decpt); |
n=(r==0 ? 1 : decpt); |
f1=FLAG(flag!=0); |
f1=FLAG(flag!=0); |
f2=FLAG(isdigit(sig[0])!=0); |
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 @var{c-addr u} to |
|
internal floating-point representation. If the string |
|
represents a valid floating-point number @var{r} is placed |
|
on the floating-point stack and @var{flag} is true. Otherwise, |
|
@var{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); |
char *endconv; |
char *endconv; |
while(isspace(number[--u]) && u>0); |
while(isspace((unsigned)(number[--u])) && u>0); |
switch(number[u]) |
switch(number[u]) |
{ |
{ |
case 'd': |
case 'd': |
Line 1797 fatan r1 -- r2 float-ext
|
Line 1866 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 1837 r2 = log(r1+1.);
|
Line 1906 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 1914 df_addr = (DFloat *)((((Cell)c_addr)+(si
|
Line 1983 df_addr = (DFloat *)((((Cell)c_addr)+(si
|
\ INDIRECT-THREADED, TOS-CACHED, FTOS-CACHED, CODEFIELD-DOES */ |
\ INDIRECT-THREADED, TOS-CACHED, FTOS-CACHED, CODEFIELD-DOES */ |
|
|
\ local variable implementation primitives |
\ local variable implementation primitives |
\+[THEN] ( has? floats ) has? glocals [IF] |
\+ |
|
\+glocals |
|
|
@local# -- w gforth fetch_local_number |
@local# -- w gforth fetch_local_number |
w = *(Cell *)(lp+(Cell)NEXT_INST); |
w = *(Cell *)(lp+(Cell)NEXT_INST); |
Line 1932 w = *(Cell *)(lp+2*sizeof(Cell));
|
Line 2002 w = *(Cell *)(lp+2*sizeof(Cell));
|
@local3 -- w new fetch_local_twelve |
@local3 -- w new fetch_local_twelve |
w = *(Cell *)(lp+3*sizeof(Cell)); |
w = *(Cell *)(lp+3*sizeof(Cell)); |
|
|
\+has? floating [IF] |
\+floating |
|
|
f@local# -- r gforth f_fetch_local_number |
f@local# -- r gforth f_fetch_local_number |
r = *(Float *)(lp+(Cell)NEXT_INST); |
r = *(Float *)(lp+(Cell)NEXT_INST); |
Line 1944 r = *(Float *)(lp+0*sizeof(Float));
|
Line 2014 r = *(Float *)(lp+0*sizeof(Float));
|
f@local1 -- r new f_fetch_local_eight |
f@local1 -- r new f_fetch_local_eight |
r = *(Float *)(lp+1*sizeof(Float)); |
r = *(Float *)(lp+1*sizeof(Float)); |
|
|
\+[THEN] |
\+ |
|
|
laddr# -- c_addr gforth laddr_number |
laddr# -- c_addr gforth laddr_number |
/* this can also be used to implement lp@ */ |
/* this can also be used to implement lp@ */ |
Line 1974 lp = (Address)c_addr;
|
Line 2044 lp = (Address)c_addr;
|
lp -= sizeof(Cell); |
lp -= sizeof(Cell); |
*(Cell *)lp = w; |
*(Cell *)lp = w; |
|
|
\+has? floating [IF] |
\+floating |
|
|
f>l r -- gforth f_to_l |
f>l r -- gforth f_to_l |
lp -= sizeof(Float); |
lp -= sizeof(Float); |
Line 1985 r = fp[u+1]; /* +1, because update of fp
|
Line 2055 r = fp[u+1]; /* +1, because update of fp
|
: |
: |
floats fp@ + f@ ; |
floats fp@ + f@ ; |
|
|
\+[THEN] [THEN] \ has? glocals |
\+ |
|
\+ |
|
|
\+has? OS [IF] |
\+OS |
|
|
define(`uploop', |
define(`uploop', |
`pushdef(`$1', `$2')_uploop(`$1', `$2', `$3', `$4', `$5')`'popdef(`$1')') |
`pushdef(`$1', `$2')_uploop(`$1', `$2', `$3', `$4', `$5')`'popdef(`$1')') |
Line 2026 open-lib c_addr1 u1 -- u2 gforth open_li
|
Line 2097 open-lib c_addr1 u1 -- u2 gforth open_li
|
#endif |
#endif |
u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY); |
u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY); |
#else |
#else |
# ifdef HAVE_LIBKERNEL32 |
# ifdef _WIN32 |
u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1)); |
u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1)); |
# else |
# else |
#warning Define open-lib! |
#warning Define open-lib! |
Line 2038 lib-sym c_addr1 u1 u2 -- u3 gforth lib_s
|
Line 2109 lib-sym c_addr1 u1 u2 -- u3 gforth lib_s
|
#if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
#if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1)); |
u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1)); |
#else |
#else |
# ifdef HAVE_LIBKERNEL32 |
# ifdef _WIN32 |
u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1)); |
u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1)); |
# else |
# else |
#warning Define lib-sym! |
#warning Define lib-sym! |
Line 2051 icall(20)
|
Line 2122 icall(20)
|
uploop(i, 0, 7, `fcall(i)') |
uploop(i, 0, 7, `fcall(i)') |
fcall(20) |
fcall(20) |
|
|
\+[THEN] \ has? OS |
\+ |
|
|
up! a_addr -- gforth up_store |
up! a_addr -- gforth up_store |
UP=up=(char *)a_addr; |
UP=up=(char *)a_addr; |
: |
: |
up ! ; |
up ! ; |
Variable UP |
Variable UP |
|
|