#include <map>
#include <set>
-#include "evaluate.h"
#include "visitor.h"
namespace Msp {
namespace GL {
namespace SL {
+/** Assigns values to specialization constants, turning them into normal
+constants. */
+class ConstantSpecializer: private TraversingVisitor
+{
+private:
+ const std::map<std::string, int> *values = 0;
+
+public:
+ void apply(Stage &, const std::map<std::string, int> &);
+
+private:
+ virtual void visit(VariableDeclaration &);
+};
+
+/** Finds functions which are candidates for inlining. Currently this means
+functions which have no flow control statements, no more than one return
+statement, and are either builtins or only called once. */
class InlineableFunctionLocator: private TraversingVisitor
{
private:
std::map<FunctionDeclaration *, unsigned> refcounts;
std::set<FunctionDeclaration *> inlineable;
- FunctionDeclaration *in_function;
+ FunctionDeclaration *current_function = 0;
+ unsigned return_count = 0;
public:
- InlineableFunctionLocator();
-
- const std::set<FunctionDeclaration *> &apply(Stage &s) { visit(s.content); return inlineable; }
+ std::set<FunctionDeclaration *> apply(Stage &s) { s.content.visit(*this); return inlineable; }
private:
virtual void visit(FunctionCall &);
virtual void visit(FunctionDeclaration &);
- using TraversingVisitor::visit;
+ virtual void visit(Conditional &);
+ virtual void visit(Iteration &);
+ virtual void visit(Return &);
};
+/** Injects statements from one function into another. Local variables are
+renamed to avoid conflicts. After inlining, uses NodeReorderer to cause
+dependencies of the inlined statements to appear before the target function. */
+class InlineContentInjector: private TraversingVisitor
+{
+private:
+ enum Pass
+ {
+ REFERENCED,
+ INLINE,
+ RENAME
+ };
+
+ FunctionDeclaration *source_func = 0;
+ Block staging_block;
+ Pass pass = REFERENCED;
+ RefPtr<Statement> r_inlined_statement;
+ std::set<Node *> dependencies;
+ std::set<std::string> referenced_names;
+ std::string r_result_name;
+
+public:
+ std::string apply(Stage &, FunctionDeclaration &, Block &, const NodeList<Statement>::iterator &, FunctionCall &);
+
+private:
+ virtual void visit(VariableReference &);
+ virtual void visit(InterfaceBlockReference &);
+ virtual void visit(FunctionCall &);
+ virtual void visit(VariableDeclaration &);
+ virtual void visit(Return &);
+};
+
+/** Inlines functions. Internally uses InlineableFunctionLocator to find
+candidate functions. Only functions which consist of a single return statement
+are inlined. */
class FunctionInliner: private TraversingVisitor
{
private:
+ Stage *stage = 0;
std::set<FunctionDeclaration *> inlineable;
- unsigned extract_result;
- RefPtr<Expression> inline_result;
+ FunctionDeclaration *current_function = 0;
+ NodeList<Statement>::iterator insert_point;
+ RefPtr<Expression> r_inline_result;
+ bool r_any_inlined = false;
+ bool r_inlined_here = false;
public:
- FunctionInliner();
- FunctionInliner(const std::set<FunctionDeclaration *> &);
+ bool apply(Stage &);
- void apply(Stage &s) { visit(s.content); }
+private:
+ virtual void visit(RefPtr<Expression> &);
+ virtual void visit(Block &);
+ virtual void visit(FunctionCall &);
+ virtual void visit(FunctionDeclaration &);
+ virtual void visit(Iteration &);
+};
+/** Inlines variables into expressions. Variables with trivial values (those
+consisting of a single literal or variable reference) are always inlined.
+Variables which are only referenced once are also inlined. */
+class ExpressionInliner: private TraversingVisitor
+{
private:
- void visit_and_inline(RefPtr<Expression> &);
+ struct ExpressionUse
+ {
+ RefPtr<Expression> *reference = 0;
+ Block *ref_scope = 0;
+ bool blocked = false;
+ };
- virtual void visit(Block &);
+ struct ExpressionInfo
+ {
+ Assignment::Target target;
+ RefPtr<Expression> expression;
+ Block *assign_scope = 0;
+ std::vector<ExpressionUse> uses;
+ bool trivial = false;
+ };
+
+ std::list<ExpressionInfo> expressions;
+ std::map<Assignment::Target, ExpressionInfo *> assignments;
+ ExpressionInfo *r_ref_info = 0;
+ bool r_trivial = false;
+ bool access_read = true;
+ bool access_write = false;
+ bool iteration_init = false;
+ Block *iteration_body = 0;
+ const Operator *r_oper = 0;
+
+public:
+ bool apply(Stage &);
+
+private:
+ 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(MemberAccess &);
+ virtual void visit(Assignment &);
+ virtual void visit(TernaryExpression &);
virtual void visit(FunctionCall &);
virtual void visit(VariableDeclaration &);
- virtual void visit(Return &);
- using TraversingVisitor::visit;
+ virtual void visit(Iteration &);
};
-class ConstantConditionEliminator: private BlockModifier
+/** Replaces expressions consisting entirely of literals with the results of
+evaluating the expression.*/
+class ConstantFolder: private TraversingVisitor
{
private:
- unsigned scope_level;
- bool record_only;
- ExpressionEvaluator::ValueMap variable_values;
+ VariableDeclaration *iteration_var = 0;
+ Variant iter_init_value;
+ Variant r_constant_value;
+ bool iteration_init = false;
+ bool r_constant = false;
+ bool r_literal = false;
+ bool r_uses_iter_var = false;
+ bool r_any_folded = false;
public:
- ConstantConditionEliminator();
+ bool apply(Stage &s) { s.content.visit(*this); return r_any_folded; }
- void apply(Stage &s) { visit(s.content); }
+private:
+ 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);
+ template<typename T>
+ static T evaluate_int_special_op(char, T, T);
+ template<typename T>
+ void convert_to_result(const Variant &);
+ 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(Iteration &);
+};
+
+/** Removes conditional statements and loops where the condition can be
+determined as constant at compile time. Also removes such statements where
+the body is empty and the condition has no side effects. */
+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;
+ bool r_external_side_effects = false;
+
+public:
+ void apply(Stage &);
private:
+ ConstantStatus check_constant_condition(const Expression &);
+
virtual void visit(Block &);
+ virtual void visit(RefPtr<Expression> &);
virtual void visit(UnaryExpression &);
virtual void visit(Assignment &);
- virtual void visit(VariableDeclaration &);
+ virtual void visit(TernaryExpression &);
+ virtual void visit(FunctionCall &);
virtual void visit(Conditional &);
virtual void visit(Iteration &);
- using BlockModifier::visit;
};
-class UnusedVariableLocator: private TraversingVisitor
+class UnreachableCodeRemover: private TraversingVisitor
{
private:
- struct VariableInfo
+ bool reachable = true;
+ std::set<Node *> unreachable_nodes;
+
+public:
+ virtual bool apply(Stage &);
+
+private:
+ virtual void visit(Block &);
+ virtual void visit(FunctionDeclaration &);
+ virtual void visit(Conditional &);
+ virtual void visit(Iteration &);
+ virtual void visit(Return &) { reachable = false; }
+ virtual void visit(Jump &) { reachable = false; }
+};
+
+/** Removes types which are not used anywhere. */
+class UnusedTypeRemover: private TraversingVisitor
+{
+private:
+ std::set<Node *> unused_nodes;
+
+public:
+ bool apply(Stage &);
+
+private:
+ virtual void visit(RefPtr<Expression> &);
+ virtual void visit(BasicTypeDeclaration &);
+ virtual void visit(ImageTypeDeclaration &);
+ virtual void visit(StructDeclaration &);
+ virtual void visit(VariableDeclaration &);
+ virtual void visit(InterfaceBlock &);
+ virtual void visit(FunctionDeclaration &);
+};
+
+/** Removes variable declarations with no references to them. Assignment
+statements where the result is not used are also removed. */
+class UnusedVariableRemover: private TraversingVisitor
+{
+private:
+ struct AssignmentInfo
{
- bool local;
- std::vector<Node *> assignments;
- bool conditionally_assigned;
- bool referenced;
+ Node *node = 0;
+ Assignment::Target target;
+ std::vector<Node *> used_by;
+ unsigned in_loop = 0;
+ };
- VariableInfo();
+ struct VariableInfo
+ {
+ InterfaceBlock *interface_block = 0;
+ std::vector<AssignmentInfo *> assignments;
+ bool initialized = false;
+ bool output = false;
+ bool referenced = false;
};
- typedef std::map<VariableDeclaration *, VariableInfo> BlockVariableMap;
+ typedef std::map<Statement *, VariableInfo> BlockVariableMap;
+ Stage *stage = 0;
+ BlockVariableMap variables;
+ std::list<AssignmentInfo> assignments;
+ InterfaceBlock *interface_block = 0;
+ Assignment *r_assignment = 0;
+ bool assignment_target = false;
+ bool r_side_effects = false;
+ bool in_struct = false;
+ bool composite_reference = false;
+ unsigned in_loop = 0;
+ std::vector<Node *> loop_ext_refs;
+ Assignment::Target r_reference;
std::set<Node *> unused_nodes;
- std::map<VariableDeclaration *, Node *> aggregates;
- Node *aggregate;
- std::vector<BlockVariableMap> variables;
- Assignment *assignment;
- bool assignment_target;
- bool assign_to_subscript;
- bool global_scope;
public:
- UnusedVariableLocator();
-
- const std::set<Node *> &apply(Stage &);
+ bool apply(Stage &);
private:
+ void referenced(const Assignment::Target &, Node &);
virtual void visit(VariableReference &);
+ virtual void visit(InterfaceBlockReference &);
+ void visit_composite(Expression &);
virtual void visit(MemberAccess &);
+ virtual void visit(Swizzle &);
+ 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(TernaryExpression &);
+ virtual void visit(FunctionCall &);
+ void record_assignment(const Assignment::Target &, Node &);
virtual void visit(ExpressionStatement &);
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 &);
- using TraversingVisitor::visit;
};
-class UnusedFunctionLocator: private TraversingVisitor
+/** Removes function declarations with no references to them. */
+class UnusedFunctionRemover: private TraversingVisitor
{
private:
std::set<Node *> unused_nodes;
std::set<FunctionDeclaration *> used_definitions;
public:
- const std::set<Node *> &apply(Stage &s) { visit(s.content); return unused_nodes; }
+ bool apply(Stage &s);
private:
virtual void visit(FunctionCall &);
virtual void visit(FunctionDeclaration &);
- using TraversingVisitor::visit;
};
} // namespace SL
projects / libs / gl.git / blobdiff