~ubuntu-branches/ubuntu/oneiric/bmagic/oneiric

<h1>bmundef.h</h1><a href="a00102.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 // Copyright(c) 2002-2005 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 // Cleaning the BM related preprocessor defines to eliminate the risks of collision

<a name="l00006"></a>00006 // with other programs. Please let me know if something is missing.

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

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

<a name="l00009"></a>00009 #undef BMCOUNT_INC

<a name="l00010"></a>00010 #undef BMCOUNT_DEC

<a name="l00011"></a>00011 #undef BMCOUNT_VALID

<a name="l00012"></a>00012 #undef BMCOUNT_SET

<a name="l00013"></a>00013 #undef BMCOUNT_ADJ

<a name="l00014"></a>00014 #undef BMCOUNT_INC

<a name="l00015"></a>00015 #undef BMCOUNT_DEC

<a name="l00016"></a>00016 #undef BMCOUNT_VALID

<a name="l00017"></a>00017 #undef BMCOUNT_SET

<a name="l00018"></a>00018 #undef BMCOUNT_ADJ

<a name="l00019"></a>00019 #undef BMRESTRICT

<a name="l00020"></a>00020 #undef BMFORCEINLINE

<a name="l00021"></a>00021 #undef BMGAP_PTR

<a name="l00022"></a>00022 #undef BMSET_PTRGAP

<a name="l00023"></a>00023 #undef BM_IS_GAP

<a name="l00024"></a>00024 #undef BMPTR_SETBIT0

<a name="l00025"></a>00025 #undef BMPTR_CLEARBIT0

<a name="l00026"></a>00026 #undef BMPTR_TESTBIT0

<a name="l00027"></a>00027 #undef BM_SET_MMX_GUARD

<a name="l00028"></a>00028 #undef SER_NEXT_GRP

<a name="l00029"></a>00029 #undef BM_SET_ONE_BLOCKS

<a name="l00030"></a>00030 #undef DECLARE_TEMP_BLOCK

<a name="l00031"></a>00031 #undef BM_MM_EMPTY

<a name="l00032"></a>00032 #undef BM_ASSERT

<a name="l00033"></a>00033 #undef FULL_BLOCK_ADDR

<a name="l00034"></a>00034 #undef IS_VALID_ADDR

<a name="l00035"></a>00035 #undef IS_FULL_BLOCK

<a name="l00036"></a>00036 #undef IS_EMPTY_BLOCK

<a name="l00037"></a>00037 #undef BM_INCWORD_BITCOUNT

<a name="l00038"></a>00038 #undef BM_MINISET_GAPLEN

<a name="l00039"></a>00039 #undef BM_MINISET_ARRSIZE

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

<a name="l00041"></a>00041 #undef BMVECTOPT

<a name="l00042"></a>00042 #undef VECT_XOR_ARR_2_MASK

<a name="l00043"></a>00043 #undef VECT_ANDNOT_ARR_2_MASK

<a name="l00044"></a>00044 #undef VECT_INVERT_ARR

<a name="l00045"></a>00045 #undef VECT_AND_ARR

<a name="l00046"></a>00046 #undef VECT_OR_ARR

<a name="l00047"></a>00047 #undef VECT_SUB_ARR

<a name="l00048"></a>00048 #undef VECT_XOR_ARR

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

<a name="l00050"></a>00050 #undef VECT_COPY_BLOCK

<a name="l00051"></a>00051 #undef VECT_SET_BLOCK

<a name="l00052"></a>00052

<a name="l00053"></a>00053 #undef BM_UNALIGNED_ACCESS_OK

<a name="l00054"></a>00054 #undef BM_ALIGN16

<a name="l00055"></a>00055 #undef BM_ALIGN16ATTR

<a name="l00056"></a>00056 #undef BM_x86

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

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

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

<a name="l00002"></a>00002 #define BMUTIL__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 #include "<a class="code" href="a00092.html">bmdef.h</a>"

