lkml.org 
[lkml]   [2001]   [Oct]   [12]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: [Lse-tech] Re: RFC: patch to allow lock-free traversal of lists with insertion
    On Wed, 10 Oct 2001 17:25:22 +0000 (UTC)
    torvalds@transmeta.com (Linus Torvalds) wrote:

    > Absolutely. It's not that expensive an operation on sane hardware. And
    > it's definitely conceptually the only right thing to do - we're saying
    > that we're doing a read that depends on a previous read having seen
    > previous memory. Ergo, "rmb()".

    Accessing pointer contents after you dereference the pointer is "obvious":
    we've been trying to get Richard to understand the problem for FIVE MONTHS,
    and he's not stupid!

    The PPC manual (thanks Paul M) clearly indicates rmbdd() is not neccessary.
    That they mention it explicitly suggests it's going to happen on more
    architectures: you are correct, we should sprinkle rmbdd() everywhere
    (rmb() is heavy on current PPC) and I'll update the Kernel Locking Guide now
    the rules have changed.[1]

    Rusty.
    [1] Aren't we lucky our documentation is so sparse noone can accuse us of being
    inconsistent? 8)
    -
    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to majordomo@vger.kernel.org
    More majordomo info at http://vger.kernel.org/majordomo-info.html
    Please read the FAQ at http://www.tux.org/lkml/

    \
     
     \ /
      Last update: 2005-03-22 13:08    [W:0.020 / U:60.192 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site