089scenario_filesystem.cc.html « html - mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

blob: 6ece1e9258617783add7a3cda741b7b8b9e9c4fa (plain) (tree)

8e7b4429 ^

c762564b ^

8e7b4429 ^

e5c11a51 ^

ac07e589 ^

8e7b4429 ^

ac07e589 ^

08a0eed6 ^

e4ac3c9e ^

ac07e589 ^

3e1349d2 ^

ac07e589 ^

e5c11a51 ^

8e7b4429 ^

e5c11a51 ^

8e7b4429 ^

e5c11a51 ^

e4ac3c9e ^

8e7b4429 ^

204dae92 ^

201458e3 ^

204dae92 ^

805d58c6 ^

204dae92 ^

805d58c6 ^

204dae92 ^

805d58c6 ^

204dae92 ^

201458e3 ^

204dae92 ^

805d58c6 ^

204dae92 ^

805d58c6 ^

204dae92 ^

5fe060d5 ^

204dae92 ^

e4ac3c9e ^

204dae92 ^

5fe060d5 ^

204dae92 ^

5fe060d5 ^

204dae92 ^

e4ac3c9e ^

204dae92 ^

c0f84b1f ^

204dae92 ^

201458e3 ^

204dae92 ^

201458e3 ^

204dae92 ^

201458e3 ^

204dae92 ^

805d58c6 ^

5fe060d5 ^

805d58c6 ^

5fe060d5 ^

805d58c6 ^

e4ac3c9e ^

805d58c6 ^

e4ac3c9e ^

805d58c6 ^

generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-08-07 15:56:28 +0000

