version 1.125, 2003/01/26 20:56:37
|
version 1.250, 2010/05/17 09:01: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,2006,2007,2008,2009 Free Software Foundation, Inc. |
|
|
\ This file is part of Gforth. |
\ This file is part of Gforth. |
|
|
\ Gforth is free software; you can redistribute it and/or |
\ Gforth is free software; you can redistribute it and/or |
\ modify it under the terms of the GNU General Public License |
\ modify it under the terms of the GNU General Public License |
\ as published by the Free Software Foundation; either version 2 |
\ as published by the Free Software Foundation, either version 3 |
\ of the License, or (at your option) any later version. |
\ of the License, or (at your option) any later version. |
|
|
\ This program is distributed in the hope that it will be useful, |
\ This program is distributed in the hope that it will be useful, |
Line 15
|
Line 15
|
\ GNU General Public License for more details. |
\ GNU General Public License for more details. |
|
|
\ You should have received a copy of the GNU General Public License |
\ You should have received a copy of the GNU General Public License |
\ along with this program; if not, write to the Free Software |
\ along with this program. If not, see http://www.gnu.org/licenses/. |
\ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. |
|
|
|
|
|
\ WARNING: This file is processed by m4. Make sure your identifiers |
\ WARNING: This file is processed by m4. Make sure your identifiers |
Line 100
|
Line 99
|
\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 137
|
\ 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) */ |
|
|
|
(dovalue) ( -- w ) gforth-internal paren_doval |
|
""run-time routine for constants"" |
|
w = *(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; |
|
#ifdef DEBUG |
|
fprintf(stderr, "dodoes to %x, push %x\n", a_retaddr, a_body); |
|
#endif |
|
goto **(Label *)DOES_CODE1(CFA); |
|
#else /* !defined(NO_IP) */ |
|
a_retaddr = (Cell *)IP; |
|
a_body = PFA(CFA); |
|
#ifdef DEBUG |
|
fprintf(stderr, "dodoes to %x, push %x\n", a_retaddr, a_body); |
|
#endif |
|
SET_IP(DOES_CODE1(CFA)); |
|
#endif /* !defined(NO_IP) */ |
|
|
|
(doabicode) ( ... -- ...) gforth-internal paren_doabicode |
|
""run-time routine for @code{ABI-code} definitions"" |
|
abifunc *f = (abifunc *)PFA(CFA); |
|
Float *fp_mem = fp; |
|
sp = (*f)(sp, &fp_mem); |
|
fp = fp_mem; |
|
#ifdef NO_IP |
|
INST_TAIL; |
|
goto *next_code; |
|
#endif /* defined(NO_IP) */ |
|
|
|
(do;abicode) ( ... -- ... ) gforth-internal paren_do_semicolon_abi_code |
|
""run-time routine for @code{;abi-code}-defined words"" |
|
Float *fp_mem = fp; |
|
Address body = (Address)PFA(CFA); |
|
semiabifunc *f = (semiabifunc *)DOES_CODE1(CFA); |
|
sp = (*f)(sp, &fp_mem, body); |
|
fp = fp_mem; |
|
#ifdef NO_IP |
|
INST_TAIL; |
|
goto *next_code; |
|
#endif /* defined(NO_IP) */ |
|
|
|
\F [endif] |
|
|
\g control |
\g control |
|
|
noop ( -- ) gforth |
noop ( -- ) gforth |
Line 146 noop ( -- ) gforth
|
Line 263 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 162 SET_IP((Xt *)a_callee);
|
Line 280 SET_IP((Xt *)a_callee);
|
|
|
execute ( xt -- ) core |
execute ( xt -- ) core |
""Perform the semantics represented by the execution token, @i{xt}."" |
""Perform the semantics represented by the execution token, @i{xt}."" |
|
#ifdef DEBUG |
|
fprintf(stderr, "execute %08x\n", xt); |
|
#endif |
#ifndef NO_IP |
#ifndef NO_IP |
ip=IP; |
ip=IP; |
#endif |
#endif |
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 295 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 319 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 328 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 255 $5 #ifdef NO_IP
|
Line 373 $5 #ifdef NO_IP
|
JUMP(a_target); |
JUMP(a_target); |
#else |
#else |
SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
INST_TAIL; NEXT_P2; |
ifelse(condbranch_opt,`1',`INST_TAIL; NEXT_P2;',`/* condbranch_opt=0 */') |
#endif |
#endif |
} |
} |
SUPER_CONTINUE; |
ifelse(condbranch_opt,`1',`SUPER_CONTINUE;',`/* condbranch_opt=0 */') |
$6 |
$6 |
|
|
\+glocals |
\+glocals |
Line 272 $5 lp += nlocals;
|
Line 390 $5 lp += nlocals;
|
JUMP(a_target); |
JUMP(a_target); |
#else |
#else |
SET_IP((Xt *)a_target); |
SET_IP((Xt *)a_target); |
INST_TAIL; NEXT_P2; |
ifelse(condbranch_opt,`1',`INST_TAIL; NEXT_P2;',`/* condbranch_opt=0 */') |
#endif |
#endif |
} |
} |
SUPER_CONTINUE; |
ifelse(condbranch_opt,`1',`SUPER_CONTINUE;',`/* condbranch_opt=0 */') |
|
|
\+ |
\+ |
) |
) |
Line 293 condbranch(?branch,f --,f83 question_bra
|
Line 411 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 461 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 492 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 516 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 537 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 558 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 579 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 600 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 525 i' ( R:w R:w2 -- R:w R:w2 w ) gforth i
|
Line 628 i' ( R:w R:w2 -- R:w R:w2 w ) gforth i
|
r> r> r> dup itmp ! >r >r >r itmp @ ; |
r> r> r> dup itmp ! >r >r >r itmp @ ; |
variable itmp |
variable itmp |
|
|
j ( R:n R:d1 -- n R:n R:d1 ) core |
j ( R:w R:w1 R:w2 -- w R:w R:w1 R:w2 ) core |
: |
: |
\ rp@ cell+ cell+ cell+ @ ; |
\ rp@ cell+ cell+ cell+ @ ; |
r> r> r> r> dup itmp ! >r >r >r >r itmp @ ; |
r> r> r> r> dup itmp ! >r >r >r >r itmp @ ; |
[IFUNDEF] itmp variable itmp [THEN] |
[IFUNDEF] itmp variable itmp [THEN] |
|
|
k ( R:n R:d1 R:d2 -- n R:n R:d1 R:d2 ) gforth |
k ( R:w R:w1 R:w2 R:w3 R:w4 -- w R:w R:w1 R:w2 R:w3 R:w4 ) gforth |
: |
: |
\ rp@ [ 5 cells ] Literal + @ ; |
\ rp@ [ 5 cells ] Literal + @ ; |
r> r> r> r> r> r> dup itmp ! >r >r >r >r >r >r itmp @ ; |
r> r> r> r> r> r> dup itmp ! >r >r >r >r >r >r itmp @ ; |
Line 590 n = compare(c_addr1, u1, c_addr2, u2);
|
Line 693 n = compare(c_addr1, u1, c_addr2, u2);
|
: |
: |
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 ; |
|
: -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 ) |
: sgn ( n -- -1/0/1 ) |
dup 0= IF EXIT THEN 0< 2* 1+ ; |
dup 0= IF EXIT THEN 0< 2* 1+ ; |
|
|
Line 614 c2 = toupper(c1);
|
Line 721 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 - ; |
|
|
|
capscompare ( c_addr1 u1 c_addr2 u2 -- n ) gforth |
|
""Compare two strings lexicographically. If they are equal, @i{n} is 0; if |
|
the first string is smaller, @i{n} is -1; if the first string is larger, @i{n} |
|
is 1. Currently this is based on the machine's character |
|
comparison. In the future, this may change to consider the current |
|
locale and its collation order."" |
|
/* close ' to keep fontify happy */ |
|
n = capscompare(c_addr1, u1, c_addr2, u2); |
|
|
/string ( c_addr1 u1 n -- c_addr2 u2 ) string slash_string |
/string ( c_addr1 u1 n -- c_addr2 u2 ) string slash_string |
""Adjust the string specified by @i{c-addr1, u1} to remove @i{n} |
""Adjust the string specified by @i{c-addr1, u1} to remove @i{n} |
characters from the start of the string."" |
characters from the start of the string."" |
Line 634 n = n1+n2;
|
Line 750 n = n1+n2;
|
\ lit+ / lit_plus = lit + |
\ lit+ / lit_plus = lit + |
|
|
lit+ ( n1 #n2 -- n ) new lit_plus |
lit+ ( n1 #n2 -- n ) new lit_plus |
|
#ifdef DEBUG |
|
fprintf(stderr, "lit+ %08x\n", n2); |
|
#endif |
n=n1+n2; |
n=n1+n2; |
|
|
\ PFE-0.9.14 has it differently, but the next release will have it as follows |
\ PFE-0.9.14 has it differently, but the next release will have it as follows |
Line 695 n = n1*n2;
|
Line 814 n = n1*n2;
|
|
|
/ ( n1 n2 -- n ) core slash |
/ ( n1 n2 -- n ) core slash |
n = n1/n2; |
n = n1/n2; |
|
if (CHECK_DIVISION_SW && n2 == 0) |
|
throw(BALL_DIVZERO); |
|
if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN) |
|
throw(BALL_RESULTRANGE); |
|
if (FLOORED_DIV && ((n1^n2) < 0) && (n1%n2 != 0)) |
|
n--; |
: |
: |
/mod nip ; |
/mod nip ; |
|
|
mod ( n1 n2 -- n ) core |
mod ( n1 n2 -- n ) core |
n = n1%n2; |
n = n1%n2; |
|
if (CHECK_DIVISION_SW && n2 == 0) |
|
throw(BALL_DIVZERO); |
|
if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN) |
|
throw(BALL_RESULTRANGE); |
|
if(FLOORED_DIV && ((n1^n2) < 0) && n!=0) n += n2; |
: |
: |
/mod drop ; |
/mod drop ; |
|
|
/mod ( n1 n2 -- n3 n4 ) core slash_mod |
/mod ( n1 n2 -- n3 n4 ) core slash_mod |
n4 = n1/n2; |
n4 = n1/n2; |
n3 = n1%n2; /* !! is this correct? look into C standard! */ |
n3 = n1%n2; /* !! is this correct? look into C standard! */ |
|
if (CHECK_DIVISION_SW && n2 == 0) |
|
throw(BALL_DIVZERO); |
|
if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN) |
|
throw(BALL_RESULTRANGE); |
|
if (FLOORED_DIV && ((n1^n2) < 0) && n3!=0) { |
|
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 ASM_SM_SLASH_REM |
|
ASM_SM_SLASH_REM(DLO(d), DHI(d), n3, n4, n5); |
|
if (FLOORED_DIV && ((DHI(d)^n3)<0) && n4!=0) { |
|
if (CHECK_DIVISION && n5 == CELL_MIN) |
|
throw(BALL_RESULTRANGE); |
|
n5--; |
|
n4+=n3; |
|
} |
|
#else |
|
DCell r = FLOORED_DIV ? fmdiv(d,n3) : smdiv(d,n3); |
|
n4=DHI(r); |
|
n5=DLO(r); |
|
#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 ASM_SM_SLASH_REM |
|
Cell remainder; |
|
ASM_SM_SLASH_REM(DLO(d), DHI(d), n3, remainder, n4); |
|
if (FLOORED_DIV && ((DHI(d)^n3)<0) && remainder!=0) { |
|
if (CHECK_DIVISION && n4 == CELL_MIN) |
|
throw(BALL_RESULTRANGE); |
|
n4--; |
|
} |
|
#else |
|
DCell r = FLOORED_DIV ? fmdiv(d,n3) : smdiv(d,n3); |
|
n4=DLO(r); |
|
#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 721 division by 2 (note that @code{/} not ne
|
Line 904 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 ASM_SM_SLASH_REM |
DCell r = fmdiv(d1,n1); |
ASM_SM_SLASH_REM(DLO(d1), DHI(d1), n1, n2, n3); |
n2=r.hi; |
if (((DHI(d1)^n1)<0) && n2!=0) { |
n3=r.lo; |
if (CHECK_DIVISION && n3 == CELL_MIN) |
#else |
throw(BALL_RESULTRANGE); |
/* assumes that the processor uses either floored or symmetric division */ |
|
n3 = d1/n1; |
|
n2 = d1%n1; |
|
/* note that this 1%-3>0 is optimized by the compiler */ |
|
if (1%-3>0 && (d1<0) != (n1<0) && n2!=0) { |
|
n3--; |
n3--; |
n2+=n1; |
n2+=n1; |
} |
} |
#endif |
#else /* !defined(ASM_SM_SLASH_REM) */ |
|
DCell r = fmdiv(d1,n1); |
|
n2=DHI(r); |
|
n3=DLO(r); |
|
#endif /* !defined(ASM_SM_SLASH_REM) */ |
: |
: |
dup >r dup 0< IF negate >r dnegate r> THEN |
dup >r dup 0< IF negate >r dnegate r> THEN |
over 0< IF tuck + swap THEN |
over 0< IF tuck + swap THEN |
Line 750 if (1%-3>0 && (d1<0) != (n1<0) && n2!=0)
|
Line 932 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 ASM_SM_SLASH_REM |
|
ASM_SM_SLASH_REM(DLO(d1), DHI(d1), 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) */ |
/* assumes that the processor uses either floored or symmetric division */ |
|
n3 = d1/n1; |
|
n2 = d1%n1; |
|
/* note that this 1%-3<0 is optimized by the compiler */ |
|
if (1%-3<0 && (d1<0) != (n1<0) && n2!=0) { |
|
n3++; |
|
n2-=n1; |
|
} |
|
#endif |
|
: |
: |
over >r dup >r abs -rot |
over >r dup >r abs -rot |
dabs rot um/mod |
dabs rot um/mod |
Line 771 if (1%-3<0 && (d1<0) != (n1<0) && n2!=0)
|
Line 946 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 783 d = (DCell)n1 * (DCell)n2;
|
Line 958 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 ASM_UM_SLASH_MOD |
|
ASM_UM_SLASH_MOD(DLO(ud), DHI(ud), 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) */ |
u3 = ud/u1; |
|
u2 = ud%u1; |
|
#endif |
|
: |
: |
0 swap [ 8 cells 1 + ] literal 0 |
0 swap [ 8 cells 1 + ] literal 0 |
?DO /modstep |
?DO /modstep |
Line 819 u2 = ud%u1;
|
Line 992 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 829 d2 = d1+n;
|
Line 1002 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 839 d = d1+d2;
|
Line 1012 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 850 d = d1-d2;
|
Line 1023 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 860 d2 = -d1;
|
Line 1033 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 |
d2 = DLSHIFT(d1,1); |
d2.lo = d1.lo<<1; |
|
d2.hi = (d1.hi<<1) | (d1.lo>>(CELL_BITS-1)); |
|
#else |
|
d2 = 2*d1; |
|
#endif |
|
: |
: |
2dup d+ ; |
2dup d+ ; |
|
|
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 900 w2 = ~w1;
|
Line 1068 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 969 comparisons(u, u1 u2, u_, u1, u2, gforth
|
Line 1145 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 1038 useraddr ( #u -- a_addr ) new
|
Line 1214 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=(Address)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 1058 rp = a_addr;
|
Line 1233 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 1080 rdrop ( R:w -- ) gforth
|
Line 1255 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 1134 tuck ( w1 w2 -- w2 w1 w2 ) core-ext
|
Line 1309 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 1312 c_addr2 = c_addr1+1;
|
Line 1484 c_addr2 = c_addr1+1;
|
|
|
\g compiler |
\g compiler |
|
|
|
\+f83headerstring |
|
|
|
(f83find) ( c_addr u f83name1 -- f83name2 ) new paren_f83find |
|
for (; f83name1 != NULL; f83name1 = (struct F83Name *)(f83name1->next)) |
|
if ((UCell)F83NAME_COUNT(f83name1)==u && |
|
memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */) |
|
break; |
|
f83name2=f83name1; |
|
#ifdef DEBUG |
|
fprintf(stderr, "F83find "); |
|
fwrite(c_addr, u, 1, stderr); |
|
fprintf(stderr, " found %08x\n", f83name2); |
|
#endif |
|
: |
|
BEGIN dup WHILE (find-samelen) dup WHILE |
|
>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 |
(listlfind) ( c_addr u longname1 -- longname2 ) new paren_listlfind |
longname2=listlfind(c_addr, u, longname1); |
longname2=listlfind(c_addr, u, longname1); |
: |
: |
Line 1322 longname2=listlfind(c_addr, u, longname1
|
Line 1526 longname2=listlfind(c_addr, u, 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 |
|
|
Line 1345 longname2 = tablelfind(c_addr, u, a_addr
|
Line 1557 longname2 = tablelfind(c_addr, u, a_addr
|
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"" |
Line 1364 Create rot-values
|
Line 1582 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 |
struct Cellpair r=parse_white(c_addr1, u1); |
struct Cellpair r=parse_white(c_addr1, u1); |
c_addr2 = (Char *)(r.n1); |
c_addr2 = (Char *)(r.n1); |
Line 1407 n=1;
|
Line 1627 n=1;
|
|
|
\g hostos |
\g hostos |
|
|
key-file ( wfileid -- n ) gforth paren_key_file |
key-file ( wfileid -- c ) gforth paren_key_file |
|
""Read one character @i{c} from @i{wfileid}. This word disables |
|
buffering for @i{wfileid}. If you want to read characters from a |
|
terminal in non-canonical (raw) mode, you have to put the terminal in |
|
non-canonical mode yourself (using the C interface); the exception is |
|
@code{stdin}: Gforth automatically puts it into non-canonical mode."" |
#ifdef HAS_FILE |
#ifdef HAS_FILE |
fflush(stdout); |
fflush(stdout); |
n = key((FILE*)wfileid); |
c = key((FILE*)wfileid); |
#else |
#else |
n = key(stdin); |
c = key(stdin); |
#endif |
#endif |
|
|
key?-file ( wfileid -- n ) facility key_q_file |
key?-file ( wfileid -- f ) gforth key_q_file |
|
""@i{f} is true if at least one character can be read from @i{wfileid} |
|
without blocking. If you also want to use @code{read-file} or |
|
@code{read-line} on the file, you have to call @code{key?-file} or |
|
@code{key-file} first (these two words disable buffering)."" |
#ifdef HAS_FILE |
#ifdef HAS_FILE |
fflush(stdout); |
fflush(stdout); |
n = key_query((FILE*)wfileid); |
f = key_query((FILE*)wfileid); |
#else |
#else |
n = key_query(stdin); |
f = key_query(stdin); |
#endif |
#endif |
|
|
\+os |
|
|
|
stdin ( -- wfileid ) gforth |
stdin ( -- wfileid ) gforth |
|
""The standard input file of the Gforth process."" |
wfileid = (Cell)stdin; |
wfileid = (Cell)stdin; |
|
|
stdout ( -- wfileid ) gforth |
stdout ( -- wfileid ) gforth |
|
""The standard output file of the Gforth process."" |
wfileid = (Cell)stdout; |
wfileid = (Cell)stdout; |
|
|
stderr ( -- wfileid ) gforth |
stderr ( -- wfileid ) gforth |
|
""The standard error output file of the Gforth process."" |
wfileid = (Cell)stderr; |
wfileid = (Cell)stderr; |
|
|
|
\+os |
|
|
form ( -- urows ucols ) gforth |
form ( -- urows ucols ) gforth |
""The number of lines and columns in the terminal. These numbers may change |
""The number of lines and columns in the terminal. These numbers may |
with the window size."" |
change with the window size. Note that it depends on the OS whether |
|
this reflects the actual size and changes with the window size |
|
(currently only on Unix-like OSs). On other OSs you just get a |
|
default, and can tell Gforth the terminal size by setting the |
|
environment variables @code{COLUMNS} and @code{LINES} before starting |
|
Gforth."" |
/* we could block SIGWINCH here to get a consistent size, but I don't |
/* we could block SIGWINCH here to get a consistent size, but I don't |
think this is necessary or always beneficial */ |
think this is necessary or always beneficial */ |
urows=rows; |
urows=rows; |
ucols=cols; |
ucols=cols; |
|
|
|
wcwidth ( u -- n ) gforth |
|
""The number of fixed-width characters per unicode character u"" |
|
#ifdef HAVE_WCWIDTH |
|
n = wcwidth(u); |
|
#else |
|
n = 1; |
|
#endif |
|
|
flush-icache ( c_addr u -- ) gforth flush_icache |
flush-icache ( c_addr u -- ) gforth flush_icache |
""Make sure that the instruction cache of the processor (if there is |
""Make sure that the instruction cache of the processor (if there is |
one) does not contain stale data at @i{c-addr} and @i{u} bytes |
one) does not contain stale data at @i{c-addr} and @i{u} bytes |
Line 1452 supported on your machine (take a look a
|
Line 1697 supported on your machine (take a look a
|
your machine has a separate instruction cache. In such cases, |
your machine has a separate instruction cache. In such cases, |
@code{flush-icache} does nothing instead of flushing the instruction |
@code{flush-icache} does nothing instead of flushing the instruction |
cache."" |
cache."" |
FLUSH_ICACHE(c_addr,u); |
FLUSH_ICACHE((caddr_t)c_addr,u); |
|
|
(bye) ( n -- ) gforth paren_bye |
(bye) ( n -- ) gforth paren_bye |
SUPER_END; |
SUPER_END; |
return (Label *)n; |
return (Label *)n; |
|
|
(system) ( c_addr u -- wretval wior ) gforth paren_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 1476 is the host operating system's expansion
|
Line 1713 is the host operating system's expansion
|
environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters |
environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters |
in length."" |
in length."" |
/* close ' to keep fontify happy */ |
/* close ' to keep fontify happy */ |
c_addr2 = getenv(cstr(c_addr1,u1,1)); |
c_addr2 = (Char *)getenv(cstr(c_addr1,u1,1)); |
u2 = (c_addr2 == NULL ? 0 : strlen(c_addr2)); |
u2 = (c_addr2 == NULL ? 0 : strlen((char *)c_addr2)); |
|
|
open-pipe ( c_addr u wfam -- wfileid wior ) gforth open_pipe |
open-pipe ( c_addr u wfam -- wfileid wior ) gforth open_pipe |
|
fflush(stdout); |
wfileid=(Cell)popen(cstr(c_addr,u,1),pfileattr[wfam]); /* ~ expansion of 1st arg? */ |
wfileid=(Cell)popen(cstr(c_addr,u,1),pfileattr[wfam]); /* ~ expansion of 1st arg? */ |
wior = IOR(wfileid==0); /* !! the man page says that errno is not set reliably */ |
wior = IOR(wfileid==0); /* !! the man page says that errno is not set reliably */ |
|
|
Line 1490 wior = IOR(wretval==-1);
|
Line 1728 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 1497 gettimeofday(&time1,&zone1);
|
Line 1741 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 1504 nhour =ltime->tm_hour;
|
Line 1749 nhour =ltime->tm_hour;
|
nmin =ltime->tm_min; |
nmin =ltime->tm_min; |
nsec =ltime->tm_sec; |
nsec =ltime->tm_sec; |
|
|
ms ( n -- ) facility-ext |
ms ( u -- ) facility-ext |
""Wait at least @i{n} milli-second."" |
""Wait at least @i{n} milli-second."" |
struct timeval timeout; |
gforth_ms(u); |
timeout.tv_sec=n/1000; |
|
timeout.tv_usec=1000*(n%1000); |
|
(void)select(0,0,0,0,&timeout); |
|
|
|
allocate ( u -- a_addr wior ) memory |
allocate ( u -- a_addr wior ) memory |
""Allocate @i{u} address units of contiguous data space. The initial |
""Allocate @i{u} address units of contiguous data space. The initial |
Line 1546 else
|
Line 1788 else
|
wior = IOR(a_addr2==NULL); /* !! Define a return code */ |
wior = IOR(a_addr2==NULL); /* !! Define a return code */ |
|
|
strerror ( n -- c_addr u ) gforth |
strerror ( n -- c_addr u ) gforth |
c_addr = strerror(n); |
c_addr = (Char *)strerror(n); |
u = strlen(c_addr); |
u = strlen((char *)c_addr); |
|
|
strsignal ( n -- c_addr u ) gforth |
strsignal ( n -- c_addr u ) gforth |
c_addr = strsignal(n); |
c_addr = (Char *)strsignal(n); |
u = strlen(c_addr); |
u = strlen((char *)c_addr); |
|
|
call-c ( w -- ) gforth call_c |
call-c ( ... w -- ... ) gforth call_c |
""Call the C function pointed to by @i{w}. The C function has to |
""Call the C function pointed to by @i{w}. The C function has to |
access the stack itself. The stack pointers are exported in the global |
access the stack itself. The stack pointers are exported in the global |
variables @code{SP} and @code{FP}."" |
variables @code{gforth_SP} and @code{gforth_FP}."" |
/* This is a first attempt at support for calls to C. This may change in |
/* This is a first attempt at support for calls to C. This may change in |
the future */ |
the future */ |
IF_fpTOS(fp[0]=fpTOS); |
IF_fpTOS(fp[0]=fpTOS); |
FP=fp; |
gforth_FP=fp; |
SP=sp; |
gforth_SP=sp; |
|
gforth_RP=rp; |
|
gforth_LP=lp; |
|
#ifdef HAS_LINKBACK |
((void (*)())w)(); |
((void (*)())w)(); |
sp=SP; |
#else |
fp=FP; |
((void (*)(void *))w)(gforth_pointers); |
IF_spTOS(spTOS=sp[0]); |
#endif |
|
sp=gforth_SP; |
|
fp=gforth_FP; |
|
rp=gforth_RP; |
|
lp=gforth_LP; |
IF_fpTOS(fpTOS=fp[0]); |
IF_fpTOS(fpTOS=fp[0]); |
|
|
\+ |
\+ |
Line 1575 close-file ( wfileid -- wior ) file clo
|
Line 1824 close-file ( wfileid -- wior ) file clo
|
wior = IOR(fclose((FILE *)wfileid)==EOF); |
wior = IOR(fclose((FILE *)wfileid)==EOF); |
|
|
open-file ( c_addr u wfam -- wfileid wior ) file open_file |
open-file ( c_addr u wfam -- wfileid wior ) file open_file |
wfileid = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[wfam]); |
wfileid = opencreate_file(tilde_cstr(c_addr,u,1), wfam, 0, &wior); |
wior = IOR(wfileid == 0); |
|
|
|
create-file ( c_addr u wfam -- wfileid wior ) file create_file |
create-file ( c_addr u wfam -- wfileid wior ) file create_file |
Cell fd; |
wfileid = opencreate_file(tilde_cstr(c_addr,u,1), wfam, O_CREAT|O_TRUNC, &wior); |
fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[wfam], 0666); |
|
if (fd != -1) { |
|
wfileid = (Cell)fdopen(fd, fileattr[wfam]); |
|
wior = IOR(wfileid == 0); |
|
} else { |
|
wfileid = 0; |
|
wior = IOR(1); |
|
} |
|
|
|
delete-file ( c_addr u -- wior ) file delete_file |
delete-file ( c_addr u -- wior ) file delete_file |
wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1); |
wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1); |
Line 1615 wior = IOR(ftruncate(fileno((FILE *)wfil
|
Line 1855 wior = IOR(ftruncate(fileno((FILE *)wfil
|
read-file ( c_addr u1 wfileid -- u2 wior ) file read_file |
read-file ( c_addr u1 wfileid -- u2 wior ) file read_file |
/* !! fread does not guarantee enough */ |
/* !! fread does not guarantee enough */ |
u2 = fread(c_addr, sizeof(Char), u1, (FILE *)wfileid); |
u2 = fread(c_addr, sizeof(Char), u1, (FILE *)wfileid); |
|
if (u2>0) |
|
gf_regetc((FILE *)wfileid); |
wior = FILEIO(u2<u1 && ferror((FILE *)wfileid)); |
wior = FILEIO(u2<u1 && ferror((FILE *)wfileid)); |
/* !! is the value of ferror errno-compatible? */ |
/* !! is the value of ferror errno-compatible? */ |
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 |
struct Cellquad r = read_line(c_addr, u1, wfileid); |
struct Cellquad r = read_line(c_addr, u1, (FILE *)wfileid); |
u2 = r.n1; |
u2 = r.n1; |
flag = r.n2; |
flag = r.n2; |
u3 = r.n3; |
u3 = r.n3; |
Line 1690 if(dent == NULL) {
|
Line 1932 if(dent == NULL) {
|
u2 = 0; |
u2 = 0; |
flag = 0; |
flag = 0; |
} else { |
} else { |
u2 = strlen(dent->d_name); |
u2 = strlen((char *)dent->d_name); |
if(u2 > u1) { |
if(u2 > u1) { |
u2 = u1; |
u2 = u1; |
wior = -512-ENAMETOOLONG; |
wior = -512-ENAMETOOLONG; |
Line 1707 char * string = cstr(c_addr1, u1, 1);
|
Line 1949 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 @i{c-addr1, u1}. |
|
If the buffer size is not sufficient, return 0 0"" |
|
c_addr2 = (Char *)getcwd((char *)c_addr1, u1); |
|
if(c_addr2 != NULL) { |
|
u2 = strlen((char *)c_addr2); |
|
} else { |
|
u2 = 0; |
|
} |
|
|
|
=mkdir ( c_addr u wmode -- wior ) gforth equals_mkdir |
|
""Create directory @i{c-addr u} with mode @i{wmode}."" |
|
wior = IOR(mkdir(tilde_cstr(c_addr,u,1),wmode)); |
|
|
\+ |
\+ |
|
|
newline ( -- c_addr u ) gforth |
newline ( -- c_addr u ) gforth |
Line 1720 char newline[] = {
|
Line 1981 char newline[] = {
|
'\r','\n' |
'\r','\n' |
#endif |
#endif |
}; |
}; |
c_addr=newline; |
c_addr=(Char *)newline; |
u=sizeof(newline); |
u=sizeof(newline); |
: |
: |
"newline count ; |
"newline count ; |
Line 1749 dsystem = timeval2us(&usage.ru_stime);
|
Line 2010 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 1765 dsystem=(DCell){0,0};
|
Line 2022 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 1781 f>d ( r -- d ) float f_to_d
|
Line 2045 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 1839 f** ( r1 r2 -- r3 ) float-ext f_star_sta
|
Line 2106 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 1869 floor ( r1 -- r2 ) float
|
Line 2148 floor ( r1 -- r2 ) float
|
/* !! unclear wording */ |
/* !! unclear wording */ |
r2 = floor(r1); |
r2 = floor(r1); |
|
|
fround ( r1 -- r2 ) gforth f_round |
fround ( r1 -- r2 ) float f_round |
""Round to the nearest integral value."" |
""Round to the nearest integral value."" |
r2 = rint(r1); |
r2 = rint(r1); |
|
|
Line 1892 int flag;
|
Line 2171 int flag;
|
int decpt; |
int decpt; |
sig=ecvt(r, u, &decpt, &flag); |
sig=ecvt(r, u, &decpt, &flag); |
n=(r==0. ? 1 : decpt); |
n=(r==0. ? 1 : decpt); |
|
flag=signbit(r); /* not all ecvt()s do this as desired */ |
f1=FLAG(flag!=0); |
f1=FLAG(flag!=0); |
f2=FLAG(isdigit((unsigned)(sig[0]))!=0); |
f2=FLAG(isdigit((unsigned)(sig[0]))!=0); |
siglen=strlen(sig); |
siglen=strlen((char *)sig); |
if (siglen>u) /* happens in glibc-2.1.3 if 999.. is rounded up */ |
if (siglen>u) /* happens in glibc-2.1.3 if 999.. is rounded up */ |
siglen=u; |
siglen=u; |
|
if (!f2) /* workaround Cygwin trailing 0s for Inf and Nan */ |
|
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 |
Line 1910 case and represents the floating-point n
|
Line 2193 case and represents the floating-point n
|
Float r; |
Float r; |
flag = to_float(c_addr, u, &r); |
flag = to_float(c_addr, u, &r); |
if (flag) { |
if (flag) { |
IF_fpTOS(fp[0] = fpTOS); |
fp--; |
fp += -1; |
fp[0]=r; |
fpTOS = r; |
|
} |
} |
|
|
fabs ( r1 -- r2 ) float-ext f_abs |
fabs ( r1 -- r2 ) float-ext f_abs |
Line 2138 f>l ( r -- ) gforth f_to_l
|
Line 2420 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 2151 r = fp[u+1]; /* +1, because update of fp
|
Line 2433 r = fp[u+1]; /* +1, because update of fp
|
|
|
\g syslib |
\g syslib |
|
|
define(`uploop', |
|
`pushdef(`$1', `$2')_uploop(`$1', `$2', `$3', `$4', `$5')`'popdef(`$1')') |
|
define(`_uploop', |
|
`ifelse($1, `$3', `$5', |
|
`$4`'define(`$1', incr($1))_uploop(`$1', `$2', `$3', `$4', `$5')')') |
|
\ argflist(argnum): Forth argument list |
|
define(argflist, |
|
`ifelse($1, 0, `', |
|
`uploop(`_i', 1, $1, `format(`u%d ', _i)', `format(`u%d ', _i)')')') |
|
\ argdlist(argnum): declare C's arguments |
|
define(argdlist, |
|
`ifelse($1, 0, `', |
|
`uploop(`_i', 1, $1, `Cell, ', `Cell')')') |
|
\ argclist(argnum): pass C's arguments |
|
define(argclist, |
|
`ifelse($1, 0, `', |
|
`uploop(`_i', 1, $1, `format(`u%d, ', _i)', `format(`u%d', _i)')')') |
|
\ icall(argnum) |
|
define(icall, |
|
`icall$1 ( argflist($1)u -- uret ) gforth |
|
uret = (SYSCALL(Cell(*)(argdlist($1)))u)(argclist($1)); |
|
|
|
') |
|
define(fcall, |
|
`fcall$1 ( argflist($1)u -- rret ) gforth |
|
rret = (SYSCALL(Float(*)(argdlist($1)))u)(argclist($1)); |
|
|
|
') |
|
|
|
\ close ' to keep fontify happy |
|
|
|
open-lib ( c_addr1 u1 -- u2 ) gforth open_lib |
open-lib ( c_addr1 u1 -- u2 ) gforth open_lib |
#if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
u2 = gforth_dlopen(c_addr1, u1); |
#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 |
lib-sym ( c_addr1 u1 u2 -- u3 ) gforth lib_sym |
#if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
#ifdef HAVE_LIBLTDL |
|
u3 = (UCell) lt_dlsym((lt_dlhandle)u2, cstr(c_addr1, u1, 1)); |
|
#elif defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1)); |
u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1)); |
#else |
#else |
# ifdef _WIN32 |
# ifdef _WIN32 |
Line 2209 u3 = 0;
|
Line 2450 u3 = 0;
|
# endif |
# endif |
#endif |
#endif |
|
|
uploop(i, 0, 7, `icall(i)') |
wcall ( ... u -- ... ) gforth |
icall(20) |
gforth_FP=fp; |
uploop(i, 0, 7, `fcall(i)') |
sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &gforth_FP); |
fcall(20) |
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; |
|
|
|
lib-error ( -- c_addr u ) gforth lib_error |
|
""Error message for last failed @code{open-lib} or @code{lib-sym}."" |
|
#ifdef HAVE_LIBLTDL |
|
c_addr = (Char *)lt_dlerror(); |
|
u = (c_addr == NULL) ? 0 : strlen((char *)c_addr); |
|
#elif defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) |
|
c_addr = dlerror(); |
|
u = strlen(c_addr); |
|
#else |
|
c_addr = "libltdl is not configured"; |
|
u = strlen(c_addr); |
|
#endif |
|
|
\+ |
w!be ( w c_addr -- ) gforth w_store_be |
|
""Store the bottom 16 bits of @i{w} at @i{c_addr} in big endian format."" |
|
*(Wyde*)(c_addr) = htobe16(w); |
|
|
|
l!be ( w c_addr -- ) gforth l_store_be |
|
""Store the bottom 32 bits of @i{w} at @i{c_addr} in big endian format."" |
|
*(Tetrabyte*)(c_addr) = htobe32(w); |
|
|
|
x!be ( w c_addr -- ) gforth x_store_be |
|
""Store the bottom 64 bits of @i{w} at @i{c_addr} in big endian format."" |
|
*(Octabyte*)(c_addr) = htobe64(w); |
|
|
|
w!le ( w c_addr -- ) gforth w_store_le |
|
""Store the bottom 16 bits of @i{w} at @i{c_addr} in big endian format."" |
|
*(Wyde*)(c_addr) = htole16(w); |
|
|
|
l!le ( w c_addr -- ) gforth l_store_le |
|
""Store the bottom 32 bits of @i{w} at @i{c_addr} in big endian format."" |
|
*(Tetrabyte*)(c_addr) = htole32(w); |
|
|
|
x!le ( w c_addr -- ) gforth x_store_le |
|
""Store the bottom 64 bits of @i{w} at @i{c_addr} in big endian format."" |
|
*(Octabyte*)(c_addr) = htole64(w); |
|
|
|
w@be ( c_addr -- u ) gforth w_fetch_be |
|
""@i{u} is the zero-extended 16-bit big endian value stored at @i{c_addr}."" |
|
u = be16toh(*(UWyde*)(c_addr)); |
|
|
|
l@be ( c_addr -- u ) gforth l_fetch_be |
|
""@i{u} is the zero-extended 32-bit big endian value stored at @i{c_addr}."" |
|
u = be32toh(*(UTetrabyte*)(c_addr)); |
|
|
|
x@be ( c_addr -- u ) gforth x_fetch_be |
|
""@i{u} is the zero-extended 64-bit big endian value stored at @i{c_addr}."" |
|
u = be64toh(*(UOctabyte*)(c_addr)); |
|
|
|
w@le ( c_addr -- u ) gforth w_fetch_le |
|
""@i{u} is the zero-extended 16-bit little endian value stored at @i{c_addr}."" |
|
u = le16toh(*(UWyde*)(c_addr)); |
|
|
|
l@le ( c_addr -- u ) gforth l_fetch_le |
|
""@i{u} is the zero-extended 32-bit little endian value stored at @i{c_addr}."" |
|
u = le32toh(*(UTetrabyte*)(c_addr)); |
|
|
|
x@le ( c_addr -- u ) gforth x_fetch_le |
|
""@i{u} is the zero-extended 64-bit little endian value stored at @i{c_addr}."" |
|
u = le64toh(*(UOctabyte*)(c_addr)); |
|
|
wcall ( u -- ) gforth |
\+ |
IF_fpTOS(fp[0]=fpTOS); |
\g peephole |
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 2262 JUMP(a_callee);
|
Line 2581 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 primitive_centric |
|
|
|
\ primitives for primitive-centric code |
|
\ another one is does-exec |
|
|
|
abi-call ( #a_callee ... -- ... ) gforth-internal abi_call |
|
/* primitive for compiled ABI-CODE words */ |
|
abifunc *f = (abifunc *)a_callee; |
|
Float *fp_mem = fp; |
|
sp = (*f)(sp, &fp_mem); |
|
fp = fp_mem; |
|
|
|
;abi-code-exec ( #a_cfa ... -- ... ) gforth-internal semi_abi_code_exec |
|
/* primitive for performing ;ABI-CODE words */ |
|
Float *fp_mem = fp; |
|
semiabifunc *f = (semiabifunc *)DOES_CODE1(a_cfa); |
|
Address body = (Address)PFA(a_cfa); |
|
sp = (*f)(sp, &fp_mem, body); |
|
fp = fp_mem; |
|
|
|
lit-execute ( #a_addr -- ) new lit_execute |
|
/* for ;code and code words; a static superinstruction would be more general, |
|
but VM_JUMP is currently not supported there */ |
|
#ifndef NO_IP |
|
ip=IP; |
|
#endif |
|
SUPER_END; |
|
VM_JUMP(EXEC1((Xt)a_addr)); |
|
|
|
|
|
\g static_super |
|
|
|
ifdef(`STACK_CACHE_FILE', |
|
`include(peeprules.vmg)') |
|
|
\g end |
\g end |