linked lists linux kernel how they works?

[kernel.lover]

Hello,
In kernel source in list.h i found following info
#define LIST_HEAD_INIT(name) { &(name), &(name) }
#define LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name)
What i want to know is how LIST_HEAD_INIT(name)
evaluted? what will first definition return to second one?
regards,
cranium

[Ben Pfaff]

cr**********@gmail.com (kernel.lover) writes:

In kernel source in list.h i found following info
#define LIST_HEAD_INIT(name) { &(name), &(name) }
#define LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name)
What i want to know is how LIST_HEAD_INIT(name)
evaluted? what will first definition return to second one?

LIST_HEAD_INIT is an initializer for a struct list_head. You use
it in a declaration.

LIST_HEAD declares a struct list head and initializes it using
LIST_HEAD_INIT.
--
"The lusers I know are so clueless, that if they were dipped in clue
musk and dropped in the middle of pack of horny clues, on clue prom
night during clue happy hour, they still couldn't get a clue."
--Michael Girdwood, in the monastery