~ubuntu-branches/ubuntu/trusty/bmagic/trusty

<h1>bmdef.h</h1><a href="a00092.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 // Copyright(c) 2002-2009 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)

<a name="l00002"></a>00002 //

<a name="l00003"></a>00003 // BM library internal header

<a name="l00004"></a>00004 //

<a name="l00005"></a>00005 // Set all required preprocessor defines

<a name="l00006"></a>00006

<a name="l00007"></a>00007

<a name="l00008"></a>00008

<a name="l00009"></a>00009 // macro to define/undefine unaligned memory access (x86, PowerPC)

<a name="l00010"></a>00010 //

<a name="l00011"></a>00011 #if defined(__i386) || defined(__x86_64) || defined(__ppc__) || \

<a name="l00012"></a>00012 defined(__ppc64__) || defined(_M_IX86) || defined(_M_AMD64) || \

<a name="l00013"></a>00013 defined(_M_IX86) || defined(_M_AMD64) || defined(_M_X64) || \

<a name="l00014"></a>00014 (defined(_M_MPPC) && !defined(BM_FORBID_UNALIGNED_ACCESS))

<a name="l00015"></a>00015 #define BM_UNALIGNED_ACCESS_OK 1

<a name="l00016"></a>00016 #endif

<a name="l00017"></a>00017

<a name="l00018"></a>00018 #if defined(_M_IX86) || defined(_M_AMD64) || defined(_M_X64) || \

<a name="l00019"></a>00019 defined(__i386) || defined(__x86_64) || defined(_M_AMD64) || \

<a name="l00020"></a>00020 defined(BMSSE2OPT) || defined(BMSSE42OPT)

<a name="l00021"></a><a class="code" href="a00092.html#a3ae54e6a1680218d157ebc7fa486ed78">00021</a> #define BM_x86

<a name="l00022"></a>00022 #endif

<a name="l00023"></a>00023

<a name="l00024"></a>00024

<a name="l00025"></a>00025 // Enable MSVC 8.0 (2005) specific optimization options

<a name="l00026"></a>00026 //

<a name="l00027"></a>00027 #if(_MSC_VER >= 1400)

<a name="l00028"></a>00028

<a name="l00029"></a>00029 # define BM_HASFORCEINLINE

<a name="l00030"></a>00030 # ifndef BMRESTRICT

<a name="l00031"></a>00031 # define BMRESTRICT __restrict

<a name="l00032"></a>00032 # endif

<a name="l00033"></a>00033 #endif

<a name="l00034"></a>00034

<a name="l00035"></a>00035 #ifdef __GNUG__

<a name="l00036"></a>00036

<a name="l00037"></a>00037 # ifndef BMRESTRICT

<a name="l00038"></a>00038 # define BMRESTRICT __restrict__

<a name="l00039"></a>00039 # endif

<a name="l00040"></a>00040

<a name="l00041"></a>00041 # ifdef __OPTIMIZE__

<a name="l00042"></a>00042 # define BM_NOASSERT

<a name="l00043"></a>00043 # endif

<a name="l00044"></a>00044 #endif

<a name="l00045"></a>00045

<a name="l00046"></a>00046 #ifndef BM_ASSERT

<a name="l00047"></a>00047

<a name="l00048"></a>00048 # ifndef BM_NOASSERT

<a name="l00049"></a>00049 # include <cassert>

<a name="l00050"></a><a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">00050</a> # define BM_ASSERT assert

<a name="l00051"></a>00051 # else

<a name="l00052"></a>00052 # ifndef BM_ASSERT

<a name="l00053"></a>00053 # define BM_ASSERT(x)

<a name="l00054"></a>00054 # endif

<a name="l00055"></a>00055 # endif

<a name="l00056"></a>00056

<a name="l00057"></a>00057 #endif

<a name="l00058"></a>00058

<h1>bmconst.h</h1><a href="a00092.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 #ifndef BMCONST__H__INCLUDED__

<a name="l00002"></a>00002 #define BMCONST__H__INCLUDED__

