diff options
Diffstat (limited to 'CIAO/CCF/CCF/IDL2/Traversal/Elements.hpp')
| -rw-r--r-- | CIAO/CCF/CCF/IDL2/Traversal/Elements.hpp | 471 |
1 files changed, 0 insertions, 471 deletions
diff --git a/CIAO/CCF/CCF/IDL2/Traversal/Elements.hpp b/CIAO/CCF/CCF/IDL2/Traversal/Elements.hpp deleted file mode 100644 index 03793aafeef..00000000000 --- a/CIAO/CCF/CCF/IDL2/Traversal/Elements.hpp +++ /dev/null @@ -1,471 +0,0 @@ -// file : CCF/IDL2/Traversal/Elements.hpp -// author : Boris Kolpackov <boris@dre.vanderbilt.edu> -// cvs-id : $Id$ - -#ifndef CCF_IDL2_TRAVERSAL_ELEMENTS_HPP -#define CCF_IDL2_TRAVERSAL_ELEMENTS_HPP - -#include <map> -#include <set> - -#include "CCF/CompilerElements/Introspection.hpp" - -#include "CCF/IDL2/SemanticGraph/Elements.hpp" - -/* -#include <iostream> - -using std::cerr; -using std::endl; -*/ - -namespace CCF -{ - namespace IDL2 - { - namespace Traversal - { - // - // - // - template<typename T> - class Traverser - { - protected: - virtual - ~Traverser (); - - virtual void - trampoline (T& n) = 0; - - template <typename> - friend class Dispatcher; - }; - - - // - // - // - template <typename T> - class Dispatcher - { - public: - virtual - ~Dispatcher (); - - virtual void - traverse (T& n); - - void - map (Introspection::TypeId id, Traverser<T>& t) - { - Traversers& traversers (traversal_map_[id]); - traversers.push_back (&t); - } - - public: - typedef - std::vector<Traverser<T>*> - Traversers; - - typedef - std::map<Introspection::TypeId, Traversers> - TraversalMap; - - typedef - typename TraversalMap::const_iterator - Iterator; - - Iterator - begin () const - { - return traversal_map_.begin (); - } - - Iterator - end () const - { - return traversal_map_.end (); - } - - private: - struct TypeInfoComparator - { - bool - operator () (Introspection::TypeInfo const& x, - Introspection::TypeInfo const& y) const - { - return x.type_id () < y.type_id (); - } - }; - - typedef - std::map<Introspection::TypeInfo, unsigned long, TypeInfoComparator> - LevelMap; - - typedef - std::set<Introspection::TypeInfo, TypeInfoComparator> - TypeInfoSet; - - static unsigned long - compute_levels (Introspection::TypeInfo const& ti, - unsigned long cur, - LevelMap& map); - - static void - flatten_tree (Introspection::TypeInfo const& ti, TypeInfoSet& set); - - private: - TraversalMap traversal_map_; - }; - - - // - // - // - typedef - Dispatcher<SemanticGraph::Node> - NodeDispatcherBase; - - typedef - Dispatcher<SemanticGraph::Edge> - EdgeDispatcherBase; - - - // - // - // - class NodeDispatcher : public virtual NodeDispatcherBase - { - public: - void - edge_traverser (EdgeDispatcherBase& d) - { - //@@ this should be done in Dispatcher in merge() function? - // - for (EdgeDispatcherBase::Iterator i (d.begin ()), end (d.end ()); - i != end; ++i) - { - for (EdgeDispatcherBase::Traversers::const_iterator - t (i->second.begin ()), end (i->second.end ()); - t != end; ++t) - { - dispatcher_.map (i->first, **t); - } - } - } - - protected: - template <typename I> - void - iterate_and_traverse (I begin, I end, EdgeDispatcherBase& d) - { - for (; begin != end; ++begin) - { - d.traverse (**begin); - } - } - - template <typename I, typename X, typename A> - void - iterate_and_traverse (I begin, - I end, - EdgeDispatcherBase& d, - X& x, - void (X::*f)(A&), - A& a) - { - for (I i (begin); i != end;) - { - d.traverse (**i); - - if (++i != end) (x.*f) (a); - } - } - - EdgeDispatcherBase& - edge_traverser () - { - return dispatcher_; - } - - protected: - EdgeDispatcherBase dispatcher_; - }; - - - class EdgeDispatcher : public virtual EdgeDispatcherBase - { - public: - //@@ this should be done in Dispatcher in merge() function? - // - void - node_traverser (NodeDispatcherBase& d) - { - for (NodeDispatcherBase::Iterator i (d.begin ()), end (d.end ()); - i != end; ++i) - { - for (NodeDispatcherBase::Traversers::const_iterator - t (i->second.begin ()), end (i->second.end ()); - t != end; ++t) - { - dispatcher_.map (i->first, **t); - } - } - } - - protected: - NodeDispatcherBase& - node_traverser () - { - return dispatcher_; - } - - protected: - NodeDispatcherBase dispatcher_; - }; - - - // - // - // - template <typename T> - struct Node : Traverser<SemanticGraph::Node>, virtual NodeDispatcher - { - typedef - T - Type; - - Node () - { - map (typeid (Type), *this); - } - - virtual void - trampoline (SemanticGraph::Node& n) - { - //cerr << "trampoline for " << &n << " to type " - // << typeid (Type).name () << endl; - - traverse (dynamic_cast<Type&> (n)); - } - - virtual void - traverse (Type&) = 0; - }; - - - template <typename T> - struct Edge : Traverser <SemanticGraph::Edge>, virtual EdgeDispatcher - { - typedef - T - Type; - - Edge () - { - map (typeid (Type), *this); - } - - virtual void - trampoline (SemanticGraph::Edge& e) - { - traverse (dynamic_cast<Type&> (e)); - } - - - virtual void - traverse (Type& e) = 0; - }; - - // Edges - // - // - struct Names : Edge<SemanticGraph::Names> - { - virtual void - traverse (Type& e) - { - node_traverser ().traverse (e.named ()); - } - }; - - - struct Defines : Edge<SemanticGraph::Defines> - { - virtual void - traverse (Type& e) - { - node_traverser ().traverse (e.named ()); - } - }; - - - struct Mentions : Edge<SemanticGraph::Mentions> - { - virtual void - traverse (Type& e) - { - node_traverser ().traverse (e.named ()); - } - }; - - - - struct Aliases : Edge<SemanticGraph::Aliases> - { - virtual void - traverse (Type& a) - { - pre (a); - type (a); - name (a); - post (a); - } - - virtual void - pre (Type&) - { - } - - virtual void - type (Type& e) - { - node_traverser ().traverse (e.named ()); - } - - virtual void - name (Type&) - { - } - - virtual void - post (Type&) - { - } - }; - - - struct Belongs : Edge<SemanticGraph::Belongs> - { - virtual void - traverse (Type& e) - { - node_traverser ().traverse (e.type ()); - } - }; - - - struct Arguments : Edge<SemanticGraph::Arguments> - { - virtual void - traverse (Type& a) - { - node_traverser ().traverse (a.argument ()); - } - }; - - struct ArgumentsWithType : Edge<SemanticGraph::ArgumentsWithType> - { - virtual void - traverse (Type& a) - { - node_traverser ().traverse (a.type ()); - } - }; - - struct ArgumentsWithValue : Edge<SemanticGraph::ArgumentsWithValue> - { - virtual void - traverse (Type& a) - { - node_traverser ().traverse (a.value ()); - } - }; - - struct Inherits : Edge<SemanticGraph::Inherits> - { - virtual void - traverse (Type& e) - { - node_traverser ().traverse (e.inheritee ()); - } - }; - - - struct Contains : Edge<SemanticGraph::Contains> - { - }; - - - // Nodes - // - // - struct Nameable : Node<SemanticGraph::Nameable> - { - }; - - - template <typename T> - struct ScopeTemplate : Node<T> - { - public: - /* GCC#13590/DR#39 - using Node<T>::edge_traverser; - */ - - virtual void - traverse (T& s) - { - names (s); - } - - virtual void - names (T& s) - { - names_pre (s); - names (s, this->edge_traverser ()); - names_post (s); - } - - virtual void - names (T& s, EdgeDispatcherBase& d) - { - iterate_and_traverse (s.names_begin (), s.names_end (), d); - } - - virtual void - names_pre (T&) - { - } - - virtual void - names_post (T&) - { - } - }; - - - // - // - // - typedef - ScopeTemplate<SemanticGraph::Scope> - Scope; - - - // - // - // - struct Type : Node<SemanticGraph::Type> - { - virtual void - traverse (SemanticGraph::Type&) = 0; - }; - } - } -} - -#include "CCF/IDL2/Traversal/Elements.tpp" - -#endif // CCF_IDL2_TRAVERSAL_ELEMENTS_HPP |