version 1.123, 2003/01/24 22:03:20
|
version 1.188, 2006/02/04 22:09:11
|
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,2004,2005 Free Software Foundation, Inc. |
|
|
\ This file is part of Gforth. |
\ This file is part of Gforth. |
|
|
Line 100
|
Line 100
|
\E s" struct F83Name *" single data-stack type-prefix f83name |
\E s" struct F83Name *" single data-stack type-prefix f83name |
\E s" struct Longname *" single data-stack type-prefix longname |
\E s" struct Longname *" single data-stack type-prefix longname |
\E |
\E |
|
\E data-stack stack-prefix S: |
|
\E fp-stack stack-prefix F: |
\E return-stack stack-prefix R: |
\E return-stack stack-prefix R: |
\E inst-stream stack-prefix # |
\E inst-stream stack-prefix # |
\E |
\E |
\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 138
|
\ 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(`STACK_CACHE_FILE', `include(STACK_CACHE_FILE)', `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 */ |
|
VM_JUMP(EXEC1(*(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 231 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 165 execute ( xt -- ) core
|
Line 251 execute ( xt -- ) core
|
#ifndef NO_IP |
#ifndef NO_IP |
ip=IP; |
ip=IP; |
#endif |
#endif |
IF_spTOS(spTOS = sp[0]); |
|
SUPER_END; |
SUPER_END; |
EXEC(xt); |
VM_JUMP(EXEC1(xt)); |
|
|
perform ( a_addr -- ) gforth |
perform ( a_addr -- ) gforth |
""@code{@@ execute}."" |
""@code{@@ execute}."" |
Line 175 perform ( a_addr -- ) gforth
|
Line 260 perform ( a_addr -- ) gforth
|
#ifndef NO_IP |
#ifndef NO_IP |
ip=IP; |
ip=IP; |
#endif |
#endif |
IF_spTOS(spTOS = sp[0]); |
|
SUPER_END; |
SUPER_END; |
EXEC(*(Xt *)a_addr); |
VM_JUMP(EXEC1(*(Xt *)a_addr)); |
: |
: |
@ execute ; |
@ execute ; |
|
|
Line 200 lit-perform ( #a_addr -- ) new lit_perfo
|
Line 284 lit-perform ( #a_addr -- ) new lit_perfo
|
ip=IP; |
ip=IP; |
#endif |
#endif |
SUPER_END; |
SUPER_END; |
EXEC(*(Xt *)a_addr); |
VM_JUMP(EXEC1(*(Xt *)a_addr)); |
|
|
does-exec ( #a_cfa -- R:nest a_pfa ) new does_exec |
does-exec ( #a_cfa -- R:nest a_pfa ) new does_exec |
#ifdef NO_IP |
#ifdef NO_IP |
Line 209 assert(0);
|
Line 293 assert(0);
|
#else |
#else |
a_pfa = PFA(a_cfa); |
a_pfa = PFA(a_cfa); |
nest = (Cell)IP; |
nest = (Cell)IP; |
IF_spTOS(spTOS = sp[0]); |
|
#ifdef DEBUG |
#ifdef DEBUG |
{ |
{ |
CFA_TO_NAME(a_cfa); |
CFA_TO_NAME(a_cfa); |
Line 246 SET_IP((Xt *)a_target);
|
Line 329 SET_IP((Xt *)a_target);
|
|
|
\ 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 |
Line 255 $5 #ifdef NO_IP
|
Line 340 $5 #ifdef NO_IP
|
JUMP(a_target); |
JUMP(a_target); |
#else |
#else |
SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
|
#endif |
|
} |
|
$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); |
|
#endif |
|
} |
|
|
|
\+ |
|
) |
|
|
|
\ 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; |
INST_TAIL; NEXT_P2; |
#endif |
#endif |
} |
} |
Line 293 condbranch(?branch,f --,f83 question_bra
|
Line 409 condbranch(?branch,f --,f83 question_bra
|
|
|
\+xconds |
\+xconds |
|
|
?dup-?branch ( #a_target f -- f ) new question_dupe_question_branch |
?dup-?branch ( #a_target f -- S:... ) 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++; |
|
IF_spTOS(spTOS = sp[0]); |
|
#ifdef NO_IP |
#ifdef NO_IP |
INST_TAIL; |
INST_TAIL; |
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[0]=f; |
} |
} |
SUPER_CONTINUE; |
|
|
|
?dup-0=-?branch ( #a_target f -- ) 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}."" |
/* 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 |
|
few cycles in that case, but is easy to convert to a CONDBRANCH |
|
invocation */ |
|
if (f!=0) { |
if (f!=0) { |
sp--; |
sp--; |
|
sp[0]=f; |
#ifdef NO_IP |
#ifdef NO_IP |
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] |
Line 349 condbranch((+loop),n R:nlimit R:n1 -- R:
|
Line 459 condbranch((+loop),n R:nlimit R:n1 -- R:
|
/* dependent upon two's complement arithmetic */ |
/* dependent upon two's complement arithmetic */ |
Cell olddiff = n1-nlimit; |
Cell olddiff = n1-nlimit; |
n2=n1+n; |
n2=n1+n; |
,if ((olddiff^(olddiff+n))>=0 /* the limit is not crossed */ |
,if (((olddiff^(olddiff+n)) /* the limit is not crossed */ |
|| (olddiff^n)>=0 /* it is a wrap-around effect */) { |
&(olddiff^n)) /* OR it is a wrap-around effect */ |
|
>=0) { /* & is used to avoid having two branches for gforth-native */ |
,: |
,: |
r> swap |
r> swap |
r> r> 2dup - >r |
r> r> 2dup - >r |
Line 379 if (n<0) {
|
Line 490 if (n<0) {
|
newdiff = -newdiff; |
newdiff = -newdiff; |
} |
} |
n2=n1+n; |
n2=n1+n; |
,if (diff>=0 || newdiff<0) { |
,if (((~diff)|newdiff)<0) { /* use | to avoid two branches for gforth-native */ |
,) |
,) |
|
|
\+ |
\+ |
Line 403 if (nstart == nlimit) {
|
Line 514 if (nstart == nlimit) {
|
JUMP(a_target); |
JUMP(a_target); |
#else |
#else |
SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
INST_TAIL; NEXT_P2; |
|
#endif |
#endif |
} |
} |
SUPER_CONTINUE; |
|
: |
: |
2dup = |
2dup = |
IF r> swap rot >r >r |
IF r> swap rot >r >r |
Line 426 if (nstart >= nlimit) {
|
Line 535 if (nstart >= nlimit) {
|
JUMP(a_target); |
JUMP(a_target); |
#else |
#else |
SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
INST_TAIL; NEXT_P2; |
|
#endif |
#endif |
} |
} |
SUPER_CONTINUE; |
|
: |
: |
swap 2dup |
swap 2dup |
r> swap >r swap >r |
r> swap >r swap >r |
Line 449 if (ustart >= ulimit) {
|
Line 556 if (ustart >= ulimit) {
|
JUMP(a_target); |
JUMP(a_target); |
#else |
#else |
SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
INST_TAIL; NEXT_P2; |
|
#endif |
#endif |
} |
} |
SUPER_CONTINUE; |
|
: |
: |
swap 2dup |
swap 2dup |
r> swap >r swap >r |
r> swap >r swap >r |
Line 472 if (nstart <= nlimit) {
|
Line 577 if (nstart <= nlimit) {
|
JUMP(a_target); |
JUMP(a_target); |
#else |
#else |
SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
INST_TAIL; NEXT_P2; |
|
#endif |
#endif |
} |
} |
SUPER_CONTINUE; |
|
: |
: |
swap 2dup |
swap 2dup |
r> swap >r swap >r |
r> swap >r swap >r |
Line 495 if (ustart <= ulimit) {
|
Line 598 if (ustart <= ulimit) {
|
JUMP(a_target); |
JUMP(a_target); |
#else |
#else |
SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
INST_TAIL; NEXT_P2; |
|
#endif |
#endif |
} |
} |
SUPER_CONTINUE; |
|
: |
: |
swap 2dup |
swap 2dup |
r> swap >r swap >r |
r> swap >r swap >r |
Line 557 cmove ( c_from c_to u -- ) string c_move
|
Line 658 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 667 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 687 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 719 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 |
capscompare ( c_addr1 u1 c_addr2 u2 -- n ) string |
n = memcasecmp(c_addr1, c_addr2, u); /* !! use something that works in all locales */ |
""Compare two strings lexicographically. If they are equal, @i{n} is 0; if |
if (n<0) |
the first string is smaller, @i{n} is -1; if the first string is larger, @i{n} |
n = -1; |
is 1. Currently this is based on the machine's character |
else if (n>0) |
comparison. In the future, this may change to consider the current |
n = 1; |
locale and its collation order."" |
: |
/* close ' to keep fontify happy */ |
swap bounds |
n = capscompare(c_addr1, u1, c_addr2, u2); |
?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} |
Line 725 n = n1*n2;
|
Line 809 n = n1*n2;
|
|
|
/ ( 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--; |
: |
: |
/mod nip ; |
/mod nip ; |
|
|
mod ( n1 n2 -- n ) core |
mod ( n1 n2 -- n ) core |
n = n1%n2; |
n = n1%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 (FLOORED_DIV && ((n1^n2) < 0) && n3!=0) { |
|
n4--; |
|
n3+=n2; |
|
} |
: |
: |
>r s>d r> fm/mod ; |
>r s>d r> fm/mod ; |
|
|
|
*/mod ( n1 n2 n3 -- n4 n5 ) core star_slash_mod |
|
""n1*n2=n3*n5+n4, with the intermediate result (n1*n2) being double."" |
|
#ifdef BUGGY_LL_MUL |
|
DCell d = mmul(n1,n2); |
|
#else |
|
DCell d = (DCell)n1 * (DCell)n2; |
|
#endif |
|
#ifdef BUGGY_LL_DIV |
|
DCell r = fmdiv(d,n3); |
|
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) { |
|
n5--; |
|
n4+=n3; |
|
} |
|
#endif |
|
: |
|
>r m* r> fm/mod ; |
|
|
|
*/ ( n1 n2 n3 -- n4 ) core star_slash |
|
""n4=(n1*n2)/n3, with the intermediate result being double."" |
|
#ifdef BUGGY_LL_MUL |
|
DCell d = mmul(n1,n2); |
|
#else |
|
DCell d = (DCell)n1 * (DCell)n2; |
|
#endif |
|
#ifdef BUGGY_LL_DIV |
|
DCell r = fmdiv(d,n3); |
|
n4=DLO(r); |
|
#else |
|
/* assumes that the processor uses either floored or symmetric division */ |
|
n4 = d/n3; |
|
if (FLOORED_DIV && ((DHI(d)^n3)<0) && (d%n3)!=0) n4--; |
|
#endif |
|
: |
|
*/mod nip ; |
|
|
2* ( n1 -- n2 ) core two_star |
2* ( n1 -- n2 ) core two_star |
""Shift left by 1; also works on unsigned numbers"" |
""Shift left by 1; also works on unsigned numbers"" |
n2 = 2*n1; |
n2 = 2*n1; |
Line 751 division by 2 (note that @code{/} not ne
|
Line 882 division by 2 (note that @code{/} not ne
|
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_LONG_LONG |
#ifdef BUGGY_LL_DIV |
|
#ifdef ASM_SM_SLASH_REM |
|
ASM_SM_SLASH_REM(d1.lo, d1.hi, n1, n2, n3); |
|
if (((DHI(d1)^n1)<0) && n2!=0) { |
|
n3--; |
|
n2+=n1; |
|
} |
|
#else /* !defined(ASM_SM_SLASH_REM) */ |
DCell r = fmdiv(d1,n1); |
DCell r = fmdiv(d1,n1); |
n2=r.hi; |
n2=DHI(r); |
n3=r.lo; |
n3=DLO(r); |
#else |
#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 */ |
/* assumes that the processor uses either floored or symmetric division */ |
n3 = d1/n1; |
n3 = d1/n1; |
n2 = d1%n1; |
n2 = d1%n1; |
/* note that this 1%-3>0 is optimized by the compiler */ |
/* note that this 1%-3>0 is optimized by the compiler */ |
if (1%-3>0 && (d1<0) != (n1<0) && n2!=0) { |
if (1%-3>0 && ((DHI(d1)^n1)<0) && n2!=0) { |
n3--; |
n3--; |
n2+=n1; |
n2+=n1; |
} |
} |
|
#endif /* !defined(ASM_SM_SLASH_REM4) */ |
#endif |
#endif |
: |
: |
dup >r dup 0< IF negate >r dnegate r> THEN |
dup >r dup 0< IF negate >r dnegate r> THEN |
Line 780 if (1%-3>0 && (d1<0) != (n1<0) && n2!=0)
|
Line 927 if (1%-3>0 && (d1<0) != (n1<0) && n2!=0)
|
|
|
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_LONG_LONG |
#ifdef BUGGY_LL_DIV |
|
#ifdef ASM_SM_SLASH_REM |
|
ASM_SM_SLASH_REM(d1.lo, d1.hi, n1, n2, n3); |
|
#else /* !defined(ASM_SM_SLASH_REM) */ |
DCell r = smdiv(d1,n1); |
DCell r = smdiv(d1,n1); |
n2=r.hi; |
n2=DHI(r); |
n3=r.lo; |
n3=DLO(r); |
#else |
#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 */ |
/* assumes that the processor uses either floored or symmetric division */ |
n3 = d1/n1; |
n3 = d1/n1; |
n2 = d1%n1; |
n2 = d1%n1; |
/* note that this 1%-3<0 is optimized by the compiler */ |
/* note that this 1%-3<0 is optimized by the compiler */ |
if (1%-3<0 && (d1<0) != (n1<0) && n2!=0) { |
if (1%-3<0 && ((DHI(d1)^n1)<0) && n2!=0) { |
n3++; |
n3++; |
n2-=n1; |
n2-=n1; |
} |
} |
|
#endif /* !defined(ASM_SM_SLASH_REM4) */ |
#endif |
#endif |
: |
: |
over >r dup >r abs -rot |
over >r dup >r abs -rot |
Line 801 if (1%-3<0 && (d1<0) != (n1<0) && n2!=0)
|
Line 956 if (1%-3<0 && (d1<0) != (n1<0) && n2!=0)
|
r> 0< IF swap negate swap THEN ; |
r> 0< IF swap negate swap THEN ; |
|
|
m* ( n1 n2 -- d ) core m_star |
m* ( n1 n2 -- d ) core m_star |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_MUL |
d = mmul(n1,n2); |
d = mmul(n1,n2); |
#else |
#else |
d = (DCell)n1 * (DCell)n2; |
d = (DCell)n1 * (DCell)n2; |
Line 813 d = (DCell)n1 * (DCell)n2;
|
Line 968 d = (DCell)n1 * (DCell)n2;
|
|
|
um* ( u1 u2 -- ud ) core u_m_star |
um* ( u1 u2 -- ud ) core u_m_star |
/* use u* as alias */ |
/* use u* as alias */ |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_MUL |
ud = ummul(u1,u2); |
ud = ummul(u1,u2); |
#else |
#else |
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> ; |
|
|
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_LONG_LONG |
#ifdef BUGGY_LL_DIV |
|
#ifdef ASM_UM_SLASH_MOD |
|
ASM_UM_SLASH_MOD(ud.lo, ud.hi, u1, u2, u3); |
|
#else /* !defined(ASM_UM_SLASH_MOD) */ |
UDCell r = umdiv(ud,u1); |
UDCell r = umdiv(ud,u1); |
u2=r.hi; |
u2=DHI(r); |
u3=r.lo; |
u3=DLO(r); |
#else |
#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; |
u3 = ud/u1; |
u2 = ud%u1; |
u2 = ud%u1; |
|
#endif /* !defined(ASM_UM_SLASH_MOD4) */ |
#endif |
#endif |
: |
: |
0 swap [ 8 cells 1 + ] literal 0 |
0 swap [ 8 cells 1 + ] literal 0 |
Line 849 u2 = ud%u1;
|
Line 1011 u2 = ud%u1;
|
and >r >r 2dup d+ swap r> + swap r> ; |
and >r >r 2dup d+ swap r> + swap r> ; |
|
|
m+ ( d1 n -- d2 ) double m_plus |
m+ ( d1 n -- d2 ) double m_plus |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_ADD |
d2.lo = d1.lo+n; |
DLO_IS(d2, DLO(d1)+n); |
d2.hi = d1.hi - (n<0) + (d2.lo<d1.lo); |
DHI_IS(d2, DHI(d1) - (n<0) + (DLO(d2)<DLO(d1))); |
#else |
#else |
d2 = d1+n; |
d2 = d1+n; |
#endif |
#endif |
Line 859 d2 = d1+n;
|
Line 1021 d2 = d1+n;
|
s>d d+ ; |
s>d d+ ; |
|
|
d+ ( d1 d2 -- d ) double d_plus |
d+ ( d1 d2 -- d ) double d_plus |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_ADD |
d.lo = d1.lo+d2.lo; |
DLO_IS(d, DLO(d1) + DLO(d2)); |
d.hi = d1.hi + d2.hi + (d.lo<d1.lo); |
DHI_IS(d, DHI(d1) + DHI(d2) + (d.lo<DLO(d1))); |
#else |
#else |
d = d1+d2; |
d = d1+d2; |
#endif |
#endif |
Line 869 d = d1+d2;
|
Line 1031 d = d1+d2;
|
rot + >r tuck + swap over u> r> swap - ; |
rot + >r tuck + swap over u> r> swap - ; |
|
|
d- ( d1 d2 -- d ) double d_minus |
d- ( d1 d2 -- d ) double d_minus |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_ADD |
d.lo = d1.lo - d2.lo; |
DLO_IS(d, DLO(d1) - DLO(d2)); |
d.hi = d1.hi-d2.hi-(d1.lo<d2.lo); |
DHI_IS(d, DHI(d1)-DHI(d2)-(DLO(d1)<DLO(d2))); |
#else |
#else |
d = d1-d2; |
d = d1-d2; |
#endif |
#endif |
Line 880 d = d1-d2;
|
Line 1042 d = d1-d2;
|
|
|
dnegate ( d1 -- d2 ) double d_negate |
dnegate ( d1 -- d2 ) double d_negate |
/* use dminus as alias */ |
/* use dminus as alias */ |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_ADD |
d2 = dnegate(d1); |
d2 = dnegate(d1); |
#else |
#else |
d2 = -d1; |
d2 = -d1; |
Line 890 d2 = -d1;
|
Line 1052 d2 = -d1;
|
|
|
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_LONG_LONG |
#ifdef BUGGY_LL_SHIFT |
d2.lo = d1.lo<<1; |
DLO_IS(d2, DLO(d1)<<1); |
d2.hi = (d1.hi<<1) | (d1.lo>>(CELL_BITS-1)); |
DHI_IS(d2, (DHI(d1)<<1) | (DLO(d1)>>(CELL_BITS-1))); |
#else |
#else |
d2 = 2*d1; |
d2 = 2*d1; |
#endif |
#endif |
Line 902 d2 = 2*d1;
|
Line 1064 d2 = 2*d1;
|
d2/ ( d1 -- d2 ) double d_two_slash |
d2/ ( d1 -- d2 ) double d_two_slash |
""Arithmetic shift right by 1. For signed numbers this is a floored |
""Arithmetic shift right by 1. For signed numbers this is a floored |
division by 2."" |
division by 2."" |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_SHIFT |
d2.hi = d1.hi>>1; |
DHI_IS(d2, DHI(d1)>>1); |
d2.lo= (d1.lo>>1) | (d1.hi<<(CELL_BITS-1)); |
DLO_IS(d2, (DLO(d1)>>1) | (DHI(d1)<<(CELL_BITS-1))); |
#else |
#else |
d2 = d1>>1; |
d2 = d1>>1; |
#endif |
#endif |
Line 930 w2 = ~w1;
|
Line 1092 w2 = ~w1;
|
|
|
rshift ( u1 n -- u2 ) core r_shift |
rshift ( u1 n -- u2 ) core r_shift |
""Logical shift right by @i{n} bits."" |
""Logical shift right by @i{n} bits."" |
u2 = u1>>n; |
#ifdef BROKEN_SHIFT |
|
u2 = rshift(u1, n); |
|
#else |
|
u2 = u1 >> n; |
|
#endif |
: |
: |
0 ?DO 2/ MAXI and LOOP ; |
0 ?DO 2/ MAXI and LOOP ; |
|
|
lshift ( u1 n -- u2 ) core l_shift |
lshift ( u1 n -- u2 ) core l_shift |
u2 = u1<<n; |
#ifdef BROKEN_SHIFT |
|
u2 = lshift(u1, n); |
|
#else |
|
u2 = u1 << n; |
|
#endif |
: |
: |
0 ?DO 2* LOOP ; |
0 ?DO 2* LOOP ; |
|
|
Line 999 comparisons(u, u1 u2, u_, u1, u2, gforth
|
Line 1169 comparisons(u, u1 u2, u_, u1, u2, gforth
|
\ dcomparisons(prefix, args, prefix, arg1, arg2, wordsets...) |
\ dcomparisons(prefix, args, prefix, arg1, arg2, wordsets...) |
define(dcomparisons, |
define(dcomparisons, |
$1= ( $2 -- f ) $6 $3equals |
$1= ( $2 -- f ) $6 $3equals |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_CMP |
f = FLAG($4.lo==$5.lo && $4.hi==$5.hi); |
f = FLAG($4.lo==$5.lo && $4.hi==$5.hi); |
#else |
#else |
f = FLAG($4==$5); |
f = FLAG($4==$5); |
#endif |
#endif |
|
|
$1<> ( $2 -- f ) $7 $3not_equals |
$1<> ( $2 -- f ) $7 $3not_equals |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_CMP |
f = FLAG($4.lo!=$5.lo || $4.hi!=$5.hi); |
f = FLAG($4.lo!=$5.lo || $4.hi!=$5.hi); |
#else |
#else |
f = FLAG($4!=$5); |
f = FLAG($4!=$5); |
#endif |
#endif |
|
|
$1< ( $2 -- f ) $8 $3less_than |
$1< ( $2 -- f ) $8 $3less_than |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_CMP |
f = FLAG($4.hi==$5.hi ? $4.lo<$5.lo : $4.hi<$5.hi); |
f = FLAG($4.hi==$5.hi ? $4.lo<$5.lo : $4.hi<$5.hi); |
#else |
#else |
f = FLAG($4<$5); |
f = FLAG($4<$5); |
#endif |
#endif |
|
|
$1> ( $2 -- f ) $9 $3greater_than |
$1> ( $2 -- f ) $9 $3greater_than |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_CMP |
f = FLAG($4.hi==$5.hi ? $4.lo>$5.lo : $4.hi>$5.hi); |
f = FLAG($4.hi==$5.hi ? $4.lo>$5.lo : $4.hi>$5.hi); |
#else |
#else |
f = FLAG($4>$5); |
f = FLAG($4>$5); |
#endif |
#endif |
|
|
$1<= ( $2 -- f ) gforth $3less_or_equal |
$1<= ( $2 -- f ) gforth $3less_or_equal |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_CMP |
f = FLAG($4.hi==$5.hi ? $4.lo<=$5.lo : $4.hi<=$5.hi); |
f = FLAG($4.hi==$5.hi ? $4.lo<=$5.lo : $4.hi<=$5.hi); |
#else |
#else |
f = FLAG($4<=$5); |
f = FLAG($4<=$5); |
#endif |
#endif |
|
|
$1>= ( $2 -- f ) gforth $3greater_or_equal |
$1>= ( $2 -- f ) gforth $3greater_or_equal |
#ifdef BUGGY_LONG_LONG |
#ifdef BUGGY_LL_CMP |
f = FLAG($4.hi==$5.hi ? $4.lo>=$5.lo : $4.hi>=$5.hi); |
f = FLAG($4.hi==$5.hi ? $4.lo>=$5.lo : $4.hi>=$5.hi); |
#else |
#else |
f = FLAG($4>=$5); |
f = FLAG($4>=$5); |
Line 1068 useraddr ( #u -- a_addr ) new
|
Line 1238 useraddr ( #u -- a_addr ) new
|
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=(char *)a_addr; |
: |
: |
up ! ; |
up ! ; |
Variable UP |
Variable UP |
|
|
sp@ ( -- a_addr ) gforth sp_fetch |
sp@ ( S:... -- a_addr ) gforth sp_fetch |
a_addr = sp+1; |
a_addr = sp; |
|
|
sp! ( a_addr -- ) gforth sp_store |
sp! ( a_addr -- S:... ) gforth sp_store |
sp = a_addr; |
sp = a_addr; |
/* works with and without spTOS caching */ |
|
|
|
rp@ ( -- a_addr ) gforth rp_fetch |
rp@ ( -- a_addr ) gforth rp_fetch |
a_addr = rp; |
a_addr = rp; |
Line 1088 rp = a_addr;
|
Line 1257 rp = a_addr;
|
|
|
\+floating |
\+floating |
|
|
fp@ ( -- f_addr ) gforth fp_fetch |
fp@ ( f:... -- f_addr ) gforth fp_fetch |
f_addr = fp; |
f_addr = fp; |
|
|
fp! ( f_addr -- ) gforth fp_store |
fp! ( f_addr -- f:... ) gforth fp_store |
fp = f_addr; |
fp = f_addr; |
|
|
\+ |
\+ |
Line 1110 rdrop ( R:w -- ) gforth
|
Line 1279 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 1164 tuck ( w1 w2 -- w2 w1 w2 ) core-ext
|
Line 1333 tuck ( w1 w2 -- w2 w1 w2 ) core-ext
|
: |
: |
swap over ; |
swap over ; |
|
|
?dup ( w -- w ) core question_dupe |
?dup ( w -- S:... w ) core question_dupe |
""Actually the stack effect is: @code{( w -- 0 | w w )}. It performs a |
""Actually the stack effect is: @code{( w -- 0 | w w )}. It performs a |
@code{dup} if w is nonzero."" |
@code{dup} if w is nonzero."" |
if (w!=0) { |
if (w!=0) { |
IF_spTOS(*sp-- = w;) |
|
#ifndef USE_TOS |
|
*--sp = w; |
*--sp = w; |
#endif |
|
} |
} |
: |
: |
dup IF dup THEN ; |
dup IF dup THEN ; |
|
|
pick ( u -- w ) core-ext |
pick ( S:... u -- S:... w ) core-ext |
""Actually the stack effect is @code{ x0 ... xu u -- x0 ... xu x0 }."" |
""Actually the stack effect is @code{ x0 ... xu u -- x0 ... xu x0 }."" |
w = sp[u+1]; |
w = sp[u]; |
: |
: |
1+ cells sp@ + @ ; |
1+ cells sp@ + @ ; |
|
|
Line 1342 c_addr2 = c_addr1+1;
|
Line 1508 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 1545 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 1568 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 1576 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 1601 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 1495 n = key((FILE*)wfileid);
|
Line 1654 n = key((FILE*)wfileid);
|
n = key(stdin); |
n = key(stdin); |
#endif |
#endif |
|
|
key?-file ( wfileid -- n ) facility key_q_file |
key?-file ( wfileid -- n ) gforth key_q_file |
#ifdef HAS_FILE |
#ifdef HAS_FILE |
fflush(stdout); |
fflush(stdout); |
n = key_query((FILE*)wfileid); |
n = key_query((FILE*)wfileid); |
Line 1538 FLUSH_ICACHE(c_addr,u);
|
Line 1697 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 |
wretval = gforth_system(c_addr, u); |
int old_tp=terminal_prepped; |
|
deprep_terminal(); |
|
#endif |
|
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) |
|
prep_terminal(); |
|
#endif |
|
|
|
getenv ( c_addr1 u1 -- c_addr2 u2 ) gforth |
getenv ( c_addr1 u1 -- c_addr2 u2 ) gforth |
""The string @i{c-addr1 u1} specifies an environment variable. The string @i{c-addr2 u2} |
""The string @i{c-addr1 u1} specifies an environment variable. The string @i{c-addr2 u2} |
Line 1570 wior = IOR(wretval==-1);
|
Line 1721 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 1734 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 1788 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 |
""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{SP} and @code{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 */ |
IF_fpTOS(fp[0]=fpTOS); |
gforth_FP=fp; |
FP=fp; |
gforth_SP=sp; |
SP=sp; |
|
((void (*)())w)(); |
((void (*)())w)(); |
sp=SP; |
sp=gforth_SP; |
fp=FP; |
fp=gforth_FP; |
IF_spTOS(spTOS=sp[0]); |
|
IF_fpTOS(fpTOS=fp[0]); |
|
|
|
\+ |
\+ |
\+file |
\+file |
Line 1674 wior = IOR(unlink(tilde_cstr(c_addr, u,
|
Line 1829 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 1855 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 1892 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 1824 char * string = cstr(c_addr1, u1, 1);
|
Line 1942 char * string = cstr(c_addr1, u1, 1);
|
char * pattern = cstr(c_addr2, u2, 0); |
char * pattern = cstr(c_addr2, u2, 0); |
flag = FLAG(!fnmatch(pattern, string, 0)); |
flag = FLAG(!fnmatch(pattern, string, 0)); |
|
|
|
set-dir ( c_addr u -- wior ) gforth set_dir |
|
""Change the current directory to @i{c-addr, u}. |
|
Return an error if this is not possible"" |
|
wior = IOR(chdir(tilde_cstr(c_addr, u, 1))); |
|
|
|
get-dir ( c_addr1 u1 -- c_addr2 u2 ) gforth get_dir |
|
""Store the current directory in the buffer specified by @{c-addr1, u1}. |
|
If the buffer size is not sufficient, return 0 0"" |
|
c_addr2 = getcwd(c_addr1, u1); |
|
if(c_addr2 != NULL) { |
|
u2 = strlen(c_addr2); |
|
} else { |
|
u2 = 0; |
|
} |
|
|
\+ |
\+ |
|
|
newline ( -- c_addr u ) gforth |
newline ( -- c_addr u ) gforth |
Line 1866 dsystem = timeval2us(&usage.ru_stime);
|
Line 1999 dsystem = timeval2us(&usage.ru_stime);
|
struct timeval time1; |
struct timeval time1; |
gettimeofday(&time1,NULL); |
gettimeofday(&time1,NULL); |
duser = timeval2us(&time1); |
duser = timeval2us(&time1); |
#ifndef BUGGY_LONG_LONG |
dsystem = DZERO; |
dsystem = (DCell)0; |
|
#else |
|
dsystem=(DCell){0,0}; |
|
#endif |
|
#endif |
#endif |
|
|
\+ |
\+ |
Line 1882 dsystem=(DCell){0,0};
|
Line 2011 dsystem=(DCell){0,0};
|
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_LONG_LONG |
#ifdef BUGGY_LL_D2F |
extern double ldexp(double x, int exp); |
extern double ldexp(double x, int exp); |
if (d.hi<0) { |
if (DHI(d)<0) { |
|
#ifdef BUGGY_LL_ADD |
DCell d2=dnegate(d); |
DCell d2=dnegate(d); |
r = -(ldexp((Float)d2.hi,CELL_BITS) + (Float)d2.lo); |
#else |
|
DCell d2=-d; |
|
#endif |
|
r = -(ldexp((Float)DHI(d2),CELL_BITS) + (Float)DLO(d2)); |
} else |
} else |
r = ldexp((Float)d.hi,CELL_BITS) + (Float)d.lo; |
r = ldexp((Float)DHI(d),CELL_BITS) + (Float)DLO(d); |
#else |
#else |
r = d; |
r = d; |
#endif |
#endif |
Line 1898 f>d ( r -- d ) float f_to_d
|
Line 2034 f>d ( r -- d ) float f_to_d
|
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; |
Line 1956 f** ( r1 r2 -- r3 ) float-ext f_star_sta
|
Line 2095 f** ( r1 r2 -- r3 ) float-ext f_star_sta
|
""@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; |
|
|
Line 2012 n=(r==0. ? 1 : decpt);
|
Line 2163 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; |
|
if (!f2) /* workaround Cygwin trailing 0s for Inf and Nan */ |
|
for (; sig[siglen-1]=='0'; siglen--); |
|
; |
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); |
|
|
>float ( c_addr u -- flag ) float to_float |
>float ( c_addr u -- f:... flag ) float to_float |
""Actual stack effect: ( c_addr u -- r t | f ). Attempt to convert the |
""Actual stack effect: ( c_addr u -- r t | f ). Attempt to convert the |
character string @i{c-addr u} to internal floating-point |
character string @i{c-addr u} to internal floating-point |
representation. If the string represents a valid floating-point number |
representation. If the string represents a valid floating-point number |
@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; |
fp--; |
if(number[0]=='-') { |
fp[0]=r; |
sign = 1; |
|
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 2321 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 2329 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 2292 f>l ( r -- ) gforth f_to_l
|
Line 2408 f>l ( r -- ) gforth f_to_l
|
lp -= sizeof(Float); |
lp -= sizeof(Float); |
*(Float *)lp = r; |
*(Float *)lp = r; |
|
|
fpick ( u -- r ) gforth |
fpick ( f:... u -- f:... r ) gforth |
""Actually the stack effect is @code{ r0 ... ru u -- r0 ... ru r0 }."" |
""Actually the stack effect is @code{ r0 ... ru u -- r0 ... ru r0 }."" |
r = fp[u+1]; /* +1, because update of fp happens before this fragment */ |
r = fp[u]; |
: |
: |
floats fp@ + f@ ; |
floats fp@ + f@ ; |
|
|
Line 2305 r = fp[u+1]; /* +1, because update of fp
|
Line 2421 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 |
|
gforth_FP=fp; |
|
sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &gforth_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 |
|
|
|
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 |
|
#ifdef BUGGY_LL_SIZE |
|
av_longlong(alist, DLO(d)); |
|
#else |
|
av_longlong(alist, d); |
|
#endif |
|
|
|
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 |
|
#ifdef BUGGY_LL_SIZE |
|
av_longlong(alist, DLO(d)); |
|
#else |
|
av_longlong(alist, d); |
|
#endif |
|
|
|
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 |
|
#ifdef BUGGY_LONG_LONG |
|
DLO_IS(d, llrv); |
|
DHI_IS(d, 0); |
|
#else |
|
d = llrv; |
|
#endif |
|
|
|
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(gforth_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 |
|
#ifdef BUGGY_LONG_LONG |
|
DLO_IS(d, va_arg_longlong(clist)); |
|
DHI_IS(d, 0); |
|
#else |
|
d = va_arg_longlong(clist); |
|
#endif |
|
|
|
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 |
|
#ifdef BUGGY_LONG_LONG |
|
va_return_longlong(clist, d.lo); |
|
#else |
|
va_return_longlong(clist, d); |
|
#endif |
|
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; |
|
|
|
\+ |
|
|
|
\+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(a_cif, FFI_DEFAULT_ABI, n, a_rtype, a_atypes); |
|
|
|
ffi-call ( a_avalues a_rvalue a_ip a_cif -- ) gforth ffi_call |
|
SAVE_REGS |
|
ffi_call(a_cif, a_ip, a_rvalue, a_avalues); |
|
REST_REGS |
|
|
|
ffi-prep-closure ( a_ip a_cif a_closure -- w ) gforth ffi_prep_closure |
|
w = ffi_prep_closure(a_closure, a_cif, gforth_callback, 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 *)(*clist++); |
|
|
|
ffi-arg-longlong ( -- d ) gforth ffi_arg_longlong |
|
#ifdef BUGGY_LONG_LONG |
|
DLO_IS(d, (Cell*)(*clist++)); |
|
DHI_IS(d, 0); |
|
#else |
|
d = *(DCell*)(*clist++); |
|
#endif |
|
|
|
ffi-arg-ptr ( -- c_addr ) gforth ffi_arg_ptr |
|
c_addr = *(char **)(*clist++); |
|
|
|
ffi-arg-float ( -- r ) gforth ffi_arg_float |
|
r = *(float*)(*clist++); |
|
|
|
ffi-arg-double ( -- r ) gforth ffi_arg_double |
|
r = *(double*)(*clist++); |
|
|
|
ffi-ret-void ( -- ) gforth ffi_ret_void |
|
return 0; |
|
|
|
ffi-ret-int ( w -- ) gforth ffi_ret_int |
|
*(int*)(ritem) = w; |
|
return 0; |
|
|
|
ffi-ret-longlong ( d -- ) gforth ffi_ret_longlong |
|
#ifdef BUGGY_LONG_LONG |
|
*(Cell*)(ritem) = DLO(d); |
|
#else |
|
*(DCell*)(ritem) = d; |
|
#endif |
|
return 0; |
|
|
|
ffi-ret-ptr ( c_addr -- ) gforth ffi_ret_ptr |
|
*(char **)(ritem) = c_addr; |
|
return 0; |
|
|
|
ffi-ret-float ( r -- ) gforth ffi_ret_float |
|
*(float*)(ritem) = r; |
|
return 0; |
|
|
|
ffi-ret-double ( r -- ) gforth ffi_ret_double |
|
*(double*)(ritem) = 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 2776 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); |
|
|
finish-code ( -- ) gforth finish_code |
finish-code ( ... -- ... ) gforth finish_code |
""Perform delayed steps in code generation (branch resolution, I-cache |
""Perform delayed steps in code generation (branch resolution, I-cache |
flushing)."" |
flushing)."" |
|
/* The ... above are a workaround for a bug in gcc-2.95, which fails |
|
to save spTOS (gforth-fast --enable-force-reg) */ |
finish_code(); |
finish_code(); |
|
|
forget-dyncode ( c_code -- f ) gforth-internal forget_dyncode |
forget-dyncode ( c_code -- f ) gforth-internal forget_dyncode |
Line 2416 JUMP(a_callee);
|
Line 2824 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(`STACK_CACHE_FILE', |
|
`include(peeprules.vmg)') |
|
|
\g end |
\g end |