fdo-mirrors/mesa
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/mesa/mesa.git synced 2026-05-05 22:38:05 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

gallium/util: add some const qualifiers in u_bitmask.c

Browse source 
And add/update comments.

Reviewed-by: Timothy Arceri <tarceri@itsqueeze.com>
Reviewed-by: Jose Fonseca <jfonseca@vmware.com>
This commit is contained in:
Brian Paul 2019-03-05 10:06:43 -07:00
parent b5a3a90c0c
commit ac6b33a50d
1 changed files with 10 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
src/gallium/auxiliary/util/u_bitmask.c
View file

@ -90,7 +90,7 @@ static inline boolean
util_bitmask_resize(struct util_bitmask *bm,
unsigned minimum_index)
{
unsigned minimum_size = minimum_index + 1;
const unsigned minimum_size = minimum_index + 1;
unsigned new_size;
util_bitmask_word *new_words;
@ -131,7 +131,7 @@ util_bitmask_resize(struct util_bitmask *bm,
/**
* Lazily update the filled.
* Check if we can increment the filled counter.
*/
static inline void
util_bitmask_filled_set(struct util_bitmask *bm,
@ -146,6 +146,10 @@ util_bitmask_filled_set(struct util_bitmask *bm,
}
}
/**
* Check if we need to decrement the filled counter.
*/
static inline void
util_bitmask_filled_unset(struct util_bitmask *bm,
unsigned index)
@ -167,7 +171,7 @@ util_bitmask_add(struct util_bitmask *bm)
assert(bm);
/* linear search for an empty index */
/* linear search for an empty index, starting at filled position */
word = bm->filled / UTIL_BITMASK_BITS_PER_WORD;
bit = bm->filled % UTIL_BITMASK_BITS_PER_WORD;
mask = 1 << bit;
@ -249,9 +253,9 @@ boolean
util_bitmask_get(struct util_bitmask *bm,
unsigned index)
{
unsigned word = index / UTIL_BITMASK_BITS_PER_WORD;
unsigned bit = index % UTIL_BITMASK_BITS_PER_WORD;
util_bitmask_word mask = 1 << bit;
const unsigned word = index / UTIL_BITMASK_BITS_PER_WORD;
const unsigned bit = index % UTIL_BITMASK_BITS_PER_WORD;
const util_bitmask_word mask = 1 << bit;
assert(bm);