Date: Wed, 11 Jul 2007 10:49:49 -0300 From: Ricardo Nabinger Sanchez <rnsanchez@wait4.org> To: freebsd-arch@freebsd.org Subject: Re: new friend of sys/queue.h and sys/tree.h Message-ID: <20070711104949.7cc844e9.rnsanchez@wait4.org> In-Reply-To: <4694AC5C.9040107@trzask.int.pl> References: <20070708081511.GX1221@funkthat.com> <200707101833.l6AIX0xl049962@ambrisko.com> <20070710.205751.-1962670861.imp@bsdimp.com> <4694AC5C.9040107@trzask.int.pl>
next in thread | previous in thread | raw e-mail | index | archive | help
On Wed, 11 Jul 2007 10:09:32 +0000 Pawel Wieczorek <wieczyk@trzask.int.pl> wrote: > Hash table are basic data structure, it is good to have it in kernel, > but i did not see some easy to use framework like sys/queue.h in our > kernel. >From what I understood, the actual implementation is based on lists (SLIST, specifically)? -- Ricardo Nabinger Sanchez rnsanchez@wait4.org Powered by FreeBSD "Left to themselves, things tend to go from bad to worse."
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20070711104949.7cc844e9.rnsanchez>