File: bitarray.h

package info (click to toggle)
indigo 1.4.3-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 48,936 kB
  • sloc: ansic: 332,816; cpp: 169,470; python: 20,033; java: 13,701; cs: 9,979; asm: 8,475; sql: 6,743; xml: 6,354; javascript: 1,245; sh: 555; php: 506; makefile: 54
file content (70 lines) | stat: -rw-r--r-- 2,815 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/****************************************************************************
 * Copyright (C) from 2009 to Present EPAM Systems.
 *
 * This file is part of Indigo toolkit.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 ***************************************************************************/

#ifndef __bitarray_h__
#define __bitarray_h__

#ifdef __cplusplus
extern "C"
{
#endif

#include "base_c/defs.h"

    DLLEXPORT int bitGetBit(const void* bitarray, int bitno);
    DLLEXPORT void bitSetBit(void* bitarray, int bitno, int value);
    DLLEXPORT void bitFlipBit(void* bitarray, int bitno);
    DLLEXPORT int bitTestEquality(const void* bits1, const void* bits2, int nbits);
    DLLEXPORT int bitTestEquality_Array(const void* bits, const void* bitarray, int array_start, int nbits);
    DLLEXPORT int bitTestEqualityByMask(const void* bits1, const void* bits2, const void* bitMask, int nbits);

    // res = a & (b ^ ~c)
    DLLEXPORT int bitGetAandBxorNotC(const void* a, const void* b, const void* c, void* res, int nbits);
    // Get number of ones
    DLLEXPORT int bitGetOnesCountByte(byte value);
    DLLEXPORT int bitGetOnesCountQword(qword value);
    DLLEXPORT int bitGetOnesCountDword(dword value);
    DLLEXPORT int bitGetOnesCount(const byte* data, int size);
    // Get high-order 1-bit in byte
    DLLEXPORT int bitGetOneHOIndex(byte value);
    // Get low-order 1-bit in byte
    DLLEXPORT int bitGetOneLOIndex(byte value);

    DLLEXPORT int bitGetSize(int nbits);

    DLLEXPORT int bitTestOnes(const byte* pattern, const byte* candidate, int n_bytes);
    DLLEXPORT int bitIdecticalBits(const byte* bit1, const byte* bit2, int n_bytes);
    DLLEXPORT int bitCommonOnes(const byte* bit1, const byte* bit2, int n_bytes);
    DLLEXPORT int bitUniqueOnes(const byte* bit1, const byte* bit2, int n_bytes);

    DLLEXPORT int bitDifferentOnes(const byte* bit1, const byte* bit2, int n_bytes);
    DLLEXPORT int bitUnionOnes(const byte* bit1, const byte* bit2, int n_bytes);

    DLLEXPORT void bitAnd(byte* a, const byte* b, int n_bytes);
    DLLEXPORT void bitOr(byte* a, const byte* b, int nbytes);

    // Check whether bit array is zero
    DLLEXPORT int bitIsAllZero(const void* bits, int nbytes);

    DLLEXPORT int bitLog2Dword(dword input);

#ifdef __cplusplus
}
#endif

#endif