Messages in this thread | | | Date | Tue, 01 Nov 2011 08:37:02 +0100 | From | Arne Jansen <> | Subject | Re: [RFC PATCH] ulist: generic data structure to build unique lists |
| |
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
On 12.10.2011 01:37, Andrew Morton wrote: > > Generally, I really do ask that you provide us a complete description > of what this utility is supposed to do. Once that is understood we can > then start to determine why none of the existing container helpers were > suitable, and were not capable of being modified to be suitable.
Thanks for your kind comments. I sent an updated version to the list accordingly. Please let me know if the documentation is good enough and shows the purpose clearly.
> > For example, from a quick squint at the code I'm wondering why > flex_array was unsuitable. >
ulist is currently implemented as an array, but this is not the way to go to scale to larger lists. I'd rather switch to using rbtrees over a certain threshold and will do so as soon as we settle on putting it in lib/ instead of burying it inside fs/btrfs.
- -Arne -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.10 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/
iQIcBAEBAgAGBQJOr6GeAAoJEPa4OwE4JkZ9TOcP/ArwGeCv8sQejihSahoXPum8 3F5/QhvNpQMtl//3iQ6duuyCbSNyskGQ6xViYmIhYoH8Q9E+DOgQrSa4lSgsJxte 4ItbiobmTnCOWHqbUckkjp8toBleXC2iSjvtpt7DCfP/H1enAi3lE9FONB5A6RcP ekGoNlp0LIFqLa0hk8qZ8JGetxuR1YWcunkrZRAze/cj4nGcegxiH9bLvEWgEShk o0QT8RNF1BFtef4unWyxnND+IUbwfvVMU61cKANbXvKhUfG6QxDH62QfYyxQ/Unw S2IXFZ41I/vgZIE4MKUABYFhigFkmBC3Mze7BGeF084SussazisHdA6UQsQi/TPP +fU73XTmpFbpg4z2XWAyDkq96qIYijgkSLwelSMRBza8/A3fGnLcKZSCNH3LbjGu aBjIi8A4VbasiBt/Hx1Vu2v9feX+S1tlmiODoLVp5bsvjD592bAfJK8QOf9RAFYK 0PMV2Fw6yplv6RFfZ32aJwtsryLN6iTOq1LXOz71KBVDaMuZXEur298WhrVCmcEN 270Kd3cBbF/JAoCODw97f/UPE9qWF1Vye+dTEjIWqb8bk8RBrzW5C6Wsxk9BRoU4 dONNMet9ykhHJIbchlYiOv3SMz04+yJJV74MmypefXj6tbxrdYm4gvebx28bC4jm Ok/DXMFAdLm6wCicjKgI =GHYG -----END PGP SIGNATURE-----
| |