2 #include <msp/core/raii.h>
3 #include <msp/strings/utils.h>
12 void BlockHierarchyResolver::enter(Block &block)
14 r_any_resolved |= (current_block!=block.parent);
15 block.parent = current_block;
19 TypeResolver::TypeResolver():
25 bool TypeResolver::apply(Stage &s)
29 r_any_resolved = false;
30 s.content.visit(*this);
31 return r_any_resolved;
34 TypeDeclaration *TypeResolver::get_or_create_array_type(TypeDeclaration &type)
36 map<TypeDeclaration *, TypeDeclaration *>::iterator i = array_types.find(&type);
37 if(i!=array_types.end())
40 BasicTypeDeclaration *array = new BasicTypeDeclaration;
41 array->source = INTERNAL_SOURCE;
42 array->name = type.name+"[]";
43 array->kind = BasicTypeDeclaration::ARRAY;
44 array->base = type.name;
45 array->base_type = &type;
46 stage->content.body.insert(type_insert_point, array);
47 array_types[&type] = array;
51 void TypeResolver::resolve_type(TypeDeclaration *&type, const string &name, bool array)
53 TypeDeclaration *resolved = 0;
54 map<string, TypeDeclaration *>::iterator i = stage->types.find(name);
55 if(i!=stage->types.end())
57 map<TypeDeclaration *, TypeDeclaration *>::iterator j = alias_map.find(i->second);
58 resolved = (j!=alias_map.end() ? j->second : i->second);
62 resolved = get_or_create_array_type(*resolved);
64 r_any_resolved |= (resolved!=type);
68 void TypeResolver::visit(Block &block)
70 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
73 type_insert_point = i;
78 void TypeResolver::visit(BasicTypeDeclaration &type)
80 resolve_type(type.base_type, type.base, false);
82 if(type.kind==BasicTypeDeclaration::VECTOR && type.base_type)
83 if(BasicTypeDeclaration *basic_base = dynamic_cast<BasicTypeDeclaration *>(type.base_type))
84 if(basic_base->kind==BasicTypeDeclaration::VECTOR)
86 type.kind = BasicTypeDeclaration::MATRIX;
87 /* A matrix's base type is its column vector type. This will put
88 the column vector's size, i.e. the matrix's row count, in the high
90 type.size |= basic_base->size<<16;
93 if(type.kind==BasicTypeDeclaration::ALIAS && type.base_type)
94 alias_map[&type] = type.base_type;
95 else if(type.kind==BasicTypeDeclaration::ARRAY && type.base_type)
96 array_types[type.base_type] = &type;
98 stage->types.insert(make_pair(type.name, &type));
101 void TypeResolver::visit(ImageTypeDeclaration &type)
103 resolve_type(type.base_type, type.base, false);
104 stage->types.insert(make_pair(type.name, &type));
107 void TypeResolver::visit(StructDeclaration &strct)
109 stage->types.insert(make_pair(strct.name, &strct));
110 TraversingVisitor::visit(strct);
113 void TypeResolver::visit(VariableDeclaration &var)
115 resolve_type(var.type_declaration, var.type, var.array);
116 if(iface_block && var.interface==iface_block->interface)
117 var.interface.clear();
120 void TypeResolver::visit(InterfaceBlock &iface)
124 SetForScope<InterfaceBlock *> set_iface(iface_block, &iface);
125 iface.members->visit(*this);
127 StructDeclaration *strct = new StructDeclaration;
128 strct->source = INTERNAL_SOURCE;
129 strct->name = format("_%s_%s", iface.interface, iface.block_name);
130 strct->members.body.splice(strct->members.body.begin(), iface.members->body);
131 stage->content.body.insert(type_insert_point, strct);
132 stage->types.insert(make_pair(strct->name, strct));
135 strct->interface_block = &iface;
136 iface.struct_declaration = strct;
139 TypeDeclaration *type = iface.struct_declaration;
140 if(type && iface.array)
141 type = get_or_create_array_type(*type);
142 r_any_resolved = (type!=iface.type_declaration);
143 iface.type_declaration = type;
146 void TypeResolver::visit(FunctionDeclaration &func)
148 resolve_type(func.return_type_declaration, func.return_type, false);
149 TraversingVisitor::visit(func);
153 VariableResolver::VariableResolver():
155 r_any_resolved(false),
156 record_target(false),
157 r_self_referencing(false)
160 bool VariableResolver::apply(Stage &s)
163 s.interface_blocks.clear();
164 r_any_resolved = false;
165 s.content.visit(*this);
166 for(vector<VariableDeclaration *>::const_iterator i=redeclared_builtins.begin(); i!=redeclared_builtins.end(); ++i)
167 (*i)->source = GENERATED_SOURCE;
168 NodeRemover().apply(s, nodes_to_remove);
169 return r_any_resolved;
172 void VariableResolver::enter(Block &block)
174 block.variables.clear();
177 void VariableResolver::visit(RefPtr<Expression> &expr)
179 r_replacement_expr = 0;
181 if(r_replacement_expr)
183 expr = r_replacement_expr;
184 /* Don't record assignment target when doing a replacement, because chain
185 information won't be correct. */
186 r_assignment_target.declaration = 0;
187 r_any_resolved = true;
189 r_replacement_expr = 0;
192 void VariableResolver::check_assignment_target(Statement *declaration)
196 if(r_assignment_target.declaration)
198 /* More than one reference found in assignment target. Unable to
199 determine what the primary target is. */
200 record_target = false;
201 r_assignment_target.declaration = 0;
204 r_assignment_target.declaration = declaration;
206 // TODO This check is overly broad and may prevent some optimizations.
207 else if(declaration && declaration==r_assignment_target.declaration)
208 r_self_referencing = true;
211 void VariableResolver::visit(VariableReference &var)
213 VariableDeclaration *declaration = 0;
215 /* Look for variable declarations in the block hierarchy first. Interface
216 blocks are always defined in the top level so we can't accidentally skip
218 for(Block *block=current_block; (!declaration && block); block=block->parent)
220 map<string, VariableDeclaration *>::iterator i = block->variables.find(var.name);
221 if(i!=block->variables.end())
222 declaration = i->second;
227 const map<string, InterfaceBlock *> &blocks = stage->interface_blocks;
228 map<string, InterfaceBlock *>::const_iterator i = blocks.find("_"+var.name);
231 /* The name refers to an interface block with an instance name rather
232 than a variable. Prepare a new syntax tree node accordingly. */
233 InterfaceBlockReference *iface_ref = new InterfaceBlockReference;
234 iface_ref->source = var.source;
235 iface_ref->line = var.line;
236 iface_ref->name = var.name;
237 iface_ref->declaration = i->second;
238 r_replacement_expr = iface_ref;
242 // Look for the variable in anonymous interface blocks.
243 for(i=blocks.begin(); (!declaration && i!=blocks.end()); ++i)
244 if(i->second->instance_name.empty() && i->second->struct_declaration)
246 const map<string, VariableDeclaration *> &iface_vars = i->second->struct_declaration->members.variables;
247 map<string, VariableDeclaration *>::const_iterator j = iface_vars.find(var.name);
248 if(j!=iface_vars.end())
249 declaration = j->second;
254 r_any_resolved |= (declaration!=var.declaration);
255 var.declaration = declaration;
257 check_assignment_target(var.declaration);
260 void VariableResolver::visit(InterfaceBlockReference &iface)
262 map<string, InterfaceBlock *>::iterator i = stage->interface_blocks.find("_"+iface.name);
263 InterfaceBlock *declaration = (i!=stage->interface_blocks.end() ? i->second : 0);
264 r_any_resolved |= (declaration!=iface.declaration);
265 iface.declaration = declaration;
267 check_assignment_target(iface.declaration);
270 void VariableResolver::add_to_chain(Assignment::Target::ChainType type, unsigned index)
272 if(r_assignment_target.chain_len<7)
273 r_assignment_target.chain[r_assignment_target.chain_len] = type | min<unsigned>(index, 0x3F);
274 ++r_assignment_target.chain_len;
277 void VariableResolver::visit(MemberAccess &memacc)
279 TraversingVisitor::visit(memacc);
281 VariableDeclaration *declaration = 0;
282 if(StructDeclaration *strct = dynamic_cast<StructDeclaration *>(memacc.left->type))
284 map<string, VariableDeclaration *>::iterator i = strct->members.variables.find(memacc.member);
285 if(i!=strct->members.variables.end())
287 declaration = i->second;
292 for(NodeList<Statement>::const_iterator j=strct->members.body.begin(); (j!=strct->members.body.end() && j->get()!=i->second); ++j)
295 add_to_chain(Assignment::Target::MEMBER, index);
299 else if(BasicTypeDeclaration *basic = dynamic_cast<BasicTypeDeclaration *>(memacc.left->type))
301 bool scalar_swizzle = ((basic->kind==BasicTypeDeclaration::INT || basic->kind==BasicTypeDeclaration::FLOAT) && memacc.member.size()==1);
302 bool vector_swizzle = (basic->kind==BasicTypeDeclaration::VECTOR && memacc.member.size()<=4);
303 if(scalar_swizzle || vector_swizzle)
305 static const char component_names[] = { 'x', 'r', 's', 'y', 'g', 't', 'z', 'b', 'p', 'w', 'a', 'q' };
308 UInt8 components[4] = { };
309 for(unsigned i=0; (ok && i<memacc.member.size()); ++i)
310 ok = ((components[i] = (find(component_names, component_names+12, memacc.member[i])-component_names)/3) < 4);
314 Swizzle *swizzle = new Swizzle;
315 swizzle->source = memacc.source;
316 swizzle->line = memacc.line;
317 swizzle->oper = memacc.oper;
318 swizzle->left = memacc.left;
319 swizzle->component_group = memacc.member;
320 swizzle->count = memacc.member.size();
321 copy(components, components+memacc.member.size(), swizzle->components);
322 r_replacement_expr = swizzle;
327 r_any_resolved |= (declaration!=memacc.declaration);
328 memacc.declaration = declaration;
331 void VariableResolver::visit(Swizzle &swizzle)
333 TraversingVisitor::visit(swizzle);
338 for(unsigned i=0; i<swizzle.count; ++i)
339 mask |= 1<<swizzle.components[i];
340 add_to_chain(Assignment::Target::SWIZZLE, mask);
344 void VariableResolver::visit(BinaryExpression &binary)
346 if(binary.oper->token[0]=='[')
349 /* The subscript expression is not a part of the primary assignment
351 SetFlag set(record_target, false);
358 unsigned index = 0x3F;
359 if(Literal *literal_subscript = dynamic_cast<Literal *>(binary.right.get()))
360 if(literal_subscript->value.check_type<int>())
361 index = literal_subscript->value.value<int>();
362 add_to_chain(Assignment::Target::ARRAY, index);
366 TraversingVisitor::visit(binary);
369 void VariableResolver::visit(Assignment &assign)
372 SetFlag set(record_target);
373 r_assignment_target = Assignment::Target();
375 r_any_resolved |= (r_assignment_target<assign.target || assign.target<r_assignment_target);
376 assign.target = r_assignment_target;
379 r_self_referencing = false;
381 assign.self_referencing = (r_self_referencing || assign.oper->token[0]!='=');
384 void VariableResolver::merge_layouts(Layout &to_layout, const Layout &from_layout)
386 for(vector<Layout::Qualifier>::const_iterator i=from_layout.qualifiers.begin(); i!=from_layout.qualifiers.end(); ++i)
389 for(vector<Layout::Qualifier>::iterator j=to_layout.qualifiers.begin(); (!found && j!=to_layout.qualifiers.end()); ++j)
392 j->has_value = i->value;
398 to_layout.qualifiers.push_back(*i);
402 void VariableResolver::visit(VariableDeclaration &var)
404 TraversingVisitor::visit(var);
405 VariableDeclaration *&ptr = current_block->variables[var.name];
408 else if(!current_block->parent && ptr->interface==var.interface && ptr->type==var.type)
410 if(ptr->source==BUILTIN_SOURCE)
411 redeclared_builtins.push_back(&var);
413 stage->diagnostics.push_back(Diagnostic(Diagnostic::WARN, var.source, var.line,
414 format("Redeclaring non-builtin variable '%s' is deprecated", var.name)));
416 if(var.init_expression)
417 ptr->init_expression = var.init_expression;
421 merge_layouts(*ptr->layout, *var.layout);
423 ptr->layout = var.layout;
425 nodes_to_remove.insert(&var);
427 r_any_resolved = true;
431 void VariableResolver::visit(InterfaceBlock &iface)
433 /* Block names can be reused in different interfaces. Prefix the name with
434 the first character of the interface to avoid conflicts. */
435 stage->interface_blocks.insert(make_pair(iface.interface+iface.block_name, &iface));
436 if(!iface.instance_name.empty())
437 stage->interface_blocks.insert(make_pair("_"+iface.instance_name, &iface));
439 TraversingVisitor::visit(iface);
443 ExpressionResolver::ExpressionResolver():
445 r_any_resolved(false)
448 bool ExpressionResolver::apply(Stage &s)
451 r_any_resolved = false;
452 s.content.visit(*this);
453 return r_any_resolved;
456 bool ExpressionResolver::is_scalar(BasicTypeDeclaration &type)
458 return (type.kind==BasicTypeDeclaration::INT || type.kind==BasicTypeDeclaration::FLOAT);
461 bool ExpressionResolver::is_vector_or_matrix(BasicTypeDeclaration &type)
463 return (type.kind==BasicTypeDeclaration::VECTOR || type.kind==BasicTypeDeclaration::MATRIX);
466 BasicTypeDeclaration *ExpressionResolver::get_element_type(BasicTypeDeclaration &type)
468 if(is_vector_or_matrix(type) || type.kind==BasicTypeDeclaration::ARRAY)
470 BasicTypeDeclaration *basic_base = dynamic_cast<BasicTypeDeclaration *>(type.base_type);
471 return (basic_base ? get_element_type(*basic_base) : 0);
477 bool ExpressionResolver::can_convert(BasicTypeDeclaration &from, BasicTypeDeclaration &to)
479 if(from.kind==BasicTypeDeclaration::INT && to.kind==BasicTypeDeclaration::FLOAT)
480 return from.size<=to.size;
481 else if(from.kind!=to.kind)
483 else if((from.kind==BasicTypeDeclaration::VECTOR || from.kind==BasicTypeDeclaration::MATRIX) && from.size==to.size)
485 BasicTypeDeclaration *from_base = dynamic_cast<BasicTypeDeclaration *>(from.base_type);
486 BasicTypeDeclaration *to_base = dynamic_cast<BasicTypeDeclaration *>(to.base_type);
487 return (from_base && to_base && can_convert(*from_base, *to_base));
493 ExpressionResolver::Compatibility ExpressionResolver::get_compatibility(BasicTypeDeclaration &left, BasicTypeDeclaration &right)
497 else if(can_convert(left, right))
498 return LEFT_CONVERTIBLE;
499 else if(can_convert(right, left))
500 return RIGHT_CONVERTIBLE;
502 return NOT_COMPATIBLE;
505 BasicTypeDeclaration *ExpressionResolver::find_type(BasicTypeDeclaration::Kind kind, unsigned size)
507 for(vector<BasicTypeDeclaration *>::const_iterator i=basic_types.begin(); i!=basic_types.end(); ++i)
508 if((*i)->kind==kind && (*i)->size==size)
513 BasicTypeDeclaration *ExpressionResolver::find_type(BasicTypeDeclaration &elem_type, BasicTypeDeclaration::Kind kind, unsigned size)
515 for(vector<BasicTypeDeclaration *>::const_iterator i=basic_types.begin(); i!=basic_types.end(); ++i)
516 if(get_element_type(**i)==&elem_type && (*i)->kind==kind && (*i)->size==size)
521 void ExpressionResolver::convert_to(RefPtr<Expression> &expr, BasicTypeDeclaration &type)
523 RefPtr<FunctionCall> call = new FunctionCall;
524 call->name = type.name;
525 call->constructor = true;
526 call->arguments.push_back_nocopy(expr);
531 bool ExpressionResolver::convert_to_element(RefPtr<Expression> &expr, BasicTypeDeclaration &elem_type)
533 if(BasicTypeDeclaration *expr_basic = dynamic_cast<BasicTypeDeclaration *>(expr->type))
535 BasicTypeDeclaration *to_type = &elem_type;
536 if(is_vector_or_matrix(*expr_basic))
537 to_type = find_type(elem_type, expr_basic->kind, expr_basic->size);
540 convert_to(expr, *to_type);
548 bool ExpressionResolver::truncate_vector(RefPtr<Expression> &expr, unsigned size)
550 if(BasicTypeDeclaration *expr_basic = dynamic_cast<BasicTypeDeclaration *>(expr->type))
551 if(BasicTypeDeclaration *expr_elem = get_element_type(*expr_basic))
553 RefPtr<Swizzle> swizzle = new Swizzle;
554 swizzle->left = expr;
555 swizzle->oper = &Operator::get_operator(".", Operator::POSTFIX);
556 swizzle->component_group = string("xyzw", size);
557 swizzle->count = size;
558 for(unsigned i=0; i<size; ++i)
559 swizzle->components[i] = i;
561 swizzle->type = expr_elem;
563 swizzle->type = find_type(*expr_elem, BasicTypeDeclaration::VECTOR, size);
572 void ExpressionResolver::resolve(Expression &expr, TypeDeclaration *type, bool lvalue)
574 r_any_resolved |= (type!=expr.type || lvalue!=expr.lvalue);
576 expr.lvalue = lvalue;
579 void ExpressionResolver::visit(Block &block)
581 SetForScope<Block *> set_block(current_block, &block);
582 for(NodeList<Statement>::iterator i=block.body.begin(); i!=block.body.end(); ++i)
589 void ExpressionResolver::visit(Literal &literal)
591 if(literal.value.check_type<bool>())
592 resolve(literal, find_type(BasicTypeDeclaration::BOOL, 1), false);
593 else if(literal.value.check_type<int>())
594 resolve(literal, find_type(BasicTypeDeclaration::INT, 32), false);
595 else if(literal.value.check_type<float>())
596 resolve(literal, find_type(BasicTypeDeclaration::FLOAT, 32), false);
599 void ExpressionResolver::visit(VariableReference &var)
602 resolve(var, var.declaration->type_declaration, true);
605 void ExpressionResolver::visit(InterfaceBlockReference &iface)
607 if(iface.declaration)
608 resolve(iface, iface.declaration->type_declaration, true);
611 void ExpressionResolver::visit(MemberAccess &memacc)
613 TraversingVisitor::visit(memacc);
615 if(memacc.declaration)
616 resolve(memacc, memacc.declaration->type_declaration, memacc.left->lvalue);
619 void ExpressionResolver::visit(Swizzle &swizzle)
621 TraversingVisitor::visit(swizzle);
623 if(BasicTypeDeclaration *left_basic = dynamic_cast<BasicTypeDeclaration *>(swizzle.left->type))
625 BasicTypeDeclaration *left_elem = get_element_type(*left_basic);
627 resolve(swizzle, left_elem, swizzle.left->lvalue);
628 else if(left_basic->kind==BasicTypeDeclaration::VECTOR && left_elem)
629 resolve(swizzle, find_type(*left_elem, left_basic->kind, swizzle.count), swizzle.left->lvalue);
633 void ExpressionResolver::visit(UnaryExpression &unary)
635 TraversingVisitor::visit(unary);
637 BasicTypeDeclaration *basic = dynamic_cast<BasicTypeDeclaration *>(unary.expression->type);
641 char oper = unary.oper->token[0];
644 if(basic->kind!=BasicTypeDeclaration::BOOL)
649 if(basic->kind!=BasicTypeDeclaration::INT)
652 else if(oper=='+' || oper=='-')
654 BasicTypeDeclaration *elem = get_element_type(*basic);
655 if(!elem || !is_scalar(*elem))
658 resolve(unary, basic, unary.expression->lvalue);
661 void ExpressionResolver::visit(BinaryExpression &binary, bool assign)
663 /* Binary operators are only defined for basic types (not for image or
665 BasicTypeDeclaration *basic_left = dynamic_cast<BasicTypeDeclaration *>(binary.left->type);
666 BasicTypeDeclaration *basic_right = dynamic_cast<BasicTypeDeclaration *>(binary.right->type);
667 if(!basic_left || !basic_right)
670 char oper = binary.oper->token[0];
673 /* Subscripting operates on vectors, matrices and arrays, and the right
674 operand must be an integer. */
675 if((!is_vector_or_matrix(*basic_left) && basic_left->kind!=BasicTypeDeclaration::ARRAY) || basic_right->kind!=BasicTypeDeclaration::INT)
678 resolve(binary, basic_left->base_type, binary.left->lvalue);
681 else if(basic_left->kind==BasicTypeDeclaration::ARRAY || basic_right->kind==BasicTypeDeclaration::ARRAY)
682 // No other binary operator can be used with arrays.
685 BasicTypeDeclaration *elem_left = get_element_type(*basic_left);
686 BasicTypeDeclaration *elem_right = get_element_type(*basic_right);
687 if(!elem_left || !elem_right)
690 Compatibility compat = get_compatibility(*basic_left, *basic_right);
691 Compatibility elem_compat = get_compatibility(*elem_left, *elem_right);
692 if(elem_compat==NOT_COMPATIBLE)
694 if(assign && (compat==LEFT_CONVERTIBLE || elem_compat==LEFT_CONVERTIBLE))
697 TypeDeclaration *type = 0;
698 char oper2 = binary.oper->token[1];
699 if((oper=='<' && oper2!='<') || (oper=='>' && oper2!='>'))
701 /* Relational operators compare two scalar integer or floating-point
703 if(!is_scalar(*elem_left) || !is_scalar(*elem_right) || compat==NOT_COMPATIBLE)
706 type = find_type(BasicTypeDeclaration::BOOL, 1);
708 else if((oper=='=' || oper=='!') && oper2=='=')
710 // Equality comparison can be done on any compatible types.
711 if(compat==NOT_COMPATIBLE)
714 type = find_type(BasicTypeDeclaration::BOOL, 1);
716 else if(oper2=='&' || oper2=='|' || oper2=='^')
718 // Logical operators can only be applied to booleans.
719 if(basic_left->kind!=BasicTypeDeclaration::BOOL || basic_right->kind!=BasicTypeDeclaration::BOOL)
724 else if((oper=='&' || oper=='|' || oper=='^' || oper=='%') && !oper2)
726 // Bitwise operators and modulo can only be applied to integers.
727 if(basic_left->kind!=BasicTypeDeclaration::INT || basic_right->kind!=BasicTypeDeclaration::INT)
730 type = (compat==LEFT_CONVERTIBLE ? basic_right : basic_left);
732 else if((oper=='<' || oper=='>') && oper2==oper)
734 // Shifts apply to integer scalars and vectors, with some restrictions.
735 if(elem_left->kind!=BasicTypeDeclaration::INT || elem_right->kind!=BasicTypeDeclaration::INT)
737 unsigned left_size = (basic_left->kind==BasicTypeDeclaration::INT ? 1 : basic_left->kind==BasicTypeDeclaration::VECTOR ? basic_left->size : 0);
738 unsigned right_size = (basic_right->kind==BasicTypeDeclaration::INT ? 1 : basic_right->kind==BasicTypeDeclaration::VECTOR ? basic_right->size : 0);
739 if(!left_size || (left_size==1 && right_size!=1) || (left_size>1 && right_size!=1 && right_size!=left_size))
743 // Don't perform conversion even if the operands are of different sizes.
746 else if(oper=='+' || oper=='-' || oper=='*' || oper=='/')
748 // Arithmetic operators require scalar elements.
749 if(!is_scalar(*elem_left) || !is_scalar(*elem_right))
752 if(oper=='*' && is_vector_or_matrix(*basic_left) && is_vector_or_matrix(*basic_right) &&
753 (basic_left->kind==BasicTypeDeclaration::MATRIX || basic_right->kind==BasicTypeDeclaration::MATRIX))
755 /* Multiplication has special rules when at least one operand is a
756 matrix and the other is a vector or a matrix. */
757 unsigned left_columns = basic_left->size&0xFFFF;
758 unsigned right_rows = basic_right->size;
759 if(basic_right->kind==BasicTypeDeclaration::MATRIX)
761 if(left_columns!=right_rows)
764 BasicTypeDeclaration *elem_result = (elem_compat==LEFT_CONVERTIBLE ? elem_right : elem_left);
766 if(basic_left->kind==BasicTypeDeclaration::VECTOR)
767 type = find_type(*elem_result, BasicTypeDeclaration::VECTOR, basic_right->size&0xFFFF);
768 else if(basic_right->kind==BasicTypeDeclaration::VECTOR)
769 type = find_type(*elem_result, BasicTypeDeclaration::VECTOR, basic_left->size>>16);
771 type = find_type(*elem_result, BasicTypeDeclaration::MATRIX, (basic_left->size&0xFFFF0000)|(basic_right->size&0xFFFF));
773 else if(compat==NOT_COMPATIBLE)
775 // Arithmetic between scalars and matrices or vectors is supported.
776 if(is_scalar(*basic_left) && is_vector_or_matrix(*basic_right))
777 type = (elem_compat==RIGHT_CONVERTIBLE ? find_type(*elem_left, basic_right->kind, basic_right->size) : basic_right);
778 else if(is_vector_or_matrix(*basic_left) && is_scalar(*basic_right))
779 type = (elem_compat==LEFT_CONVERTIBLE ? find_type(*elem_right, basic_left->kind, basic_left->size) : basic_left);
783 else if(compat==LEFT_CONVERTIBLE)
791 if(assign && type!=basic_left)
794 bool converted = true;
795 if(compat==LEFT_CONVERTIBLE)
796 convert_to(binary.left, *basic_right);
797 else if(compat==RIGHT_CONVERTIBLE)
798 convert_to(binary.right, *basic_left);
799 else if(elem_compat==LEFT_CONVERTIBLE)
800 converted = convert_to_element(binary.left, *elem_right);
801 else if(elem_compat==RIGHT_CONVERTIBLE)
802 converted = convert_to_element(binary.right, *elem_left);
807 resolve(binary, type, assign);
810 void ExpressionResolver::visit(BinaryExpression &binary)
812 TraversingVisitor::visit(binary);
813 visit(binary, false);
816 void ExpressionResolver::visit(Assignment &assign)
818 TraversingVisitor::visit(assign);
820 if(assign.oper->token[0]!='=')
821 return visit(assign, true);
822 else if(assign.left->type!=assign.right->type)
824 BasicTypeDeclaration *basic_left = dynamic_cast<BasicTypeDeclaration *>(assign.left->type);
825 BasicTypeDeclaration *basic_right = dynamic_cast<BasicTypeDeclaration *>(assign.right->type);
826 if(!basic_left || !basic_right)
829 Compatibility compat = get_compatibility(*basic_left, *basic_right);
830 if(compat==RIGHT_CONVERTIBLE)
831 convert_to(assign.right, *basic_left);
832 else if(compat!=SAME_TYPE)
836 resolve(assign, assign.left->type, true);
839 void ExpressionResolver::visit(TernaryExpression &ternary)
841 TraversingVisitor::visit(ternary);
843 BasicTypeDeclaration *basic_cond = dynamic_cast<BasicTypeDeclaration *>(ternary.condition->type);
844 if(!basic_cond || basic_cond->kind!=BasicTypeDeclaration::BOOL)
847 TypeDeclaration *type = 0;
848 if(ternary.true_expr->type==ternary.false_expr->type)
849 type = ternary.true_expr->type;
852 BasicTypeDeclaration *basic_true = dynamic_cast<BasicTypeDeclaration *>(ternary.true_expr->type);
853 BasicTypeDeclaration *basic_false = dynamic_cast<BasicTypeDeclaration *>(ternary.false_expr->type);
854 if(!basic_true || !basic_false)
857 Compatibility compat = get_compatibility(*basic_true, *basic_false);
858 if(compat==NOT_COMPATIBLE)
861 type = (compat==LEFT_CONVERTIBLE ? basic_true : basic_false);
863 if(compat==LEFT_CONVERTIBLE)
864 convert_to(ternary.true_expr, *basic_false);
865 else if(compat==RIGHT_CONVERTIBLE)
866 convert_to(ternary.false_expr, *basic_true);
869 resolve(ternary, type, false);
872 void ExpressionResolver::visit_constructor(FunctionCall &call)
874 if(call.arguments.empty())
877 map<string, TypeDeclaration *>::const_iterator i = stage->types.find(call.name);
878 if(i==stage->types.end())
880 else if(BasicTypeDeclaration *basic = dynamic_cast<BasicTypeDeclaration *>(i->second))
882 BasicTypeDeclaration *elem = get_element_type(*basic);
886 vector<ArgumentInfo> args;
887 args.reserve(call.arguments.size());
888 unsigned arg_component_total = 0;
889 bool has_matrices = false;
890 for(NodeArray<Expression>::const_iterator j=call.arguments.begin(); j!=call.arguments.end(); ++j)
893 if(!(info.type=dynamic_cast<BasicTypeDeclaration *>((*j)->type)))
895 if(is_scalar(*info.type) || info.type->kind==BasicTypeDeclaration::BOOL)
896 info.component_count = 1;
897 else if(info.type->kind==BasicTypeDeclaration::VECTOR)
898 info.component_count = info.type->size;
899 else if(info.type->kind==BasicTypeDeclaration::MATRIX)
901 info.component_count = (info.type->size>>16)*(info.type->size&0xFFFF);
906 arg_component_total += info.component_count;
907 args.push_back(info);
910 bool convert_args = false;
911 if((is_scalar(*basic) || basic->kind==BasicTypeDeclaration::BOOL) && call.arguments.size()==1 && !has_matrices)
913 if(arg_component_total>1)
914 truncate_vector(call.arguments.front(), 1);
916 /* Single-element type constructors never need to convert their
917 arguments because the constructor *is* the conversion. */
919 else if(basic->kind==BasicTypeDeclaration::VECTOR && !has_matrices)
921 /* Vector constructors need either a single scalar argument or
922 enough components to fill out the vector. */
923 if(arg_component_total!=1 && arg_component_total<basic->size)
926 /* A vector of same size can be converted directly. For other
927 combinations the individual arguments need to be converted. */
928 if(call.arguments.size()==1)
930 if(arg_component_total==1)
932 else if(arg_component_total>basic->size)
933 truncate_vector(call.arguments.front(), basic->size);
935 else if(arg_component_total==basic->size)
940 else if(basic->kind==BasicTypeDeclaration::MATRIX)
942 unsigned column_count = basic->size&0xFFFF;
943 unsigned row_count = basic->size>>16;
944 if(call.arguments.size()==1)
946 /* A matrix can be constructed from a single element or another
947 matrix of sufficient size. */
948 if(arg_component_total==1)
950 else if(args.front().type->kind==BasicTypeDeclaration::MATRIX)
952 unsigned arg_columns = args.front().type->size&0xFFFF;
953 unsigned arg_rows = args.front().type->size>>16;
954 if(arg_columns<column_count || arg_rows<row_count)
957 /* Always generate a temporary here and let the optimization
958 stage inline it if that's reasonable. */
959 RefPtr<VariableDeclaration> temporary = new VariableDeclaration;
960 temporary->type = args.front().type->name;
961 temporary->name = get_unused_variable_name(*current_block, "_temp");
962 temporary->init_expression = call.arguments.front();
963 current_block->body.insert(insert_point, temporary);
965 // Create expressions to build each column.
966 vector<RefPtr<Expression> > columns;
967 columns.reserve(column_count);
968 for(unsigned j=0; j<column_count; ++j)
970 RefPtr<VariableReference> ref = new VariableReference;
971 ref->name = temporary->name;
973 RefPtr<Literal> index = new Literal;
974 index->token = lexical_cast<string>(j);
975 index->value = static_cast<int>(j);
977 RefPtr<BinaryExpression> subscript = new BinaryExpression;
978 subscript->left = ref;
979 subscript->oper = &Operator::get_operator("[", Operator::BINARY);
980 subscript->right = index;
981 subscript->type = args.front().type->base_type;
983 columns.push_back(subscript);
984 if(arg_rows>row_count)
985 truncate_vector(columns.back(), row_count);
988 call.arguments.resize(column_count);
989 copy(columns.begin(), columns.end(), call.arguments.begin());
991 /* Let VariableResolver process the new nodes and finish
992 resolving the constructor on the next pass. */
993 r_any_resolved = true;
999 else if(arg_component_total==column_count*row_count && !has_matrices)
1001 /* Construct a matrix from individual components in column-major
1002 order. Arguments must align at column boundaries. */
1003 vector<RefPtr<Expression> > columns;
1004 columns.reserve(column_count);
1006 vector<RefPtr<Expression> > column_args;
1007 column_args.reserve(row_count);
1008 unsigned column_component_count = 0;
1010 for(unsigned j=0; j<call.arguments.size(); ++j)
1012 const ArgumentInfo &info = args[j];
1013 if(!column_component_count && info.type->kind==BasicTypeDeclaration::VECTOR && info.component_count==row_count)
1014 // A vector filling the entire column can be used as is.
1015 columns.push_back(call.arguments[j]);
1018 column_args.push_back(call.arguments[j]);
1019 column_component_count += info.component_count;
1020 if(column_component_count==row_count)
1022 /* The column has filled up. Create a vector constructor
1024 RefPtr<FunctionCall> column_call = new FunctionCall;
1025 column_call->name = basic->base_type->name;
1026 column_call->constructor = true;
1027 column_call->arguments.resize(column_args.size());
1028 copy(column_args.begin(), column_args.end(), column_call->arguments.begin());
1029 column_call->type = basic->base_type;
1030 visit_constructor(*column_call);
1031 columns.push_back(column_call);
1033 column_args.clear();
1034 column_component_count = 0;
1036 else if(column_component_count>row_count)
1037 // Argument alignment mismatch.
1050 // The argument list may have changed so can't rely on args.
1051 for(NodeArray<Expression>::iterator j=call.arguments.begin(); j!=call.arguments.end(); ++j)
1052 if(BasicTypeDeclaration *basic_arg = dynamic_cast<BasicTypeDeclaration *>((*j)->type))
1054 BasicTypeDeclaration *elem_arg = get_element_type(*basic_arg);
1056 convert_to_element(*j, *elem);
1060 else if(StructDeclaration *strct = dynamic_cast<StructDeclaration *>(i->second))
1062 if(call.arguments.size()!=strct->members.body.size())
1066 for(NodeList<Statement>::const_iterator j=strct->members.body.begin(); j!=strct->members.body.end(); ++j, ++k)
1068 if(VariableDeclaration *var = dynamic_cast<VariableDeclaration *>(j->get()))
1070 if(!call.arguments[k]->type || call.arguments[k]->type!=var->type_declaration)
1078 resolve(call, i->second, false);
1081 void ExpressionResolver::visit(FunctionCall &call)
1083 TraversingVisitor::visit(call);
1085 if(call.declaration)
1086 resolve(call, call.declaration->return_type_declaration, false);
1087 else if(call.constructor)
1088 visit_constructor(call);
1091 void ExpressionResolver::visit(BasicTypeDeclaration &type)
1093 basic_types.push_back(&type);
1096 void ExpressionResolver::visit(VariableDeclaration &var)
1098 TraversingVisitor::visit(var);
1099 if(!var.init_expression)
1102 BasicTypeDeclaration *var_basic = dynamic_cast<BasicTypeDeclaration *>(var.type_declaration);
1103 BasicTypeDeclaration *init_basic = dynamic_cast<BasicTypeDeclaration *>(var.init_expression->type);
1104 if(!var_basic || !init_basic)
1107 Compatibility compat = get_compatibility(*var_basic, *init_basic);
1108 if(compat==RIGHT_CONVERTIBLE)
1109 convert_to(var.init_expression, *var_basic);
1113 bool FunctionResolver::apply(Stage &s)
1116 s.functions.clear();
1117 r_any_resolved = false;
1118 s.content.visit(*this);
1119 return r_any_resolved;
1122 void FunctionResolver::visit(FunctionCall &call)
1124 FunctionDeclaration *declaration = 0;
1125 if(stage->types.count(call.name))
1126 call.constructor = true;
1130 bool has_signature = true;
1131 for(NodeArray<Expression>::const_iterator i=call.arguments.begin(); (has_signature && i!=call.arguments.end()); ++i)
1134 append(arg_types, ",", (*i)->type->name);
1136 has_signature = false;
1141 map<string, FunctionDeclaration *>::iterator i = stage->functions.find(format("%s(%s)", call.name, arg_types));
1142 declaration = (i!=stage->functions.end() ? i->second : 0);
1146 r_any_resolved |= (declaration!=call.declaration);
1147 call.declaration = declaration;
1149 TraversingVisitor::visit(call);
1152 void FunctionResolver::visit(FunctionDeclaration &func)
1154 if(func.signature.empty())
1157 for(NodeArray<VariableDeclaration>::const_iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
1159 if((*i)->type_declaration)
1160 append(param_types, ",", (*i)->type_declaration->name);
1164 func.signature = format("(%s)", param_types);
1165 r_any_resolved = true;
1168 string key = func.name+func.signature;
1169 FunctionDeclaration *&stage_decl = stage->functions[key];
1170 vector<FunctionDeclaration *> &decls = declarations[key];
1171 if(func.definition==&func)
1173 if(stage_decl && stage_decl->definition)
1176 stage->diagnostics.push_back(Diagnostic(Diagnostic::WARN, func.source, func.line,
1177 format("Overriding function '%s' without the override keyword is deprecated", key)));
1178 if(!stage_decl->definition->virtua)
1179 stage->diagnostics.push_back(Diagnostic(Diagnostic::WARN, func.source, func.line,
1180 format("Overriding function '%s' not declared as virtual is deprecated", key)));
1184 // Set all previous declarations to use this definition.
1185 for(vector<FunctionDeclaration *>::iterator i=decls.begin(); i!=decls.end(); ++i)
1187 r_any_resolved |= (func.definition!=(*i)->definition);
1188 (*i)->definition = func.definition;
1189 (*i)->body.body.clear();
1194 FunctionDeclaration *definition = (stage_decl ? stage_decl->definition : 0);
1195 r_any_resolved |= (definition!=func.definition);
1196 func.definition = definition;
1201 decls.push_back(&func);
1203 TraversingVisitor::visit(func);