1 /* @(#) pf_inner.c 98/03/16 1.7 */
\r
2 /***************************************************************
\r
3 ** Inner Interpreter for Forth based on 'C'
\r
6 ** Copyright 1994 3DO, Phil Burk, Larry Polansky, David Rosenboom
\r
8 ** The pForth software code is dedicated to the public domain,
\r
9 ** and any third party may reproduce, distribute and modify
\r
10 ** the pForth software code or any derivative works thereof
\r
11 ** without any compensation or license. The pForth software
\r
12 ** code is provided on an "as is" basis without any warranty
\r
13 ** of any kind, including, without limitation, the implied
\r
14 ** warranties of merchantability and fitness for a particular
\r
15 ** purpose and their equivalents under the laws of any jurisdiction.
\r
17 ****************************************************************
\r
19 ** 940502 PLB Creation.
\r
20 ** 940505 PLB More macros.
\r
21 ** 940509 PLB Moved all stack stuff into pfCatch.
\r
22 ** 941014 PLB Converted to flat secondary strusture.
\r
23 ** 941027 rdg added casts to ID_SP_FETCH, ID_RP_FETCH,
\r
24 ** and ID_HERE for armcc
\r
25 ** 941130 PLB Made w@ unsigned
\r
27 ***************************************************************/
\r
32 #define SYSTEM_LOAD_FILE "system.fth"
\r
34 /***************************************************************
\r
35 ** Macros for data stack access.
\r
36 ** TOS is cached in a register in pfCatch.
\r
37 ***************************************************************/
\r
39 #define STKPTR (DataStackPtr)
\r
40 #define M_POP (*(STKPTR++))
\r
41 #define M_PUSH(n) {*(--(STKPTR)) = (cell) (n);}
\r
42 #define M_STACK(n) (STKPTR[n])
\r
44 #define TOS (TopOfStack)
\r
45 #define PUSH_TOS M_PUSH(TOS)
\r
46 #define M_DUP PUSH_TOS;
\r
47 #define M_DROP { TOS = M_POP; }
\r
50 /***************************************************************
\r
51 ** Macros for Floating Point stack access.
\r
52 ***************************************************************/
\r
53 #ifdef PF_SUPPORT_FP
\r
54 #define FP_STKPTR (FloatStackPtr)
\r
55 #define M_FP_SPZERO (gCurrentTask->td_FloatStackBase)
\r
56 #define M_FP_POP (*(FP_STKPTR++))
\r
57 #define M_FP_PUSH(n) {*(--(FP_STKPTR)) = (PF_FLOAT) (n);}
\r
58 #define M_FP_STACK(n) (FP_STKPTR[n])
\r
60 #define FP_TOS (fpTopOfStack)
\r
61 #define PUSH_FP_TOS M_FP_PUSH(FP_TOS)
\r
62 #define M_FP_DUP PUSH_FP_TOS;
\r
63 #define M_FP_DROP { FP_TOS = M_FP_POP; }
\r
66 /***************************************************************
\r
67 ** Macros for return stack access.
\r
68 ***************************************************************/
\r
70 #define TORPTR (ReturnStackPtr)
\r
71 #define M_R_DROP {TORPTR++;}
\r
72 #define M_R_POP (*(TORPTR++))
\r
73 #define M_R_PICK(n) (TORPTR[n])
\r
74 #define M_R_PUSH(n) {*(--(TORPTR)) = (cell) (n);}
\r
76 /***************************************************************
\r
77 ** Misc Forth macros
\r
78 ***************************************************************/
\r
80 #define M_BRANCH { InsPtr = (cell *) (((uint8 *) InsPtr) + READ_LONG_DIC(InsPtr)); }
\r
82 /* Cache top of data stack like in JForth. */
\r
83 #ifdef PF_SUPPORT_FP
\r
84 #define LOAD_REGISTERS \
\r
86 STKPTR = gCurrentTask->td_StackPtr; \
\r
88 FP_STKPTR = gCurrentTask->td_FloatStackPtr; \
\r
89 FP_TOS = M_FP_POP; \
\r
90 TORPTR = gCurrentTask->td_ReturnPtr; \
\r
93 #define SAVE_REGISTERS \
\r
95 gCurrentTask->td_ReturnPtr = TORPTR; \
\r
97 gCurrentTask->td_StackPtr = STKPTR; \
\r
98 M_FP_PUSH( FP_TOS ); \
\r
99 gCurrentTask->td_FloatStackPtr = FP_STKPTR; \
\r
103 /* Cache top of data stack like in JForth. */
\r
104 #define LOAD_REGISTERS \
\r
106 STKPTR = gCurrentTask->td_StackPtr; \
\r
108 TORPTR = gCurrentTask->td_ReturnPtr; \
\r
111 #define SAVE_REGISTERS \
\r
113 gCurrentTask->td_ReturnPtr = TORPTR; \
\r
115 gCurrentTask->td_StackPtr = STKPTR; \
\r
124 #define DO_VAR(varname) { PUSH_TOS; TOS = (cell) &varname; }
\r
126 #ifdef PF_SUPPORT_FP
\r
127 #define M_THROW(err) \
\r
129 ExceptionReturnCode = (ThrowCode)(err); \
\r
130 TORPTR = InitialReturnStack; /* Will cause return to 'C' */ \
\r
131 STKPTR = InitialDataStack; \
\r
132 FP_STKPTR = InitialFloatStack; \
\r
135 #define M_THROW(err) \
\r
137 ExceptionReturnCode = (err); \
\r
138 TORPTR = InitialReturnStack; /* Will cause return to 'C' */ \
\r
139 STKPTR = InitialDataStack; \
\r
143 /***************************************************************
\r
145 ***************************************************************/
\r
147 #define BINARY_OP( op ) { TOS = M_POP op TOS; }
\r
148 #define endcase break
\r
150 #if defined(PF_NO_SHELL) || !defined(PF_SUPPORT_TRACE)
\r
151 #define TRACENAMES /* no names */
\r
153 /* Display name of executing routine. */
\r
154 static void TraceNames( ExecToken Token, int32 Level )
\r
159 if( ffTokenToName( Token, &DebugName ) )
\r
162 if( gCurrentTask->td_OUT > 0 ) EMIT_CR;
\r
164 for( i=0; i<Level; i++ )
\r
168 TypeName( DebugName );
\r
169 /* Space out to column N then .S */
\r
170 NumSpaces = 30 - gCurrentTask->td_OUT;
\r
171 for( i=0; i < NumSpaces; i++ )
\r
176 /* No longer needed? gCurrentTask->td_OUT = 0; */ /* !!! Hack for ffDotS() */
\r
181 MSG_NUM_H("Couldn't find Name for ", Token);
\r
185 #define TRACENAMES \
\r
186 if( (gVarTraceLevel > Level) ) \
\r
187 { SAVE_REGISTERS; TraceNames( Token, Level ); LOAD_REGISTERS; }
\r
188 #endif /* PF_NO_SHELL */
\r
190 /* Use local copy of CODE_BASE for speed. */
\r
191 #define LOCAL_CODEREL_TO_ABS( a ) ((cell *) (((int32) a) + CodeBase))
\r
193 /**************************************************************/
\r
194 const char *pfSelectFileMode( int fam )
\r
196 char *famText = NULL;
\r
199 case (PF_FAM_READ_ONLY + PF_FAM_BINARY_FLAG):
\r
200 famText = PF_FAM_BIN_OPEN_RO;
\r
202 case (PF_FAM_WRITE_ONLY + PF_FAM_BINARY_FLAG):
\r
203 famText = PF_FAM_BIN_CREATE_WO;
\r
205 case (PF_FAM_READ_WRITE + PF_FAM_BINARY_FLAG):
\r
206 famText = PF_FAM_BIN_OPEN_RW;
\r
208 case PF_FAM_READ_ONLY:
\r
209 famText = PF_FAM_OPEN_RO;
\r
211 case PF_FAM_WRITE_ONLY:
\r
212 famText = PF_FAM_CREATE_WO;
\r
214 case PF_FAM_READ_WRITE:
\r
216 famText = PF_FAM_OPEN_RW;
\r
222 /**************************************************************/
\r
223 int pfCatch( ExecToken XT )
\r
225 register cell TopOfStack; /* Cache for faster execution. */
\r
226 register cell *DataStackPtr;
\r
227 register cell *ReturnStackPtr;
\r
228 register cell *InsPtr = NULL;
\r
229 register cell Token;
\r
232 #ifdef PF_SUPPORT_FP
\r
233 PF_FLOAT fpTopOfStack;
\r
234 PF_FLOAT *FloatStackPtr;
\r
235 PF_FLOAT fpScratch;
\r
237 PF_FLOAT *InitialFloatStack;
\r
239 #ifdef PF_SUPPORT_TRACE
\r
242 cell *LocalsPtr = NULL;
\r
244 cell *InitialReturnStack;
\r
245 cell *InitialDataStack;
\r
246 cell FakeSecondary[2];
\r
249 FileStream *FileID;
\r
250 uint8 *CodeBase = CODE_BASE;
\r
251 ThrowCode ExceptionReturnCode = 0;
\r
254 gExecutionDepth += 1;
\r
255 PRT(("pfCatch( 0x%x ), depth = %d\n", XT, gExecutionDepth ));
\r
259 ** Initialize FakeSecondary this way to avoid having stuff in the data section,
\r
260 ** which is not supported for some embedded system loaders.
\r
262 FakeSecondary[0] = 0;
\r
263 FakeSecondary[1] = ID_EXIT; /* For EXECUTE */
\r
265 /* Move data from task structure to registers for speed. */
\r
268 /* Save initial stack depths for THROW */
\r
269 InitialReturnStack = TORPTR;
\r
270 InitialDataStack = STKPTR ;
\r
271 #ifdef PF_SUPPORT_FP
\r
272 InitialFloatStack = FP_STKPTR;
\r
279 DBUG(("pfCatch: Token = 0x%x\n", Token ));
\r
281 /* --------------------------------------------------------------- */
\r
282 /* If secondary, thread down code tree until we hit a primitive. */
\r
283 while( !IsTokenPrimitive( Token ) )
\r
285 #ifdef PF_SUPPORT_TRACE
\r
286 if((gVarTraceFlags & TRACE_INNER) )
\r
288 MSG("pfCatch: Secondary Token = 0x");
\r
290 MSG_NUM_H(", InsPtr = 0x", InsPtr);
\r
295 /* Save IP on return stack like a JSR. */
\r
296 M_R_PUSH( InsPtr );
\r
298 /* Convert execution token to absolute address. */
\r
299 InsPtr = (cell *) ( LOCAL_CODEREL_TO_ABS(Token) );
\r
301 /* Fetch token at IP. */
\r
302 Token = READ_LONG_DIC(InsPtr++);
\r
304 #ifdef PF_SUPPORT_TRACE
\r
305 /* Bump level for trace display */
\r
311 #ifdef PF_SUPPORT_TRACE
\r
315 /* Execute primitive Token. */
\r
319 /* Pop up a level in Forth inner interpreter.
\r
320 ** Used to implement semicolon.
\r
321 ** Put first in switch because ID_EXIT==0 */
\r
323 InsPtr = ( cell *) M_R_POP;
\r
324 #ifdef PF_SUPPORT_TRACE
\r
329 case ID_1MINUS: TOS--; endcase;
\r
331 case ID_1PLUS: TOS++; endcase;
\r
333 #ifndef PF_NO_SHELL
\r
335 ff2Literal( TOS, M_POP );
\r
338 #endif /* !PF_NO_SHELL */
\r
340 case ID_2LITERAL_P:
\r
341 /* hi part stored first, put on top of stack */
\r
343 TOS = READ_LONG_DIC(InsPtr++);
\r
344 M_PUSH(READ_LONG_DIC(InsPtr++));
\r
347 case ID_2MINUS: TOS -= 2; endcase;
\r
349 case ID_2PLUS: TOS += 2; endcase;
\r
352 case ID_2OVER: /* ( a b c d -- a b c d a b ) */
\r
354 Scratch = M_STACK(3);
\r
359 case ID_2SWAP: /* ( a b c d -- c d a b ) */
\r
360 Scratch = M_STACK(0); /* c */
\r
361 M_STACK(0) = M_STACK(2); /* a */
\r
362 M_STACK(2) = Scratch; /* c */
\r
363 Scratch = TOS; /* d */
\r
364 TOS = M_STACK(1); /* b */
\r
365 M_STACK(1) = Scratch; /* d */
\r
368 case ID_2DUP: /* ( a b -- a b a b ) */
\r
370 Scratch = M_STACK(1);
\r
376 M_PUSH( (*(TORPTR+1)) );
\r
392 case ID_ACCEPT_P: /* ( c-addr +n1 -- +n2 ) */
\r
393 CharPtr = (char *) M_POP;
\r
394 TOS = ioAccept( CharPtr, TOS );
\r
397 #ifndef PF_NO_SHELL
\r
399 ffALiteral( ABS_TO_CODEREL(TOS) );
\r
402 #endif /* !PF_NO_SHELL */
\r
404 case ID_ALITERAL_P:
\r
406 TOS = (cell) LOCAL_CODEREL_TO_ABS( READ_LONG_DIC(InsPtr++) );
\r
409 /* Allocate some extra and put validation identifier at base */
\r
410 #define PF_MEMORY_VALIDATOR (0xA81B4D69)
\r
412 /* Allocate at least one cell's worth because we clobber first cell. */
\r
413 if ( TOS < sizeof(cell) )
\r
415 Temp = sizeof(cell);
\r
421 /* Allocate extra cells worth because we store validation info. */
\r
422 CellPtr = (cell *) pfAllocMem( Temp + sizeof(cell) );
\r
425 /* This was broken into two steps because different compilers incremented
\r
426 ** CellPtr before or after the XOR step. */
\r
427 Temp = (int32)CellPtr ^ PF_MEMORY_VALIDATOR;
\r
429 M_PUSH( (cell) CellPtr );
\r
435 TOS = -1; /* FIXME Fix error code. */
\r
439 case ID_AND: BINARY_OP( & ); endcase;
\r
441 case ID_ARSHIFT: BINARY_OP( >> ); endcase; /* Arithmetic right shift */
\r
443 case ID_BODY_OFFSET:
\r
445 TOS = CREATE_BODY_OFFSET;
\r
448 /* Branch is followed by an offset relative to address of offset. */
\r
450 DBUGX(("Before Branch: IP = 0x%x\n", InsPtr ));
\r
452 DBUGX(("After Branch: IP = 0x%x\n", InsPtr ));
\r
456 M_THROW( THROW_BYE );
\r
460 MSG("Emergency exit.\n");
\r
468 Scratch = pfCatch( Scratch );
\r
476 Scratch = READ_LONG_DIC(InsPtr++);
\r
477 CallUserFunction( Scratch & 0xFFFF,
\r
478 (Scratch >> 31) & 1,
\r
479 (Scratch >> 24) & 0x7F );
\r
483 case ID_CFETCH: TOS = *((uint8 *) TOS); endcase;
\r
485 case ID_CMOVE: /* ( src dst n -- ) */
\r
487 register char *DstPtr = (char *) M_POP; /* dst */
\r
488 CharPtr = (char *) M_POP; /* src */
\r
489 for( Scratch=0; (uint32) Scratch < (uint32) TOS ; Scratch++ )
\r
491 *DstPtr++ = *CharPtr++;
\r
497 case ID_CMOVE_UP: /* ( src dst n -- ) */
\r
499 register char *DstPtr = ((char *) M_POP) + TOS; /* dst */
\r
500 CharPtr = ((char *) M_POP) + TOS;; /* src */
\r
501 for( Scratch=0; (uint32) Scratch < (uint32) TOS ; Scratch++ )
\r
503 *(--DstPtr) = *(--CharPtr);
\r
509 #ifndef PF_NO_SHELL
\r
515 case ID_COLON_P: /* ( $name xt -- ) */
\r
516 CreateDicEntry( TOS, (char *) M_POP, 0 );
\r
519 #endif /* !PF_NO_SHELL */
\r
523 const char *s1, *s2;
\r
525 s2 = (const char *) M_POP;
\r
527 s1 = (const char *) M_POP;
\r
528 TOS = ffCompare( s1, len1, s2, TOS );
\r
532 /* ( a b -- flag , Comparisons ) */
\r
533 case ID_COMP_EQUAL:
\r
534 TOS = ( TOS == M_POP ) ? FTRUE : FFALSE ;
\r
536 case ID_COMP_NOT_EQUAL:
\r
537 TOS = ( TOS != M_POP ) ? FTRUE : FFALSE ;
\r
539 case ID_COMP_GREATERTHAN:
\r
540 TOS = ( M_POP > TOS ) ? FTRUE : FFALSE ;
\r
542 case ID_COMP_LESSTHAN:
\r
543 TOS = ( M_POP < TOS ) ? FTRUE : FFALSE ;
\r
545 case ID_COMP_U_GREATERTHAN:
\r
546 TOS = ( ((uint32)M_POP) > ((uint32)TOS) ) ? FTRUE : FFALSE ;
\r
548 case ID_COMP_U_LESSTHAN:
\r
549 TOS = ( ((uint32)M_POP) < ((uint32)TOS) ) ? FTRUE : FFALSE ;
\r
551 case ID_COMP_ZERO_EQUAL:
\r
552 TOS = ( TOS == 0 ) ? FTRUE : FFALSE ;
\r
554 case ID_COMP_ZERO_NOT_EQUAL:
\r
555 TOS = ( TOS != 0 ) ? FTRUE : FALSE ;
\r
557 case ID_COMP_ZERO_GREATERTHAN:
\r
558 TOS = ( TOS > 0 ) ? FTRUE : FFALSE ;
\r
560 case ID_COMP_ZERO_LESSTHAN:
\r
561 TOS = ( TOS < 0 ) ? FTRUE : FFALSE ;
\r
568 #ifndef PF_NO_SHELL
\r
574 #endif /* !PF_NO_SHELL */
\r
578 /* Put address of body on stack. Insptr points after code start. */
\r
579 TOS = (cell) ((char *)InsPtr - sizeof(cell) + CREATE_BODY_OFFSET );
\r
582 case ID_CSTORE: /* ( c caddr -- ) */
\r
583 *((uint8 *) TOS) = (uint8) M_POP;
\r
587 /* Double precision add. */
\r
588 case ID_D_PLUS: /* D+ ( al ah bl bh -- sl sh ) */
\r
590 register ucell ah,al,bl,sh,sl;
\r
597 if( sl < bl ) sh = 1; /* Carry */
\r
605 /* Double precision subtract. */
\r
606 case ID_D_MINUS: /* D- ( al ah bl bh -- sl sh ) */
\r
608 register ucell ah,al,bl,sh,sl;
\r
615 if( al < bl ) sh = 1; /* Borrow */
\r
623 /* Perform 32*32 bit multiply for 64 bit result, by factoring into 16 bit quantities. */
\r
624 /* Using an improved algorithm suggested by Steve Green. */
\r
625 case ID_D_UMTIMES: /* M* ( a b -- pl ph ) */
\r
627 ucell ahi, alo, bhi, blo, temp;
\r
629 /* Get values from stack. */
\r
632 /* Break into hi and lo 16 bit parts. */
\r
633 alo = ahi & 0xFFFF;
\r
635 blo = bhi & 0xFFFF;
\r
640 ph = pl >> 16; /* shift 64 bit value by 16 */
\r
645 if( pl < temp ) ph += 1; /* Carry */
\r
649 if( pl < temp ) ph += 1; /* Carry */
\r
650 ph = (ph << 16) | (pl >> 16); /* shift 64 bit value by 16 */
\r
655 if( pl < temp ) ph += 1; /* Carry */
\r
662 /* Perform 32*32 bit multiply for 64 bit result, using shift and add. */
\r
663 case ID_D_MTIMES: /* M* ( a b -- pl ph ) */
\r
666 ucell ap,bp, ahi, alo, bhi, blo, temp;
\r
668 /* Get values from stack. */
\r
671 ap = (a < 0) ? -a : a ; /* Positive A */
\r
672 bp = (b < 0) ? -b : b ; /* Positive B */
\r
673 /* Break into hi and lo 16 bit parts. */
\r
681 ph = pl >> 16; /* shift 64 bit value by 16 */
\r
686 if( pl < temp ) ph += 1; /* Carry */
\r
690 if( pl < temp ) ph += 1; /* Carry */
\r
691 ph = (ph << 16) | (pl >> 16); /* shift 64 bit value by 16 */
\r
696 if( pl < temp ) ph += 1; /* Carry */
\r
698 /* Negate product if one operand negative. */
\r
699 if( ((a ^ b) & 0x80000000) )
\r
702 if( pl & 0x80000000 )
\r
704 ph = -1 - ph; /* Borrow */
\r
717 #define DULT(du1l,du1h,du2l,du2h) ( (du2h<du1h) ? FALSE : ( (du2h==du1h) ? (du1l<du2l) : TRUE) )
\r
718 /* Perform 64/32 bit divide for 32 bit result, using shift and subtract. */
\r
719 case ID_D_UMSMOD: /* UM/MOD ( al ah bdiv -- rem q ) */
\r
721 ucell ah,al, q,di, bl,bh, sl,sh;
\r
727 for( di=0; di<32; di++ )
\r
729 if( !DULT(al,ah,bl,bh) )
\r
733 if( al < bl ) sh = 1; /* Borrow */
\r
740 bl = (bl >> 1) | (bh << 31);
\r
743 if( !DULT(al,ah,bl,bh) )
\r
749 M_PUSH( al ); /* rem */
\r
754 /* Perform 64/32 bit divide for 64 bit result, using shift and subtract. */
\r
755 case ID_D_MUSMOD: /* MU/MOD ( al am bdiv -- rem ql qh ) */
\r
757 register ucell ah,am,al,ql,qh,di;
\r
758 #define bdiv ((ucell)TOS)
\r
763 for( di=0; di<64; di++ )
\r
770 qh = (qh << 1) | (ql >> 31);
\r
772 ah = (ah << 1) | (am >> 31);
\r
773 am = (am << 1) | (al >> 31);
\r
775 DBUG(("XX ah,m,l = 0x%8x,%8x,%8x - qh,l = 0x%8x,%8x\n", ah,am,al, qh,ql ));
\r
782 M_PUSH( ah ); /* rem */
\r
789 #ifndef PF_NO_SHELL
\r
793 #endif /* !PF_NO_SHELL */
\r
800 TOS = gCurrentTask->td_StackBase - STKPTR;
\r
803 case ID_DIVIDE: BINARY_OP( / ); endcase;
\r
814 case ID_DROP: M_DROP; endcase;
\r
818 DumpMemory( (char *) Scratch, TOS );
\r
822 case ID_DUP: M_DUP; endcase;
\r
824 case ID_DO_P: /* ( limit start -- ) ( R: -- start limit ) */
\r
830 case ID_EOL: /* ( -- end_of_line_char ) */
\r
835 case ID_ERRORQ_P: /* ( flag num -- , quit if flag true ) */
\r
849 EMIT( (char) TOS );
\r
854 /* Save IP on return stack like a JSR. */
\r
855 M_R_PUSH( InsPtr );
\r
856 #ifdef PF_SUPPORT_TRACE
\r
857 /* Bump level for trace. */
\r
860 if( IsTokenPrimitive( TOS ) )
\r
862 WRITE_LONG_DIC( (cell *) &FakeSecondary[0], TOS); /* Build a fake secondary and execute it. */
\r
863 InsPtr = &FakeSecondary[0];
\r
867 InsPtr = (cell *) LOCAL_CODEREL_TO_ABS(TOS);
\r
873 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
\r
874 if( IN_DICS( TOS ) )
\r
876 TOS = (cell) READ_LONG_DIC((cell *)TOS);
\r
880 TOS = *((cell *)TOS);
\r
883 TOS = *((cell *)TOS);
\r
887 case ID_FILE_CREATE: /* ( c-addr u fam -- fid ior ) */
\r
888 /* Build NUL terminated name string. */
\r
889 Scratch = M_POP; /* u */
\r
890 Temp = M_POP; /* caddr */
\r
891 if( Scratch < TIB_SIZE-2 )
\r
893 const char *famText = pfSelectFileMode( TOS );
\r
894 pfCopyMemory( gScratch, (char *) Temp, (uint32) Scratch );
\r
895 gScratch[Scratch] = '\0';
\r
896 DBUG(("Create file = %s\n", gScratch ));
\r
897 FileID = sdOpenFile( gScratch, famText );
\r
898 TOS = ( FileID == NULL ) ? -1 : 0 ;
\r
899 M_PUSH( (cell) FileID );
\r
903 ERR("Filename too large for name buffer.\n");
\r
909 case ID_FILE_OPEN: /* ( c-addr u fam -- fid ior ) */
\r
910 /* Build NUL terminated name string. */
\r
911 Scratch = M_POP; /* u */
\r
912 Temp = M_POP; /* caddr */
\r
913 if( Scratch < TIB_SIZE-2 )
\r
915 const char *famText = pfSelectFileMode( TOS );
\r
916 pfCopyMemory( gScratch, (char *) Temp, (uint32) Scratch );
\r
917 gScratch[Scratch] = '\0';
\r
918 DBUG(("Open file = %s\n", gScratch ));
\r
919 FileID = sdOpenFile( gScratch, famText );
\r
921 TOS = ( FileID == NULL ) ? -1 : 0 ;
\r
922 M_PUSH( (cell) FileID );
\r
926 ERR("Filename too large for name buffer.\n");
\r
932 case ID_FILE_CLOSE: /* ( fid -- ior ) */
\r
933 TOS = sdCloseFile( (FileStream *) TOS );
\r
936 case ID_FILE_READ: /* ( addr len fid -- u2 ior ) */
\r
937 FileID = (FileStream *) TOS;
\r
939 CharPtr = (char *) M_POP;
\r
940 Temp = sdReadFile( CharPtr, 1, Scratch, FileID );
\r
945 case ID_FILE_SIZE: /* ( fid -- ud ior ) */
\r
946 /* Determine file size by seeking to end and returning position. */
\r
947 FileID = (FileStream *) TOS;
\r
948 Scratch = sdTellFile( FileID );
\r
949 sdSeekFile( FileID, 0, PF_SEEK_END );
\r
950 M_PUSH( sdTellFile( FileID ));
\r
951 sdSeekFile( FileID, Scratch, PF_SEEK_SET );
\r
952 TOS = (Scratch < 0) ? -4 : 0 ; /* !!! err num */
\r
955 case ID_FILE_WRITE: /* ( addr len fid -- ior ) */
\r
956 FileID = (FileStream *) TOS;
\r
958 CharPtr = (char *) M_POP;
\r
959 Temp = sdWriteFile( CharPtr, 1, Scratch, FileID );
\r
960 TOS = (Temp != Scratch) ? -3 : 0;
\r
963 case ID_FILE_REPOSITION: /* ( pos fid -- ior ) */
\r
964 FileID = (FileStream *) TOS;
\r
966 TOS = sdSeekFile( FileID, Scratch, PF_SEEK_SET );
\r
969 case ID_FILE_POSITION: /* ( pos fid -- ior ) */
\r
970 M_PUSH( sdTellFile( (FileStream *) TOS ));
\r
974 case ID_FILE_RO: /* ( -- fam ) */
\r
976 TOS = PF_FAM_READ_ONLY;
\r
979 case ID_FILE_RW: /* ( -- fam ) */
\r
981 TOS = PF_FAM_READ_WRITE;
\r
984 case ID_FILE_WO: /* ( -- fam ) */
\r
986 TOS = PF_FAM_WRITE_ONLY;
\r
989 case ID_FILE_BIN: /* ( -- fam ) */
\r
990 TOS = TOS | PF_FAM_BINARY_FLAG;
\r
993 case ID_FILL: /* ( caddr num charval -- ) */
\r
995 register char *DstPtr;
\r
996 Temp = M_POP; /* num */
\r
997 DstPtr = (char *) M_POP; /* dst */
\r
998 for( Scratch=0; (uint32) Scratch < (uint32) Temp ; Scratch++ )
\r
1000 *DstPtr++ = (char) TOS;
\r
1006 #ifndef PF_NO_SHELL
\r
1007 case ID_FIND: /* ( $addr -- $addr 0 | xt +-1 ) */
\r
1008 TOS = ffFind( (char *) TOS, (ExecToken *) &Temp );
\r
1013 TOS = ffFindNFA( (const ForthString *) TOS, (const ForthString **) &Temp );
\r
1014 M_PUSH( (cell) Temp );
\r
1016 #endif /* !PF_NO_SHELL */
\r
1018 case ID_FLUSHEMIT:
\r
1019 sdTerminalFlush();
\r
1022 /* Validate memory before freeing. Clobber validator and first word. */
\r
1023 case ID_FREE: /* ( addr -- result ) */
\r
1026 ERR("FREE passed NULL!\n");
\r
1027 TOS = -2; /* FIXME error code */
\r
1031 CellPtr = (cell *) TOS;
\r
1033 if( ((uint32)*CellPtr) != ((uint32)CellPtr ^ PF_MEMORY_VALIDATOR))
\r
1035 TOS = -2; /* FIXME error code */
\r
1039 CellPtr[0] = 0xDeadBeef;
\r
1040 pfFreeMem((char *)CellPtr);
\r
1046 #include "pfinnrfp.h"
\r
1050 TOS = (cell)CODE_HERE;
\r
1053 case ID_NUMBERQ_P: /* ( addr -- 0 | n 1 ) */
\r
1054 /* Convert using number converter in 'C'.
\r
1055 ** Only supports single precision for bootstrap.
\r
1057 TOS = (cell) ffNumberQ( (char *) TOS, &Temp );
\r
1058 if( TOS == NUM_TYPE_SINGLE)
\r
1060 M_PUSH( Temp ); /* Push single number */
\r
1064 case ID_I: /* ( -- i , DO LOOP index ) */
\r
1066 TOS = M_R_PICK(1);
\r
1069 #ifndef PF_NO_SHELL
\r
1070 case ID_INCLUDE_FILE:
\r
1071 FileID = (FileStream *) TOS;
\r
1072 M_DROP; /* Drop now so that INCLUDE has a clean stack. */
\r
1074 Scratch = ffIncludeFile( FileID );
\r
1076 if( Scratch ) M_THROW(Scratch)
\r
1078 #endif /* !PF_NO_SHELL */
\r
1080 #ifndef PF_NO_SHELL
\r
1081 case ID_INTERPRET:
\r
1083 Scratch = ffInterpret();
\r
1085 if( Scratch ) M_THROW(Scratch)
\r
1087 #endif /* !PF_NO_SHELL */
\r
1089 case ID_J: /* ( -- j , second DO LOOP index ) */
\r
1091 TOS = M_R_PICK(3);
\r
1099 #ifndef PF_NO_SHELL
\r
1104 #endif /* !PF_NO_SHELL */
\r
1106 case ID_LITERAL_P:
\r
1107 DBUG(("ID_LITERAL_P: InsPtr = 0x%x, *InsPtr = 0x%x\n", InsPtr, *InsPtr ));
\r
1109 TOS = READ_LONG_DIC(InsPtr++);
\r
1112 #ifndef PF_NO_SHELL
\r
1113 case ID_LOCAL_COMPILER: DO_VAR(gLocalCompiler_XT); endcase;
\r
1114 #endif /* !PF_NO_SHELL */
\r
1116 case ID_LOCAL_FETCH: /* ( i <local> -- n , fetch from local ) */
\r
1117 TOS = *(LocalsPtr - TOS);
\r
1120 #define LOCAL_FETCH_N(num) \
\r
1121 case ID_LOCAL_FETCH_##num: /* ( <local> -- n , fetch from local ) */ \
\r
1123 TOS = *(LocalsPtr -(num)); \
\r
1135 case ID_LOCAL_STORE: /* ( n i <local> -- , store n in local ) */
\r
1136 *(LocalsPtr - TOS) = M_POP;
\r
1140 #define LOCAL_STORE_N(num) \
\r
1141 case ID_LOCAL_STORE_##num: /* ( n <local> -- , store n in local ) */ \
\r
1142 *(LocalsPtr - (num)) = TOS; \
\r
1155 case ID_LOCAL_PLUSSTORE: /* ( n i <local> -- , add n to local ) */
\r
1156 *(LocalsPtr - TOS) += M_POP;
\r
1160 case ID_LOCAL_ENTRY: /* ( x0 x1 ... xn n -- ) */
\r
1161 /* create local stack frame */
\r
1165 DBUG(("LocalEntry: n = %d\n", TOS));
\r
1166 /* End of locals. Create stack frame */
\r
1167 DBUG(("LocalEntry: before RP@ = 0x%x, LP = 0x%x\n",
\r
1168 TORPTR, LocalsPtr));
\r
1169 M_R_PUSH(LocalsPtr);
\r
1170 LocalsPtr = TORPTR;
\r
1172 DBUG(("LocalEntry: after RP@ = 0x%x, LP = 0x%x\n",
\r
1173 TORPTR, LocalsPtr));
\r
1177 *lp++ = M_POP; /* Load local vars from stack */
\r
1183 case ID_LOCAL_EXIT: /* cleanup up local stack frame */
\r
1184 DBUG(("LocalExit: before RP@ = 0x%x, LP = 0x%x\n",
\r
1185 TORPTR, LocalsPtr));
\r
1186 TORPTR = LocalsPtr;
\r
1187 LocalsPtr = (cell *) M_R_POP;
\r
1188 DBUG(("LocalExit: after RP@ = 0x%x, LP = 0x%x\n",
\r
1189 TORPTR, LocalsPtr));
\r
1192 #ifndef PF_NO_SHELL
\r
1194 MSG("Load "); MSG(SYSTEM_LOAD_FILE); EMIT_CR;
\r
1195 FileID = sdOpenFile(SYSTEM_LOAD_FILE, "r");
\r
1199 Scratch = ffIncludeFile( FileID );
\r
1201 sdCloseFile( FileID );
\r
1202 if( Scratch ) M_THROW(Scratch);
\r
1206 ERR(SYSTEM_LOAD_FILE); ERR(" could not be opened!\n");
\r
1209 #endif /* !PF_NO_SHELL */
\r
1211 case ID_LEAVE_P: /* ( R: index limit -- ) */
\r
1217 case ID_LOOP_P: /* ( R: index limit -- | index limit ) */
\r
1218 Temp = M_R_POP; /* limit */
\r
1219 Scratch = M_R_POP + 1; /* index */
\r
1220 if( Scratch == Temp )
\r
1222 InsPtr++; /* skip branch offset, exit loop */
\r
1226 /* Push index and limit back to R */
\r
1227 M_R_PUSH( Scratch );
\r
1229 /* Branch back to just after (DO) */
\r
1234 case ID_LSHIFT: BINARY_OP( << ); endcase;
\r
1238 TOS = ( TOS > Scratch ) ? TOS : Scratch ;
\r
1243 TOS = ( TOS < Scratch ) ? TOS : Scratch ;
\r
1246 case ID_MINUS: BINARY_OP( - ); endcase;
\r
1248 #ifndef PF_NO_SHELL
\r
1249 case ID_NAME_TO_TOKEN:
\r
1250 TOS = (cell) NameToToken((ForthString *)TOS);
\r
1253 case ID_NAME_TO_PREVIOUS:
\r
1254 TOS = (cell) NameToPrevious((ForthString *)TOS);
\r
1261 case ID_OR: BINARY_OP( | ); endcase;
\r
1268 case ID_PICK: /* ( ... n -- sp(n) ) */
\r
1269 TOS = M_STACK(TOS);
\r
1272 case ID_PLUS: BINARY_OP( + ); endcase;
\r
1274 case ID_PLUS_STORE: /* ( n addr -- , add n to *addr ) */
\r
1275 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
\r
1276 if( IN_DICS( TOS ) )
\r
1278 Scratch = READ_LONG_DIC((cell *)TOS);
\r
1280 WRITE_LONG_DIC((cell *)TOS,Scratch);
\r
1284 *((cell *)TOS) += M_POP;
\r
1287 *((cell *)TOS) += M_POP;
\r
1292 case ID_PLUSLOOP_P: /* ( delta -- ) ( R: index limit -- | index limit ) */
\r
1294 ucell OldIndex, NewIndex, Limit;
\r
1297 OldIndex = M_R_POP;
\r
1298 NewIndex = OldIndex + TOS; /* add TOS to index, not 1 */
\r
1299 /* Do indices cross boundary between LIMIT-1 and LIMIT ? */
\r
1300 if( ( (OldIndex - Limit) & ((Limit-1) - NewIndex) & 0x80000000 ) ||
\r
1301 ( (NewIndex - Limit) & ((Limit-1) - OldIndex) & 0x80000000 ) )
\r
1303 InsPtr++; /* skip branch offset, exit loop */
\r
1307 /* Push index and limit back to R */
\r
1308 M_R_PUSH( NewIndex );
\r
1309 M_R_PUSH( Limit );
\r
1310 /* Branch back to just after (DO) */
\r
1317 case ID_QDO_P: /* (?DO) ( limit start -- ) ( R: -- start limit ) */
\r
1318 Scratch = M_POP; /* limit */
\r
1319 if( Scratch == TOS )
\r
1321 /* Branch to just after (LOOP) */
\r
1327 M_R_PUSH( Scratch );
\r
1328 InsPtr++; /* skip branch offset, enter loop */
\r
1333 case ID_QDUP: if( TOS ) M_DUP; endcase;
\r
1335 case ID_QTERMINAL: /* WARNING: Typically not fully implemented! */
\r
1337 TOS = sdQueryTerminal();
\r
1340 case ID_QUIT_P: /* Stop inner interpreter, go back to user. */
\r
1341 #ifdef PF_SUPPORT_TRACE
\r
1344 M_THROW(THROW_QUIT);
\r
1353 TOS = (*(TORPTR));
\r
1363 TOS = (ffRefill() > 0) ? FTRUE : FFALSE;
\r
1366 /* Resize memory allocated by ALLOCATE. */
\r
1367 case ID_RESIZE: /* ( addr1 u -- addr2 result ) */
\r
1371 FreePtr = (cell *) ( M_POP - sizeof(cell) );
\r
1372 if( ((uint32)*FreePtr) != ((uint32)FreePtr ^ PF_MEMORY_VALIDATOR))
\r
1379 /* Try to allocate. */
\r
1380 CellPtr = (cell *) pfAllocMem( TOS + sizeof(cell) );
\r
1383 /* Copy memory including validation. */
\r
1384 pfCopyMemory( (char *) CellPtr, (char *) FreePtr, TOS + sizeof(cell) );
\r
1385 *CellPtr = (cell)(((uint32)CellPtr) ^ (uint32)PF_MEMORY_VALIDATOR);
\r
1387 M_PUSH( (cell) ++CellPtr );
\r
1389 FreePtr[0] = 0xDeadBeef;
\r
1390 pfFreeMem((char *) FreePtr);
\r
1395 TOS = -4; /* FIXME Fix error code. */
\r
1402 ** RP@ and RP! are called secondaries so we must
\r
1403 ** account for the return address pushed before calling.
\r
1405 case ID_RP_FETCH: /* ( -- rp , address of top of return stack ) */
\r
1407 TOS = (cell)TORPTR; /* value before calling RP@ */
\r
1410 case ID_RP_STORE: /* ( rp -- , address of top of return stack ) */
\r
1411 TORPTR = (cell *) TOS;
\r
1415 case ID_ROLL: /* ( xu xu-1 xu-1 ... x0 u -- xu-1 xu-1 ... x0 xu ) */
\r
1418 cell *srcPtr, *dstPtr;
\r
1419 Scratch = M_STACK(TOS);
\r
1420 srcPtr = &M_STACK(TOS-1);
\r
1421 dstPtr = &M_STACK(TOS);
\r
1422 for( ri=0; ri<TOS; ri++ )
\r
1424 *dstPtr-- = *srcPtr--;
\r
1431 case ID_ROT: /* ( a b c -- b c a ) */
\r
1432 Scratch = M_POP; /* b */
\r
1433 Temp = M_POP; /* a */
\r
1434 M_PUSH( Scratch ); /* b */
\r
1436 TOS = Temp; /* a */
\r
1439 /* Logical right shift */
\r
1440 case ID_RSHIFT: { TOS = ((uint32)M_POP) >> TOS; } endcase;
\r
1442 #ifndef PF_NO_SHELL
\r
1443 case ID_SAVE_FORTH_P: /* ( $name Entry NameSize CodeSize -- err ) */
\r
1445 int32 NameSize, CodeSize, EntryPoint;
\r
1448 EntryPoint = M_POP;
\r
1449 ForthStringToC( gScratch, (char *) M_POP );
\r
1450 TOS = ffSaveForth( gScratch, EntryPoint, NameSize, CodeSize );
\r
1456 ** EVALUATE >IN SourceID=(-1) 1111
\r
1457 ** keyboard >IN SourceID=(0) 2222
\r
1458 ** file >IN lineNumber filePos SourceID=(fileID)
\r
1460 case ID_SAVE_INPUT: /* FIXME - finish */
\r
1465 case ID_SP_FETCH: /* ( -- sp , address of top of stack, sorta ) */
\r
1467 TOS = (cell)STKPTR;
\r
1470 case ID_SP_STORE: /* ( sp -- , address of top of stack, sorta ) */
\r
1471 STKPTR = (cell *) TOS;
\r
1475 case ID_STORE: /* ( n addr -- , write n to addr ) */
\r
1476 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
\r
1477 if( IN_DICS( TOS ) )
\r
1479 WRITE_LONG_DIC((cell *)TOS,M_POP);
\r
1483 *((cell *)TOS) = M_POP;
\r
1486 *((cell *)TOS) = M_POP;
\r
1491 case ID_SCAN: /* ( addr cnt char -- addr' cnt' ) */
\r
1492 Scratch = M_POP; /* cnt */
\r
1493 Temp = M_POP; /* addr */
\r
1494 TOS = ffScan( (char *) Temp, Scratch, (char) TOS, &CharPtr );
\r
1495 M_PUSH((cell) CharPtr);
\r
1498 #ifndef PF_NO_SHELL
\r
1499 case ID_SEMICOLON:
\r
1501 Scratch = ffSemiColon();
\r
1503 if( Scratch ) M_THROW( Scratch );
\r
1505 #endif /* !PF_NO_SHELL */
\r
1507 case ID_SKIP: /* ( addr cnt char -- addr' cnt' ) */
\r
1508 Scratch = M_POP; /* cnt */
\r
1509 Temp = M_POP; /* addr */
\r
1510 TOS = ffSkip( (char *) Temp, Scratch, (char) TOS, &CharPtr );
\r
1511 M_PUSH((cell) CharPtr);
\r
1514 case ID_SOURCE: /* ( -- c-addr num ) */
\r
1516 M_PUSH( (cell) gCurrentTask->td_SourcePtr );
\r
1517 TOS = (cell) gCurrentTask->td_SourceNum;
\r
1520 case ID_SOURCE_SET: /* ( c-addr num -- ) */
\r
1521 gCurrentTask->td_SourcePtr = (char *) M_POP;
\r
1522 gCurrentTask->td_SourceNum = TOS;
\r
1526 case ID_SOURCE_ID:
\r
1528 TOS = ffConvertStreamToSourceID( gCurrentTask->td_InputStream ) ;
\r
1531 case ID_SOURCE_ID_POP:
\r
1533 TOS = ffConvertStreamToSourceID( ffPopInputStream() ) ;
\r
1536 case ID_SOURCE_ID_PUSH: /* ( source-id -- ) */
\r
1537 TOS = (cell)ffConvertSourceIDToStream( TOS );
\r
1538 Scratch = ffPushInputStream((FileStream *) TOS );
\r
1549 *STKPTR = Scratch;
\r
1562 case ID_THROW: /* ( k*x err -- k*x | i*x err , jump to where CATCH was called ) */
\r
1570 #ifndef PF_NO_SHELL
\r
1573 CharPtr = (char *) ffWord( (char) ' ' );
\r
1574 TOS = ffFind( CharPtr, (ExecToken *) &Temp );
\r
1577 ERR("' could not find ");
\r
1578 ioType( (char *) CharPtr+1, *CharPtr );
\r
1586 #endif /* !PF_NO_SHELL */
\r
1588 case ID_TIMES: BINARY_OP( * ); endcase;
\r
1591 Scratch = M_POP; /* addr */
\r
1592 ioType( (char *) Scratch, TOS );
\r
1601 case ID_VAR_BASE: DO_VAR(gVarBase); endcase;
\r
1602 case ID_VAR_CODE_BASE: DO_VAR(gCurrentDictionary->dic_CodeBase); endcase;
\r
1603 case ID_VAR_CODE_LIMIT: DO_VAR(gCurrentDictionary->dic_CodeLimit); endcase;
\r
1604 case ID_VAR_CONTEXT: DO_VAR(gVarContext); endcase;
\r
1605 case ID_VAR_DP: DO_VAR(gCurrentDictionary->dic_CodePtr.Cell); endcase;
\r
1606 case ID_VAR_ECHO: DO_VAR(gVarEcho); endcase;
\r
1607 case ID_VAR_HEADERS_BASE: DO_VAR(gCurrentDictionary->dic_HeaderBase); endcase;
\r
1608 case ID_VAR_HEADERS_LIMIT: DO_VAR(gCurrentDictionary->dic_HeaderLimit); endcase;
\r
1609 case ID_VAR_HEADERS_PTR: DO_VAR(gCurrentDictionary->dic_HeaderPtr.Cell); endcase;
\r
1610 case ID_VAR_NUM_TIB: DO_VAR(gCurrentTask->td_SourceNum); endcase;
\r
1611 case ID_VAR_OUT: DO_VAR(gCurrentTask->td_OUT); endcase;
\r
1612 case ID_VAR_STATE: DO_VAR(gVarState); endcase;
\r
1613 case ID_VAR_TO_IN: DO_VAR(gCurrentTask->td_IN); endcase;
\r
1614 case ID_VAR_TRACE_FLAGS: DO_VAR(gVarTraceFlags); endcase;
\r
1615 case ID_VAR_TRACE_LEVEL: DO_VAR(gVarTraceLevel); endcase;
\r
1616 case ID_VAR_TRACE_STACK: DO_VAR(gVarTraceStack); endcase;
\r
1617 case ID_VAR_RETURN_CODE: DO_VAR(gVarReturnCode); endcase;
\r
1620 TOS = (cell) ffWord( (char) TOS );
\r
1623 case ID_WORD_FETCH: /* ( waddr -- w ) */
\r
1624 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
\r
1625 if( IN_DICS( TOS ) )
\r
1627 TOS = (uint16) READ_SHORT_DIC((uint16 *)TOS);
\r
1631 TOS = *((uint16 *)TOS);
\r
1634 TOS = *((uint16 *)TOS);
\r
1638 case ID_WORD_STORE: /* ( w waddr -- ) */
\r
1640 #if (defined(PF_BIG_ENDIAN_DIC) || defined(PF_LITTLE_ENDIAN_DIC))
\r
1641 if( IN_DICS( TOS ) )
\r
1643 WRITE_SHORT_DIC((uint16 *)TOS,(uint16)M_POP);
\r
1647 *((uint16 *)TOS) = (uint16) M_POP;
\r
1650 *((uint16 *)TOS) = (uint16) M_POP;
\r
1655 case ID_XOR: BINARY_OP( ^ ); endcase;
\r
1658 /* Branch is followed by an offset relative to address of offset. */
\r
1659 case ID_ZERO_BRANCH:
\r
1660 DBUGX(("Before 0Branch: IP = 0x%x\n", InsPtr ));
\r
1667 InsPtr++; /* skip over offset */
\r
1670 DBUGX(("After 0Branch: IP = 0x%x\n", InsPtr ));
\r
1674 ERR("pfCatch: Unrecognised token = 0x");
\r
1677 ffDotHex((int32) InsPtr);
\r
1683 if(InsPtr) Token = READ_LONG_DIC(InsPtr++); /* Traverse to next token in secondary. */
\r
1690 if( _CrtCheckMemory() == 0 )
\r
1692 ERR("_CrtCheckMemory abort: InsPtr = 0x");
\r
1693 ffDotHex((int)InsPtr);
\r
1698 } while( (InitialReturnStack - TORPTR) > 0 );
\r
1702 return ExceptionReturnCode;
\r