<a name="l00030"></a>00030 #include "<a class="code" href="a00091.html">bmconst.h</a>"

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

<a name="l00032"></a>00032 #if defined(_M_AMD64) || defined(_M_X64)

<a name="l00033"></a>00033 #include <intrin.h>

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

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

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

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

<a name="l00038"></a>00038

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

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

<a name="l00041"></a>00041 // SSE2 vector equality comparison

<a name="l00042"></a>00042 int _mm_any_eq( vFloat a, vFloat b )

<a name="l00043"></a>00043 {

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

<a name="l00045"></a>00045 //test a==b for each float in a & b

<a name="l00046"></a>00046 vFloat mask = _mm_cmpeq_ps( a, b );

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

<a name="l00048"></a>00048 //copy top bit of each result to maskbits

<a name="l00049"></a>00049 int maskBits = _mm_movemask_ps( mask );

<a name="l00050"></a>00050 return maskBits != 0;

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

<a name="l00052"></a>00052 */

<a name="l00053"></a>00053

<a name="l00054"></a>00054 // From:

<a name="l00055"></a>00055 // http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.8562

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

<a name="l00057"></a>00057 template<typename T>

<a name="l00058"></a><a class="code" href="a00115.html#a7267df2bcc9c575c50dd1c68589c6ac1">00058</a> T <a class="code" href="a00115.html#a7267df2bcc9c575c50dd1c68589c6ac1">bit_scan_fwd</a>(T v)

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

<a name="l00060"></a>00060 return

<a name="l00061"></a>00061 <a class="code" href="a00052.html">DeBruijn_bit_position<true>::_multiply</a>[((<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">word_t</a>)((v & -v) * 0x077CB531U)) >> 27];

<a name="l00062"></a>00062 }

<a name="l00063"></a>00063

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

<a name="l00065"></a>00065 Get minimum of 2 values

<a name="l00066"></a>00066 */

<a name="l00067"></a>00067 template<typename T>

<a name="l00068"></a><a class="code" href="a00115.html#a35c6dfc6504cd79f788121f361b01bf9">00068</a> T <a class="code" href="a00115.html#a35c6dfc6504cd79f788121f361b01bf9" title="Get minimum of 2 values.">min_value</a>(T v1, T v2)

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

<a name="l00070"></a>00070 return v1 < v2 ? v1 : v2;

<a name="l00071"></a>00071 }

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

100

<a name="l00073"></a>00073

101

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

102

<a name="l00075"></a>00075 Fast loop-less function to find LOG2

103

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

104

<a name="l00077"></a>00077 template<typename T>

105

<a name="l00078"></a><a class="code" href="a00115.html#a46f258f92ab40e2a0c76aa775338faaa">00078</a> T <a class="code" href="a00115.html#a46f258f92ab40e2a0c76aa775338faaa" title="Fast loop-less function to find LOG2.">ilog2</a>(T x)

106

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

107

<a name="l00080"></a>00080 unsigned int l = 0;

108

<a name="l00081"></a>00081 if(x >= 1<<16) { x>>=16; l |= 16; }

109

<a name="l00082"></a>00082 if(x >= 1<<8) { x>>=8; l |= 8; }

110

<a name="l00083"></a>00083 if(x >= 1<<4) { x>>=4; l |= 4; }

111

<a name="l00084"></a>00084 if(x >= 1<<2) { x>>=2; l |= 2; }

112

<a name="l00085"></a>00085 if(x >= 1<<1) l |=1;

113

<a name="l00086"></a>00086 return l;

114

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

115

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

116

<a name="l00089"></a>00089 template<>

117

<a name="l00090"></a><a class="code" href="a00115.html#a5f818ac575622da8a9a75511e649ea90">00090</a> inline <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a> <a class="code" href="a00115.html#a46f258f92ab40e2a0c76aa775338faaa" title="Fast loop-less function to find LOG2.">ilog2</a>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> x)

118

<a name="l00091"></a>00091 {

119

<a name="l00092"></a>00092 unsigned int l = 0;

120

<a name="l00093"></a>00093 if(x >= 1<<8) { x>>=8; l |= 8; }

121

<a name="l00094"></a>00094 if(x >= 1<<4) { x>>=4; l |= 4; }

122

<a name="l00095"></a>00095 if(x >= 1<<2) { x>>=2; l |= 2; }

123

<a name="l00096"></a>00096 if(x >= 1<<1) l |=1;

124

<a name="l00097"></a>00097 return (<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>)l;

125

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

126

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

127

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

128

<a name="l00101"></a>00101 Mini auto-pointer for internal memory management

129

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

130

<a name="l00103"></a>00103 */

131

<a name="l00104"></a>00104 template<class T>

132

<a name="l00105"></a><a class="code" href="a00078.html">00105</a> class <a class="code" href="a00078.html" title="Mini auto-pointer for internal memory management.">ptr_guard</a>

133

<a name="l00106"></a>00106 {

134

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

135

<a name="l00108"></a><a class="code" href="a00078.html#abc96b2ee795bd9353fdf6eab39e29ebc">00108</a> <a class="code" href="a00078.html#abc96b2ee795bd9353fdf6eab39e29ebc">ptr_guard</a>(T* p) : ptr_(p) {}

136

<a name="l00109"></a><a class="code" href="a00078.html#a0c99d726c78b751315eb3450108f236b">00109</a> <a class="code" href="a00078.html#a0c99d726c78b751315eb3450108f236b">~ptr_guard</a>() { delete ptr_; }

137

<a name="l00110"></a>00110 private:

138

<a name="l00111"></a>00111 <a class="code" href="a00078.html#abc96b2ee795bd9353fdf6eab39e29ebc">ptr_guard</a>(const <a class="code" href="a00078.html" title="Mini auto-pointer for internal memory management.">ptr_guard<T></a>& p);

139

<a name="l00112"></a>00112 <a class="code" href="a00078.html" title="Mini auto-pointer for internal memory management.">ptr_guard</a>& operator=(const <a class="code" href="a00078.html" title="Mini auto-pointer for internal memory management.">ptr_guard<T></a>& p);

140

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

141

<a name="l00114"></a>00114 T* ptr_;

142

<a name="l00115"></a>00115 };

143

<a name="l00116"></a>00116

144

<a name="l00117"></a>00117 /**

145

<a name="l00118"></a>00118 Lookup table based integer LOG2

146

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

147

<a name="l00120"></a>00120 template<typename T>

148

<a name="l00121"></a><a class="code" href="a00115.html#a3ab126a6fd7ffd872a4001638819a330">00121</a> T <a class="code" href="a00115.html#a3ab126a6fd7ffd872a4001638819a330" title="Lookup table based integer LOG2.">ilog2_LUT</a>(T x)

149

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

150

<a name="l00123"></a>00123 unsigned l = 0;

151

<a name="l00124"></a>00124 if (x & 0xffff0000)

152

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

153

<a name="l00126"></a>00126 l += 16; x >>= 16;

154

<a name="l00127"></a>00127 }

155

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

156

<a name="l00129"></a>00129 if (x & 0xff00)

157

<a name="l00130"></a>00130 {

158

<a name="l00131"></a>00131 l += 8; x >>= 8;

159

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

160

<a name="l00133"></a>00133 return l + <a class="code" href="a00063.html" title="Structure keeps index of first right 1 bit for every byte.">first_bit_table<true>::_idx</a>[x];

161

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

162

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

163

<a name="l00136"></a>00136 /**

164

<a name="l00137"></a>00137 Lookup table based short integer LOG2

165

<a name="l00138"></a>00138 */

166

<a name="l00139"></a>00139 template<>

167

<a name="l00140"></a>00140 inline <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a> ilog2_LUT<bm::gap_word_t>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a> x)

168

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

169

<a name="l00142"></a>00142 unsigned l = 0;

170

<a name="l00143"></a>00143 if (x & 0xff00)

171

<a name="l00144"></a>00144 {

172

<a name="l00145"></a>00145 l += 8; x >>= 8;

173

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

174

<a name="l00147"></a>00147 return (<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>)(l + first_bit_table<true>::_idx[x]);

175

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

176

<a name="l00149"></a>00149

177

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

178

<a name="l00151"></a>00151 // if we are running on x86 CPU we can use inline ASM

179

<a name="l00152"></a>00152

180

<a name="l00153"></a>00153 #ifdef BM_x86

181

<a name="l00154"></a>00154 #ifdef __GNUG__

182

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

183

<a name="l00156"></a>00156 inline

184

<a name="l00157"></a>00157 unsigned bsf_asm32(unsigned int v)

185

<a name="l00158"></a>00158 {

186

<a name="l00159"></a>00159 unsigned r;

187

<a name="l00160"></a>00160 asm volatile(" bsfl %1, %0": "=r"(r): "rm"(v) );

188

<a name="l00161"></a>00161 return r;

189

<a name="l00162"></a>00162 }

190

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

191

<a name="l00164"></a>00164 <a class="code" href="a00092.html#a938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a> unsigned bsr_asm32(register unsigned int v)

192

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

193

<a name="l00166"></a>00166 unsigned r;

194

<a name="l00167"></a>00167 asm volatile(" bsrl %1, %0": "=r"(r): "rm"(v) );

195

<a name="l00168"></a>00168 return r;

196

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

197

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

198

<a name="l00171"></a>00171 #endif // __GNUG__

199

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

200

<a name="l00173"></a>00173 #ifdef _MSC_VER

201

<a name="l00174"></a>00174

202

<a name="l00175"></a>00175 #if defined(_M_AMD64) || defined(_M_X64) // inline assembly not supported

203

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

204

<a name="l00177"></a>00177 <a class="code" href="a00092.html#a938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a> unsigned int bsr_asm32(unsigned int value)

205

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

206

<a name="l00179"></a>00179 unsigned long r;

207

<a name="l00180"></a>00180 _BitScanReverse(&r, value);

208

<a name="l00181"></a>00181 return r;

209

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

210

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

211

<a name="l00184"></a>00184 <a class="code" href="a00092.html#a938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a> unsigned int bsf_asm32(unsigned int value)

212

<a name="l00185"></a>00185 {

213

<a name="l00186"></a>00186 unsigned long r;

214

<a name="l00187"></a>00187 _BitScanForward(&r, value);

215

<a name="l00188"></a>00188 return r;

216

<a name="l00189"></a>00189 }

217

<a name="l00190"></a>00190

218

<a name="l00191"></a>00191 #else

219

<a name="l00192"></a>00192

220

<a name="l00193"></a>00193 <a class="code" href="a00092.html#a938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a> unsigned int bsr_asm32(register unsigned int value)

221

<a name="l00194"></a>00194 {

222

<a name="l00195"></a>00195 __asm bsr eax, value

223

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

224

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

225

<a name="l00198"></a>00198 <a class="code" href="a00092.html#a938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a> unsigned int bsf_asm32(register unsigned int value)

226

<a name="l00199"></a>00199 {

227

<a name="l00200"></a>00200 __asm bsf eax, value

228

<a name="l00201"></a>00201 }

229

<a name="l00202"></a>00202

230

<a name="l00203"></a>00203 #endif

231

<a name="l00204"></a>00204

232

<a name="l00205"></a>00205 #endif // _MSC_VER

233

<a name="l00206"></a>00206

234

<a name="l00207"></a>00207 #endif // BM_x86

235

<a name="l00208"></a>00208

236

<a name="l00209"></a>00209

237

<a name="l00210"></a>00210

238

<a name="l00211"></a>00211 } // bm

239

<a name="l00212"></a>00212

240

<a name="l00213"></a>00213 #endif

241

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

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

242

<hr size="1"/><address style="text-align: right;">Generated on Sun Apr 25 09:37:28 2010 for BitMagic by

243

244

245

</body>

Older »