20cf43b3ea
For #184. * spot/graph/graph.hh, spot/kripke/kripkegraph.hh, spot/misc/bitvect.hh, spot/misc/common.hh, spot/misc/fixpool.hh, spot/misc/mspool.hh, spot/misc/timer.hh, spot/tl/formula.hh, spot/twa/acc.hh, spot/twa/taatgba.hh, spot/twa/twa.hh, spot/twa/twagraph.hh, spot/twaalgos/emptiness_stats.hh, spot/twaalgos/mask.hh, spot/twaalgos/ndfs_result.hxx, spot/twaalgos/sccinfo.hh, spot/twaalgos/translate.hh: Replace assert() by SPOT_ASSERT(), or an exception, or nothing, depending on the case. * tests/sanity/style.test: Flag all asserts in headers. * HACKING: Discuss assertions.
112 lines
3.2 KiB
C++
112 lines
3.2 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2011, 2015, 2016 Laboratoire de Recherche et
|
|
// Développement de l'Epita (LRDE)
|
|
//
|
|
// 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 <new>
|
|
#include <cstddef>
|
|
#include <cstdlib>
|
|
#include <cassert>
|
|
|
|
namespace spot
|
|
{
|
|
|
|
/// A fixed-size memory pool implementation.
|
|
class fixed_size_pool
|
|
{
|
|
public:
|
|
/// Create a pool allocating objects of \a size bytes.
|
|
fixed_size_pool(size_t size)
|
|
: freelist_(nullptr), free_start_(nullptr),
|
|
free_end_(nullptr), chunklist_(nullptr)
|
|
{
|
|
const size_t alignement = 2 * sizeof(size_t);
|
|
size_ = ((size >= sizeof(block_) ? size : sizeof(block_))
|
|
+ alignement - 1) & ~(alignement - 1);
|
|
}
|
|
|
|
/// Free any memory allocated by this pool.
|
|
~fixed_size_pool()
|
|
{
|
|
while (chunklist_)
|
|
{
|
|
chunk_* prev = chunklist_->prev;
|
|
free(chunklist_);
|
|
chunklist_ = prev;
|
|
}
|
|
}
|
|
|
|
/// Allocate \a size bytes of memory.
|
|
void*
|
|
allocate()
|
|
{
|
|
block_* f = freelist_;
|
|
// If we have free blocks available, return the first one.
|
|
if (f)
|
|
{
|
|
freelist_ = f->next;
|
|
return f;
|
|
}
|
|
|
|
// Else, create a block out of the last chunk of allocated
|
|
// memory.
|
|
|
|
// If all the last chunk has been used, allocate one more.
|
|
if (free_start_ + size_ > free_end_)
|
|
{
|
|
const size_t requested = (size_ > 128 ? size_ : 128) * 8192 - 64;
|
|
chunk_* c = reinterpret_cast<chunk_*>(malloc(requested));
|
|
if (!c)
|
|
throw std::bad_alloc();
|
|
c->prev = chunklist_;
|
|
chunklist_ = c;
|
|
|
|
free_start_ = c->data_ + size_;
|
|
free_end_ = c->data_ + requested;
|
|
}
|
|
|
|
void* res = free_start_;
|
|
free_start_ += size_;
|
|
return res;
|
|
}
|
|
|
|
/// \brief Recycle \a size bytes of memory.
|
|
///
|
|
/// Despite the name, the memory is not really deallocated in the
|
|
/// "delete" sense: it is still owned by the pool and will be
|
|
/// reused by allocate as soon as possible. The memory is only
|
|
/// freed when the pool is destroyed.
|
|
void
|
|
deallocate (const void* ptr)
|
|
{
|
|
SPOT_ASSERT(ptr);
|
|
block_* b = reinterpret_cast<block_*>(const_cast<void*>(ptr));
|
|
b->next = freelist_;
|
|
freelist_ = b;
|
|
}
|
|
|
|
private:
|
|
size_t size_;
|
|
struct block_ { block_* next; }* freelist_;
|
|
char* free_start_;
|
|
char* free_end_;
|
|
// chunk = several agglomerated blocks
|
|
union chunk_ { chunk_* prev; char data_[1]; }* chunklist_;
|
|
};
|
|
}
|