9e97543e33
Rename as ... (free_anonymous_list_of): ... this, and correct their update on release. Also correct yesterday's the correction (ahem!). (dump): Improve verbosity. * src/misc/freelist.cc (free_list::remove, free_list::insert): Fix longstanding thinkos. (free_list::free_count): New function.
83 lines
2.7 KiB
C++
83 lines
2.7 KiB
C++
// Copyright (C) 2004, 2006 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.
|
|
|
|
|
|
#ifndef SPOT_MISC_FREELIST_HH
|
|
# define SPOT_MISC_FREELIST_HH
|
|
|
|
#include <list>
|
|
#include <utility>
|
|
|
|
namespace spot
|
|
{
|
|
|
|
/// \brief Manage list of free integers.
|
|
/// \ingroup misc_tools
|
|
class free_list
|
|
{
|
|
public:
|
|
virtual ~free_list();
|
|
|
|
/// \brief Find \a n consecutive integers.
|
|
///
|
|
/// Browse the list of free integers until \a n consecutive
|
|
/// integers are found. Extend the list (using extend()) otherwise.
|
|
/// \return the first integer of the range
|
|
int register_n(int n);
|
|
|
|
/// Release \a n consecutive integers starting at \a base.
|
|
void release_n(int base, int n);
|
|
|
|
/// Dump the list to \a os for debugging.
|
|
std::ostream& dump_free_list(std::ostream& os) const;
|
|
|
|
/// Extend the list by inserting a new pos-lenght pair.
|
|
void insert(int base, int n);
|
|
|
|
/// Remove \a n consecutive entries from the list, starting at \a base.
|
|
void remove(int base, int n = 0);
|
|
|
|
/// Return the number of free integers on the list.
|
|
int free_count() const;
|
|
|
|
protected:
|
|
|
|
/// Allocate \a n integer.
|
|
///
|
|
/// This function is called by register_n() when the free list is
|
|
/// empty or if \a n consecutive integers could not be found. It
|
|
/// should allocate more integers, possibly changing the list, and
|
|
/// return the first integer on a range of n consecutive integer
|
|
/// requested by the user.
|
|
virtual int extend(int n) = 0;
|
|
|
|
/// Such pairs describe \c second free integer starting at \c first.
|
|
typedef std::pair<int, int> pos_lenght_pair;
|
|
typedef std::list<pos_lenght_pair> free_list_type;
|
|
free_list_type fl; ///< Tracks unused BDD variables.
|
|
|
|
/// Remove \a n consecutive entries from the list, starting at \a base.
|
|
void remove(free_list_type::iterator i, int base, int n);
|
|
};
|
|
|
|
}
|
|
|
|
#endif // SPOT_MISC_FREELIST_HH
|