* Doubt in linux kernel hlist implementation
@ 2010-06-17 14:36 Balachandar
0 siblings, 0 replies; only message in thread
From: Balachandar @ 2010-06-17 14:36 UTC (permalink / raw)
To: linux-c-programming
Hi,
I am trying to understand Linux Kernel implementation of linked list
and hash table. A link to the implementation is here. I understood the
linked list implementation. But i am little confused of why double
pointers is being used in hlist (**pprev). Link for hlist is here. I
understand that hlist is used in implementation of hash table since
head of the list requires only one pointer and it saves space. Why
cant it be done using single pointer (just *prev like the linked
list)? Please help me.
Thanks,
Bala
--
To unsubscribe from this list: send the line "unsubscribe linux-c-programming" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2010-06-17 14:36 UTC | newest]
Thread overview: (only message) (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2010-06-17 14:36 Doubt in linux kernel hlist implementation Balachandar
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).