[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <1344267537.27828.93.camel@twins>
Date: Mon, 06 Aug 2012 17:38:57 +0200
From: Peter Zijlstra <peterz@...radead.org>
To: Michel Lespinasse <walken@...gle.com>
Cc: riel@...hat.com, daniel.santos@...ox.com, aarcange@...hat.com,
dwmw2@...radead.org, akpm@...ux-foundation.org, linux-mm@...ck.org,
linux-kernel@...r.kernel.org, torvalds@...ux-foundation.org
Subject: Re: [PATCH v2 8/9] rbtree: faster augmented rbtree manipulation
On Mon, 2012-08-06 at 16:17 +0200, Peter Zijlstra wrote:
> Why would every user need to replicate the propagate and rotate
> boilerplate?
So I don't have a tree near that any of this applies to (hence no actual
patch), but why can't we have something like:
struct rb_augment_callback {
const bool (*update)(struct rb_node *node);
const int offset;
const int size;
};
#define RB_AUGMENT_CALLBACK(_update, _type, _rb_member, _aug_member) \
(struct rb_augment_callback){ \
.update = _update, \
.offset = offsetof(_type, _aug_member) - \
offsetof(_type, _rb_member), \
.size = sizeof(((_type *)NULL)->_aug_member), \
}
static __always_inline void
augment_copy(struct rb_node *dst, struct rb_node *src,
const rb_augment_callback *ac)
{
memcpy((void *)dst + ac->offset,
(void *)src + ac->offset,
ac->size);
}
static __always_inline void
augment_propagate(struct rb_node *rb, struct rb_node *stop,
const struct rb_augment_callback *ac)
{
while (rb != stop) {
if (!ac->update(rb))
break;
rb = rb_parent(rb);
}
}
static __always_inline void
augment_rotate(struct rb_node *old, struct rb_node *new.
const struct rb_augment_callback *ac)
{
augment_copy(new, old, ac);
(void)ac->update(old);
}
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists