X-Git-Url: https://pd.if.org/git/?p=nbds;a=blobdiff_plain;f=todo;h=807a31a35e9d2131743fe711675ed4a6f6bd046a;hp=6586b8747e49085d343896d76695c60ffeed8ee8;hb=329b5ab58cde015f4faec1879d3106f635294dd6;hpb=3b85ffe87f3862e6c9d72f919ce1bc005f95335a

diff --git a/todo b/todo
index 6586b87..807a31a 100644
--- a/todo
+++ b/todo
@@ -1,9 +1,26 @@
-- make rcu wait when its buffer gets full, instead of crashing
-- fix makefile to compute dependency info as a side-effect of compilation (-MF)
-- investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys 
-- test ht
++ fix makefile to compute dependency info as a side-effect of compilation (-MF)
++ support integer keys for ht
 + optimize tracing code, still too much overhead
 + use NULL instead of a sentinal node in skiplist and list
-- make interfaces for all data structures consistent 
++ make the interfaces for all data structures consistent 
 + make list and skiplist use string keys
-- optimize integer keys
++ optimize integer keys
++ ht_print()
++ iterators
+- make rcu yield when its buffer gets full instead of throwing an assert
+- alternate memory reclamation schemes, hazard pointers and/or reference count
+- investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys 
+- document usage
+- document algorithms
+- port tests from lib-high-scale
+- 32 bit version of hashtable
+- verify list and skiplist work on 32 bit platforms
+- transaction tests
+- validate the arguments to interface functions
+- shortcut from write-set to entries/nodes
+- use a shared scan for write-set validation, similar to ht copy logic
+- characterize the performance of hashtable, list and skiplist
+- experiment with the performance impact of not passing the hash between functions in ht
+- experiment with embedding the keys in the list/skiplist nodes
+- allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something else)
+- see if it's possible to rename nbd_malloc to malloc