litmus-rt.git - The LITMUS^RT kernel.

The LITMUS^RT kernel.

Bjoern Brandenburg

about summary refs log tree commit diff stats

diff options

author	Takashi Iwai <tiwai@suse.de>	2009-10-02 05:04:54 -0400
committer	Takashi Iwai <tiwai@suse.de>	2009-10-02 05:06:16 -0400
commit	2f229a31aac86ea6911d70ec4c79196ca711d625 (patch)
tree	20bdbb6e1cd0f5eceab122815c0b6719ec67f3ca /net/tipc/cluster.c
parent	3b04691c2b1661c7e64cd4222d7175b5bf87163f (diff)

ALSA: Fix invalid __exit in sound/mips/*.c

The remove callback has to be marked as __devexit, as the dynamic unbind is possible. Reported-by: Uwe Kleine-König <u.kleine-koenig@pengutronix.de> Signed-off-by: Takashi Iwai <tiwai@suse.de>

Diffstat (limited to 'net/tipc/cluster.c')

0 files changed, 0 insertions, 0 deletions

="hl kwd">btree_insert128(struct btree_head128 *head, u64 k1, u64 k2, void *val, gfp_t gfp) { u64 key[2] = {k1, k2}; return btree_insert(&head->h, &btree_geo128, (unsigned long *)&key, val, gfp); } static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2, void *val) { u64 key[2] = {k1, k2}; return btree_update(&head->h, &btree_geo128, (unsigned long *)&key, val); } static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2) { u64 key[2] = {k1, k2}; return btree_remove(&head->h, &btree_geo128, (unsigned long *)&key); } static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2) { u64 key[2]; void *val; val = btree_last(&head->h, &btree_geo128, (unsigned long *)&key[0]); if (val) { *k1 = key[0]; *k2 = key[1]; } return val; } static inline int btree_merge128(struct btree_head128 *target, struct btree_head128 *victim, gfp_t gfp) { return btree_merge(&target->h, &victim->h, &btree_geo128, gfp); } void visitor128(void *elem, unsigned long opaque, unsigned long *__key, size_t index, void *__func); typedef void (*visitor128_t)(void *elem, unsigned long opaque, u64 key1, u64 key2, size_t index); static inline size_t btree_visitor128(struct btree_head128 *head, unsigned long opaque, visitor128_t func2) { return btree_visitor(&head->h, &btree_geo128, opaque, visitor128, func2); } static inline size_t btree_grim_visitor128(struct btree_head128 *head, unsigned long opaque, visitor128_t func2) { return btree_grim_visitor(&head->h, &btree_geo128, opaque, visitor128, func2); } #define btree_for_each_safe128(head, k1, k2, val) \ for (val = btree_last128(head, &k1, &k2); \ val; \ val = btree_get_prev128(head, &k1, &k2))


context:
space:
mode: