[lkml]   [2003]   [Apr]   [30]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [RFC][PATCH] Faster generic_fls
    Linus Torvalds <> writes:

    > Classic mistake. Lookup tables are only faster in benchmarks, they
    > are almost always slower in real life. You only need to miss in the
    > cache _once_ on the lookup to lose all the time you won on the
    > previous one hundred calls.

    It seems to me if you call the function so seldom the table drops out
    of the cache, it is irrelevant how long it takes anyway.

    > "Small and simple" is almost always better than the alternatives.

    Well, if a lookup table isn't "small and simple", I don't know what

    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: 2005-03-22 13:35    [W:0.024 / U:3.000 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site