2010-05-21 04:23:48 +00:00
|
|
|
/*
|
2012-12-04 11:56:32 +00:00
|
|
|
* virbitmap.h: Simple bitmap operations
|
2010-05-21 04:23:48 +00:00
|
|
|
*
|
2012-09-18 19:53:15 +00:00
|
|
|
* Copyright (C) 2010-2012 Red Hat, Inc.
|
2010-05-21 04:23:48 +00:00
|
|
|
* Copyright (C) 2010 Novell, Inc.
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
2012-09-20 22:30:55 +00:00
|
|
|
* License along with this library. If not, see
|
2012-07-21 10:06:23 +00:00
|
|
|
* <http://www.gnu.org/licenses/>.
|
2010-05-21 04:23:48 +00:00
|
|
|
*
|
|
|
|
* Author: Jim Fehlig <jfehlig@novell.com>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
|
|
|
#include <limits.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
2012-12-04 11:56:32 +00:00
|
|
|
#include "virbitmap.h"
|
2012-12-12 18:06:53 +00:00
|
|
|
#include "viralloc.h"
|
2012-12-04 12:04:07 +00:00
|
|
|
#include "virbuffer.h"
|
2012-09-14 07:46:57 +00:00
|
|
|
#include "util.h"
|
|
|
|
#include "c-ctype.h"
|
2012-10-25 00:44:27 +00:00
|
|
|
#include "count-one-bits.h"
|
2010-05-21 04:23:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
struct _virBitmap {
|
2012-09-14 07:46:56 +00:00
|
|
|
size_t max_bit;
|
|
|
|
size_t map_len;
|
2011-02-10 10:11:15 +00:00
|
|
|
unsigned long *map;
|
2010-05-21 04:23:48 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2011-02-10 10:11:15 +00:00
|
|
|
#define VIR_BITMAP_BITS_PER_UNIT ((int) sizeof(unsigned long) * CHAR_BIT)
|
2010-05-21 04:23:48 +00:00
|
|
|
#define VIR_BITMAP_UNIT_OFFSET(b) ((b) / VIR_BITMAP_BITS_PER_UNIT)
|
|
|
|
#define VIR_BITMAP_BIT_OFFSET(b) ((b) % VIR_BITMAP_BITS_PER_UNIT)
|
2011-02-10 10:11:15 +00:00
|
|
|
#define VIR_BITMAP_BIT(b) (1UL << VIR_BITMAP_BIT_OFFSET(b))
|
2010-05-21 04:23:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
/**
|
2012-09-14 07:46:56 +00:00
|
|
|
* virBitmapNew:
|
2010-05-21 04:23:48 +00:00
|
|
|
* @size: number of bits
|
|
|
|
*
|
|
|
|
* Allocate a bitmap capable of containing @size bits.
|
|
|
|
*
|
|
|
|
* Returns a pointer to the allocated bitmap or NULL if
|
|
|
|
* memory cannot be allocated.
|
|
|
|
*/
|
2012-09-14 07:46:56 +00:00
|
|
|
virBitmapPtr virBitmapNew(size_t size)
|
2010-05-21 04:23:48 +00:00
|
|
|
{
|
|
|
|
virBitmapPtr bitmap;
|
|
|
|
size_t sz;
|
|
|
|
|
2010-06-02 15:03:57 +00:00
|
|
|
if (SIZE_MAX - VIR_BITMAP_BITS_PER_UNIT < size || size == 0)
|
2010-05-21 04:23:48 +00:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
sz = (size + VIR_BITMAP_BITS_PER_UNIT - 1) /
|
|
|
|
VIR_BITMAP_BITS_PER_UNIT;
|
|
|
|
|
|
|
|
if (VIR_ALLOC(bitmap) < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (VIR_ALLOC_N(bitmap->map, sz) < 0) {
|
|
|
|
VIR_FREE(bitmap);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-09-14 07:46:56 +00:00
|
|
|
bitmap->max_bit = size;
|
|
|
|
bitmap->map_len = sz;
|
2010-05-21 04:23:48 +00:00
|
|
|
return bitmap;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapFree:
|
|
|
|
* @bitmap: previously allocated bitmap
|
|
|
|
*
|
2012-09-14 07:46:56 +00:00
|
|
|
* Free @bitmap previously allocated by virBitmapNew.
|
2010-05-21 04:23:48 +00:00
|
|
|
*/
|
|
|
|
void virBitmapFree(virBitmapPtr bitmap)
|
|
|
|
{
|
|
|
|
if (bitmap) {
|
|
|
|
VIR_FREE(bitmap->map);
|
|
|
|
VIR_FREE(bitmap);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-09-06 15:09:32 +00:00
|
|
|
|
|
|
|
int virBitmapCopy(virBitmapPtr dst, virBitmapPtr src)
|
|
|
|
{
|
2012-09-14 07:46:56 +00:00
|
|
|
if (dst->max_bit != src->max_bit) {
|
2012-09-06 15:09:32 +00:00
|
|
|
errno = EINVAL;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2012-09-14 07:46:56 +00:00
|
|
|
memcpy(dst->map, src->map, src->map_len * sizeof(src->map[0]));
|
2012-09-06 15:09:32 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-05-21 04:23:48 +00:00
|
|
|
/**
|
|
|
|
* virBitmapSetBit:
|
|
|
|
* @bitmap: Pointer to bitmap
|
|
|
|
* @b: bit position to set
|
|
|
|
*
|
|
|
|
* Set bit position @b in @bitmap
|
|
|
|
*
|
|
|
|
* Returns 0 on if bit is successfully set, -1 on error.
|
|
|
|
*/
|
|
|
|
int virBitmapSetBit(virBitmapPtr bitmap, size_t b)
|
|
|
|
{
|
2012-09-14 07:46:56 +00:00
|
|
|
if (bitmap->max_bit <= b)
|
2010-05-21 04:23:48 +00:00
|
|
|
return -1;
|
|
|
|
|
2011-02-10 10:11:15 +00:00
|
|
|
bitmap->map[VIR_BITMAP_UNIT_OFFSET(b)] |= VIR_BITMAP_BIT(b);
|
2010-05-21 04:23:48 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapClearBit:
|
|
|
|
* @bitmap: Pointer to bitmap
|
|
|
|
* @b: bit position to clear
|
|
|
|
*
|
|
|
|
* Clear bit position @b in @bitmap
|
|
|
|
*
|
|
|
|
* Returns 0 on if bit is successfully clear, -1 on error.
|
|
|
|
*/
|
|
|
|
int virBitmapClearBit(virBitmapPtr bitmap, size_t b)
|
|
|
|
{
|
2012-09-14 07:46:56 +00:00
|
|
|
if (bitmap->max_bit <= b)
|
2010-05-21 04:23:48 +00:00
|
|
|
return -1;
|
|
|
|
|
2011-02-10 10:11:15 +00:00
|
|
|
bitmap->map[VIR_BITMAP_UNIT_OFFSET(b)] &= ~VIR_BITMAP_BIT(b);
|
2010-05-21 04:23:48 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-09-14 07:46:57 +00:00
|
|
|
/* Helper function. caller must ensure b < bitmap->max_bit */
|
|
|
|
static bool virBitmapIsSet(virBitmapPtr bitmap, size_t b)
|
|
|
|
{
|
|
|
|
return !!(bitmap->map[VIR_BITMAP_UNIT_OFFSET(b)] & VIR_BITMAP_BIT(b));
|
|
|
|
}
|
|
|
|
|
2010-05-21 04:23:48 +00:00
|
|
|
/**
|
|
|
|
* virBitmapGetBit:
|
|
|
|
* @bitmap: Pointer to bitmap
|
|
|
|
* @b: bit position to get
|
|
|
|
* @result: bool pointer to receive bit setting
|
|
|
|
*
|
|
|
|
* Get setting of bit position @b in @bitmap and store in @result
|
|
|
|
*
|
|
|
|
* On success, @result will contain the setting of @b and 0 is
|
|
|
|
* returned. On failure, -1 is returned and @result is unchanged.
|
|
|
|
*/
|
|
|
|
int virBitmapGetBit(virBitmapPtr bitmap, size_t b, bool *result)
|
|
|
|
{
|
2012-09-14 07:46:56 +00:00
|
|
|
if (bitmap->max_bit <= b)
|
2010-05-21 04:23:48 +00:00
|
|
|
return -1;
|
|
|
|
|
2012-09-14 07:46:57 +00:00
|
|
|
*result = virBitmapIsSet(bitmap, b);
|
2010-05-21 04:23:48 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2011-02-09 12:14:51 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapString:
|
|
|
|
* @bitmap: Pointer to bitmap
|
|
|
|
*
|
|
|
|
* Convert @bitmap to printable string.
|
|
|
|
*
|
|
|
|
* Returns pointer to the string or NULL on error.
|
|
|
|
*/
|
|
|
|
char *virBitmapString(virBitmapPtr bitmap)
|
|
|
|
{
|
|
|
|
virBuffer buf = VIR_BUFFER_INITIALIZER;
|
|
|
|
size_t sz;
|
|
|
|
|
|
|
|
virBufferAddLit(&buf, "0x");
|
|
|
|
|
2012-09-14 07:46:56 +00:00
|
|
|
sz = bitmap->map_len;
|
2011-02-09 12:14:51 +00:00
|
|
|
|
|
|
|
while (sz--) {
|
2011-04-30 16:34:49 +00:00
|
|
|
virBufferAsprintf(&buf, "%0*lx",
|
2011-02-09 12:14:51 +00:00
|
|
|
VIR_BITMAP_BITS_PER_UNIT / 4,
|
|
|
|
bitmap->map[sz]);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (virBufferError(&buf)) {
|
|
|
|
virBufferFreeAndReset(&buf);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return virBufferContentAndReset(&buf);
|
|
|
|
}
|
2012-09-14 07:46:57 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapFormat:
|
|
|
|
* @bitmap: the bitmap
|
|
|
|
*
|
|
|
|
* This function is the counterpart of virBitmapParse. This function creates
|
|
|
|
* a human-readable string representing the bits in bitmap.
|
|
|
|
*
|
|
|
|
* See virBitmapParse for the format of @str.
|
|
|
|
*
|
|
|
|
* Returns the string on success or NULL otherwise. Caller should call
|
|
|
|
* VIR_FREE to free the string.
|
|
|
|
*/
|
|
|
|
char *virBitmapFormat(virBitmapPtr bitmap)
|
|
|
|
{
|
|
|
|
virBuffer buf = VIR_BUFFER_INITIALIZER;
|
|
|
|
bool first = true;
|
|
|
|
int start, cur, prev;
|
|
|
|
|
|
|
|
if (!bitmap)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
cur = virBitmapNextSetBit(bitmap, -1);
|
|
|
|
if (cur < 0)
|
|
|
|
return strdup("");
|
|
|
|
|
|
|
|
start = prev = cur;
|
|
|
|
while (prev >= 0) {
|
|
|
|
cur = virBitmapNextSetBit(bitmap, prev);
|
|
|
|
|
|
|
|
if (cur == prev + 1) {
|
|
|
|
prev = cur;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* cur < 0 or cur > prev + 1 */
|
|
|
|
|
|
|
|
if (!first)
|
|
|
|
virBufferAddLit(&buf, ",");
|
|
|
|
else
|
|
|
|
first = false;
|
|
|
|
|
|
|
|
if (prev == start)
|
|
|
|
virBufferAsprintf(&buf, "%d", start);
|
|
|
|
else
|
|
|
|
virBufferAsprintf(&buf, "%d-%d", start, prev);
|
|
|
|
|
|
|
|
start = prev = cur;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (virBufferError(&buf)) {
|
|
|
|
virBufferFreeAndReset(&buf);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return virBufferContentAndReset(&buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapParse:
|
|
|
|
* @str: points to a string representing a human-readable bitmap
|
|
|
|
* @bitmap: a bitmap created from @str
|
|
|
|
* @bitmapSize: the upper limit of num of bits in created bitmap
|
|
|
|
*
|
|
|
|
* This function is the counterpart of virBitmapFormat. This function creates
|
|
|
|
* a bitmap, in which bits are set according to the content of @str.
|
|
|
|
*
|
|
|
|
* @str is a comma separated string of fields N, which means a number of bit
|
|
|
|
* to set, and ^N, which means to unset the bit, and N-M for ranges of bits
|
|
|
|
* to set.
|
|
|
|
*
|
|
|
|
* Returns the number of bits set in @bitmap, or -1 in case of error.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int virBitmapParse(const char *str,
|
|
|
|
char sep,
|
|
|
|
virBitmapPtr *bitmap,
|
|
|
|
size_t bitmapSize)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
bool neg = false;
|
|
|
|
const char *cur;
|
|
|
|
char *tmp;
|
|
|
|
int i, start, last;
|
|
|
|
|
|
|
|
if (!str)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
cur = str;
|
|
|
|
virSkipSpaces(&cur);
|
|
|
|
|
|
|
|
if (*cur == 0)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
*bitmap = virBitmapNew(bitmapSize);
|
|
|
|
if (!*bitmap)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
while (*cur != 0 && *cur != sep) {
|
|
|
|
/*
|
|
|
|
* 3 constructs are allowed:
|
|
|
|
* - N : a single CPU number
|
|
|
|
* - N-M : a range of CPU numbers with N < M
|
|
|
|
* - ^N : remove a single CPU number from the current set
|
|
|
|
*/
|
|
|
|
if (*cur == '^') {
|
|
|
|
cur++;
|
|
|
|
neg = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!c_isdigit(*cur))
|
|
|
|
goto parse_error;
|
|
|
|
|
|
|
|
if (virStrToLong_i(cur, &tmp, 10, &start) < 0)
|
|
|
|
goto parse_error;
|
|
|
|
if (start < 0)
|
|
|
|
goto parse_error;
|
|
|
|
|
|
|
|
cur = tmp;
|
|
|
|
|
|
|
|
virSkipSpaces(&cur);
|
|
|
|
|
|
|
|
if (*cur == ',' || *cur == 0 || *cur == sep) {
|
|
|
|
if (neg) {
|
|
|
|
if (virBitmapIsSet(*bitmap, start)) {
|
|
|
|
ignore_value(virBitmapClearBit(*bitmap, start));
|
|
|
|
ret--;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (!virBitmapIsSet(*bitmap, start)) {
|
|
|
|
ignore_value(virBitmapSetBit(*bitmap, start));
|
|
|
|
ret++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else if (*cur == '-') {
|
|
|
|
if (neg)
|
|
|
|
goto parse_error;
|
|
|
|
|
|
|
|
cur++;
|
|
|
|
virSkipSpaces(&cur);
|
|
|
|
|
|
|
|
if (virStrToLong_i(cur, &tmp, 10, &last) < 0)
|
|
|
|
goto parse_error;
|
|
|
|
if (last < start)
|
|
|
|
goto parse_error;
|
|
|
|
|
|
|
|
cur = tmp;
|
|
|
|
|
|
|
|
for (i = start; i <= last; i++) {
|
|
|
|
if (!virBitmapIsSet(*bitmap, i)) {
|
|
|
|
ignore_value(virBitmapSetBit(*bitmap, i));
|
|
|
|
ret++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
virSkipSpaces(&cur);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (*cur == ',') {
|
|
|
|
cur++;
|
|
|
|
virSkipSpaces(&cur);
|
|
|
|
neg = false;
|
2012-10-17 09:23:12 +00:00
|
|
|
} else if (*cur == 0 || *cur == sep) {
|
2012-09-14 07:46:57 +00:00
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
goto parse_error;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
parse_error:
|
|
|
|
virBitmapFree(*bitmap);
|
|
|
|
*bitmap = NULL;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapNewCopy:
|
|
|
|
* @src: the source bitmap.
|
|
|
|
*
|
|
|
|
* Makes a copy of bitmap @src.
|
|
|
|
*
|
|
|
|
* returns the copied bitmap on success, or NULL otherwise. Caller
|
|
|
|
* should call virBitmapFree to free the returned bitmap.
|
|
|
|
*/
|
|
|
|
virBitmapPtr virBitmapNewCopy(virBitmapPtr src)
|
|
|
|
{
|
|
|
|
virBitmapPtr dst;
|
|
|
|
|
|
|
|
if ((dst = virBitmapNew(src->max_bit)) == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (virBitmapCopy(dst, src) != 0) {
|
|
|
|
virBitmapFree(dst);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapNewData:
|
|
|
|
* @data: the data
|
|
|
|
* @len: length of @data in bytes
|
|
|
|
*
|
|
|
|
* Allocate a bitmap from a chunk of data containing bits
|
|
|
|
* information
|
|
|
|
*
|
|
|
|
* Returns a pointer to the allocated bitmap or NULL if
|
|
|
|
* memory cannot be allocated.
|
|
|
|
*/
|
|
|
|
virBitmapPtr virBitmapNewData(void *data, int len)
|
|
|
|
{
|
|
|
|
virBitmapPtr bitmap;
|
2012-09-18 19:53:15 +00:00
|
|
|
int i, j;
|
|
|
|
unsigned long *p;
|
|
|
|
unsigned char *bytes = data;
|
2012-09-14 07:46:57 +00:00
|
|
|
|
|
|
|
bitmap = virBitmapNew(len * CHAR_BIT);
|
|
|
|
if (!bitmap)
|
|
|
|
return NULL;
|
|
|
|
|
2012-09-18 19:53:15 +00:00
|
|
|
/* le64toh is not provided by gnulib, so we do the conversion by hand */
|
|
|
|
p = bitmap->map;
|
|
|
|
for (i = j = 0; i < len; i++, j++) {
|
|
|
|
if (j == sizeof(*p)) {
|
|
|
|
j = 0;
|
|
|
|
p++;
|
|
|
|
}
|
2012-09-18 23:20:03 +00:00
|
|
|
*p |= (unsigned long) bytes[i] << (j * CHAR_BIT);
|
2012-09-18 19:53:15 +00:00
|
|
|
}
|
2012-09-14 07:46:57 +00:00
|
|
|
|
|
|
|
return bitmap;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapToData:
|
|
|
|
* @data: the data
|
|
|
|
* @len: len of @data in byte
|
|
|
|
*
|
|
|
|
* Convert a bitmap to a chunk of data containing bits information.
|
|
|
|
* Data consists of sequential bytes, with lower bytes containing
|
|
|
|
* lower bits.
|
|
|
|
*
|
|
|
|
* Returns 0 on success, -1 otherwise.
|
|
|
|
*/
|
|
|
|
int virBitmapToData(virBitmapPtr bitmap, unsigned char **data, int *dataLen)
|
|
|
|
{
|
|
|
|
int len;
|
|
|
|
unsigned long *l;
|
2012-09-18 19:53:15 +00:00
|
|
|
int i, j;
|
|
|
|
unsigned char *bytes;
|
2012-09-14 07:46:57 +00:00
|
|
|
|
2012-09-18 19:53:15 +00:00
|
|
|
len = (bitmap->max_bit + CHAR_BIT - 1) / CHAR_BIT;
|
2012-09-14 07:46:57 +00:00
|
|
|
|
|
|
|
if (VIR_ALLOC_N(*data, len) < 0)
|
|
|
|
return -1;
|
|
|
|
|
2012-09-18 19:53:15 +00:00
|
|
|
bytes = *data;
|
2012-09-14 07:46:57 +00:00
|
|
|
*dataLen = len;
|
|
|
|
|
2012-09-18 19:53:15 +00:00
|
|
|
/* htole64 is not provided by gnulib, so we do the conversion by hand */
|
|
|
|
l = bitmap->map;
|
|
|
|
for (i = j = 0; i < len; i++, j++) {
|
|
|
|
if (j == sizeof(*l)) {
|
|
|
|
j = 0;
|
|
|
|
l++;
|
|
|
|
}
|
|
|
|
bytes[i] = *l >> (j * CHAR_BIT);
|
|
|
|
}
|
2012-09-14 07:46:57 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapEqual:
|
|
|
|
* @b1: bitmap 1
|
|
|
|
* @b2: bitmap 2
|
|
|
|
*
|
|
|
|
* Compares two bitmaps, whose lengths can be different from each other.
|
|
|
|
*
|
|
|
|
* Returns true if two bitmaps have exactly the same set of bits set,
|
|
|
|
* otherwise false.
|
|
|
|
*/
|
|
|
|
bool virBitmapEqual(virBitmapPtr b1, virBitmapPtr b2)
|
|
|
|
{
|
|
|
|
virBitmapPtr tmp;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (b1->max_bit > b2->max_bit) {
|
|
|
|
tmp = b1;
|
|
|
|
b1 = b2;
|
|
|
|
b2 = tmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now b1 is the smaller one, if not equal */
|
|
|
|
|
|
|
|
for (i = 0; i < b1->map_len; i++) {
|
|
|
|
if (b1->map[i] != b2->map[i])
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (; i < b2->map_len; i++) {
|
|
|
|
if (b2->map[i])
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t virBitmapSize(virBitmapPtr bitmap)
|
|
|
|
{
|
|
|
|
return bitmap->max_bit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapSetAll:
|
|
|
|
* @bitmap: the bitmap
|
|
|
|
*
|
|
|
|
* set all bits in @bitmap.
|
|
|
|
*/
|
|
|
|
void virBitmapSetAll(virBitmapPtr bitmap)
|
|
|
|
{
|
2012-10-25 00:44:27 +00:00
|
|
|
int tail = bitmap->max_bit % VIR_BITMAP_BITS_PER_UNIT;
|
|
|
|
|
2012-09-14 07:46:57 +00:00
|
|
|
memset(bitmap->map, 0xff,
|
|
|
|
bitmap->map_len * (VIR_BITMAP_BITS_PER_UNIT / CHAR_BIT));
|
2012-10-25 00:44:27 +00:00
|
|
|
|
|
|
|
/* Ensure tail bits are clear. */
|
|
|
|
if (tail)
|
|
|
|
bitmap->map[bitmap->map_len - 1] &=
|
|
|
|
-1UL >> (VIR_BITMAP_BITS_PER_UNIT - tail);
|
2012-09-14 07:46:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapClearAll:
|
|
|
|
* @bitmap: the bitmap
|
|
|
|
*
|
|
|
|
* clear all bits in @bitmap.
|
|
|
|
*/
|
|
|
|
void virBitmapClearAll(virBitmapPtr bitmap)
|
|
|
|
{
|
|
|
|
memset(bitmap->map, 0,
|
|
|
|
bitmap->map_len * (VIR_BITMAP_BITS_PER_UNIT / CHAR_BIT));
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapIsAllSet:
|
|
|
|
* @bitmap: the bitmap to check
|
|
|
|
*
|
|
|
|
* check if all bits in @bitmap are set.
|
|
|
|
*/
|
|
|
|
bool virBitmapIsAllSet(virBitmapPtr bitmap)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int unusedBits;
|
|
|
|
size_t sz;
|
|
|
|
|
|
|
|
unusedBits = bitmap->map_len * VIR_BITMAP_BITS_PER_UNIT - bitmap->max_bit;
|
|
|
|
|
|
|
|
sz = bitmap->map_len;
|
|
|
|
if (unusedBits > 0)
|
|
|
|
sz--;
|
|
|
|
|
|
|
|
for (i = 0; i < sz; i++)
|
|
|
|
if (bitmap->map[i] != -1)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (unusedBits > 0) {
|
2012-11-28 06:15:38 +00:00
|
|
|
if ((bitmap->map[sz] & ((1UL << (VIR_BITMAP_BITS_PER_UNIT - unusedBits)) - 1))
|
|
|
|
!= ((1UL << (VIR_BITMAP_BITS_PER_UNIT - unusedBits)) - 1))
|
2012-09-14 07:46:57 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* virBitmapNextSetBit:
|
|
|
|
* @bitmap: the bitmap
|
|
|
|
* @pos: the position after which to search for a set bit
|
|
|
|
*
|
|
|
|
* search the first set bit after position @pos in bitmap @bitmap.
|
|
|
|
* @pos can be -1 to search for the first set bit. Position starts
|
|
|
|
* at 0.
|
|
|
|
*
|
|
|
|
* returns the position of the found bit, or -1 if no bit found.
|
|
|
|
*/
|
2012-10-25 00:44:27 +00:00
|
|
|
ssize_t virBitmapNextSetBit(virBitmapPtr bitmap, ssize_t pos)
|
2012-09-14 07:46:57 +00:00
|
|
|
{
|
2012-10-25 00:44:27 +00:00
|
|
|
size_t nl;
|
|
|
|
size_t nb;
|
2012-09-14 07:46:57 +00:00
|
|
|
unsigned long bits;
|
|
|
|
|
|
|
|
if (pos < 0)
|
|
|
|
pos = -1;
|
|
|
|
|
|
|
|
pos++;
|
|
|
|
|
|
|
|
if (pos >= bitmap->max_bit)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
nl = pos / VIR_BITMAP_BITS_PER_UNIT;
|
|
|
|
nb = pos % VIR_BITMAP_BITS_PER_UNIT;
|
|
|
|
|
|
|
|
bits = bitmap->map[nl] & ~((1UL << nb) - 1);
|
|
|
|
|
|
|
|
while (bits == 0 && ++nl < bitmap->map_len) {
|
|
|
|
bits = bitmap->map[nl];
|
|
|
|
}
|
|
|
|
|
|
|
|
if (bits == 0)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
return ffsl(bits) - 1 + nl * VIR_BITMAP_BITS_PER_UNIT;
|
|
|
|
}
|
2012-10-25 00:44:27 +00:00
|
|
|
|
|
|
|
/* Return the number of bits currently set in the map. */
|
|
|
|
size_t
|
|
|
|
virBitmapCountBits(virBitmapPtr bitmap)
|
|
|
|
{
|
|
|
|
size_t i;
|
|
|
|
size_t ret = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < bitmap->map_len; i++)
|
|
|
|
ret += count_one_bits_l(bitmap->map[i]);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|