lkml.org 
[lkml]   [2007]   [Sep]   [6]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    SubjectRe: Fast path efficiency (Re: [rfc][patch] dynamic data structure switching)
    From
    Date
    Oleg Verych <olecom@flower.upol.cz> writes:
    >
    > What is more efficient in general sense,
    > as opposed to s,3,2,1,0 Optimized?

    In general it shouldn't matter at all on any reasonably
    modern CPU (let's say less than 10 years old) unless you do
    it tens of thousands of times in a loop. Also gcc has reasonable
    default heuristics for this kind of stuff anyways
    (e.g. return NULL or return negative value is predicted
    unlikely by default)

    Cache misses are far more important to care about because
    they cost hundreds of cycles.

    -Andi
    -
    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: 2007-09-06 13:37    [W:0.018 / U:63.932 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site