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
|
#include <list>
#include <algorithm>
#include "constantfolding.hh"
#include "codetree.hh"
#include "extrasrc/fptypes.hh"
#include "../lib/crc32.hh"
#ifdef FP_SUPPORT_OPTIMIZER
using namespace FUNCTIONPARSERTYPES;
//using namespace FPoptimizer_Grammar;
namespace
{
template<typename Value_t>
bool MarkIncompletes(FPoptimizer_CodeTree::CodeTree<Value_t>& tree)
{
if(tree.Is_Incompletely_Hashed())
return true;
bool needs_rehash = false;
for(size_t a=0; a<tree.GetParamCount(); ++a)
needs_rehash |= MarkIncompletes(tree.GetParam(a));
if(needs_rehash)
tree.Mark_Incompletely_Hashed();
return needs_rehash;
}
template<typename Value_t>
void FixIncompletes(FPoptimizer_CodeTree::CodeTree<Value_t>& tree)
{
if(tree.Is_Incompletely_Hashed())
{
for(size_t a=0; a<tree.GetParamCount(); ++a)
FixIncompletes(tree.GetParam(a));
tree.Rehash();
}
}
}
namespace FPoptimizer_CodeTree
{
template<typename Value_t>
void CodeTree<Value_t>::Sort()
{
data->Sort();
}
template<typename Value_t>
void CodeTree<Value_t>::Rehash(bool constantfolding)
{
if(constantfolding)
ConstantFolding(*this); // also runs Sort()
else
Sort();
data->Recalculate_Hash_NoRecursion();
}
template<typename Value_t>
struct ImmedHashGenerator
{
static void MakeHash(
FUNCTIONPARSERTYPES::fphash_t& NewHash,
const Value_t& Value)
{
/* TODO: For non-POD types, convert the value
* into a base-62 string (or something) and hash that.
*/
NewHash.hash1 = 0; // Try to ensure immeds gets always sorted first
#if 0
long double value = Value;
fphash_value_t key = crc32::calc((const unsigned char*)&value, sizeof(value));
key ^= (key << 24);
#elif 0
union
{
struct
{
unsigned char filler1[16];
Value_t v;
unsigned char filler2[16];
} buf2;
struct
{
unsigned char filler3[sizeof(Value_t)+16-sizeof(fphash_value_t)];
fphash_value_t key;
} buf1;
} data;
memset(&data, 0, sizeof(data));
data.buf2.v = Value;
fphash_value_t key = data.buf1.key;
#else
int exponent;
Value_t fraction = std::frexp(Value, &exponent);
fphash_value_t key = (unsigned(exponent+0x8000) & 0xFFFF);
if(fraction < 0)
{ fraction = -fraction; key = key^0xFFFF; }
else
key += 0x10000;
fraction -= Value_t(0.5);
key <<= 39; // covers bits 39..55 now
key |= fphash_value_t((fraction+fraction) * Value_t(1u<<31)) << 8;
// fraction covers bits 8..39 now
#endif
/* Key = 56-bit unsigned integer value
* that is directly proportional
* to the floating point value.
*/
NewHash.hash1 |= key;
//crc32_t crc = crc32::calc((const unsigned char*)&Value, sizeof(Value));
fphash_value_t crc = (key >> 10) | (key << (64-10));
NewHash.hash2 += ((~fphash_value_t(crc)) * 3) ^ 1234567;
}
};
#ifdef FP_SUPPORT_COMPLEX_NUMBERS
template<typename T>
struct ImmedHashGenerator< std::complex<T> >
{
static void MakeHash(
FUNCTIONPARSERTYPES::fphash_t& NewHash,
const std::complex<T>& Value)
{
ImmedHashGenerator<T>::MakeHash(NewHash, Value.real());
FUNCTIONPARSERTYPES::fphash_t temp;
ImmedHashGenerator<T>::MakeHash(temp, Value.imag());
NewHash.hash1 ^= temp.hash2;
NewHash.hash2 ^= temp.hash1;
}
};
#endif
#ifdef FP_SUPPORT_LONG_INT_TYPE
template<>
struct ImmedHashGenerator<long>
{
static void MakeHash(
FUNCTIONPARSERTYPES::fphash_t& NewHash,
long Value)
{
fphash_value_t key = Value;
/* Key = 56-bit unsigned integer value
* that is directly proportional
* to the floating point value.
*/
NewHash.hash1 |= key;
//crc32_t crc = crc32::calc((const unsigned char*)&Value, sizeof(Value));
fphash_value_t crc = (key >> 10) | (key << (64-10));
NewHash.hash2 += ((~fphash_value_t(crc)) * 3) ^ 1234567;
}
};
#endif
#ifdef FP_SUPPORT_GMP_INT_TYPE
template<>
struct ImmedHashGenerator<GmpInt>
{
static void MakeHash(
FUNCTIONPARSERTYPES::fphash_t& NewHash,
const GmpInt& Value)
{
fphash_value_t key = Value.toInt();
/* Key = 56-bit unsigned integer value
* that is directly proportional
* to the floating point value.
*/
NewHash.hash1 |= key;
//crc32_t crc = crc32::calc((const unsigned char*)&Value, sizeof(Value));
fphash_value_t crc = (key >> 10) | (key << (64-10));
NewHash.hash2 += ((~fphash_value_t(crc)) * 3) ^ 1234567;
}
};
#endif
template<typename Value_t>
void CodeTreeData<Value_t>::Recalculate_Hash_NoRecursion()
{
/* Hash structure:
* hash1: sorting key (8 bytes, 64 bits)
* byte 1: opcode
* hash2: unique value
*/
fphash_t NewHash ( fphash_value_t(Opcode) << 56,
Opcode * FPHASH_CONST(0x1131462E270012B) );
Depth = 1;
switch(Opcode)
{
case cImmed: // Value
{
ImmedHashGenerator<Value_t>::MakeHash(NewHash, Value);
break; // no params
}
case VarBegin: // Var_or_Funcno
{
NewHash.hash1 |= fphash_value_t(Var_or_Funcno) << 48;
NewHash.hash2 += ((fphash_value_t(Var_or_Funcno)) * 11)
^ FPHASH_CONST(0x3A83A83A83A83A0);
break; // no params
}
case cFCall: case cPCall: // Var_or_Funcno
{
NewHash.hash1 |= fphash_value_t(Var_or_Funcno) << 48;
NewHash.hash2 += ((~fphash_value_t(Var_or_Funcno)) * 7) ^ 3456789;
/* passthru */
}
default:
{
size_t MaxChildDepth = 0;
for(size_t a=0; a<Params.size(); ++a)
{
if(Params[a].GetDepth() > MaxChildDepth)
MaxChildDepth = Params[a].GetDepth();
NewHash.hash1 += ((Params[a].GetHash().hash1*(a+1)) >> 12);
NewHash.hash2 += Params[a].GetHash().hash1;
NewHash.hash2 += (3)*FPHASH_CONST(0x9ABCD801357);
NewHash.hash2 *= FPHASH_CONST(0xECADB912345);
NewHash.hash2 += (~Params[a].GetHash().hash2) ^ 4567890;
}
Depth += MaxChildDepth;
}
}
if(Hash != NewHash)
{
Hash = NewHash;
OptimizedUsing = 0;
}
}
template<typename Value_t>
void CodeTree<Value_t>::FixIncompleteHashes()
{
MarkIncompletes(*this);
FixIncompletes(*this);
}
}
/* BEGIN_EXPLICIT_INSTANTATION */
#include "instantiate.hh"
namespace FPoptimizer_CodeTree
{
#define FP_INSTANTIATE(type) \
template void CodeTree<type>::Sort(); \
template void CodeTree<type>::Rehash(bool); \
template void CodeTree<type>::FixIncompleteHashes(); \
template void CodeTreeData<type>::Recalculate_Hash_NoRecursion();
FPOPTIMIZER_EXPLICITLY_INSTANTIATE(FP_INSTANTIATE)
#undef FP_INSTANTIATE
}
/* END_EXPLICIT_INSTANTATION */
#endif
|