quot;>; 334 } 335 void test_parse_property_list_list() { 336 istringstream in("a:b"); 337 string_tree* x = parse_property_list(in); 338 <a href='002test.cc.html#L24'>CHECK</a>(!x->atom); 339 <a href='002test.cc.html#L24'>CHECK</a>(x->left->atom); 340 <a href='002test.cc.html#L31'>CHECK_EQ</a>(x->left->value, "a"); 341 <a href='002test.cc.html#L24'>CHECK</a>(!x->right->atom); 342 <a href='002test.cc.html#L24'>CHECK</a>(x->right->left->atom); 343 <a href='002test.cc.html#L31'>CHECK_EQ</a>(x->right->left->value, "b"); 344 <a href='002test.cc.html#L24'>CHECK</a>(x->right->right == NULL); 345 delete x; 346 } 347 348 :(code) 349 type_tree* <a href='019type_abbreviations.cc.html#L58'>new_type_tree</a>(const string_tree* properties) { 350 if (!properties) return NULL; 351 if (properties->atom) { 352 const string& type_name = properties->value; 353 int value = 0; 354 if (<a href='001help.cc.html#L226'>contains_key</a>(Type_ordinal, type_name)) 355 value = get(Type_ordinal, type_name); 356 else if (is_integer(type_name)) // sometimes types will contain literal integers, like for the size of an array 357 value = 0; 358 else if (properties->value == "->") // used in recipe types 359 value = 0; 360 else 361 value = -1; // should never happen; will trigger errors later 362 return new type_tree(type_name, value); 363 } 364 return new type_tree(<a href='019type_abbreviations.cc.html#L58'>new_type_tree</a>(properties->left), 365 <a href='019type_abbreviations.cc.html#L58'>new_type_tree</a>(properties->right)); 366 } 367 368 //: avoid memory leaks for the type tree 369 370 reagent::reagent(const reagent& other) { 371 original_string = other.original_string; 372 name = other.name; 373 value = other.value; 374 initialized = other.initialized; 375 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(other.properties); ++i) { 376 properties.push_back(pair<string, string_tree*>(other.properties.at(i).first, copy(other.properties.at(i).second))); 377 } 378 type = copy(other.type); 379 // End reagent Copy Constructor 380 } 381 382 type_tree::type_tree(const type_tree& original) { 383 atom = original.atom; 384 name = original.name; 385 value = original.value; 386 left = copy(original.left); 387 right = copy(original.right); 388 } 389 390 type_tree& type_tree::operator=(const type_tree& original) { 391 atom = original.atom; 392 name = original.name; 393 value = original.value; 394 if (left) delete left; 395 left = copy(original.left); 396 if (right) delete right; 397 right = copy(original.right); 398 return *this; 399 } 400 401 bool type_tree::operator==(const type_tree& other) const { 402 if (atom != other.atom) return false; 403 if (atom) 404 return name == other.name && value == other.value; 405 return (left == other.left || *left == *other.left) 406 && (right == other.right || *right == *other.right); 407 } 408 409 // only constraint we care about: if a 410 bool type_tree::operator<(const type_tree& other) const { 411 if (atom != other.atom) return atom > other.atom; // atoms before non-atoms 412 if (atom) return value < other.value; 413 // first location in one that's missing in the other makes that side 'smaller' 414 if (left && !other.left) return false; 415 if (!left && other.left) return true; 416 if (right && !other.right) return false; 417 if (!right && other.right) return true; 418 // now if either pointer is unequal neither side can be null 419 // if one side is equal that's easy 420 if (left == other.left || *left == *other.left) return right && *right < *other.right; 421 if (right == other.right || *right == *other.right) return left && *left < *other.left; 422 // if the two sides criss-cross, pick the side with the smaller lhs 423 if ((left == other.right || *left == *other.right) 424 && (right == other.left || *right == *other.left)) 425 return *left < *other.left; 426 // now the hard case: both sides are not equal 427 // make sure we stay consistent between (a < b) and (b < a) 428 // just return the side with the smallest of the 4 branches 429 if (*left < *other.left && *left < *other.right) return true; 430 if (*right < *other.left && *right < *other.right) return true; 431 return false; 432 } 433 :(before "End Unit Tests") 434 // These unit tests don't always use valid types. 435 void test_compare_atom_types() { 436 reagent a("a:address"), b("b:boolean"); 437 <a href='002test.cc.html#L24'>CHECK</a>(*a.type < *b.type); 438 <a href='002test.cc.html#L24'>CHECK</a>(!(*b.type < *a.type)); 439 } 440 void test_compare_equal_atom_types() { 441 reagent a("a:address"), b("b:address"); 442 <a href='002test.cc.html#L24'>CHECK</a>(!(*a.type < *b.type)); 443 <a href='002test.cc.html#L24'>CHECK</a>(!(*b.type < *a.type)); 444 } 445 void test_compare_atom_with_non_atom() { 446 reagent a("a:<a href='043space.cc.html#L101'>address</a>:number"), b("b:boolean"); 447 <a href='002test.cc.html#L24'>CHECK</a>(!(*a.type < *b.type)); 448 <a href='002test.cc.html#L24'>CHECK</a>(*b.type < *a.type); 449 } 450 void test_compare_lists_with_identical_structure() { 451 reagent a("a:<a href='043space.cc.html#L101'>address</a>:address"), b("b:<a href='043space.cc.html#L101'>address</a>:boolean"); 452 <a href='002test.cc.html#L24'>CHECK</a>(*a.type < *b.type); 453 <a href='002test.cc.html#L24'>CHECK</a>(!(*b.type < *a.type)); 454 } 455 void test_compare_identical_lists() { 456 reagent a("a:<a href='043space.cc.html#L101'>address</a>:boolean"), b("b:<a href='043space.cc.html#L101'>address</a>:boolean"); 457 <a href='002test.cc.html#L24'>CHECK</a>(!(*a.type < *b.type)); 458 <a href='002test.cc.html#L24'>CHECK</a>(!(*b.type < *a.type)); 459 } 460 void test_compare_list_with_extra_element() { 461 reagent a("a:<a href='043space.cc.html#L101'>address</a>:address"), b("b:<a href='043space.cc.html#L101'>address</a>:<a href='043space.cc.html#L101'>address</a>:number"); 462 <a href='002test.cc.html#L24'>CHECK</a>(*a.type < *b.type); 463 <a href='002test.cc.html#L24'>CHECK</a>(!(*b.type < *a.type)); 464 } 465 void test_compare_list_with_smaller_left_but_larger_right() { 466 reagent a("a:number:character"), b("b:boolean:array"); 467 <a href='002test.cc.html#L24'>CHECK</a>(*a.type < *b.type); 468 <a href='002test.cc.html#L24'>CHECK</a>(!(*b.type < *a.type)); 469 } 470 void test_compare_list_with_smaller_left_but_larger_right_identical_types() { 471 reagent a("a:<a href='043space.cc.html#L101'>address</a>:boolean"), b("b:boolean:address"); 472 <a href='002test.cc.html#L24'>CHECK</a>(*a.type < *b.type); 473 <a href='002test.cc.html#L24'>CHECK</a>(!(*b.type < *a.type)); 474 } 475 476 :(code) 477 string_tree::string_tree(const string_tree& original) { 478 atom = original.atom; 479 value = original.value; 480 left = copy(original.left); 481 right = copy(original.right); 482 } 483 484 reagent& reagent::operator=(const reagent& other) { 485 original_string = other.original_string; 486 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(properties); ++i) 487 if (properties.at(i).second) delete properties.at(i).second; 488 properties.<a href='050scenario.cc.html#L60'>clear</a>(); 489 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(other.properties); ++i) 490 properties.push_back(pair<string, string_tree*>(other.properties.at(i).first, copy(other.properties.at(i).second))); 491 name = other.name; 492 value = other.value; 493 initialized = other.initialized; 494 if (type) delete type; 495 type = copy(other.type); 496 // End reagent Copy Operator 497 return *this; 498 } 499 500 reagent::~reagent() { 501 <a href='050scenario.cc.html#L60'>clear</a>(); 502 } 503 504 void reagent::<a href='050scenario.cc.html#L60'>clear</a>() { 505 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(properties); ++i) { 506 if (properties.at(i).second) { 507 delete properties.at(i).second; 508 properties.at(i).second = NULL; 509 } 510 } 511 delete type; 512 type = NULL; 513 } 514 type_tree::~type_tree() { 515 delete left; 516 delete right; 517 } 518 string_tree::~string_tree() { 519 delete left; 520 delete right; 521 } 522 523 void append(type_tree*& base, type_tree* extra) { 524 if (!base) { 525 base = extra; 526 return; 527 } 528 type_tree* curr = base; 529 while (curr->right) curr = curr->right; 530 curr->right = extra; 531 } 532 533 void append(string_tree*& base, string_tree* extra) { 534 if (!base) { 535 base = extra; 536 return; 537 } 538 string_tree* curr = base; 539 while (curr->right) curr = curr->right; 540 curr->right = extra; 541 } 542 543 string slurp_until(istream& in, char delim) { 544 ostringstream out; 545 char c; 546 while (in >> c) { 547 if (c == delim) { 548 // drop the delim 549 break; 550 } 551 out << c; 552 } 553 return out.str(); 554 } 555 556 bool has_property(const reagent& x, const string& name) { 557 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(x.properties); ++i) { 558 if (x.properties.at(i).first == name) return true; 559 } 560 return false; 561 } 562 563 string_tree* property(const reagent& r, const string& name) { 564 for (int p = 0; p != <a href='001help.cc.html#L141'>SIZE</a>(r.properties); ++p) { 565 if (r.properties.at(p).first == name) 566 return r.properties.at(p).second; 567 } 568 return NULL; 569 } 570 571 string_tree* copy(const string_tree* x) { 572 if (x == NULL) return NULL; 573 return new string_tree(*x); 574 } 575 576 type_tree* copy(const type_tree* x) { 577 if (x == NULL) return NULL; 578 return new type_tree(*x); 579 } 580 581 :(before "End Globals") 582 extern const string Ignore(","); // commas are ignored in Mu except within [] strings 583 :(code) 584 void skip_whitespace_but_not_newline(istream& in) { 585 while (true) { 586 if (!has_data(in)) break; 587 else if (in.peek() == '\n') break; 588 else if (isspace(in.peek())) in.get(); 589 else if (Ignore.find(in.peek()) != string::npos) in.get(); 590 else break; 591 } 592 } 593 594 void dump_memory() { 595 for (map<int, double>::iterator p = Memory.begin(); p != Memory.<a href='003trace.cc.html#L225'>end</a>(); ++p) { 596 cerr << p->first << ": " << no_scientific(p->second) << '\n'; 597 } 598 } 599 600 //:: Helpers for converting various values to string 601 //: Use to_string() in trace(), and try to keep it stable from run to run. 602 //: Use debug_string() while debugging, and throw everything into it. 603 //: Use inspect() only for emitting a canonical format that can be parsed back 604 //: into the value. 605 606 string <a href='028call_return.cc.html#L163'>to_string</a>(const recipe& r) { 607 ostringstream out; 608 out << "recipe " << r.name << " [\n"; 609 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(r.steps); ++i) 610 out << " " << <a href='028call_return.cc.html#L163'>to_string</a>(r.steps.at(i)) << '\n'; 611 out << "]\n"; 612 return out.str(); 613 } 614 615 string to_original_string(const recipe& r) { 616 ostringstream out; 617 out << "recipe " << r.name << " [\n"; 618 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(r.steps); ++i) 619 out << " " << to_original_string(r.steps.at(i)) << '\n'; 620 out << "]\n"; 621 return out.str(); 622 } 623 624 string debug_string(const recipe& x) { 625 ostringstream out; 626 out << "- <a href='010vm.cc.html#L19'>recipe</a> " << x.name << '\n'; 627 // Begin debug_string(recipe x) 628 for (int index = 0; index < <a href='001help.cc.html#L141'>SIZE</a>(x.steps); ++index) { 629 const instruction& inst = x.steps.at(index); 630 out << "inst: " << <a href='028call_return.cc.html#L163'>to_string</a>(inst) << '\n'; 631 out << " ingredients\n"; 632 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(inst.ingredients); ++i) 633 out << " " << debug_string(inst.ingredients.at(i)) << '\n'; 634 out << " products\n"; 635 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(inst.products); ++i) 636 out << " " << debug_string(inst.products.at(i)) << '\n'; 637 } 638 return out.str(); 639 } 640 641 string to_original_string(const instruction& inst) { 642 if (inst.is_label) return inst.label; 643 if (!inst.original_string.empty()) return inst.original_string; 644 ostringstream out; 645 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(inst.products); ++i) { 646 if (i > 0) out << ", "; 647 out << inst.products.at(i).original_string; 648 } 649 if (!inst.products.empty()) out << " <- "; 650 out << inst.name; 651 if (!inst.ingredients.empty()) out << ' '; 652 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(inst.ingredients); ++i) { 653 if (i > 0) out << ", "; 654 out << inst.ingredients.at(i).original_string; 655 } 656 return out.str(); 657 } 658 659 string <a href='028call_return.cc.html#L163'>to_string</a>(const instruction& inst) { 660 if (inst.is_label) return inst.label; 661 ostringstream out; 662 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(inst.products); ++i) { 663 if (i > 0) out << ", "; 664 out << <a href='028call_return.cc.html#L163'>to_string</a>(inst.products.at(i)); 665 } 666 if (!inst.products.empty()) out << " <- "; 667 out << inst.name << ' '; 668 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(inst.ingredients); ++i) { 669 if (i > 0) out << ", "; 670 out << <a href='028call_return.cc.html#L163'>to_string</a>(inst.ingredients.at(i)); 671 } 672 return out.str(); 673 } 674 675 string <a href='028call_return.cc.html#L163'>to_string</a>(const reagent& r) { 676 if (is_dummy(r)) return "_"; 677 ostringstream out; 678 out << "{"; 679 out << r.name << ": " << names_to_string(r.type); 680 if (!r.properties.empty()) { 681 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(r.properties); ++i) 682 out << ", \"" << r.properties.at(i).first << "\": " << <a href='028call_return.cc.html#L163'>to_string</a>(r.properties.at(i).second); 683 } 684 out << "}"; 685 return out.str(); 686 } 687 688 // special name for ignoring some products 689 bool is_dummy(const reagent& x) { 690 return x.name == "_"; 691 } 692 693 string debug_string(const reagent& x) { 694 ostringstream out; 695 out << x.name << ": " << x.value << ' ' << <a href='028call_return.cc.html#L163'>to_string</a>(x.type) << " -- " << <a href='028call_return.cc.html#L163'>to_string</a>(x); 696 return out.str(); 697 } 698 699 string <a href='028call_return.cc.html#L163'>to_string</a>(const string_tree* property) { 700 if (!property) return "()"; 701 ostringstream out; 702 dump(property, out); 703 return out.str(); 704 } 705 706 void dump(const string_tree* x, ostream& out) { 707 if (!x) return; 708 if (x->atom) { 709 out << '"' << x->value << '"'; 710 return; 711 } 712 out << '('; 713 const string_tree* curr = x; 714 while (curr && !curr->atom) { 715 dump(curr->left, out); 716 if (curr->right) out << ' '; 717 curr = curr->right; 718 } 719 // check for dotted list; should never happen 720 if (curr) { 721 out << ". "; 722 dump(curr, out); 723 } 724 out << ')'; 725 } 726 727 string <a href='028call_return.cc.html#L163'>to_string</a>(const type_tree* type) { 728 if (type == NULL) return "()"; 729 ostringstream out; 730 dump(type, out); 731 return out.str(); 732 } 733 734 void dump(const type_tree* x, ostream& out) { 735 if (!x) return; 736 if (x->atom) { 737 dump(x->value, out); 738 return; 739 } 740 out << '('; 741 const type_tree* curr = x; 742 while (curr && !curr->atom) { 743 dump(curr->left, out); 744 if (curr->right) out << ' '; 745 curr = curr->right; 746 } 747 // check for dotted list; should never happen 748 if (curr) { 749 out << ". "; 750 dump(curr, out); 751 } 752 out << ')'; 753 } 754 755 void dump(<a href='010vm.cc.html#L125'>type_ordinal</a> type, ostream& out) { 756 if (<a href='001help.cc.html#L226'>contains_key</a>(Type, type)) 757 out << get(Type, type).name; 758 else 759 out << "?" << type; 760 } 761 762 string names_to_string(const type_tree* type) { 763 if (type == NULL) return "()"; // should never happen 764 ostringstream out; 765 dump_names(type, out); 766 return out.str(); 767 } 768 769 void dump_names(const type_tree* x, ostream& out) { 770 if (!x) return; 771 if (x->atom) { 772 out << '"' << x->name << '"'; 773 return; 774 } 775 out << '('; 776 const type_tree* curr = x; 777 while (curr && !curr->atom) { 778 dump_names(curr->left, out); 779 if (curr->right) out << ' '; 780 curr = curr->right; 781 } 782 // check for dotted list; should never happen 783 if (curr) { 784 out << ". "; 785 dump_names(curr, out); 786 } 787 out << ')'; 788 } 789 790 string names_to_string_without_quotes(const type_tree* type) { 791 if (type == NULL) return "()"; 792 ostringstream out; 793 dump_names_without_quotes(type, out); 794 return out.str(); 795 } 796 797 void dump_names_without_quotes(const type_tree* x, ostream& out) { 798 if (!x) return; 799 if (x->atom) { 800 out << x->name; 801 return; 802 } 803 out << '('; 804 const type_tree* curr = x; 805 while (curr && !curr->atom) { 806 dump_names_without_quotes(curr->left, out); 807 if (curr->right) out << ' '; 808 curr = curr->right; 809 } 810 // check for dotted list; should never happen 811 if (curr) { 812 out << ". "; 813 dump_names_without_quotes(curr, out); 814 } 815 out << ')'; 816 } 817 818 bool is_integer(const string& s) { 819 return s.find_first_not_of("0123456789-") == string::npos // no other characters 820 && s.find_first_of("0123456789") != string::npos // at least one digit 821 && s.find('-', 1) == string::npos; // '-' only at first position 822 } 823 824 int to_integer(string n) { 825 char* <a href='003trace.cc.html#L225'>end</a> = NULL; 826 // safe because string.c_str() is guaranteed to be null-terminated 827 int result = strtoll(n.c_str(), &end, /*any base*/0); 828 if (*end != '\0') cerr << "tried to convert " << n << " to number\n"; 829 assert(*end == '\0'); 830 return result; 831 } 832 833 void test_is_integer() { 834 <a href='002test.cc.html#L24'>CHECK</a>(is_integer("1234")); 835 <a href='002test.cc.html#L24'>CHECK</a>(is_integer("-1")); 836 <a href='002test.cc.html#L24'>CHECK</a>(!is_integer("234.0")); 837 <a href='002test.cc.html#L24'>CHECK</a>(is_integer("-567")); 838 <a href='002test.cc.html#L24'>CHECK</a>(!is_integer("89-0")); 839 <a href='002test.cc.html#L24'>CHECK</a>(!is_integer("-")); 840 <a href='002test.cc.html#L24'>CHECK</a>(!is_integer("1e3")); // not supported 841 } 842 843 //: helper to print numbers without excessive precision 844 845 :(before "End Types") 846 struct no_scientific { 847 double x; 848 explicit no_scientific(double y) :x(y) {} 849 }; 850 851 :(code) 852 ostream& operator<<(ostream& os, no_scientific x) { 853 if (!isfinite(x.x)) { 854 // Infinity or NaN 855 os << x.x; 856 return os; 857 } 858 ostringstream tmp; 859 // more accurate, but too slow 860 //? tmp.precision(308); // for 64-bit numbers 861 tmp << std::fixed << x.x; 862 os << trim_floating_point(tmp.str()); 863 return os; 864 } 865 866 string trim_floating_point(const string& in) { 867 if (in.empty()) return ""; 868 if (in.find('.') == string::npos) return in; 869 int length = <a href='001help.cc.html#L141'>SIZE</a>(in); 870 while (length > 1) { 871 if (in.at(length-1) != '0') break; 872 --length; 873 } 874 if (in.at(length-1) == '.') --length; 875 if (length == 0) return "0"; 876 return in.substr(0, length); 877 } 878 879 void test_trim_floating_point() { 880 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point(""), ""); 881 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point(".0"), "0"); 882 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("1.5000"), "1.5"); 883 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("1.000001"), "1.000001"); 884 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("23.000000"), "23"); 885 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("23.0"), "23"); 886 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("23."), "23"); 887 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("23"), "23"); 888 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("230"), "230"); 889 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("3.000000"), "3"); 890 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("3.0"), "3"); 891 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("3."), "3"); 892 <a href='002test.cc.html#L31'>CHECK_EQ</a>(trim_floating_point("3"), "3"); 893 } 894 895 :(before "End Includes") 896 #include <map> 897 using std::map; 898 #include <utility> 899 using std::pair; 900 #include <math.h> </pre> </body> </html>