SphinxBase  0.6
include/sphinxbase/bitvec.h
Go to the documentation of this file.
00001 /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
00002 /* ====================================================================
00003  * Copyright (c) 1999-2004 Carnegie Mellon University.  All rights
00004  * reserved.
00005  *
00006  * Redistribution and use in source and binary forms, with or without
00007  * modification, are permitted provided that the following conditions
00008  * are met:
00009  *
00010  * 1. Redistributions of source code must retain the above copyright
00011  *    notice, this list of conditions and the following disclaimer. 
00012  *
00013  * 2. Redistributions in binary form must reproduce the above copyright
00014  *    notice, this list of conditions and the following disclaimer in
00015  *    the documentation and/or other materials provided with the
00016  *    distribution.
00017  *
00018  * This work was supported in part by funding from the Defense Advanced 
00019  * Research Projects Agency and the National Science Foundation of the 
00020  * United States of America, and the CMU Sphinx Speech Consortium.
00021  *
00022  * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND 
00023  * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
00024  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00025  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
00026  * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
00027  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
00028  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 
00029  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
00030  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
00031  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
00032  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00033  *
00034  * ====================================================================
00035  *
00036  */
00037 
00038 #ifndef _LIBUTIL_BITVEC_H_
00039 #define _LIBUTIL_BITVEC_H_
00040 
00041 #include <string.h>
00042 
00043 /* Win32/WinCE DLL gunk */
00044 #include <sphinxbase/sphinxbase_export.h>
00045 
00046 #include <sphinxbase/prim_type.h>
00047 #include <sphinxbase/ckd_alloc.h>
00048 
00056 #ifdef __cplusplus
00057 extern "C" {
00058 #endif
00059 #if 0
00060 /* Fool Emacs. */
00061 }
00062 #endif
00063 
00064 #define BITVEC_BITS 32
00065 typedef uint32 bitvec_t;
00066 
00070 #define bitvec_size(n)          (((n)+BITVEC_BITS-1)/BITVEC_BITS)
00071 
00075 #define bitvec_alloc(n)         ckd_calloc(bitvec_size(n), sizeof(bitvec_t))
00076 
00080 #define bitvec_realloc(v,n)     ckd_realloc(v, bitvec_size(n) * sizeof(bitvec_t))
00081 
00085 #define bitvec_free(v)          ckd_free(v)
00086 
00093 #define bitvec_set(v,b)         (v[(b)/BITVEC_BITS] |= (1UL << ((b) & (BITVEC_BITS-1))))
00094 
00101 #define bitvec_set_all(v,n)     memset(v, (bitvec_t)-1, \
00102                                        (((n)+BITVEC_BITS-1)/BITVEC_BITS) * \
00103                                        sizeof(bitvec_t))
00104 
00110 #define bitvec_clear(v,b)       (v[(b)/BITVEC_BITS] &= ~(1UL << ((b) & (BITVEC_BITS-1))))
00111 
00118 #define bitvec_clear_all(v,n)   memset(v, 0, (((n)+BITVEC_BITS-1)/BITVEC_BITS) * \
00119                                        sizeof(bitvec_t))
00120 
00127 #define bitvec_is_set(v,b)      (v[(b)/BITVEC_BITS] & (1UL << ((b) & (BITVEC_BITS-1))))
00128 
00135 #define bitvec_is_clear(v,b)    (! (bitvec_is_set(v,b)))
00136 
00137 
00145 SPHINXBASE_EXPORT
00146 size_t bitvec_count_set(bitvec_t *vec,  /* In: Bit vector to search */
00147                         size_t len);    /* In: Lenght of above bit vector */
00148 
00149 #ifdef __cplusplus
00150 }
00151 #endif
00152 
00153 #endif