File: stacktype.h

package info (click to toggle)
contextfree 3.4%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 3,260 kB
  • sloc: cpp: 37,992; lex: 414; makefile: 123; sh: 43; python: 34
file content (322 lines) | stat: -rw-r--r-- 8,236 bytes parent folder | download | duplicates (2)
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
// stacktype.h
// this file is part of Context Free
// ---------------------
// Copyright (C) 2011-2015 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
//
//

#ifndef INCLUDE_STACKTYPE_H
#define INCLUDE_STACKTYPE_H

#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS
#endif
#include <cstdint>
#include <vector>
#include <iosfwd>
#include "ast.h"

//#define EXTREME_PARAM_DEBUG

#ifdef EXTREME_PARAM_DEBUG
#include <map>
#endif

namespace AST { class ASTparameter; class ASTexpression; }

union StackType;
struct StackRule;
class RendererAST;

template <class _stack>
class StackTypeIterator {
public:
    _stack* _Ptr;
    AST::ASTparameters::const_iterator _Iter;
    AST::ASTparameters::const_iterator _End;
    
    StackTypeIterator() : _Ptr(nullptr) {}
    StackTypeIterator(const StackTypeIterator& o)
    : _Ptr(o._Ptr), _Iter(o._Iter), _End(o._End) {}
    StackTypeIterator(_stack* s, const AST::ASTparameters* p)
    : _Ptr(s)
    {
        if (_Ptr && p) {
            _Iter = p->begin();
            _End = p->end();
            if (_Iter == _End)
                _Ptr = nullptr;           // Should never happen
        }
    }
    
    _stack& operator*() { return *_Ptr; }
    _stack* operator->() { return _Ptr; }
    
    StackTypeIterator& operator++()
    {
        if (_Ptr) {
            _Ptr += _Iter->mTuplesize;
            ++_Iter;
            if (_Iter == _End)
                _Ptr = nullptr;
        }
        return *this;
    }
    
    StackTypeIterator& operator++(int)
    {
        StackTypeIterator tmp = *this;
        ++(*this);
        return tmp;
    }
    
    bool operator==(const StackTypeIterator& o) const noexcept { return _Ptr == o._Ptr; }
    bool operator!=(const StackTypeIterator& o) const noexcept { return _Ptr != o._Ptr; }
    
    StackTypeIterator& operator=(const StackTypeIterator& o)
    {
        if (this == &o) return *this;
        _Ptr = o._Ptr;
        _Iter = o._Iter;
        _End = o._End;
        return *this;
    }
    
    const AST::ASTparameter& type() const { return *_Iter; }
};


class param_ptr {
    const StackRule*  mPtr = nullptr;
public:
    param_ptr() = default;
    param_ptr(std::nullptr_t) { }
    param_ptr(const StackRule* r);
    param_ptr(const param_ptr& o);
    param_ptr(param_ptr&& o) noexcept : mPtr(o.mPtr)
    { o.mPtr = nullptr; }
    ~param_ptr();
    
    param_ptr& operator=(const param_ptr& o);
    param_ptr& operator=(param_ptr&& o) noexcept;
    param_ptr& operator=(std::nullptr_t);
    
    explicit operator bool() const
    { return mPtr != nullptr; }
    
    void reset(StackRule* r = nullptr);
    const StackRule* release()
    {
        const StackRule* ret = mPtr;
        mPtr = nullptr;
        return ret;
    }
    void swap(param_ptr& o)
    {
        auto temp = mPtr;
        mPtr = o.mPtr;
        o.mPtr = temp;
    }
    
    const StackRule* get() const
    { return mPtr; }
    
    const StackRule& operator*() const
    { return *mPtr; }
    
    const StackRule* operator->() const
    { return mPtr; }
};


struct StackRule {
    enum const_t : std::uint32_t { MaxRefCount = UINT32_MAX, HeaderSize = 2 };

    using iterator       = StackTypeIterator<StackType>;
    using const_iterator = StackTypeIterator<const StackType>;
    
    std::int16_t     mRuleName;
    std::uint16_t    mParamCount;
    mutable std::uint32_t    mRefCount;
    
    bool operator==(const StackRule& o) const;
    static bool Equal(const StackRule* a, const StackRule* b);
    
