[Boost-users] Re: Boost Graph Library and Boehm Garbage Collector

Thanks for answering. Stefan Strasser wrote:

you're right, the BGL uses the default new operator to allocate memory which then isn't collected of course. so this makes it effectively impossible to use BGL with boehm GC. is there a boost guideline to allocate memory only through allocators which is violated here? (the "new" which is causing the leak(or one of your leaks?) in your code is at line 278 of graph/detail/adjacency_list.hpp in version 1.32)

As a matter of facts, by modifying the snippet code and commenting out the add_edge() instruction, the binary no longer leaks, so the guilty "new" is certainly the one you point (which allocate for an edge property). I tried to replace it by "new (UseGC)" in order to check if edge properties become collectable, but unfortunately this does not work, binary still leaks... Snippet code is again provided. -- #include #include #include #include <iostream> #include <vector> #include <list> using namespace std; using namespace boost; namespace boost { struct collected_vecS {}; struct collected_listS {}; template <class ValueType> struct container_gen { typedef vector type; }; template <class ValueType> struct container_gen { typedef list type; }; template <> struct parallel_edge_traits { typedef allow_parallel_edge_tag type; }; template <> struct parallel_edge_traits { typedef allow_parallel_edge_tag type; }; namespace detail { template <> struct is_random_access { enum { value = true }; typedef true_type type; }; } } typedef adjacency_list graph; int main() { while(true){ graph * g=new (UseGC) graph; for(unsigned int i=0; i<100; ++i){ add_vertex(*g); } for(unsigned int i=0; i<100; ++i){ for(unsigned int j=0; j<100; ++j){ // if uncommented, leaks // add_edge(i,j,*g); } } } }