120 lines
2.8 KiB
C++
120 lines
2.8 KiB
C++
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
//
|
||
|
// (C) Copyright Ion Gaztanaga 2007-2013. Distributed under the Boost
|
||
|
// Software License, Version 1.0. (See accompanying file
|
||
|
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||
|
//
|
||
|
// See http://www.boost.org/libs/container for documentation.
|
||
|
//
|
||
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
|
||
|
#include <boost/container/detail/dlmalloc.hpp>
|
||
|
#include <boost/container/allocator.hpp>
|
||
|
#include <boost/container/vector.hpp>
|
||
|
#include <boost/container/list.hpp>
|
||
|
|
||
|
using namespace boost::container;
|
||
|
|
||
|
bool basic_test()
|
||
|
{
|
||
|
size_t received = 0;
|
||
|
if(!dlmalloc_all_deallocated())
|
||
|
return false;
|
||
|
void *ptr = dlmalloc_alloc(50, 98, &received);
|
||
|
if(dlmalloc_size(ptr) != received)
|
||
|
return false;
|
||
|
if(dlmalloc_allocated_memory() != dlmalloc_chunksize(ptr))
|
||
|
return false;
|
||
|
|
||
|
if(dlmalloc_all_deallocated())
|
||
|
return false;
|
||
|
|
||
|
dlmalloc_grow(ptr, received + 20, received + 30, &received);
|
||
|
|
||
|
if(dlmalloc_allocated_memory() != dlmalloc_chunksize(ptr))
|
||
|
return false;
|
||
|
|
||
|
if(dlmalloc_size(ptr) != received)
|
||
|
return false;
|
||
|
|
||
|
if(!dlmalloc_shrink(ptr, 100, 140, &received, 1))
|
||
|
return false;
|
||
|
|
||
|
if(dlmalloc_allocated_memory() != dlmalloc_chunksize(ptr))
|
||
|
return false;
|
||
|
|
||
|
if(!dlmalloc_shrink(ptr, 0, 140, &received, 1))
|
||
|
return false;
|
||
|
|
||
|
if(dlmalloc_allocated_memory() != dlmalloc_chunksize(ptr))
|
||
|
return false;
|
||
|
|
||
|
if(dlmalloc_shrink(ptr, 0, received/2, &received, 1))
|
||
|
return false;
|
||
|
|
||
|
if(dlmalloc_allocated_memory() != dlmalloc_chunksize(ptr))
|
||
|
return false;
|
||
|
|
||
|
if(dlmalloc_size(ptr) != received)
|
||
|
return false;
|
||
|
|
||
|
dlmalloc_free(ptr);
|
||
|
|
||
|
dlmalloc_malloc_check();
|
||
|
if(!dlmalloc_all_deallocated())
|
||
|
return false;
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
bool vector_test()
|
||
|
{
|
||
|
typedef boost::container::vector<int, allocator<int> > Vector;
|
||
|
if(!dlmalloc_all_deallocated())
|
||
|
return false;
|
||
|
{
|
||
|
const int NumElem = 1000;
|
||
|
Vector v;
|
||
|
v.resize(NumElem);
|
||
|
int *orig_buf = &v[0];
|
||
|
int *new_buf = &v[0];
|
||
|
while(orig_buf == new_buf){
|
||
|
Vector::size_type cl = v.capacity() - v.size();
|
||
|
while(cl--){
|
||
|
v.push_back(0);
|
||
|
}
|
||
|
v.push_back(0);
|
||
|
new_buf = &v[0];
|
||
|
}
|
||
|
}
|
||
|
if(!dlmalloc_all_deallocated())
|
||
|
return false;
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
bool list_test()
|
||
|
{
|
||
|
typedef boost::container::list<int, allocator<int> > List;
|
||
|
if(!dlmalloc_all_deallocated())
|
||
|
return false;
|
||
|
{
|
||
|
const int NumElem = 1000;
|
||
|
List l;
|
||
|
int values[NumElem];
|
||
|
l.insert(l.end(), &values[0], &values[NumElem]);
|
||
|
}
|
||
|
if(!dlmalloc_all_deallocated())
|
||
|
return false;
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
if(!basic_test())
|
||
|
return 1;
|
||
|
if(!vector_test())
|
||
|
return 1;
|
||
|
if(!list_test())
|
||
|
return 1;
|
||
|
return 0;
|
||
|
}
|