src/ltlast/atomic_prop.cc, src/ltlast/atomic_prop.hh, src/ltlparse/fmterror.cc, src/ltlparse/public.hh, src/ltlvisit/dotty.cc, src/ltlvisit/dotty.hh, src/ltlvisit/dump.cc, src/ltlvisit/dump.hh, src/ltlvisit/tostring.cc, src/ltlvisit/tostring.hh, src/misc/escape.cc, src/misc/escape.hh, src/tgba/bdddict.cc, src/tgba/bdddict.hh, src/tgba/bddprint.cc, src/tgba/bddprint.hh, src/tgbaalgos/dotty.cc, src/tgbaalgos/dotty.hh, src/tgbaalgos/lbtt.cc, src/tgbaalgos/lbtt.hh, src/tgbaalgos/neverclaim.cc, src/tgbaalgos/neverclaim.hh, src/tgbaalgos/save.cc, src/tgbaalgos/save.hh, src/tgbaalgos/gtec/status.cc, src/tgbaalgos/gtec/status.hh, src/tgbaparse/fmterror.cc, src/tgbaparse/public.hh: Include <iosfwd> in headers, and prefer <ostream> in the body whenever possible. * src/sanity/style.test, HACKING: Check and document this.
138 lines
3 KiB
C++
138 lines
3 KiB
C++
// Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
// et Marie Curie.
|
|
//
|
|
// This file is part of Spot, a model checking library.
|
|
//
|
|
// Spot is free software; you can redistribute it and/or modify it
|
|
// under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Spot is distributed in the hope that it will be useful, but WITHOUT
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
// License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Spot; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
// 02111-1307, USA.
|
|
|
|
#include "misc/hash.hh"
|
|
#include "dotty.hh"
|
|
#include "ltlast/visitor.hh"
|
|
#include "ltlast/allnodes.hh"
|
|
#include <ostream>
|
|
|
|
namespace spot
|
|
{
|
|
namespace ltl
|
|
{
|
|
|
|
class dotty_visitor : public const_visitor
|
|
{
|
|
public:
|
|
typedef Sgi::hash_map<const formula*, int, ptr_hash<formula> > map;
|
|
dotty_visitor(std::ostream& os, map& m)
|
|
: os_(os), father_(-1), node_(m)
|
|
{
|
|
}
|
|
|
|
virtual
|
|
~dotty_visitor()
|
|
{
|
|
}
|
|
|
|
void
|
|
visit(const atomic_prop* ap)
|
|
{
|
|
draw_node_(ap, ap->name(), true);
|
|
}
|
|
|
|
void
|
|
visit(const constant* c)
|
|
{
|
|
draw_node_(c, c->val_name(), true);
|
|
}
|
|
|
|
void
|
|
visit(const binop* bo)
|
|
{
|
|
if (draw_node_(bo, bo->op_name()))
|
|
{
|
|
dotty_visitor v(*this);
|
|
bo->first()->accept(v);
|
|
bo->second()->accept(*this);
|
|
}
|
|
}
|
|
|
|
void
|
|
visit(const unop* uo)
|
|
{
|
|
if (draw_node_(uo, uo->op_name()))
|
|
uo->child()->accept(*this);
|
|
}
|
|
|
|
void
|
|
visit(const multop* mo)
|
|
{
|
|
if (!draw_node_(mo, mo->op_name()))
|
|
return;
|
|
unsigned max = mo->size();
|
|
for (unsigned n = 0; n < max; ++n)
|
|
{
|
|
dotty_visitor v(*this);
|
|
mo->nth(n)->accept(v);
|
|
}
|
|
}
|
|
private:
|
|
std::ostream& os_;
|
|
int father_;
|
|
map& node_;
|
|
|
|
bool
|
|
draw_node_(const formula* f, const std::string& str, bool rec = false)
|
|
{
|
|
map::iterator i = node_.find(f);
|
|
int node;
|
|
bool node_exists = false;
|
|
if (i != node_.end())
|
|
{
|
|
node = i->second;
|
|
node_exists = true;
|
|
}
|
|
else
|
|
{
|
|
node = node_.size();
|
|
node_[f] = node;
|
|
}
|
|
// the link
|
|
if (father_ >= 0)
|
|
os_ << " " << father_ << " -> " << node << ";" << std::endl;
|
|
father_ = node;
|
|
// the node
|
|
if (node_exists)
|
|
return false;
|
|
os_ << " " << node
|
|
<< " [label=\"" << str << "\"";
|
|
if (rec)
|
|
os_ << ", shape=box";
|
|
os_ << "];" << std::endl;
|
|
return true;
|
|
}
|
|
};
|
|
|
|
std::ostream&
|
|
dotty(std::ostream& os, const formula* f)
|
|
{
|
|
dotty_visitor::map m;
|
|
dotty_visitor v(os, m);
|
|
os << "digraph G {" << std::endl;
|
|
f->accept(v);
|
|
os << "}" << std::endl;
|
|
return os;
|
|
}
|
|
|
|
}
|
|
}
|