X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=src%2Fbitmap.c;h=e004bf2f7f950c00feef4d0d1155af6f5e655586;hb=e9cad17338196026836b555dd971ba84ed011a9d;hp=064fc4a4bd2f6f959a4dd9e3adfe7383c14ef004;hpb=7abdb555bc9e456cac39b0bd193d92b6eefbf57e;p=platform%2Fupstream%2Flibsolv.git

diff --git a/src/bitmap.c b/src/bitmap.c
index 064fc4a..e004bf2 100644
--- a/src/bitmap.c
+++ b/src/bitmap.c
@@ -7,7 +7,7 @@
 
 /*
  * bitmap.c
- * 
+ *
  */
 
 #include <stdlib.h>
@@ -21,14 +21,14 @@ void
 map_init(Map *m, int n)
 {
   m->size = (n + 7) >> 3;
-  m->map = n ? sat_calloc(m->size, 1) : 0;
+  m->map = m->size ? solv_calloc(m->size, 1) : 0;
 }
 
 /* destructor */
 void
 map_free(Map *m)
 {
-  m->map = sat_free(m->map);
+  m->map = solv_free(m->map);
   m->size = 0;
 }
 
@@ -37,8 +37,13 @@ void
 map_init_clone(Map *t, Map *s)
 {
   t->size = s->size;
-  t->map = sat_malloc(s->size);
-  memcpy(t->map, s->map, t->size);
+  if (s->size)
+    {
+      t->map = solv_malloc(s->size);
+      memcpy(t->map, s->map, s->size);
+    }
+  else
+    t->map = 0;
 }
 
 /* grow a map */
@@ -48,10 +53,58 @@ map_grow(Map *m, int n)
   n = (n + 7) >> 3;
   if (m->size < n)
     {
-      m->map = sat_realloc(m->map, n);
+      m->map = solv_realloc(m->map, n);
       memset(m->map + m->size, 0, n - m->size);
       m->size = n;
     }
 }
 
+/* bitwise-ands maps t and s, stores the result in t. */
+void
+map_and(Map *t, Map *s)
+{
+  unsigned char *ti, *si, *end;
+  ti = t->map;
+  si = s->map;
+  end = ti + (t->size < s->size ? t->size : s->size);
+  while (ti < end)
+    *ti++ &= *si++;
+}
+
+/* bitwise-ors maps t and s, stores the result in t. */
+void
+map_or(Map *t, Map *s)
+{
+  unsigned char *ti, *si, *end;
+  if (t->size < s->size)
+    map_grow(t, s->size << 3);
+  ti = t->map;
+  si = s->map;
+  end = ti + (t->size < s->size ? t->size : s->size);
+  while (ti < end)
+    *ti++ |= *si++;
+}
+
+/* remove all set bits in s from t. */
+void
+map_subtract(Map *t, Map *s)
+{
+  unsigned char *ti, *si, *end;
+  ti = t->map;
+  si = s->map;
+  end = ti + (t->size < s->size ? t->size : s->size);
+  while (ti < end)
+    *ti++ &= ~*si++;
+}
+
+void
+map_invertall(Map *m)
+{
+  unsigned char *ti, *end;
+  ti = m->map;
+  end = ti + m->size;
+  while (ti < end)
+    *ti++ ^= 0xff;
+}
+
 /* EOF */