[lkml]   [2004]   [Oct]   [29]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: Semaphore assembly-code bug

    On Fri, 29 Oct 2004, linux-os wrote:
    > > with the following:
    > >
    > > leal 4(%esp),%esp
    > Probably so because I'm pretty certain that the 'pop' (a memory
    > access) is not going to be faster than a simple register operation.

    Bzzt, wrong answer.

    It's not "simple register operation". It's really about the fact that
    modern CPU's are smarter - yet dumber - then you think. They do things
    like speculate the value of %esp in order to avoid having to calculate it,
    and it's entirely possible that "pop" is much faster, simply because I
    guarantee you that a CPU will speculate %esp correctly across a "pop", but
    the same is not necessarily true for "lea %esp".

    Somebody should check what the Pentium M does. It might just notice that
    "lea 4(%esp),%esp" is the same as "add 4 to esp", but it's entirely
    possible that lea will confuse its stack engine logic and cause
    stack-related address generation stalls..

    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to
    More majordomo info at
    Please read the FAQ at

     \ /
      Last update: 2009-11-18 23:46    [W:0.020 / U:37.404 seconds]
    ©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site