bitarr.c
/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 2015 Carnegie Mellon University. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* This work was supported in part by funding from the Defense Advanced
* Research Projects Agency and the National Science Foundation of the
* United States of America, and the CMU Sphinx Speech Consortium.
*
* THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
* ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
* NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* ====================================================================
*
*/
/*
* bitarr.c -- Bit array manipulations implementation.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "sphinxbase/bitarr.h"
#define SIGN_BIT (0x80000000)
static uint8 get_shift(uint8 bit, uint8 length)
{
#ifdef WORDS_BIGENDIAN
return 64 - length - bit;
#else
return bit;
#endif
}
static uint64 read_off(bitarr_address_t address)
{
#if defined(__arm) || defined(__arm__)
uint64 value64;
const uint8 *base_off = (const uint8 *)(address.base) + (address.offset >> 3);
memcpy(&value64, base_off, sizeof(value64));
return value64;
#else
return *(const uint64*)((const uint8 *)(address.base) + (address.offset >> 3));
#endif
}
uint64 bitarr_read_int57(bitarr_address_t address, uint8 length, uint64 mask)
{
return (read_off(address) >> get_shift(address.offset & 7, length)) & mask;
}
void bitarr_write_int57(bitarr_address_t address, uint8 length, uint64 value)
{
#if defined(__arm) || defined(__arm__)
uint64 value64;
uint8 *base_off = (uint8 *)(address.base) + (address.offset >> 3);
memcpy(&value64, base_off, sizeof(value64));
value64 |= (value << get_shift(address.offset & 7, length));
memcpy(base_off, &value64, sizeof(value64));
#else
*(uint64 *)((uint8 *)(address.base) + (address.offset >> 3)) |= (value << get_shift(address.offset & 7, length));
#endif
}
uint32 bitarr_read_int25(bitarr_address_t address, uint8 length, uint32 mask)
{
#if defined(__arm) || defined(__arm__)
uint32 value32;
const uint8 *base_off = (const uint8*)(address.base) + (address.offset >> 3);
memcpy(&value32, base_off, sizeof(value32));
return (value32 >> get_shift(address.offset & 7, length)) & mask;
#else
return (*(const uint32*)((const uint8*)(address.base) + (address.offset >> 3)) >> get_shift(address.offset & 7, length)) & mask;
#endif
}
void bitarr_write_int25(bitarr_address_t address, uint8 length, uint32 value)
{
#if defined(__arm) || defined(__arm__)
uint32 value32;
uint8 *base_off = (uint8 *)(address.base) + (address.offset >> 3);
memcpy(&value32, base_off, sizeof(value32));
value32 |= (value << get_shift(address.offset & 7, length));
memcpy(base_off, &value32, sizeof(value32));
#else
*(uint32 *)((uint8 *)(address.base) + (address.offset >> 3)) |= (value << get_shift(address.offset & 7, length));
#endif
}
void bitarr_mask_from_max(bitarr_mask_t *bit_mask, uint32 max_value)
{
bit_mask->bits = bitarr_required_bits(max_value);
bit_mask->mask = (uint32)((1ULL << bit_mask->bits) - 1);
}
uint8 bitarr_required_bits(uint32 max_value)
{
uint8 res;
if (!max_value) return 0;
res = 1;
while (max_value >>= 1) res++;
return res;
}
bitarr.h
An implementation bit array - memory efficient storage for digit int and float data.
bitarr_address_t
struct bitarr_address_s bitarr_address_t
Structure that stores address of certain value in bit array.
bitarr_write_int57
SPHINXBASE_EXPORT void bitarr_write_int57(bitarr_address_t address, uint8 length, uint64 value)
Write specified value into bit array.
Definition bitarr.c:87
bitarr_required_bits
SPHINXBASE_EXPORT uint8 bitarr_required_bits(uint32 max_value)
Computes amount of bits required ti store integers upto value provided.
Definition bitarr.c:131
bitarr_read_int57
SPHINXBASE_EXPORT uint64 bitarr_read_int57(bitarr_address_t address, uint8 length, uint64 mask)
Read uint64 value from bit array.
Definition bitarr.c:82
bitarr_read_int25
SPHINXBASE_EXPORT uint32 bitarr_read_int25(bitarr_address_t address, uint8 length, uint32 mask)
Read uint32 value from bit array.
Definition bitarr.c:100
bitarr_mask_t
struct bitarr_mask_s bitarr_mask_t
Structure that specifies bits required to efficiently store certain data.
bitarr_write_int25
SPHINXBASE_EXPORT void bitarr_write_int25(bitarr_address_t address, uint8 length, uint32 value)
Write specified value into bit array.
Definition bitarr.c:112
bitarr_mask_from_max
SPHINXBASE_EXPORT void bitarr_mask_from_max(bitarr_mask_t *bit_mask, uint32 max_value)
Fills mask for certain int range according to provided max value.
Definition bitarr.c:125