/usr/include/rutil/DinkyPool.hxx is in libresiprocate-1.9-dev 1.9.6-1.
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 102 103 104 105 106 107 108 109 110 111 | #ifndef DinkyPool_Include_Guard
#define DinkyPool_Include_Guard
#include <limits>
#include <memory>
#include <stddef.h>
#include "rutil/PoolBase.hxx"
namespace resip
{
/**
A dirt-simple lightweight pool allocator meant for use in short-lifetime
objects. This will pool-allocate at most S bytes, after which no further pool
allocation will be performed, and fallback to the system new/delete will be
used (deallocating a pool allocated object will _not_ free up room in the
pool; the memory will be freed when the DinkyPool goes away).
*/
template<unsigned int S>
class DinkyPool : public PoolBase
{
public:
DinkyPool() :
count(0){}
~DinkyPool(){}
void* allocate(size_t size)
{
if((8*count)+size <= S)
{
void* result=mBuf[count];
count+=(size+7)/8;
return result;
}
return ::operator new(size);
}
void deallocate(void* ptr)
{
if(ptr >= (void*)mBuf[0] && ptr < (void*)mBuf[(S+7)/8])
{
return;
}
::operator delete(ptr);
}
size_t max_size() const
{
return std::numeric_limits<size_t>::max();
}
private:
// disabled
DinkyPool& operator=(const DinkyPool& rhs);
DinkyPool(const DinkyPool& other);
size_t count; // 8-byte chunks alloced so far
char mBuf[(S+7)/8][8]; // 8-byte chunks for alignment
};
}
#endif
/* ====================================================================
* The Vovida Software License, Version 1.0
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The names "VOCAL", "Vovida Open Communication Application Library",
* and "Vovida Open Communication Application Library (VOCAL)" must
* not be used to endorse or promote products derived from this
* software without prior written permission. For written
* permission, please contact vocal@vovida.org.
*
* 4. Products derived from this software may not be called "VOCAL", nor
* may "VOCAL" appear in their name, without prior written
* permission of Vovida Networks, Inc.
*
* THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
* NON-INFRINGEMENT ARE DISCLAIMED. IN NO EVENT SHALL VOVIDA
* NETWORKS, INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT DAMAGES
* IN EXCESS OF $1,000, NOR FOR ANY INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
* USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
*
* ====================================================================
*
* This software consists of voluntary contributions made by Vovida
* Networks, Inc. and many individuals on behalf of Vovida Networks,
* Inc. For more information on Vovida Networks, Inc., please see
* <http://www.vovida.org/>.
*
*/
|