| \ Gforth primitives |
\ Gforth primitives |
| |
|
| \ Copyright (C) 1995,1996,1997,1998,2000,2003,2004 Free Software Foundation, Inc. |
\ Copyright (C) 1995,1996,1997,1998,2000,2003,2004,2005,2006 Free Software Foundation, Inc. |
| |
|
| \ This file is part of Gforth. |
\ This file is part of Gforth. |
| |
|
| a_retaddr = next_code; |
a_retaddr = next_code; |
| a_body = PFA(CFA); |
a_body = PFA(CFA); |
| INST_TAIL; |
INST_TAIL; |
| |
#ifdef DEBUG |
| |
fprintf(stderr, "dodoes to %x, push %x\n", a_retaddr, a_body); |
| |
#endif |
| goto **(Label *)DOES_CODE1(CFA); |
goto **(Label *)DOES_CODE1(CFA); |
| #else /* !defined(NO_IP) */ |
#else /* !defined(NO_IP) */ |
| a_retaddr = (Cell *)IP; |
a_retaddr = (Cell *)IP; |
| a_body = PFA(CFA); |
a_body = PFA(CFA); |
| |
#ifdef DEBUG |
| |
fprintf(stderr, "dodoes to %x, push %x\n", a_retaddr, a_body); |
| |
#endif |
| SET_IP(DOES_CODE1(CFA)); |
SET_IP(DOES_CODE1(CFA)); |
| #endif /* !defined(NO_IP) */ |
#endif /* !defined(NO_IP) */ |
| |
|
| |
|
| execute ( xt -- ) core |
execute ( xt -- ) core |
| ""Perform the semantics represented by the execution token, @i{xt}."" |
""Perform the semantics represented by the execution token, @i{xt}."" |
| |
#ifdef DEBUG |
| |
fprintf(stderr, "execute %08x\n", xt); |
| |
#endif |
| #ifndef NO_IP |
#ifndef NO_IP |
| ip=IP; |
ip=IP; |
| #endif |
#endif |
| |
|
| \ condbranch(forthname,stackeffect,restline,code1,code2,forthcode) |
\ condbranch(forthname,stackeffect,restline,code1,code2,forthcode) |
| \ 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 |
| \ condbranch(forthname,stackeffect,restline,code1,code2,forthcode) |
|
| \ this is non-syntactical: code must open a brace that is closed by the macro |
|
| define(condbranch, |
define(condbranch, |
| $1 ( `#'a_target $2 ) $3 |
$1 ( `#'a_target $2 ) $3 |
| $4 #ifdef NO_IP |
$4 #ifdef NO_IP |
| JUMP(a_target); |
JUMP(a_target); |
| #else |
#else |
| SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
| |
ifelse(condbranch_opt,`1',`INST_TAIL; NEXT_P2;',`/* condbranch_opt=0 */') |
| #endif |
#endif |
| } |
} |
| |
ifelse(condbranch_opt,`1',`SUPER_CONTINUE;',`/* condbranch_opt=0 */') |
| $6 |
$6 |
| |
|
| \+glocals |
\+glocals |
| JUMP(a_target); |
JUMP(a_target); |
| #else |
#else |
| SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
| |
ifelse(condbranch_opt,`1',`INST_TAIL; NEXT_P2;',`/* condbranch_opt=0 */') |
| #endif |
#endif |
| } |
} |
| |
ifelse(condbranch_opt,`1',`SUPER_CONTINUE;',`/* condbranch_opt=0 */') |
| \+ |
|
| ) |
|
| |
|
| \ version that generates two jumps (not good for PR 15242 workaround) |
|
| define(condbranch_twojump, |
|
| $1 ( `#'a_target $2 ) $3 |
|
| $4 #ifdef NO_IP |
|
| INST_TAIL; |
|
| #endif |
|
| $5 #ifdef NO_IP |
|
| JUMP(a_target); |
|
| #else |
|
| SET_IP((Xt *)a_target); |
|
| INST_TAIL; NEXT_P2; |
|
| #endif |
|
| } |
|
| SUPER_CONTINUE; |
|
| $6 |
|
| |
|
| \+glocals |
|
| |
|
| $1-lp+!`#' ( `#'a_target `#'nlocals $2 ) $3_lp_plus_store_number |
|
| $4 #ifdef NO_IP |
|
| INST_TAIL; |
|
| #endif |
|
| $5 lp += nlocals; |
|
| #ifdef NO_IP |
|
| JUMP(a_target); |
|
| #else |
|
| SET_IP((Xt *)a_target); |
|
| INST_TAIL; NEXT_P2; |
|
| #endif |
|
| } |
|
| SUPER_CONTINUE; |
|
| |
|
| \+ |
\+ |
| ) |
) |
| JUMP(a_target); |
JUMP(a_target); |
| #else |
#else |
| SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
| INST_TAIL; NEXT_P2; |
|
| #endif |
#endif |
| } |
} else { |
| sp--; |
sp--; |
| sp[0]=f; |
sp[0]=f; |
| SUPER_CONTINUE; |
} |
| |
|
| ?dup-0=-?branch ( #a_target f -- S:... ) new question_dupe_zero_equals_question_branch |
?dup-0=-?branch ( #a_target f -- S:... ) new question_dupe_zero_equals_question_branch |
| ""The run-time procedure compiled by @code{?DUP-0=-IF}."" |
""The run-time procedure compiled by @code{?DUP-0=-IF}."" |
| JUMP(a_target); |
JUMP(a_target); |
| #else |
#else |
| SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
| NEXT; |
|
| #endif |
#endif |
| } |
} |
| SUPER_CONTINUE; |
|
| |
|
| \+ |
\+ |
| \fhas? skiploopprims 0= [IF] |
\fhas? skiploopprims 0= [IF] |
| r> r> r> dup itmp ! >r >r >r itmp @ ; |
r> r> r> dup itmp ! >r >r >r itmp @ ; |
| variable itmp |
variable itmp |
| |
|
| j ( R:n R:d1 -- n R:n R:d1 ) core |
j ( R:w R:w1 R:w2 -- w R:w R:w1 R:w2 ) core |
| : |
: |
| \ rp@ cell+ cell+ cell+ @ ; |
\ rp@ cell+ cell+ cell+ @ ; |
| r> r> r> r> dup itmp ! >r >r >r >r itmp @ ; |
r> r> r> r> dup itmp ! >r >r >r >r itmp @ ; |
| [IFUNDEF] itmp variable itmp [THEN] |
[IFUNDEF] itmp variable itmp [THEN] |
| |
|
| k ( R:n R:d1 R:d2 -- n R:n R:d1 R:d2 ) gforth |
k ( R:w R:w1 R:w2 R:w3 R:w4 -- w R:w R:w1 R:w2 R:w3 R:w4 ) gforth |
| : |
: |
| \ rp@ [ 5 cells ] Literal + @ ; |
\ rp@ [ 5 cells ] Literal + @ ; |
| 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 @ ; |
| : |
: |
| dup [char] a - [ char z char a - 1 + ] Literal u< bl and - ; |
dup [char] a - [ char z char a - 1 + ] Literal u< bl and - ; |
| |
|
| |
capscompare ( c_addr1 u1 c_addr2 u2 -- n ) string |
| |
""Compare two strings lexicographically. If they are equal, @i{n} is 0; if |
| |
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 |
| |
comparison. In the future, this may change to consider the current |
| |
locale and its collation order."" |
| |
/* close ' to keep fontify happy */ |
| |
n = capscompare(c_addr1, u1, c_addr2, u2); |
| |
|
| /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} |
""Adjust the string specified by @i{c-addr1, u1} to remove @i{n} |
| characters from the start of the string."" |
characters from the start of the string."" |
| \ lit+ / lit_plus = lit + |
\ lit+ / lit_plus = lit + |
| |
|
| lit+ ( n1 #n2 -- n ) new lit_plus |
lit+ ( n1 #n2 -- n ) new lit_plus |
| |
#ifdef DEBUG |
| |
fprintf(stderr, "lit+ %08x\n", n2); |
| |
#endif |
| n=n1+n2; |
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 |
| |
|
| / ( n1 n2 -- n ) core slash |
/ ( n1 n2 -- n ) core slash |
| n = n1/n2; |
n = n1/n2; |
| if(FLOORED_DIV && ((n1^n2) < 0) && (n1%n2 != 0)) n--; |
if (CHECK_DIVISION_SW && n2 == 0) |
| |
throw(BALL_DIVZERO); |
| |
if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN) |
| |
throw(BALL_RESULTRANGE); |
| |
if (FLOORED_DIV && ((n1^n2) < 0) && (n1%n2 != 0)) |
| |
n--; |
| : |
: |
| /mod nip ; |
/mod nip ; |
| |
|
| mod ( n1 n2 -- n ) core |
mod ( n1 n2 -- n ) core |
| n = n1%n2; |
n = n1%n2; |
| |
if (CHECK_DIVISION_SW && n2 == 0) |
| |
throw(BALL_DIVZERO); |
| |
if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN) |
| |
throw(BALL_RESULTRANGE); |
| if(FLOORED_DIV && ((n1^n2) < 0) && n!=0) n += n2; |
if(FLOORED_DIV && ((n1^n2) < 0) && n!=0) n += n2; |
| : |
: |
| /mod drop ; |
/mod drop ; |
| /mod ( n1 n2 -- n3 n4 ) core slash_mod |
/mod ( n1 n2 -- n3 n4 ) core slash_mod |
| n4 = n1/n2; |
n4 = n1/n2; |
| n3 = n1%n2; /* !! is this correct? look into C standard! */ |
n3 = n1%n2; /* !! is this correct? look into C standard! */ |
| |
if (CHECK_DIVISION_SW && n2 == 0) |
| |
throw(BALL_DIVZERO); |
| |
if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN) |
| |
throw(BALL_RESULTRANGE); |
| if (FLOORED_DIV && ((n1^n2) < 0) && n3!=0) { |
if (FLOORED_DIV && ((n1^n2) < 0) && n3!=0) { |
| n4--; |
n4--; |
| n3+=n2; |
n3+=n2; |
| #else |
#else |
| DCell d = (DCell)n1 * (DCell)n2; |
DCell d = (DCell)n1 * (DCell)n2; |
| #endif |
#endif |
| #ifdef BUGGY_LL_DIV |
#ifdef ASM_SM_SLASH_REM |
| DCell r = fmdiv(d,n3); |
ASM_SM_SLASH_REM(DLO(d), DHI(d), n3, n4, n5); |
| n4=DHI(r); |
|
| n5=DLO(r); |
|
| #else |
|
| /* assumes that the processor uses either floored or symmetric division */ |
|
| n5 = d/n3; |
|
| n4 = d%n3; |
|
| if (FLOORED_DIV && ((DHI(d)^n3)<0) && n4!=0) { |
if (FLOORED_DIV && ((DHI(d)^n3)<0) && n4!=0) { |
| |
if (CHECK_DIVISION && n5 == CELL_MIN) |
| |
throw(BALL_RESULTRANGE); |
| n5--; |
n5--; |
| n4+=n3; |
n4+=n3; |
| } |
} |
| |
#else |
| |
DCell r = FLOORED_DIV ? fmdiv(d,n3) : smdiv(d,n3); |
| |
n4=DHI(r); |
| |
n5=DLO(r); |
| #endif |
#endif |
| : |
: |
| >r m* r> fm/mod ; |
>r m* r> fm/mod ; |
| #else |
#else |
| DCell d = (DCell)n1 * (DCell)n2; |
DCell d = (DCell)n1 * (DCell)n2; |
| #endif |
#endif |
| #ifdef BUGGY_LL_DIV |
#ifdef ASM_SM_SLASH_REM |
| DCell r = fmdiv(d,n3); |
Cell remainder; |
| n4=DLO(r); |
ASM_SM_SLASH_REM(DLO(d), DHI(d), n3, remainder, n4); |
| |
if (FLOORED_DIV && ((DHI(d)^n3)<0) && remainder!=0) { |
| |
if (CHECK_DIVISION && n4 == CELL_MIN) |
| |
throw(BALL_RESULTRANGE); |
| |
n4--; |
| |
} |
| #else |
#else |
| /* assumes that the processor uses either floored or symmetric division */ |
DCell r = FLOORED_DIV ? fmdiv(d,n3) : smdiv(d,n3); |
| n4 = d/n3; |
n4=DLO(r); |
| if (FLOORED_DIV && ((DHI(d)^n3)<0) && (d%n3)!=0) n4--; |
|
| #endif |
#endif |
| : |
: |
| */mod nip ; |
*/mod nip ; |
| n2 = n1>>1; |
n2 = n1>>1; |
| : |
: |
| dup MINI and IF 1 ELSE 0 THEN |
dup MINI and IF 1 ELSE 0 THEN |
| [ bits/byte cell * 1- ] literal |
[ bits/char cell * 1- ] literal |
| 0 DO 2* swap dup 2* >r MINI and |
0 DO 2* swap dup 2* >r MINI and |
| IF 1 ELSE 0 THEN or r> swap |
IF 1 ELSE 0 THEN or r> swap |
| 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: @i{d1} = @i{n3}*@i{n1}+@i{n2}, @i{n1}>@i{n2}>=0 or 0>=@i{n2}>@i{n1}."" |
""Floored division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, @i{n1}>@i{n2}>=0 or 0>=@i{n2}>@i{n1}."" |
| #ifdef BUGGY_LL_DIV |
|
| #ifdef ASM_SM_SLASH_REM |
#ifdef ASM_SM_SLASH_REM |
| ASM_SM_SLASH_REM(d1.lo, d1.hi, n1, n2, n3); |
ASM_SM_SLASH_REM(DLO(d1), DHI(d1), n1, n2, n3); |
| if (((DHI(d1)^n1)<0) && n2!=0) { |
if (((DHI(d1)^n1)<0) && n2!=0) { |
| |
if (CHECK_DIVISION && n3 == CELL_MIN) |
| |
throw(BALL_RESULTRANGE); |
| n3--; |
n3--; |
| n2+=n1; |
n2+=n1; |
| } |
} |
| n2=DHI(r); |
n2=DHI(r); |
| n3=DLO(r); |
n3=DLO(r); |
| #endif /* !defined(ASM_SM_SLASH_REM) */ |
#endif /* !defined(ASM_SM_SLASH_REM) */ |
| #else |
|
| #ifdef ASM_SM_SLASH_REM4 |
|
| ASM_SM_SLASH_REM4(d1, n1, n2, n3); |
|
| if (((DHI(d1)^n1)<0) && n2!=0) { |
|
| n3--; |
|
| n2+=n1; |
|
| } |
|
| #else /* !defined(ASM_SM_SLASH_REM4) */ |
|
| /* assumes that the processor uses either floored or symmetric division */ |
|
| n3 = d1/n1; |
|
| n2 = d1%n1; |
|
| /* note that this 1%-3>0 is optimized by the compiler */ |
|
| if (1%-3>0 && ((DHI(d1)^n1)<0) && n2!=0) { |
|
| n3--; |
|
| n2+=n1; |
|
| } |
|
| #endif /* !defined(ASM_SM_SLASH_REM4) */ |
|
| #endif |
|
| : |
: |
| dup >r dup 0< IF negate >r dnegate r> THEN |
dup >r dup 0< IF negate >r dnegate r> THEN |
| over 0< IF tuck + swap THEN |
over 0< IF tuck + 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: @i{d1} = @i{n3}*@i{n1}+@i{n2}, sign(@i{n2})=sign(@i{d1}) or 0."" |
""Symmetric division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, sign(@i{n2})=sign(@i{d1}) or 0."" |
| #ifdef BUGGY_LL_DIV |
|
| #ifdef ASM_SM_SLASH_REM |
#ifdef ASM_SM_SLASH_REM |
| ASM_SM_SLASH_REM(d1.lo, d1.hi, n1, n2, n3); |
ASM_SM_SLASH_REM(DLO(d1), DHI(d1), n1, n2, n3); |
| #else /* !defined(ASM_SM_SLASH_REM) */ |
#else /* !defined(ASM_SM_SLASH_REM) */ |
| DCell r = smdiv(d1,n1); |
DCell r = smdiv(d1,n1); |
| n2=DHI(r); |
n2=DHI(r); |
| n3=DLO(r); |
n3=DLO(r); |
| #endif /* !defined(ASM_SM_SLASH_REM) */ |
#endif /* !defined(ASM_SM_SLASH_REM) */ |
| #else |
|
| #ifdef ASM_SM_SLASH_REM4 |
|
| ASM_SM_SLASH_REM4(d1, n1, n2, n3); |
|
| #else /* !defined(ASM_SM_SLASH_REM4) */ |
|
| /* assumes that the processor uses either floored or symmetric division */ |
|
| n3 = d1/n1; |
|
| n2 = d1%n1; |
|
| /* note that this 1%-3<0 is optimized by the compiler */ |
|
| if (1%-3<0 && ((DHI(d1)^n1)<0) && n2!=0) { |
|
| n3++; |
|
| n2-=n1; |
|
| } |
|
| #endif /* !defined(ASM_SM_SLASH_REM4) */ |
|
| #endif |
|
| : |
: |
| over >r dup >r abs -rot |
over >r dup >r abs -rot |
| dabs rot um/mod |
dabs rot um/mod |
| |
|
| 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"" |
""ud=u3*u1+u2, u1>u2>=0"" |
| #ifdef BUGGY_LL_DIV |
|
| #ifdef ASM_UM_SLASH_MOD |
#ifdef ASM_UM_SLASH_MOD |
| ASM_UM_SLASH_MOD(ud.lo, ud.hi, u1, u2, u3); |
ASM_UM_SLASH_MOD(DLO(ud), DHI(ud), u1, u2, u3); |
| #else /* !defined(ASM_UM_SLASH_MOD) */ |
#else /* !defined(ASM_UM_SLASH_MOD) */ |
| UDCell r = umdiv(ud,u1); |
UDCell r = umdiv(ud,u1); |
| u2=DHI(r); |
u2=DHI(r); |
| u3=DLO(r); |
u3=DLO(r); |
| #endif /* !defined(ASM_UM_SLASH_MOD) */ |
#endif /* !defined(ASM_UM_SLASH_MOD) */ |
| #else |
|
| #ifdef ASM_UM_SLASH_MOD4 |
|
| ASM_UM_SLASH_MOD4(ud, u1, u2, u3); |
|
| #else /* !defined(ASM_UM_SLASH_MOD4) */ |
|
| u3 = ud/u1; |
|
| u2 = ud%u1; |
|
| #endif /* !defined(ASM_UM_SLASH_MOD4) */ |
|
| #endif |
|
| : |
: |
| 0 swap [ 8 cells 1 + ] literal 0 |
0 swap [ 8 cells 1 + ] literal 0 |
| ?DO /modstep |
?DO /modstep |
| |
|
| d2* ( d1 -- d2 ) double d_two_star |
d2* ( d1 -- d2 ) double d_two_star |
| ""Shift left by 1; also works on unsigned numbers"" |
""Shift left by 1; also works on unsigned numbers"" |
| #ifdef BUGGY_LL_SHIFT |
d2 = DLSHIFT(d1,1); |
| DLO_IS(d2, DLO(d1)<<1); |
|
| DHI_IS(d2, (DHI(d1)<<1) | (DLO(d1)>>(CELL_BITS-1))); |
|
| #else |
|
| d2 = 2*d1; |
|
| #endif |
|
| : |
: |
| 2dup d+ ; |
2dup d+ ; |
| |
|
| a_addr = (Cell *)(up+u); |
a_addr = (Cell *)(up+u); |
| |
|
| up! ( a_addr -- ) gforth up_store |
up! ( a_addr -- ) gforth up_store |
| UP=up=(char *)a_addr; |
gforth_UP=up=(Address)a_addr; |
| : |
: |
| up ! ; |
up ! ; |
| Variable UP |
Variable UP |
| memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
| break; |
break; |
| f83name2=f83name1; |
f83name2=f83name1; |
| |
#ifdef DEBUG |
| |
fprintf(stderr, "F83find "); |
| |
fwrite(c_addr, u, 1, stderr); |
| |
fprintf(stderr, " found %08x\n", f83name2); |
| |
#endif |
| : |
: |
| BEGIN dup WHILE (find-samelen) dup WHILE |
BEGIN dup WHILE (find-samelen) dup WHILE |
| >r 2dup r@ cell+ char+ capscomp 0= |
>r 2dup r@ cell+ char+ capscomp 0= |
| |
|
| \g hostos |
\g hostos |
| |
|
| key-file ( wfileid -- n ) gforth paren_key_file |
key-file ( wfileid -- c ) gforth paren_key_file |
| |
""Read one character @i{c} from @i{wfileid}. This word disables |
| |
buffering for @i{wfileid}. If you want to read characters from a |
| |
terminal in non-canonical (raw) mode, you have to put the terminal in |
| |
non-canonical mode yourself (using the C interface); the exception is |
| |
@code{stdin}: Gforth automatically puts it into non-canonical mode."" |
| #ifdef HAS_FILE |
#ifdef HAS_FILE |
| fflush(stdout); |
fflush(stdout); |
| n = key((FILE*)wfileid); |
c = key((FILE*)wfileid); |
| #else |
#else |
| n = key(stdin); |
c = key(stdin); |
| #endif |
#endif |
| |
|
| key?-file ( wfileid -- n ) facility key_q_file |
key?-file ( wfileid -- f ) gforth key_q_file |
| |
""@i{f} is true if at least one character can be read from @i{wfileid} |
| |
without blocking. If you also want to use @code{read-file} or |
| |
@code{read-line} on the file, you have to call @code{key?-file} or |
| |
@code{key-file} first (these two words disable buffering)."" |
| #ifdef HAS_FILE |
#ifdef HAS_FILE |
| fflush(stdout); |
fflush(stdout); |
| n = key_query((FILE*)wfileid); |
f = key_query((FILE*)wfileid); |
| #else |
#else |
| n = key_query(stdin); |
f = key_query(stdin); |
| #endif |
#endif |
| |
|
| \+os |
|
| |
|
| stdin ( -- wfileid ) gforth |
stdin ( -- wfileid ) gforth |
| |
""The standard input file of the Gforth process."" |
| wfileid = (Cell)stdin; |
wfileid = (Cell)stdin; |
| |
|
| stdout ( -- wfileid ) gforth |
stdout ( -- wfileid ) gforth |
| |
""The standard output file of the Gforth process."" |
| wfileid = (Cell)stdout; |
wfileid = (Cell)stdout; |
| |
|
| stderr ( -- wfileid ) gforth |
stderr ( -- wfileid ) gforth |
| |
""The standard error output file of the Gforth process."" |
| wfileid = (Cell)stderr; |
wfileid = (Cell)stderr; |
| |
|
| |
\+os |
| |
|
| form ( -- urows ucols ) gforth |
form ( -- urows ucols ) gforth |
| ""The number of lines and columns in the terminal. These numbers may change |
""The number of lines and columns in the terminal. These numbers may |
| with the window size."" |
change with the window size. Note that it depends on the OS whether |
| |
this reflects the actual size and changes with the window size |
| |
(currently only on Unix-like OSs). On other OSs you just get a |
| |
default, and can tell Gforth the terminal size by setting the |
| |
environment variables @code{COLUMNS} and @code{LINES} before starting |
| |
Gforth."" |
| /* we could block SIGWINCH here to get a consistent size, but I don't |
/* we could block SIGWINCH here to get a consistent size, but I don't |
| think this is necessary or always beneficial */ |
think this is necessary or always beneficial */ |
| urows=rows; |
urows=rows; |
| ucols=cols; |
ucols=cols; |
| |
|
| |
wcwidth ( u -- n ) gforth |
| |
""The number of fixed-width characters per unicode character u"" |
| |
n = wcwidth(u); |
| |
|
| 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 @i{c-addr} and @i{u} bytes |
one) does not contain stale data at @i{c-addr} and @i{u} bytes |
| environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters |
environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters |
| in length."" |
in length."" |
| /* close ' to keep fontify happy */ |
/* close ' to keep fontify happy */ |
| c_addr2 = getenv(cstr(c_addr1,u1,1)); |
c_addr2 = (Char *)getenv(cstr(c_addr1,u1,1)); |
| u2 = (c_addr2 == NULL ? 0 : strlen(c_addr2)); |
u2 = (c_addr2 == NULL ? 0 : strlen((char *)c_addr2)); |
| |
|
| open-pipe ( c_addr u wfam -- wfileid wior ) gforth open_pipe |
open-pipe ( c_addr u wfam -- wfileid wior ) gforth open_pipe |
| wfileid=(Cell)popen(cstr(c_addr,u,1),pfileattr[wfam]); /* ~ expansion of 1st arg? */ |
wfileid=(Cell)popen(cstr(c_addr,u,1),pfileattr[wfam]); /* ~ expansion of 1st arg? */ |
| nmin =ltime->tm_min; |
nmin =ltime->tm_min; |
| nsec =ltime->tm_sec; |
nsec =ltime->tm_sec; |
| |
|
| ms ( n -- ) facility-ext |
ms ( u -- ) facility-ext |
| ""Wait at least @i{n} milli-second."" |
""Wait at least @i{n} milli-second."" |
| struct timeval timeout; |
gforth_ms(u); |
| timeout.tv_sec=n/1000; |
|
| timeout.tv_usec=1000*(n%1000); |
|
| (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 |
""Allocate @i{u} address units of contiguous data space. The initial |
| wior = IOR(a_addr2==NULL); /* !! Define a return code */ |
wior = IOR(a_addr2==NULL); /* !! Define a return code */ |
| |
|
| strerror ( n -- c_addr u ) gforth |
strerror ( n -- c_addr u ) gforth |
| c_addr = strerror(n); |
c_addr = (Char *)strerror(n); |
| u = strlen(c_addr); |
u = strlen((char *)c_addr); |
| |
|
| strsignal ( n -- c_addr u ) gforth |
strsignal ( n -- c_addr u ) gforth |
| c_addr = (Address)strsignal(n); |
c_addr = (Char *)strsignal(n); |
| u = strlen(c_addr); |
u = strlen((char *)c_addr); |
| |
|
| call-c ( ... w -- ... ) gforth call_c |
call-c ( ... w -- ... ) gforth call_c |
| ""Call the C function pointed to by @i{w}. The C function has to |
""Call the C function pointed to by @i{w}. The C function has to |
| access the stack itself. The stack pointers are exported in the global |
access the stack itself. The stack pointers are exported in the global |
| variables @code{SP} and @code{FP}."" |
variables @code{gforth_SP} and @code{gforth_FP}."" |
| /* This is a first attempt at support for calls to C. This may change in |
/* This is a first attempt at support for calls to C. This may change in |
| the future */ |
the future */ |
| FP=fp; |
gforth_FP=fp; |
| SP=sp; |
gforth_SP=sp; |
| ((void (*)())w)(); |
((void (*)())w)(); |
| sp=SP; |
sp=gforth_SP; |
| fp=FP; |
fp=gforth_FP; |
| |
|
| \+ |
\+ |
| \+file |
\+file |
| wior = IOR(fclose((FILE *)wfileid)==EOF); |
wior = IOR(fclose((FILE *)wfileid)==EOF); |
| |
|
| open-file ( c_addr u wfam -- wfileid wior ) file open_file |
open-file ( c_addr u wfam -- wfileid wior ) file open_file |
| wfileid = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[wfam]); |
wfileid = opencreate_file(tilde_cstr(c_addr,u,1), wfam, 0, &wior); |
| wior = IOR(wfileid == 0); |
|
| |
|
| create-file ( c_addr u wfam -- wfileid wior ) file create_file |
create-file ( c_addr u wfam -- wfileid wior ) file create_file |
| Cell fd; |
wfileid = opencreate_file(tilde_cstr(c_addr,u,1), wfam, O_CREAT|O_TRUNC, &wior); |
| fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[wfam], 0666); |
|
| if (fd != -1) { |
|
| wfileid = (Cell)fdopen(fd, fileattr[wfam]); |
|
| wior = IOR(wfileid == 0); |
|
| } else { |
|
| wfileid = 0; |
|
| wior = IOR(1); |
|
| } |
|
| |
|
| delete-file ( c_addr u -- wior ) file delete_file |
delete-file ( c_addr u -- wior ) file delete_file |
| wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1); |
wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1); |
| u2 = 0; |
u2 = 0; |
| flag = 0; |
flag = 0; |
| } else { |
} else { |
| u2 = strlen(dent->d_name); |
u2 = strlen((char *)dent->d_name); |
| if(u2 > u1) { |
if(u2 > u1) { |
| u2 = u1; |
u2 = u1; |
| wior = -512-ENAMETOOLONG; |
wior = -512-ENAMETOOLONG; |
| get-dir ( c_addr1 u1 -- c_addr2 u2 ) gforth get_dir |
get-dir ( c_addr1 u1 -- c_addr2 u2 ) gforth get_dir |
| ""Store the current directory in the buffer specified by @{c-addr1, u1}. |
""Store the current directory in the buffer specified by @{c-addr1, u1}. |
| If the buffer size is not sufficient, return 0 0"" |
If the buffer size is not sufficient, return 0 0"" |
| c_addr2 = getcwd(c_addr1, u1); |
c_addr2 = (Char *)getcwd((char *)c_addr1, u1); |
| if(c_addr2 != NULL) { |
if(c_addr2 != NULL) { |
| u2 = strlen(c_addr2); |
u2 = strlen((char *)c_addr2); |
| } else { |
} else { |
| u2 = 0; |
u2 = 0; |
| } |
} |
| '\r','\n' |
'\r','\n' |
| #endif |
#endif |
| }; |
}; |
| c_addr=newline; |
c_addr=(Char *)newline; |
| u=sizeof(newline); |
u=sizeof(newline); |
| : |
: |
| "newline count ; |
"newline count ; |
| 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) |
| |
|
| |
s>f ( n -- r ) float s_to_f |
| |
r = n; |
| |
|
| d>f ( d -- r ) float d_to_f |
d>f ( d -- r ) float d_to_f |
| #ifdef BUGGY_LL_D2F |
#ifdef BUGGY_LL_D2F |
| extern double ldexp(double x, int exp); |
extern double ldexp(double x, int exp); |
| extern DCell double2ll(Float r); |
extern DCell double2ll(Float r); |
| d = double2ll(r); |
d = double2ll(r); |
| |
|
| |
f>s ( r -- n ) float f_to_s |
| |
n = (Cell)r; |
| |
|
| f! ( r f_addr -- ) float f_store |
f! ( r f_addr -- ) float f_store |
| ""Store @i{r} into the float at address @i{f-addr}."" |
""Store @i{r} into the float at address @i{f-addr}."" |
| *f_addr = r; |
*f_addr = r; |
| ""@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); |
| |
|
| |
fm* ( r1 n -- r2 ) gforth fm_star |
| |
r2 = r1*n; |
| |
|
| |
fm/ ( r1 n -- r2 ) gforth fm_slash |
| |
r2 = r1/n; |
| |
|
| |
fm*/ ( r1 n1 n2 -- r2 ) gforth fm_star_slash |
| |
r2 = (r1*n1)/n2; |
| |
|
| |
f**2 ( r1 -- r2 ) gforth fm_square |
| |
r2 = r1*r1; |
| |
|
| fnegate ( r1 -- r2 ) float f_negate |
fnegate ( r1 -- r2 ) float f_negate |
| r2 = - r1; |
r2 = - r1; |
| |
|
| /* !! unclear wording */ |
/* !! unclear wording */ |
| r2 = floor(r1); |
r2 = floor(r1); |
| |
|
| fround ( r1 -- r2 ) gforth f_round |
fround ( r1 -- r2 ) float f_round |
| ""Round to the nearest integral value."" |
""Round to the nearest integral value."" |
| r2 = rint(r1); |
r2 = rint(r1); |
| |
|
| n=(r==0. ? 1 : decpt); |
n=(r==0. ? 1 : decpt); |
| f1=FLAG(flag!=0); |
f1=FLAG(flag!=0); |
| f2=FLAG(isdigit((unsigned)(sig[0]))!=0); |
f2=FLAG(isdigit((unsigned)(sig[0]))!=0); |
| siglen=strlen(sig); |
siglen=strlen((char *)sig); |
| if (siglen>u) /* happens in glibc-2.1.3 if 999.. is rounded up */ |
if (siglen>u) /* happens in glibc-2.1.3 if 999.. is rounded up */ |
| siglen=u; |
siglen=u; |
| if (!f2) /* workaround Cygwin trailing 0s for Inf and Nan */ |
if (!f2) /* workaround Cygwin trailing 0s for Inf and Nan */ |
| #endif |
#endif |
| |
|
| wcall ( ... u -- ... ) gforth |
wcall ( ... u -- ... ) gforth |
| FP=fp; |
gforth_FP=fp; |
| sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &FP); |
sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &gforth_FP); |
| fp=FP; |
fp=gforth_FP; |
| |
|
| |
uw@ ( c_addr -- u ) gforth u_w_fetch |
| |
""@i{u} is the zero-extended 16-bit value stored at @i{c_addr}."" |
| |
u = *(UWyde*)(c_addr); |
| |
|
| |
sw@ ( c_addr -- n ) gforth s_w_fetch |
| |
""@i{n} is the sign-extended 16-bit value stored at @i{c_addr}."" |
| |
n = *(Wyde*)(c_addr); |
| |
|
| |
w! ( w c_addr -- ) gforth w_store |
| |
""Store the bottom 16 bits of @i{w} at @i{c_addr}."" |
| |
*(Wyde*)(c_addr) = w; |
| |
|
| |
ul@ ( c_addr -- u ) gforth u_l_fetch |
| |
""@i{u} is the zero-extended 32-bit value stored at @i{c_addr}."" |
| |
u = *(UTetrabyte*)(c_addr); |
| |
|
| |
sl@ ( c_addr -- n ) gforth s_l_fetch |
| |
""@i{n} is the sign-extended 32-bit value stored at @i{c_addr}."" |
| |
n = *(Tetrabyte*)(c_addr); |
| |
|
| |
l! ( w c_addr -- ) gforth l_store |
| |
""Store the bottom 32 bits of @i{w} at @i{c_addr}."" |
| |
*(Tetrabyte*)(c_addr) = w; |
| |
|
| \+FFCALL |
\+FFCALL |
| |
|
| c_addr = prv; |
c_addr = prv; |
| |
|
| alloc-callback ( a_ip -- c_addr ) gforth alloc_callback |
alloc-callback ( a_ip -- c_addr ) gforth alloc_callback |
| c_addr = (char *)alloc_callback(engine_callback, (Xt *)a_ip); |
c_addr = (char *)alloc_callback(gforth_callback, (Xt *)a_ip); |
| |
|
| va-start-void ( -- ) gforth va_start_void |
va-start-void ( -- ) gforth va_start_void |
| va_start_void(clist); |
va_start_void(gforth_clist); |
| |
|
| va-start-int ( -- ) gforth va_start_int |
va-start-int ( -- ) gforth va_start_int |
| va_start_int(clist); |
va_start_int(gforth_clist); |
| |
|
| va-start-longlong ( -- ) gforth va_start_longlong |
va-start-longlong ( -- ) gforth va_start_longlong |
| va_start_longlong(clist); |
va_start_longlong(gforth_clist); |
| |
|
| va-start-ptr ( -- ) gforth va_start_ptr |
va-start-ptr ( -- ) gforth va_start_ptr |
| va_start_ptr(clist, (char *)); |
va_start_ptr(gforth_clist, (char *)); |
| |
|
| va-start-float ( -- ) gforth va_start_float |
va-start-float ( -- ) gforth va_start_float |
| va_start_float(clist); |
va_start_float(gforth_clist); |
| |
|
| va-start-double ( -- ) gforth va_start_double |
va-start-double ( -- ) gforth va_start_double |
| va_start_double(clist); |
va_start_double(gforth_clist); |
| |
|
| va-arg-int ( -- w ) gforth va_arg_int |
va-arg-int ( -- w ) gforth va_arg_int |
| w = va_arg_int(clist); |
w = va_arg_int(gforth_clist); |
| |
|
| va-arg-longlong ( -- d ) gforth va_arg_longlong |
va-arg-longlong ( -- d ) gforth va_arg_longlong |
| #ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LONG_LONG |
| DLO_IS(d, va_arg_longlong(clist)); |
DLO_IS(d, va_arg_longlong(gforth_clist)); |
| DHI_IS(d, 0); |
DHI_IS(d, 0); |
| #else |
#else |
| d = va_arg_longlong(clist); |
d = va_arg_longlong(gforth_clist); |
| #endif |
#endif |
| |
|
| va-arg-ptr ( -- c_addr ) gforth va_arg_ptr |
va-arg-ptr ( -- c_addr ) gforth va_arg_ptr |
| c_addr = (char *)va_arg_ptr(clist,char*); |
c_addr = (char *)va_arg_ptr(gforth_clist,char*); |
| |
|
| va-arg-float ( -- r ) gforth va_arg_float |
va-arg-float ( -- r ) gforth va_arg_float |
| r = va_arg_float(clist); |
r = va_arg_float(gforth_clist); |
| |
|
| va-arg-double ( -- r ) gforth va_arg_double |
va-arg-double ( -- r ) gforth va_arg_double |
| r = va_arg_double(clist); |
r = va_arg_double(gforth_clist); |
| |
|
| va-return-void ( -- ) gforth va_return_void |
va-return-void ( -- ) gforth va_return_void |
| va_return_void(clist); |
va_return_void(gforth_clist); |
| return 0; |
return 0; |
| |
|
| va-return-int ( w -- ) gforth va_return_int |
va-return-int ( w -- ) gforth va_return_int |
| va_return_int(clist, w); |
va_return_int(gforth_clist, w); |
| return 0; |
return 0; |
| |
|
| va-return-ptr ( c_addr -- ) gforth va_return_ptr |
va-return-ptr ( c_addr -- ) gforth va_return_ptr |
| va_return_ptr(clist, void *, c_addr); |
va_return_ptr(gforth_clist, void *, c_addr); |
| return 0; |
return 0; |
| |
|
| va-return-longlong ( d -- ) gforth va_return_longlong |
va-return-longlong ( d -- ) gforth va_return_longlong |
| #ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LONG_LONG |
| va_return_longlong(clist, d.lo); |
va_return_longlong(gforth_clist, d.lo); |
| #else |
#else |
| va_return_longlong(clist, d); |
va_return_longlong(gforth_clist, d); |
| #endif |
#endif |
| return 0; |
return 0; |
| |
|
| va-return-float ( r -- ) gforth va_return_float |
va-return-float ( r -- ) gforth va_return_float |
| va_return_float(clist, r); |
va_return_float(gforth_clist, r); |
| return 0; |
return 0; |
| |
|
| va-return-double ( r -- ) gforth va_return_double |
va-return-double ( r -- ) gforth va_return_double |
| va_return_double(clist, r); |
va_return_double(gforth_clist, r); |
| |
return 0; |
| |
|
| |
\+ |
| |
|
| |
\+LIBFFI |
| |
|
| |
ffi-type ( n -- a_type ) gforth ffi_type |
| |
static void* ffi_types[] = |
| |
{ &ffi_type_void, |
| |
&ffi_type_uint8, &ffi_type_sint8, |
| |
&ffi_type_uint16, &ffi_type_sint16, |
| |
&ffi_type_uint32, &ffi_type_sint32, |
| |
&ffi_type_uint64, &ffi_type_sint64, |
| |
&ffi_type_float, &ffi_type_double, &ffi_type_longdouble, |
| |
&ffi_type_pointer }; |
| |
a_type = ffi_types[n]; |
| |
|
| |
ffi-size ( n1 -- n2 ) gforth ffi_size |
| |
static int ffi_sizes[] = |
| |
{ sizeof(ffi_cif), sizeof(ffi_closure) }; |
| |
n2 = ffi_sizes[n1]; |
| |
|
| |
ffi-prep-cif ( a_atypes n a_rtype a_cif -- w ) gforth ffi_prep_cif |
| |
w = ffi_prep_cif((ffi_cif *)a_cif, FFI_DEFAULT_ABI, n, |
| |
(ffi_type *)a_rtype, (ffi_type **)a_atypes); |
| |
|
| |
ffi-call ( a_avalues a_rvalue a_ip a_cif -- ) gforth ffi_call |
| |
SAVE_REGS |
| |
ffi_call((ffi_cif *)a_cif, (void(*)())a_ip, (void *)a_rvalue, (void **)a_avalues); |
| |
REST_REGS |
| |
|
| |
ffi-prep-closure ( a_ip a_cif a_closure -- w ) gforth ffi_prep_closure |
| |
w = ffi_prep_closure((ffi_closure *)a_closure, (ffi_cif *)a_cif, gforth_callback, (void *)a_ip); |
| |
|
| |
ffi-2@ ( a_addr -- d ) gforth ffi_2fetch |
| |
#ifdef BUGGY_LONG_LONG |
| |
DLO_IS(d, *(Cell*)(*a_addr)); |
| |
DHI_IS(d, 0); |
| |
#else |
| |
d = *(DCell*)(a_addr); |
| |
#endif |
| |
|
| |
ffi-2! ( d a_addr -- ) gforth ffi_2store |
| |
#ifdef BUGGY_LONG_LONG |
| |
*(Cell*)(a_addr) = DLO(d); |
| |
#else |
| |
*(DCell*)(a_addr) = d; |
| |
#endif |
| |
|
| |
ffi-arg-int ( -- w ) gforth ffi_arg_int |
| |
w = *(int *)(*gforth_clist++); |
| |
|
| |
ffi-arg-long ( -- w ) gforth ffi_arg_long |
| |
w = *(long *)(*gforth_clist++); |
| |
|
| |
ffi-arg-longlong ( -- d ) gforth ffi_arg_longlong |
| |
#ifdef BUGGY_LONG_LONG |
| |
DLO_IS(d, *(Cell*)(*gforth_clist++)); |
| |
DHI_IS(d, -(*(Cell*)(*gforth_clist++)<0)); |
| |
#else |
| |
d = *(DCell*)(*gforth_clist++); |
| |
#endif |
| |
|
| |
ffi-arg-dlong ( -- d ) gforth ffi_arg_dlong |
| |
#ifdef BUGGY_LONG_LONG |
| |
DLO_IS(d, *(Cell*)(*gforth_clist++)); |
| |
DHI_IS(d, -(*(Cell*)(*gforth_clist++)<0)); |
| |
#else |
| |
d = *(Cell*)(*gforth_clist++); |
| |
#endif |
| |
|
| |
ffi-arg-ptr ( -- c_addr ) gforth ffi_arg_ptr |
| |
c_addr = *(Char **)(*gforth_clist++); |
| |
|
| |
ffi-arg-float ( -- r ) gforth ffi_arg_float |
| |
r = *(float*)(*gforth_clist++); |
| |
|
| |
ffi-arg-double ( -- r ) gforth ffi_arg_double |
| |
r = *(double*)(*gforth_clist++); |
| |
|
| |
ffi-ret-void ( -- ) gforth ffi_ret_void |
| |
return 0; |
| |
|
| |
ffi-ret-int ( w -- ) gforth ffi_ret_int |
| |
*(int*)(gforth_ritem) = w; |
| |
return 0; |
| |
|
| |
ffi-ret-longlong ( d -- ) gforth ffi_ret_longlong |
| |
#ifdef BUGGY_LONG_LONG |
| |
*(Cell*)(gforth_ritem) = DLO(d); |
| |
#else |
| |
*(DCell*)(gforth_ritem) = d; |
| |
#endif |
| |
return 0; |
| |
|
| |
ffi-ret-dlong ( d -- ) gforth ffi_ret_dlong |
| |
#ifdef BUGGY_LONG_LONG |
| |
*(Cell*)(gforth_ritem) = DLO(d); |
| |
#else |
| |
*(Cell*)(gforth_ritem) = d; |
| |
#endif |
| |
return 0; |
| |
|
| |
ffi-ret-long ( n -- ) gforth ffi_ret_long |
| |
*(Cell*)(gforth_ritem) = n; |
| |
return 0; |
| |
|
| |
ffi-ret-ptr ( c_addr -- ) gforth ffi_ret_ptr |
| |
*(Char **)(gforth_ritem) = c_addr; |
| |
return 0; |
| |
|
| |
ffi-ret-float ( r -- ) gforth ffi_ret_float |
| |
*(float*)(gforth_ritem) = r; |
| |
return 0; |
| |
|
| |
ffi-ret-double ( r -- ) gforth ffi_ret_double |
| |
*(double*)(gforth_ritem) = r; |
| return 0; |
return 0; |
| |
|
| \+ |
\+ |
| define(`_uploop', |
define(`_uploop', |
| `ifelse($1, `$3', `$5', |
`ifelse($1, `$3', `$5', |
| `$4`'define(`$1', incr($1))_uploop(`$1', `$2', `$3', `$4', `$5')')') |
`$4`'define(`$1', incr($1))_uploop(`$1', `$2', `$3', `$4', `$5')')') |
| |
|
| \ argflist(argnum): Forth argument list |
\ argflist(argnum): Forth argument list |
| define(argflist, |
define(argflist, |
| `ifelse($1, 0, `', |
`ifelse($1, 0, `', |
| `uploop(`_i', 1, $1, `format(`u%d ', _i)', `format(`u%d ', _i)')')') |
`uploop(`_i', 1, $1, ``u''`_i ', ``u''`_i')')') |
| \ argdlist(argnum): declare C's arguments |
\ argdlist(argnum): declare C's arguments |
| define(argdlist, |
define(argdlist, |
| `ifelse($1, 0, `', |
`ifelse($1, 0, `', |
| \ argclist(argnum): pass C's arguments |
\ argclist(argnum): pass C's arguments |
| define(argclist, |
define(argclist, |
| `ifelse($1, 0, `', |
`ifelse($1, 0, `', |
| `uploop(`_i', 1, $1, `format(`u%d, ', _i)', `format(`u%d', _i)')')') |
`uploop(`_i', 1, $1, ``u''`_i, ', ``u''`_i')')') |
| \ icall(argnum) |
\ icall(argnum) |
| define(icall, |
define(icall, |
| `icall$1 ( argflist($1)u -- uret ) gforth |
`icall$1 ( argflist($1)u -- uret ) gforth |