bitops.h

Go to the documentation of this file.

 
#pragma once
 
#define bit_set(V, B)              ((V) | (1U << (B)))                                   
#define bit_clear(V, B)            ((V) & ~(1U << (B)))                                  
#define bit_flip(V, B)             ((V) ^ (1U << (B)))                                   
#define bit_check(V, B)            ((V) & (1U << (B)))                                   
#define bit_toggle(V, B, C)        ((C) ? bit_set(V, B) : bit_clear(V, B))               
#define bit_set_assign(V, B)       ((V) |= (1U << (B)))                                  
#define bit_clear_assign(V, B)     ((V) &= ~(1U << (B)))                                 
#define bit_flip_assign(V, B)      ((V) ^= (1U << (B)))                                  
#define bit_toggle_assign(V, B, C) ((C) ? bit_set_assign(V, B) : bit_clear_assign(V, B)) 
 
#define bitmask_set(V, M)          ((V) | (M))          
#define bitmask_clear(V, M)        ((V) & ~(M))         
#define bitmask_flip(V, M)         ((V) ^ (M))          
#define bitmask_check(V, M)        ((V) & (M))          
#define bitmask_exact(V, M)        (((V) & (M)) == (M)) 
#define bitmask_set_assign(V, M)   ((V) |= (M))         
#define bitmask_clear_assign(V, M) ((V) &= ~(M))        
#define bitmask_flip_assign(V, M)  ((V) ^= (M))         
 
static inline int find_first_zero(unsigned long value)
{
    for (int i = 0; i < 32; ++i) {
        if (!bit_check(value, i)) {
            return i;
        }
    }
    return 0;
}
 
static inline int find_first_non_zero(unsigned long value)
{
    for (int i = 0; i < 32; ++i) {
        if (bit_check(value, i)) {
            return i;
        }
    }
    return 0;
}