<a name="l00003"></a>00003 /*

<a name="l00005"></a>00005

<a name="l00006"></a>00006 Permission is hereby granted, free of charge, to any person

<a name="l00007"></a>00007 obtaining a copy of this software and associated documentation

<a name="l00008"></a>00008 files (the "Software"), to deal in the Software without restriction,

<a name="l00009"></a>00009 including without limitation the rights to use, copy, modify, merge,

<a name="l00010"></a>00010 publish, distribute, sublicense, and/or sell copies of the Software,

<a name="l00011"></a>00011 and to permit persons to whom the Software is furnished to do so,

<a name="l00012"></a>00012 subject to the following conditions:

<a name="l00013"></a>00013

<a name="l00014"></a>00014 The above copyright notice and this permission notice shall be included

<a name="l00015"></a>00015 in all copies or substantial portions of the Software.

<a name="l00016"></a>00016

<a name="l00017"></a>00017 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,

<a name="l00018"></a>00018 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES

<a name="l00019"></a>00019 OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.

<a name="l00020"></a>00020 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,

<a name="l00021"></a>00021 DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,

<a name="l00022"></a>00022 ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR

<a name="l00023"></a>00023 OTHER DEALINGS IN THE SOFTWARE.

<a name="l00024"></a>00024

<a name="l00025"></a>00025 For more information please visit: http://bmagic.sourceforge.net

<a name="l00026"></a>00026

<a name="l00027"></a>00027 */

<a name="l00028"></a>00028

<a name="l00029"></a>00029 namespace bm

