1 #include <msp/core/algorithm.h>
10 bool is_scalar(const BasicTypeDeclaration &type)
12 return (type.kind==BasicTypeDeclaration::INT || type.kind==BasicTypeDeclaration::FLOAT);
15 bool is_vector_or_matrix(const BasicTypeDeclaration &type)
17 return (type.kind==BasicTypeDeclaration::VECTOR || type.kind==BasicTypeDeclaration::MATRIX);
20 BasicTypeDeclaration *get_element_type(BasicTypeDeclaration &type)
22 if(is_vector_or_matrix(type) || type.kind==BasicTypeDeclaration::ARRAY)
24 BasicTypeDeclaration *basic_base = dynamic_cast<BasicTypeDeclaration *>(type.base_type);
25 return (basic_base ? get_element_type(*basic_base) : 0);
31 bool can_convert(const BasicTypeDeclaration &from, const BasicTypeDeclaration &to)
33 if(from.kind==BasicTypeDeclaration::INT && to.kind==BasicTypeDeclaration::FLOAT)
34 return from.size<=to.size;
35 else if(from.kind!=to.kind)
37 else if(from.kind==BasicTypeDeclaration::INT && from.sign!=to.sign)
38 return from.sign && from.size<=to.size;
39 else if(is_vector_or_matrix(from) && from.size==to.size)
41 BasicTypeDeclaration *from_base = dynamic_cast<BasicTypeDeclaration *>(from.base_type);
42 BasicTypeDeclaration *to_base = dynamic_cast<BasicTypeDeclaration *>(to.base_type);
43 return (from_base && to_base && can_convert(*from_base, *to_base));
50 unsigned TypeComparer::next_tag = 1;
52 void TypeComparer::compare(Node &node1, Node &node2)
64 T *TypeComparer::multi_visit(T &node)
66 static unsigned tag = next_tag++;
76 else if(!first || tag!=first_tag)
80 T *f = static_cast<T *>(first);
88 void TypeComparer::visit(Literal &literal)
90 if(Literal *lit1 = multi_visit(literal))
92 if(!lit1->type || !literal.type)
96 compare(*lit1->type, *literal.type);
98 r_result = (literal.value.check_type<int>() && lit1->value.value<int>()==literal.value.value<int>());
103 void TypeComparer::visit(VariableReference &var)
105 if(VariableReference *var1 = multi_visit(var))
107 if(!var1->declaration || !var.declaration)
109 else if(!var1->declaration->constant || !var.declaration->constant)
111 else if(!var1->declaration->init_expression || !var.declaration->init_expression)
114 compare(*var1->declaration->init_expression, *var.declaration->init_expression);
118 void TypeComparer::visit(UnaryExpression &unary)
120 if(UnaryExpression *unary1 = multi_visit(unary))
122 if(unary1->oper!=unary.oper)
125 compare(*unary1->expression, *unary.expression);
129 void TypeComparer::visit(BinaryExpression &binary)
131 if(BinaryExpression *binary1 = multi_visit(binary))
133 if(binary1->oper!=binary.oper)
137 compare(*binary1->left, *binary.left);
139 compare(*binary1->right, *binary.right);
144 void TypeComparer::visit(TernaryExpression &ternary)
146 if(TernaryExpression *ternary1 = multi_visit(ternary))
148 if(ternary1->oper!=ternary.oper)
152 compare(*ternary1->condition, *ternary.condition);
154 compare(*ternary1->true_expr, *ternary.true_expr);
156 compare(*ternary1->false_expr, *ternary.false_expr);
161 void TypeComparer::visit(BasicTypeDeclaration &basic)
163 if(BasicTypeDeclaration *basic1 = multi_visit(basic))
165 if(basic1->kind!=basic.kind || basic1->size!=basic.size || basic1->sign!=basic.sign)
167 else if(basic1->base_type && basic.base_type)
168 compare(*basic1->base_type, *basic.base_type);
170 r_result = (!basic1->base_type && !basic.base_type);
174 void TypeComparer::visit(ImageTypeDeclaration &image)
176 if(ImageTypeDeclaration *image1 = multi_visit(image))
178 if(image1->dimensions!=image.dimensions || image1->array!=image.array)
180 else if(image1->sampled!=image.sampled || image1->shadow!=image.shadow)
182 else if(image1->base_type && image.base_type)
183 compare(*image1->base_type, *image.base_type);
185 r_result = (!image1->base_type && !image.base_type);
189 void TypeComparer::visit(StructDeclaration &strct)
191 if(StructDeclaration *strct1 = multi_visit(strct))
193 if(strct1->members.body.size()!=strct.members.body.size())
198 auto i = strct1->members.body.begin();
199 auto j = strct.members.body.begin();
200 for(; (r_result && i!=strct1->members.body.end()); ++i, ++j)
206 void TypeComparer::visit(VariableDeclaration &var)
208 if(VariableDeclaration *var1 = multi_visit(var))
210 if(var1->name!=var.name || var1->array!=var.array)
212 else if(!var1->type_declaration || !var.type_declaration)
219 if(var1->array_size && var.array_size)
220 compare(*var1->array_size, *var.array_size);
222 if(r_result && var1->type_declaration!=var.type_declaration)
223 compare(*var1->type_declaration, *var.type_declaration);
224 // TODO Compare layout qualifiers for interface block members
230 void LocationCounter::visit(BasicTypeDeclaration &basic)
232 r_count = basic.kind==BasicTypeDeclaration::MATRIX ? basic.size>>16 : 1;
235 void LocationCounter::visit(ImageTypeDeclaration &)
240 void LocationCounter::visit(StructDeclaration &strct)
243 for(const RefPtr<Statement> &s: strct.members.body)
252 void LocationCounter::visit(VariableDeclaration &var)
255 if(var.type_declaration)
256 var.type_declaration->visit(*this);
258 if(const Literal *literal = dynamic_cast<const Literal *>(var.array_size.get()))
259 if(literal->value.check_type<int>())
260 r_count *= literal->value.value<int>();
264 void MemoryRequirementsCalculator::visit(BasicTypeDeclaration &basic)
266 if(basic.kind==BasicTypeDeclaration::BOOL)
271 else if(basic.kind==BasicTypeDeclaration::INT || basic.kind==BasicTypeDeclaration::FLOAT)
273 r_size = basic.size/8;
274 r_alignment = r_size;
276 else if(basic.kind==BasicTypeDeclaration::VECTOR || basic.kind==BasicTypeDeclaration::MATRIX)
278 basic.base_type->visit(*this);
279 unsigned n_elem = basic.size&0xFFFF;
281 if(basic.kind==BasicTypeDeclaration::VECTOR)
282 r_alignment *= (n_elem==3 ? 4 : n_elem);
284 else if(basic.kind==BasicTypeDeclaration::ARRAY)
285 basic.base_type->visit(*this);
288 void MemoryRequirementsCalculator::visit(StructDeclaration &strct)
291 unsigned max_align = 1;
292 for(const RefPtr<Statement> &s: strct.members.body)
300 total += r_alignment-1;
301 total -= total%r_alignment;
303 max_align = max(max_align, r_alignment);
306 r_alignment = max_align;
309 void MemoryRequirementsCalculator::visit(VariableDeclaration &var)
313 auto i = find_member(var.layout->qualifiers, string("offset"), &Layout::Qualifier::name);
314 if(i!=var.layout->qualifiers.end())
318 if(var.type_declaration)
319 var.type_declaration->visit(*this);
321 if(const Literal *literal = dynamic_cast<const Literal *>(var.array_size.get()))
322 if(literal->value.check_type<int>())
323 r_size += r_alignment*(literal->value.value<int>()-1);
327 set<Node *> DependencyCollector::apply(FunctionDeclaration &func)
333 void DependencyCollector::visit(VariableReference &var)
335 if(var.declaration && !locals.count(var.declaration))
337 dependencies.insert(var.declaration);
338 var.declaration->visit(*this);
342 void DependencyCollector::visit(InterfaceBlockReference &iface)
344 if(iface.declaration)
346 dependencies.insert(iface.declaration);
347 iface.declaration->visit(*this);
351 void DependencyCollector::visit(FunctionCall &call)
355 dependencies.insert(call.declaration);
356 if(call.declaration->definition)
357 call.declaration->definition->visit(*this);
359 TraversingVisitor::visit(call);
362 void DependencyCollector::visit(VariableDeclaration &var)
365 if(var.type_declaration)
367 dependencies.insert(var.type_declaration);
368 var.type_declaration->visit(*this);
371 TraversingVisitor::visit(var);
374 void DependencyCollector::visit(FunctionDeclaration &func)
376 if(!visited_functions.count(&func))
378 visited_functions.insert(&func);
379 TraversingVisitor::visit(func);
384 set<VariableDeclaration *> AssignmentCollector::apply(Node &node)
387 return assigned_variables;
390 void AssignmentCollector::visit(Assignment &assign)
392 if(VariableDeclaration *var = dynamic_cast<VariableDeclaration *>(assign.target.declaration))
393 assigned_variables.insert(var);