You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
93 lines
3.0 KiB
C++
93 lines
3.0 KiB
C++
// sprit-forth: A portable subroutine-threaded Forth.
|
|
// Copyright (C) 2023 Clyne Sullivan <clyne@bitgloo.com>
|
|
//
|
|
// This library is free software; you can redistribute it and/or modify it
|
|
// under the terms of the GNU Library General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or (at your
|
|
// option) any later version.
|
|
//
|
|
// This library is distributed in the hope that it will be useful, but WITHOUT
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
// FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for
|
|
// more details.
|
|
//
|
|
// You should have received a copy of the GNU Library General Public License
|
|
// along with this library; if not, write to the Free Software Foundation, Inc.,
|
|
// 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
#include "core.hpp"
|
|
#include "state.hpp"
|
|
|
|
//#include <csetjmp>
|
|
#include <cstring>
|
|
|
|
//static std::jmp_buf jmpbuf;
|
|
Cell *SP = DICT.data() + DICT.size() - DS;
|
|
Cell *RP = DICT.data() + DICT.size() - DS - RS;
|
|
FuncList IP = nullptr;
|
|
|
|
std::array<Cell, DictSize> DICT;
|
|
|
|
Cell& HERE = DICT[DIdxHere];
|
|
Cell& LATEST = DICT[DIdxLatest];
|
|
Cell& STATE = DICT[DIdxState];
|
|
|
|
void executor(FuncList *list)
|
|
{
|
|
// TODO Use setjmp to recover from errors?
|
|
/*if (setjmp(jmpbuf) == 0)*/ {
|
|
|
|
FuncList body;
|
|
void (*entry)(FuncList);
|
|
|
|
// We are given the pointer to a list of function pointers.
|
|
// Dereference once to retrieve the function pointer list.
|
|
// We do not work with IP initially since it needs to be set to zero if
|
|
// this is a top-level call/execution.
|
|
body = *list;
|
|
|
|
// Enter the execution loop.
|
|
goto entry;
|
|
|
|
// Execution continues so long as IP is not zero.
|
|
// If this is a top-level execution of a pre-defined word, then IP will
|
|
// remain zero'd and the loop will immediately exit.
|
|
// If this is a defined word's execution, then its "call" will overwrite
|
|
// IP (and push the initial zero-IP to the return stack); execution will
|
|
// continue until we return to the zero-IP.
|
|
while (IP) {
|
|
// Retrieve next function pointer list.
|
|
body = (FuncList)*++IP;
|
|
entry:
|
|
// Dereference `body` to get the first function in the list.
|
|
// This is casted to take a FuncList as an argument since defined
|
|
// words need to know their addresses so that they can perform
|
|
// their "calls".
|
|
// If the word is pre-defined then the argument will simply be
|
|
// ignored.
|
|
entry = (void (*)(FuncList))*body;
|
|
entry(body);
|
|
}
|
|
|
|
//std::longjmp(jmpbuf, 1);
|
|
}
|
|
}
|
|
|
|
void execute1(Word *word)
|
|
{
|
|
// IP must initially be zero if executing a word at the top level.
|
|
IP = 0;
|
|
executor(&word->list);
|
|
}
|
|
|
|
Word *find(const char *s, int len)
|
|
{
|
|
for (auto w = (Word *)LATEST; w; w = w->link) {
|
|
if (len == (int)strlen(w->name) && strncmp(s, w->name, len) == 0)
|
|
return w;
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|