1 #include <msp/core/algorithm.h>
2 #include <msp/core/maputils.h>
12 const Operator Operator::operators[] =
14 { "[", "]", 2, BINARY, LEFT_TO_RIGHT },
15 { "(", ")", 2, POSTFIX, LEFT_TO_RIGHT },
16 { ".", { }, 2, POSTFIX, LEFT_TO_RIGHT },
17 { "++", { }, 2, POSTFIX, LEFT_TO_RIGHT },
18 { "--", { }, 2, POSTFIX, LEFT_TO_RIGHT },
19 { "++", { }, 3, PREFIX, RIGHT_TO_LEFT },
20 { "--", { }, 3, PREFIX, RIGHT_TO_LEFT },
21 { "+", { }, 3, PREFIX, RIGHT_TO_LEFT },
22 { "-", { }, 3, PREFIX, RIGHT_TO_LEFT },
23 { "~", { }, 3, PREFIX, RIGHT_TO_LEFT },
24 { "!", { }, 3, PREFIX, RIGHT_TO_LEFT },
25 { "*", { }, 4, BINARY, ASSOCIATIVE },
26 { "/", { }, 4, BINARY, LEFT_TO_RIGHT },
27 { "%", { }, 4, BINARY, LEFT_TO_RIGHT },
28 { "+", { }, 5, BINARY, ASSOCIATIVE },
29 { "-", { }, 5, BINARY, LEFT_TO_RIGHT },
30 { "<<", { }, 6, BINARY, LEFT_TO_RIGHT },
31 { ">>", { }, 6, BINARY, LEFT_TO_RIGHT },
32 { "<", { }, 7, BINARY, LEFT_TO_RIGHT },
33 { ">", { }, 7, BINARY, LEFT_TO_RIGHT },
34 { "<=", { }, 7, BINARY, LEFT_TO_RIGHT },
35 { ">=", { }, 7, BINARY, LEFT_TO_RIGHT },
36 { "==", { }, 8, BINARY, LEFT_TO_RIGHT },
37 { "!=", { }, 8, BINARY, LEFT_TO_RIGHT },
38 { "&", { }, 9, BINARY, ASSOCIATIVE },
39 { "^", { }, 10, BINARY, ASSOCIATIVE },
40 { "|", { }, 11, BINARY, ASSOCIATIVE },
41 { "&&", { }, 12, BINARY, ASSOCIATIVE },
42 { "^^", { }, 13, BINARY, ASSOCIATIVE },
43 { "||", { }, 14, BINARY, ASSOCIATIVE },
44 { "?", ":", 15, TERNARY, RIGHT_TO_LEFT },
45 { "=", { }, 16, BINARY, RIGHT_TO_LEFT },
46 { "+=", { }, 16, BINARY, RIGHT_TO_LEFT },
47 { "-=", { }, 16, BINARY, RIGHT_TO_LEFT },
48 { "*=", { }, 16, BINARY, RIGHT_TO_LEFT },
49 { "/=", { }, 16, BINARY, RIGHT_TO_LEFT },
50 { "%=", { }, 16, BINARY, RIGHT_TO_LEFT },
51 { "<<=", { }, 16, BINARY, RIGHT_TO_LEFT },
52 { ">>=", { }, 16, BINARY, RIGHT_TO_LEFT },
53 { "&=", { }, 16, BINARY, RIGHT_TO_LEFT },
54 { "^=", { }, 16, BINARY, RIGHT_TO_LEFT },
55 { "|=", { }, 16, BINARY, RIGHT_TO_LEFT },
56 { ",", { }, 17, BINARY, LEFT_TO_RIGHT },
57 { { 0 }, { }, 18, NO_OPERATOR, LEFT_TO_RIGHT }
60 const Operator &Operator::get_operator(const string &token, Type type)
62 for(const Operator *i=operators; i->type; ++i)
63 if(i->type==type && i->token==token)
65 throw key_error(token);
70 NodeContainer<C>::NodeContainer(const NodeContainer &c):
78 Block::Block(const Block &other):
81 use_braces(other.use_braces)
84 void Block::visit(NodeVisitor &visitor)
90 void Literal::visit(NodeVisitor &visitor)
96 VariableReference::VariableReference(const VariableReference &other):
101 void VariableReference::visit(NodeVisitor &visitor)
103 visitor.visit(*this);
107 MemberAccess::MemberAccess(const MemberAccess &other):
111 // Do not copy declaration
114 void MemberAccess::visit(NodeVisitor &visitor)
116 visitor.visit(*this);
120 void Swizzle::visit(NodeVisitor &visitor)
122 visitor.visit(*this);
126 void UnaryExpression::visit(NodeVisitor &visitor)
128 visitor.visit(*this);
132 void BinaryExpression::visit(NodeVisitor &visitor)
134 visitor.visit(*this);
138 Assignment::Assignment(const Assignment &other):
139 BinaryExpression(other),
140 self_referencing(other.self_referencing)
141 // Do not copy target
144 void Assignment::visit(NodeVisitor &visitor)
146 visitor.visit(*this);
150 bool Assignment::Target::operator<(const Target &other) const
152 if(declaration!=other.declaration)
153 return declaration<other.declaration;
154 for(unsigned i=0; (i<7 && i<chain_len && i<other.chain_len); ++i)
155 if(chain[i]!=other.chain[i])
156 return chain[i]<other.chain[i];
157 return chain_len<other.chain_len;
161 void TernaryExpression::visit(NodeVisitor &visitor)
163 visitor.visit(*this);
167 FunctionCall::FunctionCall(const FunctionCall &other):
170 constructor(other.constructor),
171 arguments(other.arguments)
172 // Do not copy declaration
175 void FunctionCall::visit(NodeVisitor &visitor)
177 visitor.visit(*this);
181 void ExpressionStatement::visit(NodeVisitor &visitor)
183 visitor.visit(*this);
187 void Import::visit(NodeVisitor &visitor)
189 visitor.visit(*this);
193 void Precision::visit(NodeVisitor &visitor)
195 visitor.visit(*this);
199 void Layout::visit(NodeVisitor &visitor)
201 visitor.visit(*this);
205 void InterfaceLayout::visit(NodeVisitor &visitor)
207 visitor.visit(*this);
211 BasicTypeDeclaration::BasicTypeDeclaration(const BasicTypeDeclaration &other):
212 TypeDeclaration(other),
216 extended_alignment(other.extended_alignment),
218 // Do not copy base type
221 void BasicTypeDeclaration::visit(NodeVisitor &visitor)
223 visitor.visit(*this);
227 void ImageTypeDeclaration::visit(NodeVisitor &visitor)
229 visitor.visit(*this);
233 StructDeclaration::StructDeclaration()
235 members.use_braces = true;
238 StructDeclaration::StructDeclaration(const StructDeclaration &other):
239 TypeDeclaration(other),
240 members(other.members),
241 block_name(other.block_name),
242 extended_alignment(other.extended_alignment)
243 // Do not copy block declaration
246 void StructDeclaration::visit(NodeVisitor &visitor)
248 visitor.visit(*this);
252 VariableDeclaration::VariableDeclaration(const VariableDeclaration &other):
254 layout(other.layout),
255 constant(other.constant),
256 sampling(other.sampling),
257 interpolation(other.interpolation),
258 interface(other.interface),
259 precision(other.precision),
263 array_size(other.array_size),
264 init_expression(other.init_expression)
265 // Do not copy pointers to other nodes
268 VariableDeclaration::~VariableDeclaration()
270 if(linked_declaration && linked_declaration->linked_declaration==this)
271 linked_declaration->linked_declaration = 0;
274 void VariableDeclaration::visit(NodeVisitor &visitor)
276 visitor.visit(*this);
280 FunctionDeclaration::FunctionDeclaration(const FunctionDeclaration &other):
282 return_type(other.return_type),
284 parameters(other.parameters),
285 virtua(other.virtua),
286 overrd(other.overrd),
288 signature(other.signature),
289 definition(other.definition==&other ? this : 0)
290 // Do not copy return type declaration
293 void FunctionDeclaration::visit(NodeVisitor &visitor)
295 visitor.visit(*this);
299 void Conditional::visit(NodeVisitor &visitor)
301 visitor.visit(*this);
305 void Iteration::visit(NodeVisitor &visitor)
307 visitor.visit(*this);
311 void Passthrough::visit(NodeVisitor &visitor)
313 visitor.visit(*this);
317 void Return::visit(NodeVisitor &visitor)
319 visitor.visit(*this);
323 void Jump::visit(NodeVisitor &visitor)
325 visitor.visit(*this);
329 Stage::Stage(Stage::Type t):
333 const char *Stage::get_stage_name(Type type)
335 static const char *const names[] = { "shared", "vertex", "geometry", "fragment" };
341 shared(Stage::SHARED)
345 string get_unused_variable_name(const Block &block, const string &base)
350 unsigned base_size = name.size();
354 for(const Block *b=█ (unused && b); b=b->parent)
355 unused = !b->variables.count(name);
359 name.erase(base_size);
360 name += format("_%d", number);
365 TypeDeclaration *get_ultimate_base_type(TypeDeclaration *type)
369 while(const BasicTypeDeclaration *basic = dynamic_cast<const BasicTypeDeclaration *>(type))
371 if(!basic->base_type)
373 type = basic->base_type;
378 bool has_layout_qualifier(const Layout *layout, const string &name)
382 auto i = find_member(layout->qualifiers, name, &Layout::Qualifier::name);
383 return i!=layout->qualifiers.end();
386 int get_layout_value(const Layout *layout, const string &name, int def_value)
390 auto i = find_member(layout->qualifiers, name, &Layout::Qualifier::name);
391 return (i!=layout->qualifiers.end() ? i->value : def_value);
394 void add_layout_qualifier(RefPtr<Layout> &layout, const Layout::Qualifier &q)
398 layout->qualifiers.push_back(q);
401 void add_to_chain(Assignment::Target &target, Assignment::Target::ChainType type, unsigned index)
403 if(target.chain_len<7)
404 target.chain[target.chain_len] = type | min<unsigned>(index, 0x3F);
408 bool targets_overlap(const Assignment::Target &target1, const Assignment::Target &target2)
410 bool overlap = (target1.declaration==target2.declaration);
411 for(unsigned i=0; (overlap && i<target1.chain_len && i<target2.chain_len); ++i)
413 Assignment::Target::ChainType type1 = static_cast<Assignment::Target::ChainType>(target1.chain[i]&0xC0);
414 Assignment::Target::ChainType type2 = static_cast<Assignment::Target::ChainType>(target2.chain[i]&0xC0);
415 unsigned index1 = target1.chain[i]&0x3F;
416 unsigned index2 = target2.chain[i]&0x3F;
417 if(type1==Assignment::Target::SWIZZLE || type2==Assignment::Target::SWIZZLE)
419 if(type1==Assignment::Target::SWIZZLE && type2==Assignment::Target::SWIZZLE)
420 overlap = index1&index2;
421 else if(type1==Assignment::Target::ARRAY && index1<4)
422 overlap = index2&(1<<index1);
423 else if(type2==Assignment::Target::ARRAY && index2<4)
424 overlap = index1&(1<<index2);
425 // Treat other combinations as overlapping (shouldn't happen)
428 overlap = (type1==type2 && (index1==index2 || index1==0x3F || index2==0x3F));