Signed up for advogato after some guy posted a lame spelling flame in response to my kerneltrap interview and then slapped a silly thing about it into his diary here. Looks like an interesting way to log the various things I'm doing.
Did some more tweaking for code cleanliness of treap implementation for the bootmem patch and some more testing on segment_tree.h. The main issues are mostly testing and purifying the code to eliminate macros. Page stealing and type tagging are still pretty far off. Bootmem is really a background task.
The waitqueue vs. printk bootstrap ordering issue doesn't appear to be the only one. My suspicion now is an error committed while doing insertions on the comb lists corrupting the structure of the collision chains.
Stratified trees appear to be a bit of work to think out properly but it looks like when the code is boiled down to its essence it will actually be very simple.
Laid out some C code to get the Lyapunov exponents of hash functions and the entropy of the bucket distribution. Also started translating some of the other scripts I wrote to C. It'd be a little easier if there were something to check it against but for the entropy at least there are some analytically calculable results whose input distributions will work as test cases. For the Lyapunov exponent some more reading may be required. I seem to be having a little trouble getting the C version of the Anderson-Darling statistic's CDF to converge too, but that's a bit much for one day. This is pretty easy stuff to do but actually running the tests to get results to analyze the statistics of is so time-consuming it doesn't feel like it will ever get a decent timeslice.