5 * Created by Victor Grishchenko on 4/1/09.
6 * Copyright 2009 Delft University of Technology. All rights reserved.
21 // make it work piece by piece
23 const uint8_t binmap_t::SPLIT[16] =
24 {0, 3, 12, 15, 48, 51, 60, 63, 192, 195, 204, 207, 240, 243, 252, 255};
25 const uint8_t binmap_t::JOIN[16] =
26 {0, 1, 4, 5, 2, 3, 6, 7, 8, 9, 12, 13, 10, 11, 14, 15};
27 const int binmap_t::NOJOIN = 0x10000;
30 void binmap_t::extend () {
31 const size_t nblocks = (blocks_allocated != 0) ? (2 * blocks_allocated) : (1);
33 if( 16 * nblocks > 1 + std::numeric_limits<uint16_t>::max() )
34 return /* The limit of cells number reached */;
36 uint32_t * const ncells = (uint32_t *) realloc(cells, nblocks * 16 * sizeof(uint32_t));
38 return /* Memory allocation error */;
41 while( blk-- != blocks_allocated ) {
42 uint16_t const blk_off = 16 * blk;
43 uint16_t * const blk_ptr = reinterpret_cast<uint16_t *>(ncells + blk_off);
45 blk_ptr[28] = free_top;
47 for(uint16_t i = 13; i != (uint16_t)-1; --i)
48 blk_ptr[2 * i] = blk_off + i + 1;
53 blocks_allocated = nblocks;
57 binmap_t::binmap_t() : height(4), blocks_allocated(0), cells(NULL),
58 free_top(0), cells_allocated(0), twist_mask(0) {
60 assert( free_top == 1 );
63 void binmap_t::twist (uint64_t mask) {
64 while ( (1<<height) <= mask )
69 binmap_t::binmap_t (const binmap_t& b) : height(b.height), free_top(b.free_top),
70 blocks_allocated(b.blocks_allocated), cells_allocated(b.cells_allocated) {
71 size_t memsz = blocks_allocated*16*32;
72 cells = (uint32_t*) malloc(memsz);
73 memcpy(cells,b.cells,memsz);
76 void binmap_t::dump (const char* note) {
78 for(int i=0; i<(blocks_allocated<<5); i++) {
80 printf("|%x ",halves[i]);
82 printf(">%i ",halves[i]);
84 printf("%x ",halves[i]);
91 uint32_t binmap_t::split16to32(uint16_t halfval) {
93 for(int i=0; i<4; i++) {
95 nval |= (SPLIT[halfval&0xf])<<24;
102 int binmap_t::join32to16(uint32_t cval) {
103 union { uint32_t i; uint8_t a[4]; } uvar;
104 uvar.i = cval & (cval>>1) & 0x55555555;
105 if ( (uvar.i|(uvar.i<<1)) != cval )
107 uvar.i = (uvar.i&0x05050505) | ((uvar.i&0x50505050U)>>3);
109 for(int i=3; i>=0; i--) {
111 res |= JOIN[uvar.a[i]];
117 void binmap_t::split (uint32_t half) {
120 uint32_t cell = alloc_cell(), left=cell<<1, right=left+1;
121 mark(half); //cells[(half>>1)|0xf] |= 1<<(half&0x1f);
122 uint16_t halfval = halves[half];
123 uint32_t nval = split16to32(halfval);
124 halves[left] = nval&0xffff;
125 halves[right] = nval>>16;
130 bool binmap_t::join (uint32_t half) {
131 uint32_t cellno = halves[half];
132 int left = cellno<<1, right=left+1;
133 if (deep(left) || deep(right))
135 int res = join32to16(cells[cellno]);
138 halves[half] = (uint16_t)res;
141 //cells[(half>>1)|0xf] &= ~(1<<(half&0x1f));
142 //(*childdeepcell) &= 0xffff>>1; // clean the full bit
146 void binmap_t::free_cell (uint16_t cell) {
149 halves[2 * cell] = free_top;
153 /** Get a free cell. */
154 uint16_t binmap_t::alloc_cell () {
155 if( cells_allocated == 15 * blocks_allocated )
158 if( cells_allocated == 15 * blocks_allocated ) {
159 assert( free_top != 0 );
165 const uint16_t ref = free_top;
166 free_top = halves[2 * ref];
176 bin64_t iterator::next (bool need_solid) {
178 while (pos.is_right())
181 //if (need_solid ? !solid() : deep())
184 while (need_solid ? !solid() : deep())
190 iterator::iterator(binmap_t* host_, bin64_t start, bool split) {
193 for(int i=0; i<64; i++)
195 pos = bin64_t(host->height,0);
196 layer_ = host->height;
197 while (!start.within(pos))
199 while (pos!=start && (deep() || split))
204 iterator::~iterator () {
205 while (half>1 && !deep())
207 // PROBLEM: may hang in the air if two iters
208 // exist simultaneously
209 // FIX: iterators are not exposed (protected)
213 void iterator::to (bool right) {
216 history[layer()] = half; // FIXME
219 if ( (host->twist_mask >> layer()) & 1 )
220 right = !right; // twist it!
221 half = (host->halves[half]<<1) + right;
225 void binmap_t::extend_range () {
228 uint16_t newroot = alloc_cell();
229 int left = newroot<<1, right = left+1;
230 cells[newroot] = cells[0];
243 void iterator::parent () {
245 host->extend_range();
246 history[layer()+1] = 0;
250 half = history[layer()];
256 bin64_t binmap_t::find (const bin64_t range, fill_t seek) {
257 iterator i(this,range,true);
258 fill_t stop = seek==EMPTY ? FILLED : EMPTY;
260 while ( i.deep() || (*i!=stop && *i!=seek) )
262 if (!i.deep() && *i==seek)
264 while (i.bin().is_right() && i.bin()!=range)
271 return bin64_t::NONE;
275 uint16_t binmap_t::get (bin64_t bin) {
276 if (bin==bin64_t::NONE)
278 iterator i(this,bin,true);
279 //while ( i.pos!=bin &&
280 // (i.deep() || (*i!=BIN_FULL && *i!=BIN_EMPTY)) )
282 //printf("at %i ",i.half);
284 return *i; // deep cell is never 0xffff or 0x0000; FIXME: API caveat
288 void binmap_t::clear () {
289 set(bin64_t(height,0),EMPTY);
293 uint64_t binmap_t::mass () {
294 iterator i(this,bin64_t(0,0),false);
299 if (*i==binmap_t::FILLED)
300 ret += i.pos.width();
307 void binmap_t::set (bin64_t bin, fill_t val) {
308 if (bin==bin64_t::NONE)
310 assert(val==FILLED || val==EMPTY);
311 iterator i(this,bin,false);
312 while (i.bin()!=bin && (i.deep() || *i!=val))
314 if (!i.deep() && *i==val)
321 } while (i.bin().within(bin));
326 uint64_t* binmap_t::get_stripes (int& count) {
328 uint64_t *stripes = (uint64_t*) malloc(32*8);
330 uint16_t cur = binmap_t::EMPTY;
331 stripes[count++] = 0;
332 iterator i(this,bin64_t(0,0),false);
338 if (cur!=*i) { // new stripe
340 stripes[count++] = i.bin().base_offset();
343 stripes = (uint64_t*) realloc(stripes,size*8);
352 stripes[count++] = i.bin().base_offset();
358 void binmap_t::remove (binmap_t& b) {
359 uint8_t start_lr = b.height>height ? b.height : height;
360 bin64_t top(start_lr,0);
361 iterator zis(this,top), zat(&b,top);
363 while (zis.deep() || zat.deep()) {
364 zis.left(); zat.left();
369 while (zis.pos.is_right()) {
370 zis.parent(); zat.parent();
372 zis.sibling(); zat.sibling();
377 bin64_t binmap_t::cover(bin64_t val) {
378 if (val==bin64_t::NONE)
380 iterator i(this,val,false);
381 while (i.pos!=val && !i.solid())
384 return bin64_t::NONE;
389 bin64_t binmap_t::find_filtered
390 (binmap_t& filter, bin64_t range, fill_t seek)
392 if (range==bin64_t::ALL)
393 range = bin64_t ( height>filter.height ? height : filter.height, 0 );
394 iterator ti(this,range,true), fi(&filter,range,true);
395 fill_t stop = seek==EMPTY ? FILLED : EMPTY;
399 (ti.deep() || *ti!=stop) :
400 (ti.deep() ? *fi!=FILLED : ( ((*ti^stop)&~*fi) && (*ti!=seek || *fi!=EMPTY) ) )
403 ti.left(); fi.left();
405 if (!ti.deep() && *ti==seek && !fi.deep() && *fi==EMPTY)
407 while (ti.bin().is_right() && ti.bin()!=range)
408 ti.parent(), fi.parent();
411 ti.sibling(), fi.sibling();
413 return bin64_t::NONE;
416 // FIXME unite with remove(); do bitwise()
417 void binmap_t::copy_range (binmap_t& origin, bin64_t range) {
418 if (range==bin64_t::ALL)
419 range = bin64_t ( height>origin.height ? height : origin.height, 0 );
420 iterator zis(this,range,true), zat(&origin,range,true);
421 while (zis.pos.within(range)) {
422 while (zis.deep() || zat.deep()) {
423 zis.left(); zat.left();
428 while (zis.pos.is_right()) {
429 zis.parent(); zat.parent();
431 zis.sibling(); zat.sibling();
435 uint64_t binmap_t::seq_length () {
437 if (!i.deep() && *i==FILLED)
438 return i.pos.width();
439 while (!i.pos.is_base()) {
440 if (i.deep() || *i!=FILLED)
445 return i.pos.base_offset() + (*i==FILLED ? 1 : 0);
449 bool binmap_t::is_solid (bin64_t range, fill_t val) {
450 if (range==bin64_t::ALL)
451 return !deep(0) && (is_mixed(val) || halves[0]==val);
452 iterator i(this,range,false);
453 while ( i.pos!=range && (i.deep() || !i.solid()) )
455 return i.solid() && (is_mixed(val) || *i==val);
461 heap_ = (bin64_t*) malloc(size_*sizeof(bin64_t));
465 bool bincomp (const bin64_t& a, const bin64_t& b) {
466 register uint64_t ab = a.base_offset(), bb = b.base_offset();
468 return a.tail_bit() < b.tail_bit();
473 bool bincomp_rev (const bin64_t& a, const bin64_t& b) {
474 register uint64_t ab = a.base_offset(), bb = b.base_offset();
476 return a.tail_bit() > b.tail_bit();
481 bin64_t binheap::pop() {
483 return bin64_t::NONE;
484 bin64_t ret = heap_[0];
485 std::pop_heap(heap_, heap_+filled_--,bincomp);
486 while (filled_ && heap_[0].within(ret))
487 std::pop_heap(heap_, heap_+filled_--,bincomp);
491 void binheap::extend() {
492 std::sort(heap_,heap_+filled_,bincomp_rev);
494 for(int i=1; i<filled_; i++)
495 if (!heap_[i].within(heap_[solid]))
496 heap_[++solid] = heap_[i];
498 if (2*filled_>size_) {
500 heap_ = (bin64_t*) realloc(heap_,size_*sizeof(bin64_t));
504 void binheap::push(bin64_t val) {
507 heap_[filled_++] = val;
508 std::push_heap(heap_, heap_+filled_,bincomp);
511 binheap::~binheap() {