RE: On PATH_MAX

[Christopher Nelson]

> 
> On Mon, 2005-11-07 at 12:41 +0100, Marcus Brinkmann wrote:
> 
> > This is not true.  If for example A and B have exactly the same
memory
> > layout, and a symmetric trust relationship that involves
coordination
> > of memory regions, B will always be able to map exactly the same
> > memory as A has.
> >
> > This is not a far-stretched scenario.  Such relationships do exist.
> 
> Indeed. The common term for this relationship is "multithreading".
> 
> But I think that somehow you and Christopher are talking past each
> other.
> 

Yes, exactly.  I mean two threads that don't exist in the same address
space.  In general, you could call them two processes.  So far as a
multithreading app is concerned, there is no possible provision for
confinement, of individual threads -- at least on most modern
processors, so that would be outside my query.

-={C}=-