Lines Matching refs:m2
88 static void scan_and_count(void const * area, size_t size, map_type const & m, map2_type & m2) in scan_and_count() argument
98 ++m2[q->pn.pi]; in scan_and_count()
105 static void scan_and_mark(void const * area, size_t size, map2_type & m2, open_type & open) in scan_and_mark() argument
113 if(q->pn.id == boost::detail::shared_count_id && q->pn.pi != 0 && m2.count(q->pn.pi) != 0) in scan_and_mark()
116 m2.erase(q->pn.pi); in scan_and_mark()
121 static void find_unreachable_objects_impl(map_type const & m, map2_type & m2) in find_unreachable_objects_impl() argument
132 scan_and_count(i->second.first, i->second.second, m, m2); in find_unreachable_objects_impl()
135 std::cout << "... " << m2.size() << " objects in m2.\n"; in find_unreachable_objects_impl()
143 for(map2_type::iterator i = m2.begin(); i != m2.end(); ++i) in find_unreachable_objects_impl()
149 std::cout << "... " << m2.size() << " objects in open.\n"; in find_unreachable_objects_impl()
153 m2.erase(*j); in find_unreachable_objects_impl()
164 scan_and_mark(i->second.first, i->second.second, m2, open); in find_unreachable_objects_impl()
173 map2_type m2; in find_unreachable_objects() local
186 find_unreachable_objects_impl(m, m2); in find_unreachable_objects()
190 for(map2_type::iterator j = m2.begin(); j != m2.end(); ++j) in find_unreachable_objects()
198 return m2.size(); in find_unreachable_objects()
203 static void scan_and_free(void * area, size_t size, map2_type const & m2, free_list_type & free) in scan_and_free() argument
211 …if(q->pn.id == boost::detail::shared_count_id && q->pn.pi != 0 && m2.count(q->pn.pi) != 0 && q->px… in scan_and_free()
225 map2_type m2; in free_unreachable_objects() local
235 find_unreachable_objects_impl(m, m2); in free_unreachable_objects()
237 for(map2_type::iterator j = m2.begin(); j != m2.end(); ++j) in free_unreachable_objects()
241 scan_and_free(i->second.first, i->second.second, m2, free); in free_unreachable_objects()