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

Subject: Re: [Boost-users] Boost Graph Library and Boehm Garbage Collector
From: Geoff Hilton (geoff.hilton_at_[hidden])
Date: 2008-09-08 10:53:19

Stefan Strasser wrote:
> FBSL schrieb:
>> 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...
>>
> 
> there are other new's in BGL, is another one used in your case? I've 
> found the first one by simply stepping through it.
> 
> I don't know if that's appropriate in your case but there is a way to 
> replace the global new operator by boehm's collactable one, see homepage.
> though I still think BGL and boost in general shouldn't allocate memory 
> without an user defined allocator, but there isn't much(read: none) 
> interest in this on boost developer list.

Hi. I'd like to add my support behind the ability to provide a custom 
allocator in the graph type definition.

I'm writing an engine which will require relatively large (read: several 
GBs of RAM) graphs, so I think it pretty much a requirement that I be 
able to provide a custom allocator for pre-allocation of large segments 
of memory.

That's all, thanks.
Geoff