#include <map>
#include <set>
-#include "evaluate.h"
#include "visitor.h"
namespace Msp {
namespace SL {
/** Finds functions which are candidates for inlining. Currently this means
-functions which have no parameters, contain no more than one return statement,
-and are only called once. */
+functions which have no flow control statements, no more than one return
+statement, and are only called once. */
class InlineableFunctionLocator: private TraversingVisitor
{
private:
class InlineContentInjector: private TraversingVisitor
{
private:
+ enum Pass
+ {
+ DEPENDS,
+ REFERENCED,
+ INLINE,
+ RENAME
+ };
+
FunctionDeclaration *source_func;
- Block *target_block;
- std::map<std::string, VariableDeclaration *> variable_map;
- bool remap_names;
- bool deps_only;
+ Block staging_block;
+ std::string remap_prefix;
+ Pass pass;
RefPtr<Statement> r_inlined_statement;
std::set<Node *> dependencies;
+ std::set<std::string> referenced_names;
std::string r_result_name;
public:
InlineContentInjector();
- const std::string &apply(Stage &, FunctionDeclaration &, Block &, const NodeList<Statement>::iterator &, FunctionDeclaration &);
+ const std::string &apply(Stage &, FunctionDeclaration &, Block &, const NodeList<Statement>::iterator &, FunctionCall &);
private:
- std::string create_unused_name(const std::string &, bool);
-
virtual void visit(VariableReference &);
virtual void visit(InterfaceBlockReference &);
virtual void visit(FunctionCall &);
NodeList<Statement>::iterator insert_point;
RefPtr<Expression> r_inline_result;
bool r_any_inlined;
+ bool r_inlined_here;
public:
FunctionInliner();
bool apply(Stage &);
private:
- void visit_and_inline(RefPtr<Expression> &);
-
+ virtual void visit(RefPtr<Expression> &);
virtual void visit(Block &);
- virtual void visit(UnaryExpression &);
- virtual void visit(BinaryExpression &);
- virtual void visit(MemberAccess &);
virtual void visit(FunctionCall &);
- virtual void visit(ExpressionStatement &);
- virtual void visit(VariableDeclaration &);
virtual void visit(FunctionDeclaration &);
- virtual void visit(Conditional &);
virtual void visit(Iteration &);
- virtual void visit(Return &);
};
/** Inlines variables into expressions. Variables with trivial values (those
Expression *expression;
Block *assign_scope;
RefPtr<Expression> *inline_point;
- const Operator *inner_oper;
- const Operator *outer_oper;
- bool inline_on_rhs;
bool trivial;
bool available;
ExpressionInfo();
};
- std::map<VariableDeclaration *, ExpressionInfo> expressions;
+ std::map<Assignment::Target, ExpressionInfo> expressions;
ExpressionInfo *r_ref_info;
bool r_any_inlined;
bool r_trivial;
bool apply(Stage &);
private:
- void visit_and_record(RefPtr<Expression> &, const Operator *, bool);
- void inline_expression(Expression &, RefPtr<Expression> &, const Operator *, const Operator *, bool);
+ void inline_expression(Expression &, RefPtr<Expression> &);
virtual void visit(Block &);
+ virtual void visit(RefPtr<Expression> &);
virtual void visit(VariableReference &);
virtual void visit(MemberAccess &);
+ virtual void visit(Swizzle &);
virtual void visit(UnaryExpression &);
virtual void visit(BinaryExpression &);
virtual void visit(Assignment &);
+ virtual void visit(TernaryExpression &);
+ virtual void visit(FunctionCall &);
+ virtual void visit(VariableDeclaration &);
+ virtual void visit(Iteration &);
+};
+
+/** Replaces expressions consisting entirely of literals with the results of
+evaluating the expression.*/
+class ConstantFolder: private TraversingVisitor
+{
+private:
+ VariableDeclaration *iteration_var;
+ Variant iter_init_value;
+ Variant r_constant_value;
+ bool iteration_init;
+ bool r_constant;
+ bool r_literal;
+ bool r_uses_iter_var;
+ bool r_any_folded;
+
+public:
+ bool apply(Stage &s) { s.content.visit(*this); return r_any_folded; }
+
+private:
+ static BasicTypeDeclaration::Kind get_value_kind(const Variant &);
+ template<typename T>
+ static T evaluate_logical(char, T, T);
+ template<typename T>
+ static bool evaluate_relation(const char *, T, T);
+ template<typename T>
+ static T evaluate_arithmetic(char, T, T);
+ void set_result(const Variant &, bool = false);
+
+ virtual void visit(RefPtr<Expression> &);
+ virtual void visit(Literal &);
+ virtual void visit(VariableReference &);
+ virtual void visit(MemberAccess &);
+ virtual void visit(Swizzle &);
+ virtual void visit(UnaryExpression &);
+ virtual void visit(BinaryExpression &);
+ virtual void visit(Assignment &);
+ virtual void visit(TernaryExpression &);
virtual void visit(FunctionCall &);
virtual void visit(VariableDeclaration &);
- virtual void visit(Conditional &);
virtual void visit(Iteration &);
- virtual void visit(Return &);
};
/** Removes conditional statements and loops where the condition can be
class ConstantConditionEliminator: private TraversingVisitor
{
private:
+ enum ConstantStatus
+ {
+ CONSTANT_FALSE,
+ CONSTANT_TRUE,
+ NOT_CONSTANT
+ };
+
NodeList<Statement>::iterator insert_point;
std::set<Node *> nodes_to_remove;
+ RefPtr<Expression> r_ternary_result;
public:
void apply(Stage &);
private:
+ ConstantStatus check_constant_condition(const Expression &);
+
virtual void visit(Block &);
+ virtual void visit(RefPtr<Expression> &);
+ virtual void visit(TernaryExpression &);
virtual void visit(Conditional &);
virtual void visit(Iteration &);
};
bool apply(Stage &);
private:
+ virtual void visit(Literal &);
+ virtual void visit(UnaryExpression &);
+ virtual void visit(BinaryExpression &);
+ virtual void visit(TernaryExpression &);
+ virtual void visit(FunctionCall &);
virtual void visit(BasicTypeDeclaration &);
virtual void visit(ImageTypeDeclaration &);
virtual void visit(StructDeclaration &);
virtual void visit(VariableDeclaration &);
+ virtual void visit(InterfaceBlock &);
virtual void visit(FunctionDeclaration &);
};
class UnusedVariableRemover: private TraversingVisitor
{
private:
+ struct AssignmentInfo
+ {
+ Node *node;
+ Assignment::Target target;
+ std::vector<Node *> used_by;
+
+ AssignmentInfo(): node(0) { }
+ };
+
struct VariableInfo
{
- bool local;
- std::vector<Node *> assignments;
- bool conditionally_assigned;
+ InterfaceBlock *interface_block;
+ std::vector<AssignmentInfo *> assignments;
+ bool initialized;
+ bool output;
bool referenced;
- VariableInfo();
+ VariableInfo(): interface_block(0), initialized(false), output(false), referenced(false) { }
};
- typedef std::map<VariableDeclaration *, VariableInfo> BlockVariableMap;
+ typedef std::map<Statement *, VariableInfo> BlockVariableMap;
- std::set<Node *> unused_nodes;
- std::map<VariableDeclaration *, Node *> aggregates;
- Node *aggregate;
- std::vector<BlockVariableMap> variables;
+ Stage *stage;
+ BlockVariableMap variables;
+ std::list<AssignmentInfo> assignments;
+ InterfaceBlock *interface_block;
Assignment *r_assignment;
bool assignment_target;
- bool r_assign_to_subfield;
bool r_side_effects;
+ std::set<Node *> unused_nodes;
public:
UnusedVariableRemover();
bool apply(Stage &);
private:
+ void referenced(const Assignment::Target &, Node &);
virtual void visit(VariableReference &);
virtual void visit(InterfaceBlockReference &);
- virtual void visit(MemberAccess &);
virtual void visit(UnaryExpression &);
virtual void visit(BinaryExpression &);
virtual void visit(Assignment &);
- void record_assignment(VariableDeclaration &, Node &, bool);
- void clear_assignments(VariableInfo &, bool);
virtual void visit(FunctionCall &);
+ void record_assignment(const Assignment::Target &, Node &);
virtual void visit(ExpressionStatement &);
- virtual void visit(StructDeclaration &);
+ // Ignore structs because their members can't be accessed directly.
+ virtual void visit(StructDeclaration &) { }
virtual void visit(VariableDeclaration &);
virtual void visit(InterfaceBlock &);
+ void merge_variables(const BlockVariableMap &);
virtual void visit(FunctionDeclaration &);
- void merge_down_variables();
virtual void visit(Conditional &);
virtual void visit(Iteration &);
};
projects / libs / gl.git / blobdiff