namespace GL {
namespace SL {
+/** Base class for all node visitors. */
class NodeVisitor
{
protected:
virtual void visit(Literal &) { }
virtual void visit(ParenthesizedExpression &) { }
virtual void visit(VariableReference &) { }
+ virtual void visit(InterfaceBlockReference &) { }
virtual void visit(MemberAccess &) { }
virtual void visit(UnaryExpression &) { }
virtual void visit(BinaryExpression &) { }
virtual void visit(Jump &) { }
};
+/** An intermediate base visitor class which traverses the syntax tree. */
class TraversingVisitor: public NodeVisitor
{
protected:
- TraversingVisitor() { }
+ Block *current_block;
+
+ TraversingVisitor(): current_block(0) { }
public:
- using NodeVisitor::visit;
+ virtual void enter(Block &) { }
virtual void visit(Block &);
virtual void visit(ParenthesizedExpression &);
virtual void visit(MemberAccess &);
virtual void visit(Return &);
};
-class StageVisitor: public TraversingVisitor
+/** Gathers nodes of a particular type from the syntax tree. */
+template<typename T>
+class NodeGatherer: private TraversingVisitor
{
-public:
- typedef void ResultType;
-
-protected:
- Stage *stage;
-
- StageVisitor();
+private:
+ std::vector<T *> nodes;
public:
- virtual void apply(Stage &);
- void get_result() const { }
+ const std::vector<T *> &apply(Stage &s) { s.content.visit(*this); return nodes; }
+
+private:
+ virtual void visit(T &n) { nodes.push_back(&n); }
};
-class BlockModifier: public StageVisitor
+/** Removes a set of nodes from the syntax tree. */
+class NodeRemover: private TraversingVisitor
{
-protected:
- bool remove_node;
- std::vector<RefPtr<Statement> > insert_nodes;
-
- BlockModifier();
-
- void flatten_block(Block &);
- void apply_and_increment(Block &, NodeList<Statement>::iterator &);
+private:
+ Stage *stage;
+ const std::set<Node *> *to_remove;
+ bool recursive_remove;
public:
- using StageVisitor::visit;
- virtual void visit(Block &);
-};
+ NodeRemover();
-template<typename T>
-class NodeGatherer: public StageVisitor
-{
-public:
- typedef std::vector<T *> ResultType;
+ void apply(Stage &, const std::set<Node *> &);
private:
- std::vector<T *> nodes;
+ template<typename T>
+ void remove_from_map(std::map<std::string, T *> &, const std::string &, T &);
-public:
- const ResultType &get_result() const { return nodes; }
- using StageVisitor::visit;
- virtual void visit(T &n) { nodes.push_back(&n); }
+ virtual void visit(Block &);
+ virtual void visit(StructDeclaration &);
+ virtual void visit(VariableDeclaration &);
+ virtual void visit(InterfaceBlock &);
+ virtual void visit(FunctionDeclaration &);
+ virtual void visit(Iteration &);
};
-class NodeRemover: public StageVisitor
+/** Reorders a set of nodes so they appear before another node. Only nodes
+on the same hierarchly level as the target node are reordered. */
+class NodeReorderer: private TraversingVisitor
{
private:
- std::set<Node *> to_remove;
+ Node *reorder_before;
+ const std::set<Node *> *to_reorder;
public:
- NodeRemover() { }
- NodeRemover(const std::set<Node *> &);
+ NodeReorderer();
- using StageVisitor::visit;
+ void apply(Stage &, Node &, const std::set<Node *> &);
+
+private:
virtual void visit(Block &);
- virtual void visit(VariableDeclaration &);
- virtual void visit(Iteration &);
};
} // namespace SL