ewah/bitmap.c

   1 /**
   2  * Copyright 2013, GitHub, Inc
   3  * Copyright 2009-2013, Daniel Lemire, Cliff Moon,
   4  *      David McIntosh, Robert Becho, Google Inc. and Veronika Zenz
   5  *
   6  * This program is free software; you can redistribute it and/or
   7  * modify it under the terms of the GNU General Public License
   8  * as published by the Free Software Foundation; either version 2
   9  * of the License, or (at your option) any later version.
  10  *
  11  * This program is distributed in the hope that it will be useful,
  12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14  * GNU General Public License for more details.
  15  *
  16  * You should have received a copy of the GNU General Public License
  17  * along with this program; if not, see <http://www.gnu.org/licenses/>.
  18  */
  19 #include "cache.h"
  20 #include "ewok.h"
  21
  22 #define EWAH_MASK(x) ((eword_t)1 << (x % BITS_IN_EWORD))
  23 #define EWAH_BLOCK(x) (x / BITS_IN_EWORD)
  24
  25 struct bitmap *bitmap_word_alloc(size_t word_alloc)
  26 {
  27         struct bitmap *bitmap = xmalloc(sizeof(struct bitmap));
  28         CALLOC_ARRAY(bitmap->words, word_alloc);
  29         bitmap->word_alloc = word_alloc;
  30         return bitmap;
  31 }
  32
  33 struct bitmap *bitmap_new(void)
  34 {
  35         return bitmap_word_alloc(32);
  36 }
  37
  38 struct bitmap *bitmap_dup(const struct bitmap *src)
  39 {
  40         struct bitmap *dst = bitmap_word_alloc(src->word_alloc);
  41         COPY_ARRAY(dst->words, src->words, src->word_alloc);
  42         return dst;
  43 }
  44
  45 static void bitmap_grow(struct bitmap *self, size_t word_alloc)
  46 {
  47         size_t old_size = self->word_alloc;
  48         ALLOC_GROW(self->words, word_alloc, self->word_alloc);
  49         memset(self->words + old_size, 0x0,
  50                (self->word_alloc - old_size) * sizeof(eword_t));
  51 }
  52
  53 void bitmap_set(struct bitmap *self, size_t pos)
  54 {
  55         size_t block = EWAH_BLOCK(pos);
  56
  57         bitmap_grow(self, block + 1);
  58         self->words[block] |= EWAH_MASK(pos);
  59 }
  60
  61 void bitmap_unset(struct bitmap *self, size_t pos)
  62 {
  63         size_t block = EWAH_BLOCK(pos);
  64
  65         if (block < self->word_alloc)
  66                 self->words[block] &= ~EWAH_MASK(pos);
  67 }
  68
  69 int bitmap_get(struct bitmap *self, size_t pos)
  70 {
  71         size_t block = EWAH_BLOCK(pos);
  72         return block < self->word_alloc &&
  73                 (self->words[block] & EWAH_MASK(pos)) != 0;
  74 }
  75
  76 struct ewah_bitmap *bitmap_to_ewah(struct bitmap *bitmap)
  77 {
  78         struct ewah_bitmap *ewah = ewah_new();
  79         size_t i, running_empty_words = 0;
  80         eword_t last_word = 0;
  81
  82         for (i = 0; i < bitmap->word_alloc; ++i) {
  83                 if (bitmap->words[i] == 0) {
  84                         running_empty_words++;
  85                         continue;
  86                 }
  87
  88                 if (last_word != 0)
  89                         ewah_add(ewah, last_word);
  90
  91                 if (running_empty_words > 0) {
  92                         ewah_add_empty_words(ewah, 0, running_empty_words);
  93                         running_empty_words = 0;
  94                 }
  95
  96                 last_word = bitmap->words[i];
  97         }
  98
  99         ewah_add(ewah, last_word);
 100         return ewah;
 101 }
 102
 103 struct bitmap *ewah_to_bitmap(struct ewah_bitmap *ewah)
 104 {
 105         struct bitmap *bitmap = bitmap_new();
 106         struct ewah_iterator it;
 107         eword_t blowup;
 108         size_t i = 0;
 109
 110         ewah_iterator_init(&it, ewah);
 111
 112         while (ewah_iterator_next(&blowup, &it)) {
 113                 ALLOC_GROW(bitmap->words, i + 1, bitmap->word_alloc);
 114                 bitmap->words[i++] = blowup;
 115         }
 116
 117         bitmap->word_alloc = i;
 118         return bitmap;
 119 }
 120
 121 void bitmap_and_not(struct bitmap *self, struct bitmap *other)
 122 {
 123         const size_t count = (self->word_alloc < other->word_alloc) ?
 124                 self->word_alloc : other->word_alloc;
 125
 126         size_t i;
 127
 128         for (i = 0; i < count; ++i)
 129                 self->words[i] &= ~other->words[i];
 130 }
 131
 132 void bitmap_or(struct bitmap *self, const struct bitmap *other)
 133 {
 134         size_t i;
 135
 136         bitmap_grow(self, other->word_alloc);
 137         for (i = 0; i < other->word_alloc; i++)
 138                 self->words[i] |= other->words[i];
 139 }
 140
 141 void bitmap_or_ewah(struct bitmap *self, struct ewah_bitmap *other)
 142 {
 143         size_t original_size = self->word_alloc;
 144         size_t other_final = (other->bit_size / BITS_IN_EWORD) + 1;
 145         size_t i = 0;
 146         struct ewah_iterator it;
 147         eword_t word;
 148
 149         if (self->word_alloc < other_final) {
 150                 self->word_alloc = other_final;
 151                 REALLOC_ARRAY(self->words, self->word_alloc);
 152                 memset(self->words + original_size, 0x0,
 153                         (self->word_alloc - original_size) * sizeof(eword_t));
 154         }
 155
 156         ewah_iterator_init(&it, other);
 157
 158         while (ewah_iterator_next(&word, &it))
 159                 self->words[i++] |= word;
 160 }
 161
 162 size_t bitmap_popcount(struct bitmap *self)
 163 {
 164         size_t i, count = 0;
 165
 166         for (i = 0; i < self->word_alloc; ++i)
 167                 count += ewah_bit_popcount64(self->words[i]);
 168
 169         return count;
 170 }
 171
 172 int bitmap_equals(struct bitmap *self, struct bitmap *other)
 173 {
 174         struct bitmap *big, *small;
 175         size_t i;
 176
 177         if (self->word_alloc < other->word_alloc) {
 178                 small = self;
 179                 big = other;
 180         } else {
 181                 small = other;
 182                 big = self;
 183         }
 184
 185         for (i = 0; i < small->word_alloc; ++i) {
 186                 if (small->words[i] != big->words[i])
 187                         return 0;
 188         }
 189
 190         for (; i < big->word_alloc; ++i) {
 191                 if (big->words[i] != 0)
 192                         return 0;
 193         }
 194
 195         return 1;
 196 }
 197
 198 int bitmap_is_subset(struct bitmap *self, struct bitmap *other)
 199 {
 200         size_t common_size, i;
 201
 202         if (self->word_alloc < other->word_alloc)
 203                 common_size = self->word_alloc;
 204         else {
 205                 common_size = other->word_alloc;
 206                 for (i = common_size; i < self->word_alloc; i++) {
 207                         if (self->words[i])
 208                                 return 1;
 209                 }
 210         }
 211
 212         for (i = 0; i < common_size; i++) {
 213                 if (self->words[i] & ~other->words[i])
 214                         return 1;
 215         }
 216         return 0;
 217 }
 218
 219 void bitmap_free(struct bitmap *bitmap)
 220 {
 221         if (!bitmap)
 222                 return;
 223
 224         free(bitmap->words);
 225         free(bitmap);
 226 }