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 /* Win32/WinCE DLL gunk */ 00042 #include <sphinxbase_export.h> 00043 00044 #include <sphinx_config.h> 00045 #include <prim_type.h> 00046 #include <ckd_alloc.h> 00047 00055 #ifdef __cplusplus 00056 extern "C" { 00057 #endif 00058 #if 0 00059 /* Fool Emacs. */ 00060 } 00061 #endif 00062 00063 #define BITVEC_BITS 32 00064 typedef uint32 bitvec_t; 00065 00069 #define bitvec_size(n) (((n)+BITVEC_BITS-1)/BITVEC_BITS) 00070 00074 #define bitvec_alloc(n) ckd_calloc(bitvec_size(n), sizeof(bitvec_t)) 00075 00079 #define bitvec_realloc(v,n) ckd_realloc(v, bitvec_size(n) * sizeof(bitvec_t)) 00080 00084 #define bitvec_free(v) ckd_free(v) 00085 00092 #define bitvec_set(v,b) (v[(b)/BITVEC_BITS] |= (1UL << ((b) & (BITVEC_BITS-1)))) 00093 00100 #define bitvec_clear(v,b) (v[(b)/BITVEC_BITS] &= ~(1UL << ((b) & (BITVEC_BITS-1)))) 00101 00108 #define bitvec_clear_all(v,n) memset(v, 0, (((n)+BITVEC_BITS-1)/BITVEC_BITS) * \ 00109 sizeof(bitvec_t)) 00110 00117 #define bitvec_is_set(v,b) (v[(b)/BITVEC_BITS] & (1UL << ((b) & (BITVEC_BITS-1)))) 00118 00125 #define bitvec_is_clear(v,b) (! (bitvec_is_set(v,b))) 00126 00127 00135 SPHINXBASE_EXPORT 00136 size_t bitvec_count_set(bitvec_t *vec, /* In: Bit vector to search */ 00137 size_t len); /* In: Lenght of above bit vector */ 00138 00139 #ifdef __cplusplus 00140 } 00141 #endif 00142 00143 #endif