-
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathexpression.h
More file actions
215 lines (211 loc) · 7.16 KB
/
expression.h
File metadata and controls
215 lines (211 loc) · 7.16 KB
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
#pragma once
#include <memory>
#include <vector>
#include <map>
#include <unordered_map>
#include <any>
#include <array>
#include <list>
#include <stack>
//#include <string>
//#include <variant>
//#include <map>
#include "dynamic_cast.h"
#include "unique.h"
//#include "environment.h"
#include <llvm/IR/LLVMContext.h>
#include <llvm/IR/IRBuilder.h>
#include <boost/intrusive_ptr.hpp>
//#include <llvm/IR/Module.h>
//#include <llvm/IR/Constants.h>
namespace theExpressionEngine
{
template<bool BTHREADED>
struct realConstant;
template<bool BTHREADED>
struct intConstant;
template<bool BTHREADED>
struct factory;
//struct type;
//struct environment;
//struct realConstant;
template<bool BTHREADED>
struct llvmData;
template<bool BTHREADED>
struct expression;
template<bool BTHREADED>
struct conditional;
/// the base class of all expression types
/// immutable
/// no two with the same content are guaranteed to exist
template<bool BTHREADED>
struct expression:dynamic_cast_interface<conditional<BTHREADED> >, dynamic_cast_interface<realConstant<BTHREADED> >, dynamic_cast_interface<intConstant<BTHREADED> >, unique<expression<BTHREADED>, BTHREADED>//, hasId<expression>
{ using typename unique<expression<BTHREADED>, BTHREADED>::MUTEX;
using dynamic_cast_interface<realConstant<BTHREADED> >::getPtr;
using dynamic_cast_interface<intConstant<BTHREADED> >::getPtr;
using dynamic_cast_interface<conditional<BTHREADED> >::getPtr;
//using unique<expression<BTHREADED>, BTHREADED>::getMutex;
typedef boost::intrusive_ptr<const expression<BTHREADED> > ptr;
typedef factory<BTHREADED> FACTORY;
using is_expression_ptr_tag = std::true_type;
typedef std::vector<ptr> children;
enum enumAttachedData
{ eLLVMValuePtr,
eLLVMdata,
__NUMBER_OF_DATA__
};
enum enumType
{ eFloatingPoint,
eInteger
};
const enumType m_eType;
typedef std::array<std::any, __NUMBER_OF_DATA__> ARRAY;
typedef std::unordered_map<const expression<BTHREADED> *, ARRAY> MAP;
const children m_sChildren;
expression(
children&&_rChildren,
const enumType _eType
);
virtual ~expression(void) = default;
expression(const expression&) = delete;
expression(expression&&) = delete;
expression &operator=(const expression&) = delete;
expression &operator=(expression&&) = delete;
/// this compares everything contained in expression
/// and calls isSmaller() if there is no difference
bool operator<(const expression<BTHREADED> &_r) const;
/// this is to be implemented for all derived classes containing data
/// the type of the LHS and RHS is guaranteed to be identical
virtual bool isSmaller(const expression<BTHREADED> &) const;
double evaluateW(const double *const _p0, const int*const _p1, const double*const _p2, const int*const _p3) const
{ if (m_eType == eInteger)
return evaluateInt(_p0, _p1, _p2, _p3);
else
return evaluate(_p0, _p1, _p2, _p3);
}
virtual int evaluateInt(const double *const, const int*const, const double*const, const int*const) const;
virtual double evaluate(const double *const, const int*const, const double*const, const int*const) const;
double evaluateLLVM(const double *const, const int*const, const double *const, const int*const) const;
int evaluateIntLLVM(const double *const, const int*const, const double *const, const int*const) const;
llvm::Value *generateCodeWF(
const expression<BTHREADED> *const _pRoot,
llvm::LLVMContext& context,
llvm::IRBuilder<>& builder,
llvm::Module *const M,
llvm::Value*const _pP,
llvm::Value*const _pIP,
llvm::Value*const _pT,
llvm::Value*const _pIT
) const;
llvm::Value *generateCodeW(
const expression<BTHREADED> *const _pRoot,
llvm::LLVMContext& context,
llvm::IRBuilder<>& builder,
llvm::Module *const M,
llvm::Value*const _pP,
llvm::Value*const _pIP,
llvm::Value*const _pT,
llvm::Value*const _pIT
) const;
virtual void onDestroy(void) const;
ptr collapse(const factory<BTHREADED>&_rF) const;
typedef std::map<ptr, ptr> ptr2ptr;
virtual ptr recreateFromChildren(children, const factory<BTHREADED>&) const = 0;
ptr replace(const ptr2ptr&, const factory<BTHREADED>&) const;
typedef std::function<bool(const expression<BTHREADED>*)> BEFORE;
void DFS(const BEFORE&_r) const
{ std::stack<const expression<BTHREADED>*> s;
s.push(this);
while (!s.empty())
{ const auto p = s.top();
s.pop();
if (_r(p))
for (const auto &pC : p->m_sChildren)
s.push(pC.get());
}
}
typedef std::pair<const expression<BTHREADED>*, bool> PAIR;
typedef std::vector<PAIR> STACK;
typedef std::function<bool(const expression<BTHREADED>*, const STACK&)> BEFORE2;
typedef std::function<void(const expression<BTHREADED>*, const STACK&)> AFTER2;
void DFS(const BEFORE2&_r, const AFTER2&_rA) const
{ STACK s;
s.push_back({this, true});
while (!s.empty())
{ const auto [p, b] = s.back();
s.pop_back();
if (b)
if (_r(p, s))
{ s.push_back({p, false});
for (const auto &pC : p->m_sChildren)
s.push_back({pC.get(), true});
}
else
_rA(p, s);
else
_rA(p, s);
}
}
virtual std::ostream &print(std::ostream&) const = 0;
void initializeLLVM(void) const;
virtual bool isZero(void) const
{ return false;
}
virtual bool isOne(void) const
{ return false;
}
virtual bool isNonZero(void) const
{ return false;
}
private:
mutable MUTEX m_sMutex;
mutable MAP m_sAttachedData;
virtual llvm::Value* generateCode(
const expression<BTHREADED> *const _pRoot,
llvm::LLVMContext& context,
llvm::IRBuilder<>& builder,
llvm::Module *const M,
llvm::Value*const _pP,
llvm::Value*const _pIP,
llvm::Value*const _pT,
llvm::Value*const _pIT
) const = 0;
typedef std::function<void(void)> onDestroyFunctor;
mutable std::list<onDestroyFunctor> m_sOnDestroyList;
virtual void addOnDestroy(onDestroyFunctor _s) const;
};
template<bool BTHREADED>
struct expressionSet:unique<expressionSet<BTHREADED>, BTHREADED>
{ typedef std::vector<boost::intrusive_ptr<const expression<BTHREADED> > > children;
//virtual const children&getChildren(void) const = 0;
virtual ~expressionSet(void) = default;
virtual bool operator<(const expressionSet<BTHREADED> &_r) const = 0;
virtual void evaluate(
std::vector<double>&_rChildren,
std::vector<int>&_rIntChildren,
const double *const _pParams,
const int *const _pIntParams
) const = 0;
virtual void evaluateLLVM(
std::vector<double>&_rChildren,
std::vector<int>&_rIntChildren,
const double *const _pParams,
const int *const _pIntParams
) const = 0;
virtual const typename expression<BTHREADED>::children &getChildren(void) const = 0;
//virtual const typename expression<BTHREADED>::children &getTemps(void) const = 0;
//virtual std::size_t getTempSize(void) const = 0;
virtual const std::vector<std::size_t> &getOrder(void) const = 0;
};
template<bool BTHREADED>
boost::intrusive_ptr<const expression<BTHREADED> > collapse(const expression<BTHREADED> &, const factory<BTHREADED>&);
template<bool BTHREADED>
boost::intrusive_ptr<const expressionSet<BTHREADED> > collapse(const expressionSet<BTHREADED> &_r, const factory<BTHREADED>&)
{ return &_r;
}
template<typename T, typename = void>
struct is_expression_ptr : std::false_type {};
template<typename T>
struct is_expression_ptr<T, std::void_t<typename T::element_type::is_expression_ptr_tag>> : std::true_type {};
}
#include "expression.ipp"