1 /*******************************************************************
3 ** Forth Inspired Command Language - programming tools
4 ** Author: John Sadler (john_sadler@alum.mit.edu)
5 ** Created: 20 June 2000
6 ** $Id: tools.c,v 1.11 2001/12/05 07:21:34 jsadler Exp $
7 *******************************************************************/
9 ** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
10 ** All rights reserved.
12 ** Get the latest Ficl release at http://ficl.sourceforge.net
14 ** I am interested in hearing from anyone who uses ficl. If you have
15 ** a problem, a success story, a defect, an enhancement request, or
16 ** if you would like to contribute to the ficl release, please
17 ** contact me by email at the address above.
19 ** L I C E N S E and D I S C L A I M E R
21 ** Redistribution and use in source and binary forms, with or without
22 ** modification, are permitted provided that the following conditions
24 ** 1. Redistributions of source code must retain the above copyright
25 ** notice, this list of conditions and the following disclaimer.
26 ** 2. Redistributions in binary form must reproduce the above copyright
27 ** notice, this list of conditions and the following disclaimer in the
28 ** documentation and/or other materials provided with the distribution.
30 ** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
31 ** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32 ** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 ** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
34 ** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35 ** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36 ** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37 ** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38 ** LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39 ** OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
45 ** SEE needs information about the addresses of functions that
46 ** are the CFAs of colon definitions, constants, variables, DOES>
47 ** words, and so on. It gets this information from a table and supporting
48 ** functions in words.c.
49 ** colonParen doDoes createParen variableParen userParen constantParen
51 ** Step and break debugger for Ficl
52 ** debug ( xt -- ) Start debugging an xt
54 ** Specify breakpoint default action
61 #include <stdio.h> /* sprintf */
72 ** nBREAKPOINTS sizes the breakpoint array. One breakpoint (bp 0) is reserved
73 ** for the STEP command. The rest are user programmable.
75 #define nBREAKPOINTS 32
80 /**************************************************************************
82 ** Set a breakpoint at the current value of IP by
83 ** storing that address in a BREAKPOINT record
84 **************************************************************************/
85 static void vmSetBreak(FICL_VM *pVM, FICL_BREAKPOINT *pBP)
87 FICL_WORD *pStep = ficlLookup(pVM->pSys, "step-break");
90 pBP->address = pVM->ip;
91 pBP->origXT = *pVM->ip;
96 /**************************************************************************
97 ** d e b u g P r o m p t
98 **************************************************************************/
99 static void debugPrompt(FICL_VM *pVM)
101 vmTextOut(pVM, "dbg> ", 0);
105 /**************************************************************************
106 ** i s A F i c l W o r d
107 ** Vet a candidate pointer carefully to make sure
108 ** it's not some chunk o' inline data...
109 ** It has to have a name, and it has to look
110 ** like it's in the dictionary address range.
111 ** NOTE: this excludes :noname words!
112 **************************************************************************/
113 int isAFiclWord(FICL_DICT *pd, FICL_WORD *pFW)
116 if (!dictIncludes(pd, pFW))
119 if (!dictIncludes(pd, pFW->name))
122 if ((pFW->link != NULL) && !dictIncludes(pd, pFW->link))
125 if ((pFW->nName <= 0) || (pFW->name[pFW->nName] != '\0'))
128 if (strlen(pFW->name) != pFW->nName)
136 static int isPrimitive(FICL_WORD *pFW)
138 WORDKIND wk = ficlWordClassify(pFW);
139 return ((wk != COLON) && (wk != DOES));
144 /**************************************************************************
145 f i n d E n c l o s i n g W o r d
146 ** Given a pointer to something, check to make sure it's an address in the
147 ** dictionary. If so, search backwards until we find something that looks
148 ** like a dictionary header. If successful, return the address of the
149 ** FICL_WORD found. Otherwise return NULL.
150 ** nSEARCH_CELLS sets the maximum neighborhood this func will search before giving up
151 **************************************************************************/
152 #define nSEARCH_CELLS 100
154 static FICL_WORD *findEnclosingWord(FICL_VM *pVM, CELL *cp)
157 FICL_DICT *pd = vmGetDict(pVM);
160 if (!dictIncludes(pd, (void *)cp))
163 for (i = nSEARCH_CELLS; i > 0; --i, --cp)
165 pFW = (FICL_WORD *)(cp + 1 - (sizeof (FICL_WORD) / sizeof (CELL)));
166 if (isAFiclWord(pd, pFW))
174 /**************************************************************************
176 ** TOOLS ( "<spaces>name" -- )
177 ** Display a human-readable representation of the named word's definition.
178 ** The source of the representation (object-code decompilation, source
179 ** block, etc.) and the particular form of the display is implementation
181 **************************************************************************/
183 ** seeColon (for proctologists only)
184 ** Walks a colon definition, decompiling
185 ** on the fly. Knows about primitive control structures.
187 static void seeColon(FICL_VM *pVM, CELL *pc)
191 FICL_DICT *pd = vmGetDict(pVM);
192 FICL_WORD *pSemiParen = ficlLookup(pVM->pSys, "(;)");
195 for (; pc->p != pSemiParen; pc++)
197 FICL_WORD *pFW = (FICL_WORD *)(pc->p);
200 if ((void *)pc == (void *)pVM->ip)
204 cp += sprintf(cp, "%3d ", (int)(pc-param0));
206 if (isAFiclWord(pd, pFW))
208 WORDKIND kind = ficlWordClassify(pFW);
215 if (isAFiclWord(pd, c.p))
217 FICL_WORD *pLit = (FICL_WORD *)c.p;
218 sprintf(cp, "%.*s ( %#lx literal )",
219 pLit->nName, pLit->name, (unsigned long)c.u);
222 sprintf(cp, "literal %ld (%#lx)",
223 (long)c.i, (unsigned long)c.u);
227 FICL_STRING *sp = (FICL_STRING *)(void *)++pc;
228 pc = (CELL *)alignPtr(sp->text + sp->count + 1) - 1;
229 sprintf(cp, "s\" %.*s\"", sp->count, sp->text);
234 FICL_STRING *sp = (FICL_STRING *)(void *)++pc;
235 pc = (CELL *)alignPtr(sp->text + sp->count + 1) - 1;
236 sprintf(cp, "c\" %.*s\"", sp->count, sp->text);
242 sprintf(cp, "if / while (branch %d)", (int)(pc+c.i-param0));
244 sprintf(cp, "until (branch %d)", (int)(pc+c.i-param0));
249 sprintf(cp, "repeat (branch %d)", (int)(pc+c.i-param0));
251 sprintf(cp, "else (branch %d)", (int)(pc+c.i-param0));
253 sprintf(cp, "endof (branch %d)", (int)(pc+c.i-param0));
258 sprintf(cp, "of (branch %d)", (int)(pc+c.i-param0));
263 sprintf(cp, "?do (leave %d)", (int)((CELL *)c.p-param0));
267 sprintf(cp, "do (leave %d)", (int)((CELL *)c.p-param0));
271 sprintf(cp, "loop (branch %d)", (int)(pc+c.i-param0));
275 sprintf(cp, "+loop (branch %d)", (int)(pc+c.i-param0));
278 sprintf(cp, "%.*s", pFW->nName, pFW->name);
283 else /* probably not a word - punt and print value */
285 sprintf(cp, "%ld ( %#lx )", (long)pc->i, (unsigned long)pc->u);
288 vmTextOut(pVM, pVM->pad, 1);
291 vmTextOut(pVM, ";", 1);
295 ** Here's the outer part of the decompiler. It's
296 ** just a big nested conditional that checks the
297 ** CFA of the word to decompile for each kind of
298 ** known word-builder code, and tries to do
299 ** something appropriate. If the CFA is not recognized,
300 ** just indicate that it is a primitive.
302 static void seeXT(FICL_VM *pVM)
307 pFW = (FICL_WORD *)stackPopPtr(pVM->pStack);
308 kind = ficlWordClassify(pFW);
313 sprintf(pVM->pad, ": %.*s", pFW->nName, pFW->name);
314 vmTextOut(pVM, pVM->pad, 1);
315 seeColon(pVM, pFW->param);
319 vmTextOut(pVM, "does>", 1);
320 seeColon(pVM, (CELL *)pFW->param->p);
324 vmTextOut(pVM, "create", 1);
328 sprintf(pVM->pad, "variable = %ld (%#lx)",
329 (long)pFW->param->i, (unsigned long)pFW->param->u);
330 vmTextOut(pVM, pVM->pad, 1);
335 sprintf(pVM->pad, "user variable %ld (%#lx)",
336 (long)pFW->param->i, (unsigned long)pFW->param->u);
337 vmTextOut(pVM, pVM->pad, 1);
342 sprintf(pVM->pad, "constant = %ld (%#lx)",
343 (long)pFW->param->i, (unsigned long)pFW->param->u);
344 vmTextOut(pVM, pVM->pad, 1);
347 sprintf(pVM->pad, "%.*s is a primitive", pFW->nName, pFW->name);
348 vmTextOut(pVM, pVM->pad, 1);
352 if (pFW->flags & FW_IMMEDIATE)
354 vmTextOut(pVM, "immediate", 1);
357 if (pFW->flags & FW_COMPILE)
359 vmTextOut(pVM, "compile-only", 1);
366 static void see(FICL_VM *pVM)
374 /**************************************************************************
375 f i c l D e b u g X T
377 ** Given an xt of a colon definition or a word defined by DOES>, set the
378 ** VM up to debug the word: push IP, set the xt as the next thing to execute,
379 ** set a breakpoint at its first instruction, and run to the breakpoint.
380 ** Note: the semantics of this word are equivalent to "step in"
381 **************************************************************************/
382 void ficlDebugXT(FICL_VM *pVM)
384 FICL_WORD *xt = stackPopPtr(pVM->pStack);
385 WORDKIND wk = ficlWordClassify(xt);
387 stackPushPtr(pVM->pStack, xt);
395 ** Run the colon code and set a breakpoint at the next instruction
398 vmSetBreak(pVM, &(pVM->pSys->bpStep));
410 /**************************************************************************
413 ** Execute the next instruction, stepping into it if it's a colon definition
414 ** or a does> word. This is the easy kind of step.
415 **************************************************************************/
416 void stepIn(FICL_VM *pVM)
419 ** Do one step of the inner loop
426 ** Now set a breakpoint at the next instruction
428 vmSetBreak(pVM, &(pVM->pSys->bpStep));
434 /**************************************************************************
437 ** Execute the next instruction atomically. This requires some insight into
438 ** the memory layout of compiled code. Set a breakpoint at the next instruction
439 ** in this word, and run until we hit it
440 **************************************************************************/
441 void stepOver(FICL_VM *pVM)
445 FICL_WORD *pStep = ficlLookup(pVM->pSys, "step-break");
449 kind = ficlWordClassify(pFW);
456 ** assume that the next cell holds an instruction
457 ** set a breakpoint there and return to the inner interp
459 pVM->pSys->bpStep.address = pVM->ip + 1;
460 pVM->pSys->bpStep.origXT = pVM->ip[1];
473 /**************************************************************************
476 ** Handles breakpoints for stepped execution.
477 ** Upon entry, bpStep contains the address and replaced instruction
478 ** of the current breakpoint.
479 ** Clear the breakpoint
480 ** Get a command from the console.
481 ** i (step in) - execute the current instruction and set a new breakpoint
483 ** o (step over) - execute the current instruction to completion and set
484 ** a new breakpoint at the IP
485 ** g (go) - execute the current instruction and exit
486 ** q (quit) - abort current word
487 ** b (toggle breakpoint)
488 **************************************************************************/
489 void stepBreak(FICL_VM *pVM)
497 assert(pVM->pSys->bpStep.address);
498 assert(pVM->pSys->bpStep.origXT);
500 ** Clear the breakpoint that caused me to run
501 ** Restore the original instruction at the breakpoint,
502 ** and restore the IP
504 pVM->ip = (IPTYPE)(pVM->pSys->bpStep.address);
505 *pVM->ip = pVM->pSys->bpStep.origXT;
508 ** If there's an onStep, do it
510 pOnStep = ficlLookup(pVM->pSys, "on-step");
512 ficlExecXT(pVM, pOnStep);
515 ** Print the name of the next instruction
517 pFW = pVM->pSys->bpStep.origXT;
518 sprintf(pVM->pad, "next: %.*s", pFW->nName, pFW->name);
520 if (isPrimitive(pFW))
522 strcat(pVM->pad, " ( primitive )");
526 vmTextOut(pVM, pVM->pad, 1);
536 if (!strincmp(si.cp, "i", si.count))
540 else if (!strincmp(si.cp, "g", si.count))
544 else if (!strincmp(si.cp, "l", si.count))
547 xt = findEnclosingWord(pVM, (CELL *)(pVM->ip));
550 stackPushPtr(pVM->pStack, xt);
555 vmTextOut(pVM, "sorry - can't do that", 1);
557 vmThrow(pVM, VM_RESTART);
559 else if (!strincmp(si.cp, "o", si.count))
563 else if (!strincmp(si.cp, "q", si.count))
565 ficlTextOut(pVM, FICL_PROMPT, 0);
566 vmThrow(pVM, VM_ABORT);
568 else if (!strincmp(si.cp, "x", si.count))
571 ** Take whatever's left in the TIB and feed it to a subordinate ficlExec
574 char *cp = pVM->tib.cp + pVM->tib.index;
575 int count = pVM->tib.end - cp;
576 FICL_WORD *oldRun = pVM->runningWord;
578 ret = ficlExecC(pVM, cp, count);
580 if (ret == VM_OUTOFTEXT)
583 pVM->runningWord = oldRun;
584 vmTextOut(pVM, "", 1);
591 vmTextOut(pVM, "i -- step In", 1);
592 vmTextOut(pVM, "o -- step Over", 1);
593 vmTextOut(pVM, "g -- Go (execute to completion)", 1);
594 vmTextOut(pVM, "l -- List source code", 1);
595 vmTextOut(pVM, "q -- Quit (stop debugging and abort)", 1);
596 vmTextOut(pVM, "x -- eXecute the rest of the line as ficl words", 1);
598 vmThrow(pVM, VM_RESTART);
605 /**************************************************************************
608 ** Signal the system to shut down - this causes ficlExec to return
609 ** VM_USEREXIT. The rest is up to you.
610 **************************************************************************/
611 static void bye(FICL_VM *pVM)
613 vmThrow(pVM, VM_USEREXIT);
618 /**************************************************************************
619 d i s p l a y S t a c k
621 ** Display the parameter stack (code for ".s")
622 **************************************************************************/
623 static void displayPStack(FICL_VM *pVM)
625 FICL_STACK *pStk = pVM->pStack;
626 int d = stackDepth(pStk);
630 vmCheckStack(pVM, 0, 0);
633 vmTextOut(pVM, "(Stack Empty) ", 0);
637 for (i = 0; i < d; i++)
639 vmTextOut(pVM, ltoa((*pCell++).i, pVM->pad, pVM->base), 0);
640 vmTextOut(pVM, " ", 0);
647 static void displayRStack(FICL_VM *pVM)
649 FICL_STACK *pStk = pVM->rStack;
650 int d = stackDepth(pStk);
653 FICL_DICT *dp = vmGetDict(pVM);
655 vmCheckStack(pVM, 0, 0);
658 vmTextOut(pVM, "(Stack Empty) ", 0);
662 for (i = 0; i < d; i++)
666 ** Attempt to find the word that contains the
667 ** stacked address (as if it is part of a colon definition).
668 ** If this works, print the name of the word. Otherwise print
669 ** the value as a number.
671 if (dictIncludes(dp, c.p))
673 FICL_WORD *pFW = findEnclosingWord(pVM, c.p);
676 int offset = (CELL *)c.p - &pFW->param[0];
677 sprintf(pVM->pad, "%s+%d ", pFW->name, offset);
678 vmTextOut(pVM, pVM->pad, 0);
679 continue; /* no need to print the numeric value */
682 vmTextOut(pVM, ltoa(c.i, pVM->pad, pVM->base), 0);
683 vmTextOut(pVM, " ", 0);
691 /**************************************************************************
694 **************************************************************************/
695 static void forgetWid(FICL_VM *pVM)
697 FICL_DICT *pDict = vmGetDict(pVM);
700 pHash = (FICL_HASH *)stackPopPtr(pVM->pStack);
701 hashForget(pHash, pDict->here);
707 /**************************************************************************
709 ** TOOLS EXT ( "<spaces>name" -- )
710 ** Skip leading space delimiters. Parse name delimited by a space.
711 ** Find name, then delete name from the dictionary along with all
712 ** words added to the dictionary after name. An ambiguous
713 ** condition exists if name cannot be found.
715 ** If the Search-Order word set is present, FORGET searches the
716 ** compilation word list. An ambiguous condition exists if the
717 ** compilation word list is deleted.
718 **************************************************************************/
719 static void forget(FICL_VM *pVM)
722 FICL_DICT *pDict = vmGetDict(pVM);
723 FICL_HASH *pHash = pDict->pCompile;
726 where = ((FICL_WORD *)stackPopPtr(pVM->pStack))->name;
727 hashForget(pHash, where);
728 pDict->here = PTRtoCELL where;
734 /**************************************************************************
737 **************************************************************************/
739 static void listWords(FICL_VM *pVM)
741 FICL_DICT *dp = vmGetDict(pVM);
742 FICL_HASH *pHash = dp->pSearch[dp->nLists - 1];
750 char *pPad = pVM->pad;
752 for (i = 0; i < pHash->size; i++)
754 for (wp = pHash->table[i]; wp != NULL; wp = wp->link, nWords++)
756 if (wp->nName == 0) /* ignore :noname defs */
760 nChars += sprintf(pPad + nChars, "%s", cp);
769 vmTextOut(pVM, "--- Press Enter to continue ---",0);
771 vmTextOut(pVM,"\r",0);
773 vmTextOut(pVM, pPad, 1);
777 len = nCOLWIDTH - nChars % nCOLWIDTH;
779 pPad[nChars++] = ' ';
789 vmTextOut(pVM, "--- Press Enter to continue ---",0);
791 vmTextOut(pVM,"\r",0);
793 vmTextOut(pVM, pPad, 1);
802 vmTextOut(pVM, pPad, 1);
805 sprintf(pVM->pad, "Dictionary: %d words, %ld cells used of %u total",
806 nWords, (long) (dp->here - dp->dict), dp->size);
807 vmTextOut(pVM, pVM->pad, 1);
812 /**************************************************************************
814 ** Print symbols defined in the environment
815 **************************************************************************/
816 static void listEnv(FICL_VM *pVM)
818 FICL_DICT *dp = pVM->pSys->envp;
819 FICL_HASH *pHash = dp->pForthWords;
824 for (i = 0; i < pHash->size; i++)
826 for (wp = pHash->table[i]; wp != NULL; wp = wp->link, nWords++)
828 vmTextOut(pVM, wp->name, 1);
832 sprintf(pVM->pad, "Environment: %d words, %ld cells used of %u total",
833 nWords, (long) (dp->here - dp->dict), dp->size);
834 vmTextOut(pVM, pVM->pad, 1);
839 /**************************************************************************
840 e n v C o n s t a n t
841 ** Ficl interface to ficlSetEnv and ficlSetEnvD - allow ficl code to set
842 ** environment constants...
843 **************************************************************************/
844 static void envConstant(FICL_VM *pVM)
849 vmCheckStack(pVM, 1, 0);
854 ficlSetEnv(pVM->pSys, pVM->pad, (FICL_UNS)value);
858 static void env2Constant(FICL_VM *pVM)
863 vmCheckStack(pVM, 2, 0);
869 ficlSetEnvD(pVM->pSys, pVM->pad, v1, v2);
874 /**************************************************************************
875 f i c l C o m p i l e T o o l s
876 ** Builds wordset for debugger and TOOLS optional word set
877 **************************************************************************/
879 void ficlCompileTools(FICL_SYSTEM *pSys)
881 FICL_DICT *dp = pSys->dp;
885 ** TOOLS and TOOLS EXT
887 dictAppendWord(dp, ".s", displayPStack, FW_DEFAULT);
888 dictAppendWord(dp, "bye", bye, FW_DEFAULT);
889 dictAppendWord(dp, "forget", forget, FW_DEFAULT);
890 dictAppendWord(dp, "see", see, FW_DEFAULT);
891 dictAppendWord(dp, "words", listWords, FW_DEFAULT);
894 ** Set TOOLS environment query values
896 ficlSetEnv(pSys, "tools", FICL_TRUE);
897 ficlSetEnv(pSys, "tools-ext", FICL_FALSE);
902 dictAppendWord(dp, "r.s", displayRStack, FW_DEFAULT); /* guy carver */
903 dictAppendWord(dp, ".env", listEnv, FW_DEFAULT);
904 dictAppendWord(dp, "env-constant",
905 envConstant, FW_DEFAULT);
906 dictAppendWord(dp, "env-2constant",
907 env2Constant, FW_DEFAULT);
908 dictAppendWord(dp, "debug-xt", ficlDebugXT, FW_DEFAULT);
909 dictAppendWord(dp, "parse-order",
912 dictAppendWord(dp, "step-break",stepBreak, FW_DEFAULT);
913 dictAppendWord(dp, "forget-wid",forgetWid, FW_DEFAULT);
914 dictAppendWord(dp, "see-xt", seeXT, FW_DEFAULT);