reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 1 | #include "Forth.h" |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 2 | #include "ForthParser.h" |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 3 | #include "SkTDArray.h" |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 4 | #include "SkString.h" |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 5 | #include "SkTDStack.h" |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 6 | |
| 7 | ForthEngine::ForthEngine(ForthOutput* output) : fOutput(output) { |
| 8 | size_t size = 32 * sizeof(intptr_t); |
| 9 | fStackBase = reinterpret_cast<intptr_t*>(sk_malloc_throw(size)); |
| 10 | fStackStop = fStackBase + size/sizeof(intptr_t); |
| 11 | fStackCurr = fStackStop; |
| 12 | } |
| 13 | |
| 14 | ForthEngine::~ForthEngine() { |
| 15 | sk_free(fStackBase); |
| 16 | } |
| 17 | |
| 18 | void ForthEngine::sendOutput(const char text[]) { |
| 19 | if (fOutput) { |
| 20 | fOutput->show(text); |
| 21 | } else { |
| 22 | SkDebugf("%s", text); |
| 23 | } |
| 24 | } |
| 25 | |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 26 | void ForthEngine::push(intptr_t value) { |
| 27 | if (fStackCurr > fStackBase) { |
| 28 | SkASSERT(fStackCurr <= fStackStop && fStackCurr > fStackBase); |
| 29 | *--fStackCurr = value; |
| 30 | } else { |
| 31 | this->signal_error("overflow"); |
| 32 | } |
| 33 | } |
| 34 | |
| 35 | intptr_t ForthEngine::peek(size_t index) const { |
| 36 | SkASSERT(fStackCurr < fStackStop && fStackCurr >= fStackBase); |
| 37 | if (fStackCurr + index < fStackStop) { |
| 38 | return fStackCurr[index]; |
| 39 | } else { |
| 40 | this->signal_error("peek out of range"); |
| 41 | return 0x80000001; |
| 42 | } |
| 43 | } |
| 44 | |
| 45 | void ForthEngine::setTop(intptr_t value) { |
| 46 | if (fStackCurr < fStackStop) { |
| 47 | SkASSERT(fStackCurr < fStackStop && fStackCurr >= fStackBase); |
| 48 | *fStackCurr = value; |
| 49 | } else { |
| 50 | this->signal_error("underflow"); |
| 51 | } |
| 52 | } |
| 53 | |
| 54 | intptr_t ForthEngine::pop() { |
| 55 | if (fStackCurr < fStackStop) { |
| 56 | SkASSERT(fStackCurr < fStackStop && fStackCurr >= fStackBase); |
| 57 | return *fStackCurr++; |
| 58 | } else { |
| 59 | this->signal_error("underflow"); |
| 60 | return 0x80000001; |
| 61 | } |
| 62 | } |
| 63 | |
| 64 | /////////////////////////////////////////////////////////////////////////////// |
| 65 | |
| 66 | void ForthWord::call(ForthCallBlock* block) { |
| 67 | ForthEngine engine(NULL); |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 68 | |
| 69 | // setup the initial stack with the callers input data |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 70 | if (block) { |
| 71 | // walk the array backwards, so that the top of the stack is data[0] |
| 72 | for (size_t i = 0; i < block->in_count; i++) { |
| 73 | engine.push(block->in_data[i]); |
| 74 | } |
| 75 | } |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 76 | |
| 77 | // now invoke the word |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 78 | this->exec(&engine); |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 79 | |
| 80 | // now copy back the stack into the caller's output data |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 81 | if (block) { |
| 82 | size_t n = engine.depth(); |
| 83 | block->out_depth = n; |
| 84 | if (n > block->out_count) { |
| 85 | n = block->out_count; |
| 86 | } |
| 87 | for (size_t i = 0; i < n; i++) { |
| 88 | block->out_data[i] = engine.peek(i); |
| 89 | } |
| 90 | } |
| 91 | } |
| 92 | |
| 93 | /////////////////////////////////////////////////////////////////////////////// |
| 94 | |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 95 | /* |
| 96 | reading an initial 32bit value from the code stream: |
| 97 | |
| 98 | xxxxxxxx xxxxxxxx xxxxxxxx xxxxxx00 |
| 99 | |
| 100 | Those last two bits are always 0 for a word, so we set those bits for other |
| 101 | opcodes |
| 102 | |
| 103 | 00 -- execute this word |
| 104 | 01 -- push (value & ~3) on the data stack |
| 105 | 10 -- push value >> 2 on the data stack (sign extended) |
| 106 | 11 -- switch (value >>> 2) for Code |
| 107 | */ |
| 108 | |
| 109 | class FCode { |
| 110 | public: |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 111 | enum { |
| 112 | kCodeShift = 2, |
| 113 | kCodeMask = 7, |
| 114 | kCodeDataShift = 5 |
| 115 | }; |
| 116 | static unsigned GetCode(intptr_t c) { |
| 117 | return ((uint32_t)c >> kCodeShift) & kCodeMask; |
| 118 | } |
| 119 | static unsigned GetCodeData(intptr_t c) { |
| 120 | return (uint32_t)c >> kCodeDataShift; |
| 121 | } |
| 122 | |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 123 | enum Bits { |
| 124 | kWord_Bits = 0, // must be zero for function address |
| 125 | kDataClear2_Bits = 1, |
| 126 | kDataShift2_Bits = 2, |
| 127 | kCodeShift2_Bits = 3 |
| 128 | }; |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 129 | |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 130 | enum Code { |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 131 | kPushInt_Code, // for data that needs more than 30 bits |
| 132 | kIF_Code, |
| 133 | kELSE_Code, |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 134 | kDone_Code |
| 135 | }; |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 136 | static unsigned MakeCode(Code code) { |
| 137 | return (code << kCodeShift) | kCodeShift2_Bits; |
| 138 | } |
| 139 | |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 140 | void appendInt(int32_t); |
| 141 | void appendWord(ForthWord*); |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 142 | void appendIF(); |
| 143 | bool appendELSE(); |
| 144 | bool appendTHEN(); |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 145 | void done(); |
| 146 | |
| 147 | intptr_t* detach() { |
| 148 | this->done(); |
| 149 | return fData.detach(); |
| 150 | } |
| 151 | intptr_t* begin() { |
| 152 | this->done(); |
| 153 | return fData.begin(); |
| 154 | } |
| 155 | |
| 156 | static void Exec(const intptr_t*, ForthEngine*); |
| 157 | |
| 158 | private: |
| 159 | SkTDArray<intptr_t> fData; |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 160 | SkTDStack<size_t> fIfStack; |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 161 | }; |
| 162 | |
| 163 | void FCode::appendInt(int32_t value) { |
| 164 | if ((value & 3) == 0) { |
| 165 | *fData.append() = value | kDataClear2_Bits; |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 166 | } else if ((value << 2 >> 2) == value) { |
| 167 | *fData.append() = (value << 2) | kDataShift2_Bits; |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 168 | } else { |
| 169 | intptr_t* p = fData.append(2); |
| 170 | *p++ = (kPushInt_Code << 2) | kCodeShift2_Bits; |
| 171 | *p++ = value; |
| 172 | } |
| 173 | } |
| 174 | |
| 175 | void FCode::appendWord(ForthWord* word) { |
| 176 | SkASSERT((reinterpret_cast<intptr_t>(word) & 3) == 0); |
| 177 | *fData.append() = reinterpret_cast<intptr_t>(word); |
| 178 | } |
| 179 | |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 180 | void FCode::appendIF() { |
| 181 | size_t ifIndex = fData.count(); |
| 182 | fIfStack.push(ifIndex); |
| 183 | *fData.append() = MakeCode(kIF_Code); |
| 184 | } |
| 185 | |
| 186 | bool FCode::appendELSE() { |
| 187 | if (fIfStack.empty()) { |
| 188 | return false; |
| 189 | } |
| 190 | |
| 191 | size_t elseIndex = fData.count(); |
| 192 | *fData.append() = MakeCode(kELSE_Code); |
| 193 | |
| 194 | size_t ifIndex = fIfStack.top(); |
| 195 | // record the offset in the data part of the if-code |
| 196 | fData[ifIndex] |= (elseIndex - ifIndex) << kCodeDataShift; |
| 197 | |
| 198 | // now reuse this IfStack entry to track the else |
| 199 | fIfStack.top() = elseIndex; |
| 200 | return true; |
| 201 | } |
| 202 | |
| 203 | bool FCode::appendTHEN() { |
| 204 | if (fIfStack.empty()) { |
| 205 | return false; |
| 206 | } |
| 207 | |
| 208 | // this is either an IF or an ELSE |
| 209 | size_t index = fIfStack.top(); |
| 210 | // record the offset in the data part of the code |
| 211 | fData[index] |= (fData.count() - index - 1) << kCodeDataShift; |
| 212 | |
| 213 | fIfStack.pop(); |
| 214 | return true; |
| 215 | } |
| 216 | |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 217 | void FCode::done() { |
| 218 | *fData.append() = (kDone_Code << 2) | kCodeShift2_Bits; |
| 219 | } |
| 220 | |
| 221 | void FCode::Exec(const intptr_t* curr, ForthEngine* engine) { |
| 222 | for (;;) { |
| 223 | intptr_t c = *curr++; |
| 224 | switch (c & 3) { |
| 225 | case kWord_Bits: |
| 226 | reinterpret_cast<ForthWord*>(c)->exec(engine); |
| 227 | break; |
| 228 | case kDataClear2_Bits: |
| 229 | engine->push(c & ~3); |
| 230 | break; |
| 231 | case kDataShift2_Bits: |
| 232 | engine->push(c >> 2); |
| 233 | break; |
| 234 | case kCodeShift2_Bits: |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 235 | switch (GetCode(c)) { |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 236 | case kPushInt_Code: |
| 237 | engine->push(*curr++); |
| 238 | break; |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 239 | case kIF_Code: |
| 240 | if (!engine->pop()) { |
| 241 | // takes us past the ELSE or THEN |
| 242 | curr += GetCodeData(c); |
| 243 | } |
| 244 | break; |
| 245 | case kELSE_Code: |
| 246 | // takes us past the THEN |
| 247 | curr += GetCodeData(c); |
| 248 | break; |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 249 | case kDone_Code: |
| 250 | return; |
| 251 | } |
| 252 | break; |
| 253 | } |
| 254 | } |
| 255 | } |
| 256 | |
| 257 | /////////////////////////////////////////////////////////////////////////////// |
| 258 | |
| 259 | class CustomWord : public ForthWord { |
| 260 | public: |
| 261 | // we assume ownership of code[] |
| 262 | CustomWord(intptr_t code[]) : fCode(code) {} |
| 263 | virtual ~CustomWord() { sk_free(fCode); } |
| 264 | |
| 265 | virtual void exec(ForthEngine* engine) { |
| 266 | FCode::Exec(fCode, engine); |
| 267 | } |
| 268 | |
| 269 | private: |
| 270 | intptr_t* fCode; |
| 271 | }; |
| 272 | |
| 273 | /////////////////////////////////////////////////////////////////////////////// |
| 274 | |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 275 | ForthParser::ForthParser() : fDict(4096) { |
| 276 | this->addStdWords(); |
| 277 | } |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 278 | |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 279 | ForthParser::~ForthParser() { |
| 280 | } |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 281 | |
| 282 | static const char* parse_error(const char msg[]) { |
| 283 | SkDebugf("-- parser error: %s\n", msg); |
| 284 | return NULL; |
| 285 | } |
| 286 | |
| 287 | /** returns true if c is whitespace, including null |
| 288 | */ |
| 289 | static bool is_ws(int c) { |
| 290 | return c <= ' '; |
| 291 | } |
| 292 | |
| 293 | static const char* parse_token(const char** text, size_t* len) { |
| 294 | const char* s = *text; |
| 295 | while (is_ws(*s)) { |
| 296 | if (0 == *s) { |
| 297 | return NULL; |
| 298 | } |
| 299 | s++; |
| 300 | } |
| 301 | const char* token = s++; |
| 302 | while (!is_ws(*s)) { |
| 303 | s++; |
| 304 | } |
| 305 | *text = s; |
| 306 | *len = s - token; |
| 307 | return token; |
| 308 | } |
| 309 | |
| 310 | static bool is_digit(int c) { return (unsigned)(c - '0') <= 9; } |
| 311 | static int hex_val(int c) { |
| 312 | if (is_digit(c)) { |
| 313 | return c - '0'; |
| 314 | } else { |
| 315 | if (c <= 'Z') { |
| 316 | return 10 + c - 'A'; |
| 317 | } else { |
| 318 | return 10 + c - 'a'; |
| 319 | } |
| 320 | } |
| 321 | } |
| 322 | |
| 323 | static bool parse_num(const char str[], size_t len, int32_t* numBits) { |
| 324 | if (1 == len && !is_digit(*str)) { |
| 325 | return false; |
| 326 | } |
| 327 | const char* start = str; |
| 328 | int32_t num = 0; |
| 329 | bool neg = false; |
| 330 | if (*str == '-') { |
| 331 | neg = true; |
| 332 | str += 1; |
| 333 | } else if (*str == '#') { |
| 334 | str++; |
| 335 | while (str - start < len) { |
| 336 | num = num*16 + hex_val(*str); |
| 337 | str += 1; |
| 338 | } |
| 339 | *numBits = num; |
| 340 | return true; |
| 341 | } |
| 342 | |
| 343 | while (is_digit(*str)) { |
| 344 | num = 10*num + *str - '0'; |
| 345 | str += 1; |
| 346 | } |
| 347 | SkASSERT(str - start <= len); |
| 348 | if (str - start == len) { |
| 349 | if (neg) { |
| 350 | num = -num; |
| 351 | } |
| 352 | *numBits = num; |
| 353 | return true; |
| 354 | } |
| 355 | // if we're not done with the token then the next char must be a decimal |
| 356 | if (*str != '.') { |
| 357 | return false; |
| 358 | } |
| 359 | str += 1; |
| 360 | float x = num; |
| 361 | float denom = 1; |
| 362 | while (str - start < len && is_digit(*str)) { |
| 363 | x = 10*x + *str - '0'; |
| 364 | denom *= 10; |
| 365 | str += 1; |
| 366 | } |
| 367 | x /= denom; |
| 368 | if (str - start == len) { |
| 369 | if (neg) { |
| 370 | x = -x; |
| 371 | } |
| 372 | *numBits = f2i_bits(x); |
| 373 | return true; |
| 374 | } |
| 375 | return false; |
| 376 | } |
| 377 | |
| 378 | static const char* parse_comment(const char text[]) { |
| 379 | SkASSERT(*text == '('); |
| 380 | while (')' != *++text) { |
| 381 | if (0 == *text) { |
| 382 | return NULL; |
| 383 | } |
| 384 | } |
| 385 | return text + 1; // skip past the closing ')' |
| 386 | } |
| 387 | |
| 388 | const char* ForthParser::parse(const char text[], FCode* code) { |
| 389 | for (;;) { |
| 390 | size_t len; |
| 391 | const char* token = parse_token(&text, &len); |
| 392 | if (NULL == token) { |
| 393 | break; |
| 394 | } |
| 395 | if (1 == len) { |
| 396 | if ('(' == *token) { |
| 397 | text = parse_comment(token); |
| 398 | if (NULL == text) { |
| 399 | return NULL; |
| 400 | } |
| 401 | continue; |
| 402 | } |
| 403 | if (';' == *token) { |
| 404 | break; |
| 405 | } |
| 406 | if (':' == *token) { |
| 407 | token = parse_token(&text, &len); |
| 408 | if (NULL == token) { |
| 409 | return parse_error("missing name after ':'"); |
| 410 | } |
| 411 | FCode subCode; |
| 412 | text = this->parse(text, &subCode); |
| 413 | if (NULL == text) { |
| 414 | return NULL; |
| 415 | } |
| 416 | this->add(token, len, new CustomWord(subCode.detach())); |
| 417 | continue; |
| 418 | } |
| 419 | } |
| 420 | int32_t num; |
| 421 | if (parse_num(token, len, &num)) { |
| 422 | // note that num is just the bit representation of the float |
| 423 | code->appendInt(num); |
| 424 | } else if (2 == len && memcmp(token, "IF", 2) == 0) { |
| 425 | code->appendIF(); |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 426 | } else if (4 == len && memcmp(token, "ELSE", 4) == 0) { |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 427 | if (!code->appendELSE()) { |
| 428 | return parse_error("ELSE with no matching IF"); |
| 429 | } |
reed@android.com | 19a89f2 | 2009-08-30 03:24:51 +0000 | [diff] [blame] | 430 | } else if (4 == len && memcmp(token, "THEN", 4) == 0) { |
reed@android.com | f56e295 | 2009-08-29 21:30:25 +0000 | [diff] [blame] | 431 | if (!code->appendTHEN()) { |
| 432 | return parse_error("THEN with no matching IF"); |
| 433 | } |
| 434 | } else{ |
| 435 | ForthWord* word = this->find(token, len); |
| 436 | if (NULL == word) { |
| 437 | SkString str(token, len); |
| 438 | str.prepend("unknown word "); |
| 439 | return parse_error(str.c_str()); |
| 440 | } |
| 441 | code->appendWord(word); |
| 442 | } |
| 443 | } |
| 444 | return text; |
| 445 | } |
| 446 | |
| 447 | /////////////////////////////////////////////////////////////////////////////// |
| 448 | |
| 449 | class ForthEnv::Impl { |
| 450 | public: |
| 451 | ForthParser fParser; |
| 452 | FCode fBuilder; |
| 453 | }; |
| 454 | |
| 455 | ForthEnv::ForthEnv() { |
| 456 | fImpl = new Impl; |
| 457 | } |
| 458 | |
| 459 | ForthEnv::~ForthEnv() { |
| 460 | delete fImpl; |
| 461 | } |
| 462 | |
| 463 | void ForthEnv::addWord(const char name[], ForthWord* word) { |
| 464 | fImpl->fParser.addWord(name, word); |
| 465 | } |
| 466 | |
| 467 | void ForthEnv::parse(const char text[]) { |
| 468 | fImpl->fParser.parse(text, &fImpl->fBuilder); |
| 469 | } |
| 470 | |
| 471 | ForthWord* ForthEnv::findWord(const char name[]) { |
| 472 | return fImpl->fParser.find(name, strlen(name)); |
| 473 | } |
| 474 | |
| 475 | void ForthEnv::run(ForthOutput* output) { |
| 476 | ForthEngine engine(output); |
| 477 | FCode::Exec(fImpl->fBuilder.begin(), &engine); |
| 478 | } |
| 479 | |
| 480 | #if 0 |
| 481 | void ForthEnv::run(const char text[], ForthOutput* output) { |
| 482 | FCode builder; |
| 483 | |
| 484 | if (fImpl->fParser.parse(text, &builder)) { |
| 485 | ForthEngine engine(output); |
| 486 | FCode::Exec(builder.begin(), &engine); |
| 487 | } |
| 488 | } |
| 489 | #endif |
| 490 | |