<a name="l00030"></a>00030 {

<a name="l00031"></a>00031

<a name="l00032"></a>00032 #if defined(_WIN32) || defined (_WIN64)

<a name="l00033"></a>00033

<a name="l00034"></a>00034 typedef unsigned __int64 <a class="code" href="a00116.html#a1f6a6dd108cd9e9f4fb284043ef518fe">id64_t</a>;

<a name="l00035"></a>00035

<a name="l00036"></a>00036 #else

<a name="l00037"></a>00037

<a name="l00038"></a><a class="code" href="a00116.html#a1f6a6dd108cd9e9f4fb284043ef518fe">00038</a> typedef unsigned long long <a class="code" href="a00116.html#a1f6a6dd108cd9e9f4fb284043ef518fe">id64_t</a>;

<a name="l00039"></a>00039

<a name="l00040"></a>00040 #endif

<a name="l00041"></a>00041

<a name="l00042"></a><a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">00042</a> typedef unsigned int <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">id_t</a>;

<a name="l00043"></a><a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">00043</a> typedef unsigned int <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">word_t</a>;

<a name="l00044"></a><a class="code" href="a00116.html#ae64960202b691ae1b6efe5fec12cb5af">00044</a> typedef unsigned short <a class="code" href="a00116.html#ae64960202b691ae1b6efe5fec12cb5af">short_t</a>;

<a name="l00045"></a>00045

<a name="l00046"></a>00046

<a name="l00047"></a>00047

<a name="l00048"></a><a class="code" href="a00116.html#a104b924a1df81542db2a6296fbf26a65">00048</a> const unsigned <a class="code" href="a00116.html#a104b924a1df81542db2a6296fbf26a65">id_max</a> = 0xFFFFFFFF;

<a name="l00049"></a>00049

<a name="l00050"></a>00050 // Data Block parameters

<a name="l00051"></a>00051

<a name="l00052"></a><a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">00052</a> const unsigned <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">set_block_size</a> = 2048u;

<a name="l00053"></a><a class="code" href="a00116.html#ad8723fbeea6290d3daa8917ea7ce9bb2">00053</a> const unsigned <a class="code" href="a00116.html#ad8723fbeea6290d3daa8917ea7ce9bb2">set_block_shift</a> = 16u;

<a name="l00054"></a><a class="code" href="a00116.html#a201fb8b1f81b7487f1c1c129fc3d6557">00054</a> const unsigned <a class="code" href="a00116.html#a201fb8b1f81b7487f1c1c129fc3d6557">set_block_mask</a> = 0xFFFFu;

<a name="l00055"></a><a class="code" href="a00116.html#a2d1bf97ae342a7759943e62090fcf5d3">00055</a> const unsigned <a class="code" href="a00116.html#a2d1bf97ae342a7759943e62090fcf5d3">set_blkblk_mask</a> = 0xFFFFFFu;

<a name="l00056"></a>00056

<a name="l00057"></a><a class="code" href="a00116.html#a35780565f6d8f2831ebff8877d3ba662">00057</a> const unsigned <a class="code" href="a00116.html#a35780565f6d8f2831ebff8877d3ba662">set_block_plain_size</a> = <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">set_block_size</a> / 32u;

<a name="l00058"></a><a class="code" href="a00116.html#a3428cf384446982017ba9ee68152d238">00058</a> const unsigned <a class="code" href="a00116.html#a3428cf384446982017ba9ee68152d238">set_block_plain_cnt</a> = sizeof(<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) * 8u;

<a name="l00059"></a>00059

<a name="l00060"></a><a class="code" href="a00092.html#a1365569f85f442c4914a3579f55df99b">00060</a> #define FULL_BLOCK_ADDR bm::all_set<true>::_block._p

<a name="l00061"></a><a class="code" href="a00092.html#a13ba598909515339ceede09e3b9b0198">00061</a> #define IS_VALID_ADDR(addr) (addr && (addr != FULL_BLOCK_ADDR))

<a name="l00062"></a><a class="code" href="a00092.html#a074acb37afea68caaffe3832d326eb44">00062</a> #define IS_FULL_BLOCK(addr) (addr == FULL_BLOCK_ADDR)

<a name="l00063"></a><a class="code" href="a00092.html#accfe8650b3e8ee65da94f7712b3c44b8">00063</a> #define IS_EMPTY_BLOCK(addr) (addr == 0)

<a name="l00064"></a>00064

<a name="l00065"></a>00065 // Macro definitions to manipulate bits in pointers

<a name="l00066"></a>00066 // This trick is based on the fact that pointers allocated by malloc are

<a name="l00067"></a>00067 // aligned and bit 0 is never set. It means we are safe to use it.

<a name="l00068"></a>00068 // BM library keeps GAP flag in pointer.

<a name="l00060"></a>00060 // Word parameters

<a name="l00061"></a>00061

<a name="l00062"></a><a class="code" href="a00116.html#a83d76bccf6fe3770f32d5ba11d2a37ad">00062</a> const unsigned <a class="code" href="a00116.html#a83d76bccf6fe3770f32d5ba11d2a37ad">set_word_shift</a> = 5u;

<a name="l00063"></a><a class="code" href="a00116.html#addbf345be3733d5e4575d71733ed1da8">00063</a> const unsigned <a class="code" href="a00116.html#addbf345be3733d5e4575d71733ed1da8">set_word_mask</a> = 0x1Fu;

<a name="l00064"></a>00064

<a name="l00065"></a>00065

<a name="l00066"></a>00066 // GAP related parameters.

<a name="l00067"></a>00067

<a name="l00068"></a><a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">00068</a> typedef unsigned short <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>;

<a name="l00069"></a>00069

<a name="l00070"></a>00070 // Note: this hack is not universally portable so if it does not work

<a name="l00071"></a>00071 // in some particular case disable it by defining BM_DISBALE_BIT_IN_PTR

<a name="l00072"></a>00072

100

<a name="l00073"></a>00073 #ifdef BM_DISBALE_BIT_IN_PTR

101

<a name="l00074"></a>00074

102

<a name="l00075"></a>00075 # define BMGAP_PTR(ptr) ((bm::gap_word_t*)ptr)

103

<a name="l00076"></a>00076 # define BMSET_PTRGAP(ptr) (void(0))

104

<a name="l00077"></a>00077 # define BM_IS_GAP(obj, ptr, idx) ( (obj).is_block_gap(idx) )

105

<a name="l00078"></a>00078

106

<a name="l00079"></a>00079 #else

107

<a name="l00080"></a>00080

108

<a name="l00081"></a>00081 # if ULONG_MAX != 0xffffffff || defined(_WIN64) // 64-bit

109

<a name="l00082"></a>00082

110

<a name="l00083"></a><a class="code" href="a00092.html#a41d8f6ada221ed5c6f95e9c6c821216a">00083</a> # define BMPTR_SETBIT0(ptr) ( ((bm::id64_t)ptr) | 1 )

111

<a name="l00084"></a><a class="code" href="a00092.html#aa5a3e35b91d48c7c8a8cf24c293f72e4">00084</a> # define BMPTR_CLEARBIT0(ptr) ( ((bm::id64_t)ptr) & ~(bm::id64_t)1 )

112

<a name="l00085"></a><a class="code" href="a00092.html#a11318a64d92080bbf8e2edc7b68e0bc9">00085</a> # define BMPTR_TESTBIT0(ptr) ( ((bm::id64_t)ptr) & 1 )

113

<a name="l00086"></a>00086

114

<a name="l00087"></a>00087 # else // 32-bit

115

<a name="l00088"></a>00088

116

<a name="l00089"></a>00089 # define BMPTR_SETBIT0(ptr) ( ((bm::id_t)ptr) | 1 )

117

<a name="l00090"></a>00090 # define BMPTR_CLEARBIT0(ptr) ( ((bm::id_t)ptr) & ~(bm::id_t)1 )

118

<a name="l00091"></a>00091 # define BMPTR_TESTBIT0(ptr) ( ((bm::id_t)ptr) & 1 )

119

<a name="l00092"></a>00092

120

<a name="l00093"></a>00093 # endif

121

<a name="l00094"></a>00094

122

<a name="l00095"></a><a class="code" href="a00092.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">00095</a> # define BMGAP_PTR(ptr) ((bm::gap_word_t*)BMPTR_CLEARBIT0(ptr))

123

<a name="l00096"></a><a class="code" href="a00092.html#a93dbdb1a62ca0ce33149d3249dbf386e">00096</a> # define BMSET_PTRGAP(ptr) ptr = (bm::word_t*)BMPTR_SETBIT0(ptr)

124

<a name="l00097"></a><a class="code" href="a00092.html#a862d6f92b4de3ddb94fd367a800512eb">00097</a> # define BM_IS_GAP(obj, ptr, idx) ( BMPTR_TESTBIT0(ptr)!=0 )

125

<a name="l00098"></a>00098

126

<a name="l00099"></a>00099 #endif

127

<a name="l00100"></a>00100

128

<a name="l00101"></a>00101

<a name="l00070"></a><a class="code" href="a00116.html#aa5e01dfb650d168f9be0525e042af647">00070</a> const unsigned <a class="code" href="a00116.html#aa5e01dfb650d168f9be0525e042af647">gap_max_buff_len</a> = 1280;

<a name="l00071"></a><a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">00071</a> const unsigned <a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">gap_max_bits</a> = 65536;

<a name="l00072"></a><a class="code" href="a00116.html#a9b1715d6d9164d56172e75bbbd0e3000">00072</a> const unsigned <a class="code" href="a00116.html#a9b1715d6d9164d56172e75bbbd0e3000">gap_equiv_len</a> =

100

<a name="l00073"></a>00073 (sizeof(<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) * <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>) / sizeof(<a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>);

101

<a name="l00074"></a><a class="code" href="a00116.html#a773e9f5341919d58000bd54d50038733">00074</a> const unsigned <a class="code" href="a00116.html#a773e9f5341919d58000bd54d50038733">gap_levels</a> = 4;

102

<a name="l00075"></a><a class="code" href="a00116.html#a13793ad631e2b2fcbaaae9000ea1a924">00075</a> const unsigned <a class="code" href="a00116.html#a13793ad631e2b2fcbaaae9000ea1a924">gap_max_level</a> = <a class="code" href="a00116.html#a773e9f5341919d58000bd54d50038733">bm::gap_levels</a> - 1;

103

<a name="l00076"></a>00076

104

<a name="l00077"></a>00077

105

<a name="l00078"></a>00078 // Block Array parameters

106

<a name="l00079"></a>00079

107

<a name="l00080"></a><a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">00080</a> const unsigned <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">set_array_size</a> = 256u;

108

<a name="l00081"></a><a class="code" href="a00116.html#ac1ff8647a089c751ec330cecee01907e">00081</a> const unsigned <a class="code" href="a00116.html#ac1ff8647a089c751ec330cecee01907e">set_array_shift</a> = 8u;

109

<a name="l00082"></a><a class="code" href="a00116.html#a00ffa7b38d7fcc7e522d864991a6de68">00082</a> const unsigned <a class="code" href="a00116.html#a00ffa7b38d7fcc7e522d864991a6de68">set_array_mask</a> = 0xFFu;

110

<a name="l00083"></a><a class="code" href="a00116.html#a505011007f54598794e0b9477c0b0b11">00083</a> const unsigned <a class="code" href="a00116.html#a505011007f54598794e0b9477c0b0b11">set_total_blocks</a> = (<a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a> * <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>);

111

<a name="l00084"></a>00084

112

<a name="l00085"></a><a class="code" href="a00116.html#ae9916f69ced0347d94472d7944ea0e45">00085</a> const unsigned <a class="code" href="a00116.html#ae9916f69ced0347d94472d7944ea0e45">bits_in_block</a> = <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a> * sizeof(<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) * 8;

113

<a name="l00086"></a><a class="code" href="a00116.html#a4dedd13a7b8a27c5067b20118002f025">00086</a> const unsigned <a class="code" href="a00116.html#a4dedd13a7b8a27c5067b20118002f025">bits_in_array</a> = <a class="code" href="a00116.html#ae9916f69ced0347d94472d7944ea0e45">bm::bits_in_block</a> * <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>;

114

<a name="l00087"></a>00087

115

<a name="l00088"></a>00088

116

<a name="l00089"></a>00089 #ifdef BM64OPT

117

<a name="l00090"></a>00090

118

<a name="l00091"></a>00091 typedef <a class="code" href="a00116.html#a1f6a6dd108cd9e9f4fb284043ef518fe">id64_t</a> <a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">wordop_t</a>;

119

<a name="l00092"></a>00092 const <a class="code" href="a00116.html#a1f6a6dd108cd9e9f4fb284043ef518fe">id64_t</a> <a class="code" href="a00116.html#ad81dea46a256b93b2af3568ce409d40b">all_bits_mask</a> = 0xffffffffffffffff;

120

<a name="l00093"></a>00093

121

<a name="l00094"></a>00094 # define DECLARE_TEMP_BLOCK(x) bm::id64_t x[bm::set_block_size / 2];

122

<a name="l00095"></a>00095 const unsigned <a class="code" href="a00116.html#a7049fd70220fc3a3072e9f82abf4ad66">set_block_size_op</a> = <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a> / 2;

123

<a name="l00096"></a>00096

124

<a name="l00097"></a>00097

125

<a name="l00098"></a>00098 #else

126

<a name="l00099"></a>00099

127

<a name="l00100"></a><a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">00100</a> typedef <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">word_t</a> <a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">wordop_t</a>;

128

<a name="l00101"></a><a class="code" href="a00116.html#ad81dea46a256b93b2af3568ce409d40b">00101</a> const <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">word_t</a> <a class="code" href="a00116.html#ad81dea46a256b93b2af3568ce409d40b">all_bits_mask</a> = 0xffffffff;

129

<a name="l00102"></a>00102

130

<a name="l00103"></a>00103 #ifdef BM_HASRESTRICT

131

<a name="l00104"></a>00104 # ifndef BMRESTRICT

132

<a name="l00105"></a>00105 # define BMRESTRICT restrict

133

<a name="l00106"></a>00106 # endif

134

<a name="l00107"></a>00107 #else

135

<a name="l00108"></a>00108 # ifndef BMRESTRICT

136

<a name="l00109"></a>00109 # define BMRESTRICT

137

<a name="l00110"></a>00110 # endif

138

<a name="l00111"></a>00111 #endif

139

<a name="l00112"></a>00112

140

<a name="l00113"></a>00113

141

<a name="l00114"></a>00114 #ifdef BM_HASFORCEINLINE

142

<a name="l00115"></a>00115 # ifndef BMFORCEINLINE

143

<a name="l00116"></a>00116 # define BMFORCEINLINE __forceinline

144

<a name="l00117"></a>00117 # endif

145

<a name="l00118"></a>00118 #else

146

<a name="l00119"></a><a class="code" href="a00092.html#a938734d014fb68dd8b2251fe8ec2b025">00119</a> # define BMFORCEINLINE inline

147

<a name="l00120"></a>00120 #endif

148

<a name="l00121"></a>00121

149

<a name="l00122"></a>00122

150

<a name="l00123"></a>00123 // --------------------------------

151

<a name="l00124"></a>00124 // SSE optmization

152

<a name="l00125"></a>00125 //

153

<a name="l00126"></a>00126

154

<a name="l00127"></a>00127 #if !(defined(BMSSE2OPT) || defined(BMSSE42OPT))

155

<a name="l00128"></a>00128

156

<a name="l00129"></a>00129 # ifndef BM_SET_MMX_GUARD

157

<a name="l00130"></a>00130 # define BM_SET_MMX_GUARD

158

<a name="l00131"></a>00131 # endif

159

<a name="l00132"></a>00132

160

<a name="l00133"></a>00133 #define BM_ALIGN16

161

<a name="l00134"></a>00134 #define BM_ALIGN16ATTR

162

<a name="l00135"></a>00135

163

<a name="l00136"></a>00136 #else

164

<a name="l00137"></a>00137

165

<a name="l00138"></a>00138 # ifndef BM_SET_MMX_GUARD

166

<a name="l00139"></a><a class="code" href="a00092.html#a7e6f87ba3230dece2125af5c32e84b05">00139</a> # define BM_SET_MMX_GUARD sse_empty_guard bm_mmx_guard_;

167

<a name="l00140"></a>00140 # endif

168

<a name="l00141"></a>00141

169

<a name="l00142"></a>00142 #ifdef _MSC_VER

170

<a name="l00143"></a>00143

171

<a name="l00144"></a>00144 #ifndef BM_ALIGN16

172

<a name="l00145"></a>00145 # define BM_ALIGN16 __declspec(align(16))

173

<a name="l00146"></a>00146 # define BM_ALIGN16ATTR

174

<a name="l00147"></a>00147 #endif

175

<a name="l00148"></a>00148

176

<a name="l00149"></a>00149 # else // GCC

177

<a name="l00150"></a>00150

178

<a name="l00151"></a>00151 #ifndef BM_ALIGN16

179

<a name="l00152"></a>00152 # define BM_ALIGN16

180

<a name="l00153"></a><a class="code" href="a00092.html#a80f4b7d710fa287d77100d211738dd32">00153</a> # define BM_ALIGN16ATTR __attribute__((aligned(16)))

181

<a name="l00154"></a>00154 #endif

182

<a name="l00155"></a>00155

183

<a name="l00156"></a>00156 #endif

184

<a name="l00157"></a>00157

185

<a name="l00158"></a>00158 #endif

186

<a name="l00159"></a>00159

187

<a name="l00160"></a>00160 /*!

188

<a name="l00161"></a>00161 Define calculates number of 1 bits in 32-bit word.

189

<a name="l00162"></a>00162 @ingroup bitfunc

190

<a name="l00163"></a>00163 */

191

<a name="l00164"></a>00164 #ifndef BM_INCWORD_BITCOUNT

192

<a name="l00165"></a>00165

193

<a name="l00166"></a>00166 #ifdef BMSSE42OPT

194

<a name="l00167"></a>00167

195

<a name="l00168"></a><a class="code" href="a00120.html#ga967f6a5264f47d8adb93f6bdf8cdc129">00168</a> # define BM_INCWORD_BITCOUNT(cnt, w) cnt += _mm_popcnt_u32(w);

196

<a name="l00169"></a>00169

197

<a name="l00170"></a>00170 #else

198

<a name="l00171"></a>00171

199

<a name="l00172"></a>00172 # define BM_INCWORD_BITCOUNT(cnt, w) cnt += \

200

<a name="l00173"></a>00173 bm::bit_count_table<true>::_count[(unsigned char)(w)] + \

201

<a name="l00174"></a>00174 bm::bit_count_table<true>::_count[(unsigned char)((w) >> 8)] + \

202

<a name="l00175"></a>00175 bm::bit_count_table<true>::_count[(unsigned char)((w) >> 16)] + \

203

<a name="l00176"></a>00176 bm::bit_count_table<true>::_count[(unsigned char)((w) >> 24)];

204

<a name="l00177"></a>00177

205

<a name="l00178"></a>00178 #endif

206

<a name="l00179"></a>00179

207

<a name="l00180"></a>00180 #endif

208

<a name="l00181"></a>00181

209

<a name="l00182"></a>00182

130

<a name="l00103"></a><a class="code" href="a00092.html#a94f2e413da8e88656200a00e7e9744b9">00103</a> # define DECLARE_TEMP_BLOCK(x) unsigned x[bm::set_block_size];

131

<a name="l00104"></a><a class="code" href="a00116.html#a7049fd70220fc3a3072e9f82abf4ad66">00104</a> const unsigned <a class="code" href="a00116.html#a7049fd70220fc3a3072e9f82abf4ad66">set_block_size_op</a> = <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;

132

<a name="l00105"></a>00105

133

<a name="l00106"></a>00106 #endif

134

<a name="l00107"></a>00107

135

<a name="l00108"></a>00108

136

<a name="l00109"></a>00109

137

<a name="l00110"></a>00110 /*!

138

<a name="l00111"></a>00111 @brief Block allocation strategies.

139

<a name="l00112"></a>00112 @ingroup bvector

140

<a name="l00113"></a>00113 */

141

<a name="l00114"></a><a class="code" href="a00119.html#gad0b87b3b7292383a864d27feaf1c9eff">00114</a> enum <a class="code" href="a00119.html#gad0b87b3b7292383a864d27feaf1c9eff" title="Block allocation strategies.">strategy</a>

142

<a name="l00115"></a>00115 {

143

<a name="l00116"></a><a class="code" href="a00119.html#ggad0b87b3b7292383a864d27feaf1c9effa40920ae0ef7b4411d60463d8f576b5ba">00116</a> <a class="code" href="a00119.html#ggad0b87b3b7292383a864d27feaf1c9effa40920ae0ef7b4411d60463d8f576b5ba" title="No GAP compression strategy. All new blocks are bit blocks.">BM_BIT</a> = 0, //!< No GAP compression strategy. All new blocks are bit blocks.

144

<a name="l00117"></a><a class="code" href="a00119.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c">00117</a> <a class="code" href="a00119.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c" title="GAP compression is ON.">BM_GAP</a> = 1 //!< GAP compression is ON.

145

<a name="l00118"></a>00118 };

146

<a name="l00119"></a>00119

147

<a name="l00120"></a>00120

148

<a name="l00121"></a>00121 /*!

149

<a name="l00122"></a>00122 @brief set representation variants

150

<a name="l00123"></a>00123 @internal

151

<a name="l00124"></a>00124 */

152

<a name="l00125"></a><a class="code" href="a00116.html#a593916a103395805070a3200720c6416">00125</a> enum <a class="code" href="a00116.html#a593916a103395805070a3200720c6416" title="set representation variants">set_representation</a>

153

<a name="l00126"></a>00126 {

154

<a name="l00127"></a><a class="code" href="a00116.html#a593916a103395805070a3200720c6416a11f970b705c57a0572043e5cc5e2e333">00127</a> <a class="code" href="a00116.html#a593916a103395805070a3200720c6416a11f970b705c57a0572043e5cc5e2e333" title="Simple bitset.">set_bitset</a> = 0, //!< Simple bitset

155

<a name="l00128"></a><a class="code" href="a00116.html#a593916a103395805070a3200720c6416a4809f1871df2ba431e5b70d175f050ec">00128</a> <a class="code" href="a00116.html#a593916a103395805070a3200720c6416a4809f1871df2ba431e5b70d175f050ec" title="GAP-RLE compression.">set_gap</a> = 1, //!< GAP-RLE compression

156

<a name="l00129"></a><a class="code" href="a00116.html#a593916a103395805070a3200720c6416a4bd710c312645ed34e4db359a7e59c42">00129</a> <a class="code" href="a00116.html#a593916a103395805070a3200720c6416a4bd710c312645ed34e4db359a7e59c42" title="array of set 1 values">set_array1</a> = 2, //!< array of set 1 values

157

<a name="l00130"></a><a class="code" href="a00116.html#a593916a103395805070a3200720c6416a8d71ac8a4f70b88d2a425d0c1e872fa2">00130</a> <a class="code" href="a00116.html#a593916a103395805070a3200720c6416a8d71ac8a4f70b88d2a425d0c1e872fa2" title="array of 0 values">set_array0</a> = 3 //!< array of 0 values

158

<a name="l00131"></a>00131 };

159

<a name="l00132"></a>00132

160

<a name="l00133"></a><a class="code" href="a00053.html">00133</a> template<bool T> struct <a class="code" href="a00053.html">DeBruijn_bit_position</a>

161

<a name="l00134"></a>00134 {

162

<a name="l00135"></a><a class="code" href="a00053.html#aaf8d9a0b19ec4d44662475343cf31fdf">00135</a> static const unsigned <a class="code" href="a00053.html#aaf8d9a0b19ec4d44662475343cf31fdf">_multiply</a>[32];

163

<a name="l00136"></a>00136 };

164

<a name="l00137"></a>00137

165

<a name="l00138"></a>00138 template<bool T>

166

<a name="l00139"></a>00139 const unsigned <a class="code" href="a00053.html">DeBruijn_bit_position<T>::_multiply</a>[32] = {

167

<a name="l00140"></a>00140 0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,

168

<a name="l00141"></a>00141 31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9

169

<a name="l00142"></a>00142 };

170

<a name="l00143"></a>00143

171

<a name="l00144"></a>00144 /** Structure keeps index of first right 1 bit for every byte.

172

<a name="l00145"></a>00145 @ingroup bitfunc

173

<a name="l00146"></a>00146 */

174

<a name="l00147"></a><a class="code" href="a00064.html">00147</a> template<bool T> struct <a class="code" href="a00064.html" title="Structure keeps index of first right 1 bit for every byte.">first_bit_table</a>

175

<a name="l00148"></a>00148 {

176

<a name="l00149"></a><a class="code" href="a00064.html#ab40e3234d06d1fadbd82ea00e59d17d7">00149</a> static const char <a class="code" href="a00064.html#ab40e3234d06d1fadbd82ea00e59d17d7">_idx</a>[256];

177

<a name="l00150"></a>00150 };

178

<a name="l00151"></a>00151

179

<a name="l00152"></a>00152 template<bool T>

180

<a name="l00153"></a>00153 const char <a class="code" href="a00064.html" title="Structure keeps index of first right 1 bit for every byte.">first_bit_table<T>::_idx</a>[256] = {

181

<a name="l00154"></a>00154 -1, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3,

182

<a name="l00155"></a>00155 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,

183

<a name="l00156"></a>00156 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,

184

<a name="l00157"></a>00157 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,

185

<a name="l00158"></a>00158 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,

186

<a name="l00159"></a>00159 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,

187

<a name="l00160"></a>00160 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,

188

<a name="l00161"></a>00161 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,

189

<a name="l00162"></a>00162 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,

190

<a name="l00163"></a>00163 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,

191

<a name="l00164"></a>00164 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,

192

<a name="l00165"></a>00165 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,

193

<a name="l00166"></a>00166 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,

194

<a name="l00167"></a>00167 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,

195

<a name="l00168"></a>00168 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,

196

<a name="l00169"></a>00169 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,

197

<a name="l00170"></a>00170 };

198

<a name="l00171"></a>00171

199

<a name="l00172"></a>00172 //---------------------------------------------------------------------

200

<a name="l00173"></a>00173

201

<a name="l00174"></a>00174 /** Structure to aid in counting bits

202

<a name="l00175"></a>00175 table contains count of bits in 0-255 diapason of numbers

203

<a name="l00176"></a>00176

204

<a name="l00177"></a>00177 @ingroup bitfunc

205

<a name="l00178"></a>00178 */

206

<a name="l00179"></a><a class="code" href="a00023.html">00179</a> template<bool T> struct <a class="code" href="a00023.html" title="Structure to aid in counting bits table contains count of bits in 0-255 diapason...">bit_count_table</a>

207

<a name="l00180"></a>00180 {

208

<a name="l00181"></a><a class="code" href="a00023.html#aeeb872f5ae25ea7f7977decb8fa42296">00181</a> static const unsigned char <a class="code" href="a00023.html#aeeb872f5ae25ea7f7977decb8fa42296">_count</a>[256];

209

<a name="l00182"></a>00182 };

210

<a name="l00183"></a>00183

211

<a name="l00184"></a>00184 template<bool T>

212

<a name="l00185"></a>00185 const unsigned char <a class="code" href="a00023.html" title="Structure to aid in counting bits table contains count of bits in 0-255 diapason...">bit_count_table<T>::_count</a>[256] = {

213

<a name="l00186"></a>00186 0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,

214

<a name="l00187"></a>00187 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,

215

<a name="l00188"></a>00188 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,

216

<a name="l00189"></a>00189 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,

217

<a name="l00190"></a>00190 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,

218

<a name="l00191"></a>00191 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,

219

<a name="l00192"></a>00192 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,

220

<a name="l00193"></a>00193 3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8

221

<a name="l00194"></a>00194 };

222

<a name="l00195"></a>00195

223

<a name="l00196"></a>00196

224

<a name="l00197"></a>00197 } // namespace

225

<a name="l00198"></a>00198

226

<a name="l00199"></a>00199 #endif

227

<a name="l00200"></a>00200

210

228

</pre></div></div>

211

<hr size="1"/><address style="text-align: right;">Generated on Fri Jan 8 20:09:19 2010 for BitMagic by

229

<hr size="1"/><address style="text-align: right;">Generated on Tue Mar 23 20:47:54 2010 for BitMagic by

212

230

213

231

214

232

</body>

Older »