version 1.123, 2003/01/24 22:03:20
|
version 1.148, 2003/11/06 09:47:49
|
Line 1
|
Line 1
|
\ Gforth primitives |
\ Gforth primitives |
|
|
\ Copyright (C) 1995,1996,1997,1998,2000 Free Software Foundation, Inc. |
\ Copyright (C) 1995,1996,1997,1998,2000,2003 Free Software Foundation, Inc. |
|
|
\ This file is part of Gforth. |
\ This file is part of Gforth. |
|
|
Line 106
|
Line 106
|
\E set-current |
\E set-current |
\E store-optimization on |
\E store-optimization on |
\E ' noop tail-nextp2 ! \ now INST_TAIL just stores, but does not jump |
\E ' noop tail-nextp2 ! \ now INST_TAIL just stores, but does not jump |
|
\E |
|
\E include-skipped-insts on \ static superinsts include cells for components |
|
\E \ useful for dynamic programming and |
|
\E \ superinsts across entry points |
|
|
\ |
\ |
\ |
\ |
Line 132
|
Line 136
|
\ throw execute, cfa and NEXT1 out? |
\ throw execute, cfa and NEXT1 out? |
\ macroize *ip, ip++, *ip++ (pipelining)? |
\ macroize *ip, ip++, *ip++ (pipelining)? |
|
|
|
\ Stack caching setup |
|
|
|
ifdef(`M4_ENGINE_FAST', `include(cache1.vmg)', `include(cache0.vmg)') |
|
|
\ these m4 macros would collide with identifiers |
\ these m4 macros would collide with identifiers |
undefine(`index') |
undefine(`index') |
undefine(`shift') |
undefine(`shift') |
undefine(`symbols') |
undefine(`symbols') |
|
|
|
\F 0 [if] |
|
|
|
\ run-time routines for non-primitives. They are defined as |
|
\ primitives, because that simplifies things. |
|
|
|
(docol) ( -- R:a_retaddr ) gforth-internal paren_docol |
|
""run-time routine for colon definitions"" |
|
#ifdef NO_IP |
|
a_retaddr = next_code; |
|
INST_TAIL; |
|
goto **(Label *)PFA(CFA); |
|
#else /* !defined(NO_IP) */ |
|
a_retaddr = (Cell *)IP; |
|
SET_IP((Xt *)PFA(CFA)); |
|
#endif /* !defined(NO_IP) */ |
|
|
|
(docon) ( -- w ) gforth-internal paren_docon |
|
""run-time routine for constants"" |
|
w = *(Cell *)PFA(CFA); |
|
#ifdef NO_IP |
|
INST_TAIL; |
|
goto *next_code; |
|
#endif /* defined(NO_IP) */ |
|
|
|
(dovar) ( -- a_body ) gforth-internal paren_dovar |
|
""run-time routine for variables and CREATEd words"" |
|
a_body = PFA(CFA); |
|
#ifdef NO_IP |
|
INST_TAIL; |
|
goto *next_code; |
|
#endif /* defined(NO_IP) */ |
|
|
|
(douser) ( -- a_user ) gforth-internal paren_douser |
|
""run-time routine for constants"" |
|
a_user = (Cell *)(up+*(Cell *)PFA(CFA)); |
|
#ifdef NO_IP |
|
INST_TAIL; |
|
goto *next_code; |
|
#endif /* defined(NO_IP) */ |
|
|
|
(dodefer) ( -- ) gforth-internal paren_dodefer |
|
""run-time routine for deferred words"" |
|
#ifndef NO_IP |
|
ip=IP; /* undo any ip updating that may have been performed by NEXT_P0 */ |
|
#endif /* !defined(NO_IP) */ |
|
SUPER_END; /* !! probably unnecessary and may lead to measurement errors */ |
|
EXEC(*(Xt *)PFA(CFA)); |
|
|
|
(dofield) ( n1 -- n2 ) gforth-internal paren_field |
|
""run-time routine for fields"" |
|
n2 = n1 + *(Cell *)PFA(CFA); |
|
#ifdef NO_IP |
|
INST_TAIL; |
|
goto *next_code; |
|
#endif /* defined(NO_IP) */ |
|
|
|
(dodoes) ( -- a_body R:a_retaddr ) gforth-internal paren_dodoes |
|
""run-time routine for @code{does>}-defined words"" |
|
#ifdef NO_IP |
|
a_retaddr = next_code; |
|
a_body = PFA(CFA); |
|
INST_TAIL; |
|
goto **(Label *)DOES_CODE1(CFA); |
|
#else /* !defined(NO_IP) */ |
|
a_retaddr = (Cell *)IP; |
|
a_body = PFA(CFA); |
|
SET_IP(DOES_CODE1(CFA)); |
|
#endif /* !defined(NO_IP) */ |
|
|
|
(does-handler) ( -- ) gforth-internal paren_does_handler |
|
""just a slot to have an encoding for the DOESJUMP, |
|
which is no longer used anyway (!! eliminate this)"" |
|
|
|
\F [endif] |
|
|
\g control |
\g control |
|
|
noop ( -- ) gforth |
noop ( -- ) gforth |
Line 146 noop ( -- ) gforth
|
Line 229 noop ( -- ) gforth
|
call ( #a_callee -- R:a_retaddr ) new |
call ( #a_callee -- R:a_retaddr ) new |
""Call callee (a variant of docol with inline argument)."" |
""Call callee (a variant of docol with inline argument)."" |
#ifdef NO_IP |
#ifdef NO_IP |
|
assert(0); |
INST_TAIL; |
INST_TAIL; |
JUMP(a_callee); |
JUMP(a_callee); |
#else |
#else |
Line 557 cmove ( c_from c_to u -- ) string c_move
|
Line 641 cmove ( c_from c_to u -- ) string c_move
|
@i{c-from} to @i{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; i.e., for overlapping areas it is |
from low address to high address; i.e., for overlapping areas it is |
safe if @i{c-to}=<@i{c-from}."" |
safe if @i{c-to}=<@i{c-from}."" |
while (u-- > 0) |
cmove(c_from,c_to,u); |
*c_to++ = *c_from++; |
|
: |
: |
bounds ?DO dup c@ I c! 1+ LOOP drop ; |
bounds ?DO dup c@ I c! 1+ LOOP drop ; |
|
|
Line 567 cmove> ( c_from c_to u -- ) string c_mov
|
Line 650 cmove> ( c_from c_to u -- ) string c_mov
|
@i{c-from} to @i{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; i.e., for overlapping areas it is |
from high address to low address; i.e., for overlapping areas it is |
safe if @i{c-to}>=@i{c-from}."" |
safe if @i{c-to}>=@i{c-from}."" |
while (u-- > 0) |
cmove_up(c_from,c_to,u); |
c_to[u] = c_from[u]; |
|
: |
: |
dup 0= IF drop 2drop exit THEN |
dup 0= IF drop 2drop exit THEN |
rot over + -rot bounds swap 1- |
rot over + -rot bounds swap 1- |
Line 588 is 1. Currently this is based on the mac
|
Line 670 is 1. Currently this is based on the mac
|
comparison. In the future, this may change to consider the current |
comparison. In the future, this may change to consider the current |
locale and its collation order."" |
locale and its collation order."" |
/* close ' to keep fontify happy */ |
/* close ' to keep fontify happy */ |
n = memcmp(c_addr1, c_addr2, u1<u2 ? u1 : u2); |
n = compare(c_addr1, u1, c_addr2, u2); |
if (n==0) |
|
n = u1-u2; |
|
if (n<0) |
|
n = -1; |
|
else if (n>0) |
|
n = 1; |
|
: |
: |
rot 2dup swap - >r min swap -text dup |
rot 2dup swap - >r min swap -text dup |
IF rdrop ELSE drop r> sgn THEN ; |
IF rdrop ELSE drop r> sgn THEN ; |
: sgn ( n -- -1/0/1 ) |
: -text ( c_addr1 u c_addr2 -- n ) |
dup 0= IF EXIT THEN 0< 2* 1+ ; |
|
|
|
-text ( c_addr1 u c_addr2 -- n ) new dash_text |
|
n = memcmp(c_addr1, c_addr2, u); |
|
if (n<0) |
|
n = -1; |
|
else if (n>0) |
|
n = 1; |
|
: |
|
swap bounds |
swap bounds |
?DO dup c@ I c@ = WHILE 1+ LOOP drop 0 |
?DO dup c@ I c@ = WHILE 1+ LOOP drop 0 |
ELSE c@ I c@ - unloop THEN sgn ; |
ELSE c@ I c@ - unloop THEN sgn ; |
: sgn ( n -- -1/0/1 ) |
: sgn ( n -- -1/0/1 ) |
dup 0= IF EXIT THEN 0< 2* 1+ ; |
dup 0= IF EXIT THEN 0< 2* 1+ ; |
|
|
|
\ -text is only used by replaced primitives now; move it elsewhere |
|
\ -text ( c_addr1 u c_addr2 -- n ) new dash_text |
|
\ n = memcmp(c_addr1, c_addr2, u); |
|
\ if (n<0) |
|
\ n = -1; |
|
\ else if (n>0) |
|
\ n = 1; |
|
\ : |
|
\ swap bounds |
|
\ ?DO dup c@ I c@ = WHILE 1+ LOOP drop 0 |
|
\ ELSE c@ I c@ - unloop THEN sgn ; |
|
\ : sgn ( n -- -1/0/1 ) |
|
\ dup 0= IF EXIT THEN 0< 2* 1+ ; |
|
|
toupper ( c1 -- c2 ) gforth |
toupper ( c1 -- c2 ) gforth |
""If @i{c1} is a lower-case character (in the current locale), @i{c2} |
""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."" |
is the equivalent upper-case character. All other characters are unchanged."" |
Line 621 c2 = toupper(c1);
|
Line 702 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 - ; |
|
|
capscomp ( c_addr1 u c_addr2 -- n ) new |
|
n = memcasecmp(c_addr1, c_addr2, u); /* !! use something that works in all locales */ |
|
if (n<0) |
|
n = -1; |
|
else if (n>0) |
|
n = 1; |
|
: |
|
swap bounds |
|
?DO dup c@ I c@ <> |
|
IF dup c@ toupper I c@ toupper = |
|
ELSE true THEN WHILE 1+ LOOP drop 0 |
|
ELSE c@ toupper I c@ toupper - unloop THEN sgn ; |
|
|
|
-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; |
|
while (u2>0 && c_addr[u2-1] == ' ') |
|
u2--; |
|
: |
|
BEGIN 1- 2dup + c@ bl = WHILE |
|
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} |
""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."" |
Line 819 ud = ummul(u1,u2);
|
Line 877 ud = ummul(u1,u2);
|
ud = (UDCell)u1 * (UDCell)u2; |
ud = (UDCell)u1 * (UDCell)u2; |
#endif |
#endif |
: |
: |
>r >r 0 0 r> r> [ 8 cells ] literal 0 |
0 -rot dup [ 8 cells ] literal - |
DO |
DO |
over >r dup >r 0< and d2*+ drop |
dup 0< I' and d2*+ drop |
r> 2* r> swap |
LOOP ; |
LOOP 2drop ; |
|
: d2*+ ( ud n -- ud+n c ) |
: d2*+ ( ud n -- ud+n c ) |
over MINI |
over MINI |
and >r >r 2dup d+ swap r> + swap r> ; |
and >r >r 2dup d+ swap r> + swap r> ; |
Line 1110 rdrop ( R:w -- ) gforth
|
Line 1167 rdrop ( R:w -- ) gforth
|
: |
: |
r> r> drop >r ; |
r> r> drop >r ; |
|
|
2>r ( w1 w2 -- R:w1 R:w2 ) core-ext two_to_r |
2>r ( d -- R:d ) core-ext two_to_r |
: |
: |
swap r> swap >r swap >r >r ; |
swap r> swap >r swap >r >r ; |
|
|
2r> ( R:w1 R:w2 -- w1 w2 ) core-ext two_r_from |
2r> ( R:d -- d ) core-ext two_r_from |
: |
: |
r> r> swap r> swap >r swap ; |
r> r> swap r> swap >r swap ; |
|
|
2r@ ( R:w1 R:w2 -- R:w1 R:w2 w1 w2 ) core-ext two_r_fetch |
2r@ ( R:d -- R:d d ) core-ext two_r_fetch |
: |
: |
i' j ; |
i' j ; |
|
|
2rdrop ( R:w1 R:w2 -- ) gforth two_r_drop |
2rdrop ( R:d -- ) gforth two_r_drop |
: |
: |
r> r> drop r> drop >r ; |
r> r> drop r> drop >r ; |
|
|
Line 1342 c_addr2 = c_addr1+1;
|
Line 1399 c_addr2 = c_addr1+1;
|
|
|
\g compiler |
\g compiler |
|
|
(listlfind) ( c_addr u longname1 -- longname2 ) new paren_listlfind |
\+f83headerstring |
for (; longname1 != NULL; longname1 = (struct Longname *)(longname1->next)) |
|
if ((UCell)LONGNAME_COUNT(longname1)==u && |
(f83find) ( c_addr u f83name1 -- f83name2 ) new paren_f83find |
memcasecmp(c_addr, longname1->name, u)== 0 /* or inline? */) |
for (; f83name1 != NULL; f83name1 = (struct F83Name *)(f83name1->next)) |
|
if ((UCell)F83NAME_COUNT(f83name1)==u && |
|
memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
break; |
break; |
longname2=longname1; |
f83name2=f83name1; |
|
: |
|
BEGIN dup WHILE (find-samelen) dup WHILE |
|
>r 2dup r@ cell+ char+ capscomp 0= |
|
IF 2drop r> EXIT THEN |
|
r> @ |
|
REPEAT THEN nip nip ; |
|
: (find-samelen) ( u f83name1 -- u f83name2/0 ) |
|
BEGIN 2dup cell+ c@ $1F and <> WHILE @ dup 0= UNTIL THEN ; |
|
: capscomp ( c_addr1 u c_addr2 -- n ) |
|
swap bounds |
|
?DO dup c@ I c@ <> |
|
IF dup c@ toupper I c@ toupper = |
|
ELSE true THEN WHILE 1+ LOOP drop 0 |
|
ELSE c@ toupper I c@ toupper - unloop THEN sgn ; |
|
: sgn ( n -- -1/0/1 ) |
|
dup 0= IF EXIT THEN 0< 2* 1+ ; |
|
|
|
\- |
|
|
|
(listlfind) ( c_addr u longname1 -- longname2 ) new paren_listlfind |
|
longname2=listlfind(c_addr, u, longname1); |
: |
: |
BEGIN dup WHILE (findl-samelen) dup WHILE |
BEGIN dup WHILE (findl-samelen) dup WHILE |
>r 2dup r@ cell+ cell+ capscomp 0= |
>r 2dup r@ cell+ cell+ capscomp 0= |
Line 1356 longname2=longname1;
|
Line 1436 longname2=longname1;
|
REPEAT THEN nip nip ; |
REPEAT THEN nip nip ; |
: (findl-samelen) ( u longname1 -- u longname2/0 ) |
: (findl-samelen) ( u longname1 -- u longname2/0 ) |
BEGIN 2dup cell+ @ lcount-mask and <> WHILE @ dup 0= UNTIL THEN ; |
BEGIN 2dup cell+ @ lcount-mask and <> WHILE @ dup 0= UNTIL THEN ; |
|
: capscomp ( c_addr1 u c_addr2 -- n ) |
|
swap bounds |
|
?DO dup c@ I c@ <> |
|
IF dup c@ toupper I c@ toupper = |
|
ELSE true THEN WHILE 1+ LOOP drop 0 |
|
ELSE c@ toupper I c@ toupper - unloop THEN sgn ; |
|
: sgn ( n -- -1/0/1 ) |
|
dup 0= IF EXIT THEN 0< 2* 1+ ; |
|
|
\+hash |
\+hash |
|
|
(hashlfind) ( c_addr u a_addr -- longname2 ) new paren_hashlfind |
(hashlfind) ( c_addr u a_addr -- longname2 ) new paren_hashlfind |
struct Longname *longname1; |
longname2 = hashlfind(c_addr, u, a_addr); |
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 |
BEGIN dup WHILE |
2@ >r >r dup r@ cell+ @ lcount-mask and = |
2@ >r >r dup r@ cell+ @ lcount-mask and = |
Line 1383 while(a_addr != NULL)
|
Line 1459 while(a_addr != NULL)
|
|
|
(tablelfind) ( c_addr u a_addr -- longname2 ) new paren_tablelfind |
(tablelfind) ( c_addr u a_addr -- longname2 ) new paren_tablelfind |
""A case-sensitive variant of @code{(hashfind)}"" |
""A case-sensitive variant of @code{(hashfind)}"" |
struct Longname *longname1; |
longname2 = tablelfind(c_addr, u, a_addr); |
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 |
BEGIN dup WHILE |
2@ >r >r dup r@ cell+ @ lcount-mask and = |
2@ >r >r dup r@ cell+ @ lcount-mask and = |
Line 1403 while(a_addr != NULL)
|
Line 1467 while(a_addr != NULL)
|
IF 2drop r> rdrop EXIT THEN THEN |
IF 2drop r> rdrop EXIT THEN THEN |
rdrop r> |
rdrop r> |
REPEAT nip nip ; |
REPEAT nip nip ; |
|
: -text ( c_addr1 u c_addr2 -- n ) |
|
swap bounds |
|
?DO dup c@ I c@ = WHILE 1+ LOOP drop 0 |
|
ELSE c@ I c@ - unloop THEN sgn ; |
|
: sgn ( n -- -1/0/1 ) |
|
dup 0= IF EXIT THEN 0< 2* 1+ ; |
|
|
(hashkey1) ( c_addr u ubits -- ukey ) gforth paren_hashkey1 |
(hashkey1) ( c_addr u ubits -- ukey ) gforth paren_hashkey1 |
""ukey is the hash key for the string c_addr u fitting in ubits bits"" |
""ukey is the hash key for the string c_addr u fitting in ubits bits"" |
/* this hash function rotates the key at every step by rot bits within |
ukey = hashkey1(c_addr, u, ubits); |
ubits bits and xors it with the character. This function does ok in |
|
the chi-sqare-test. Rot should be <=7 (preferably <=5) for |
|
ASCII strings (larger if ubits is large), and should share no |
|
divisors with ubits. |
|
*/ |
|
static char rot_values[] = {5,0,1,2,3,4,5,5,5,5,3,5,5,5,5,7,5,5,5,5,7,5,5,5,5,6,5,5,5,5,7,5,5}; |
|
unsigned rot = rot_values[ubits]; |
|
Char *cp = c_addr; |
|
for (ukey=0; cp<c_addr+u; cp++) |
|
ukey = ((((ukey<<rot) | (ukey>>(ubits-rot))) |
|
^ toupper(*cp)) |
|
& ((1<<ubits)-1)); |
|
: |
: |
dup rot-values + c@ over 1 swap lshift 1- >r |
dup rot-values + c@ over 1 swap lshift 1- >r |
tuck - 2swap r> 0 2swap bounds |
tuck - 2swap r> 0 2swap bounds |
Line 1434 Create rot-values
|
Line 1492 Create rot-values
|
|
|
\+ |
\+ |
|
|
|
\+ |
|
|
(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? */ |
struct Cellpair r=parse_white(c_addr1, u1); |
Char *endp = c_addr1+u1; |
c_addr2 = (Char *)(r.n1); |
while (c_addr1<endp && isspace(*c_addr1)) |
u2 = r.n2; |
c_addr1++; |
|
if (c_addr1<endp) { |
|
for (c_addr2 = c_addr1; c_addr1<endp && !isspace(*c_addr1); c_addr1++) |
|
; |
|
u2 = c_addr1-c_addr2; |
|
} |
|
else { |
|
c_addr2 = c_addr1; |
|
u2 = 0; |
|
} |
|
: |
: |
BEGIN dup WHILE over c@ bl <= WHILE 1 /string |
BEGIN dup WHILE over c@ bl <= WHILE 1 /string |
REPEAT THEN 2dup |
REPEAT THEN 2dup |
Line 1538 FLUSH_ICACHE(c_addr,u);
|
Line 1588 FLUSH_ICACHE(c_addr,u);
|
SUPER_END; |
SUPER_END; |
return (Label *)n; |
return (Label *)n; |
|
|
(system) ( c_addr u -- wretval wior ) gforth peren_system |
(system) ( c_addr u -- wretval wior ) gforth paren_system |
#ifndef MSDOS |
#ifndef MSDOS |
int old_tp=terminal_prepped; |
int old_tp=terminal_prepped; |
deprep_terminal(); |
deprep_terminal(); |
Line 1570 wior = IOR(wretval==-1);
|
Line 1620 wior = IOR(wretval==-1);
|
time&date ( -- nsec nmin nhour nday nmonth nyear ) facility-ext time_and_date |
time&date ( -- nsec nmin nhour nday nmonth nyear ) facility-ext time_and_date |
""Report the current time of day. Seconds, minutes and hours are numbered from 0. |
""Report the current time of day. Seconds, minutes and hours are numbered from 0. |
Months are numbered from 1."" |
Months are numbered from 1."" |
|
#if 1 |
|
time_t now; |
|
struct tm *ltime; |
|
time(&now); |
|
ltime=localtime(&now); |
|
#else |
struct timeval time1; |
struct timeval time1; |
struct timezone zone1; |
struct timezone zone1; |
struct tm *ltime; |
struct tm *ltime; |
Line 1577 gettimeofday(&time1,&zone1);
|
Line 1633 gettimeofday(&time1,&zone1);
|
/* !! Single Unix specification: |
/* !! Single Unix specification: |
If tzp is not a null pointer, the behaviour is unspecified. */ |
If tzp is not a null pointer, the behaviour is unspecified. */ |
ltime=localtime((time_t *)&time1.tv_sec); |
ltime=localtime((time_t *)&time1.tv_sec); |
|
#endif |
nyear =ltime->tm_year+1900; |
nyear =ltime->tm_year+1900; |
nmonth=ltime->tm_mon+1; |
nmonth=ltime->tm_mon+1; |
nday =ltime->tm_mday; |
nday =ltime->tm_mday; |
Line 1630 c_addr = strerror(n);
|
Line 1687 c_addr = strerror(n);
|
u = strlen(c_addr); |
u = strlen(c_addr); |
|
|
strsignal ( n -- c_addr u ) gforth |
strsignal ( n -- c_addr u ) gforth |
c_addr = strsignal(n); |
c_addr = (Address)strsignal(n); |
u = strlen(c_addr); |
u = strlen(c_addr); |
|
|
call-c ( w -- ) gforth call_c |
call-c ( w -- ) gforth call_c |
Line 1674 wior = IOR(unlink(tilde_cstr(c_addr, u,
|
Line 1731 wior = IOR(unlink(tilde_cstr(c_addr, u,
|
|
|
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 @i{c_addr1 u1} to new name @i{c_addr2 u2}"" |
""Rename file @i{c_addr1 u1} to new name @i{c_addr2 u2}"" |
char *s1=tilde_cstr(c_addr2, u2, 1); |
wior = rename_file(c_addr1, u1, c_addr2, u2); |
wior = IOR(rename(tilde_cstr(c_addr1, u1, 0), s1)==-1); |
|
|
|
file-position ( wfileid -- ud wior ) file file_position |
file-position ( wfileid -- ud wior ) file file_position |
/* !! use tell and lseek? */ |
/* !! use tell and lseek? */ |
Line 1701 wior = FILEIO(u2<u1 && ferror((FILE *)wf
|
Line 1757 wior = FILEIO(u2<u1 && ferror((FILE *)wf
|
if (wior) |
if (wior) |
clearerr((FILE *)wfileid); |
clearerr((FILE *)wfileid); |
|
|
(read-line) ( c_addr u1 wfileid -- u2 flag u3 wior ) file paren_read_line |
(read-line) ( c_addr u1 wfileid -- u2 flag u3 wior ) file paren_read_line |
Cell c; |
struct Cellquad r = read_line(c_addr, u1, wfileid); |
flag=-1; |
u2 = r.n1; |
u3=0; |
flag = r.n2; |
for(u2=0; u2<u1; u2++) |
u3 = r.n3; |
{ |
wior = r.n4; |
c = getc((FILE *)wfileid); |
|
u3++; |
|
if (c=='\n') break; |
|
if (c=='\r') { |
|
if ((c = getc((FILE *)wfileid))!='\n') |
|
ungetc(c,(FILE *)wfileid); |
|
else |
|
u3++; |
|
break; |
|
} |
|
if (c==EOF) { |
|
flag=FLAG(u2!=0); |
|
break; |
|
} |
|
c_addr[u2] = (Char)c; |
|
} |
|
wior=FILEIO(ferror((FILE *)wfileid)); |
|
|
|
\+ |
\+ |
|
|
Line 1755 flush-file ( wfileid -- wior ) file-ext
|
Line 1794 flush-file ( wfileid -- wior ) file-ext
|
wior = IOR(fflush((FILE *) wfileid)==EOF); |
wior = IOR(fflush((FILE *) wfileid)==EOF); |
|
|
file-status ( c_addr u -- wfam wior ) file-ext file_status |
file-status ( c_addr u -- wfam wior ) file-ext file_status |
char *filename=tilde_cstr(c_addr, u, 1); |
struct Cellpair r = file_status(c_addr, u); |
if (access (filename, F_OK) != 0) { |
wfam = r.n1; |
wfam=0; |
wior = r.n2; |
wior=IOR(1); |
|
} |
|
else if (access (filename, R_OK | W_OK) == 0) { |
|
wfam=2; /* r/w */ |
|
wior=0; |
|
} |
|
else if (access (filename, R_OK) == 0) { |
|
wfam=0; /* r/o */ |
|
wior=0; |
|
} |
|
else if (access (filename, W_OK) == 0) { |
|
wfam=4; /* w/o */ |
|
wior=0; |
|
} |
|
else { |
|
wfam=1; /* well, we cannot access the file, but better deliver a legal |
|
access mode (r/o bin), so we get a decent error later upon open. */ |
|
wior=0; |
|
} |
|
|
|
file-eof? ( wfileid -- flag ) gforth file_eof_query |
file-eof? ( wfileid -- flag ) gforth file_eof_query |
flag = FLAG(feof((FILE *) wfileid)); |
flag = FLAG(feof((FILE *) wfileid)); |
Line 2012 n=(r==0. ? 1 : decpt);
|
Line 2032 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(sig); |
|
if (siglen>u) /* happens in glibc-2.1.3 if 999.. is rounded up */ |
|
siglen=u; |
memcpy(c_addr,sig,siglen); |
memcpy(c_addr,sig,siglen); |
memset(c_addr+siglen,f2?'0':' ',u-siglen); |
memset(c_addr+siglen,f2?'0':' ',u-siglen); |
|
|
Line 2022 representation. If the string represents
|
Line 2044 representation. If the string represents
|
@i{r} is placed on the floating-point stack and @i{flag} is |
@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 |
true. Otherwise, @i{flag} is false. A string of blanks is a special |
case and represents the floating-point number 0."" |
case and represents the floating-point number 0."" |
/* real signature: c_addr u -- r t / f */ |
|
Float r; |
Float r; |
char *number=cstr(c_addr, u, 1); |
flag = to_float(c_addr, u, &r); |
char *endconv; |
if (flag) { |
int sign = 0; |
IF_fpTOS(fp[0] = fpTOS); |
if(number[0]=='-') { |
fp += -1; |
sign = 1; |
fpTOS = r; |
number++; |
|
u--; |
|
} |
|
while(isspace((unsigned)(number[--u])) && u>0); |
|
switch(number[u]) |
|
{ |
|
case 'd': |
|
case 'D': |
|
case 'e': |
|
case 'E': break; |
|
default : u++; break; |
|
} |
|
number[u]='\0'; |
|
r=strtod(number,&endconv); |
|
if((flag=FLAG(!(Cell)*endconv))) |
|
{ |
|
IF_fpTOS(fp[0] = fpTOS); |
|
fp += -1; |
|
fpTOS = sign ? -r : r; |
|
} |
|
else if(*endconv=='d' || *endconv=='D') |
|
{ |
|
*endconv='E'; |
|
r=strtod(number,&endconv); |
|
if((flag=FLAG(!(Cell)*endconv))) |
|
{ |
|
IF_fpTOS(fp[0] = fpTOS); |
|
fp += -1; |
|
fpTOS = sign ? -r : r; |
|
} |
|
} |
} |
|
|
fabs ( r1 -- r2 ) float-ext f_abs |
fabs ( r1 -- r2 ) float-ext f_abs |
Line 2197 v* ( f_addr1 nstride1 f_addr2 nstride2 u
|
Line 2188 v* ( f_addr1 nstride1 f_addr2 nstride2 u
|
""dot-product: r=v1*v2. The first element of v1 is at f_addr1, the |
""dot-product: r=v1*v2. The first element of v1 is at f_addr1, the |
next at f_addr1+nstride1 and so on (similar for v2). Both vectors have |
next at f_addr1+nstride1 and so on (similar for v2). Both vectors have |
ucount elements."" |
ucount elements."" |
for (r=0.; ucount>0; ucount--) { |
r = v_star(f_addr1, nstride1, f_addr2, nstride2, ucount); |
r += *f_addr1 * *f_addr2; |
|
f_addr1 = (Float *)(((Address)f_addr1)+nstride1); |
|
f_addr2 = (Float *)(((Address)f_addr2)+nstride2); |
|
} |
|
: |
: |
>r swap 2swap swap 0e r> 0 ?DO |
>r swap 2swap swap 0e r> 0 ?DO |
dup f@ over + 2swap dup f@ f* f+ over + 2swap |
dup f@ over + 2swap dup f@ f* f+ over + 2swap |
Line 2209 for (r=0.; ucount>0; ucount--) {
|
Line 2196 for (r=0.; ucount>0; ucount--) {
|
|
|
faxpy ( ra f_x nstridex f_y nstridey ucount -- ) gforth |
faxpy ( ra f_x nstridex f_y nstridey ucount -- ) gforth |
""vy=ra*vx+vy"" |
""vy=ra*vx+vy"" |
for (; ucount>0; ucount--) { |
faxpy(ra, f_x, nstridex, f_y, nstridey, ucount); |
*f_y += ra * *f_x; |
|
f_x = (Float *)(((Address)f_x)+nstridex); |
|
f_y = (Float *)(((Address)f_y)+nstridey); |
|
} |
|
: |
: |
>r swap 2swap swap r> 0 ?DO |
>r swap 2swap swap r> 0 ?DO |
fdup dup f@ f* over + 2swap dup f@ f+ dup f! over + 2swap |
fdup dup f@ f* over + 2swap dup f@ f+ dup f! over + 2swap |
Line 2305 r = fp[u+1]; /* +1, because update of fp
|
Line 2288 r = fp[u+1]; /* +1, because update of fp
|
|
|
\g syslib |
\g syslib |
|
|
|
open-lib ( c_addr1 u1 -- u2 ) gforth open_lib |
|
#if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
|
#ifndef RTLD_GLOBAL |
|
#define RTLD_GLOBAL 0 |
|
#endif |
|
u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY); |
|
#else |
|
# ifdef _WIN32 |
|
u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1)); |
|
# else |
|
#warning Define open-lib! |
|
u2 = 0; |
|
# endif |
|
#endif |
|
|
|
lib-sym ( c_addr1 u1 u2 -- u3 ) gforth lib_sym |
|
#if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
|
u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1)); |
|
#else |
|
# ifdef _WIN32 |
|
u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1)); |
|
# else |
|
#warning Define lib-sym! |
|
u3 = 0; |
|
# endif |
|
#endif |
|
|
|
wcall ( u -- ) gforth |
|
IF_fpTOS(fp[0]=fpTOS); |
|
FP=fp; |
|
sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &FP); |
|
fp=FP; |
|
IF_spTOS(spTOS=sp[0];) |
|
IF_fpTOS(fpTOS=fp[0]); |
|
|
|
\+FFCALL |
|
|
|
av-start-void ( c_addr -- ) gforth av_start_void |
|
av_start_void(alist, c_addr); |
|
|
|
av-start-int ( c_addr -- ) gforth av_start_int |
|
av_start_int(alist, c_addr, &irv); |
|
|
|
av-start-float ( c_addr -- ) gforth av_start_float |
|
av_start_float(alist, c_addr, &frv); |
|
|
|
av-start-double ( c_addr -- ) gforth av_start_double |
|
av_start_double(alist, c_addr, &drv); |
|
|
|
av-start-longlong ( c_addr -- ) gforth av_start_longlong |
|
av_start_longlong(alist, c_addr, &llrv); |
|
|
|
av-start-ptr ( c_addr -- ) gforth av_start_ptr |
|
av_start_ptr(alist, c_addr, void*, &prv); |
|
|
|
av-int ( w -- ) gforth av_int |
|
av_int(alist, w); |
|
|
|
av-float ( r -- ) gforth av_float |
|
av_float(alist, r); |
|
|
|
av-double ( r -- ) gforth av_double |
|
av_double(alist, r); |
|
|
|
av-longlong ( d -- ) gforth av_longlong |
|
av_longlong(alist, d); |
|
|
|
av-ptr ( c_addr -- ) gforth av_ptr |
|
av_ptr(alist, void*, c_addr); |
|
|
|
av-int-r ( R:w -- ) gforth av_int_r |
|
av_int(alist, w); |
|
|
|
av-float-r ( -- ) gforth av_float_r |
|
float r = *(Float*)lp; |
|
lp += sizeof(Float); |
|
av_float(alist, r); |
|
|
|
av-double-r ( -- ) gforth av_double_r |
|
double r = *(Float*)lp; |
|
lp += sizeof(Float); |
|
av_double(alist, r); |
|
|
|
av-longlong-r ( R:d -- ) gforth av_longlong_r |
|
av_longlong(alist, d); |
|
|
|
av-ptr-r ( R:c_addr -- ) gforth av_ptr_r |
|
av_ptr(alist, void*, c_addr); |
|
|
|
av-call-void ( -- ) gforth av_call_void |
|
SAVE_REGS |
|
av_call(alist); |
|
REST_REGS |
|
|
|
av-call-int ( -- w ) gforth av_call_int |
|
SAVE_REGS |
|
av_call(alist); |
|
REST_REGS |
|
w = irv; |
|
|
|
av-call-float ( -- r ) gforth av_call_float |
|
SAVE_REGS |
|
av_call(alist); |
|
REST_REGS |
|
r = frv; |
|
|
|
av-call-double ( -- r ) gforth av_call_double |
|
SAVE_REGS |
|
av_call(alist); |
|
REST_REGS |
|
r = drv; |
|
|
|
av-call-longlong ( -- d ) gforth av_call_longlong |
|
SAVE_REGS |
|
av_call(alist); |
|
REST_REGS |
|
d = llrv; |
|
|
|
av-call-ptr ( -- c_addr ) gforth av_call_ptr |
|
SAVE_REGS |
|
av_call(alist); |
|
REST_REGS |
|
c_addr = prv; |
|
|
|
alloc-callback ( a_ip -- c_addr ) gforth alloc_callback |
|
c_addr = (char *)alloc_callback(engine_callback, (Xt *)a_ip); |
|
|
|
va-start-void ( -- ) gforth va_start_void |
|
va_start_void(clist); |
|
|
|
va-start-int ( -- ) gforth va_start_int |
|
va_start_int(clist); |
|
|
|
va-start-longlong ( -- ) gforth va_start_longlong |
|
va_start_longlong(clist); |
|
|
|
va-start-ptr ( -- ) gforth va_start_ptr |
|
va_start_ptr(clist, (char *)); |
|
|
|
va-start-float ( -- ) gforth va_start_float |
|
va_start_float(clist); |
|
|
|
va-start-double ( -- ) gforth va_start_double |
|
va_start_double(clist); |
|
|
|
va-arg-int ( -- w ) gforth va_arg_int |
|
w = va_arg_int(clist); |
|
|
|
va-arg-longlong ( -- d ) gforth va_arg_longlong |
|
d = va_arg_longlong(clist); |
|
|
|
va-arg-ptr ( -- c_addr ) gforth va_arg_ptr |
|
c_addr = (char *)va_arg_ptr(clist,char*); |
|
|
|
va-arg-float ( -- r ) gforth va_arg_float |
|
r = va_arg_float(clist); |
|
|
|
va-arg-double ( -- r ) gforth va_arg_double |
|
r = va_arg_double(clist); |
|
|
|
va-return-void ( -- ) gforth va_return_void |
|
va_return_void(clist); |
|
return 0; |
|
|
|
va-return-int ( w -- ) gforth va_return_int |
|
va_return_int(clist, w); |
|
return 0; |
|
|
|
va-return-ptr ( c_addr -- ) gforth va_return_ptr |
|
va_return_ptr(clist, void *, c_addr); |
|
return 0; |
|
|
|
va-return-longlong ( d -- ) gforth va_return_longlong |
|
va_return_longlong(clist, d); |
|
return 0; |
|
|
|
va-return-float ( r -- ) gforth va_return_float |
|
va_return_float(clist, r); |
|
return 0; |
|
|
|
va-return-double ( r -- ) gforth va_return_double |
|
va_return_double(clist, r); |
|
return 0; |
|
|
|
\+ |
|
|
|
\+OLDCALL |
|
|
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')') |
define(`_uploop', |
define(`_uploop', |
Line 2336 rret = (SYSCALL(Float(*)(argdlist($1)))u
|
Line 2507 rret = (SYSCALL(Float(*)(argdlist($1)))u
|
|
|
\ close ' to keep fontify happy |
\ close ' to keep fontify happy |
|
|
open-lib ( c_addr1 u1 -- u2 ) gforth open_lib |
|
#if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
|
#ifndef RTLD_GLOBAL |
|
#define RTLD_GLOBAL 0 |
|
#endif |
|
u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY); |
|
#else |
|
# ifdef _WIN32 |
|
u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1)); |
|
# else |
|
#warning Define open-lib! |
|
u2 = 0; |
|
# endif |
|
#endif |
|
|
|
lib-sym ( c_addr1 u1 u2 -- u3 ) gforth lib_sym |
|
#if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
|
u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1)); |
|
#else |
|
# ifdef _WIN32 |
|
u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1)); |
|
# else |
|
#warning Define lib-sym! |
|
u3 = 0; |
|
# endif |
|
#endif |
|
|
|
uploop(i, 0, 7, `icall(i)') |
uploop(i, 0, 7, `icall(i)') |
icall(20) |
icall(20) |
uploop(i, 0, 7, `fcall(i)') |
uploop(i, 0, 7, `fcall(i)') |
fcall(20) |
fcall(20) |
|
|
\+ |
\+ |
|
\+ |
|
|
wcall ( u -- ) gforth |
\g peephole |
IF_fpTOS(fp[0]=fpTOS); |
|
FP=fp; |
|
sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &FP); |
|
fp=FP; |
|
IF_spTOS(spTOS=sp[0];) |
|
IF_fpTOS(fpTOS=fp[0]); |
|
|
|
\+peephole |
\+peephole |
|
|
\g peephole |
|
|
|
compile-prim1 ( a_prim -- ) gforth compile_prim1 |
compile-prim1 ( a_prim -- ) gforth compile_prim1 |
""compile prim (incl. immargs) at @var{a_prim}"" |
""compile prim (incl. immargs) at @var{a_prim}"" |
compile_prim1(a_prim); |
compile_prim1(a_prim); |
Line 2416 JUMP(a_callee);
|
Line 2553 JUMP(a_callee);
|
assert(0); |
assert(0); |
#endif |
#endif |
|
|
|
tag-offsets ( -- a_addr ) gforth tag_offsets |
|
extern Cell groups[32]; |
|
a_addr = groups; |
|
|
\+ |
\+ |
|
|
include(peeprules.vmg) |
\g static_super |
|
|
|
ifdef(`M4_ENGINE_FAST', |
|
`include(peeprules.vmg)') |
|
|
\g end |
\g end |