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.
alee-forth/libalee/dictionary.cpp

146 lines
3.4 KiB
C++

/**
* 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 "ctype.hpp"
#include "dictionary.hpp"
#include <cstring>
void Dictionary::initialize()
{
write(Base, 10);
write(Here, Begin);
write(Latest, Begin);
write(Compiling, 0);
2 years ago
write(Source, Input + sizeof(Cell));
}
Addr Dictionary::allot(Cell amount) noexcept
{
Addr old = here();
here(old + amount);
return old;
}
void Dictionary::add(Cell value) noexcept
{
write(allot(sizeof(Cell)), value);
}
Addr Dictionary::aligned(Addr addr) const noexcept
{
auto unaligned = addr & (sizeof(Cell) - sizeof(uint8_t));
if (unaligned)
addr += sizeof(Cell) - unaligned;
return addr;
}
Addr Dictionary::alignhere() noexcept
{
here(aligned(here()));
return here();
}
void Dictionary::addDefinition(Word word) noexcept
{
add(word.size());
2 years ago
for (auto w = word.start; w != word.wend; ++w)
writebyte(allot(1), readbyte(w));
alignhere();
}
Addr Dictionary::find(Word word) noexcept
{
Addr lt = latest();
for (;;) {
const auto l = static_cast<Addr>(read(lt));
const Addr len = l & 0x1F;
const Word lw {
static_cast<Addr>(lt + sizeof(Cell)),
static_cast<Addr>(lt + sizeof(Cell) + len)
};
if (equal(word, lw))
return lt;
else if (lt == Begin)
break;
else
lt -= l >> 6;
}
return 0;
}
Addr Dictionary::getexec(Addr addr) noexcept
{
const auto len = read(addr) & 0x1F;
return aligned(addr + sizeof(Cell) + len);
}
Word Dictionary::input() noexcept
{
const auto src = read(Dictionary::Source);
const auto end = read(Dictionary::SourceLen);
auto idx = read(Dictionary::Input);
Word word {
static_cast<Addr>(src + idx),
static_cast<Addr>(src + idx)
};
while (idx < end) {
2 years ago
auto ch = readbyte(word.wend);
if (isspace(ch)) {
if (word.size() > 0)
break;
++word.start;
} else if (ch == '\0') {
break;
}
2 years ago
++word.wend;
++idx;
}
writebyte(Dictionary::Input, idx + 1);
return word;
}
bool Dictionary::equal(Word word, const char *str, unsigned len) const noexcept
{
return word.size() == len &&
equal(word.begin(this), word.end(this), str);
}
bool Dictionary::equal(Word word, Word other) const noexcept
{
return word.size() == other.size() &&
equal(word.begin(this), word.end(this), other.begin(this));
}
bool Dictionary::eqchars(char c1, char c2)
{
return c1 == c2 ||
(isalpha(c1) && isalpha(c2) && (c1 | 32) == (c2 | 32));
}