Messages in this thread | | | Subject | Re: [PATCH] perf lock: Implement basic sorting function of perf lock | From | Peter Zijlstra <> | Date | Mon, 28 Dec 2009 12:01:04 +0100 |
| |
On Sun, 2009-12-20 at 11:56 +0900, Hitoshi Mitake wrote: > +static struct lock_stat *lock_stat_findnew(void *addr, const char *name) > +{ > + struct list_head *entry = lockhashentry(addr); > + struct lock_stat *ret, *new;
Right, so you use a hash table to match lock instances, I suppose that's faster than an rb-tree?
Do you also remove instances after a match to keep the hash relatively small?
| |