/* Copyright (c) 2001, Stanford University
 * All rights reserved.
 *
 * See the file LICENSE.txt for information on redistributing this software.
 */

/* Bit vector functions */

#ifndef CR_BITS_H
#define CR_BITS_H


#include "cr_compiler.h"


#define CR_MAX_CONTEXTS      512
#define CR_MAX_BITARRAY      (CR_MAX_CONTEXTS / 32) /* 32 contexts per uint */

#ifdef __cplusplus
extern "C" {
#endif

static INLINE void RESET( unsigned int *b, const unsigned int *d )
{
    int j;
    for (j=0;j<CR_MAX_BITARRAY;j++)
        b[j] |= d[j];
}
static INLINE void DIRTY( unsigned int *b, const unsigned int *d )
{
    int j;
    for (j=0;j<CR_MAX_BITARRAY;j++)
        b[j] = d[j];
}
static INLINE void FILLDIRTY( unsigned int *b )
{
    int j;
    for (j=0;j<CR_MAX_BITARRAY;j++)
        b[j] = 0xffffffff;
}
static INLINE void CLEARDIRTY( unsigned int *b, const unsigned int *d )
{
    int j;
    for (j=0;j<CR_MAX_BITARRAY;j++)
        b[j] &= d[j];
}

/* As above, but complement the bits here instead of in the calling code */
static INLINE void CLEARDIRTY2( unsigned int *b, const unsigned int *d )
{
    int j;
    for (j=0;j<CR_MAX_BITARRAY;j++)
        b[j] &= ~d[j];
}

static INLINE int CHECKDIRTY( const unsigned int *b, const unsigned int *d )
{
    int j;

    for (j=0;j<CR_MAX_BITARRAY;j++)
        if (b[j] & d[j])
            return 1;

    return 0;
}

#ifdef __cplusplus
}
#endif


#endif /* CR_BITS_H */