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
|
// rendererAST.cpp
// this file is part of Context Free
// ---------------------
// Copyright (C) 2013-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
//
//
#include "rendererAST.h"
#include "builder.h"
#include <cassert>
RendererAST::RendererAST(int w, int h)
: Renderer(w, h)
{ }
RendererAST::~RendererAST() = default;
void
RendererAST::ColorConflict(RendererAST* r, const yy::location& w)
{
if (r)
r->colorConflict(w);
else
CfdgError::Warning(w, "Conflicting color change");
}
void
RendererAST::init()
{
mLastPoint.x = mLastPoint.y = 0.0;
mStop = false;
mClosed = false;
mWantMoveTo = true;
mWantCommand = true;
mOpsOnly = false;
mIndex = mNextIndex = 0;
}
bool
RendererAST::isNatural(RendererAST* r, double n)
{
if (r && r->mImpure) return true;
std::lock_guard<std::recursive_mutex> lock(Builder::BuilderMutex);
if (Builder::CurrentBuilder &&
Builder::CurrentBuilder->isMyBuilder() &&
Builder::CurrentBuilder->impure()) return true;
return n >= 0 && n <= (r ? r->mMaxNatural : Builder::MaxNatural) && n == std::floor(n);
}
void
RendererAST::initStack(const StackRule* p)
{
if (p && p->mParamCount) {
if (mStackSize + p->mParamCount > mCFstack.size())
throw CfdgError("Maximum stack size exceeded");
std::size_t oldSize = mStackSize;
mStackSize += p->mParamCount;
p->copyParams(mCFstack.data() + oldSize);
}
mLogicalStackTop = mCFstack.data() + mStackSize;
}
void
RendererAST::unwindStack(std::size_t oldsize, const std::vector<AST::ASTparameter>& params)
{
if (oldsize == mStackSize)
return;
assert(mStackSize > 0);
std::size_t pos = oldsize;
for (const AST::ASTparameter& param: params) {
if (pos >= mStackSize)
break; // no guarantee entire frame was computed
if (param.isLoopIndex || param.mStackIndex < 0) continue;
// loop indices are unwound in ASTloop::traverse()
// and <0 stack index indicates that the param isn't on the stack
// (i.e., function, constant, or config var)
if (param.mType == AST::RuleType)
mCFstack[pos].rule.~param_ptr();
pos += param.mTuplesize;
}
mStackSize = oldsize;
mLogicalStackTop = mCFstack.data() + mStackSize;
}
|
