/usr/include/trilinos/Sacado_Fad_MemPoolImp.hpp is in libtrilinos-sacado-dev 12.12.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 | // $Id$
// $Source$
// @HEADER
// ***********************************************************************
//
// Sacado Package
// Copyright (2006) Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
// USA
// Questions? Contact David M. Gay (dmgay@sandia.gov) or Eric T. Phipps
// (etphipp@sandia.gov).
//
// ***********************************************************************
// @HEADER
#include <new>
inline
Sacado::Fad::MemPool::MemPool(unsigned int elem_size, unsigned int n_elem,
unsigned int pre_alloc) :
esize(elem_size < sizeof(Link) ? sizeof(Link) : elem_size),
n(n_elem),
csize(esize*n+sizeof(Chunk)),
chunks(NULL),
head(NULL),
num_chunks(0)
{
// Pre allocate chunks if required
if (pre_alloc)
for (unsigned int i=0; i<pre_alloc; i++)
grow();
}
inline
Sacado::Fad::MemPool::~MemPool()
{
Chunk * nc = chunks;
while (nc != NULL) {
Chunk * p = nc;
nc = nc->next;
operator delete((void*) p);
}
}
inline void*
Sacado::Fad::MemPool::alloc()
{
if (head == NULL)
grow();
Link *p = head;
head = p->next;
return p;
}
inline void
Sacado::Fad::MemPool::free(void *b)
{
if (b == NULL)
return;
Link *p = static_cast<Link*>(b);
p->next = head;
head = p;
}
inline void
Sacado::Fad::MemPool::grow()
{
// Create a new chunk
void *p = operator new(csize);
Chunk *c = static_cast<Chunk*>(p);
c->mem = static_cast<char*>(p)+sizeof(Chunk);
c->next = chunks;
chunks = c;
++num_chunks;
// Initialize each element in a chunk
char *start = c->mem;
char *last = &start[(n-1)*esize];
for (char *q = start; q<last; q += esize)
reinterpret_cast<Link*>(q)->next = reinterpret_cast<Link*>(q+esize);
reinterpret_cast<Link*>(last)->next = NULL;
head = reinterpret_cast<Link*>(start);
}
|