1 #include <msp/core/hash.h>
2 #include <msp/core/raii.h>
3 #include <msp/strings/lexicalcast.h>
13 void DeclarationCombiner::apply(Stage &stage)
15 stage.content.visit(*this);
16 NodeRemover().apply(stage, nodes_to_remove);
19 void DeclarationCombiner::visit(Block &block)
24 TraversingVisitor::visit(block);
27 void DeclarationCombiner::visit(VariableDeclaration &var)
29 VariableDeclaration *&ptr = variables[var.name];
33 if(var.init_expression)
34 ptr->init_expression = var.init_expression;
39 for(vector<Layout::Qualifier>::iterator i=var.layout->qualifiers.begin(); i!=var.layout->qualifiers.end(); ++i)
42 for(vector<Layout::Qualifier>::iterator j=ptr->layout->qualifiers.begin(); (!found && j!=ptr->layout->qualifiers.end()); ++j)
45 j->has_value = i->value;
51 ptr->layout->qualifiers.push_back(*i);
55 ptr->layout = var.layout;
57 nodes_to_remove.insert(&var);
64 ConstantSpecializer::ConstantSpecializer():
68 void ConstantSpecializer::apply(Stage &stage, const map<string, int> *v)
71 stage.content.visit(*this);
74 void ConstantSpecializer::visit(VariableDeclaration &var)
76 bool specializable = false;
79 vector<Layout::Qualifier> &qualifiers = var.layout->qualifiers;
80 for(vector<Layout::Qualifier>::iterator i=qualifiers.begin(); i!=qualifiers.end(); ++i)
81 if(i->name=="constant_id")
87 i->value = hash32(var.name)&0x7FFFFFFF;
91 if(qualifiers.empty())
95 if(specializable && values)
97 map<string, int>::const_iterator i = values->find(var.name);
100 RefPtr<Literal> literal = new Literal;
103 literal->token = (i->second ? "true" : "false");
104 literal->value = static_cast<bool>(i->second);
106 else if(var.type=="int")
108 literal->token = lexical_cast<string>(i->second);
109 literal->value = i->second;
111 var.init_expression = literal;
117 void BlockHierarchyResolver::enter(Block &block)
119 block.parent = current_block;
123 TypeResolver::TypeResolver():
127 void TypeResolver::apply(Stage &s)
131 s.content.visit(*this);
134 TypeDeclaration *TypeResolver::resolve_type(const string &name)
136 map<string, TypeDeclaration *>::iterator i = stage->types.find(name);
137 if(i!=stage->types.end())
139 map<TypeDeclaration *, TypeDeclaration *>::iterator j = alias_map.find(i->second);
140 return (j!=alias_map.end() ? j->second : i->second);
146 void TypeResolver::visit(Block &block)
148 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
151 type_insert_point = i;
156 void TypeResolver::visit(BasicTypeDeclaration &type)
158 type.base_type = resolve_type(type.base);
160 if(type.kind==BasicTypeDeclaration::VECTOR && type.base_type)
161 if(BasicTypeDeclaration *basic_base = dynamic_cast<BasicTypeDeclaration *>(type.base_type))
162 if(basic_base->kind==BasicTypeDeclaration::VECTOR)
164 type.kind = BasicTypeDeclaration::MATRIX;
165 type.size |= basic_base->size<<16;
168 if(type.kind==BasicTypeDeclaration::ALIAS && type.base_type)
169 alias_map[&type] = type.base_type;
170 else if(type.kind==BasicTypeDeclaration::ARRAY && type.base_type)
171 array_types[type.base_type] = &type;
173 stage->types.insert(make_pair(type.name, &type));
176 void TypeResolver::visit(ImageTypeDeclaration &type)
178 type.base_type = resolve_type(type.base);
179 stage->types.insert(make_pair(type.name, &type));
182 void TypeResolver::visit(StructDeclaration &strct)
184 stage->types.insert(make_pair(strct.name, &strct));
185 TraversingVisitor::visit(strct);
188 void TypeResolver::visit(VariableDeclaration &var)
190 TypeDeclaration *type = resolve_type(var.type);
191 if(var.array && type)
193 map<TypeDeclaration *, TypeDeclaration *>::iterator i = array_types.find(type);
194 if(i==array_types.end())
196 BasicTypeDeclaration *array = new BasicTypeDeclaration;
197 array->source = BUILTIN_SOURCE;
198 array->name = type->name+"[]";
199 array->kind = BasicTypeDeclaration::ARRAY;
200 array->base = type->name;
201 array->base_type = type;
202 stage->content.body.insert(type_insert_point, array);
209 var.type_declaration = type;
212 void TypeResolver::visit(FunctionDeclaration &func)
214 func.return_type_declaration = resolve_type(func.return_type);
215 TraversingVisitor::visit(func);
219 VariableResolver::VariableResolver():
221 r_any_resolved(false),
222 record_target(false),
223 r_self_referencing(false),
224 r_assignment_target(0)
227 bool VariableResolver::apply(Stage &s)
230 s.interface_blocks.clear();
231 r_any_resolved = false;
232 s.content.visit(*this);
233 return r_any_resolved;
236 void VariableResolver::enter(Block &block)
238 block.variables.clear();
241 void VariableResolver::visit_and_replace(RefPtr<Expression> &expr)
243 r_replacement_expr = 0;
245 if(r_replacement_expr)
246 expr = r_replacement_expr;
247 r_replacement_expr = 0;
250 void VariableResolver::visit(VariableReference &var)
252 VariableDeclaration *declaration = 0;
254 /* Look for variable declarations in the block hierarchy first. Interface
255 blocks are always defined in the top level so we can't accidentally skip
257 for(Block *block=current_block; (!declaration && block); block=block->parent)
259 map<string, VariableDeclaration *>::iterator i = block->variables.find(var.name);
260 if(i!=block->variables.end())
261 declaration = i->second;
266 const map<string, InterfaceBlock *> &blocks = stage->interface_blocks;
267 map<string, InterfaceBlock *>::const_iterator i = blocks.find("_"+var.name);
270 /* The name refers to an interface block with an instance name rather
271 than a variable. Prepare a new syntax tree node accordingly. */
272 InterfaceBlockReference *iface_ref = new InterfaceBlockReference;
273 iface_ref->source = var.source;
274 iface_ref->line = var.line;
275 iface_ref->name = var.name;
276 iface_ref->declaration = i->second;
277 r_replacement_expr = iface_ref;
281 // Look for the variable in anonymous interface blocks.
282 for(i=blocks.begin(); (!declaration && i!=blocks.end()); ++i)
283 if(i->second->instance_name.empty())
285 map<string, VariableDeclaration *>::iterator j = i->second->members.variables.find(var.name);
286 if(j!=i->second->members.variables.end())
287 declaration = j->second;
292 r_any_resolved |= (declaration!=var.declaration);
293 var.declaration = declaration;
297 if(r_assignment_target)
299 /* More than one variable reference found in assignment target.
300 Unable to determine what the primary target is. */
301 record_target = false;
302 r_assignment_target = 0;
305 r_assignment_target = var.declaration;
307 else if(var.declaration && var.declaration==r_assignment_target)
308 r_self_referencing = true;
311 void VariableResolver::visit(InterfaceBlockReference &iface)
313 map<string, InterfaceBlock *>::iterator i = stage->interface_blocks.find("_"+iface.name);
314 InterfaceBlock *declaration = (i!=stage->interface_blocks.end() ? i->second : 0);
315 r_any_resolved |= (declaration!=iface.declaration);
316 iface.declaration = declaration;
319 void VariableResolver::visit(MemberAccess &memacc)
321 visit_and_replace(memacc.left);
323 map<string, VariableDeclaration *> *members = 0;
324 if(StructDeclaration *strct = dynamic_cast<StructDeclaration *>(memacc.left->type))
325 members = &strct->members.variables;
326 else if(InterfaceBlockReference *iface_ref = dynamic_cast<InterfaceBlockReference *>(memacc.left.get()))
328 if(iface_ref->declaration)
329 members = &iface_ref->declaration->members.variables;
332 VariableDeclaration *declaration = 0;
335 map<string, VariableDeclaration *>::iterator i = members->find(memacc.member);
336 if(i!=members->end())
337 declaration = i->second;
340 r_any_resolved |= (declaration!=memacc.declaration);
341 memacc.declaration = declaration;
344 void VariableResolver::visit(UnaryExpression &unary)
346 visit_and_replace(unary.expression);
349 void VariableResolver::visit(BinaryExpression &binary)
351 if(binary.oper->token[0]=='[')
354 /* The subscript expression is not a part of the primary assignment
356 SetFlag set(record_target, false);
357 visit_and_replace(binary.right);
359 visit_and_replace(binary.left);
363 visit_and_replace(binary.left);
364 visit_and_replace(binary.right);
368 void VariableResolver::visit(Assignment &assign)
371 SetFlag set(record_target);
372 r_assignment_target = 0;
373 visit_and_replace(assign.left);
374 r_any_resolved |= (r_assignment_target!=assign.target_declaration);
375 assign.target_declaration = r_assignment_target;
378 r_self_referencing = false;
379 visit_and_replace(assign.right);
380 assign.self_referencing = (r_self_referencing || assign.oper->token[0]!='=');
383 void VariableResolver::visit(FunctionCall &call)
385 for(NodeArray<Expression>::iterator i=call.arguments.begin(); i!=call.arguments.end(); ++i)
386 visit_and_replace(*i);
389 void VariableResolver::visit(VariableDeclaration &var)
391 if(!block_interface.empty() && var.interface.empty())
392 var.interface = block_interface;
394 TraversingVisitor::visit(var);
395 current_block->variables.insert(make_pair(var.name, &var));
398 void VariableResolver::visit(InterfaceBlock &iface)
400 /* Block names can be reused in different interfaces. Prefix the name with
401 the first character of the interface to avoid conflicts. */
402 stage->interface_blocks.insert(make_pair(iface.interface+iface.name, &iface));
403 if(!iface.instance_name.empty())
404 stage->interface_blocks.insert(make_pair("_"+iface.instance_name, &iface));
406 SetForScope<string> set_iface(block_interface, iface.interface);
407 TraversingVisitor::visit(iface);
411 ExpressionResolver::ExpressionResolver():
413 r_any_resolved(false)
416 bool ExpressionResolver::apply(Stage &s)
419 r_any_resolved = false;
420 s.content.visit(*this);
421 return r_any_resolved;
424 bool ExpressionResolver::is_scalar(BasicTypeDeclaration &type)
426 return (type.kind==BasicTypeDeclaration::INT || type.kind==BasicTypeDeclaration::FLOAT);
429 bool ExpressionResolver::is_vector_or_matrix(BasicTypeDeclaration &type)
431 return (type.kind==BasicTypeDeclaration::VECTOR || type.kind==BasicTypeDeclaration::MATRIX);
434 BasicTypeDeclaration *ExpressionResolver::get_element_type(BasicTypeDeclaration &type)
436 if(is_vector_or_matrix(type) || type.kind==BasicTypeDeclaration::ARRAY)
438 BasicTypeDeclaration *basic_base = dynamic_cast<BasicTypeDeclaration *>(type.base_type);
439 return (basic_base ? get_element_type(*basic_base) : 0);
445 bool ExpressionResolver::can_convert(BasicTypeDeclaration &from, BasicTypeDeclaration &to)
447 if(from.kind==BasicTypeDeclaration::INT && to.kind==BasicTypeDeclaration::FLOAT)
448 return from.size<=to.size;
449 else if(from.kind!=to.kind)
451 else if((from.kind==BasicTypeDeclaration::VECTOR || from.kind==BasicTypeDeclaration::MATRIX) && from.size==to.size)
453 BasicTypeDeclaration *from_base = dynamic_cast<BasicTypeDeclaration *>(from.base_type);
454 BasicTypeDeclaration *to_base = dynamic_cast<BasicTypeDeclaration *>(to.base_type);
455 return (from_base && to_base && can_convert(*from_base, *to_base));
461 ExpressionResolver::Compatibility ExpressionResolver::get_compatibility(BasicTypeDeclaration &left, BasicTypeDeclaration &right)
465 else if(can_convert(left, right))
466 return LEFT_CONVERTIBLE;
467 else if(can_convert(right, left))
468 return RIGHT_CONVERTIBLE;
470 return NOT_COMPATIBLE;
473 BasicTypeDeclaration *ExpressionResolver::find_type(BasicTypeDeclaration::Kind kind, unsigned size)
475 for(vector<BasicTypeDeclaration *>::const_iterator i=basic_types.begin(); i!=basic_types.end(); ++i)
476 if((*i)->kind==kind && (*i)->size==size)
481 BasicTypeDeclaration *ExpressionResolver::find_type(BasicTypeDeclaration &elem_type, BasicTypeDeclaration::Kind kind, unsigned size)
483 for(vector<BasicTypeDeclaration *>::const_iterator i=basic_types.begin(); i!=basic_types.end(); ++i)
484 if(get_element_type(**i)==&elem_type && (*i)->kind==kind && (*i)->size==size)
489 void ExpressionResolver::convert_to(RefPtr<Expression> &expr, BasicTypeDeclaration &type)
491 RefPtr<FunctionCall> call = new FunctionCall;
492 call->name = type.name;
493 call->constructor = true;
494 call->arguments.push_back(0);
495 call->arguments.back() = expr;
500 bool ExpressionResolver::convert_to_element(RefPtr<Expression> &expr, BasicTypeDeclaration &elem_type)
502 if(BasicTypeDeclaration *expr_type = dynamic_cast<BasicTypeDeclaration *>(expr->type))
504 BasicTypeDeclaration *to_type = &elem_type;
505 if(is_vector_or_matrix(*expr_type))
506 to_type = find_type(elem_type, expr_type->kind, expr_type->size);
509 convert_to(expr, *to_type);
517 void ExpressionResolver::resolve(Expression &expr, TypeDeclaration *type, bool lvalue)
519 r_any_resolved |= (type!=expr.type || lvalue!=expr.lvalue);
521 expr.lvalue = lvalue;
524 void ExpressionResolver::visit(Literal &literal)
526 if(literal.value.check_type<bool>())
527 resolve(literal, find_type(BasicTypeDeclaration::BOOL, 1), false);
528 else if(literal.value.check_type<int>())
529 resolve(literal, find_type(BasicTypeDeclaration::INT, 32), false);
530 else if(literal.value.check_type<float>())
531 resolve(literal, find_type(BasicTypeDeclaration::FLOAT, 32), false);
534 void ExpressionResolver::visit(ParenthesizedExpression &parexpr)
536 TraversingVisitor::visit(parexpr);
537 resolve(parexpr, parexpr.expression->type, parexpr.expression->lvalue);
540 void ExpressionResolver::visit(VariableReference &var)
543 resolve(var, var.declaration->type_declaration, true);
546 void ExpressionResolver::visit(InterfaceBlockReference &iface)
548 resolve(iface, 0, true);
551 void ExpressionResolver::visit(MemberAccess &memacc)
553 TraversingVisitor::visit(memacc);
555 if(memacc.declaration)
556 resolve(memacc, memacc.declaration->type_declaration, memacc.left->lvalue);
559 void ExpressionResolver::visit(UnaryExpression &unary)
561 TraversingVisitor::visit(unary);
563 BasicTypeDeclaration *basic = dynamic_cast<BasicTypeDeclaration *>(unary.expression->type);
567 char oper = unary.oper->token[0];
570 if(basic->kind!=BasicTypeDeclaration::BOOL)
575 if(basic->kind!=BasicTypeDeclaration::INT)
578 else if(oper=='+' || oper=='-')
580 BasicTypeDeclaration *elem = get_element_type(*basic);
581 if(!elem || !is_scalar(*elem))
584 resolve(unary, basic, unary.expression->lvalue);
587 void ExpressionResolver::visit(BinaryExpression &binary, bool assign)
589 /* Binary operators are only defined for basic types (not for image or
591 BasicTypeDeclaration *basic_left = dynamic_cast<BasicTypeDeclaration *>(binary.left->type);
592 BasicTypeDeclaration *basic_right = dynamic_cast<BasicTypeDeclaration *>(binary.right->type);
593 if(!basic_left || !basic_right)
596 char oper = binary.oper->token[0];
599 /* Subscripting operates on vectors, matrices and arrays, and the right
600 operand must be an integer. */
601 if((!is_vector_or_matrix(*basic_left) && basic_left->kind!=BasicTypeDeclaration::ARRAY) || basic_right->kind!=BasicTypeDeclaration::INT)
604 resolve(binary, basic_left->base_type, binary.left->lvalue);
607 else if(basic_left->kind==BasicTypeDeclaration::ARRAY || basic_right->kind==BasicTypeDeclaration::ARRAY)
608 // No other binary operator can be used with arrays.
611 BasicTypeDeclaration *elem_left = get_element_type(*basic_left);
612 BasicTypeDeclaration *elem_right = get_element_type(*basic_right);
613 if(!elem_left || !elem_right)
616 Compatibility compat = get_compatibility(*basic_left, *basic_right);
617 Compatibility elem_compat = get_compatibility(*elem_left, *elem_right);
618 if(elem_compat==NOT_COMPATIBLE)
620 if(assign && (compat==LEFT_CONVERTIBLE || elem_compat==LEFT_CONVERTIBLE))
623 TypeDeclaration *type = 0;
624 char oper2 = binary.oper->token[1];
625 if((oper=='<' && oper2!='<') || (oper=='>' && oper2!='>'))
627 /* Relational operators compare two scalar integer or floating-point
629 if(!is_scalar(*elem_left) || !is_scalar(*elem_right) || compat==NOT_COMPATIBLE)
632 type = find_type(BasicTypeDeclaration::BOOL, 1);
634 else if((oper=='=' || oper=='!') && oper2=='=')
636 // Equality comparison can be done on any compatible types.
637 if(compat==NOT_COMPATIBLE)
640 type = find_type(BasicTypeDeclaration::BOOL, 1);
642 else if(oper2=='&' || oper2=='|' || oper2=='^')
644 // Logical operators can only be applied to booleans.
645 if(basic_left->kind!=BasicTypeDeclaration::BOOL || basic_right->kind!=BasicTypeDeclaration::BOOL)
650 else if((oper=='&' || oper=='|' || oper=='^' || oper=='%') && !oper2)
652 // Bitwise operators and modulo can only be applied to integers.
653 if(basic_left->kind!=BasicTypeDeclaration::INT || basic_right->kind!=BasicTypeDeclaration::INT)
656 type = (compat==LEFT_CONVERTIBLE ? basic_right : basic_left);
658 else if((oper=='<' || oper=='>') && oper2==oper)
660 // Shifts only apply to integers.
661 if(basic_left->kind!=BasicTypeDeclaration::INT || basic_right->kind!=BasicTypeDeclaration::INT)
666 else if(oper=='+' || oper=='-' || oper=='*' || oper=='/')
668 // Arithmetic operators require scalar elements.
669 if(!is_scalar(*elem_left) || !is_scalar(*elem_right))
672 if(oper=='*' && is_vector_or_matrix(*basic_left) && is_vector_or_matrix(*basic_right) &&
673 (basic_left->kind==BasicTypeDeclaration::MATRIX || basic_right->kind==BasicTypeDeclaration::MATRIX))
675 /* Multiplication has special rules when at least one operand is a
676 matrix and the other is a vector or a matrix. */
677 unsigned left_columns = basic_left->size&0xFFFF;
678 unsigned right_rows = basic_right->size;
679 if(basic_right->kind==BasicTypeDeclaration::MATRIX)
681 if(left_columns!=right_rows)
684 BasicTypeDeclaration *elem_result = (elem_compat==LEFT_CONVERTIBLE ? elem_right : elem_left);
686 if(basic_left->kind==BasicTypeDeclaration::VECTOR)
687 type = find_type(*elem_result, BasicTypeDeclaration::VECTOR, basic_right->size&0xFFFF);
688 else if(basic_right->kind==BasicTypeDeclaration::VECTOR)
689 type = find_type(*elem_result, BasicTypeDeclaration::VECTOR, basic_left->size>>16);
691 type = find_type(*elem_result, BasicTypeDeclaration::MATRIX, (basic_left->size&0xFFFF0000)|(basic_right->size&0xFFFF));
693 else if(compat==NOT_COMPATIBLE)
695 // Arithmetic between scalars and matrices or vectors is supported.
696 if(is_scalar(*basic_left) && is_vector_or_matrix(*basic_right))
697 type = (elem_compat==RIGHT_CONVERTIBLE ? find_type(*elem_left, basic_right->kind, basic_right->size) : basic_right);
698 else if(is_vector_or_matrix(*basic_left) && is_scalar(*basic_right))
699 type = (elem_compat==LEFT_CONVERTIBLE ? find_type(*elem_right, basic_left->kind, basic_left->size) : basic_left);
703 else if(compat==LEFT_CONVERTIBLE)
711 if(assign && type!=basic_left)
714 bool converted = true;
715 if(compat==LEFT_CONVERTIBLE)
716 convert_to(binary.left, *basic_right);
717 else if(compat==RIGHT_CONVERTIBLE)
718 convert_to(binary.right, *basic_left);
719 else if(elem_compat==LEFT_CONVERTIBLE)
720 converted = convert_to_element(binary.left, *elem_right);
721 else if(elem_compat==RIGHT_CONVERTIBLE)
722 converted = convert_to_element(binary.right, *elem_left);
727 resolve(binary, type, assign);
730 void ExpressionResolver::visit(BinaryExpression &binary)
732 TraversingVisitor::visit(binary);
733 visit(binary, false);
736 void ExpressionResolver::visit(Assignment &assign)
738 TraversingVisitor::visit(assign);
740 if(assign.oper->token[0]!='=')
741 return visit(assign, true);
742 else if(assign.left->type!=assign.right->type)
744 BasicTypeDeclaration *basic_left = dynamic_cast<BasicTypeDeclaration *>(assign.left->type);
745 BasicTypeDeclaration *basic_right = dynamic_cast<BasicTypeDeclaration *>(assign.right->type);
746 if(!basic_left || !basic_right)
749 Compatibility compat = get_compatibility(*basic_left, *basic_right);
750 if(compat==RIGHT_CONVERTIBLE)
751 convert_to(assign.right, *basic_left);
752 else if(compat!=SAME_TYPE)
756 resolve(assign, assign.left->type, true);
759 void ExpressionResolver::visit(FunctionCall &call)
761 TraversingVisitor::visit(call);
763 TypeDeclaration *type = 0;
765 type = call.declaration->return_type_declaration;
766 else if(call.constructor)
768 map<string, TypeDeclaration *>::const_iterator i=stage->types.find(call.name);
769 type = (i!=stage->types.end() ? i->second : 0);
771 resolve(call, type, false);
774 void ExpressionResolver::visit(BasicTypeDeclaration &type)
776 basic_types.push_back(&type);
779 void ExpressionResolver::visit(VariableDeclaration &var)
781 TraversingVisitor::visit(var);
782 if(!var.init_expression)
785 BasicTypeDeclaration *var_basic = dynamic_cast<BasicTypeDeclaration *>(var.type_declaration);
786 BasicTypeDeclaration *init_basic = dynamic_cast<BasicTypeDeclaration *>(var.init_expression->type);
787 if(!var_basic || !init_basic)
790 Compatibility compat = get_compatibility(*var_basic, *init_basic);
791 if(compat==RIGHT_CONVERTIBLE)
792 convert_to(var.init_expression, *var_basic);
796 void FunctionResolver::apply(Stage &s)
800 s.content.visit(*this);
803 void FunctionResolver::visit(FunctionCall &call)
805 map<string, FunctionDeclaration *>::iterator i = stage->functions.find(call.name);
806 if(i!=stage->functions.end())
807 call.declaration = i->second;
809 TraversingVisitor::visit(call);
812 void FunctionResolver::visit(FunctionDeclaration &func)
814 FunctionDeclaration *&stage_decl = stage->functions[func.name];
815 vector<FunctionDeclaration *> &decls = declarations[func.name];
816 if(func.definition==&func)
820 // Set all previous declarations to use this definition.
821 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
823 (*i)->definition = func.definition;
824 (*i)->body.body.clear();
833 func.definition = stage_decl->definition;
835 decls.push_back(&func);
837 TraversingVisitor::visit(func);
841 InterfaceGenerator::InterfaceGenerator():
843 function_scope(false),
846 iface_target_block(0)
849 string InterfaceGenerator::get_out_prefix(Stage::Type type)
851 if(type==Stage::VERTEX)
853 else if(type==Stage::GEOMETRY)
859 void InterfaceGenerator::apply(Stage &s)
862 iface_target_block = &stage->content;
864 in_prefix = get_out_prefix(stage->previous->type);
865 out_prefix = get_out_prefix(stage->type);
866 s.content.visit(*this);
867 NodeRemover().apply(s, nodes_to_remove);
870 void InterfaceGenerator::visit(Block &block)
872 SetForScope<Block *> set_block(current_block, &block);
873 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
875 assignment_insert_point = i;
876 if(&block==&stage->content)
877 iface_insert_point = i;
883 string InterfaceGenerator::change_prefix(const string &name, const string &prefix) const
885 unsigned offset = (name.compare(0, in_prefix.size(), in_prefix) ? 0 : in_prefix.size());
886 return prefix+name.substr(offset);
889 VariableDeclaration *InterfaceGenerator::generate_interface(VariableDeclaration &var, const string &iface, const string &name)
891 if(stage->content.variables.count(name))
894 VariableDeclaration* iface_var = new VariableDeclaration;
895 iface_var->sampling = var.sampling;
896 iface_var->interface = iface;
897 iface_var->type = var.type;
898 iface_var->name = name;
899 /* Geometry shader inputs are always arrays. But if we're bringing in an
900 entire block, the array is on the block and not individual variables. */
901 if(stage->type==Stage::GEOMETRY && !copy_block)
902 iface_var->array = ((var.array && var.interface!="in") || iface=="in");
904 iface_var->array = var.array;
906 iface_var->array_size = var.array_size;
909 iface_var->layout = var.layout;
910 iface_var->linked_declaration = &var;
911 var.linked_declaration = iface_var;
914 iface_target_block->body.insert(iface_insert_point, iface_var);
915 iface_target_block->variables.insert(make_pair(name, iface_var));
920 InterfaceBlock *InterfaceGenerator::generate_interface(InterfaceBlock &out_block)
922 if(stage->interface_blocks.count("in"+out_block.name))
925 InterfaceBlock *in_block = new InterfaceBlock;
926 in_block->interface = "in";
927 in_block->name = out_block.name;
928 in_block->instance_name = out_block.instance_name;
929 if(stage->type==Stage::GEOMETRY)
930 in_block->array = true;
932 in_block->array = out_block.array;
933 in_block->linked_block = &out_block;
934 out_block.linked_block = in_block;
937 SetFlag set_copy(copy_block, true);
938 SetForScope<Block *> set_target(iface_target_block, &in_block->members);
939 SetForScope<NodeList<Statement>::iterator> set_ins_pt(iface_insert_point, in_block->members.body.end());
940 out_block.members.visit(*this);
943 iface_target_block->body.insert(iface_insert_point, in_block);
944 stage->interface_blocks.insert(make_pair("in"+in_block->name, in_block));
945 if(!in_block->instance_name.empty())
946 stage->interface_blocks.insert(make_pair("_"+in_block->instance_name, in_block));
948 SetFlag set_scope(function_scope, false);
949 SetForScope<Block *> set_block(current_block, &stage->content);
950 in_block->visit(*this);
955 ExpressionStatement &InterfaceGenerator::insert_assignment(const string &left, Expression *right)
957 Assignment *assign = new Assignment;
958 VariableReference *ref = new VariableReference;
961 assign->oper = &Operator::get_operator("=", Operator::BINARY);
962 assign->right = right;
964 ExpressionStatement *stmt = new ExpressionStatement;
965 stmt->expression = assign;
966 current_block->body.insert(assignment_insert_point, stmt);
972 void InterfaceGenerator::visit(VariableReference &var)
974 if(var.declaration || !stage->previous)
976 /* Don't pull a variable from previous stage if we just generated an output
977 interface in this stage */
978 if(stage->content.variables.count(var.name))
981 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
982 map<string, VariableDeclaration *>::const_iterator i = prev_vars.find(var.name);
983 if(i==prev_vars.end() || i->second->interface!="out")
984 i = prev_vars.find(in_prefix+var.name);
985 if(i!=prev_vars.end() && i->second->interface=="out")
987 generate_interface(*i->second, "in", i->second->name);
988 var.name = i->second->name;
992 const map<string, InterfaceBlock *> &prev_blocks = stage->previous->interface_blocks;
993 map<string, InterfaceBlock *>::const_iterator j = prev_blocks.find("_"+var.name);
994 if(j!=prev_blocks.end() && j->second->interface=="out")
996 generate_interface(*j->second);
997 /* Let VariableResolver convert the variable reference into an interface
1002 for(j=prev_blocks.begin(); j!=prev_blocks.end(); ++j)
1003 if(j->second->instance_name.empty())
1005 i = j->second->members.variables.find(var.name);
1006 if(i!=j->second->members.variables.end())
1008 generate_interface(*j->second);
1014 void InterfaceGenerator::visit(VariableDeclaration &var)
1018 generate_interface(var, "in", var.name);
1024 if(iface_block->linked_block)
1026 // Link all variables to their counterparts in the linked block.
1027 const map<string, VariableDeclaration *> &linked_vars = iface_block->linked_block->members.variables;
1028 map<string, VariableDeclaration *>::const_iterator i = linked_vars.find(var.name);
1029 if(i!=linked_vars.end())
1031 var.linked_declaration = i->second;
1032 var.linked_declaration->linked_declaration = &var;
1038 if(var.interface=="out")
1040 /* For output variables in function scope, generate a global interface
1041 and replace the local declaration with an assignment. */
1042 VariableDeclaration *out_var = 0;
1043 if(function_scope && (out_var=generate_interface(var, "out", var.name)))
1045 out_var->source = var.source;
1046 out_var->line = var.line;
1047 nodes_to_remove.insert(&var);
1048 if(var.init_expression)
1050 ExpressionStatement &stmt = insert_assignment(var.name, var.init_expression->clone());
1051 stmt.source = var.source;
1052 stmt.line = var.line;
1057 else if(var.interface=="in")
1059 /* Try to link input variables in global scope with output variables from
1061 if(current_block==&stage->content && !var.linked_declaration && stage->previous)
1063 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
1064 map<string, VariableDeclaration *>::const_iterator i = prev_vars.find(var.name);
1065 if(i!=prev_vars.end() && i->second->interface=="out")
1067 var.linked_declaration = i->second;
1068 i->second->linked_declaration = &var;
1073 TraversingVisitor::visit(var);
1076 void InterfaceGenerator::visit(InterfaceBlock &iface)
1078 if(iface.interface=="in")
1080 /* Try to link input blocks with output blocks sharing the same block
1081 name from previous stage. */
1082 if(!iface.linked_block && stage->previous)
1084 const map<string, InterfaceBlock *> &prev_blocks = stage->previous->interface_blocks;
1085 map<string, InterfaceBlock *>::const_iterator i = prev_blocks.find("out"+iface.name);
1086 if(i!=prev_blocks.end())
1088 iface.linked_block = i->second;
1089 i->second->linked_block = &iface;
1094 SetForScope<InterfaceBlock *> set_iface(iface_block, &iface);
1095 TraversingVisitor::visit(iface);
1098 void InterfaceGenerator::visit(FunctionDeclaration &func)
1100 SetFlag set_scope(function_scope, true);
1101 // Skip parameters because they're not useful here
1102 func.body.visit(*this);
1105 void InterfaceGenerator::visit(Passthrough &pass)
1107 vector<VariableDeclaration *> pass_vars;
1109 // Pass through all input variables of this stage.
1110 for(map<string, VariableDeclaration *>::const_iterator i=stage->content.variables.begin(); i!=stage->content.variables.end(); ++i)
1111 if(i->second->interface=="in")
1112 pass_vars.push_back(i->second);
1116 const map<string, VariableDeclaration *> &prev_vars = stage->previous->content.variables;
1117 for(map<string, VariableDeclaration *>::const_iterator i=prev_vars.begin(); i!=prev_vars.end(); ++i)
1119 if(i->second->interface!="out")
1122 /* Pass through output variables from the previous stage, but only
1123 those which are not already linked to an input here. */
1124 if(!i->second->linked_declaration && generate_interface(*i->second, "in", i->second->name))
1125 pass_vars.push_back(i->second);
1129 if(stage->type==Stage::GEOMETRY)
1131 /* Special case for geometry shader: copy gl_Position from input to
1133 InterfaceBlockReference *ref = new InterfaceBlockReference;
1134 ref->name = "gl_in";
1136 BinaryExpression *subscript = new BinaryExpression;
1137 subscript->left = ref;
1138 subscript->oper = &Operator::get_operator("[", Operator::BINARY);
1139 subscript->right = pass.subscript;
1141 MemberAccess *memacc = new MemberAccess;
1142 memacc->left = subscript;
1143 memacc->member = "gl_Position";
1145 insert_assignment("gl_Position", memacc);
1148 for(vector<VariableDeclaration *>::const_iterator i=pass_vars.begin(); i!=pass_vars.end(); ++i)
1150 string out_name = change_prefix((*i)->name, out_prefix);
1151 generate_interface(**i, "out", out_name);
1153 VariableReference *ref = new VariableReference;
1154 ref->name = (*i)->name;
1157 BinaryExpression *subscript = new BinaryExpression;
1158 subscript->left = ref;
1159 subscript->oper = &Operator::get_operator("[", Operator::BINARY);
1160 subscript->right = pass.subscript;
1161 insert_assignment(out_name, subscript);
1164 insert_assignment(out_name, ref);
1167 nodes_to_remove.insert(&pass);