88 lines
2.7 KiB
C++
88 lines
2.7 KiB
C++
/*
|
|
|
|
Copyright (c) 2007-2012, Arvid Norberg
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
* 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.
|
|
* Neither the name of the author nor the names of its
|
|
contributors may be used to endorse or promote products derived
|
|
from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
LIABLE FOR ANY DIRECT, 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.
|
|
|
|
*/
|
|
|
|
#ifndef TORRENT_INTRUSIVE_PTR_BASE
|
|
#define TORRENT_INTRUSIVE_PTR_BASE
|
|
|
|
#include <boost/detail/atomic_count.hpp>
|
|
#include <boost/checked_delete.hpp>
|
|
#include <boost/intrusive_ptr.hpp>
|
|
#include "libtorrent/config.hpp"
|
|
#include "libtorrent/assert.hpp"
|
|
|
|
namespace libtorrent
|
|
{
|
|
template<class T>
|
|
struct intrusive_ptr_base
|
|
{
|
|
intrusive_ptr_base(intrusive_ptr_base<T> const&)
|
|
: m_refs(0) {}
|
|
|
|
intrusive_ptr_base& operator=(intrusive_ptr_base const& rhs)
|
|
{ return *this; }
|
|
|
|
friend void intrusive_ptr_add_ref(intrusive_ptr_base<T> const* s)
|
|
{
|
|
TORRENT_ASSERT(s != 0);
|
|
TORRENT_ASSERT(s->m_refs >= 0);
|
|
++s->m_refs;
|
|
}
|
|
|
|
friend void intrusive_ptr_release(intrusive_ptr_base<T> const* s)
|
|
{
|
|
TORRENT_ASSERT(s != 0);
|
|
TORRENT_ASSERT(s->m_refs > 0);
|
|
if (--s->m_refs == 0)
|
|
boost::checked_delete(static_cast<T const*>(s));
|
|
}
|
|
|
|
boost::intrusive_ptr<T> self()
|
|
{ return boost::intrusive_ptr<T>((T*)this); }
|
|
|
|
boost::intrusive_ptr<const T> self() const
|
|
{ return boost::intrusive_ptr<const T>((T const*)this); }
|
|
|
|
int refcount() const { return m_refs; }
|
|
|
|
intrusive_ptr_base(): m_refs(0) {}
|
|
|
|
private:
|
|
|
|
// reference counter for intrusive_ptr
|
|
mutable boost::detail::atomic_count m_refs;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|
|
|