1BLIST representing 128 blocks (0 MB of swap), requiring 0.00M of ram 2BLIST raw radix tree: 4 records, top-radix 2048 3128/128/2048> 128/128/2048> count 64 4blist_meta_alloc blkat 0 blk 0 count 64 radix 2048 5 R=0000 664/128/2048> count 32 7blist_meta_alloc blkat 0 blk 0 count 32 radix 2048 8 R=0040 932/128/2048> count 64 10blist_meta_alloc blkat 0 blk 0 count 64 radix 2048 11 R=SWAPBLK_NONE 1232/128/2048> BLIST { 13 (0000,2048): subtree (32/2048) big=32 { 14 (0000,64): bitmap 0000000000000000 big=0 15 (0040,64): bitmap ffffffff00000000 big=63 16 (0080,64): Terminator 17 } 18} 1932/128/2048> gapfind: begin=0000 end=0000 size=0 2032/128/2048>