Implementation of Buffer Headers in Linux kernel

From: Dinesh Ahuja
Date: Sat Mar 12 2005 - 11:44:47 EST

I have a few queries regarding the buffer headers in
linux. I a newbie so these queries may sound stupid to
linux gurus.

1. As per my understanding, block number in this
stucture corresponds to the block no of the data on a
logical device rather than on a physical device (hard

2. Why do we need pointer to a pointer for hash list ?
As per Maurice Bach book on OS, the hash list and free
list both are implemented as a circular, doubly link

In the below, we have used a pointer for free list,
then why pointer to pointer has been used for hash

struct buffer_head {
/* First cache line: */
struct buffer_head *b_next; /* Hash queue list */
struct buffer_head *b_next_free;/* lru/free list
linkage */
struct buffer_head *b_prev_free;/* doubly linked list
of buffers */
struct buffer_head **b_pprev; /* doubly linked list
of hash-queue */
// Rest part of sructure has been stripped

Can anyone clarify my these queries.

Thanks & Regards

Yahoo! India Matrimony: Find your life partner online
Go to:
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at
Please read the FAQ at