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 ***************************************************************/
29 #include <sys/types.h>
33 #if defined(WIN32) && !defined(__MINGW32__)
37 #define SYSTEM_LOAD_FILE "system.fth"
39 /***************************************************************
40 ** Macros for data stack access.
41 ** TOS is cached in a register in pfCatch.
42 ***************************************************************/
44 #define STKPTR (DataStackPtr)
45 #define M_POP (*(STKPTR++))
46 #define M_PUSH(n) {*(--(STKPTR)) = (cell_t) (n);}
47 #define M_STACK(n) (STKPTR[n])
49 #define TOS (TopOfStack)
50 #define PUSH_TOS M_PUSH(TOS)
51 #define M_DUP PUSH_TOS;
52 #define M_DROP { TOS = M_POP; }
55 /***************************************************************
56 ** Macros for Floating Point stack access.
57 ***************************************************************/
59 #define FP_STKPTR (FloatStackPtr)
60 #define M_FP_SPZERO (gCurrentTask->td_FloatStackBase)
61 #define M_FP_POP (*(FP_STKPTR++))
62 #define M_FP_PUSH(n) {*(--(FP_STKPTR)) = (PF_FLOAT) (n);}
63 #define M_FP_STACK(n) (FP_STKPTR[n])
65 #define FP_TOS (fpTopOfStack)
66 #define PUSH_FP_TOS M_FP_PUSH(FP_TOS)
67 #define M_FP_DUP PUSH_FP_TOS;
68 #define M_FP_DROP { FP_TOS = M_FP_POP; }
71 /***************************************************************
72 ** Macros for return stack access.
73 ***************************************************************/
75 #define TORPTR (ReturnStackPtr)
76 #define M_R_DROP {TORPTR++;}
77 #define M_R_POP (*(TORPTR++))
78 #define M_R_PICK(n) (TORPTR[n])
79 #define M_R_PUSH(n) {*(--(TORPTR)) = (cell_t) (n);}
81 /***************************************************************
83 ***************************************************************/
85 #define M_BRANCH { InsPtr = (cell_t *) (((uint8_t *) InsPtr) + READ_CELL_DIC(InsPtr)); }
87 /* Cache top of data stack like in JForth. */
89 #define LOAD_REGISTERS \
91 STKPTR = gCurrentTask->td_StackPtr; \
93 FP_STKPTR = gCurrentTask->td_FloatStackPtr; \
95 TORPTR = gCurrentTask->td_ReturnPtr; \
98 #define SAVE_REGISTERS \
100 gCurrentTask->td_ReturnPtr = TORPTR; \
102 gCurrentTask->td_StackPtr = STKPTR; \
103 M_FP_PUSH( FP_TOS ); \
104 gCurrentTask->td_FloatStackPtr = FP_STKPTR; \
108 /* Cache top of data stack like in JForth. */
109 #define LOAD_REGISTERS \
111 STKPTR = gCurrentTask->td_StackPtr; \
113 TORPTR = gCurrentTask->td_ReturnPtr; \
116 #define SAVE_REGISTERS \
118 gCurrentTask->td_ReturnPtr = TORPTR; \
120 gCurrentTask->td_StackPtr = STKPTR; \
129 #define DO_VAR(varname) { PUSH_TOS; TOS = (cell_t) &varname; }
132 #define M_THROW(err) \
134 ExceptionReturnCode = (ThrowCode)(err); \
135 TORPTR = InitialReturnStack; /* Will cause return to 'C' */ \
136 STKPTR = InitialDataStack; \
137 FP_STKPTR = InitialFloatStack; \
140 #define M_THROW(err) \
142 ExceptionReturnCode = (err); \
143 TORPTR = InitialReturnStack; /* Will cause return to 'C' */ \
144 STKPTR = InitialDataStack; \
148 /***************************************************************
150 ***************************************************************/
152 #define BINARY_OP( op ) { TOS = M_POP op TOS; }
153 #define endcase break
155 #if defined(PF_NO_SHELL) || !defined(PF_SUPPORT_TRACE)
156 #define TRACENAMES /* no names */
158 /* Display name of executing routine. */
159 static void TraceNames( ExecToken Token, cell_t Level )
164 if( ffTokenToName( Token, &DebugName ) )
167 if( gCurrentTask->td_OUT > 0 ) EMIT_CR;
169 for( i=0; i<Level; i++ )
173 TypeName( DebugName );
174 /* Space out to column N then .S */
175 NumSpaces = 30 - gCurrentTask->td_OUT;
176 for( i=0; i < NumSpaces; i++ )
181 /* No longer needed? gCurrentTask->td_OUT = 0; */ /* !!! Hack for ffDotS() */
186 MSG_NUM_H("Couldn't find Name for ", Token);
191 if( (gVarTraceLevel > Level) ) \
192 { SAVE_REGISTERS; TraceNames( Token, Level ); LOAD_REGISTERS; }
193 #endif /* PF_NO_SHELL */
195 /* Use local copy of CODE_BASE for speed. */
196 #define LOCAL_CODEREL_TO_ABS( a ) ((cell_t *) (((cell_t) a) + CodeBase))
198 static const char *pfSelectFileModeCreate( int fam );
199 static const char *pfSelectFileModeOpen( int fam );
201 /**************************************************************/
202 static const char *pfSelectFileModeCreate( int fam )
204 const char *famText = NULL;
207 case (PF_FAM_WRITE_ONLY + PF_FAM_BINARY_FLAG):
208 famText = PF_FAM_BIN_CREATE_WO;
210 case (PF_FAM_READ_WRITE + PF_FAM_BINARY_FLAG):
211 famText = PF_FAM_BIN_CREATE_RW;
213 case PF_FAM_WRITE_ONLY:
214 famText = PF_FAM_CREATE_WO;
216 case PF_FAM_READ_WRITE:
217 famText = PF_FAM_CREATE_RW;
226 /**************************************************************/
227 static const char *pfSelectFileModeOpen( int fam )
229 const char *famText = NULL;
232 case (PF_FAM_READ_ONLY + PF_FAM_BINARY_FLAG):
233 famText = PF_FAM_BIN_OPEN_RO;
235 case (PF_FAM_WRITE_ONLY + PF_FAM_BINARY_FLAG):
236 famText = PF_FAM_BIN_CREATE_WO;
238 case (PF_FAM_READ_WRITE + PF_FAM_BINARY_FLAG):
239 famText = PF_FAM_BIN_OPEN_RW;
241 case PF_FAM_READ_ONLY:
242 famText = PF_FAM_OPEN_RO;
244 case PF_FAM_WRITE_ONLY:
245 famText = PF_FAM_CREATE_WO;
247 case PF_FAM_READ_WRITE:
249 famText = PF_FAM_OPEN_RW;
255 /**************************************************************/
256 int pfCatch( ExecToken XT )
258 register cell_t TopOfStack; /* Cache for faster execution. */
259 register cell_t *DataStackPtr;
260 register cell_t *ReturnStackPtr;
261 register cell_t *InsPtr = NULL;
262 register cell_t Token;
266 PF_FLOAT fpTopOfStack;
267 PF_FLOAT *FloatStackPtr;
270 PF_FLOAT *InitialFloatStack;
272 #ifdef PF_SUPPORT_TRACE
275 cell_t *LocalsPtr = NULL;
277 cell_t *InitialReturnStack;
278 cell_t *InitialDataStack;
279 cell_t FakeSecondary[2];
283 uint8_t *CodeBase = (uint8_t *) CODE_BASE;
284 ThrowCode ExceptionReturnCode = 0;
287 gExecutionDepth += 1;
288 PRT(("pfCatch( 0x%x ), depth = %d\n", XT, gExecutionDepth ));
292 ** Initialize FakeSecondary this way to avoid having stuff in the data section,
293 ** which is not supported for some embedded system loaders.
295 FakeSecondary[0] = 0;
296 FakeSecondary[1] = ID_EXIT; /* For EXECUTE */
298 /* Move data from task structure to registers for speed. */
301 /* Save initial stack depths for THROW */
302 InitialReturnStack = TORPTR;
303 InitialDataStack = STKPTR ;
305 InitialFloatStack = FP_STKPTR;
312 DBUG(("pfCatch: Token = 0x%x\n", Token ));
314 /* --------------------------------------------------------------- */
315 /* If secondary, thread down code tree until we hit a primitive. */
316 while( !IsTokenPrimitive( Token ) )
318 #ifdef PF_SUPPORT_TRACE
319 if((gVarTraceFlags & TRACE_INNER) )
321 MSG("pfCatch: Secondary Token = 0x");
323 MSG_NUM_H(", InsPtr = 0x", InsPtr);
328 /* Save IP on return stack like a JSR. */
331 /* Convert execution token to absolute address. */
332 InsPtr = (cell_t *) ( LOCAL_CODEREL_TO_ABS(Token) );
334 /* Fetch token at IP. */
335 Token = READ_CELL_DIC(InsPtr++);
337 #ifdef PF_SUPPORT_TRACE
338 /* Bump level for trace display */
344 #ifdef PF_SUPPORT_TRACE
348 /* Execute primitive Token. */
352 /* Pop up a level in Forth inner interpreter.
353 ** Used to implement semicolon.
354 ** Put first in switch because ID_EXIT==0 */
356 InsPtr = ( cell_t *) M_R_POP;
357 #ifdef PF_SUPPORT_TRACE
362 case ID_1MINUS: TOS--; endcase;
364 case ID_1PLUS: TOS++; endcase;
368 ff2Literal( TOS, M_POP );
371 #endif /* !PF_NO_SHELL */
374 /* hi part stored first, put on top of stack */
376 TOS = READ_CELL_DIC(InsPtr++);
377 M_PUSH(READ_CELL_DIC(InsPtr++));
380 case ID_2MINUS: TOS -= 2; endcase;
382 case ID_2PLUS: TOS += 2; endcase;
385 case ID_2OVER: /* ( a b c d -- a b c d a b ) */
387 Scratch = M_STACK(3);
392 case ID_2SWAP: /* ( a b c d -- c d a b ) */
393 Scratch = M_STACK(0); /* c */
394 M_STACK(0) = M_STACK(2); /* a */
395 M_STACK(2) = Scratch; /* c */
396 Scratch = TOS; /* d */
397 TOS = M_STACK(1); /* b */
398 M_STACK(1) = Scratch; /* d */
401 case ID_2DUP: /* ( a b -- a b a b ) */
403 Scratch = M_STACK(1);
409 M_PUSH( (*(TORPTR+1)) );
425 case ID_ACCEPT_P: /* ( c-addr +n1 -- +n2 ) */
426 CharPtr = (char *) M_POP;
427 TOS = ioAccept( CharPtr, TOS );
432 ffALiteral( ABS_TO_CODEREL(TOS) );
435 #endif /* !PF_NO_SHELL */
439 TOS = (cell_t) LOCAL_CODEREL_TO_ABS( READ_CELL_DIC(InsPtr++) );
442 /* Allocate some extra and put validation identifier at base */
443 #define PF_MEMORY_VALIDATOR (0xA81B4D69)
445 /* Allocate at least one cell's worth because we clobber first cell. */
446 if ( TOS < sizeof(cell_t) )
448 Temp = sizeof(cell_t);
454 /* Allocate extra cells worth because we store validation info. */
455 CellPtr = (cell_t *) pfAllocMem( Temp + sizeof(cell_t) );
458 /* This was broken into two steps because different compilers incremented
459 ** CellPtr before or after the XOR step. */
460 Temp = (cell_t)CellPtr ^ PF_MEMORY_VALIDATOR;
462 M_PUSH( (cell_t) CellPtr );
468 TOS = -1; /* FIXME Fix error code. */
472 case ID_AND: BINARY_OP( & ); endcase;
474 case ID_ARSHIFT: BINARY_OP( >> ); endcase; /* Arithmetic right shift */
478 TOS = CREATE_BODY_OFFSET;
481 /* Branch is followed by an offset relative to address of offset. */
483 DBUGX(("Before Branch: IP = 0x%x\n", InsPtr ));
485 DBUGX(("After Branch: IP = 0x%x\n", InsPtr ));
489 M_THROW( THROW_BYE );
493 MSG("Emergency exit.\n");
501 Scratch = pfCatch( Scratch );
509 Scratch = READ_CELL_DIC(InsPtr++);
510 CallUserFunction( Scratch & 0xFFFF,
512 (Scratch >> 24) & 0x7F );
516 /* Support 32/64 bit operation. */
519 TOS = sizeof(cell_t);
523 TOS = TOS * sizeof(cell_t);
526 case ID_CFETCH: TOS = *((uint8_t *) TOS); endcase;
528 case ID_CMOVE: /* ( src dst n -- ) */
530 register char *DstPtr = (char *) M_POP; /* dst */
531 CharPtr = (char *) M_POP; /* src */
532 for( Scratch=0; (ucell_t) Scratch < (ucell_t) TOS ; Scratch++ )
534 *DstPtr++ = *CharPtr++;
540 case ID_CMOVE_UP: /* ( src dst n -- ) */
542 register char *DstPtr = ((char *) M_POP) + TOS; /* dst */
543 CharPtr = ((char *) M_POP) + TOS;; /* src */
544 for( Scratch=0; (ucell_t) Scratch < (ucell_t) TOS ; Scratch++ )
546 *(--DstPtr) = *(--CharPtr);
558 case ID_COLON_P: /* ( $name xt -- ) */
559 CreateDicEntry( TOS, (char *) M_POP, 0 );
562 #endif /* !PF_NO_SHELL */
568 s2 = (const char *) M_POP;
570 s1 = (const char *) M_POP;
571 TOS = ffCompare( s1, len1, s2, TOS );
575 /* ( a b -- flag , Comparisons ) */
577 TOS = ( TOS == M_POP ) ? FTRUE : FFALSE ;
579 case ID_COMP_NOT_EQUAL:
580 TOS = ( TOS != M_POP ) ? FTRUE : FFALSE ;
582 case ID_COMP_GREATERTHAN:
583 TOS = ( M_POP > TOS ) ? FTRUE : FFALSE ;
585 case ID_COMP_LESSTHAN:
586 TOS = ( M_POP < TOS ) ? FTRUE : FFALSE ;
588 case ID_COMP_U_GREATERTHAN:
589 TOS = ( ((ucell_t)M_POP) > ((ucell_t)TOS) ) ? FTRUE : FFALSE ;
591 case ID_COMP_U_LESSTHAN:
592 TOS = ( ((ucell_t)M_POP) < ((ucell_t)TOS) ) ? FTRUE : FFALSE ;
594 case ID_COMP_ZERO_EQUAL:
595 TOS = ( TOS == 0 ) ? FTRUE : FFALSE ;
597 case ID_COMP_ZERO_NOT_EQUAL:
598 TOS = ( TOS != 0 ) ? FTRUE : FALSE ;
600 case ID_COMP_ZERO_GREATERTHAN:
601 TOS = ( TOS > 0 ) ? FTRUE : FFALSE ;
603 case ID_COMP_ZERO_LESSTHAN:
604 TOS = ( TOS < 0 ) ? FTRUE : FFALSE ;
617 #endif /* !PF_NO_SHELL */
621 /* Put address of body on stack. Insptr points after code start. */
622 TOS = (cell_t) ((char *)InsPtr - sizeof(cell_t) + CREATE_BODY_OFFSET );
625 case ID_CSTORE: /* ( c caddr -- ) */
626 *((uint8_t *) TOS) = (uint8_t) M_POP;
630 /* Double precision add. */
631 case ID_D_PLUS: /* D+ ( al ah bl bh -- sl sh ) */
633 register ucell_t ah,al,bl,sh,sl;
640 if( sl < bl ) sh = 1; /* Carry */
648 /* Double precision subtract. */
649 case ID_D_MINUS: /* D- ( al ah bl bh -- sl sh ) */
651 register ucell_t ah,al,bl,sh,sl;
658 if( al < bl ) sh = 1; /* Borrow */
666 /* Assume 8-bit char and calculate cell width. */
667 #define NBITS ((sizeof(ucell_t)) * 8)
668 /* Define half the number of bits in a cell. */
669 #define HNBITS (NBITS / 2)
670 /* Assume two-complement arithmetic to calculate lower half. */
671 #define LOWER_HALF(n) ((n) & (((ucell_t)1 << HNBITS) - 1))
672 #define HIGH_BIT ((ucell_t)1 << (NBITS - 1))
674 /* Perform cell*cell bit multiply for a 2 cell result, by factoring into half cell quantities.
675 * Using an improved algorithm suggested by Steve Green.
676 * Converted to 64-bit by Aleksej Saushev.
678 case ID_D_UMTIMES: /* UM* ( a b -- lo hi ) */
680 ucell_t ahi, alo, bhi, blo; /* input parts */
681 ucell_t lo, hi, temp;
682 /* Get values from stack. */
685 /* Break into hi and lo 16 bit parts. */
686 alo = LOWER_HALF(ahi);
688 blo = LOWER_HALF(bhi);
693 /* higher part: ahi * bhi */
695 /* middle (overlapping) part: ahi * blo */
697 lo += LOWER_HALF(temp);
698 hi += temp >> HNBITS;
699 /* middle (overlapping) part: alo * bhi */
701 lo += LOWER_HALF(temp);
702 hi += temp >> HNBITS;
703 /* lower part: alo * blo */
705 /* its higher half overlaps with middle's lower half: */
706 lo += temp >> HNBITS;
710 /* combine lower part of result: */
711 lo = (lo << HNBITS) + LOWER_HALF(temp);
718 /* Perform cell*cell bit multiply for 2 cell result, using shift and add. */
719 case ID_D_MTIMES: /* M* ( a b -- pl ph ) */
721 ucell_t ahi, alo, bhi, blo; /* input parts */
722 ucell_t lo, hi, temp;
724 /* Get values from stack. */
728 /* Calculate product sign: */
729 sg = ((cell_t)(ahi ^ bhi) < 0);
730 /* Take absolute values and reduce to um* */
731 if ((cell_t)ahi < 0) ahi = (ucell_t)(-ahi);
732 if ((cell_t)bhi < 0) bhi = (ucell_t)(-bhi);
734 /* Break into hi and lo 16 bit parts. */
735 alo = LOWER_HALF(ahi);
737 blo = LOWER_HALF(bhi);
742 /* higher part: ahi * bhi */
744 /* middle (overlapping) part: ahi * blo */
746 lo += LOWER_HALF(temp);
747 hi += temp >> HNBITS;
748 /* middle (overlapping) part: alo * bhi */
750 lo += LOWER_HALF(temp);
751 hi += temp >> HNBITS;
752 /* lower part: alo * blo */
754 /* its higher half overlaps with middle's lower half: */
755 lo += temp >> HNBITS;
759 /* combine lower part of result: */
760 lo = (lo << HNBITS) + LOWER_HALF(temp);
762 /* Negate product if one operand negative. */
765 /* lo = (ucell_t)(- lo); */
767 hi = ~hi + ((lo == 0) ? 1 : 0);
775 #define DULT(du1l,du1h,du2l,du2h) ( (du2h<du1h) ? FALSE : ( (du2h==du1h) ? (du1l<du2l) : TRUE) )
776 /* Perform 2 cell by 1 cell divide for 1 cell result and remainder, using shift and subtract. */
777 case ID_D_UMSMOD: /* UM/MOD ( al ah bdiv -- rem q ) */
779 ucell_t ah,al, q,di, bl,bh, sl,sh;
785 for( di=0; di<NBITS; di++ )
787 if( !DULT(al,ah,bl,bh) )
791 if( al < bl ) sh = 1; /* Borrow */
798 bl = (bl >> 1) | (bh << (NBITS-1));
801 if( !DULT(al,ah,bl,bh) )
807 M_PUSH( al ); /* rem */
812 /* Perform 2 cell by 1 cell divide for 2 cell result and remainder, using shift and subtract. */
813 case ID_D_MUSMOD: /* MU/MOD ( al am bdiv -- rem ql qh ) */
815 register ucell_t ah,am,al,ql,qh,di;
816 #define bdiv ((ucell_t)TOS)
821 for( di=0; di<2*NBITS; di++ )
828 qh = (qh << 1) | (ql >> (NBITS-1));
830 ah = (ah << 1) | (am >> (NBITS-1));
831 am = (am << 1) | (al >> (NBITS-1));
833 DBUG(("XX ah,m,l = 0x%8x,%8x,%8x - qh,l = 0x%8x,%8x\n", ah,am,al, qh,ql ));
840 M_PUSH( ah ); /* rem */
851 #endif /* !PF_NO_SHELL */
858 TOS = gCurrentTask->td_StackBase - STKPTR;
861 case ID_DIVIDE: BINARY_OP( / ); endcase;
872 case ID_DROP: M_DROP; endcase;
876 DumpMemory( (char *) Scratch, TOS );
880 case ID_DUP: M_DUP; endcase;
882 case ID_DO_P: /* ( limit start -- ) ( R: -- start limit ) */
888 case ID_EOL: /* ( -- end_of_line_char ) */
893 case ID_ERRORQ_P: /* ( flag num -- , quit if flag true ) */
912 /* Save IP on return stack like a JSR. */
914 #ifdef PF_SUPPORT_TRACE
915 /* Bump level for trace. */
918 if( IsTokenPrimitive( TOS ) )
920 WRITE_CELL_DIC( (cell_t *) &FakeSecondary[0], TOS); /* Build a fake secondary and execute it. */
921 InsPtr = &FakeSecondary[0];
925 InsPtr = (cell_t *) LOCAL_CODEREL_TO_ABS(TOS);
931 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
934 TOS = (cell_t) READ_CELL_DIC((cell_t *)TOS);
938 TOS = *((cell_t *)TOS);
941 TOS = *((cell_t *)TOS);
945 case ID_FILE_CREATE: /* ( c-addr u fam -- fid ior ) */
946 /* Build NUL terminated name string. */
947 Scratch = M_POP; /* u */
948 Temp = M_POP; /* caddr */
949 if( Scratch < TIB_SIZE-2 )
951 const char *famText = pfSelectFileModeCreate( TOS );
952 pfCopyMemory( gScratch, (char *) Temp, (ucell_t) Scratch );
953 gScratch[Scratch] = '\0';
954 DBUG(("Create file = %s with famTxt %s\n", gScratch, famText ));
955 FileID = sdOpenFile( gScratch, famText );
956 TOS = ( FileID == NULL ) ? -1 : 0 ;
957 M_PUSH( (cell_t) FileID );
961 ERR("Filename too large for name buffer.\n");
967 case ID_FILE_DELETE: /* ( c-addr u -- ior ) */
968 /* Build NUL terminated name string. */
969 Temp = M_POP; /* caddr */
970 if( TOS < TIB_SIZE-2 )
972 pfCopyMemory( gScratch, (char *) Temp, (ucell_t) TOS );
973 gScratch[TOS] = '\0';
974 DBUG(("Delete file = %s\n", gScratch ));
975 TOS = sdDeleteFile( gScratch );
979 ERR("Filename too large for name buffer.\n");
984 case ID_FILE_OPEN: /* ( c-addr u fam -- fid ior ) */
985 /* Build NUL terminated name string. */
986 Scratch = M_POP; /* u */
987 Temp = M_POP; /* caddr */
988 if( Scratch < TIB_SIZE-2 )
990 const char *famText = pfSelectFileModeOpen( TOS );
991 pfCopyMemory( gScratch, (char *) Temp, (ucell_t) Scratch );
992 gScratch[Scratch] = '\0';
993 DBUG(("Open file = %s\n", gScratch ));
994 FileID = sdOpenFile( gScratch, famText );
996 TOS = ( FileID == NULL ) ? -1 : 0 ;
997 M_PUSH( (cell_t) FileID );
1001 ERR("Filename too large for name buffer.\n");
1007 case ID_FILE_CLOSE: /* ( fid -- ior ) */
1008 TOS = sdCloseFile( (FileStream *) TOS );
1011 case ID_FILE_READ: /* ( addr len fid -- u2 ior ) */
1012 FileID = (FileStream *) TOS;
1014 CharPtr = (char *) M_POP;
1015 Temp = sdReadFile( CharPtr, 1, Scratch, FileID );
1020 case ID_FILE_SIZE: /* ( fid -- ud ior ) */
1021 /* Determine file size by seeking to end and returning position. */
1022 FileID = (FileStream *) TOS;
1024 off_t endposition, offsetHi;
1025 off_t original = sdTellFile( FileID );
1026 sdSeekFile( FileID, 0, PF_SEEK_END );
1027 endposition = sdTellFile( FileID );
1028 M_PUSH(endposition);
1029 /* Just use a 0 if they are the same size. */
1030 offsetHi = (sizeof(off_t) > sizeof(cell_t)) ? (endposition >> (8*sizeof(cell_t))) : 0 ;
1032 sdSeekFile( FileID, original, PF_SEEK_SET );
1033 TOS = (original < 0) ? -4 : 0 ; /* !!! err num */
1037 case ID_FILE_WRITE: /* ( addr len fid -- ior ) */
1038 FileID = (FileStream *) TOS;
1040 CharPtr = (char *) M_POP;
1041 Temp = sdWriteFile( CharPtr, 1, Scratch, FileID );
1042 TOS = (Temp != Scratch) ? -3 : 0;
1045 case ID_FILE_REPOSITION: /* ( ud fid -- ior ) */
1048 FileID = (FileStream *) TOS;
1050 /* Avoid compiler warnings on Mac. */
1051 offset = (sizeof(off_t) > sizeof(cell_t)) ? (offset << 8*sizeof(cell_t)) : 0 ;
1053 TOS = sdSeekFile( FileID, offset, PF_SEEK_SET );
1057 case ID_FILE_POSITION: /* ( fid -- ud ior ) */
1061 FileID = (FileStream *) TOS;
1062 position = sdTellFile( FileID );
1064 /* Just use a 0 if they are the same size. */
1065 offsetHi = (sizeof(off_t) > sizeof(cell_t)) ? (position >> (8*sizeof(cell_t))) : 0 ;
1067 TOS = (position < 0) ? -4 : 0 ; /* !!! err num */
1071 case ID_FILE_RO: /* ( -- fam ) */
1073 TOS = PF_FAM_READ_ONLY;
1076 case ID_FILE_RW: /* ( -- fam ) */
1078 TOS = PF_FAM_READ_WRITE;
1081 case ID_FILE_WO: /* ( -- fam ) */
1083 TOS = PF_FAM_WRITE_ONLY;
1086 case ID_FILE_BIN: /* ( -- fam ) */
1087 TOS = TOS | PF_FAM_BINARY_FLAG;
1090 case ID_FILL: /* ( caddr num charval -- ) */
1092 register char *DstPtr;
1093 Temp = M_POP; /* num */
1094 DstPtr = (char *) M_POP; /* dst */
1095 for( Scratch=0; (ucell_t) Scratch < (ucell_t) Temp ; Scratch++ )
1097 *DstPtr++ = (char) TOS;
1104 case ID_FIND: /* ( $addr -- $addr 0 | xt +-1 ) */
1105 TOS = ffFind( (char *) TOS, (ExecToken *) &Temp );
1110 TOS = ffFindNFA( (const ForthString *) TOS, (const ForthString **) &Temp );
1111 M_PUSH( (cell_t) Temp );
1113 #endif /* !PF_NO_SHELL */
1119 /* Validate memory before freeing. Clobber validator and first word. */
1120 case ID_FREE: /* ( addr -- result ) */
1123 ERR("FREE passed NULL!\n");
1124 TOS = -2; /* FIXME error code */
1128 CellPtr = (cell_t *) TOS;
1130 if( ((ucell_t)*CellPtr) != ((ucell_t)CellPtr ^ PF_MEMORY_VALIDATOR))
1132 TOS = -2; /* FIXME error code */
1136 CellPtr[0] = 0xDeadBeef;
1137 pfFreeMem((char *)CellPtr);
1143 #include "pfinnrfp.h"
1147 TOS = (cell_t)CODE_HERE;
1150 case ID_NUMBERQ_P: /* ( addr -- 0 | n 1 ) */
1151 /* Convert using number converter in 'C'.
1152 ** Only supports single precision for bootstrap.
1154 TOS = (cell_t) ffNumberQ( (char *) TOS, &Temp );
1155 if( TOS == NUM_TYPE_SINGLE)
1157 M_PUSH( Temp ); /* Push single number */
1161 case ID_I: /* ( -- i , DO LOOP index ) */
1167 case ID_INCLUDE_FILE:
1168 FileID = (FileStream *) TOS;
1169 M_DROP; /* Drop now so that INCLUDE has a clean stack. */
1171 Scratch = ffIncludeFile( FileID );
1173 if( Scratch ) M_THROW(Scratch)
1175 #endif /* !PF_NO_SHELL */
1180 Scratch = ffInterpret();
1182 if( Scratch ) M_THROW(Scratch)
1184 #endif /* !PF_NO_SHELL */
1186 case ID_J: /* ( -- j , second DO LOOP index ) */
1201 #endif /* !PF_NO_SHELL */
1204 DBUG(("ID_LITERAL_P: InsPtr = 0x%x, *InsPtr = 0x%x\n", InsPtr, *InsPtr ));
1206 TOS = READ_CELL_DIC(InsPtr++);
1210 case ID_LOCAL_COMPILER: DO_VAR(gLocalCompiler_XT); endcase;
1211 #endif /* !PF_NO_SHELL */
1213 case ID_LOCAL_FETCH: /* ( i <local> -- n , fetch from local ) */
1214 TOS = *(LocalsPtr - TOS);
1217 #define LOCAL_FETCH_N(num) \
1218 case ID_LOCAL_FETCH_##num: /* ( <local> -- n , fetch from local ) */ \
1220 TOS = *(LocalsPtr -(num)); \
1232 case ID_LOCAL_STORE: /* ( n i <local> -- , store n in local ) */
1233 *(LocalsPtr - TOS) = M_POP;
1237 #define LOCAL_STORE_N(num) \
1238 case ID_LOCAL_STORE_##num: /* ( n <local> -- , store n in local ) */ \
1239 *(LocalsPtr - (num)) = TOS; \
1252 case ID_LOCAL_PLUSSTORE: /* ( n i <local> -- , add n to local ) */
1253 *(LocalsPtr - TOS) += M_POP;
1257 case ID_LOCAL_ENTRY: /* ( x0 x1 ... xn n -- ) */
1258 /* create local stack frame */
1262 DBUG(("LocalEntry: n = %d\n", TOS));
1263 /* End of locals. Create stack frame */
1264 DBUG(("LocalEntry: before RP@ = 0x%x, LP = 0x%x\n",
1265 TORPTR, LocalsPtr));
1266 M_R_PUSH(LocalsPtr);
1269 DBUG(("LocalEntry: after RP@ = 0x%x, LP = 0x%x\n",
1270 TORPTR, LocalsPtr));
1274 *lp++ = M_POP; /* Load local vars from stack */
1280 case ID_LOCAL_EXIT: /* cleanup up local stack frame */
1281 DBUG(("LocalExit: before RP@ = 0x%x, LP = 0x%x\n",
1282 TORPTR, LocalsPtr));
1284 LocalsPtr = (cell_t *) M_R_POP;
1285 DBUG(("LocalExit: after RP@ = 0x%x, LP = 0x%x\n",
1286 TORPTR, LocalsPtr));
1291 MSG("Load "); MSG(SYSTEM_LOAD_FILE); EMIT_CR;
1292 FileID = sdOpenFile(SYSTEM_LOAD_FILE, "r");
1296 Scratch = ffIncludeFile( FileID ); /* Also closes the file. */
1298 if( Scratch ) M_THROW(Scratch);
1302 ERR(SYSTEM_LOAD_FILE); ERR(" could not be opened!\n");
1305 #endif /* !PF_NO_SHELL */
1307 case ID_LEAVE_P: /* ( R: index limit -- ) */
1313 case ID_LOOP_P: /* ( R: index limit -- | index limit ) */
1314 Temp = M_R_POP; /* limit */
1315 Scratch = M_R_POP + 1; /* index */
1316 if( Scratch == Temp )
1318 InsPtr++; /* skip branch offset, exit loop */
1322 /* Push index and limit back to R */
1323 M_R_PUSH( Scratch );
1325 /* Branch back to just after (DO) */
1330 case ID_LSHIFT: BINARY_OP( << ); endcase;
1334 TOS = ( TOS > Scratch ) ? TOS : Scratch ;
1339 TOS = ( TOS < Scratch ) ? TOS : Scratch ;
1342 case ID_MINUS: BINARY_OP( - ); endcase;
1345 case ID_NAME_TO_TOKEN:
1346 TOS = (cell_t) NameToToken((ForthString *)TOS);
1349 case ID_NAME_TO_PREVIOUS:
1350 TOS = (cell_t) NameToPrevious((ForthString *)TOS);
1357 case ID_OR: BINARY_OP( | ); endcase;
1364 case ID_PICK: /* ( ... n -- sp(n) ) */
1368 case ID_PLUS: BINARY_OP( + ); endcase;
1370 case ID_PLUS_STORE: /* ( n addr -- , add n to *addr ) */
1371 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
1372 if( IN_DICS( TOS ) )
1374 Scratch = READ_CELL_DIC((cell_t *)TOS);
1376 WRITE_CELL_DIC((cell_t *)TOS,Scratch);
1380 *((cell_t *)TOS) += M_POP;
1383 *((cell_t *)TOS) += M_POP;
1388 case ID_PLUSLOOP_P: /* ( delta -- ) ( R: index limit -- | index limit ) */
1390 ucell_t OldIndex, NewIndex, Limit;
1394 NewIndex = OldIndex + TOS; /* add TOS to index, not 1 */
1395 /* Do indices cross boundary between LIMIT-1 and LIMIT ? */
1396 if( ( (OldIndex - Limit) & ((Limit-1) - NewIndex) & 0x80000000 ) ||
1397 ( (NewIndex - Limit) & ((Limit-1) - OldIndex) & 0x80000000 ) )
1399 InsPtr++; /* skip branch offset, exit loop */
1403 /* Push index and limit back to R */
1404 M_R_PUSH( NewIndex );
1406 /* Branch back to just after (DO) */
1413 case ID_QDO_P: /* (?DO) ( limit start -- ) ( R: -- start limit ) */
1414 Scratch = M_POP; /* limit */
1415 if( Scratch == TOS )
1417 /* Branch to just after (LOOP) */
1423 M_R_PUSH( Scratch );
1424 InsPtr++; /* skip branch offset, enter loop */
1429 case ID_QDUP: if( TOS ) M_DUP; endcase;
1431 case ID_QTERMINAL: /* WARNING: Typically not fully implemented! */
1433 TOS = sdQueryTerminal();
1436 case ID_QUIT_P: /* Stop inner interpreter, go back to user. */
1437 #ifdef PF_SUPPORT_TRACE
1440 M_THROW(THROW_QUIT);
1459 TOS = (ffRefill() > 0) ? FTRUE : FFALSE;
1462 /* Resize memory allocated by ALLOCATE. */
1463 case ID_RESIZE: /* ( addr1 u -- addr2 result ) */
1465 cell_t *Addr1 = (cell_t *) M_POP;
1466 /* Point to validator below users address. */
1467 cell_t *FreePtr = Addr1 - 1;
1468 if( ((ucell_t)*FreePtr) != ((ucell_t)FreePtr ^ PF_MEMORY_VALIDATOR))
1470 /* 090218 - Fixed bug, was returning zero. */
1476 /* Try to allocate. */
1477 CellPtr = (cell_t *) pfAllocMem( TOS + sizeof(cell_t) );
1480 /* Copy memory including validation. */
1481 pfCopyMemory( (char *) CellPtr, (char *) FreePtr, TOS + sizeof(cell_t) );
1482 *CellPtr = (cell_t)(((ucell_t)CellPtr) ^ (ucell_t)PF_MEMORY_VALIDATOR);
1483 /* 090218 - Fixed bug that was incrementing the address twice. Thanks Reinhold Straub. */
1484 /* Increment past validator to user address. */
1485 M_PUSH( (cell_t) (CellPtr + 1) );
1486 TOS = 0; /* Result code. */
1487 /* Mark old cell as dead so we can't free it twice. */
1488 FreePtr[0] = 0xDeadBeef;
1489 pfFreeMem((char *) FreePtr);
1493 /* 090218 - Fixed bug, was returning zero. */
1495 TOS = -4; /* FIXME Fix error code. */
1502 ** RP@ and RP! are called secondaries so we must
1503 ** account for the return address pushed before calling.
1505 case ID_RP_FETCH: /* ( -- rp , address of top of return stack ) */
1507 TOS = (cell_t)TORPTR; /* value before calling RP@ */
1510 case ID_RP_STORE: /* ( rp -- , address of top of return stack ) */
1511 TORPTR = (cell_t *) TOS;
1515 case ID_ROLL: /* ( xu xu-1 xu-1 ... x0 u -- xu-1 xu-1 ... x0 xu ) */
1518 cell_t *srcPtr, *dstPtr;
1519 Scratch = M_STACK(TOS);
1520 srcPtr = &M_STACK(TOS-1);
1521 dstPtr = &M_STACK(TOS);
1522 for( ri=0; ri<TOS; ri++ )
1524 *dstPtr-- = *srcPtr--;
1531 case ID_ROT: /* ( a b c -- b c a ) */
1532 Scratch = M_POP; /* b */
1533 Temp = M_POP; /* a */
1534 M_PUSH( Scratch ); /* b */
1539 /* Logical right shift */
1540 case ID_RSHIFT: { TOS = ((ucell_t)M_POP) >> TOS; } endcase;
1543 case ID_SAVE_FORTH_P: /* ( $name Entry NameSize CodeSize -- err ) */
1545 cell_t NameSize, CodeSize, EntryPoint;
1549 ForthStringToC( gScratch, (char *) M_POP, sizeof(gScratch) );
1550 TOS = ffSaveForth( gScratch, EntryPoint, NameSize, CodeSize );
1556 ** EVALUATE >IN SourceID=(-1) 1111
1557 ** keyboard >IN SourceID=(0) 2222
1558 ** file >IN lineNumber filePos SourceID=(fileID)
1560 case ID_SAVE_INPUT: /* FIXME - finish */
1565 case ID_SP_FETCH: /* ( -- sp , address of top of stack, sorta ) */
1567 TOS = (cell_t)STKPTR;
1570 case ID_SP_STORE: /* ( sp -- , address of top of stack, sorta ) */
1571 STKPTR = (cell_t *) TOS;
1575 case ID_STORE: /* ( n addr -- , write n to addr ) */
1576 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
1577 if( IN_DICS( TOS ) )
1579 WRITE_CELL_DIC((cell_t *)TOS,M_POP);
1583 *((cell_t *)TOS) = M_POP;
1586 *((cell_t *)TOS) = M_POP;
1591 case ID_SCAN: /* ( addr cnt char -- addr' cnt' ) */
1592 Scratch = M_POP; /* cnt */
1593 Temp = M_POP; /* addr */
1594 TOS = ffScan( (char *) Temp, Scratch, (char) TOS, &CharPtr );
1595 M_PUSH((cell_t) CharPtr);
1601 Scratch = ffSemiColon();
1603 if( Scratch ) M_THROW( Scratch );
1605 #endif /* !PF_NO_SHELL */
1607 case ID_SKIP: /* ( addr cnt char -- addr' cnt' ) */
1608 Scratch = M_POP; /* cnt */
1609 Temp = M_POP; /* addr */
1610 TOS = ffSkip( (char *) Temp, Scratch, (char) TOS, &CharPtr );
1611 M_PUSH((cell_t) CharPtr);
1614 case ID_SOURCE: /* ( -- c-addr num ) */
1616 M_PUSH( (cell_t) gCurrentTask->td_SourcePtr );
1617 TOS = (cell_t) gCurrentTask->td_SourceNum;
1620 case ID_SOURCE_SET: /* ( c-addr num -- ) */
1621 gCurrentTask->td_SourcePtr = (char *) M_POP;
1622 gCurrentTask->td_SourceNum = TOS;
1628 TOS = ffConvertStreamToSourceID( gCurrentTask->td_InputStream ) ;
1631 case ID_SOURCE_ID_POP:
1633 TOS = ffConvertStreamToSourceID( ffPopInputStream() ) ;
1636 case ID_SOURCE_ID_PUSH: /* ( source-id -- ) */
1637 TOS = (cell_t)ffConvertSourceIDToStream( TOS );
1638 Scratch = ffPushInputStream((FileStream *) TOS );
1662 case ID_THROW: /* ( k*x err -- k*x | i*x err , jump to where CATCH was called ) */
1673 CharPtr = (char *) ffWord( (char) ' ' );
1674 TOS = ffFind( CharPtr, (ExecToken *) &Temp );
1677 ERR("' could not find ");
1678 ioType( (char *) CharPtr+1, *CharPtr );
1686 #endif /* !PF_NO_SHELL */
1688 case ID_TIMES: BINARY_OP( * ); endcase;
1691 Scratch = M_POP; /* addr */
1692 ioType( (char *) Scratch, TOS );
1701 case ID_VAR_BASE: DO_VAR(gVarBase); endcase;
1702 case ID_VAR_CODE_BASE: DO_VAR(gCurrentDictionary->dic_CodeBase); endcase;
1703 case ID_VAR_CODE_LIMIT: DO_VAR(gCurrentDictionary->dic_CodeLimit); endcase;
1704 case ID_VAR_CONTEXT: DO_VAR(gVarContext); endcase;
1705 case ID_VAR_DP: DO_VAR(gCurrentDictionary->dic_CodePtr.Cell); endcase;
1706 case ID_VAR_ECHO: DO_VAR(gVarEcho); endcase;
1707 case ID_VAR_HEADERS_BASE: DO_VAR(gCurrentDictionary->dic_HeaderBase); endcase;
1708 case ID_VAR_HEADERS_LIMIT: DO_VAR(gCurrentDictionary->dic_HeaderLimit); endcase;
1709 case ID_VAR_HEADERS_PTR: DO_VAR(gCurrentDictionary->dic_HeaderPtr); endcase;
1710 case ID_VAR_NUM_TIB: DO_VAR(gCurrentTask->td_SourceNum); endcase;
1711 case ID_VAR_OUT: DO_VAR(gCurrentTask->td_OUT); endcase;
1712 case ID_VAR_STATE: DO_VAR(gVarState); endcase;
1713 case ID_VAR_TO_IN: DO_VAR(gCurrentTask->td_IN); endcase;
1714 case ID_VAR_TRACE_FLAGS: DO_VAR(gVarTraceFlags); endcase;
1715 case ID_VAR_TRACE_LEVEL: DO_VAR(gVarTraceLevel); endcase;
1716 case ID_VAR_TRACE_STACK: DO_VAR(gVarTraceStack); endcase;
1717 case ID_VAR_RETURN_CODE: DO_VAR(gVarReturnCode); endcase;
1720 TOS = (cell_t) ffWord( (char) TOS );
1723 case ID_WORD_FETCH: /* ( waddr -- w ) */
1724 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
1725 if( IN_DICS( TOS ) )
1727 TOS = (uint16_t) READ_SHORT_DIC((uint16_t *)TOS);
1731 TOS = *((uint16_t *)TOS);
1734 TOS = *((uint16_t *)TOS);
1738 case ID_WORD_STORE: /* ( w waddr -- ) */
1740 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
1741 if( IN_DICS( TOS ) )
1743 WRITE_SHORT_DIC((uint16_t *)TOS,(uint16_t)M_POP);
1747 *((uint16_t *)TOS) = (uint16_t) M_POP;
1750 *((uint16_t *)TOS) = (uint16_t) M_POP;
1755 case ID_XOR: BINARY_OP( ^ ); endcase;
1758 /* Branch is followed by an offset relative to address of offset. */
1759 case ID_ZERO_BRANCH:
1760 DBUGX(("Before 0Branch: IP = 0x%x\n", InsPtr ));
1767 InsPtr++; /* skip over offset */
1770 DBUGX(("After 0Branch: IP = 0x%x\n", InsPtr ));
1774 ERR("pfCatch: Unrecognised token = 0x");
1777 ffDotHex((cell_t) InsPtr);
1783 if(InsPtr) Token = READ_CELL_DIC(InsPtr++); /* Traverse to next token in secondary. */
1790 if( _CrtCheckMemory() == 0 )
1792 ERR("_CrtCheckMemory abort: InsPtr = 0x");
1793 ffDotHex((int)InsPtr);
1798 } while( (InitialReturnStack - TORPTR) > 0 );
1802 return ExceptionReturnCode;