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