2022-02-11 09:07:11 +11:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
|
* Copyright 2012 by Nicholas Bishop. All rights reserved. */
|
2018-12-15 11:47:24 +03:00
|
|
|
|
2019-02-18 08:08:12 +11:00
|
|
|
/** \file
|
|
|
|
|
* \ingroup bli
|
2018-12-15 11:47:24 +03:00
|
|
|
*
|
2020-07-02 12:58:25 +10:00
|
|
|
* Utility functions for variable size bit-masks.
|
2018-12-15 11:47:24 +03:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <limits.h>
|
2020-03-19 09:33:03 +01:00
|
|
|
#include <string.h>
|
2018-12-15 11:47:24 +03:00
|
|
|
|
|
|
|
|
#include "BLI_bitmap.h"
|
2020-03-19 09:33:03 +01:00
|
|
|
#include "BLI_utildefines.h"
|
2018-12-15 11:47:24 +03:00
|
|
|
|
|
|
|
|
void BLI_bitmap_set_all(BLI_bitmap *bitmap, bool set, size_t bits)
|
|
|
|
|
{
|
|
|
|
|
memset(bitmap, set ? UCHAR_MAX : 0, BLI_BITMAP_SIZE(bits));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BLI_bitmap_flip_all(BLI_bitmap *bitmap, size_t bits)
|
|
|
|
|
{
|
2022-03-30 17:26:42 +11:00
|
|
|
size_t blocks_num = _BITMAP_NUM_BLOCKS(bits);
|
|
|
|
|
for (size_t i = 0; i < blocks_num; i++) {
|
2018-12-15 11:47:24 +03:00
|
|
|
bitmap[i] ^= ~(BLI_bitmap)0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BLI_bitmap_copy_all(BLI_bitmap *dst, const BLI_bitmap *src, size_t bits)
|
|
|
|
|
{
|
|
|
|
|
memcpy(dst, src, BLI_BITMAP_SIZE(bits));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BLI_bitmap_and_all(BLI_bitmap *dst, const BLI_bitmap *src, size_t bits)
|
|
|
|
|
{
|
2022-03-30 17:26:42 +11:00
|
|
|
size_t blocks_num = _BITMAP_NUM_BLOCKS(bits);
|
|
|
|
|
for (size_t i = 0; i < blocks_num; i++) {
|
2018-12-15 11:47:24 +03:00
|
|
|
dst[i] &= src[i];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void BLI_bitmap_or_all(BLI_bitmap *dst, const BLI_bitmap *src, size_t bits)
|
|
|
|
|
{
|
2022-03-30 17:26:42 +11:00
|
|
|
size_t blocks_num = _BITMAP_NUM_BLOCKS(bits);
|
|
|
|
|
for (size_t i = 0; i < blocks_num; i++) {
|
2018-12-15 11:47:24 +03:00
|
|
|
dst[i] |= src[i];
|
|
|
|
|
}
|
|
|
|
|
}
|