[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: On PATH_MAX
From: |
Jonathan S. Shapiro |
Subject: |
Re: On PATH_MAX |
Date: |
Mon, 07 Nov 2005 09:44:49 -0500 |
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.
shap
- RE: On PATH_MAX, (continued)
- RE: On PATH_MAX, Christopher Nelson, 2005/11/03
- RE: On PATH_MAX, Christopher Nelson, 2005/11/03
- RE: On PATH_MAX, Christopher Nelson, 2005/11/03
- RE: On PATH_MAX, Christopher Nelson, 2005/11/03
- RE: On PATH_MAX, Christopher Nelson, 2005/11/04
- Re: On PATH_MAX, Marcus Brinkmann, 2005/11/07
- Re: On PATH_MAX,
Jonathan S. Shapiro <=
- RE: On PATH_MAX, Christopher Nelson, 2005/11/07
- RE: On PATH_MAX, Christopher Nelson, 2005/11/07
- RE: On PATH_MAX, Christopher Nelson, 2005/11/07
- RE: On PATH_MAX, Christopher Nelson, 2005/11/08