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.
170 lines
3.9 KiB
C++
170 lines
3.9 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 "alee.hpp"
|
|
#include "libalee/ctype.hpp"
|
|
#include "splitmemdict.hpp"
|
|
|
|
#include <msp430.h>
|
|
|
|
alignas(sizeof(Cell))
|
|
#include "core.fth.h"
|
|
|
|
static char strbuf[32];
|
|
|
|
static void readchar(State& state);
|
|
static void serput(int c);
|
|
static void serputs(const char *s);
|
|
static void printint(DoubleCell n, char *buf);
|
|
|
|
int main()
|
|
{
|
|
WDTCTL = WDTPW | WDTHOLD;
|
|
DCOCTL = 0;
|
|
BCSCTL1 = CALBC1_16MHZ;
|
|
DCOCTL = CALDCO_16MHZ;
|
|
|
|
P1SEL |= BIT1 | BIT2;
|
|
P1SEL2 |= BIT1 | BIT2;
|
|
|
|
UCA0CTL1 = UCSWRST;
|
|
UCA0CTL1 |= UCSSEL_2;
|
|
UCA0BR0 = 139;
|
|
UCA0BR1 = 0;
|
|
UCA0MCTL = UCBRS0;
|
|
UCA0CTL1 &= (uint8_t)~UCSWRST;
|
|
|
|
__enable_interrupt();
|
|
|
|
static SplitMemDict<alee_dat_len> dict (alee_dat);
|
|
State state (dict, readchar);
|
|
|
|
serputs("alee forth\n\r");
|
|
|
|
auto ptr = strbuf;
|
|
while (1) {
|
|
if (IFG2 & UCA0RXIFG) {
|
|
char c = UCA0RXBUF;
|
|
serput(c);
|
|
|
|
if (c == '\r') {
|
|
*ptr = '\0';
|
|
|
|
serputs("\n\r");
|
|
|
|
if (auto r = Parser::parse(state, strbuf); r == Error::none) {
|
|
serputs(state.compiling() ? " compiled" : " ok");
|
|
} else {
|
|
switch (r) {
|
|
case Error::noword:
|
|
serputs("unknown word...");
|
|
break;
|
|
default:
|
|
serputs("error...");
|
|
break;
|
|
}
|
|
}
|
|
|
|
serputs("\n\r");
|
|
|
|
ptr = strbuf;
|
|
} else if (c == '\b') {
|
|
if (ptr > strbuf)
|
|
--ptr;
|
|
} else if (ptr < strbuf + sizeof(strbuf)) {
|
|
if (c >= 'A' && c <= 'Z')
|
|
c += 32;
|
|
*ptr++ = c;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static void readchar(State& state)
|
|
{
|
|
auto idx = state.dict.read(Dictionary::Input);
|
|
Addr addr = Dictionary::Input + sizeof(Cell) + idx;
|
|
|
|
while (!(IFG2 & UCA0RXIFG));
|
|
auto c = UCA0RXBUF;
|
|
if (isupper(c))
|
|
c += 32;
|
|
state.dict.writebyte(addr, c ? c : ' ');
|
|
}
|
|
|
|
void serput(int c)
|
|
{
|
|
while (!(IFG2 & UCA0TXIFG));
|
|
UCA0TXBUF = (char)c;
|
|
}
|
|
|
|
void serputs(const char *s)
|
|
{
|
|
while (*s)
|
|
serput(*s++);
|
|
}
|
|
|
|
void printint(DoubleCell n, char *buf)
|
|
{
|
|
char *ptr = buf;
|
|
bool neg = n < 0;
|
|
|
|
if (neg)
|
|
n = -n;
|
|
|
|
do {
|
|
*ptr++ = (char)(n % 10) + '0';
|
|
} while ((n /= 10));
|
|
|
|
if (neg)
|
|
serput('-');
|
|
|
|
do {
|
|
serput(*--ptr);
|
|
} while (ptr > buf);
|
|
serput(' ');
|
|
}
|
|
|
|
void user_sys(State& state)
|
|
{
|
|
switch (state.pop()) {
|
|
case 0:
|
|
printint(state.pop(), strbuf);
|
|
break;
|
|
case 1:
|
|
printint(static_cast<Addr>(state.pop()), strbuf);
|
|
break;
|
|
case 2:
|
|
serput(state.pop());
|
|
break;
|
|
case 3:
|
|
{ auto addr = state.pop();
|
|
*reinterpret_cast<uint8_t *>(addr) = state.pop() & 0xFFu; }
|
|
break;
|
|
case 4:
|
|
state.push(*reinterpret_cast<uint8_t *>(state.pop()));
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
extern "C" int atexit(void (*)()) { return 0; }
|
|
void operator delete(void *) {}
|
|
void operator delete(void *, std::size_t) {}
|