* bin/autfilt.cc, bin/common_aoutput.cc, bin/common_aoutput.hh, bin/common_finput.cc, bin/common_finput.hh, bin/common_hoaread.cc, bin/common_output.cc, bin/common_output.hh, bin/common_post.cc, bin/common_post.hh, bin/common_r.hh, bin/common_range.cc, bin/common_range.hh, bin/common_setup.cc, bin/common_trans.cc, bin/common_trans.hh, bin/dstar2tgba.cc, bin/genltl.cc, bin/ltl2tgba.cc, bin/ltl2tgta.cc, bin/ltlcross.cc, bin/ltldo.cc, bin/ltlfilt.cc, bin/ltlgrind.cc, bin/randaut.cc, bin/randltl.cc, bin/spot-x.cc, spot/graph/graph.hh, spot/graph/ngraph.hh, spot/kripke/kripkegraph.hh, spot/ltsmin/ltsmin.cc, spot/ltsmin/ltsmin.hh, spot/misc/bareword.cc, spot/misc/bitvect.cc, spot/misc/bitvect.hh, spot/misc/common.hh, spot/misc/escape.cc, spot/misc/fixpool.hh, spot/misc/formater.cc, spot/misc/hash.hh, spot/misc/intvcmp2.cc, spot/misc/intvcmp2.hh, spot/misc/intvcomp.cc, spot/misc/intvcomp.hh, spot/misc/location.hh, spot/misc/minato.cc, spot/misc/minato.hh, spot/misc/mspool.hh, spot/misc/optionmap.cc, spot/misc/optionmap.hh, spot/misc/random.cc, spot/misc/random.hh, spot/misc/satsolver.cc, spot/misc/satsolver.hh, spot/misc/timer.cc, spot/misc/timer.hh, spot/misc/tmpfile.cc, spot/misc/trival.hh, spot/parseaut/fmterror.cc, spot/parseaut/parsedecl.hh, spot/parseaut/public.hh, spot/parsetl/fmterror.cc, spot/parsetl/parsedecl.hh, spot/priv/accmap.hh, spot/priv/bddalloc.cc, spot/priv/freelist.cc, spot/priv/trim.cc, spot/priv/weight.cc, spot/priv/weight.hh, spot/ta/taexplicit.cc, spot/ta/taexplicit.hh, spot/ta/taproduct.cc, spot/ta/taproduct.hh, spot/ta/tgtaexplicit.cc, spot/ta/tgtaexplicit.hh, spot/ta/tgtaproduct.cc, spot/ta/tgtaproduct.hh, spot/taalgos/dot.cc, spot/taalgos/dot.hh, spot/taalgos/emptinessta.cc, spot/taalgos/emptinessta.hh, spot/taalgos/minimize.cc, spot/taalgos/tgba2ta.cc, spot/taalgos/tgba2ta.hh, spot/tl/apcollect.cc, spot/tl/contain.cc, spot/tl/contain.hh, spot/tl/dot.cc, spot/tl/exclusive.cc, spot/tl/exclusive.hh, spot/tl/formula.cc, spot/tl/formula.hh, spot/tl/length.cc, spot/tl/mark.cc, spot/tl/mutation.cc, spot/tl/mutation.hh, spot/tl/parse.hh, spot/tl/print.cc, spot/tl/print.hh, spot/tl/randomltl.cc, spot/tl/randomltl.hh, spot/tl/relabel.cc, spot/tl/relabel.hh, spot/tl/remove_x.cc, spot/tl/simplify.cc, spot/tl/simplify.hh, spot/tl/snf.cc, spot/tl/snf.hh, spot/tl/unabbrev.cc, spot/tl/unabbrev.hh, spot/twa/acc.cc, spot/twa/acc.hh, spot/twa/bdddict.cc, spot/twa/bdddict.hh, spot/twa/bddprint.cc, spot/twa/formula2bdd.cc, spot/twa/formula2bdd.hh, spot/twa/taatgba.cc, spot/twa/taatgba.hh, spot/twa/twa.cc, spot/twa/twa.hh, spot/twa/twagraph.cc, spot/twa/twagraph.hh, spot/twa/twaproduct.cc, spot/twa/twaproduct.hh, spot/twaalgos/are_isomorphic.cc, spot/twaalgos/are_isomorphic.hh, spot/twaalgos/bfssteps.cc, spot/twaalgos/bfssteps.hh, spot/twaalgos/cleanacc.cc, spot/twaalgos/complete.cc, spot/twaalgos/compsusp.cc, spot/twaalgos/compsusp.hh, spot/twaalgos/copy.cc, spot/twaalgos/cycles.cc, spot/twaalgos/cycles.hh, spot/twaalgos/degen.cc, spot/twaalgos/degen.hh, spot/twaalgos/determinize.cc, spot/twaalgos/determinize.hh, spot/twaalgos/dot.cc, spot/twaalgos/dot.hh, spot/twaalgos/dtbasat.cc, spot/twaalgos/dtbasat.hh, spot/twaalgos/dtwasat.cc, spot/twaalgos/dtwasat.hh, spot/twaalgos/emptiness.cc, spot/twaalgos/emptiness.hh, spot/twaalgos/emptiness_stats.hh, spot/twaalgos/gtec/ce.cc, spot/twaalgos/gtec/ce.hh, spot/twaalgos/gtec/gtec.cc, spot/twaalgos/gtec/gtec.hh, spot/twaalgos/gtec/sccstack.cc, spot/twaalgos/gtec/status.cc, spot/twaalgos/gv04.cc, spot/twaalgos/hoa.cc, spot/twaalgos/hoa.hh, spot/twaalgos/isdet.cc, spot/twaalgos/isunamb.cc, spot/twaalgos/isweakscc.cc, spot/twaalgos/lbtt.cc, spot/twaalgos/lbtt.hh, spot/twaalgos/ltl2taa.cc, spot/twaalgos/ltl2taa.hh, spot/twaalgos/ltl2tgba_fm.cc, spot/twaalgos/ltl2tgba_fm.hh, spot/twaalgos/magic.cc, spot/twaalgos/magic.hh, spot/twaalgos/mask.cc, spot/twaalgos/mask.hh, spot/twaalgos/minimize.cc, spot/twaalgos/minimize.hh, spot/twaalgos/ndfs_result.hxx, spot/twaalgos/neverclaim.cc, spot/twaalgos/neverclaim.hh, spot/twaalgos/postproc.cc, spot/twaalgos/postproc.hh, spot/twaalgos/powerset.cc, spot/twaalgos/powerset.hh, spot/twaalgos/product.cc, spot/twaalgos/product.hh, spot/twaalgos/projrun.cc, spot/twaalgos/projrun.hh, spot/twaalgos/randomgraph.cc, spot/twaalgos/randomgraph.hh, spot/twaalgos/randomize.cc, spot/twaalgos/randomize.hh, spot/twaalgos/reachiter.cc, spot/twaalgos/reachiter.hh, spot/twaalgos/relabel.cc, spot/twaalgos/relabel.hh, spot/twaalgos/remfin.cc, spot/twaalgos/remprop.cc, spot/twaalgos/sbacc.cc, spot/twaalgos/sccfilter.cc, spot/twaalgos/sccfilter.hh, spot/twaalgos/sccinfo.cc, spot/twaalgos/sccinfo.hh, spot/twaalgos/se05.cc, spot/twaalgos/se05.hh, spot/twaalgos/sepsets.cc, spot/twaalgos/simulation.cc, spot/twaalgos/simulation.hh, spot/twaalgos/stats.cc, spot/twaalgos/stats.hh, spot/twaalgos/strength.cc, spot/twaalgos/strength.hh, spot/twaalgos/stripacc.cc, spot/twaalgos/stutter.cc, spot/twaalgos/stutter.hh, spot/twaalgos/tau03.cc, spot/twaalgos/tau03opt.cc, spot/twaalgos/tau03opt.hh, spot/twaalgos/totgba.cc, spot/twaalgos/translate.cc, spot/twaalgos/word.cc, tests/core/acc.cc, tests/core/bitvect.cc, tests/core/checkpsl.cc, tests/core/checkta.cc, tests/core/consterm.cc, tests/core/emptchk.cc, tests/core/equalsf.cc, tests/core/graph.cc, tests/core/ikwiad.cc, tests/core/intvcmp2.cc, tests/core/intvcomp.cc, tests/core/kind.cc, tests/core/kripkecat.cc, tests/core/ltlrel.cc, tests/core/ngraph.cc, tests/core/randtgba.cc, tests/core/readltl.cc, tests/core/reduc.cc, tests/core/safra.cc, tests/core/syntimpl.cc, tests/ltsmin/modelcheck.cc: Replace tabulars by 8 spaces. * tests/sanity/style.test: Add checks for no tabulars in *.cc *.hh *.hxx
273 lines
6.3 KiB
C++
273 lines
6.3 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2015 Laboratoire de Recherche et Développement de
|
|
// l'Epita (LRDE).
|
|
// Copyright (C) 2004, 2005 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 3 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#pragma once
|
|
|
|
#include <cassert>
|
|
#include <map>
|
|
#include <spot/misc/ltstr.hh>
|
|
|
|
namespace spot
|
|
{
|
|
|
|
/// \addtogroup emptiness_check_stats
|
|
/// @{
|
|
|
|
struct unsigned_statistics
|
|
{
|
|
virtual
|
|
~unsigned_statistics()
|
|
{
|
|
}
|
|
|
|
unsigned
|
|
get(const char* str) const
|
|
{
|
|
auto i = stats.find(str);
|
|
assert(i != stats.end());
|
|
return (this->*i->second)();
|
|
}
|
|
|
|
typedef unsigned (unsigned_statistics::*unsigned_fun)() const;
|
|
typedef std::map<const char*, unsigned_fun, char_ptr_less_than> stats_map;
|
|
stats_map stats;
|
|
};
|
|
|
|
/// \brief comparable statistics
|
|
///
|
|
/// This must be built from a spot::unsigned_statistics. But unlike
|
|
/// spot::unsigned_statistics, it supports equality and inequality tests.
|
|
/// (It's the only operations it supports, BTW.)
|
|
class unsigned_statistics_copy
|
|
{
|
|
public:
|
|
unsigned_statistics_copy()
|
|
: set(false)
|
|
{
|
|
}
|
|
|
|
unsigned_statistics_copy(const unsigned_statistics& o)
|
|
: set(false)
|
|
{
|
|
seteq(o);
|
|
}
|
|
|
|
bool
|
|
seteq(const unsigned_statistics& o)
|
|
{
|
|
if (!set)
|
|
{
|
|
for (auto& i: o.stats)
|
|
stats[i.first] = (o.*i.second)();
|
|
set = true;
|
|
return true;
|
|
}
|
|
if (*this == o)
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
typedef std::map<const char*, unsigned, char_ptr_less_than> stats_map;
|
|
stats_map stats;
|
|
|
|
|
|
bool
|
|
operator==(const unsigned_statistics_copy& o) const
|
|
{
|
|
for (auto& i: stats)
|
|
{
|
|
auto i2 = o.stats.find(i.first);
|
|
if (i2 == o.stats.end())
|
|
return false;
|
|
if (i.second != i2->second)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
operator!=(const unsigned_statistics_copy& o) const
|
|
{
|
|
return !(*this == o);
|
|
}
|
|
|
|
bool set;
|
|
};
|
|
|
|
/// \brief Emptiness-check statistics
|
|
///
|
|
/// Implementations of spot::emptiness_check may also implement
|
|
/// this interface. Try to dynamic_cast the spot::emptiness_check
|
|
/// pointer to know whether these statistics are available.
|
|
class ec_statistics: public unsigned_statistics
|
|
{
|
|
public :
|
|
ec_statistics()
|
|
: states_(0), transitions_(0), depth_(0), max_depth_(0)
|
|
{
|
|
stats["states"] =
|
|
static_cast<unsigned_statistics::unsigned_fun>(&ec_statistics::states);
|
|
stats["transitions"] =
|
|
static_cast<unsigned_statistics::unsigned_fun>
|
|
(&ec_statistics::transitions);
|
|
stats["max. depth"] =
|
|
static_cast<unsigned_statistics::unsigned_fun>
|
|
(&ec_statistics::max_depth);
|
|
}
|
|
|
|
void
|
|
set_states(unsigned n)
|
|
{
|
|
states_ = n;
|
|
}
|
|
|
|
void
|
|
inc_states()
|
|
{
|
|
++states_;
|
|
}
|
|
|
|
void
|
|
inc_transitions()
|
|
{
|
|
++transitions_;
|
|
}
|
|
|
|
void
|
|
inc_depth(unsigned n = 1)
|
|
{
|
|
depth_ += n;
|
|
if (depth_ > max_depth_)
|
|
max_depth_ = depth_;
|
|
}
|
|
|
|
void
|
|
dec_depth(unsigned n = 1)
|
|
{
|
|
assert(depth_ >= n);
|
|
depth_ -= n;
|
|
}
|
|
|
|
unsigned
|
|
states() const
|
|
{
|
|
return states_;
|
|
}
|
|
|
|
unsigned
|
|
transitions() const
|
|
{
|
|
return transitions_;
|
|
}
|
|
|
|
unsigned
|
|
max_depth() const
|
|
{
|
|
return max_depth_;
|
|
}
|
|
|
|
unsigned
|
|
depth() const
|
|
{
|
|
return depth_;
|
|
}
|
|
|
|
private :
|
|
unsigned states_; /// number of disctint visited states
|
|
unsigned transitions_; /// number of visited transitions
|
|
unsigned depth_; /// maximal depth of the stack(s)
|
|
unsigned max_depth_; /// maximal depth of the stack(s)
|
|
};
|
|
|
|
/// \brief Accepting Run Search statistics.
|
|
///
|
|
/// Implementations of spot::emptiness_check_result may also implement
|
|
/// this interface. Try to dynamic_cast the spot::emptiness_check_result
|
|
/// pointer to know whether these statistics are available.
|
|
class ars_statistics: public unsigned_statistics
|
|
{
|
|
public:
|
|
ars_statistics()
|
|
: prefix_states_(0), cycle_states_(0)
|
|
{
|
|
stats["(non unique) states for prefix"] =
|
|
static_cast<unsigned_statistics::unsigned_fun>
|
|
(&ars_statistics::ars_prefix_states);
|
|
stats["(non unique) states for cycle"] =
|
|
static_cast<unsigned_statistics::unsigned_fun>
|
|
(&ars_statistics::ars_cycle_states);
|
|
}
|
|
|
|
void
|
|
inc_ars_prefix_states()
|
|
{
|
|
++prefix_states_;
|
|
}
|
|
|
|
unsigned
|
|
ars_prefix_states() const
|
|
{
|
|
return prefix_states_;
|
|
}
|
|
|
|
void
|
|
inc_ars_cycle_states()
|
|
{
|
|
++cycle_states_;
|
|
}
|
|
|
|
unsigned
|
|
ars_cycle_states() const
|
|
{
|
|
return cycle_states_;
|
|
}
|
|
|
|
private:
|
|
unsigned prefix_states_; /// states visited to construct the prefix
|
|
unsigned cycle_states_; /// states visited to construct the cycle
|
|
};
|
|
|
|
/// \brief Accepting Cycle Search Space statistics
|
|
///
|
|
/// Implementations of spot::emptiness_check_result may also implement
|
|
/// this interface. Try to dynamic_cast the spot::emptiness_check_result
|
|
/// pointer to know whether these statistics are available.
|
|
class acss_statistics: public ars_statistics
|
|
{
|
|
public:
|
|
acss_statistics()
|
|
{
|
|
stats["search space states"] =
|
|
static_cast<unsigned_statistics::unsigned_fun>
|
|
(&acss_statistics::acss_states);
|
|
}
|
|
|
|
virtual
|
|
~acss_statistics()
|
|
{
|
|
}
|
|
|
|
/// Number of states in the search space for the accepting cycle.
|
|
virtual unsigned acss_states() const = 0;
|
|
};
|
|
/// @}
|
|
}
|