    static StackRule*  alloc(int name, int size, const AST::ASTparameters* ti);
    static StackRule*  alloc(const StackRule* from, int newName = -1);
private:
    void        release() const noexcept;
    void        retain() const noexcept;
public:
    friend class param_ptr;     // only param_ptr can change the refcount
    void        copyParams(StackType* dest) const;
    
    
    static param_ptr   Read(std::istream& is);
    static void        Write(std::ostream& os, const StackRule* s);
    
    void        evalArgs(RendererAST* rti, const AST::ASTexpression* arguments,
                         const StackRule* parent);
    
#ifdef EXTREME_PARAM_DEBUG
    static std::map<const StackRule*, int> ParamMap;
    static int ParamUID;
    static int ParamOfInterest;
#endif

    iterator begin();
    const_iterator begin() const;
    const_iterator cbegin();
    iterator end()
    { return iterator(); }
    const_iterator cend()
    { return const_iterator(); }
    const_iterator end() const
    { return const_iterator(); }

private:
    void        read(std::istream& is);
    void        write(std::ostream& os) const;
};

#ifdef _MSC_VER
#pragma warning(disable:4582 4583)
#endif

union StackType {
	using iterator = StackTypeIterator<StackType>;
	using const_iterator = StackTypeIterator<const StackType>;

    StackType() {};
    ~StackType() {};
    
    double      number;
    param_ptr   rule;
    StackRule   ruleHeader;
    const AST::ASTparameters* typeInfo;

    void        destroy(const AST::ASTparameters* p) const;

    void        evalArgs(RendererAST* rti, const AST::ASTexpression* arguments,
                         const AST::ASTparameters* p, bool sequential);
    
    iterator begin(const AST::ASTparameters* p)
    { return iterator(this, p); }
    const_iterator cbegin(const AST::ASTparameters* p)
    { return const_iterator(this, p); }
    const_iterator begin(const AST::ASTparameters* p) const
    { return const_iterator(this, p); }
    iterator end()
    { return iterator(); }
    const_iterator cend()
    { return const_iterator(); }
    const_iterator end() const
    { return const_iterator(); }
};

inline StackRule::iterator
StackRule::begin()
{
    if (mParamCount) {
        auto st = reinterpret_cast<StackType*>(this);
        return iterator(st + HeaderSize, st[1].typeInfo);
    }
    return iterator();
}

inline StackRule::const_iterator
StackRule::begin() const
{
    if (mParamCount) {
        auto st = reinterpret_cast<const StackType*>(this);
        return const_iterator(st + HeaderSize, st[1].typeInfo);
    }
    return const_iterator();
}

inline StackRule::const_iterator
StackRule::cbegin()
{
    if (mParamCount) {
        auto st = reinterpret_cast<const StackType*>(this);
        return const_iterator(st + HeaderSize, st[1].typeInfo);
    }
    return const_iterator();
}

inline param_ptr::param_ptr(const StackRule* r) : mPtr(r)
{
    if (mPtr)
        mPtr->retain();
}

inline param_ptr::param_ptr(const param_ptr& o) : mPtr(o.mPtr)
{
    if (mPtr)
        mPtr->retain();
}

inline param_ptr::~param_ptr()
{
    if (mPtr)
        mPtr->release();
}

inline param_ptr& param_ptr::operator=(const param_ptr& o)
{
    if (this == &o || mPtr == o.mPtr)
        return *this;
    if (mPtr)
        mPtr->release();
    mPtr = o.mPtr;
    if (mPtr)
        mPtr->retain();
    return *this;
}

inline param_ptr& param_ptr::operator=(param_ptr&& o) noexcept
{
    if (this == &o || mPtr == o.mPtr)
        return *this;
    if (mPtr)
        mPtr->release();
    mPtr = o.mPtr;
    o.mPtr = nullptr;
    return *this;
}

inline param_ptr& param_ptr::operator=(std::nullptr_t)
{
    if (mPtr)
        mPtr->release();
    mPtr = nullptr;
    return *this;
}

inline void param_ptr::reset(StackRule* r)
{
    if (mPtr)
        mPtr->release();
    mPtr = r;
    if (mPtr)
        mPtr->retain();
}

#endif // INCLUDE_STACKTYPE_H