#include <freelist.hh>
Inheritance diagram for spot::free_list:
Public Member Functions | |
virtual | ~free_list () |
int | register_n (int n) |
Find n consecutive integers. | |
void | release_n (int base, int n) |
Release n consecutive integers starting at base. | |
std::ostream & | dump_free_list (std::ostream &os) const |
Dump the list to os for debugging. | |
void | insert (int base, int n) |
Extend the list by inserting a new pos-lenght pair. | |
void | remove (int base, int n=0) |
Remove n consecutive entries from the list, starting at base. | |
Protected Types | |
typedef std::pair< int, int > | pos_lenght_pair |
Such pairs describe second free integer starting at first . | |
typedef std::list< pos_lenght_pair > | free_list_type |
Protected Member Functions | |
virtual int | extend (int n)=0 |
void | remove (free_list_type::iterator i, int base, int n) |
Remove n consecutive entries from the list, starting at base. | |
Protected Attributes | |
free_list_type | fl |
Tracks unused BDD variables. |
|
|
|
Such pairs describe
|
|
|
|
Dump the list to os for debugging.
|
|
Allocate n integer. This function is called by register_n() when the free list is empty or if 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. Implemented in spot::bdd_allocator, and spot::bdd_dict::annon_free_list. |
|
Extend the list by inserting a new pos-lenght pair.
|
|
Find n consecutive integers. Browse the list of free integers until n consecutive integers are found. Extend the list (using extend()) otherwise.
|
|
Release n consecutive integers starting at base.
|
|
Remove n consecutive entries from the list, starting at base.
|
|
Remove n consecutive entries from the list, starting at base.
|
|
Tracks unused BDD variables.
|