1 /* @(#) pf_inner.c 98/03/16 1.7 */
2 /***************************************************************
3 ** Inner Interpreter for Forth based on 'C'
6 ** Copyright 1994 3DO, Phil Burk, Larry Polansky, David Rosenboom
8 ** The pForth software code is dedicated to the public domain,
9 ** and any third party may reproduce, distribute and modify
10 ** the pForth software code or any derivative works thereof
11 ** without any compensation or license. The pForth software
12 ** code is provided on an "as is" basis without any warranty
13 ** of any kind, including, without limitation, the implied
14 ** warranties of merchantability and fitness for a particular
15 ** purpose and their equivalents under the laws of any jurisdiction.
17 ****************************************************************
19 ** 940502 PLB Creation.
20 ** 940505 PLB More macros.
21 ** 940509 PLB Moved all stack stuff into pfCatch.
22 ** 941014 PLB Converted to flat secondary strusture.
23 ** 941027 rdg added casts to ID_SP_FETCH, ID_RP_FETCH,
24 ** and ID_HERE for armcc
25 ** 941130 PLB Made w@ unsigned
27 ***************************************************************/
31 #if defined(WIN32) && !defined(__MINGW32__)
35 #define SYSTEM_LOAD_FILE "system.fth"
37 /***************************************************************
38 ** Macros for data stack access.
39 ** TOS is cached in a register in pfCatch.
40 ***************************************************************/
42 #define STKPTR (DataStackPtr)
43 #define M_POP (*(STKPTR++))
44 #define M_PUSH(n) {*(--(STKPTR)) = (cell_t) (n);}
45 #define M_STACK(n) (STKPTR[n])
47 #define TOS (TopOfStack)
48 #define PUSH_TOS M_PUSH(TOS)
49 #define M_DUP PUSH_TOS;
50 #define M_DROP { TOS = M_POP; }
53 /***************************************************************
54 ** Macros for Floating Point stack access.
55 ***************************************************************/
57 #define FP_STKPTR (FloatStackPtr)
58 #define M_FP_SPZERO (gCurrentTask->td_FloatStackBase)
59 #define M_FP_POP (*(FP_STKPTR++))
60 #define M_FP_PUSH(n) {*(--(FP_STKPTR)) = (PF_FLOAT) (n);}
61 #define M_FP_STACK(n) (FP_STKPTR[n])
63 #define FP_TOS (fpTopOfStack)
64 #define PUSH_FP_TOS M_FP_PUSH(FP_TOS)
65 #define M_FP_DUP PUSH_FP_TOS;
66 #define M_FP_DROP { FP_TOS = M_FP_POP; }
69 /***************************************************************
70 ** Macros for return stack access.
71 ***************************************************************/
73 #define TORPTR (ReturnStackPtr)
74 #define M_R_DROP {TORPTR++;}
75 #define M_R_POP (*(TORPTR++))
76 #define M_R_PICK(n) (TORPTR[n])
77 #define M_R_PUSH(n) {*(--(TORPTR)) = (cell_t) (n);}
79 /***************************************************************
81 ***************************************************************/
83 #define M_BRANCH { InsPtr = (cell_t *) (((uint8_t *) InsPtr) + READ_CELL_DIC(InsPtr)); }
85 /* Cache top of data stack like in JForth. */
87 #define LOAD_REGISTERS \
89 STKPTR = gCurrentTask->td_StackPtr; \
91 FP_STKPTR = gCurrentTask->td_FloatStackPtr; \
93 TORPTR = gCurrentTask->td_ReturnPtr; \
96 #define SAVE_REGISTERS \
98 gCurrentTask->td_ReturnPtr = TORPTR; \
100 gCurrentTask->td_StackPtr = STKPTR; \
101 M_FP_PUSH( FP_TOS ); \
102 gCurrentTask->td_FloatStackPtr = FP_STKPTR; \
106 /* Cache top of data stack like in JForth. */
107 #define LOAD_REGISTERS \
109 STKPTR = gCurrentTask->td_StackPtr; \
111 TORPTR = gCurrentTask->td_ReturnPtr; \
114 #define SAVE_REGISTERS \
116 gCurrentTask->td_ReturnPtr = TORPTR; \
118 gCurrentTask->td_StackPtr = STKPTR; \
127 #define DO_VAR(varname) { PUSH_TOS; TOS = (cell_t) &varname; }
130 #define M_THROW(err) \
132 ExceptionReturnCode = (ThrowCode)(err); \
133 TORPTR = InitialReturnStack; /* Will cause return to 'C' */ \
134 STKPTR = InitialDataStack; \
135 FP_STKPTR = InitialFloatStack; \
138 #define M_THROW(err) \
140 ExceptionReturnCode = (err); \
141 TORPTR = InitialReturnStack; /* Will cause return to 'C' */ \
142 STKPTR = InitialDataStack; \
146 /***************************************************************
148 ***************************************************************/
150 #define BINARY_OP( op ) { TOS = M_POP op TOS; }
151 #define endcase break
153 #if defined(PF_NO_SHELL) || !defined(PF_SUPPORT_TRACE)
154 #define TRACENAMES /* no names */
156 /* Display name of executing routine. */
157 static void TraceNames( ExecToken Token, cell_t Level )
162 if( ffTokenToName( Token, &DebugName ) )
165 if( gCurrentTask->td_OUT > 0 ) EMIT_CR;
167 for( i=0; i<Level; i++ )
171 TypeName( DebugName );
172 /* Space out to column N then .S */
173 NumSpaces = 30 - gCurrentTask->td_OUT;
174 for( i=0; i < NumSpaces; i++ )
179 /* No longer needed? gCurrentTask->td_OUT = 0; */ /* !!! Hack for ffDotS() */
184 MSG_NUM_H("Couldn't find Name for ", Token);
189 if( (gVarTraceLevel > Level) ) \
190 { SAVE_REGISTERS; TraceNames( Token, Level ); LOAD_REGISTERS; }
191 #endif /* PF_NO_SHELL */
193 /* Use local copy of CODE_BASE for speed. */
194 #define LOCAL_CODEREL_TO_ABS( a ) ((cell_t *) (((cell_t) a) + CodeBase))
196 /* Truncate the unsigned double cell integer LO/HI to an uint64_t. */
197 static uint64_t UdToUint64( ucell_t Lo, ucell_t Hi )
199 return (( 2 * sizeof(ucell_t) == sizeof(uint64_t) )
200 ? (((uint64_t)Lo) | (((uint64_t)Hi) >> (sizeof(ucell_t) * 8)))
204 /* Return TRUE if the unsigned double cell integer LO/HI is not greater
205 * then the greatest uint64_t.
207 static int UdIsUint64( ucell_t Lo, ucell_t Hi )
209 return (( 2 * sizeof(ucell_t) == sizeof(uint64_t) )
214 static const char *pfSelectFileModeCreate(cell_t fam );
215 static const char *pfSelectFileModeOpen(cell_t fam );
217 /**************************************************************/
218 static const char *pfSelectFileModeCreate( cell_t fam )
220 const char *famText = NULL;
223 case (PF_FAM_WRITE_ONLY + PF_FAM_BINARY_FLAG):
224 famText = PF_FAM_BIN_CREATE_WO;
226 case (PF_FAM_READ_WRITE + PF_FAM_BINARY_FLAG):
227 famText = PF_FAM_BIN_CREATE_RW;
229 case PF_FAM_WRITE_ONLY:
230 famText = PF_FAM_CREATE_WO;
232 case PF_FAM_READ_WRITE:
233 famText = PF_FAM_CREATE_RW;
242 /**************************************************************/
243 static const char *pfSelectFileModeOpen( cell_t fam )
245 const char *famText = NULL;
248 case (PF_FAM_READ_ONLY + PF_FAM_BINARY_FLAG):
249 famText = PF_FAM_BIN_OPEN_RO;
251 case (PF_FAM_WRITE_ONLY + PF_FAM_BINARY_FLAG):
252 famText = PF_FAM_BIN_CREATE_WO;
254 case (PF_FAM_READ_WRITE + PF_FAM_BINARY_FLAG):
255 famText = PF_FAM_BIN_OPEN_RW;
257 case PF_FAM_READ_ONLY:
258 famText = PF_FAM_OPEN_RO;
260 case PF_FAM_WRITE_ONLY:
261 famText = PF_FAM_CREATE_WO;
263 case PF_FAM_READ_WRITE:
265 famText = PF_FAM_OPEN_RW;
271 /**************************************************************/
272 ThrowCode pfCatch( ExecToken XT )
274 register cell_t TopOfStack; /* Cache for faster execution. */
275 register cell_t *DataStackPtr;
276 register cell_t *ReturnStackPtr;
277 register cell_t *InsPtr = NULL;
278 register cell_t Token;
282 PF_FLOAT fpTopOfStack;
283 PF_FLOAT *FloatStackPtr;
286 PF_FLOAT *InitialFloatStack;
288 #ifdef PF_SUPPORT_TRACE
291 cell_t *LocalsPtr = NULL;
293 cell_t *InitialReturnStack;
294 cell_t *InitialDataStack;
295 cell_t FakeSecondary[2];
299 uint8_t *CodeBase = (uint8_t *) CODE_BASE;
300 ThrowCode ExceptionReturnCode = 0;
303 gExecutionDepth += 1;
304 PRT(("pfCatch( 0x%x ), depth = %d\n", XT, gExecutionDepth ));
308 ** Initialize FakeSecondary this way to avoid having stuff in the data section,
309 ** which is not supported for some embedded system loaders.
311 FakeSecondary[0] = 0;
312 FakeSecondary[1] = ID_EXIT; /* For EXECUTE */
314 /* Move data from task structure to registers for speed. */
317 /* Save initial stack depths for THROW */
318 InitialReturnStack = TORPTR;
319 InitialDataStack = STKPTR ;
321 InitialFloatStack = FP_STKPTR;
328 DBUG(("pfCatch: Token = 0x%x\n", Token ));
330 /* --------------------------------------------------------------- */
331 /* If secondary, thread down code tree until we hit a primitive. */
332 while( !IsTokenPrimitive( Token ) )
334 #ifdef PF_SUPPORT_TRACE
335 if((gVarTraceFlags & TRACE_INNER) )
337 MSG("pfCatch: Secondary Token = 0x");
339 MSG_NUM_H(", InsPtr = 0x", InsPtr);
344 /* Save IP on return stack like a JSR. */
347 /* Convert execution token to absolute address. */
348 InsPtr = (cell_t *) ( LOCAL_CODEREL_TO_ABS(Token) );
350 /* Fetch token at IP. */
351 Token = READ_CELL_DIC(InsPtr++);
353 #ifdef PF_SUPPORT_TRACE
354 /* Bump level for trace display */
360 #ifdef PF_SUPPORT_TRACE
364 /* Execute primitive Token. */
368 /* Pop up a level in Forth inner interpreter.
369 ** Used to implement semicolon.
370 ** Put first in switch because ID_EXIT==0 */
372 InsPtr = ( cell_t *) M_R_POP;
373 #ifdef PF_SUPPORT_TRACE
378 case ID_1MINUS: TOS--; endcase;
380 case ID_1PLUS: TOS++; endcase;
384 ff2Literal( TOS, M_POP );
387 #endif /* !PF_NO_SHELL */
390 /* hi part stored first, put on top of stack */
392 TOS = READ_CELL_DIC(InsPtr++);
393 M_PUSH(READ_CELL_DIC(InsPtr++));
396 case ID_2MINUS: TOS -= 2; endcase;
398 case ID_2PLUS: TOS += 2; endcase;
401 case ID_2OVER: /* ( a b c d -- a b c d a b ) */
403 Scratch = M_STACK(3);
408 case ID_2SWAP: /* ( a b c d -- c d a b ) */
409 Scratch = M_STACK(0); /* c */
410 M_STACK(0) = M_STACK(2); /* a */
411 M_STACK(2) = Scratch; /* c */
412 Scratch = TOS; /* d */
413 TOS = M_STACK(1); /* b */
414 M_STACK(1) = Scratch; /* d */
417 case ID_2DUP: /* ( a b -- a b a b ) */
419 Scratch = M_STACK(1);
425 M_PUSH( (*(TORPTR+1)) );
441 case ID_ACCEPT_P: /* ( c-addr +n1 -- +n2 ) */
442 CharPtr = (char *) M_POP;
443 TOS = ioAccept( CharPtr, TOS );
448 ffALiteral( ABS_TO_CODEREL(TOS) );
451 #endif /* !PF_NO_SHELL */
455 TOS = (cell_t) LOCAL_CODEREL_TO_ABS( READ_CELL_DIC(InsPtr++) );
458 /* Allocate some extra and put validation identifier at base */
459 #define PF_MEMORY_VALIDATOR (0xA81B4D69)
461 /* Allocate at least one cell's worth because we clobber first cell. */
462 if ( TOS < sizeof(cell_t) )
464 Temp = sizeof(cell_t);
470 /* Allocate extra cells worth because we store validation info. */
471 CellPtr = (cell_t *) pfAllocMem( Temp + sizeof(cell_t) );
474 /* This was broken into two steps because different compilers incremented
475 ** CellPtr before or after the XOR step. */
476 Temp = (cell_t)CellPtr ^ PF_MEMORY_VALIDATOR;
478 M_PUSH( (cell_t) CellPtr );
484 TOS = -1; /* FIXME Fix error code. */
488 case ID_AND: BINARY_OP( & ); endcase;
490 case ID_ARSHIFT: BINARY_OP( >> ); endcase; /* Arithmetic right shift */
494 TOS = CREATE_BODY_OFFSET;
497 /* Branch is followed by an offset relative to address of offset. */
499 DBUGX(("Before Branch: IP = 0x%x\n", InsPtr ));
501 DBUGX(("After Branch: IP = 0x%x\n", InsPtr ));
506 M_THROW( THROW_BYE );
510 MSG("Emergency exit.\n");
518 Scratch = pfCatch( Scratch );
526 Scratch = READ_CELL_DIC(InsPtr++);
527 CallUserFunction( Scratch & 0xFFFF,
529 (Scratch >> 24) & 0x7F );
533 /* Support 32/64 bit operation. */
536 TOS = sizeof(cell_t);
540 TOS = TOS * sizeof(cell_t);
543 case ID_CFETCH: TOS = *((uint8_t *) TOS); endcase;
545 case ID_CMOVE: /* ( src dst n -- ) */
547 register char *DstPtr = (char *) M_POP; /* dst */
548 CharPtr = (char *) M_POP; /* src */
549 for( Scratch=0; (ucell_t) Scratch < (ucell_t) TOS ; Scratch++ )
551 *DstPtr++ = *CharPtr++;
557 case ID_CMOVE_UP: /* ( src dst n -- ) */
559 register char *DstPtr = ((char *) M_POP) + TOS; /* dst */
560 CharPtr = ((char *) M_POP) + TOS;; /* src */
561 for( Scratch=0; (ucell_t) Scratch < (ucell_t) TOS ; Scratch++ )
563 *(--DstPtr) = *(--CharPtr);
575 case ID_COLON_P: /* ( $name xt -- ) */
576 CreateDicEntry( TOS, (char *) M_POP, 0 );
579 #endif /* !PF_NO_SHELL */
585 s2 = (const char *) M_POP;
587 s1 = (const char *) M_POP;
588 TOS = ffCompare( s1, len1, s2, TOS );
592 /* ( a b -- flag , Comparisons ) */
594 TOS = ( TOS == M_POP ) ? FTRUE : FFALSE ;
596 case ID_COMP_NOT_EQUAL:
597 TOS = ( TOS != M_POP ) ? FTRUE : FFALSE ;
599 case ID_COMP_GREATERTHAN:
600 TOS = ( M_POP > TOS ) ? FTRUE : FFALSE ;
602 case ID_COMP_LESSTHAN:
603 TOS = ( M_POP < TOS ) ? FTRUE : FFALSE ;
605 case ID_COMP_U_GREATERTHAN:
606 TOS = ( ((ucell_t)M_POP) > ((ucell_t)TOS) ) ? FTRUE : FFALSE ;
608 case ID_COMP_U_LESSTHAN:
609 TOS = ( ((ucell_t)M_POP) < ((ucell_t)TOS) ) ? FTRUE : FFALSE ;
611 case ID_COMP_ZERO_EQUAL:
612 TOS = ( TOS == 0 ) ? FTRUE : FFALSE ;
614 case ID_COMP_ZERO_NOT_EQUAL:
615 TOS = ( TOS != 0 ) ? FTRUE : FALSE ;
617 case ID_COMP_ZERO_GREATERTHAN:
618 TOS = ( TOS > 0 ) ? FTRUE : FFALSE ;
620 case ID_COMP_ZERO_LESSTHAN:
621 TOS = ( TOS < 0 ) ? FTRUE : FFALSE ;
634 #endif /* !PF_NO_SHELL */
638 /* Put address of body on stack. Insptr points after code start. */
639 TOS = (cell_t) ((char *)InsPtr - sizeof(cell_t) + CREATE_BODY_OFFSET );
642 case ID_CSTORE: /* ( c caddr -- ) */
643 *((uint8_t *) TOS) = (uint8_t) M_POP;
647 /* Double precision add. */
648 case ID_D_PLUS: /* D+ ( al ah bl bh -- sl sh ) */
650 register ucell_t ah,al,bl,sh,sl;
657 if( sl < bl ) sh = 1; /* Carry */
665 /* Double precision subtract. */
666 case ID_D_MINUS: /* D- ( al ah bl bh -- sl sh ) */
668 register ucell_t ah,al,bl,sh,sl;
675 if( al < bl ) sh = 1; /* Borrow */
683 /* Assume 8-bit char and calculate cell width. */
684 #define NBITS ((sizeof(ucell_t)) * 8)
685 /* Define half the number of bits in a cell. */
686 #define HNBITS (NBITS / 2)
687 /* Assume two-complement arithmetic to calculate lower half. */
688 #define LOWER_HALF(n) ((n) & (((ucell_t)1 << HNBITS) - 1))
689 #define HIGH_BIT ((ucell_t)1 << (NBITS - 1))
691 /* Perform cell*cell bit multiply for a 2 cell result, by factoring into half cell quantities.
692 * Using an improved algorithm suggested by Steve Green.
693 * Converted to 64-bit by Aleksej Saushev.
695 case ID_D_UMTIMES: /* UM* ( a b -- lo hi ) */
697 ucell_t ahi, alo, bhi, blo; /* input parts */
698 ucell_t lo, hi, temp;
699 /* Get values from stack. */
702 /* Break into hi and lo 16 bit parts. */
703 alo = LOWER_HALF(ahi);
705 blo = LOWER_HALF(bhi);
710 /* higher part: ahi * bhi */
712 /* middle (overlapping) part: ahi * blo */
714 lo += LOWER_HALF(temp);
715 hi += temp >> HNBITS;
716 /* middle (overlapping) part: alo * bhi */
718 lo += LOWER_HALF(temp);
719 hi += temp >> HNBITS;
720 /* lower part: alo * blo */
722 /* its higher half overlaps with middle's lower half: */
723 lo += temp >> HNBITS;
727 /* combine lower part of result: */
728 lo = (lo << HNBITS) + LOWER_HALF(temp);
735 /* Perform cell*cell bit multiply for 2 cell result, using shift and add. */
736 case ID_D_MTIMES: /* M* ( a b -- pl ph ) */
738 ucell_t ahi, alo, bhi, blo; /* input parts */
739 ucell_t lo, hi, temp;
741 /* Get values from stack. */
745 /* Calculate product sign: */
746 sg = ((cell_t)(ahi ^ bhi) < 0);
747 /* Take absolute values and reduce to um* */
748 if ((cell_t)ahi < 0) ahi = (ucell_t)(-(cell_t)ahi);
749 if ((cell_t)bhi < 0) bhi = (ucell_t)(-(cell_t)bhi);
751 /* Break into hi and lo 16 bit parts. */
752 alo = LOWER_HALF(ahi);
754 blo = LOWER_HALF(bhi);
759 /* higher part: ahi * bhi */
761 /* middle (overlapping) part: ahi * blo */
763 lo += LOWER_HALF(temp);
764 hi += temp >> HNBITS;
765 /* middle (overlapping) part: alo * bhi */
767 lo += LOWER_HALF(temp);
768 hi += temp >> HNBITS;
769 /* lower part: alo * blo */
771 /* its higher half overlaps with middle's lower half: */
772 lo += temp >> HNBITS;
776 /* combine lower part of result: */
777 lo = (lo << HNBITS) + LOWER_HALF(temp);
779 /* Negate product if one operand negative. */
782 /* lo = (ucell_t)(- lo); */
784 hi = ~hi + ((lo == 0) ? 1 : 0);
792 #define DULT(du1l,du1h,du2l,du2h) ( (du2h<du1h) ? FALSE : ( (du2h==du1h) ? (du1l<du2l) : TRUE) )
793 /* Perform 2 cell by 1 cell divide for 1 cell result and remainder, using shift and subtract. */
794 case ID_D_UMSMOD: /* UM/MOD ( al ah bdiv -- rem q ) */
796 ucell_t ah,al, q,di, bl,bh, sl,sh;
802 for( di=0; di<NBITS; di++ )
804 if( !DULT(al,ah,bl,bh) )
808 if( al < bl ) sh = 1; /* Borrow */
815 bl = (bl >> 1) | (bh << (NBITS-1));
818 if( !DULT(al,ah,bl,bh) )
824 M_PUSH( al ); /* rem */
829 /* Perform 2 cell by 1 cell divide for 2 cell result and remainder, using shift and subtract. */
830 case ID_D_MUSMOD: /* MU/MOD ( al am bdiv -- rem ql qh ) */
832 register ucell_t ah,am,al,ql,qh,di;
833 #define bdiv ((ucell_t)TOS)
838 for( di=0; di<2*NBITS; di++ )
845 qh = (qh << 1) | (ql >> (NBITS-1));
847 ah = (ah << 1) | (am >> (NBITS-1));
848 am = (am << 1) | (al >> (NBITS-1));
850 DBUG(("XX ah,m,l = 0x%8x,%8x,%8x - qh,l = 0x%8x,%8x\n", ah,am,al, qh,ql ));
857 M_PUSH( ah ); /* rem */
868 #endif /* !PF_NO_SHELL */
875 TOS = gCurrentTask->td_StackBase - STKPTR;
878 case ID_DIVIDE: BINARY_OP( / ); endcase;
889 case ID_DROP: M_DROP; endcase;
893 DumpMemory( (char *) Scratch, TOS );
897 case ID_DUP: M_DUP; endcase;
899 case ID_DO_P: /* ( limit start -- ) ( R: -- start limit ) */
905 case ID_EOL: /* ( -- end_of_line_char ) */
910 case ID_ERRORQ_P: /* ( flag num -- , quit if flag true ) */
929 /* Save IP on return stack like a JSR. */
931 #ifdef PF_SUPPORT_TRACE
932 /* Bump level for trace. */
935 if( IsTokenPrimitive( TOS ) )
937 WRITE_CELL_DIC( (cell_t *) &FakeSecondary[0], TOS); /* Build a fake secondary and execute it. */
938 InsPtr = &FakeSecondary[0];
942 InsPtr = (cell_t *) LOCAL_CODEREL_TO_ABS(TOS);
948 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
951 TOS = (cell_t) READ_CELL_DIC((cell_t *)TOS);
955 TOS = *((cell_t *)TOS);
958 TOS = *((cell_t *)TOS);
962 case ID_FILE_CREATE: /* ( c-addr u fam -- fid ior ) */
963 /* Build NUL terminated name string. */
964 Scratch = M_POP; /* u */
965 Temp = M_POP; /* caddr */
966 if( Scratch < TIB_SIZE-2 )
968 const char *famText = pfSelectFileModeCreate( TOS );
969 pfCopyMemory( gScratch, (char *) Temp, (ucell_t) Scratch );
970 gScratch[Scratch] = '\0';
971 DBUG(("Create file = %s with famTxt %s\n", gScratch, famText ));
972 FileID = sdOpenFile( gScratch, famText );
973 TOS = ( FileID == NULL ) ? -1 : 0 ;
974 M_PUSH( (cell_t) FileID );
978 ERR("Filename too large for name buffer.\n");
984 case ID_FILE_DELETE: /* ( c-addr u -- ior ) */
985 /* Build NUL terminated name string. */
986 Temp = M_POP; /* caddr */
987 if( TOS < TIB_SIZE-2 )
989 pfCopyMemory( gScratch, (char *) Temp, (ucell_t) TOS );
990 gScratch[TOS] = '\0';
991 DBUG(("Delete file = %s\n", gScratch ));
992 TOS = sdDeleteFile( gScratch );
996 ERR("Filename too large for name buffer.\n");
1001 case ID_FILE_OPEN: /* ( c-addr u fam -- fid ior ) */
1002 /* Build NUL terminated name string. */
1003 Scratch = M_POP; /* u */
1004 Temp = M_POP; /* caddr */
1005 if( Scratch < TIB_SIZE-2 )
1007 const char *famText = pfSelectFileModeOpen( TOS );
1008 pfCopyMemory( gScratch, (char *) Temp, (ucell_t) Scratch );
1009 gScratch[Scratch] = '\0';
1010 DBUG(("Open file = %s\n", gScratch ));
1011 FileID = sdOpenFile( gScratch, famText );
1013 TOS = ( FileID == NULL ) ? -1 : 0 ;
1014 M_PUSH( (cell_t) FileID );
1018 ERR("Filename too large for name buffer.\n");
1024 case ID_FILE_CLOSE: /* ( fid -- ior ) */
1025 TOS = sdCloseFile( (FileStream *) TOS );
1028 case ID_FILE_READ: /* ( addr len fid -- u2 ior ) */
1029 FileID = (FileStream *) TOS;
1031 CharPtr = (char *) M_POP;
1032 Temp = sdReadFile( CharPtr, 1, Scratch, FileID );
1033 /* TODO check feof() or ferror() */
1038 /* TODO Why does this crash when passed an illegal FID? */
1039 case ID_FILE_SIZE: /* ( fid -- ud ior ) */
1040 /* Determine file size by seeking to end and returning position. */
1041 FileID = (FileStream *) TOS;
1043 file_offset_t endposition = -1;
1044 file_offset_t original = sdTellFile( FileID );
1047 sdSeekFile( FileID, 0, PF_SEEK_END );
1048 endposition = sdTellFile( FileID );
1049 /* Restore original position. */
1050 sdSeekFile( FileID, original, PF_SEEK_SET );
1052 if (endposition < 0)
1054 M_PUSH(0); /* low */
1055 M_PUSH(0); /* high */
1056 TOS = -4; /* TODO proper error number */
1060 M_PUSH(endposition); /* low */
1061 /* We do not support double precision file offsets.*/
1062 M_PUSH(0); /* high */
1068 case ID_FILE_WRITE: /* ( addr len fid -- ior ) */
1069 FileID = (FileStream *) TOS;
1071 CharPtr = (char *) M_POP;
1072 Temp = sdWriteFile( CharPtr, 1, Scratch, FileID );
1073 TOS = (Temp != Scratch) ? -3 : 0;
1076 case ID_FILE_REPOSITION: /* ( ud fid -- ior ) */
1078 file_offset_t offset;
1081 FileID = (FileStream *) TOS;
1084 /* We do not support double precision file offsets in pForth.
1085 * So check to make sure the high bits are not used.
1087 if (offsetHigh != 0)
1089 TOS = -3; /* TODO err num? */
1092 offset = (file_offset_t)offsetLow;
1093 TOS = sdSeekFile( FileID, offset, PF_SEEK_SET );
1097 case ID_FILE_POSITION: /* ( fid -- ud ior ) */
1099 file_offset_t position;
1100 FileID = (FileStream *) TOS;
1101 position = sdTellFile( FileID );
1104 M_PUSH(0); /* low */
1105 M_PUSH(0); /* high */
1106 TOS = -4; /* TODO proper error number */
1110 M_PUSH(position); /* low */
1111 /* We do not support double precision file offsets.*/
1112 M_PUSH(0); /* high */
1118 case ID_FILE_RO: /* ( -- fam ) */
1120 TOS = PF_FAM_READ_ONLY;
1123 case ID_FILE_RW: /* ( -- fam ) */
1125 TOS = PF_FAM_READ_WRITE;
1128 case ID_FILE_WO: /* ( -- fam ) */
1130 TOS = PF_FAM_WRITE_ONLY;
1133 case ID_FILE_BIN: /* ( -- fam ) */
1134 TOS = TOS | PF_FAM_BINARY_FLAG;
1137 case ID_FILE_FLUSH: /* ( fileid -- ior ) */
1139 FileStream *Stream = (FileStream *) TOS;
1140 TOS = (sdFlushFile( Stream ) == 0) ? 0 : THROW_FLUSH_FILE;
1144 case ID_FILE_RENAME: /* ( oldName newName -- ior ) */
1146 char *New = (char *) TOS;
1147 char *Old = (char *) M_POP;
1148 TOS = sdRenameFile( Old, New );
1152 case ID_FILE_RESIZE: /* ( ud fileid -- ior ) */
1154 FileStream *File = (FileStream *) TOS;
1155 ucell_t SizeHi = (ucell_t) M_POP;
1156 ucell_t SizeLo = (ucell_t) M_POP;
1157 TOS = ( UdIsUint64( SizeLo, SizeHi )
1158 ? sdResizeFile( File, UdToUint64( SizeLo, SizeHi ))
1159 : THROW_RESIZE_FILE );
1163 case ID_FILL: /* ( caddr num charval -- ) */
1165 register char *DstPtr;
1166 Temp = M_POP; /* num */
1167 DstPtr = (char *) M_POP; /* dst */
1168 for( Scratch=0; (ucell_t) Scratch < (ucell_t) Temp ; Scratch++ )
1170 *DstPtr++ = (char) TOS;
1177 case ID_FIND: /* ( $addr -- $addr 0 | xt +-1 ) */
1178 TOS = ffFind( (char *) TOS, (ExecToken *) &Temp );
1183 TOS = ffFindNFA( (const ForthString *) TOS, (const ForthString **) &Temp );
1184 M_PUSH( (cell_t) Temp );
1186 #endif /* !PF_NO_SHELL */
1192 /* Validate memory before freeing. Clobber validator and first word. */
1193 case ID_FREE: /* ( addr -- result ) */
1196 ERR("FREE passed NULL!\n");
1197 TOS = -2; /* FIXME error code */
1201 CellPtr = (cell_t *) TOS;
1203 if( ((ucell_t)*CellPtr) != ((ucell_t)CellPtr ^ PF_MEMORY_VALIDATOR))
1205 TOS = -2; /* FIXME error code */
1209 CellPtr[0] = 0xDeadBeef;
1210 pfFreeMem((char *)CellPtr);
1216 #include "pfinnrfp.h"
1220 TOS = (cell_t)CODE_HERE;
1223 case ID_NUMBERQ_P: /* ( addr -- 0 | n 1 ) */
1224 /* Convert using number converter in 'C'.
1225 ** Only supports single precision for bootstrap.
1227 TOS = (cell_t) ffNumberQ( (char *) TOS, &Temp );
1228 if( TOS == NUM_TYPE_SINGLE)
1230 M_PUSH( Temp ); /* Push single number */
1234 case ID_I: /* ( -- i , DO LOOP index ) */
1240 case ID_INCLUDE_FILE:
1241 FileID = (FileStream *) TOS;
1242 M_DROP; /* Drop now so that INCLUDE has a clean stack. */
1244 Scratch = ffIncludeFile( FileID );
1246 if( Scratch ) M_THROW(Scratch)
1248 #endif /* !PF_NO_SHELL */
1253 Scratch = ffInterpret();
1255 if( Scratch ) M_THROW(Scratch)
1257 #endif /* !PF_NO_SHELL */
1259 case ID_J: /* ( -- j , second DO LOOP index ) */
1274 #endif /* !PF_NO_SHELL */
1277 DBUG(("ID_LITERAL_P: InsPtr = 0x%x, *InsPtr = 0x%x\n", InsPtr, *InsPtr ));
1279 TOS = READ_CELL_DIC(InsPtr++);
1283 case ID_LOCAL_COMPILER: DO_VAR(gLocalCompiler_XT); endcase;
1284 #endif /* !PF_NO_SHELL */
1286 case ID_LOCAL_FETCH: /* ( i <local> -- n , fetch from local ) */
1287 TOS = *(LocalsPtr - TOS);
1290 #define LOCAL_FETCH_N(num) \
1291 case ID_LOCAL_FETCH_##num: /* ( <local> -- n , fetch from local ) */ \
1293 TOS = *(LocalsPtr -(num)); \
1305 case ID_LOCAL_STORE: /* ( n i <local> -- , store n in local ) */
1306 *(LocalsPtr - TOS) = M_POP;
1310 #define LOCAL_STORE_N(num) \
1311 case ID_LOCAL_STORE_##num: /* ( n <local> -- , store n in local ) */ \
1312 *(LocalsPtr - (num)) = TOS; \
1325 case ID_LOCAL_PLUSSTORE: /* ( n i <local> -- , add n to local ) */
1326 *(LocalsPtr - TOS) += M_POP;
1330 case ID_LOCAL_ENTRY: /* ( x0 x1 ... xn n -- ) */
1331 /* create local stack frame */
1335 DBUG(("LocalEntry: n = %d\n", TOS));
1336 /* End of locals. Create stack frame */
1337 DBUG(("LocalEntry: before RP@ = 0x%x, LP = 0x%x\n",
1338 TORPTR, LocalsPtr));
1339 M_R_PUSH(LocalsPtr);
1342 DBUG(("LocalEntry: after RP@ = 0x%x, LP = 0x%x\n",
1343 TORPTR, LocalsPtr));
1347 *lp++ = M_POP; /* Load local vars from stack */
1353 case ID_LOCAL_EXIT: /* cleanup up local stack frame */
1354 DBUG(("LocalExit: before RP@ = 0x%x, LP = 0x%x\n",
1355 TORPTR, LocalsPtr));
1357 LocalsPtr = (cell_t *) M_R_POP;
1358 DBUG(("LocalExit: after RP@ = 0x%x, LP = 0x%x\n",
1359 TORPTR, LocalsPtr));
1364 MSG("Load "); MSG(SYSTEM_LOAD_FILE); EMIT_CR;
1365 FileID = sdOpenFile(SYSTEM_LOAD_FILE, "r");
1369 Scratch = ffIncludeFile( FileID ); /* Also closes the file. */
1371 if( Scratch ) M_THROW(Scratch);
1375 ERR(SYSTEM_LOAD_FILE); ERR(" could not be opened!\n");
1378 #endif /* !PF_NO_SHELL */
1380 case ID_LEAVE_P: /* ( R: index limit -- ) */
1386 case ID_LOOP_P: /* ( R: index limit -- | index limit ) */
1387 Temp = M_R_POP; /* limit */
1388 Scratch = M_R_POP + 1; /* index */
1389 if( Scratch == Temp )
1391 InsPtr++; /* skip branch offset, exit loop */
1395 /* Push index and limit back to R */
1396 M_R_PUSH( Scratch );
1398 /* Branch back to just after (DO) */
1403 case ID_LSHIFT: BINARY_OP( << ); endcase;
1407 TOS = ( TOS > Scratch ) ? TOS : Scratch ;
1412 TOS = ( TOS < Scratch ) ? TOS : Scratch ;
1415 case ID_MINUS: BINARY_OP( - ); endcase;
1418 case ID_NAME_TO_TOKEN:
1419 TOS = (cell_t) NameToToken((ForthString *)TOS);
1422 case ID_NAME_TO_PREVIOUS:
1423 TOS = (cell_t) NameToPrevious((ForthString *)TOS);
1430 case ID_OR: BINARY_OP( | ); endcase;
1437 case ID_PICK: /* ( ... n -- sp(n) ) */
1441 case ID_PLUS: BINARY_OP( + ); endcase;
1443 case ID_PLUS_STORE: /* ( n addr -- , add n to *addr ) */
1444 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
1445 if( IN_DICS( TOS ) )
1447 Scratch = READ_CELL_DIC((cell_t *)TOS);
1449 WRITE_CELL_DIC((cell_t *)TOS,Scratch);
1453 *((cell_t *)TOS) += M_POP;
1456 *((cell_t *)TOS) += M_POP;
1461 case ID_PLUSLOOP_P: /* ( delta -- ) ( R: index limit -- | index limit ) */
1463 cell_t Limit = M_R_POP;
1464 cell_t OldIndex = M_R_POP;
1465 cell_t Delta = TOS; /* add TOS to index, not 1 */
1466 cell_t NewIndex = OldIndex + Delta;
1467 cell_t OldDiff = OldIndex - Limit;
1469 /* This exploits this idea (lifted from Gforth):
1470 (x^y)<0 is equivalent to (x<0) != (y<0) */
1471 if( ((OldDiff ^ (OldDiff + Delta)) /* is the limit crossed? */
1472 & (OldDiff ^ Delta)) /* is it a wrap-around? */
1475 InsPtr++; /* skip branch offset, exit loop */
1479 /* Push index and limit back to R */
1480 M_R_PUSH( NewIndex );
1482 /* Branch back to just after (DO) */
1489 case ID_QDO_P: /* (?DO) ( limit start -- ) ( R: -- start limit ) */
1490 Scratch = M_POP; /* limit */
1491 if( Scratch == TOS )
1493 /* Branch to just after (LOOP) */
1499 M_R_PUSH( Scratch );
1500 InsPtr++; /* skip branch offset, enter loop */
1505 case ID_QDUP: if( TOS ) M_DUP; endcase;
1507 case ID_QTERMINAL: /* WARNING: Typically not fully implemented! */
1509 TOS = sdQueryTerminal();
1512 case ID_QUIT_P: /* Stop inner interpreter, go back to user. */
1513 #ifdef PF_SUPPORT_TRACE
1516 M_THROW(THROW_QUIT);
1535 TOS = (ffRefill() > 0) ? FTRUE : FFALSE;
1538 /* Resize memory allocated by ALLOCATE. */
1539 case ID_RESIZE: /* ( addr1 u -- addr2 result ) */
1541 cell_t *Addr1 = (cell_t *) M_POP;
1542 /* Point to validator below users address. */
1543 cell_t *FreePtr = Addr1 - 1;
1544 if( ((ucell_t)*FreePtr) != ((ucell_t)FreePtr ^ PF_MEMORY_VALIDATOR))
1546 /* 090218 - Fixed bug, was returning zero. */
1552 /* Try to allocate. */
1553 CellPtr = (cell_t *) pfAllocMem( TOS + sizeof(cell_t) );
1556 /* Copy memory including validation. */
1557 pfCopyMemory( (char *) CellPtr, (char *) FreePtr, TOS + sizeof(cell_t) );
1558 *CellPtr = (cell_t)(((ucell_t)CellPtr) ^ (ucell_t)PF_MEMORY_VALIDATOR);
1559 /* 090218 - Fixed bug that was incrementing the address twice. Thanks Reinhold Straub. */
1560 /* Increment past validator to user address. */
1561 M_PUSH( (cell_t) (CellPtr + 1) );
1562 TOS = 0; /* Result code. */
1563 /* Mark old cell as dead so we can't free it twice. */
1564 FreePtr[0] = 0xDeadBeef;
1565 pfFreeMem((char *) FreePtr);
1569 /* 090218 - Fixed bug, was returning zero. */
1571 TOS = -4; /* FIXME Fix error code. */
1578 ** RP@ and RP! are called secondaries so we must
1579 ** account for the return address pushed before calling.
1581 case ID_RP_FETCH: /* ( -- rp , address of top of return stack ) */
1583 TOS = (cell_t)TORPTR; /* value before calling RP@ */
1586 case ID_RP_STORE: /* ( rp -- , address of top of return stack ) */
1587 TORPTR = (cell_t *) TOS;
1591 case ID_ROLL: /* ( xu xu-1 xu-1 ... x0 u -- xu-1 xu-1 ... x0 xu ) */
1594 cell_t *srcPtr, *dstPtr;
1595 Scratch = M_STACK(TOS);
1596 srcPtr = &M_STACK(TOS-1);
1597 dstPtr = &M_STACK(TOS);
1598 for( ri=0; ri<TOS; ri++ )
1600 *dstPtr-- = *srcPtr--;
1607 case ID_ROT: /* ( a b c -- b c a ) */
1608 Scratch = M_POP; /* b */
1609 Temp = M_POP; /* a */
1610 M_PUSH( Scratch ); /* b */
1615 /* Logical right shift */
1616 case ID_RSHIFT: { TOS = ((ucell_t)M_POP) >> TOS; } endcase;
1619 case ID_SAVE_FORTH_P: /* ( $name Entry NameSize CodeSize -- err ) */
1621 cell_t NameSize, CodeSize, EntryPoint;
1625 ForthStringToC( gScratch, (char *) M_POP, sizeof(gScratch) );
1626 TOS = ffSaveForth( gScratch, EntryPoint, NameSize, CodeSize );
1631 case ID_SP_FETCH: /* ( -- sp , address of top of stack, sorta ) */
1633 TOS = (cell_t)STKPTR;
1636 case ID_SP_STORE: /* ( sp -- , address of top of stack, sorta ) */
1637 STKPTR = (cell_t *) TOS;
1641 case ID_STORE: /* ( n addr -- , write n to addr ) */
1642 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
1643 if( IN_DICS( TOS ) )
1645 WRITE_CELL_DIC((cell_t *)TOS,M_POP);
1649 *((cell_t *)TOS) = M_POP;
1652 *((cell_t *)TOS) = M_POP;
1657 case ID_SCAN: /* ( addr cnt char -- addr' cnt' ) */
1658 Scratch = M_POP; /* cnt */
1659 Temp = M_POP; /* addr */
1660 TOS = ffScan( (char *) Temp, Scratch, (char) TOS, &CharPtr );
1661 M_PUSH((cell_t) CharPtr);
1667 Scratch = ffSemiColon();
1669 if( Scratch ) M_THROW( Scratch );
1671 #endif /* !PF_NO_SHELL */
1673 case ID_SKIP: /* ( addr cnt char -- addr' cnt' ) */
1674 Scratch = M_POP; /* cnt */
1675 Temp = M_POP; /* addr */
1676 TOS = ffSkip( (char *) Temp, Scratch, (char) TOS, &CharPtr );
1677 M_PUSH((cell_t) CharPtr);
1680 case ID_SOURCE: /* ( -- c-addr num ) */
1682 M_PUSH( (cell_t) gCurrentTask->td_SourcePtr );
1683 TOS = (cell_t) gCurrentTask->td_SourceNum;
1686 case ID_SOURCE_SET: /* ( c-addr num -- ) */
1687 gCurrentTask->td_SourcePtr = (char *) M_POP;
1688 gCurrentTask->td_SourceNum = TOS;
1694 TOS = ffConvertStreamToSourceID( gCurrentTask->td_InputStream ) ;
1697 case ID_SOURCE_ID_POP:
1699 TOS = ffConvertStreamToSourceID( ffPopInputStream() ) ;
1702 case ID_SOURCE_ID_PUSH: /* ( source-id -- ) */
1703 TOS = (cell_t)ffConvertSourceIDToStream( TOS );
1704 Scratch = ffPushInputStream((FileStream *) TOS );
1712 case ID_SOURCE_LINE_NUMBER_FETCH: /* ( -- linenr ) */
1714 TOS = gCurrentTask->td_LineNumber;
1717 case ID_SOURCE_LINE_NUMBER_STORE: /* ( linenr -- ) */
1718 gCurrentTask->td_LineNumber = TOS;
1738 case ID_THROW: /* ( k*x err -- k*x | i*x err , jump to where CATCH was called ) */
1749 CharPtr = (char *) ffWord( (char) ' ' );
1750 TOS = ffFind( CharPtr, (ExecToken *) &Temp );
1753 ERR("' could not find ");
1754 ioType( (char *) CharPtr+1, *CharPtr );
1762 #endif /* !PF_NO_SHELL */
1764 case ID_TIMES: BINARY_OP( * ); endcase;
1767 Scratch = M_POP; /* addr */
1768 ioType( (char *) Scratch, TOS );
1777 case ID_VAR_BASE: DO_VAR(gVarBase); endcase;
1778 case ID_VAR_CODE_BASE: DO_VAR(gCurrentDictionary->dic_CodeBase); endcase;
1779 case ID_VAR_CODE_LIMIT: DO_VAR(gCurrentDictionary->dic_CodeLimit); endcase;
1780 case ID_VAR_CONTEXT: DO_VAR(gVarContext); endcase;
1781 case ID_VAR_DP: DO_VAR(gCurrentDictionary->dic_CodePtr.Cell); endcase;
1782 case ID_VAR_ECHO: DO_VAR(gVarEcho); endcase;
1783 case ID_VAR_HEADERS_BASE: DO_VAR(gCurrentDictionary->dic_HeaderBase); endcase;
1784 case ID_VAR_HEADERS_LIMIT: DO_VAR(gCurrentDictionary->dic_HeaderLimit); endcase;
1785 case ID_VAR_HEADERS_PTR: DO_VAR(gCurrentDictionary->dic_HeaderPtr); endcase;
1786 case ID_VAR_NUM_TIB: DO_VAR(gCurrentTask->td_SourceNum); endcase;
1787 case ID_VAR_OUT: DO_VAR(gCurrentTask->td_OUT); endcase;
1788 case ID_VAR_STATE: DO_VAR(gVarState); endcase;
1789 case ID_VAR_TO_IN: DO_VAR(gCurrentTask->td_IN); endcase;
1790 case ID_VAR_TRACE_FLAGS: DO_VAR(gVarTraceFlags); endcase;
1791 case ID_VAR_TRACE_LEVEL: DO_VAR(gVarTraceLevel); endcase;
1792 case ID_VAR_TRACE_STACK: DO_VAR(gVarTraceStack); endcase;
1793 case ID_VAR_RETURN_CODE: DO_VAR(gVarReturnCode); endcase;
1796 TOS = (cell_t) ffWord( (char) TOS );
1799 case ID_WORD_FETCH: /* ( waddr -- w ) */
1800 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
1801 if( IN_DICS( TOS ) )
1803 TOS = (uint16_t) READ_SHORT_DIC((uint16_t *)TOS);
1807 TOS = *((uint16_t *)TOS);
1810 TOS = *((uint16_t *)TOS);
1814 case ID_WORD_STORE: /* ( w waddr -- ) */
1816 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
1817 if( IN_DICS( TOS ) )
1819 WRITE_SHORT_DIC((uint16_t *)TOS,(uint16_t)M_POP);
1823 *((uint16_t *)TOS) = (uint16_t) M_POP;
1826 *((uint16_t *)TOS) = (uint16_t) M_POP;
1831 case ID_XOR: BINARY_OP( ^ ); endcase;
1834 /* Branch is followed by an offset relative to address of offset. */
1835 case ID_ZERO_BRANCH:
1836 DBUGX(("Before 0Branch: IP = 0x%x\n", InsPtr ));
1843 InsPtr++; /* skip over offset */
1846 DBUGX(("After 0Branch: IP = 0x%x\n", InsPtr ));
1850 ERR("pfCatch: Unrecognised token = 0x");
1853 ffDotHex((cell_t) InsPtr);
1859 if(InsPtr) Token = READ_CELL_DIC(InsPtr++); /* Traverse to next token in secondary. */
1866 if( _CrtCheckMemory() == 0 )
1868 ERR("_CrtCheckMemory abort: InsPtr = 0x");
1869 ffDotHex((int)InsPtr);
1874 } while( (InitialReturnStack - TORPTR) > 0 );
1878 return ExceptionReturnCode;