Semantic graph and parsing code

Currently covers/handles namespace, class definitions (including bases
and data members), and typedefs in namespace-scopes.

1 files changed, 155 insertions, 0 deletions

diff --git a/odb/semantics/elements.cxx b/odb/semantics/elements.cxx
new file mode 100644
index 0000000..d14835c
--- /dev/null
+++ b/odb/semantics/elements.cxx
@@ -0,0 +1,155 @@
+// file      : odb/semantics/elements.cxx
+// author    : Boris Kolpackov <boris@codesynthesis.com>
+// copyright : Copyright (c) 2009-2010 Code Synthesis Tools CC
+// license   : GNU GPL v2; see accompanying LICENSE file
+
+#include <cutl/compiler/type-info.hxx>
+
+#include <semantics/elements.hxx>
+
+namespace semantics
+{
+  // access
+  //
+  static char const* access_str[] = {"public", "protected", "private"};
+
+  char const* access::
+  string () const
+  {
+    return access_str[value_];
+  }
+
+  // nameable
+  //
+
+  string nameable::
+  fq_name () const
+  {
+    if (named ().global_scope ())
+      return "";
+    else
+      return scope ().fq_name () + "::" + name ();
+  }
+
+  // scope
+  //
+
+  scope::names_iterator_pair scope::
+  find (string const& name) const
+  {
+    names_map::const_iterator i (names_map_.find (name));
+
+    if (i == names_map_.end ())
+      return names_iterator_pair (names_.end (), names_.end ());
+    else
+      return names_iterator_pair (i->second.begin (), i->second.end ());
+  }
+
+  scope::names_iterator scope::
+  find (names& e)
+  {
+    list_iterator_map::iterator i (iterator_map_.find (&e));
+    return i != iterator_map_.end () ? i->second : names_.end ();
+  }
+
+  void scope::
+  add_edge_left (names& e)
+  {
+    names_list::iterator it (names_.insert (names_.end (), &e));
+    iterator_map_[&e] = it;
+    names_map_[e.name ()].push_back (&e);
+  }
+
+  // type info
+  //
+  namespace
+  {
+    struct init
+    {
+      init ()
+      {
+        using compiler::type_info;
+
+        // node
+        //
+        insert (type_info (typeid (node)));
+
+        // edge
+        //
+        insert (type_info (typeid (edge)));
+
+        // names
+        //
+        {
+          type_info ti (typeid (names));
+          ti.add_base (typeid (edge));
+          insert (ti);
+        }
+
+        // declares
+        //
+        {
+          type_info ti (typeid (declares));
+          ti.add_base (typeid (names));
+          insert (ti);
+        }
+
+        // defines
+        //
+        {
+          type_info ti (typeid (defines));
+          ti.add_base (typeid (declares));
+          insert (ti);
+        }
+
+        // typedefs
+        //
+        {
+          type_info ti (typeid (typedefs));
+          ti.add_base (typeid (declares));
+          insert (ti);
+        }
+
+        // nameable
+        //
+        {
+          type_info ti (typeid (nameable));
+          ti.add_base (typeid (node));
+          insert (ti);
+        }
+
+        // scope
+        //
+        {
+          type_info ti (typeid (scope));
+          ti.add_base (typeid (nameable));
+          insert (ti);
+        }
+
+        // type
+        //
+        {
+          type_info ti (typeid (type));
+          ti.add_base (typeid (nameable));
+          insert (ti);
+        }
+
+        // belongs
+        //
+        {
+          type_info ti (typeid (belongs));
+          ti.add_base (typeid (edge));
+          insert (ti);
+        }
+
+        // instance
+        //
+        {
+          type_info ti (typeid (instance));
+          ti.add_base (typeid (node));
+          insert (ti);
+        }
+      }
+    } init_;
+  }
+}