prop-src/graphtype.cc

   1 ///////////////////////////////////////////////////////////////////////////////
   2 //  This file is generated automatically using Prop (version 2.3.6),
   3 //  last updated on Nov 2, 1999.
   4 //  The original source file is "graphtype.pcc".
   5 ///////////////////////////////////////////////////////////////////////////////
   6
   7 #line 1 "graphtype.pcc"
   8 ///////////////////////////////////////////////////////////////////////////////
   9 //
  10 // This file implements the graph type generator
  11 //
  12 ///////////////////////////////////////////////////////////////////////////////
  13
  14 #include "ast.h"
  15 #include "graphtype.h"
  16 #include "type.h"
  17
  18 ///////////////////////////////////////////////////////////////////////////////
  19 //
  20 //  Method to create a graph type definition.
  21 //
  22 ///////////////////////////////////////////////////////////////////////////////
  23 GraphTypeDef::GraphTypeDef
  24    (Id id, Inherits i, TyQual q, NodeDefs nodes, EdgeDefs edges, Decls b)
  25    : ClassDefinition(GRAPHTYPE_CLASS, id,
  26 #line 18 "graphtype.pcc"
  27 #line 18 "graphtype.pcc"
  28 nil_1_
  29 #line 18 "graphtype.pcc"
  30 #line 18 "graphtype.pcc"
  31 ,
  32         add_inherit("GraphType",
  33 #line 19 "graphtype.pcc"
  34 #line 19 "graphtype.pcc"
  35 nil_1_
  36 #line 19 "graphtype.pcc"
  37 #line 19 "graphtype.pcc"
  38 ,i,PUBLICscope,QUALvirtualdestr), q, b),
  39      node_defs(nodes), edge_defs(edges)
  40 {  add_type(id,
  41 #line 21 "graphtype.pcc"
  42 #line 21 "graphtype.pcc"
  43 nil_1_
  44 #line 21 "graphtype.pcc"
  45 #line 21 "graphtype.pcc"
  46 , TYCONty(GRAPHtycon(this),
  47 #line 21 "graphtype.pcc"
  48 #line 21 "graphtype.pcc"
  49 nil_1_
  50 #line 21 "graphtype.pcc"
  51 #line 21 "graphtype.pcc"
  52 )); }
  53
  54 GraphTypeDef::~GraphTypeDef() {}
  55
  56 ///////////////////////////////////////////////////////////////////////////////
  57 //
  58 //  Method to create a node type definition.
  59 //
  60 ///////////////////////////////////////////////////////////////////////////////
  61 NodeDef::NodeDef(GraphTypeDef * g, Id id, Ty ty,
  62                  Id hash, Id eq, LabTys attribs)
  63    : G(g), node_name(id), node_type(ty), hash_fun(hash), eq_fun(eq),
  64      attributes(attribs), rep(UNBASEDrep)
  65      {  if (hash_fun == 0) hash_fun = "hash";
  66         if (eq_fun == 0) eq_fun = "equal";
  67      }
  68 NodeDef::~NodeDef() {}
  69
  70 ///////////////////////////////////////////////////////////////////////////////
  71 //
  72 //  Method to create an edge type definition.
  73 //
  74 ///////////////////////////////////////////////////////////////////////////////
  75 EdgeDef::EdgeDef(GraphTypeDef * G,
  76                  Id id, NodeDef* a, NodeDef* b,
  77                  GraphIndexing i, LabTys attribs)
  78    : graph(G), edge_name(id), domain_type(a), range_type(b), indexing(i),
  79      attributes(attribs), ops(NOgop)
  80      {
  81      }
  82 EdgeDef::~EdgeDef() {}
  83
  84 void GraphTypeDef::set_nodes(NodeDefs n) { node_defs = n; }
  85 void GraphTypeDef::set_edges(EdgeDefs e) { edge_defs = e; }
  86 void GraphTypeDef::set_body(Decls b) { class_body = b; }
  87
  88 ///////////////////////////////////////////////////////////////////////////////
  89 //
  90 //  Method to lookup a node definition by name
  91 //
  92 ///////////////////////////////////////////////////////////////////////////////
  93 NodeDef * GraphTypeDef::lookup_node (Id id)
  94 {  for_each (NodeDef *, n, node_defs)
  95    {
  96       if (n->node_name == id) return n;
  97    }
  98    error("%Lnode %s is not defined in graphtype %s\n", id, class_name);
  99    return 0;
 100 }
 101
 102 ///////////////////////////////////////////////////////////////////////////////
 103 //
 104 //  Method to lookup an edge definition by name
 105 //
 106 ///////////////////////////////////////////////////////////////////////////////
 107 EdgeDef * GraphTypeDef::lookup_edge (Id id)
 108 {  for_each (EdgeDef *, e, edge_defs)
 109    {
 110       if (e->edge_name == id) return e;
 111    }
 112    error("%Ledge %s is not defined in graphtype %s\n", id, class_name);
 113    return 0;
 114 }
 115
 116 ///////////////////////////////////////////////////////////////////////////////
 117 //
 118 //  Method to choose a representation for the graph type.
 119 //
 120 ///////////////////////////////////////////////////////////////////////////////
 121 void GraphTypeDef::choose_representation()
 122 {  for_each(EdgeDef *, e, edge_defs)
 123        e->choose_representation();
 124    for_each(NodeDef *, n, node_defs)
 125        n->choose_representation();
 126 }
 127
 128 ///////////////////////////////////////////////////////////////////////////////
 129 //
 130 //  Method to generate the graph type internals.
 131 //
 132 ///////////////////////////////////////////////////////////////////////////////
 133 void GraphTypeDef::gen_class_predefinition (CodeGen& C)
 134 {
 135    choose_representation();
 136
 137    C.pr("%^%/"
 138         "%^//"
 139         "%^//  Internal representation of nodes in graphtype %s"
 140         "%^//"
 141         "%^%/",
 142         class_name);
 143
 144    ////////////////////////////////////////////////////////////////////////////
 145    //
 146    //  Generate any forward declarations from the node definitions
 147    //
 148    ////////////////////////////////////////////////////////////////////////////
 149    {  for_each(NodeDef *, n, node_defs)
 150          n->generate_forward_decls(C);
 151    }
 152
 153    ////////////////////////////////////////////////////////////////////////////
 154    //
 155    //  Generate the representation for the nodes
 156    //
 157    ////////////////////////////////////////////////////////////////////////////
 158    {  for_each(NodeDef *, n, node_defs)
 159          n->generate_representation(C);
 160    }
 161
 162    C.pr("%^%/"
 163         "%^//"
 164         "%^//  Definition of graphtype %s"
 165         "%^//"
 166         "%^%/",
 167         class_name);
 168 }
 169
 170 ///////////////////////////////////////////////////////////////////////////////
 171 //
 172 //  Method to generate the interface methods
 173 //
 174 ///////////////////////////////////////////////////////////////////////////////
 175 void GraphTypeDef::gen_class_interface (CodeGen& C)
 176 {
 177    ////////////////////////////////////////////////////////////////////////////
 178    //
 179    //  Generate forward type definitions
 180    //
 181    ////////////////////////////////////////////////////////////////////////////
 182    {  C.pr("%-%^public:%+");
 183       for_each(NodeDef *, n, node_defs)
 184       {  C.pr("%^typedef %s_%s_node * %s;"
 185               "%^class %s_set {"
 186               "%^public:"
 187               "%^   friend class %s_iterator;"
 188               "%^   const GraphType::Link& link;"
 189               "%^   long offset;"
 190               "%^   %s_set(const GraphType::Link& l, long n = 0)"
 191               "%^      : link(l), offset(n) {}"
 192               "%^   Bool is_empty() const { return link.is_empty(); }"
 193               "%^   operator Bool () const { return link.is_empty(); }"
 194               "%^};"
 195               "%^class %s_iterator {"
 196               "%^   long offset;"
 197               "%^   const GraphType::Link * cursor, * sentinel;"
 198               "%^public:"
 199               "%^   %s_iterator(const %s_set& s) : "
 200               "%^      offset(s.offset), cursor(s.link.next),"
 201               "%^          sentinel(&s.link) {}"
 202               "%^   operator Bool () const { return cursor != sentinel; }"
 203               "%^   %s operator * () const"
 204               "%^       { return (%s)(((char *)cursor) - offset); }"
 205               "%^   %s operator -> () const"
 206               "%^       { return (%s)(((char *)cursor) - offset); }"
 207               "%^   void operator ++ () { cursor = cursor->next; }"
 208               "%^   void operator ++ (int) { cursor = cursor->next; }"
 209               "%^};",
 210               class_name, n->name(), n->name(),
 211               n->name(), n->name(),
 212               n->name(), n->name(),
 213               n->name(), n->name(),
 214               n->name(), n->name(),
 215               n->name(), n->name()
 216              );
 217       }
 218    }
 219
 220    ////////////////////////////////////////////////////////////////////////////
 221    //
 222    //  Generate the interface methods for the nodes
 223    //
 224    ////////////////////////////////////////////////////////////////////////////
 225    {  for_each(NodeDef *, n, node_defs)
 226          n->generate_interface(C);
 227    }
 228
 229    ////////////////////////////////////////////////////////////////////////////
 230    //  Generate the interface methods for the edges
 231    ////////////////////////////////////////////////////////////////////////////
 232    {  for_each(EdgeDef *, e, edge_defs)
 233          e->generate_interface(C);
 234    }
 235 }
 236
 237 ///////////////////////////////////////////////////////////////////////////////
 238 //
 239 //  Method to generate the graph type implementation.
 240 //
 241 ///////////////////////////////////////////////////////////////////////////////
 242 void GraphTypeDef::gen_class_implementation (CodeGen& C)
 243 {
 244    gen_init_graph(C);
 245    gen_lookup_node(C);
 246    gen_insert_node(C);
 247    gen_remove_node(C);
 248 }
 249
 250 void GraphTypeDef::gen_init_graph (CodeGen& C) {}
 251 void GraphTypeDef::gen_lookup_node (CodeGen& C) {}
 252 void GraphTypeDef::gen_insert_node (CodeGen& C) {}
 253 void GraphTypeDef::gen_remove_node (CodeGen& C) {}
 254 #line 223 "graphtype.pcc"
 255 /*
 256 ------------------------------- Statistics -------------------------------
 257 Merge matching rules         = yes
 258 Number of DFA nodes merged   = 0
 259 Number of ifs generated      = 0
 260 Number of switches generated = 0
 261 Number of labels             = 0
 262 Number of gotos              = 0
 263 Adaptive matching            = enabled
 264 Fast string matching         = disabled
 265 Inline downcasts             = enabled
 266 --------------------------------------------------------------------------
 267 */