Re: To standardize Boost.Pool

From:

=?ISO-8859-1?Q?=D6=F6_Tiib?= <ootiib@hot.ee>

Newsgroups:

comp.lang.c++

Date:

Wed, 13 Apr 2011 08:28:13 -0700 (PDT)

Message-ID:

<5497ee99-8d91-4412-8995-6e1ea58ded81@32g2000vbe.googlegroups.com>

On Apr 13, 10:08 am, Phil Bouchard <p...@fornux.com> wrote:

On 4/12/2011 5:31 PM, Phil Bouchard wrote:

On 4/12/2011 2:56 PM, Jorgen Grahn wrote:

What would those benefits be, according to you? Detecting bugs (e.g.
assert_on_heap(ptr)), or something else?

Garbage collectors make use of such a function but also another memory
manager I wrote called: Shifted Pointer where we can see a repetitive
use of the function is_from() here:
http://www.fornux.com/personal/philippe/devel/shifted_ptr/boost/shift...

After some discussion with Boost, contiguous memory pool objects could
represent the process' stack, data and heap segments legally. For exam=

ple:

struct process
{
        static pool data;
        static pool heap;
        static pool stack;

};

The default implementation of the global operator ::new could be:

void * operator new(size_t n) { return process::heap.malloc(n); }

A call to is_from() with a pointer guaranteed to be within one of the 3
pools will then be valid:

int * h = new int;
process::heap.is_from(h) // true
int s;
process::heap.is_from(& s) // false
process::stack.is_from(& s) // true
static int d;
process::heap.is_from(& d) // false
process::stack.is_from(& d) // false
process::data.is_from(& d) // true

Please elaborate what is process::stack? On most platforms a process
may have several threads, number of these threads often changes
dynamically during processes lifetime and each of these threads does
have its own stack.