SphinxBase 0.6
|
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 * bitvec.c -- Bit vector type. 00039 * 00040 * ********************************************** 00041 * CMU ARPA Speech Project 00042 * 00043 * Copyright (c) 1999 Carnegie Mellon University. 00044 * ALL RIGHTS RESERVED. 00045 * ********************************************** 00046 * 00047 * HISTORY 00048 * $Log: bitvec.c,v $ 00049 * Revision 1.4 2005/06/22 02:58:22 arthchan2003 00050 * Added keyword 00051 * 00052 * Revision 1.3 2005/03/30 01:22:48 archan 00053 * Fixed mistakes in last updates. Add 00054 * 00055 * 00056 * 05-Mar-1999 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon 00057 * Started. 00058 */ 00059 00060 00061 #include "sphinxbase/bitvec.h" 00062 00063 bitvec_t * 00064 bitvec_realloc(bitvec_t *vec, 00065 size_t old_len, 00066 size_t new_len) 00067 { 00068 bitvec_t *new_vec; 00069 size_t old_size = bitvec_size(old_len); 00070 size_t new_size = bitvec_size(new_len); 00071 00072 new_vec = ckd_realloc(vec, new_size * sizeof(bitvec_t)); 00073 if (new_size > old_size) 00074 memset(new_vec + old_size, 0, (new_size - old_size) * sizeof(bitvec_t)); 00075 00076 return new_vec; 00077 } 00078 00079 size_t 00080 bitvec_count_set(bitvec_t *vec, size_t len) 00081 { 00082 size_t words, bits, w, b, n; 00083 bitvec_t *v; 00084 00085 words = len / BITVEC_BITS; 00086 bits = len % BITVEC_BITS; 00087 v = vec; 00088 n = 0; 00089 for (w = 0; w < words; ++w, ++v) { 00090 if (*v == 0) 00091 continue; 00092 for (b = 0; b < BITVEC_BITS; ++b) 00093 if (*v & (1<<b)) 00094 ++n; 00095 } 00096 for (b = 0; b < bits; ++b) 00097 if (*v & (1<<b)) 00098 ++n; 00099 00100 return n; 00101 }