version 1.65, 2000/11/12 18:14:09
|
version 1.72, 2001/02/04 22:37:12
|
Line 74
|
Line 74
|
\ xt.* XT |
\ xt.* XT |
\ wid.* WID |
\ wid.* WID |
\ f83name.* F83Name * |
\ f83name.* F83Name * |
|
|
|
\E get-current prefixes set-current |
|
\E |
|
\E s" Bool" single data-stack type-prefix f |
|
\E s" Char" single data-stack type-prefix c |
|
\E s" Cell" single data-stack type-prefix n |
|
\E s" Cell" single data-stack type-prefix w |
|
\E s" UCell" single data-stack type-prefix u |
|
\E s" DCell" double data-stack type-prefix d |
|
\E s" UDCell" double data-stack type-prefix ud |
|
\E s" Float" single fp-stack type-prefix r |
|
\E s" Cell *" single data-stack type-prefix a_ |
|
\E s" Char *" single data-stack type-prefix c_ |
|
\E s" Float *" single data-stack type-prefix f_ |
|
\E s" DFloat *" single data-stack type-prefix df_ |
|
\E s" SFloat *" single data-stack type-prefix sf_ |
|
\E s" Xt" single data-stack type-prefix xt |
|
\E s" WID" single data-stack type-prefix wid |
|
\E s" struct F83Name *" single data-stack type-prefix f83name |
|
\E s" struct Longname *" single data-stack type-prefix longname |
|
\E |
|
\E return-stack stack-prefix R: |
|
\E inst-stream stack-prefix # |
|
\E |
|
\E set-current |
|
|
\ |
\ |
\ |
\ |
\ |
\ |
Line 104 undefine(`index')
|
Line 130 undefine(`index')
|
undefine(`shift') |
undefine(`shift') |
|
|
noop ( -- ) gforth |
noop ( -- ) gforth |
; |
|
: |
: |
; |
; |
|
|
lit ( -- w ) gforth |
lit ( #w -- w ) gforth |
w = (Cell)NEXT_INST; |
|
INC_IP(1); |
|
: |
: |
r> dup @ swap cell+ >r ; |
r> dup @ swap cell+ >r ; |
|
|
Line 132 EXEC(*(Xt *)a_addr);
|
Line 155 EXEC(*(Xt *)a_addr);
|
\fhas? skipbranchprims 0= [IF] |
\fhas? skipbranchprims 0= [IF] |
\+glocals |
\+glocals |
|
|
branch-lp+!# ( -- ) gforth branch_lp_plus_store_number |
branch-lp+!# ( #ndisp #nlocals -- ) gforth branch_lp_plus_store_number |
/* this will probably not be used */ |
/* this will probably not be used */ |
lp += (Cell)(IP[1]); |
lp += nlocals; |
goto branch; |
SET_IP((Xt *)(((Cell)(IP-2))+ndisp)); |
|
|
\+ |
\+ |
|
|
branch ( -- ) gforth |
branch ( #ndisp -- ) gforth |
branch: |
SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
|
: |
: |
r> dup @ + >r ; |
r> dup @ + >r ; |
|
|
\ condbranch(forthname,restline,code,forthcode) |
\ condbranch(forthname,stackeffect,restline,code,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 |
define(condbranch, |
define(condbranch, |
$1 $2 |
$1 ( `#'ndisp $2 ) $3 |
$3 SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
$4 SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
|
TAIL; |
} |
} |
else |
$5 |
INC_IP(1); |
|
$4 |
|
|
|
\+glocals |
\+glocals |
|
|
$1-lp+!# $2_lp_plus_store_number |
$1-lp+!`#' ( `#'ndisp `#'nlocals $2 ) $3_lp_plus_store_number |
$3 lp += (Cell)(IP[1]); |
$4 lp += nlocals; |
SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
SET_IP((Xt *)(((Cell)(IP-2))+ndisp)); |
|
TAIL; |
} |
} |
else |
|
INC_IP(2); |
|
|
|
\+ |
\+ |
) |
) |
|
|
condbranch(?branch,( f -- ) f83 question_branch, |
condbranch(?branch,f --,f83 question_branch, |
if (f==0) { |
if (f==0) { |
IF_spTOS(spTOS = sp[0]); |
|
,: |
,: |
0= dup \ !f !f |
0= dup \ !f !f |
r> dup @ \ !f !f IP branchoffset |
r> dup @ \ !f !f IP branchoffset |
Line 182 if (f==0) {
|
Line 201 if (f==0) {
|
|
|
\+xconds |
\+xconds |
|
|
?dup-?branch ( f -- f ) new question_dupe_question_branch |
?dup-?branch ( #ndisp 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_spTOS(spTOS = sp[0]); |
IF_spTOS(spTOS = sp[0]); |
SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
NEXT; |
TAIL; |
} |
} |
else |
|
INC_IP(1); |
|
|
|
?dup-0=-?branch ( f -- ) new question_dupe_zero_equals_question_branch |
?dup-0=-?branch ( #ndisp f -- ) 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}."" |
/* the approach taken here of declaring the word as having the stack |
/* the approach taken here of declaring the word as having the stack |
effect ( f -- ) and correcting for it in the branch-taken case costs a |
effect ( f -- ) and correcting for it in the branch-taken case costs a |
Line 201 few cycles in that case, but is easy to
|
Line 218 few cycles in that case, but is easy to
|
invocation */ |
invocation */ |
if (f!=0) { |
if (f!=0) { |
sp--; |
sp--; |
SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST)); |
SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
NEXT; |
NEXT; |
} |
} |
else |
|
INC_IP(1); |
|
|
|
\+ |
\+ |
\f[THEN] |
\f[THEN] |
\fhas? skiploopprims 0= [IF] |
\fhas? skiploopprims 0= [IF] |
|
|
condbranch((next),( R:n1 -- R:n2 ) cmFORTH paren_next, |
condbranch((next),R:n1 -- R:n2,cmFORTH paren_next, |
n2=n1-1; |
n2=n1-1; |
if (n1) { |
if (n1) { |
,: |
,: |
r> r> dup 1- >r |
r> r> dup 1- >r |
IF dup @ + >r ELSE cell+ >r THEN ;) |
IF dup @ + >r ELSE cell+ >r THEN ;) |
|
|
condbranch((loop),( R:nlimit R:n1 -- R:nlimit R:n2 ) gforth paren_loop, |
condbranch((loop),R:nlimit R:n1 -- R:nlimit R:n2,gforth paren_loop, |
n2=n1+1; |
n2=n1+1; |
if (n2 != nlimit) { |
if (n2 != nlimit) { |
,: |
,: |
Line 226 if (n2 != nlimit) {
|
Line 241 if (n2 != nlimit) {
|
IF >r 1- >r cell+ >r |
IF >r 1- >r cell+ >r |
ELSE >r >r dup @ + >r THEN ;) |
ELSE >r >r dup @ + >r THEN ;) |
|
|
condbranch((+loop),( n R:nlimit R:n1 -- R:nlimit R:n2 ) gforth paren_plus_loop, |
condbranch((+loop),n R:nlimit R:n1 -- R:nlimit R:n2,gforth paren_plus_loop, |
/* !! check this thoroughly */ |
/* !! check this thoroughly */ |
/* sign bit manipulation and test: (x^y)<0 is equivalent to (x<0) != (y<0) */ |
/* sign bit manipulation and test: (x^y)<0 is equivalent to (x<0) != (y<0) */ |
/* dependent upon two's complement arithmetic */ |
/* dependent upon two's complement arithmetic */ |
Line 244 if ((olddiff^(olddiff+n))>=0 /* the li
|
Line 259 if ((olddiff^(olddiff+n))>=0 /* the li
|
|
|
\+xconds |
\+xconds |
|
|
condbranch((-loop),( u R:nlimit R:n1 -- R:nlimit R:n2 ) gforth paren_minus_loop, |
condbranch((-loop),u R:nlimit R:n1 -- R:nlimit R:n2,gforth paren_minus_loop, |
UCell olddiff = n1-nlimit; |
UCell olddiff = n1-nlimit; |
n2=n1-u; |
n2=n1-u; |
if (olddiff>u) { |
if (olddiff>u) { |
,) |
,) |
|
|
condbranch((s+loop),( n R:nlimit R:n1 -- R:nlimit R:n2 ) gforth paren_symmetric_plus_loop, |
condbranch((s+loop),n R:nlimit R:n1 -- R:nlimit R:n2,gforth paren_symmetric_plus_loop, |
""The run-time procedure compiled by S+LOOP. It loops until the index |
""The run-time procedure compiled by S+LOOP. It loops until the index |
crosses the boundary between limit and limit-sign(n). I.e. a symmetric |
crosses the boundary between limit and limit-sign(n). I.e. a symmetric |
version of (+LOOP)."" |
version of (+LOOP)."" |
Line 282 nlimit=0;
|
Line 297 nlimit=0;
|
: |
: |
r> swap rot >r >r >r ; |
r> swap rot >r >r >r ; |
|
|
(?do) ( nlimit nstart -- R:nlimit R:nstart ) gforth paren_question_do |
(?do) ( #ndisp nlimit nstart -- R:nlimit R:nstart ) gforth paren_question_do |
if (nstart == nlimit) { |
if (nstart == nlimit) { |
IF_spTOS(spTOS = sp[0]); |
SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
goto branch; |
TAIL; |
} |
|
else { |
|
INC_IP(1); |
|
} |
} |
: |
: |
2dup = |
2dup = |
Line 300 else {
|
Line 312 else {
|
|
|
\+xconds |
\+xconds |
|
|
(+do) ( nlimit nstart -- R:nlimit R:nstart ) gforth paren_plus_do |
(+do) ( #ndisp nlimit nstart -- R:nlimit R:nstart ) gforth paren_plus_do |
if (nstart >= nlimit) { |
if (nstart >= nlimit) { |
IF_spTOS(spTOS = sp[0]); |
SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
goto branch; |
TAIL; |
} |
|
else { |
|
INC_IP(1); |
|
} |
} |
: |
: |
swap 2dup |
swap 2dup |
Line 318 else {
|
Line 327 else {
|
cell+ |
cell+ |
THEN >r ; |
THEN >r ; |
|
|
(u+do) ( ulimit ustart -- R:ulimit R:ustart ) gforth paren_u_plus_do |
(u+do) ( #ndisp ulimit ustart -- R:ulimit R:ustart ) gforth paren_u_plus_do |
if (ustart >= ulimit) { |
if (ustart >= ulimit) { |
IF_spTOS(spTOS = sp[0]); |
SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
goto branch; |
TAIL; |
} |
|
else { |
|
INC_IP(1); |
|
} |
} |
: |
: |
swap 2dup |
swap 2dup |
Line 336 else {
|
Line 342 else {
|
cell+ |
cell+ |
THEN >r ; |
THEN >r ; |
|
|
(-do) ( nlimit nstart -- R:nlimit R:nstart ) gforth paren_minus_do |
(-do) ( #ndisp nlimit nstart -- R:nlimit R:nstart ) gforth paren_minus_do |
if (nstart <= nlimit) { |
if (nstart <= nlimit) { |
IF_spTOS(spTOS = sp[0]); |
SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
goto branch; |
TAIL; |
} |
|
else { |
|
INC_IP(1); |
|
} |
} |
: |
: |
swap 2dup |
swap 2dup |
Line 354 else {
|
Line 357 else {
|
cell+ |
cell+ |
THEN >r ; |
THEN >r ; |
|
|
(u-do) ( ulimit ustart -- R:ulimit R:ustart ) gforth paren_u_minus_do |
(u-do) ( #ndisp ulimit ustart -- R:ulimit R:ustart ) gforth paren_u_minus_do |
if (ustart <= ulimit) { |
if (ustart <= ulimit) { |
IF_spTOS(spTOS = sp[0]); |
SET_IP((Xt *)(((Cell)(IP-1))+ndisp)); |
goto branch; |
TAIL; |
} |
|
else { |
|
INC_IP(1); |
|
} |
} |
: |
: |
swap 2dup |
swap 2dup |
Line 1187 f83name2=f83name1;
|
Line 1187 f83name2=f83name1;
|
r> @ |
r> @ |
REPEAT THEN nip nip ; |
REPEAT THEN nip nip ; |
: (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 ; |
|
|
\+hash |
\+hash |
|
|
Line 1992 df_addr = (DFloat *)((((Cell)c_addr)+(si
|
Line 1992 df_addr = (DFloat *)((((Cell)c_addr)+(si
|
\+ |
\+ |
\+glocals |
\+glocals |
|
|
@local# ( -- w ) gforth fetch_local_number |
@local# ( #noffset -- w ) gforth fetch_local_number |
w = *(Cell *)(lp+(Cell)NEXT_INST); |
w = *(Cell *)(lp+noffset); |
INC_IP(1); |
|
|
|
@local0 ( -- w ) new fetch_local_zero |
@local0 ( -- w ) new fetch_local_zero |
w = *(Cell *)(lp+0*sizeof(Cell)); |
w = *(Cell *)(lp+0*sizeof(Cell)); |
Line 2010 w = *(Cell *)(lp+3*sizeof(Cell));
|
Line 2009 w = *(Cell *)(lp+3*sizeof(Cell));
|
|
|
\+floating |
\+floating |
|
|
f@local# ( -- r ) gforth f_fetch_local_number |
f@local# ( #noffset -- r ) gforth f_fetch_local_number |
r = *(Float *)(lp+(Cell)NEXT_INST); |
r = *(Float *)(lp+noffset); |
INC_IP(1); |
|
|
|
f@local0 ( -- r ) new f_fetch_local_zero |
f@local0 ( -- r ) new f_fetch_local_zero |
r = *(Float *)(lp+0*sizeof(Float)); |
r = *(Float *)(lp+0*sizeof(Float)); |
Line 2022 r = *(Float *)(lp+1*sizeof(Float));
|
Line 2020 r = *(Float *)(lp+1*sizeof(Float));
|
|
|
\+ |
\+ |
|
|
laddr# ( -- c_addr ) gforth laddr_number |
laddr# ( #noffset -- c_addr ) gforth laddr_number |
/* this can also be used to implement lp@ */ |
/* this can also be used to implement lp@ */ |
c_addr = (Char *)(lp+(Cell)NEXT_INST); |
c_addr = (Char *)(lp+noffset); |
INC_IP(1); |
|
|
|
lp+!# ( -- ) gforth lp_plus_store_number |
lp+!# ( #noffset -- ) gforth lp_plus_store_number |
""used with negative immediate values it allocates memory on the |
""used with negative immediate values it allocates memory on the |
local stack, a positive immediate argument drops memory from the local |
local stack, a positive immediate argument drops memory from the local |
stack"" |
stack"" |
lp += (Cell)NEXT_INST; |
lp += noffset; |
INC_IP(1); |
|
|
|
lp- ( -- ) new minus_four_lp_plus_store |
lp- ( -- ) new minus_four_lp_plus_store |
lp += -sizeof(Cell); |
lp += -sizeof(Cell); |
Line 2162 if(dent == NULL) {
|
Line 2158 if(dent == NULL) {
|
flag = 0; |
flag = 0; |
} else { |
} else { |
u2 = strlen(dent->d_name); |
u2 = strlen(dent->d_name); |
if(u2 > u1) |
if(u2 > u1) { |
u2 = u1; |
u2 = u1; |
|
wior = -512-ENAMETOOLONG; |
|
} |
memmove(c_addr, dent->d_name, u2); |
memmove(c_addr, dent->d_name, u2); |
} |
} |
|
|
Line 2180 flag = FLAG(!fnmatch(pattern, string, 0)
|
Line 2178 flag = FLAG(!fnmatch(pattern, string, 0)
|
newline ( -- c_addr u ) gforth |
newline ( -- c_addr u ) gforth |
""String containing the newline sequence of the host OS"" |
""String containing the newline sequence of the host OS"" |
char newline[] = { |
char newline[] = { |
#ifdef unix |
#if defined(unix) || defined(__MACH__) |
|
/* Darwin/MacOS X sets __MACH__, but not unix. */ |
'\n' |
'\n' |
#else |
#else |
'\r','\n' |
'\r','\n' |
Line 2281 for(u2=0; u2<u1; u2++)
|
Line 2280 for(u2=0; u2<u1; u2++)
|
wior=FILEIO(ferror((FILE *)wfileid)); |
wior=FILEIO(ferror((FILE *)wfileid)); |
|
|
\+ |
\+ |
|
|
|
(listlfind) ( c_addr u longname1 -- longname2 ) new paren_listlfind |
|
for (; longname1 != NULL; longname1 = (struct Longname *)(longname1->next)) |
|
if ((UCell)LONGNAME_COUNT(longname1)==u && |
|
memcasecmp(c_addr, longname1->name, u)== 0 /* or inline? */) |
|
break; |
|
longname2=longname1; |
|
: |
|
BEGIN dup WHILE (findl-samelen) dup WHILE |
|
>r 2dup r@ cell+ cell+ capscomp 0= |
|
IF 2drop r> EXIT THEN |
|
r> @ |
|
REPEAT THEN nip nip ; |
|
: (findl-samelen) ( u longname1 -- u longname2/0 ) |
|
BEGIN 2dup cell+ @ lcount-mask and <> WHILE @ dup 0= UNTIL THEN ; |
|
|
|
\+hash |
|
|
|
(hashlfind) ( c_addr u a_addr -- longname2 ) new paren_hashlfind |
|
struct Longname *longname1; |
|
longname2=NULL; |
|
while(a_addr != NULL) |
|
{ |
|
longname1=(struct Longname *)(a_addr[1]); |
|
a_addr=(Cell *)(a_addr[0]); |
|
if ((UCell)LONGNAME_COUNT(longname1)==u && |
|
memcasecmp(c_addr, longname1->name, u)== 0 /* or inline? */) |
|
{ |
|
longname2=longname1; |
|
break; |
|
} |
|
} |
|
: |
|
BEGIN dup WHILE |
|
2@ >r >r dup r@ cell+ @ lcount-mask and = |
|
IF 2dup r@ cell+ cell+ capscomp 0= |
|
IF 2drop r> rdrop EXIT THEN THEN |
|
rdrop r> |
|
REPEAT nip nip ; |
|
|
|
(tablelfind) ( c_addr u a_addr -- longname2 ) new paren_tablelfind |
|
""A case-sensitive variant of @code{(hashfind)}"" |
|
struct Longname *longname1; |
|
longname2=NULL; |
|
while(a_addr != NULL) |
|
{ |
|
longname1=(struct Longname *)(a_addr[1]); |
|
a_addr=(Cell *)(a_addr[0]); |
|
if ((UCell)LONGNAME_COUNT(longname1)==u && |
|
memcmp(c_addr, longname1->name, u)== 0 /* or inline? */) |
|
{ |
|
longname2=longname1; |
|
break; |
|
} |
|
} |
|
: |
|
BEGIN dup WHILE |
|
2@ >r >r dup r@ cell+ @ lcount-mask and = |
|
IF 2dup r@ cell+ cell+ -text 0= |
|
IF 2drop r> rdrop EXIT THEN THEN |
|
rdrop r> |
|
REPEAT nip nip ; |
|
|
|
\+ |
|
|