Hi
On Wed, Sep 16, 2015 at 6:40 PM, Markus Armbruster wrote:
> marcandre.lur...@redhat.com writes:
>
>> From: Marc-André Lureau
>>
>> Use a hash table to lookup the pending event corresponding to the "id"
>> field. The hash table may grow without limit here, the following patch
>> will add some
Hi
On Wed, Sep 16, 2015 at 6:40 PM, Markus Armbruster wrote:
>
> I got a few more questions.
>
> Do we expect more events in need of separate throttling by some ID-like
> member of their data object?
> Do we expect *different* callbacks? Callbacks that throttle by some
> member of their data obj
marcandre.lur...@redhat.com writes:
> From: Marc-André Lureau
>
> Use a hash table to lookup the pending event corresponding to the "id"
> field. The hash table may grow without limit here, the following patch
> will add some cleaning.
>
> Signed-off-by: Marc-André Lureau
> Reviewed-by: Eric Bla
On Wed, Sep 02, 2015 at 01:09:42PM +0200, marcandre.lur...@redhat.com wrote:
> From: Marc-André Lureau
>
> Use a hash table to lookup the pending event corresponding to the "id"
> field. The hash table may grow without limit here, the following patch
> will add some cleaning.
>
> Signed-off-by:
From: Marc-André Lureau
Use a hash table to lookup the pending event corresponding to the "id"
field. The hash table may grow without limit here, the following patch
will add some cleaning.
Signed-off-by: Marc-André Lureau
Reviewed-by: Eric Blake
---
monitor.c | 104 ++
