- 27 Jul, 2010 1 commit
-
-
Rusty Russell authored
-
- 20 Jul, 2010 1 commit
-
-
Rusty Russell authored
-
- 15 Jul, 2010 1 commit
-
-
Rusty Russell authored
We can have a 0 byte in the *middle* of an encoding.
-
- 12 Jul, 2010 2 commits
-
-
Rusty Russell authored
-
Rusty Russell authored
-
- 15 Jun, 2010 2 commits
-
-
Rusty Russell authored
-
Rusty Russell authored
We can't allow NULL with the new variant (needed by talloc's set_destructor for example), so document that and expose all three variants for different uses.
-
- 11 Jun, 2010 1 commit
-
-
Rusty Russell authored
cast_if_type() should not try to degrade the expression using 1?(test):0, as that promotes bool to int, as well as degrading functions to function pointers: it should be done by the callers. In particular, this fixes sparse_bsearch.
-
- 09 Jun, 2010 6 commits
-
-
Rusty Russell authored
This means we can't have more than 2^25 elements per page; that's a maximum small page size of about 2^24 (with >8 objects per small page we move to large pages), meaning a poolsize max of 4G. We have a tighter limit at the moment anyway, but we should remove it once we fix this. In particular count all-zero and all-one words in the used field (that's what we care about: full or empty) would give us another factor of 64 (we only care about larger pool sizes on 64-bit platforms). We can also restore the larger number of pages and greater inter-page spacing once we implement the alternative tiny allocator.
-
Rusty Russell authored
Turns out that now we use page numbers, this is more fundamental.
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
- 08 Jun, 2010 1 commit
-
-
Rusty Russell authored
This version has limitations: pools must be at least 1MB, and allocations are restricted to 1/1024 of the total pool size.
-
- 07 Jun, 2010 5 commits
-
-
Rusty Russell authored
-
Rusty Russell authored
Particularly useful for building tests standalone.
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
- 24 May, 2010 2 commits
-
-
Rusty Russell authored
To do this, we have to lose the ability for preargs and postargs to allow const and volatile argument signatures.
-
Rusty Russell authored
-
- 23 May, 2010 2 commits
-
-
Rusty Russell authored
-
Rusty Russell authored
hashtable: make traverse callback typesafe.
-
- 20 May, 2010 1 commit
-
-
Rusty Russell authored
-
- 11 May, 2010 3 commits
-
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
- 04 May, 2010 3 commits
-
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
- 09 Apr, 2010 9 commits
-
-
Rusty Russell authored
-
Rusty Russell authored
This takes my "make fastcheck" from about 57 seconds to about 43 seconds.
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
-
Rusty Russell authored
The ccanlint patch is rather intrusive. First, it adds a new field to all the ccanlint tests, "key". key is a shorter, still unique description of the test (e.g. "valgrind"). The names I chose as keys for all the tests are somewhat arbitrary and often don't reflect the name of the .c source file (because some of those names are just too darn long). Second, it adds two new options to ccanlint: -l: list tests ccanlint performs -x: exclude tests (e.g. -x trailing_whitespace,valgrind) It also adds a consistency check making sure all tests have unique keys and names. The primary goal of the ccanlint patch was so I could exclude the valgrind test, which takes a really long time for some modules (I think btree takes the longest, at around 2 minutes). I'm not sure I did it 100% correctly, so you'll want to review it first.
-