lkml.org 
[lkml]   [2005]   [Mar]   [12]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectImplementation of Buffer Headers in Linux kernel
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
disk).

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
list.

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

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
off.
};


Can anyone clarify my these queries.

Thanks & Regards
Dinesh

________________________________________________________________________
Yahoo! India Matrimony: Find your life partner online
Go to: http://yahoo.shaadi.com/india-matrimony
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 14:11    [W:0.136 / U:0.004 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site