+#include <msp/core/algorithm.h>
+#include <msp/core/raii.h>
#include "reflect.h"
using namespace std;
namespace GL {
namespace SL {
-unsigned TypeComparer::next_tag = 1;
+bool is_scalar(const BasicTypeDeclaration &type)
+{
+ return (type.kind==BasicTypeDeclaration::INT || type.kind==BasicTypeDeclaration::FLOAT);
+}
+
+bool is_vector_or_matrix(const BasicTypeDeclaration &type)
+{
+ return (type.kind==BasicTypeDeclaration::VECTOR || type.kind==BasicTypeDeclaration::MATRIX);
+}
-TypeComparer::TypeComparer():
- first(0),
- second(0),
- first_tag(0),
- r_result(false)
-{ }
+BasicTypeDeclaration *get_element_type(BasicTypeDeclaration &type)
+{
+ if(is_vector_or_matrix(type) || type.kind==BasicTypeDeclaration::ARRAY)
+ {
+ BasicTypeDeclaration *basic_base = dynamic_cast<BasicTypeDeclaration *>(type.base_type);
+ return (basic_base ? get_element_type(*basic_base) : 0);
+ }
+ else
+ return &type;
+}
+
+bool can_convert(const BasicTypeDeclaration &from, const BasicTypeDeclaration &to)
+{
+ if(from.kind==BasicTypeDeclaration::INT && to.kind==BasicTypeDeclaration::FLOAT)
+ return from.size<=to.size;
+ else if(from.kind!=to.kind)
+ return false;
+ else if(from.kind==BasicTypeDeclaration::INT && from.sign!=to.sign)
+ return from.sign && from.size<=to.size;
+ else if(is_vector_or_matrix(from) && from.size==to.size)
+ {
+ BasicTypeDeclaration *from_base = dynamic_cast<BasicTypeDeclaration *>(from.base_type);
+ BasicTypeDeclaration *to_base = dynamic_cast<BasicTypeDeclaration *>(to.base_type);
+ return (from_base && to_base && can_convert(*from_base, *to_base));
+ }
+ else
+ return false;
+}
+
+
+unsigned TypeComparer::next_tag = 1;
void TypeComparer::compare(Node &node1, Node &node2)
{
}
}
+void TypeComparer::visit(UnaryExpression &unary)
+{
+ if(UnaryExpression *unary1 = multi_visit(unary))
+ {
+ if(unary1->oper!=unary.oper)
+ r_result = false;
+ else
+ compare(*unary1->expression, *unary.expression);
+ }
+}
+
+void TypeComparer::visit(BinaryExpression &binary)
+{
+ if(BinaryExpression *binary1 = multi_visit(binary))
+ {
+ if(binary1->oper!=binary.oper)
+ r_result = false;
+ else
+ {
+ compare(*binary1->left, *binary.left);
+ if(r_result)
+ compare(*binary1->right, *binary.right);
+ }
+ }
+}
+
+void TypeComparer::visit(TernaryExpression &ternary)
+{
+ if(TernaryExpression *ternary1 = multi_visit(ternary))
+ {
+ if(ternary1->oper!=ternary.oper)
+ r_result = false;
+ else
+ {
+ compare(*ternary1->condition, *ternary.condition);
+ if(r_result)
+ compare(*ternary1->true_expr, *ternary.true_expr);
+ if(r_result)
+ compare(*ternary1->false_expr, *ternary.false_expr);
+ }
+ }
+}
+
void TypeComparer::visit(BasicTypeDeclaration &basic)
{
if(BasicTypeDeclaration *basic1 = multi_visit(basic))
{
- if(basic1->kind!=basic.kind || basic1->size!=basic.size)
+ if(basic1->kind!=basic.kind || basic1->size!=basic.size || basic1->sign!=basic.sign)
r_result = false;
else if(basic1->base_type && basic.base_type)
compare(*basic1->base_type, *basic.base_type);
else
{
r_result = true;
- NodeList<Statement>::const_iterator i = strct1->members.body.begin();
- NodeList<Statement>::const_iterator j = strct.members.body.begin();
+ auto i = strct1->members.body.begin();
+ auto j = strct.members.body.begin();
for(; (r_result && i!=strct1->members.body.end()); ++i, ++j)
compare(**i, **j);
}
}
-LocationCounter::LocationCounter():
- r_count(0)
-{ }
-
void LocationCounter::visit(BasicTypeDeclaration &basic)
{
r_count = basic.kind==BasicTypeDeclaration::MATRIX ? basic.size>>16 : 1;
void LocationCounter::visit(StructDeclaration &strct)
{
unsigned total = 0;
- for(NodeList<Statement>::const_iterator i=strct.members.body.begin(); i!=strct.members.body.end(); ++i)
+ for(const RefPtr<Statement> &s: strct.members.body)
{
r_count = 1;
- (*i)->visit(*this);
+ s->visit(*this);
total += r_count;
}
r_count = total;
{
unsigned total = 0;
unsigned max_align = 1;
- for(NodeList<Statement>::iterator i=strct.members.body.begin(); i!=strct.members.body.end(); ++i)
+ for(const RefPtr<Statement> &s: strct.members.body)
{
r_size = 0;
r_alignment = 1;
r_offset = -1;
- (*i)->visit(*this);
+ s->visit(*this);
if(r_offset)
total = r_offset;
total += r_alignment-1;
}
r_size = total;
r_alignment = max_align;
+ r_size += r_alignment-1;
+ r_size -= r_size%r_alignment;
}
void MemoryRequirementsCalculator::visit(VariableDeclaration &var)
{
if(var.layout)
{
- const vector<Layout::Qualifier> qualifiers = var.layout->qualifiers;
- for(vector<Layout::Qualifier>::const_iterator i=qualifiers.begin(); (r_offset<0 && i!=qualifiers.end()); ++i)
- if(i->name=="offset")
- r_offset = i->value;
+ auto i = find_member(var.layout->qualifiers, string("offset"), &Layout::Qualifier::name);
+ if(i!=var.layout->qualifiers.end())
+ r_offset = i->value;
}
if(var.type_declaration)
if(var.array)
if(const Literal *literal = dynamic_cast<const Literal *>(var.array_size.get()))
if(literal->value.check_type<int>())
- r_size += r_alignment*(literal->value.value<int>()-1);
+ {
+ unsigned aligned_size = r_size+r_alignment-1;
+ aligned_size -= aligned_size%r_alignment;
+ r_size = aligned_size*literal->value.value<int>();
+ }
}
void DependencyCollector::visit(FunctionCall &call)
{
if(call.declaration)
+ {
dependencies.insert(call.declaration);
+ if(call.declaration->definition)
+ call.declaration->definition->visit(*this);
+ }
TraversingVisitor::visit(call);
}
TraversingVisitor::visit(var);
}
+void DependencyCollector::visit(FunctionDeclaration &func)
+{
+ if(!visited_functions.count(&func))
+ {
+ visited_functions.insert(&func);
+ TraversingVisitor::visit(func);
+ }
+}
+
+
+set<Node *> AssignmentCollector::apply(Node &node)
+{
+ node.visit(*this);
+ return assigned_variables;
+}
+
+void AssignmentCollector::visit(VariableReference &var)
+{
+ if(assignment_target)
+ assigned_variables.insert(var.declaration);
+}
+
+void AssignmentCollector::visit(InterfaceBlockReference &iface)
+{
+ if(assignment_target)
+ assigned_variables.insert(iface.declaration);
+}
+
+void AssignmentCollector::visit(UnaryExpression &unary)
+{
+ SetFlag set_assignment(assignment_target, (unary.oper->token[1]=='+' || unary.oper->token[1]=='-'));
+ TraversingVisitor::visit(unary);
+}
+
+void AssignmentCollector::visit(BinaryExpression &binary)
+{
+ binary.left->visit(*this);
+ SetFlag clear_assignment(assignment_target, false);
+ binary.right->visit(*this);
+}
+
+void AssignmentCollector::visit(Assignment &assign)
+{
+ {
+ SetFlag set_assignment(assignment_target);
+ assign.left->visit(*this);
+ }
+ assign.right->visit(*this);
+}
+
} // namespace SL
} // namespace GL
} // namespace Msp