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
|
#include <list>
#include <algorithm>
#include "rangeestimation.hh"
#include "optimize.hh" // for DEBUG_SUBSTITUTIONS
#include "codetree.hh"
#include "consts.hh"
#ifdef FP_SUPPORT_OPTIMIZER
using namespace FUNCTIONPARSERTYPES;
//using namespace FPoptimizer_Grammar;
namespace
{
#ifdef DEBUG_SUBSTITUTIONS
void OutFloatHex(std::ostream& o, double d)
{
union { double d; uint_least64_t h; } data;
data.d = d;
o << "(" << std::hex << data.h << std::dec << ")";
}
#ifdef FP_SUPPORT_FLOAT_TYPE
void OutFloatHex(std::ostream& o, float f)
{
union { float f; uint_least32_t h; } data;
data.f = f;
o << "(" << std::hex << data.h << std::dec << ")";
}
#endif
#ifdef FP_SUPPORT_LONG_DOUBLE_TYPE
void OutFloatHex(std::ostream& o, long double ld)
{
union { long double ld;
struct { uint_least64_t a; unsigned short b; } s; } data;
data.ld = ld;
o << "(" << std::hex << data.s.b << data.s.a << std::dec << ")";
}
#endif
#ifdef FP_SUPPORT_LONG_INT_TYPE
void OutFloatHex(std::ostream& o, long ld)
{
o << "(" << std::hex << ld << std::dec << ")";
}
#endif
#endif
}
namespace FPoptimizer_CodeTree
{
template<typename Value_t>
CodeTree<Value_t>::CodeTree()
: data(new CodeTreeData<Value_t> ()) // sets opcode to cNop
{
}
template<typename Value_t>
CodeTree<Value_t>::CodeTree(const Value_t& i, typename CodeTree<Value_t>::ImmedTag)
: data(new CodeTreeData<Value_t>(i))
{
data->Recalculate_Hash_NoRecursion();
}
#if defined(__GXX_EXPERIMENTAL_CXX0X__) || __cplusplus >= 201103L
template<typename Value_t>
CodeTree<Value_t>::CodeTree(Value_t&& i, typename CodeTree<Value_t>::ImmedTag)
: data(new CodeTreeData<Value_t>(std::move(i)))
{
data->Recalculate_Hash_NoRecursion();
}
#endif
template<typename Value_t>
CodeTree<Value_t>::CodeTree(unsigned v, typename CodeTree<Value_t>::VarTag)
: data(new CodeTreeData<Value_t> (VarBegin, v))
{
data->Recalculate_Hash_NoRecursion();
}
template<typename Value_t>
CodeTree<Value_t>::CodeTree(FUNCTIONPARSERTYPES::OPCODE o, typename CodeTree<Value_t>::OpcodeTag)
: data(new CodeTreeData<Value_t> (o))
{
data->Recalculate_Hash_NoRecursion();
}
template<typename Value_t>
CodeTree<Value_t>::CodeTree(FUNCTIONPARSERTYPES::OPCODE o, unsigned f, typename CodeTree<Value_t>::FuncOpcodeTag)
: data(new CodeTreeData<Value_t> (o, f))
{
data->Recalculate_Hash_NoRecursion();
}
template<typename Value_t>
CodeTree<Value_t>::CodeTree(const CodeTree<Value_t>& b, typename CodeTree<Value_t>::CloneTag)
: data(new CodeTreeData<Value_t>(*b.data))
{
}
template<typename Value_t>
CodeTree<Value_t>::~CodeTree()
{
}
template<typename Value_t>
void CodeTree<Value_t>::ReplaceWithImmed(const Value_t& i)
{
#ifdef DEBUG_SUBSTITUTIONS
std::cout << "Replacing "; DumpTree(*this);
if(IsImmed())
OutFloatHex(std::cout, GetImmed());
std::cout << " with const value " << i;
OutFloatHex(std::cout, i);
std::cout << "\n";
#endif
data = new CodeTreeData<Value_t> (i);
}
template<typename Value_t>
struct ParamComparer
{
bool operator() (const CodeTree<Value_t>& a, const CodeTree<Value_t>& b) const
{
if(a.GetDepth() != b.GetDepth())
return a.GetDepth() < b.GetDepth();
return a.GetHash() < b.GetHash();
}
};
template<typename Value_t>
void CodeTreeData<Value_t>::Sort()
{
/* If the tree is commutative, order the parameters
* in a set order in order to make equality tests
* efficient in the optimizer
*/
switch(Opcode)
{
case cAdd:
case cMul:
case cMin:
case cMax:
case cAnd: case cAbsAnd:
case cOr: case cAbsOr:
case cHypot:
case cEqual:
case cNEqual:
std::sort(Params.begin(), Params.end(), ParamComparer<Value_t>());
break;
case cLess:
if(ParamComparer<Value_t>() (Params[1], Params[0]))
{ std::swap(Params[0], Params[1]); Opcode = cGreater; }
break;
case cLessOrEq:
if(ParamComparer<Value_t>() (Params[1], Params[0]))
{ std::swap(Params[0], Params[1]); Opcode = cGreaterOrEq; }
break;
case cGreater:
if(ParamComparer<Value_t>() (Params[1], Params[0]))
{ std::swap(Params[0], Params[1]); Opcode = cLess; }
break;
case cGreaterOrEq:
if(ParamComparer<Value_t>() (Params[1], Params[0]))
{ std::swap(Params[0], Params[1]); Opcode = cLessOrEq; }
break;
/*
case cDiv:
if(ParamComparer<Value_t>() (Params[1], Params[0]))
{ std::swap(Params[0], Params[1]); Opcode = cRDiv; }
break;
case cRDiv:
if(ParamComparer<Value_t>() (Params[1], Params[0]))
{ std::swap(Params[0], Params[1]); Opcode = cDiv; }
break;
case cSub:
if(ParamComparer<Value_t>() (Params[1], Params[0]))
{ std::swap(Params[0], Params[1]); Opcode = cRSub; }
break;
case cRSub:
if(ParamComparer<Value_t>() (Params[1], Params[0]))
{ std::swap(Params[0], Params[1]); Opcode = cSub; }
break;
*/
default:
break;
}
}
template<typename Value_t>
void CodeTree<Value_t>::AddParam(const CodeTree<Value_t>& param)
{
//std::cout << "AddParam called\n";
data->Params.push_back(param);
}
template<typename Value_t>
void CodeTree<Value_t>::AddParamMove(CodeTree<Value_t>& param)
{
data->Params.push_back(CodeTree<Value_t>());
data->Params.back().swap(param);
}
template<typename Value_t>
void CodeTree<Value_t>::SetParam(size_t which, const CodeTree<Value_t>& b)
{
DataP slot_holder ( data->Params[which].data );
data->Params[which] = b;
}
template<typename Value_t>
void CodeTree<Value_t>::SetParamMove(size_t which, CodeTree<Value_t>& b)
{
DataP slot_holder ( data->Params[which].data );
data->Params[which].swap(b);
}
template<typename Value_t>
void CodeTree<Value_t>::AddParams(const std::vector<CodeTree<Value_t> >& RefParams)
{
data->Params.insert(data->Params.end(), RefParams.begin(), RefParams.end());
}
template<typename Value_t>
void CodeTree<Value_t>::AddParamsMove(std::vector<CodeTree<Value_t> >& RefParams)
{
size_t endpos = data->Params.size(), added = RefParams.size();
data->Params.resize(endpos + added, CodeTree<Value_t>());
for(size_t p=0; p<added; ++p)
data->Params[endpos+p].swap( RefParams[p] );
}
template<typename Value_t>
void CodeTree<Value_t>::AddParamsMove(std::vector<CodeTree<Value_t> >& RefParams, size_t replacing_slot)
{
DataP slot_holder ( data->Params[replacing_slot].data );
DelParam(replacing_slot);
AddParamsMove(RefParams);
/*
const size_t n_added = RefParams.size();
const size_t oldsize = data->Params.size();
const size_t newsize = oldsize + n_added - 1;
if(RefParams.empty())
DelParam(replacing_slot);
else
{
// 0 1 2 3 4 5 6 7 8 9 10 11
// a a a a X b b b b b
// a a a a Y Y Y b b b b b
//
// replacing_slot = 4
// n_added = 3
// oldsize = 10
// newsize = 12
// tail_length = 5
data->Params.resize(newsize);
data->Params[replacing_slot].data = 0;
const size_t tail_length = oldsize - replacing_slot -1;
for(size_t tail=0; tail<tail_length; ++tail)
data->Params[newsize-1-tail].data.UnsafeSetP(
&*data->Params[newsize-1-tail-(n_added-1)].data);
for(size_t head=1; head<n_added; ++head)
data->Params[replacing_slot+head].data.UnsafeSetP( 0 );
for(size_t p=0; p<n_added; ++p)
data->Params[replacing_slot+p].swap( RefParams[p] );
}
*/
}
template<typename Value_t>
void CodeTree<Value_t>::SetParams(const std::vector<CodeTree<Value_t> >& RefParams)
{
//std::cout << "SetParams called" << (do_clone ? ", clone" : ", no clone") << "\n";
std::vector<CodeTree<Value_t> > tmp(RefParams);
data->Params.swap(tmp);
}
template<typename Value_t>
void CodeTree<Value_t>::SetParamsMove(std::vector<CodeTree<Value_t> >& RefParams)
{
data->Params.swap(RefParams);
RefParams.clear();
}
#if defined(__GXX_EXPERIMENTAL_CXX0X__) || __cplusplus >= 201103L
template<typename Value_t>
void CodeTree<Value_t>::SetParams(std::vector<CodeTree<Value_t> >&& RefParams)
{
//std::cout << "SetParams&& called\n";
SetParamsMove(RefParams);
}
#endif
template<typename Value_t>
void CodeTree<Value_t>::DelParam(size_t index)
{
std::vector<CodeTree<Value_t> >& Params = data->Params;
//std::cout << "DelParam(" << index << ") called\n";
#if defined(__GXX_EXPERIMENTAL_CXX0X__) || __cplusplus >= 201103L
/* rvalue reference semantics makes this optimal */
Params.erase( Params.begin() + index );
#else
/* This labor evades the need for refcount +1/-1 shuffling */
Params[index].data = 0;
for(size_t p=index; p+1<Params.size(); ++p)
Params[p].data.UnsafeSetP( Params[p+1].data.get() );
Params[Params.size()-1].data.UnsafeSetP( 0 );
Params.resize(Params.size()-1);
#endif
}
template<typename Value_t>
void CodeTree<Value_t>::DelParams()
{
data->Params.clear();
}
template<typename Value_t>
bool CodeTree<Value_t>::IsIdenticalTo(const CodeTree<Value_t>& b) const
{
//if(data.isnull() != b.data.isnull()) return false;
if(data.get() == b.data.get()) return true;
return data->IsIdenticalTo(*b.data);
}
template<typename Value_t>
bool CodeTreeData<Value_t>::IsIdenticalTo(const CodeTreeData<Value_t>& b) const
{
if(Hash != b.Hash) return false; // a quick catch-all
if(Opcode != b.Opcode) return false;
switch(Opcode)
{
case cImmed: return fp_equal(Value, b.Value);
case VarBegin: return Var_or_Funcno == b.Var_or_Funcno;
case cFCall:
case cPCall: if(Var_or_Funcno != b.Var_or_Funcno) return false; break;
default: break;
}
if(Params.size() != b.Params.size()) return false;
for(size_t a=0; a<Params.size(); ++a)
{
if(!Params[a].IsIdenticalTo(b.Params[a])) return false;
}
return true;
}
template<typename Value_t>
void CodeTree<Value_t>::Become(const CodeTree<Value_t>& b)
{
if(&b != this && data.get() != b.data.get())
{
DataP tmp = b.data;
CopyOnWrite();
data.swap(tmp);
}
}
template<typename Value_t>
void CodeTree<Value_t>::CopyOnWrite()
{
if(GetRefCount() > 1)
data = new CodeTreeData<Value_t>(*data);
}
template<typename Value_t>
CodeTree<Value_t> CodeTree<Value_t>::GetUniqueRef()
{
if(GetRefCount() > 1)
return CodeTree<Value_t>(*this, CloneTag());
return *this;
}
template<typename Value_t>
CodeTreeData<Value_t>::CodeTreeData()
: RefCount(0),
Opcode(cNop),
Value(), Var_or_Funcno(),
Params(), Hash(), Depth(1), OptimizedUsing(0)
{
}
template<typename Value_t>
CodeTreeData<Value_t>::CodeTreeData(const CodeTreeData& b)
: RefCount(0),
Opcode(b.Opcode),
Value(b.Value),
Var_or_Funcno(b.Var_or_Funcno),
Params(b.Params),
Hash(b.Hash),
Depth(b.Depth),
OptimizedUsing(b.OptimizedUsing)
{
}
template<typename Value_t>
CodeTreeData<Value_t>::CodeTreeData(const Value_t& i)
: RefCount(0),
Opcode(cImmed),
Value(i), Var_or_Funcno(),
Params(), Hash(), Depth(1), OptimizedUsing(0)
{
}
#if defined(__GXX_EXPERIMENTAL_CXX0X__) || __cplusplus >= 201103L
template<typename Value_t>
CodeTreeData<Value_t>::CodeTreeData(CodeTreeData<Value_t>&& b)
: RefCount(0),
Opcode(b.Opcode),
Value(std::move(b.Value)),
Var_or_Funcno(b.Var_or_Funcno),
Params(std::move(b.Params)),
Hash(b.Hash),
Depth(b.Depth),
OptimizedUsing(b.OptimizedUsing)
{
}
template<typename Value_t>
CodeTreeData<Value_t>::CodeTreeData(Value_t&& i)
: RefCount(0),
Opcode(cImmed),
Value(std::move(i)), Var_or_Funcno(),
Params(), Hash(), Depth(1), OptimizedUsing(0)
{
}
#endif
template<typename Value_t>
CodeTreeData<Value_t>::CodeTreeData(FUNCTIONPARSERTYPES::OPCODE o)
: RefCount(0),
Opcode(o),
Value(), Var_or_Funcno(),
Params(), Hash(), Depth(1), OptimizedUsing(0)
{
}
template<typename Value_t>
CodeTreeData<Value_t>::CodeTreeData(FUNCTIONPARSERTYPES::OPCODE o, unsigned f)
: RefCount(0),
Opcode(o),
Value(), Var_or_Funcno(f),
Params(), Hash(), Depth(1), OptimizedUsing(0)
{
}
}
/* BEGIN_EXPLICIT_INSTANTATION */
#include "instantiate.hh"
namespace FPoptimizer_CodeTree
{
#define FP_INSTANTIATE(type) \
template class CodeTree<type>; \
template struct CodeTreeData<type>;
FPOPTIMIZER_EXPLICITLY_INSTANTIATE(FP_INSTANTIATE)
#undef FP_INSTANTIATE
}
/* END_EXPLICIT_INSTANTATION */
#endif
|
