[lkml]   [2012]   [Sep]   [6]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRE: [PATCH v3 01/17] hashtable: introduce a small and naive hashtable
    > My solution to making 'break' work in the iterator is:
    > for (bkt = 0, node = NULL; bkt < HASH_SIZE(name) && node ==
    NULL; bkt++)
    > hlist_for_each_entry(obj, node, &name[bkt], member)

    I'd take a look at the generated code.
    Might come out a bit better if the condition is changed to:
    node == NULL && bkt < HASH_SIZE(name)
    you might find the compiler always optimises out the
    node == NULL comparison.
    (It might anyway, but switching the order gives it a better


     \ /
      Last update: 2012-09-07 12:02    [W:0.024 / U:4.284 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site