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 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944
|
// builder.cpp
// this file is part of Context Free
// ---------------------
// Copyright (C) 2005-2008 Mark Lentczner - markl@glyphic.com
// Copyright (C) 2005-2014 John Horigan - john@glyphic.com
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// John Horigan can be contacted at john@glyphic.com or at
// John Horigan, 1209 Villa St., Mountain View, CA 94041-1123, USA
//
// Mark Lentczner can be contacted at markl@glyphic.com or at
// Mark Lentczner, 1209 Villa St., Mountain View, CA 94041-1123, USA
//
//
#include "builder.h"
#include "astreplacement.h"
#define _USE_MATH_DEFINES
#include "agg2/agg_trans_affine.h"
#include "agg2/agg_path_storage.h"
#include "agg2/agg_basics.h"
#include "cfdgimpl.h"
#include "primShape.h"
#include <cmath>
#include <cassert>
#include <limits>
#include "scanner.h"
#include <typeinfo>
#include <cstddef>
#include "backwards.h"
#include <algorithm>
using namespace AST;
const std::map<std::string, int> Builder::FlagNames = {
{"CF::None", AST::CF_NONE},
{"CF::MiterJoin", AST::CF_MITER_JOIN | AST::CF_JOIN_PRESENT},
{"CF::RoundJoin", AST::CF_ROUND_JOIN | AST::CF_JOIN_PRESENT},
{"CF::BevelJoin", AST::CF_BEVEL_JOIN | AST::CF_JOIN_PRESENT},
{"CF::ButtCap", AST::CF_BUTT_CAP | AST::CF_CAP_PRESENT},
{"CF::RoundCap", AST::CF_ROUND_CAP | AST::CF_CAP_PRESENT},
{"CF::SquareCap", AST::CF_SQUARE_CAP | AST::CF_CAP_PRESENT},
{"CF::ArcCW", AST::CF_ARC_CW},
{"CF::ArcLarge", AST::CF_ARC_LARGE},
{"CF::Continuous", AST::CF_CONTINUOUS},
{"CF::Align", AST::CF_ALIGN},
{"CF::EvenOdd", AST::CF_EVEN_ODD},
{"CF::IsoWidth", AST::CF_ISO_WIDTH},
{"~~CF_FILL~~", AST::CF_FILL},
{"CF::Cyclic", AST::CF_CYCLIC},
{"CF::Dihedral", AST::CF_DIHEDRAL},
{"CF::p11g", AST::CF_P11G},
{"CF::p11m", AST::CF_P11M},
{"CF::p1m1", AST::CF_P1M1},
{"CF::p2", AST::CF_P2},
{"CF::p2mg", AST::CF_P2MG},
{"CF::p2mm", AST::CF_P2MM},
{"CF::pm", AST::CF_PM},
{"CF::pg", AST::CF_PG},
{"CF::cm", AST::CF_CM},
{"CF::pmm", AST::CF_PMM},
{"CF::pmg", AST::CF_PMG},
{"CF::pgg", AST::CF_PGG},
{"CF::cmm", AST::CF_CMM},
{"CF::p4", AST::CF_P4},
{"CF::p4m", AST::CF_P4M},
{"CF::p4g", AST::CF_P4G},
{"CF::p3", AST::CF_P3},
{"CF::p3m1", AST::CF_P3M1},
{"CF::p31m", AST::CF_P31M},
{"CF::p6", AST::CF_P6},
{"CF::p6m", AST::CF_P6M},
{"CF::Normal", AST::CF_SRC_OVER},
{"CF::Clear", AST::CF_CLEAR},
{"CF::Xor", AST::CF_XOR},
{"CF::Plus", AST::CF_PLUS},
{"CF::Multiply", AST::CF_MULTIPLY},
{"CF::Screen", AST::CF_SCREEN},
{"CF::Overlay", AST::CF_OVERLAY},
{"CF::Darken", AST::CF_DARKEN},
{"CF::Lighten", AST::CF_LIGHTEN},
{"CF::ColorDodge", AST::CF_COLOR_DODGE},
{"CF::ColorBurn", AST::CF_COLOR_BURN},
{"CF::HardLight", AST::CF_HARD_LIGHT},
{"CF::SoftLight", AST::CF_SOFT_LIGHT},
{"CF::Difference", AST::CF_DIFFERENCE},
{"CF::Exclusion", AST::CF_EXCLUSION},
};
Builder* Builder::CurrentBuilder = nullptr;
std::recursive_mutex Builder::BuilderMutex;
double Builder::MaxNatural = 1000.0;
int Builder::MaxNaturalDepth = std::numeric_limits<int>::max();
Builder::Builder(const cfdgi_ptr& cfdg, int variation)
: m_CFDG(cfdg), m_currentPath(nullptr), m_pathCount(1),
mInPathContainer(false), mCurrentShape(-1), mParamSize(0),
mLocalStackDepth(0), mIncludeDepth(0), mAllowOverlap(false), lexer(nullptr),
mErrorOccured(false)
{
mBuilderThread = std::this_thread::get_id();
//CommandInfo::shapeMap[0].mArea = M_PI * 0.25;
mSeed.seed(static_cast<unsigned long long>(variation));
std::lock_guard<std::recursive_mutex> lock(BuilderMutex);
assert(Builder::CurrentBuilder == nullptr); // ensure singleton
Builder::CurrentBuilder = this;
MaxNatural = 1000.0;
MaxNaturalDepth = std::numeric_limits<int>::max();
m_CFDG->m_impure = false;
}
Builder::~Builder()
{
std::lock_guard<std::recursive_mutex> lock(BuilderMutex);
Builder::CurrentBuilder = nullptr;
}
bool
Builder::isMyBuilder() const noexcept
{
return mBuilderThread == std::this_thread::get_id();
}
const char*
Builder::getUniqueFile(const std::string* base, const std::string* file)
{
if (!m_CFDG->system()->isGuiProgram())
return file->c_str();
const char* b = base->c_str();
const char* f = file->c_str();
for (; *b && *f; ++b, ++f) {
if (*b != *f)
return f;
}
if (*b == '\0' && *f != '\0')
return f;
if (*b == '\0' && *f == '\0')
return nullptr;
return file->c_str();
}
void
Builder::error(const yy::location& l, const std::string& msg)
{
mErrorOccured = true;
m_CFDG->system()->error();
warning(l, msg);
}
void
Builder::warning(const yy::location& l, const std::string& msg)
{
CfdgError err(l, msg.c_str());
// Create user-friendly file name and put it in err.where.end.filename
const char* fname = nullptr;
if (l.begin.filename) {
fname = getUniqueFile(m_basePath.get(), l.begin.filename);
if (!fname)
fname = l.begin.filename->c_str();
}
m_CFDG->fileNames.emplace_back((fname && *fname) ? fname : "input");
err.where.end.filename = &(m_CFDG->fileNames.back());;
m_CFDG->system()->syntaxError(err);
}
void Builder::error(int line, const char* msg)
{
yy::location loc;
loc.initialize(m_currentPath);
loc.begin.line = line;
loc.end.line = line + 1;
CfdgError err(loc, msg);
const char* fname = getUniqueFile(m_basePath.get(), loc.begin.filename);
mErrorOccured = true;
m_CFDG->system()->error();
if (fname == nullptr) {
m_CFDG->system()->syntaxError(err);
} else {
m_CFDG->system()->message("Error in %s at line %d - %s",
fname, loc.begin.line, msg);
}
}
AbstractSystem*
Builder::system()
{
return m_CFDG->system();
}
int
Builder::StringToShape(const std::string& name, const yy::location& loc,
bool colonsAllowed)
{
CheckName(name, loc, colonsAllowed);
if (mCurrentNameSpace.length() == 0) {
return m_CFDG->encodeShapeName(name, loc);
} else {
bool maybePrimitive = std::find(primShape::shapeNames.begin(), primShape::shapeNames.end(), name) != primShape::shapeNames.end();
std::string n(mCurrentNameSpace);
n.append(name);
if (maybePrimitive && m_CFDG->tryEncodeShapeName(n) == -1)
return m_CFDG->encodeShapeName(name, loc);
else
return m_CFDG->encodeShapeName(n, loc);
}
}
std::string
Builder::ShapeToString(int shape)
{
return m_CFDG->decodeShapeName(shape);
}
const std::string&
Builder::FlagToString(int flag)
{
static const std::string notfound = "Unknown flag";
for (const auto& [flagName, flagValue] : FlagNames)
if (flagValue == flag)
return flagName;
return notfound;
}
// Switch parser input to a new file
void
Builder::IncludeFile(const std::string& fname)
{
std::string path =
m_CFDG->system()->relativeFilePath(*m_currentPath, fname.c_str());
auto input = m_CFDG->system()->openFileForRead(path);
if (!input || !input->good()) {
m_CFDG->system()->error();
mErrorOccured = true;
m_CFDG->system()->message("Couldn't open rules file %s", path.c_str());
return;
}
m_CFDG->fileNames.push_back(path);
m_currentPath = &(m_CFDG->fileNames.back());
m_filesToLoad.push(m_currentPath);
m_streamsToLoad.push(std::move(input));
m_includeNamespace.push(false);
++m_pathCount;
++mIncludeDepth;
mCurrentShape = -1;
SetShape(nullptr);
m_CFDG->system()->message("Reading rules file %s", fname.c_str());
lexer->yypush_buffer_state(lexer->yy_create_buffer(m_streamsToLoad.top().get(), 16384));
lexer->nextLocAction = yy::Scanner::pushLoc;
}
// Return parser input to previous file
bool
Builder::EndInclude()
{
bool endOfInput = mIncludeDepth == 0;
SetShape(nullptr);
lexer->yypop_buffer_state();
lexer->nextLocAction = yy::Scanner::popLoc;
--mIncludeDepth;
if (m_streamsToLoad.empty())
return endOfInput;
if (m_includeNamespace.top())
PopNameSpace();
m_streamsToLoad.pop();
m_filesToLoad.pop();
m_includeNamespace.pop();
m_currentPath = m_filesToLoad.empty() ? nullptr : m_filesToLoad.top();
return endOfInput;
}
void
Builder::SetShape(std::string* name, const yy::location& nameLoc, bool isPath)
{
if (name == nullptr) {
mCurrentShape = -1;
return;
}
mCurrentShape = StringToShape(*name, nameLoc, false);
if (ASTdefine* def = m_CFDG->findFunction(mCurrentShape)) {
error(nameLoc, "There is a function with the same name as this shape");
error(def->mLocation, " the function is here");
return;
}
const char* err = m_CFDG->setShapeParams(mCurrentShape, mParamDecls, mParamSize, isPath);
if (err) {
mErrorOccured = true;
warning(nameLoc, err);
}
mLocalStackDepth -= mParamSize;
mParamDecls.mParameters.clear();
mParamSize = 0;
}
void
Builder::AddRule(ASTrule* rule)
{
bool isShapeItem = rule->mNameIndex == -1;
if (isShapeItem)
rule->mNameIndex = mCurrentShape;
else
mCurrentShape = -1;
if (rule->mNameIndex == -1) {
error(rule->mLocation, "Shape rules/paths must follow a shape declaration");
return;
}
int type = m_CFDG->getShapeType(rule->mNameIndex);
if ((rule->isPath && type == CFDGImpl::ruleType) ||
(!rule->isPath && type == CFDGImpl::pathType))
error(rule->mLocation, "Cannot mix rules and shapes with the same name.");
bool matchesShape = m_CFDG->addRule(rule);
if (!isShapeItem && matchesShape)
error(rule->mLocation, "Rule/path name matches existing shape name");
}
void
Builder::NextParameterDecl(const std::string& type, const std::string& name,
const yy::location& typeLoc, const yy::location& nameLoc)
{
int nameIndex = StringToShape(name, nameLoc, false);
CheckVariableName(nameIndex, nameLoc, true);
mParamDecls.addParameter(type, nameIndex, typeLoc, nameLoc);
ASTparameter& param = mParamDecls.mParameters.back();
param.mStackIndex = mLocalStackDepth;
mParamSize += param.mTuplesize;
mLocalStackDepth += param.mTuplesize;
}
ASTdefine*
Builder::MakeDefinition(CFG cfgnum, const yy::location& cfgLoc, exp_ptr exp)
{
if (!mContainerStack.back()->isGlobal) {
error(cfgLoc, "Configuration parameters must be at global scope");
return nullptr;
}
std::string name(CFDG::ParamNames[cfgnum]); // copy the name
ASTdefine* cfg = new ASTdefine(name, cfgLoc);
cfg->mConfigDepth = mIncludeDepth;
cfg->mDefineType = ASTdefine::ConfigDefine;
cfg->mExpression = std::move(exp);
return cfg;
}
ASTdefine*
Builder::MakeDefinition(AST::str_ptr name, const yy::location& nameLoc,
bool isFunction)
{
if (strncmp(name->c_str(), "CF::", 4) == 0) {
if (isFunction) {
error(nameLoc, "Configuration parameters cannot be functions");
return nullptr;
}
if (!mContainerStack.back()->isGlobal) {
error(nameLoc, "Configuration parameters must be at global scope");
return nullptr;
}
ASTdefine* cfg = new ASTdefine(*name, nameLoc);
cfg->mConfigDepth = mIncludeDepth;
cfg->mDefineType = ASTdefine::ConfigDefine;
return cfg;
}
if (ASTfunction::GetFuncType(*name) != ASTfunction::NotAFunction) {
error(nameLoc, "Internal function names are reserved");
return nullptr;
}
// Check if a global definition shadows a pre-definition. If it does then
// drop the global definition.
if (mContainerStack.back()->isGlobal && mIncludeDepth >= 0)
for (auto&& rep: mContainerStack.back()->mBody)
if (const ASTdefine* def = dynamic_cast<const ASTdefine*>(rep.get()))
if (def->mName == *name && def->mConfigDepth == -1)
return nullptr;
int nameIndex = StringToShape(*name, nameLoc, false);
if (ASTdefine* funcDef = m_CFDG->findFunction(nameIndex)) {
error(nameLoc, "Definition with same name as user function");
error(funcDef->mLocation, " user function definition is here.");
return nullptr;
}
CheckVariableName(nameIndex, nameLoc, false);
ASTdefine* def = new ASTdefine(*name, nameLoc);
def->mShapeSpec.shapeType = nameIndex;
if (isFunction) {
for (ASTparameter& param: mParamDecls.mParameters)
param.mLocality = PureNonlocal;
def->mParameters = mParamDecls.mParameters; // copy
def->mParamSize = mParamSize;
def->mDefineType = ASTdefine::FunctionDefine;
mLocalStackDepth -= mParamSize;
mParamSize = 0;
AST::ASTdefine* prev = m_CFDG->declareFunction(nameIndex, def);
assert(prev == def); // since findFunction() didn't find it
_unused(prev);
} else {
// Add parameters during parse even though the type info is unknown. At least
// we know the name of parameters and we can use this info to help distinguish
// function applications from variables followed by an expression
mContainerStack.back()->addDefParameter(nameIndex, def, nameLoc, CfdgError::Default);
}
return def;
}
void
Builder::CheckConfig(ASTdefine* cfg)
{
CFG cfgNum = CFDG::lookupCfg(cfg->mName);
if (cfgNum == CFG::AllowOverlap) {
double v = 0.0;
if (!cfg->mExpression || !cfg->mExpression->isConstant ||
cfg->mExpression->mType != NumericType ||
cfg->mExpression->evaluate(&v, 1) != 1)
{
yy::location loc = cfg->mExpression ? cfg->mExpression->where :
cfg->mLocation;
error(loc, "CF::AllowOverlap requires a constant numeric expression");
} else {
mAllowOverlap = v != 0.0;
}
}
}
void
Builder::MakeConfig(ASTdefine* cfg)
{
CFG cfgNum = CFDG::lookupCfg(cfg->mName);
if (cfgNum == CFG::Unknown) {
warning(cfg->mLocation, "Unknown configuration parameter");
return;
}
yy::location expLoc = cfg->mExpression ? cfg->mExpression->where : cfg->mLocation;
// Accessing this pointer via unique_ptr<>::operator*() inside typeid() causes
// problems with latest clang. So grab an unmanaged copy ahead of time and use the copy.
const ASTexpression* cfgExp = cfg->mExpression.get();
if (cfgNum == CFG::StartShape && cfgExp &&
typeid(*cfgExp) != typeid(ASTstartSpecifier))
{
// This code supports setting the startshape with a config statement:
// CF::StartShape = foo(foo params), [mods]
// It converts the ASTruleSpec and optional ASTmod to a single ASTstartSpec
ruleSpec_ptr rule;
mod_ptr mod;
ASTexpArray specAndMod = Extract(std::move(cfg->mExpression));
switch (specAndMod.size()) {
case 2: {
ASTmodification* temp_mod = dynamic_cast<ASTmodification*>(specAndMod[1].get());
if (!temp_mod) {
error(specAndMod[1]->where, "CF::StartShape second term must be a modification");
return;
}
specAndMod[1].release();
mod.reset(temp_mod);
}
// fall through
case 1: {
ASTruleSpecifier* temp_rule = dynamic_cast<ASTruleSpecifier*>(specAndMod[0].get());
if (!temp_rule) {
error(specAndMod[0]->where, "CF::StartShape must start with a shape specification");
return;
}
specAndMod[0].release();
rule.reset(temp_rule);
break;
}
default:
error(expLoc, "CF::StartShape expression must have the form shape_spec or shape_spec, [modification]");
return;
}
if (!mod)
mod = std::make_unique<ASTmodification>(expLoc);
cfg->mExpression = std::make_unique<ASTstartSpecifier>(std::move(rule), std::move(mod));
}
m_CFDG->addParameter(cfgNum, std::move(cfg->mExpression), cfg->mConfigDepth);
}
void
Builder::TypeCheckConfig(ASTdefine* cfg)
{
CFG cfgNum = CFDG::lookupCfg(cfg->mName);
yy::location expLoc = cfg->mExpression ? cfg->mExpression->where : cfg->mLocation;
if (cfgNum == CFG::Impure) {
double v = 0.0;
if (!cfg->mExpression || !cfg->mExpression->isConstant || cfg->mExpression->evaluate(&v, 1) != 1) {
error(expLoc, "CF::Impure requires a constant numeric expression");
} else {
m_CFDG->m_impure = v != 0.0;
}
}
if (cfgNum == CFG::MaxNatural && MaxNaturalDepth > cfg->mConfigDepth) {
auto max = cfg->mExpression.get();
double v = -1.0;
if (!max || !max->isConstant ||
max->mType != AST::NumericType ||
max->evaluate(&v, 1) != 1)
{
error(max ? max->where : cfg->mLocation, "CF::MaxNatural requires a constant numeric expression");
} else if (v < 1.0 || (v - 1.0) == v) {
error(max->where, (v < 1.0) ? "CF::MaxNatural must be >= 1" :
"CF::MaxNatural must be < 9007199254740992");
} else {
MaxNatural = v;
MaxNaturalDepth = cfg->mConfigDepth;
}
}
}
ASTexpression*
Builder::MakeVariable(const std::string& name, const yy::location& loc)
{
auto flagItem = FlagNames.find(name);
if (flagItem != FlagNames.end()) {
ASTreal* flag = new ASTreal(static_cast<double>(flagItem->second), loc);
flag->mType = AST::FlagType;
return flag;
}
if (strncmp(name.c_str(), "CF::", 4) == 0) {
error(loc, "Configuration parameter names are reserved");
return new ASTexpression(loc);
}
if (ASTfunction::GetFuncType(name) != ASTfunction::NotAFunction) {
error(loc, "Internal function names are reserved");
return new ASTexpression(loc);
}
int varNum = StringToShape(name, loc, true);
bool isGlobal = false;
const ASTparameter* bound = findExpression(varNum, isGlobal);
if (bound == nullptr) {
return new ASTruleSpecifier(varNum, name, nullptr, loc,
m_CFDG->getShapeParams(mCurrentShape));
}
ASTvariable* v = new ASTvariable(varNum, name, loc);
return v;
}
ASTexpression*
Builder::MakeArray(AST::str_ptr name, AST::exp_ptr args, const yy::location& nameLoc,
const yy::location& argsLoc)
{
if (strncmp(name->c_str(), "CF::", 4) == 0) {
error(nameLoc, "Configuration parameter names are reserved");
return args.release();
}
int varNum = StringToShape(*name, nameLoc, true);
bool isGlobal = false;
const ASTparameter* bound = findExpression(varNum, isGlobal);
if (bound == nullptr) {
error(nameLoc, "Cannot find variable or parameter with this name");
return args.release();
}
return new ASTarray(varNum, std::move(args), nameLoc + argsLoc, *name);
}
ASTexpression*
Builder::MakeLet(const yy::location& letLoc, AST::cont_ptr vars, exp_ptr exp)
{
std::string name("let");
int nameIndex = StringToShape(name, letLoc, false);
yy::location defLoc = exp ? exp->where : letLoc;
def_ptr def = std::make_unique<ASTdefine>(name, defLoc);
def->mShapeSpec.shapeType = nameIndex;
def->mExpression = std::move(exp);
def->mDefineType = ASTdefine::LetDefine;
return new ASTlet(std::move(vars), std::move(def), letLoc, defLoc);
}
ruleSpec_ptr
Builder::MakeRuleSpec(std::string& name, exp_ptr args,
const yy::location& loc, mod_ptr mod, bool makeStart)
{
if (name == "if" || name == "let" || name == "select") {
if (!args) {
error(loc, "Arguments required here");
return std::make_unique<ASTruleSpecifier>(0, name, std::move(args),
loc, nullptr);
}
// if and let are handled by the parser, select is handled here
if (name == "select") {
yy::location argsLoc = args->where;
args = std::make_unique<ASTselect>(std::move(args), argsLoc, false, this);
}
if (makeStart)
return std::make_unique<ASTstartSpecifier>(std::move(args), loc, std::move(mod));
else
return std::make_unique<ASTruleSpecifier>(std::move(args), loc);
}
int nameIndex = StringToShape(name, loc, true);
bool isGlobal = false;
const ASTparameter* bound = findExpression(nameIndex, isGlobal);
if (bound && args && args->mType == ReuseType && !makeStart && isGlobal && nameIndex == mCurrentShape)
warning(loc, "Shape name binds to global variable and current shape, using current shape");
if (bound && bound->isParameter && bound->mType == RuleType)
return std::make_unique<ASTruleSpecifier>(nameIndex, name, loc);
ruleSpec_ptr ret;
m_CFDG->setShapeHasNoParams(nameIndex, args.get());
if (makeStart)
ret = std::make_unique<ASTstartSpecifier>(nameIndex, name, std::move(args),
loc, std::move(mod));
else
ret = std::make_unique<ASTruleSpecifier>(nameIndex, name, std::move(args),
loc, m_CFDG->getShapeParams(mCurrentShape));
if (ret->arguments && ret->arguments->mType == ReuseType) {
if (makeStart)
error(loc, "Startshape cannot reuse parameters");
else if (nameIndex == mCurrentShape) {
ret->argSource = ASTruleSpecifier::SimpleParentArgs;
ret->typeSignature = ret->parentSignature;
}
}
return ret;
}
void
Builder::MakeModTerm(ASTtermArray& dest, term_ptr t)
{
if (!t) return;
if (t->modType == ASTmodTerm::time)
timeWise();
if (t->modType == ASTmodTerm::sat || t->modType == ASTmodTerm::satTarg)
inColor();
if (t->modType == ASTmodTerm::blend)
blended();
if (lexer->startToken == yy::CfdgParser::token_type::CFDG3 &&
t->modType >= ASTmodTerm::hueTarg && t->modType <= ASTmodTerm::targAlpha)
error(t->where, "Color target feature unavailable in v3 syntax");
dest.push_back(std::move(t));
}
ASTreplacement*
Builder::MakeElement(AST::str_ptr s, mod_ptr mods, exp_ptr params,
const yy::location& loc, bool subPath)
{
if (mInPathContainer && !subPath && (*s == "FILL" || *s == "STROKE"))
return new ASTpathCommand(*s, std::move(mods), std::move(params), loc);
ruleSpec_ptr r = MakeRuleSpec(*s, std::move(params), loc);
ASTreplacement::repElemListEnum t = ASTreplacement::replacement;
if (r->argSource == ASTruleSpecifier::ParentArgs)
r->argSource = ASTruleSpecifier::SimpleParentArgs;
if (mInPathContainer) {
bool isGlobal = false;
const ASTparameter* bound = findExpression(r->shapeType, isGlobal);
if (!subPath) {
error(loc, "Replacements are not allowed in paths");
} else if (r->argSource == ASTruleSpecifier::StackArgs ||
r->argSource == ASTruleSpecifier::ShapeArgs)
{
// Parameter subpaths must be all ops, but we must check at runtime
t = ASTreplacement::op;
} else if (m_CFDG->getShapeType(r->shapeType) == CFDGImpl::pathType) {
const ASTrule* rule = m_CFDG->findRule(r->shapeType);
if (rule && rule->mRuleBody.mRepType) {
t = static_cast<ASTreplacement::repElemListEnum>(rule->mRuleBody.mRepType);
} else {
// Recursive calls must be all ops, check at runtime
t = ASTreplacement::op;
}
} else if (bound) {
// Variable subpaths must be all ops, but we must check at runtime
t = ASTreplacement::op;
} else if (primShape::isPrimShape(r->shapeType)){
t = ASTreplacement::op;
} else {
// Forward calls must be all ops, check at runtime
t = ASTreplacement::op;
}
}
return new ASTreplacement(std::move(r), std::move(mods), loc, t);
}
AST::ASTexpression*
Builder::MakeFunction(str_ptr name, exp_ptr args, const yy::location& nameLoc,
const yy::location& argsLoc, bool consAllowed)
{
int nameIndex = StringToShape(*name, nameLoc, true);
bool dummy;
const ASTparameter* bound = findExpression(nameIndex, dummy);
if (bound) {
if (!consAllowed)
error(nameLoc + argsLoc, "Cannot bind expression to variable/parameter");
return MakeVariable(*name, nameLoc)->append(args.release());
}
if (*name == "select" || *name == "if")
return new ASTselect(std::move(args), nameLoc + argsLoc, *name == "if", this);
ASTfunction::FuncType t = ASTfunction::GetFuncType(*name);
if (t == ASTfunction::Ftime || t == ASTfunction::Frame)
m_CFDG->addParameter(CFDGImpl::FrameTime);
if (t != ASTfunction::NotAFunction)
return new ASTfunction(*name, std::move(args), mSeed, nameLoc, argsLoc, this);
// If args are parameter reuse args then it must be a rule spec
if (args && args->mType == ReuseType)
return MakeRuleSpec(*name, std::move(args), nameLoc + argsLoc).release();
// At this point we don't know if this is a typo or a to-be-defined shape or
// user function. Return an ASTuserFunction and fix it up during type check.
return new ASTuserFunction(nameIndex, args.release(), nullptr, nameLoc);
}
AST::ASTmodification*
Builder::MakeModification(mod_ptr mod, const yy::location& loc, bool canonical)
{
if (mod) {
mod->isConstant = mod->modExp.empty();
mod->where = loc;
mod->canonical = canonical;
}
return mod.release();
}
std::string
Builder::GetTypeInfo(int name, AST::ASTdefine*& func, const AST::ASTparameters*& p)
{
func = m_CFDG->findFunction(name);
p = m_CFDG->getShapeParams(name);
return m_CFDG->decodeShapeName(name);
}
const AST::ASTrule*
Builder::GetRule(int name)
{
return m_CFDG->findRule(name);
}
void
Builder::push_repContainer(ASTrepContainer& c)
{
mContainerStack.push_back(&c);
mStackStack.push_back(mLocalStackDepth);
process_repContainer(c);
}
void
Builder::process_repContainer(ASTrepContainer& c)
{
for (ASTparameter& param: c.mParameters) {
if (param.isParameter || param.isLoopIndex) {
param.mStackIndex = mLocalStackDepth;
mLocalStackDepth += param.mTuplesize;
} else {
break; // the parameters are all in front
}
}
}
void
Builder::pop_repContainer(ASTreplacement* r)
{
if (m_CFDG) m_CFDG->reportStackDepth(mLocalStackDepth);
assert(!mContainerStack.empty());
ASTrepContainer* lastContainer = mContainerStack.back();
mLocalStackDepth = mStackStack.back();
if (r) {
r->mRepType |= lastContainer->mRepType;
if (r->mPathOp == unknownPathop)
r->mPathOp = lastContainer->mPathOp;
}
mContainerStack.pop_back();
mStackStack.pop_back();
}
static bool badContainer(int containerType)
{
return (containerType & (ASTreplacement::op | ASTreplacement::replacement)) ==
(ASTreplacement::op | ASTreplacement::replacement);
}
void
Builder::push_rep(ASTreplacement* r, bool global)
{
if (r == nullptr) return;
ASTrepContainer* container = mContainerStack.back();
container->mBody.emplace_back(r);
if (container->mPathOp == unknownPathop)
container->mPathOp = r->mPathOp;
int oldType = container->mRepType;
container->mRepType = oldType | r->mRepType;
if (badContainer(container->mRepType) && !badContainer(oldType) && !global)
error(r->mLocation, "Cannot mix path elements and replacements in the same container");
}
ASTparameter*
Builder::findExpression(int nameIndex, bool& isGlobal)
{
for (auto&& container: backwards(mContainerStack))
for (auto&& param: backwards(container->mParameters))
if (param.mName == nameIndex) {
isGlobal = container->isGlobal;
return ¶m;
}
return nullptr;
}
void
Builder::PushNameSpace(AST::str_ptr n, const yy::location& loc)
{
if (n->compare("CF") == 0) {
error(loc, "CF namespace is reserved");
return;
}
if (n->length() == 0) {
error(loc, "zero-length namespace");
return;
}
CheckName(*n, loc, false);
m_includeNamespace.top() = true;
mCurrentNameSpace.append(*n);
mCurrentNameSpace.append("::");
} // delete n
void
Builder::PopNameSpace()
{
mCurrentNameSpace.resize(mCurrentNameSpace.length() - 2);
std::size_t end = mCurrentNameSpace.find_last_of(':');
if (end == std::string::npos) {
mCurrentNameSpace.clear();
} else {
mCurrentNameSpace.resize(end + 1);
}
}
void
Builder::CheckVariableName(int index, const yy::location& loc, bool isParam)
{
if (mAllowOverlap && !isParam) return;
const ASTrepContainer* thisLevel = isParam ? &mParamDecls : mContainerStack.back();
for (auto&& param: backwards(thisLevel->mParameters))
if (param.mName == index) {
warning(loc, "Scope of name overlaps variable/parameter with same name");
warning(param.mLocation, "previous variable/parameter declared here");
}
}
void
Builder::CheckName(const std::string& name, const yy::location& loc,
bool colonsAllowed)
{
std::size_t pos = name.find_first_of(':');
if (pos == std::string::npos) return;
if (!colonsAllowed) {
error(loc, "namespace specification not allowed in this context");
return;
}
if (pos == 0) {
error(loc, "improper namespace specification");
return;
}
for(;;) {
if (pos == name.length() - 1 || name[pos + 1] != ':') break;
std::size_t next = name.find_first_of(':', pos + 2);
if (next == std::string::npos) return;
if (next == pos + 2) break;
pos = next;
}
error(loc, "improper namespace specification");
}
void
Builder::inColor()
{
m_CFDG->addParameter(CFDGImpl::Color);
}
void
Builder::timeWise()
{
m_CFDG->addParameter(CFDGImpl::Time);
}
void
Builder::blended()
{
m_CFDG->addParameter(CFDGImpl::Blend);
}
bool
Builder::impure() const noexcept
{
return m_CFDG->m_impure;
}
|