diff --git a/extras/src/sp_collector.cpp b/extras/src/sp_collector.cpp deleted file mode 100644 index dced62e..0000000 --- a/extras/src/sp_collector.cpp +++ /dev/null @@ -1,270 +0,0 @@ -// -// sp_collector.cpp -// -// Copyright (c) 2002, 2003 Peter Dimov -// -// 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) -// - -#if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) - -#include -#include -#include -#include -#include -#include -#include - -typedef std::map< void const *, std::pair > map_type; - -static map_type & get_map() -{ - static map_type m; - return m; -} - -typedef boost::detail::lightweight_mutex mutex_type; - -static mutex_type & get_mutex() -{ - static mutex_type m; - return m; -} - -static void * init_mutex_before_main = &get_mutex(); - -namespace -{ - class X; - - struct count_layout - { - boost::detail::sp_counted_base * pi; - int id; - }; - - struct shared_ptr_layout - { - X * px; - count_layout pn; - }; -} - -// assume 4 byte alignment for pointers when scanning -size_t const pointer_align = 4; - -typedef std::map map2_type; - -static void scan_and_count(void const * area, size_t size, map_type const & m, map2_type & m2) -{ - unsigned char const * p = static_cast(area); - - for(size_t n = 0; n + sizeof(shared_ptr_layout) <= size; p += pointer_align, n += pointer_align) - { - shared_ptr_layout const * q = reinterpret_cast(p); - - if(q->pn.id == boost::detail::shared_count_id && q->pn.pi != 0 && m.count(q->pn.pi) != 0) - { - ++m2[q->pn.pi]; - } - } -} - -typedef std::deque open_type; - -static void scan_and_mark(void const * area, size_t size, map2_type & m2, open_type & open) -{ - unsigned char const * p = static_cast(area); - - for(size_t n = 0; n + sizeof(shared_ptr_layout) <= size; p += pointer_align, n += pointer_align) - { - shared_ptr_layout const * q = reinterpret_cast(p); - - if(q->pn.id == boost::detail::shared_count_id && q->pn.pi != 0 && m2.count(q->pn.pi) != 0) - { - open.push_back(q->pn.pi); - m2.erase(q->pn.pi); - } - } -} - -static void find_unreachable_objects_impl(map_type const & m, map2_type & m2) -{ - // scan objects for shared_ptr members, compute internal counts - - { - std::cout << "... " << m.size() << " objects in m.\n"; - - for(map_type::const_iterator i = m.begin(); i != m.end(); ++i) - { - boost::detail::sp_counted_base const * p = static_cast(i->first); - - BOOST_ASSERT(p->use_count() != 0); // there should be no inactive counts in the map - - m2[ i->first ]; - - scan_and_count(i->second.first, i->second.second, m, m2); - } - - std::cout << "... " << m2.size() << " objects in m2.\n"; - } - - // mark reachable objects - - { - open_type open; - - for(map2_type::iterator i = m2.begin(); i != m2.end(); ++i) - { - boost::detail::sp_counted_base const * p = static_cast(i->first); - if(p->use_count() != i->second) open.push_back(p); - } - - std::cout << "... " << open.size() << " objects in open.\n"; - - for(open_type::iterator j = open.begin(); j != open.end(); ++j) - { - m2.erase(*j); - } - - while(!open.empty()) - { - void const * p = open.front(); - open.pop_front(); - - map_type::const_iterator i = m.find(p); - BOOST_ASSERT(i != m.end()); - - scan_and_mark(i->second.first, i->second.second, m2, open); - } - } - - // m2 now contains the unreachable objects -} - -std::size_t find_unreachable_objects(bool report) -{ - map2_type m2; - -#ifdef BOOST_HAS_THREADS - - // This will work without the #ifdef, but some compilers warn - // that lock is not referenced - - mutex_type::scoped_lock lock(get_mutex()); - -#endif - - map_type const & m = get_map(); - - find_unreachable_objects_impl(m, m2); - - if(report) - { - for(map2_type::iterator j = m2.begin(); j != m2.end(); ++j) - { - map_type::const_iterator i = m.find(j->first); - BOOST_ASSERT(i != m.end()); - std::cout << "Unreachable object at " << i->second.first << ", " << i->second.second << " bytes long.\n"; - } - } - - return m2.size(); -} - -typedef std::deque< boost::shared_ptr > free_list_type; - -static void scan_and_free(void * area, size_t size, map2_type const & m2, free_list_type & free) -{ - unsigned char * p = static_cast(area); - - for(size_t n = 0; n + sizeof(shared_ptr_layout) <= size; p += pointer_align, n += pointer_align) - { - shared_ptr_layout * q = reinterpret_cast(p); - - if(q->pn.id == boost::detail::shared_count_id && q->pn.pi != 0 && m2.count(q->pn.pi) != 0 && q->px != 0) - { - boost::shared_ptr * ppx = reinterpret_cast< boost::shared_ptr * >(p); - free.push_back(*ppx); - ppx->reset(); - } - } -} - -void free_unreachable_objects() -{ - free_list_type free; - - { - map2_type m2; - -#ifdef BOOST_HAS_THREADS - - mutex_type::scoped_lock lock(get_mutex()); - -#endif - - map_type const & m = get_map(); - - find_unreachable_objects_impl(m, m2); - - for(map2_type::iterator j = m2.begin(); j != m2.end(); ++j) - { - map_type::const_iterator i = m.find(j->first); - BOOST_ASSERT(i != m.end()); - scan_and_free(i->second.first, i->second.second, m2, free); - } - } - - std::cout << "... about to free " << free.size() << " objects.\n"; -} - -// debug hooks - -namespace boost -{ - -void sp_scalar_constructor_hook(void *) -{ -} - -void sp_scalar_constructor_hook(void * px, std::size_t size, void * pn) -{ -#ifdef BOOST_HAS_THREADS - - mutex_type::scoped_lock lock(get_mutex()); - -#endif - - get_map()[pn] = std::make_pair(px, size); -} - -void sp_scalar_destructor_hook(void *) -{ -} - -void sp_scalar_destructor_hook(void *, std::size_t, void * pn) -{ -#ifdef BOOST_HAS_THREADS - - mutex_type::scoped_lock lock(get_mutex()); - -#endif - - get_map().erase(pn); -} - -void sp_array_constructor_hook(void *) -{ -} - -void sp_array_destructor_hook(void *) -{ -} - -} // namespace boost - -#endif // defined(BOOST_SP_ENABLE_DEBUG_HOOKS) diff --git a/extras/src/sp_debug_hooks.cpp b/extras/src/sp_debug_hooks.cpp deleted file mode 100644 index bfea934..0000000 --- a/extras/src/sp_debug_hooks.cpp +++ /dev/null @@ -1,227 +0,0 @@ -// -// sp_debug_hooks.cpp -// -// Copyright (c) 2002, 2003 Peter Dimov -// -// 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) -// - -#if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) - -#include -#include -#include - -int const m = 2; // m * sizeof(int) must be aligned appropriately - -// magic values to mark heap blocks with - -int const allocated_scalar = 0x1234560C; -int const allocated_array = 0x1234560A; -int const adopted_scalar = 0x0567890C; -int const adopted_array = 0x0567890A; -int const deleted = 0x498769DE; - -using namespace std; // for compilers where things aren't in std - -// operator new - -static new_handler get_new_handler() -{ - new_handler p = set_new_handler(0); - set_new_handler(p); - return p; -} - -static void * allocate(size_t n, int mark) -{ - int * pm; - - for(;;) - { - pm = static_cast(malloc(n + m * sizeof(int))); - - if(pm != 0) break; - - if(new_handler pnh = get_new_handler()) - { - pnh(); - } - else - { - return 0; - } - } - - *pm = mark; - - return pm + m; -} - -void * operator new(size_t n) throw(bad_alloc) -{ - void * p = allocate(n, allocated_scalar); - -#if !defined(BOOST_NO_EXCEPTIONS) - - if(p == 0) throw bad_alloc(); - -#endif - - return p; -} - -void * operator new(size_t n, nothrow_t const &) throw() -{ - return allocate(n, allocated_scalar); -} - -void * operator new[](size_t n) throw(bad_alloc) -{ - void * p = allocate(n, allocated_array); - -#if !defined(BOOST_NO_EXCEPTIONS) - - if(p == 0) throw bad_alloc(); - -#endif - - return p; -} - -void * operator new[](size_t n, nothrow_t const &) throw() -{ - return allocate(n, allocated_array); -} - -// debug hooks - -namespace boost -{ - -void sp_scalar_constructor_hook(void * p) -{ - if(p == 0) return; - - int * pm = static_cast(p); - pm -= m; - - BOOST_ASSERT(*pm != adopted_scalar); // second smart pointer to the same address - BOOST_ASSERT(*pm != allocated_array); // allocated with new[] - BOOST_ASSERT(*pm == allocated_scalar); // not allocated with new - - *pm = adopted_scalar; -} - -void sp_scalar_constructor_hook(void * px, std::size_t, void *) -{ - sp_scalar_constructor_hook(px); -} - -void sp_scalar_destructor_hook(void * p) -{ - if(p == 0) return; - - int * pm = static_cast(p); - pm -= m; - - BOOST_ASSERT(*pm == adopted_scalar); // attempt to destroy nonmanaged block - - *pm = allocated_scalar; -} - -void sp_scalar_destructor_hook(void * px, std::size_t, void *) -{ - sp_scalar_destructor_hook(px); -} - -// It is not possible to handle the array hooks in a portable manner. -// The implementation typically reserves a bit of storage for the number -// of objects in the array, and the argument of the array hook isn't -// equal to the return value of operator new[]. - -void sp_array_constructor_hook(void * /* p */) -{ -/* - if(p == 0) return; - - // adjust p depending on the implementation - - int * pm = static_cast(p); - pm -= m; - - BOOST_ASSERT(*pm != adopted_array); // second smart array pointer to the same address - BOOST_ASSERT(*pm != allocated_scalar); // allocated with new - BOOST_ASSERT(*pm == allocated_array); // not allocated with new[] - - *pm = adopted_array; -*/ -} - -void sp_array_destructor_hook(void * /* p */) -{ -/* - if(p == 0) return; - - // adjust p depending on the implementation - - int * pm = static_cast(p); - pm -= m; - - BOOST_ASSERT(*pm == adopted_array); // attempt to destroy nonmanaged block - - *pm = allocated_array; -*/ -} - -} // namespace boost - -// operator delete - -void operator delete(void * p) throw() -{ - if(p == 0) return; - - int * pm = static_cast(p); - pm -= m; - - BOOST_ASSERT(*pm != deleted); // double delete - BOOST_ASSERT(*pm != adopted_scalar); // delete p.get(); - BOOST_ASSERT(*pm != allocated_array); // allocated with new[] - BOOST_ASSERT(*pm == allocated_scalar); // not allocated with new - - *pm = deleted; - - free(pm); -} - -void operator delete(void * p, nothrow_t const &) throw() -{ - ::operator delete(p); -} - -void operator delete[](void * p) throw() -{ - if(p == 0) return; - - int * pm = static_cast(p); - pm -= m; - - BOOST_ASSERT(*pm != deleted); // double delete - BOOST_ASSERT(*pm != adopted_scalar); // delete p.get(); - BOOST_ASSERT(*pm != allocated_scalar); // allocated with new - BOOST_ASSERT(*pm == allocated_array); // not allocated with new[] - - *pm = deleted; - - free(pm); -} - -void operator delete[](void * p, nothrow_t const &) throw() -{ - ::operator delete[](p); -} - -#endif // defined(BOOST_SP_ENABLE_DEBUG_HOOKS)