Re: [PATCH] Introduce a handy list_first_entry macro

Pavel Emelianov writes: > There are many places in the kernel where the construction like > >foo = list_entry(head->next, struct foo_struct, list); > > are used. > The code might look more descriptive and neat if using the macro > >list_first_entry(head, type, member) \ >

[PATCH] Introduce a handy list_first_entry macro (v2)

There are many places in the kernel where the construction like foo = list_entry(head->next, struct foo_struct, list); are used. The code might look more descriptive and neat if using the macro list_first_entry(head, type, member) \ list_entry((head)->next, type, member) Her

Re: [PATCH] Introduce a handy list_first_entry macro

On Tue, 17 Apr 2007 15:18:56 +0400 Pavel Emelianov wrote: > There are many places in the kernel where the construction like > >foo = list_entry(head->next, struct foo_struct, list); > > are used. > The code might look more descriptive and neat if using the macro > >list_first_entry(hea

Re: [PATCH] Introduce a handy list_first_entry macro

On Tue, Apr 17, 2007 at 03:18:56PM +0400, Pavel Emelianov wrote: > There are many places in the kernel where the construction like > >foo = list_entry(head->next, struct foo_struct, list); > > are used. > The code might look more descriptive and neat if using the macro > >list_first_ent

Re: [PATCH] Introduce a handy list_first_entry macro

Pavel Emelianov <[EMAIL PROTECTED]> writes: > There are many places in the kernel where the construction like > >foo = list_entry(head->next, struct foo_struct, list); > > are used. > The code might look more descriptive and neat if using the macro > >list_first_entry(head, type, membe

[PATCH] Introduce a handy list_first_entry macro

There are many places in the kernel where the construction like foo = list_entry(head->next, struct foo_struct, list); are used. The code might look more descriptive and neat if using the macro list_first_entry(head, type, member) \ list_entry((head)->next, type, member) Her