blob: 2f1990b3cae2a9c0c39429be79a751798d0ab08c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
/**
* Alee Forth: A portable and concise Forth implementation in modern C++.
* Copyright (C) 2023 Clyne Sullivan <clyne@bitgloo.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "corewords.hpp"
#include "state.hpp"
#include <iterator>
struct pop {};
struct push {};
struct popr {};
struct pushr {};
struct top {};
struct pick {};
bool State::compiling() const
{
return dict.read(Dictionary::Compiling);
}
void State::compiling(bool yes)
{
dict.write(Dictionary::Compiling, yes);
}
void State::execute(Addr addr)
{
if (addr < Dictionary::Begin) {
// Must be a core-word
CoreWords::run(addr, *this);
} else {
pushr(0);
ip = addr - sizeof(Cell);
do {
ip += sizeof(Cell);
const auto ins = dict.read(ip);
if (!CoreWords::run(ins, *this)) {
pushr(ip);
ip = ins - sizeof(Cell);
}
} while (ip);
}
}
Cell State::beyondip() const
{
return dict.read(ip + sizeof(Cell));
}
void State::pushr(Cell value)
{
if (rsize() == ReturnStackSize)
throw ::pushr();
*++rsp = value;
}
Cell State::popr()
{
if (rsize() == 0)
throw ::popr();
return *rsp--;
}
void State::push(Cell value)
{
if (size() == DataStackSize)
throw ::push();
*++dsp = value;
}
Cell State::pop()
{
if (size() == 0)
throw ::pop();
return *dsp--;
}
Cell& State::top()
{
if (size() == 0)
throw ::top();
return *dsp;
}
Cell& State::pick(std::size_t i)
{
if (i >= size())
throw ::pick();
return *(dsp - i);
}
std::size_t State::size() const noexcept
{
return std::distance(dstack, static_cast<const Cell *>(dsp)) + 1;
}
std::size_t State::rsize() const noexcept
{
return std::distance(rstack, static_cast<const Cell *>(rsp)) + 1;
}
|
