1 #include <msp/stringcodec/utf8.h>
2 #include <msp/strings/format.h>
11 const std::string &DumpTree::apply(Stage &stage)
13 formatted = format("Stage: %s\n", Stage::get_stage_name(stage.type));
14 tree.push_back(BRANCH);
15 append(format("Version: %d.%02d", stage.required_features.glsl_version.major, stage.required_features.glsl_version.minor));
17 for(std::map<string, TypeDeclaration *>::const_iterator i=stage.types.begin(); i!=stage.types.end(); ++i)
18 append(format("Type: %%%d %s", get_label(*i->second), i->first));
20 set<InterfaceBlock *> seen_interfaces;
21 for(std::map<string, InterfaceBlock *>::const_iterator i=stage.interface_blocks.begin(); i!=stage.interface_blocks.end(); ++i)
22 if(seen_interfaces.insert(i->second).second)
24 string text = format("Interface block: %%%d %s %s", get_label(*i->second), i->second->interface, i->second->block_name);
25 if(!i->second->instance_name.empty())
26 text += format(" %s", i->second->instance_name);
30 for(std::map<string, FunctionDeclaration *>::const_iterator i=stage.functions.begin(); i!=stage.functions.end(); ++i)
31 append(format("Function: %%%d %s", get_label(*i->second), i->first));
34 stage.content.visit(*this);
38 void DumpTree::append(const string &line)
40 StringCodec::Utf8::Encoder enc;
41 for(vector<TreeChars>::const_iterator i=tree.begin(); i!=tree.end(); )
43 enc.encode_char(*i++, formatted);
44 enc.encode_char((i==tree.end() ? REACH : EMPTY), formatted);
50 void DumpTree::append_subtree(const vector<Branch> &branches)
53 for(vector<Branch>::const_iterator i=branches.begin(); i!=branches.end(); )
55 vector<Branch>::const_iterator j = increment(i, branches);
59 annotated_branch(j->text, *j->node);
64 j->node->visit(*this);
69 void DumpTree::begin_sub()
71 tree.back() = (tree.back()==BRANCH_LAST ? EMPTY : STRAIGHT);
72 tree.push_back(BRANCH);
75 void DumpTree::last_branch()
77 tree.back() = BRANCH_LAST;
80 void DumpTree::end_sub()
83 if(tree.back()==STRAIGHT)
87 void DumpTree::annotated_branch(const string &annotation, Node &node)
96 unsigned DumpTree::get_label(const Node &node)
98 unsigned &label = node_labels[&node];
100 label = node_labels.size();
104 string DumpTree::format_type(TypeDeclaration *type)
106 return (type ? type->name : "?");
110 typename T::const_iterator DumpTree::increment(typename T::const_iterator &iter, const T &container)
112 typename T::const_iterator ret = iter++;
113 if(iter==container.end())
118 void DumpTree::visit(Block &block)
120 append(format("Block %s", (block.use_braces ? "{}" : "(inline)")));
123 for(std::map<string, VariableDeclaration *>::const_iterator i=block.variables.begin(); i!=block.variables.end(); ++i)
124 append(format("Variable: %%%d %s %s", get_label(*i->second), i->second->type, i->first));
126 bool labeled_body = !block.variables.empty();
133 for(NodeList<Statement>::const_iterator i=block.body.begin(); i!=block.body.end(); )
135 NodeList<Statement>::const_iterator j = increment(i, block.body);
144 void DumpTree::visit(Literal &literal)
146 append(format("Literal: %s -> %s", literal.token, format_type(literal.type)));
149 void DumpTree::visit(VariableReference &var)
153 text += format("%%%d ", get_label(*var.declaration));
154 text += format("%s (var) -> %s", var.name, format_type(var.type));
158 void DumpTree::visit(InterfaceBlockReference &iface)
161 if(iface.declaration)
162 text += format("%%%d ", get_label(*iface.declaration));
163 text += format("%s (iface) -> %s", iface.name, format_type(iface.type));
167 void DumpTree::visit(MemberAccess &memacc)
169 string text = "Member access:";
170 if(memacc.declaration)
171 text += format(" %%%d", get_label(*memacc.declaration));
172 text += format(" .%s -> %s", memacc.member, format_type(memacc.type));
173 annotated_branch(text, *memacc.left);
176 void DumpTree::visit(Swizzle &swizzle)
178 static const char components[4] = { 'x', 'y', 'z', 'w' };
179 string text = "Swizzle: .";
180 for(unsigned i=0; i<swizzle.count; ++i)
181 text += components[swizzle.components[i]];
182 text += format(" -> %s", format_type(swizzle.type));
183 annotated_branch(text, *swizzle.left);
186 void DumpTree::visit(UnaryExpression &unary)
188 string text = format("Unary: %s, %sfix -> %s", unary.oper->token, (unary.oper->type==Operator::PREFIX ? "pre" : "post"), format_type(unary.type));
189 annotated_branch(text, *unary.expression);
192 void DumpTree::visit(BinaryExpression &binary)
194 append(format("Binary: %s%s -> %s", binary.oper->token, binary.oper->token2, format_type(binary.type)));
196 binary.left->visit(*this);
198 binary.right->visit(*this);
202 void DumpTree::visit(Assignment &assign)
204 append(format("Assignment: %s%s -> %s", assign.oper->token, (assign.self_referencing ? " (self-referencing)" : ""), format_type(assign.type)));
206 if(assign.target.declaration)
208 string text = format("Target: %%%d", get_label(*assign.target.declaration));
210 static const char swizzle[4] = { 'x', 'y', 'z', 'w' };
211 for(unsigned i=0; i<assign.target.chain_len; ++i)
213 unsigned component = assign.target.chain[i];
214 switch(static_cast<Assignment::Target::ChainType>(component&0xC0))
216 case Assignment::Target::MEMBER:
217 text += format(" .%d", component&0x3F);
219 case Assignment::Target::SWIZZLE:
221 for(unsigned j=0; j<4; ++j)
225 case Assignment::Target::ARRAY:
226 text += format(" [%d]", component&0x3F);
232 assign.left->visit(*this);
234 assign.right->visit(*this);
238 void DumpTree::visit(TernaryExpression &ternary)
240 append(format("Ternary: %s%s -> %s", ternary.oper->token, ternary.oper->token2, format_type(ternary.type)));
242 ternary.condition->visit(*this);
243 ternary.true_expr->visit(*this);
245 ternary.false_expr->visit(*this);
249 void DumpTree::visit(FunctionCall &call)
251 string head = "Function call: ";
253 head += format("%%%d ", get_label(*call.declaration));
256 head += " (constructor)";
257 head += format(" -> %s", format_type(call.type));
261 for(NodeArray<Expression>::const_iterator i=call.arguments.begin(); i!=call.arguments.end(); )
263 NodeArray<Expression>::const_iterator j = increment(i, call.arguments);
269 void DumpTree::visit(ExpressionStatement &expr)
271 annotated_branch("expr;", *expr.expression);
274 void DumpTree::visit(Import &import)
276 append(format("import %s", import.module));
279 void DumpTree::visit(Precision &prec)
281 append(format("precision %s %s", prec.precision, prec.type));
284 void DumpTree::visit(Layout &layout)
288 for(vector<Layout::Qualifier>::const_iterator i=layout.qualifiers.begin(); i!=layout.qualifiers.end(); )
290 vector<Layout::Qualifier>::const_iterator j = increment(i, layout.qualifiers);
291 string qualifier = j->name;
293 qualifier += format("=%d", j->value);
299 void DumpTree::visit(InterfaceLayout &layout)
301 annotated_branch(format("Layout: %s", layout.interface), layout.layout);
304 void DumpTree::visit(BasicTypeDeclaration &type)
306 append(format("%%%d typedef %s", get_label(type), type.name));
308 vector<Branch> branches;
310 branches.push_back(format("%s: %%%d %s", (type.kind==BasicTypeDeclaration::ALIAS ? "Alias of" : "Base"), get_label(*type.base_type), type.base_type->name));
311 if(type.kind==BasicTypeDeclaration::VECTOR)
312 branches.push_back(format("Vector: %d", type.size));
313 else if(type.kind==BasicTypeDeclaration::MATRIX)
314 branches.push_back(format("Matrix: %dx%d", type.size&0xFFFF, type.size>>16));
315 append_subtree(branches);
318 void DumpTree::visit(ImageTypeDeclaration &type)
320 static const char *dims[] = { "1D", "2D", "3D", "Cube" };
322 append(format("%%%d typedef %s", get_label(type), type.name));
324 vector<Branch> branches;
325 branches.push_back(format("Dimensions: %s%s", dims[type.dimensions-1], (type.array ? " array" : "")));
327 branches.push_back(format("Element type: %%%d %s", get_label(*type.base_type), type.base_type->name));
329 branches.push_back("Shadow");
330 append_subtree(branches);
333 void DumpTree::visit(StructDeclaration &strct)
335 annotated_branch(format("%%%d struct %s", get_label(strct), strct.name), strct.members);
338 void DumpTree::visit(VariableDeclaration &var)
340 string decl = format("%%%d ", get_label(var));
343 if(!var.interpolation.empty())
344 decl += format("%s ", var.interpolation);
345 if(!var.sampling.empty())
346 decl += format("%s ", var.sampling);
347 if(!var.interface.empty())
348 decl += format("%s ", var.interface);
349 if(!var.precision.empty())
350 decl += format("%s ", var.precision);
351 decl += format("%s %s", var.type, var.name);
352 if(var.source==BUILTIN_SOURCE)
353 decl += " (builtin)";
354 else if(var.linked_declaration)
358 vector<Branch> branches;
359 if(var.type_declaration)
360 branches.push_back(format("Type: %%%d %s", get_label(*var.type_declaration), var.type_declaration->name));
362 branches.push_back(var.layout.get());
366 branches.push_back(Branch("Array []", var.array_size.get()));
368 branches.push_back("Array []");
370 if(var.init_expression)
371 branches.push_back(var.init_expression.get());
372 append_subtree(branches);
375 void DumpTree::visit(InterfaceBlock &iface)
378 if(!iface.instance_name.empty())
379 head += format("%%%d ", get_label(iface));
380 head += format("%s %s", iface.interface, iface.block_name);
381 if(!iface.instance_name.empty())
382 head += format(" %s", iface.instance_name);
385 if(iface.source==BUILTIN_SOURCE)
386 head += " (builtin)";
387 else if(iface.linked_block)
391 vector<Branch> branches;
392 if(iface.type_declaration)
393 append(format("Type: %%%d %s", get_label(*iface.type_declaration), iface.type_declaration->name));
395 branches.push_back(Branch("Layout", iface.layout.get()));
397 branches.push_back(Branch("Members", iface.members.get()));
398 append_subtree(branches);
401 void DumpTree::visit(FunctionDeclaration &func)
403 string text = format("%%%d %s %s%s", get_label(func), func.return_type, func.name, (func.signature.empty() ? "(?)" : func.signature));
404 if(func.source==BUILTIN_SOURCE)
405 text += " (builtin)";
406 else if(!func.definition)
407 text += " (undefined)";
411 if(func.return_type_declaration)
412 append(format("Return type: %%%d %s", get_label(*func.return_type_declaration), func.return_type_declaration->name));
413 for(NodeArray<VariableDeclaration>::const_iterator i=func.parameters.begin(); i!=func.parameters.end(); ++i)
416 if(func.definition==&func)
417 func.body.visit(*this);
418 else if(func.definition)
419 append(format("Definition: %%%d", get_label(*func.definition)));
423 void DumpTree::visit(Conditional &cond)
427 vector<Branch> branches;
428 branches.push_back(cond.condition.get());
429 branches.push_back(&cond.body);
430 if(!cond.else_body.body.empty())
431 branches.push_back(&cond.else_body);
432 append_subtree(branches);
435 void DumpTree::visit(Iteration &iter)
440 if(iter.init_statement)
441 annotated_branch("Initialization", *iter.init_statement);
443 annotated_branch("Condition", *iter.condition);
444 if(iter.loop_expression)
445 annotated_branch("Loop", *iter.loop_expression);
447 annotated_branch("Body", iter.body);
451 void DumpTree::visit(Passthrough &pass)
454 annotated_branch("passthrough[]", *pass.subscript);
456 append("passthrough;");
459 void DumpTree::visit(Return &ret)
462 annotated_branch("return", *ret.expression);
467 void DumpTree::visit(Jump &jump)
469 append(format("%s;", jump.keyword));