49c66c6319
This of course concerns push_back and push_front as well. * src/bin/common_finput.cc, src/bin/dstar2tgba.cc, src/bin/ltl2tgba.cc, src/bin/ltl2tgta.cc, src/bin/ltlcross.cc, src/bin/ltlfilt.cc, src/dstarparse/dstarparse.yy, src/kripkeparse/kripkeparse.yy, src/ltlast/formula.cc, src/ltlparse/ltlparse.yy, src/misc/minato.cc, src/neverparse/neverclaimparse.yy, src/priv/bddalloc.cc, src/ta/ta.cc, src/taalgos/emptinessta.cc, src/tgba/taatgba.cc, src/tgbaalgos/gtec/gtec.cc, src/tgbaalgos/gtec/sccstack.cc, src/tgbaalgos/magic.cc, src/tgbaalgos/ndfs_result.hxx, src/tgbaalgos/rundotdec.cc, src/tgbaalgos/scc.cc, src/tgbaalgos/se05.cc, src/tgbaalgos/simulation.cc, src/tgbaalgos/tau03.cc, src/tgbaalgos/tau03opt.cc, src/tgbaparse/tgbaparse.yy: Use emplace to make the code less verbose and avoid creating temporaries.
116 lines
3.1 KiB
C++
116 lines
3.1 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2007, 2011, 2014 Laboratoire de Recherche et
|
|
// Développement de l'Epita (LRDE).
|
|
// Copyright (C) 2003, 2004, 2006, 2007 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/>.
|
|
|
|
#include <bdd.h>
|
|
#include <cassert>
|
|
#include "bddalloc.hh"
|
|
|
|
namespace spot
|
|
{
|
|
|
|
bool bdd_allocator::initialized = false;
|
|
|
|
bdd_allocator::bdd_allocator()
|
|
{
|
|
initialize();
|
|
lvarnum = bdd_varnum();
|
|
fl.emplace_front(0, lvarnum);
|
|
}
|
|
|
|
void
|
|
bdd_allocator::initialize()
|
|
{
|
|
if (initialized)
|
|
return;
|
|
initialized = true;
|
|
// Buddy might have been initialized by a third-party library.
|
|
if (bdd_isrunning())
|
|
return;
|
|
// The values passed to bdd_init should depends on the problem
|
|
// the library is solving. It would be nice to allow users
|
|
// to tune this. By the meantime, we take the typical values
|
|
// for large examples advocated by the BuDDy manual.
|
|
bdd_init(1000000, 10000);
|
|
bdd_setvarnum(2);
|
|
// Disable the default GC handler. (Note that this will only be
|
|
// done if Buddy is initialized by Spot. Otherwise we prefer not
|
|
// to overwrite a handler that might have been set by the user.)
|
|
bdd_gbc_hook(0);
|
|
// When the node time is full, add 500000 nodes, i.e., 10MB.
|
|
bdd_setmaxincrease(500000);
|
|
}
|
|
|
|
void
|
|
bdd_allocator::extvarnum(int more)
|
|
{
|
|
int varnum = bdd_varnum();
|
|
// If varnum has been extended from another allocator (or
|
|
// externally), use the new variables.
|
|
if (lvarnum < varnum)
|
|
{
|
|
more -= varnum - lvarnum;
|
|
lvarnum = varnum;
|
|
}
|
|
// If we still need more variable, do allocate them.
|
|
if (more > 0)
|
|
{
|
|
bdd_extvarnum(more);
|
|
varnum += more;
|
|
lvarnum = varnum;
|
|
}
|
|
}
|
|
|
|
int
|
|
bdd_allocator::allocate_variables(int n)
|
|
{
|
|
return register_n(n);
|
|
}
|
|
|
|
void
|
|
bdd_allocator::release_variables(int base, int n)
|
|
{
|
|
release_n(base, n);
|
|
}
|
|
|
|
int
|
|
bdd_allocator::extend(int n)
|
|
{
|
|
// If we already have some free variable at the end
|
|
// of the variable space, allocate just the difference.
|
|
if (!fl.empty() && fl.back().first + fl.back().second == lvarnum)
|
|
{
|
|
int res = fl.back().first;
|
|
int endvar = fl.back().second;
|
|
assert(n > endvar);
|
|
extvarnum(n - endvar);
|
|
fl.pop_back();
|
|
return res;
|
|
}
|
|
else
|
|
{
|
|
// Otherwise, allocate as much variables as we need.
|
|
int res = lvarnum;
|
|
extvarnum(n);
|
|
return res;
|
|
}
|
|
}
|
|
}
|