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 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454
|
// ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2015, Knut Reinert, FU Berlin
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * 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.
// * Neither the name of Knut Reinert or the FU Berlin nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS 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 KNUT REINERT OR THE FU BERLIN 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.
//
// ==========================================================================
// Author: Stefan Budach <budach@molgen.mpg.de>
// ==========================================================================
// DPScout_ specialization for the SIMD alignment implementation.
// ==========================================================================
#ifndef SEQAN_INCLUDE_SEQAN_ALIGN_SIMD_DP_SCOUT_SIMD_H_
#define SEQAN_INCLUDE_SEQAN_ALIGN_SIMD_DP_SCOUT_SIMD_H_
namespace seqan {
// ============================================================================
// Forwards
// ============================================================================
// ============================================================================
// Tags, Classes, Enums
// ============================================================================
struct SimdAlignEqualLength_;
typedef Tag<SimdAlignEqualLength_> SimdAlignEqualLength;
template <typename TTraits>
struct SimdAlignVariableLength
{};
template <typename TSpec = SimdAlignEqualLength>
struct SimdAlignmentScout {};
// ----------------------------------------------------------------------------
// Class DPScoutState_
// ----------------------------------------------------------------------------
template <>
class DPScoutState_<SimdAlignEqualLength>
{};
template <typename TTraits>
class DPScoutState_<SimdAlignVariableLength<TTraits> >
{
public:
using TSizeH = typename Size<typename TTraits::TSeqH>::Type;
using TSizeV = typename Size<typename TTraits::TSeqV>::Type;
String<typename TTraits::TSimdVector, Alloc<OverAligned> > masksH;
String<typename TTraits::TSimdVector, Alloc<OverAligned> > masksV;
String<typename TTraits::TSimdVector, Alloc<OverAligned> > masks;
String<size_t> endsH;
String<size_t> endsV;
ModifiedString<String<size_t>, ModPos<String<size_t> > > sortedEndsH;
ModifiedString<String<size_t>, ModPos<String<size_t> > > sortedEndsV;
decltype(begin(sortedEndsH, Standard())) nextEndsH;
decltype(begin(sortedEndsV, Standard())) nextEndsV;
size_t dimV;
size_t posH;
size_t posV;
bool right;
bool bottom;
bool isLocalAlignment;
// ----------------------------------------------------------------------------
// Function DPScout_#updateMasksRight()
// ----------------------------------------------------------------------------
inline void updateMasksRight()
{
for(size_t pos = dimV - 2; pos != MaxValue<size_t>::VALUE; --pos)
masks[pos] |= masks[pos + 1];
}
// ----------------------------------------------------------------------------
// Function DPScout_#updateMasksBottom()
// ----------------------------------------------------------------------------
inline void updateMasksBottom()
{
for (auto pos : sortedEndsV)
for (auto it = nextEndsH; it != end(sortedEndsH, Standard()); ++it)
{
masks[pos] |= (masksH[*it] & masksV[pos]);
}
}
// ----------------------------------------------------------------------------
// Function DPScout_#updateMasks()
// ----------------------------------------------------------------------------
inline void updateMasks()
{
for(size_t pos = 0; pos < dimV; ++pos)
masks[pos] = masksH[posH] & masksV[pos];
//for local alignments the BOTTOM parameter must be checked first
if(isLocalAlignment)
{
updateMasksBottom();
updateMasksRight();
}
else
{
if(right && posH == *nextEndsH)
updateMasksRight();
if(bottom)
updateMasksBottom();
}
}
};
// ----------------------------------------------------------------------------
// Class DPScout_
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TSpec>
class DPScout_<TDPCell, SimdAlignmentScout<TSpec> > :
public DPScout_<TDPCell, Default>
{
public:
using TBase = DPScout_<TDPCell, Default>;
using TScoutState = DPScoutState_<TSpec>;
//used in the SIMD version to keep track of all host positions
//SIMD register size divided by 16bit is the amount of alignments
//so we need two vectors of type 32bit to save the host for all alignments
// TODO(rrahn): Abstract into a struct, so we can model different configurations.
SimdVector<int32_t>::Type _maxHostLow; //first half of alignments
SimdVector<int32_t>::Type _maxHostHigh; //other half
TScoutState * state = nullptr;
unsigned _simdLane = 0;
DPScout_(TScoutState & pState) : TBase(), state(&pState)
{}
};
// ============================================================================
// Metafunctions
// ============================================================================
// ----------------------------------------------------------------------------
// Metafunction ScoutSpecForSimdAlignment_
// ----------------------------------------------------------------------------
template<typename TAlignmentAlgorithm>
struct ScoutSpecForAlignmentAlgorithm_<TAlignmentAlgorithm, DPScoutState_<SimdAlignEqualLength> >
{
typedef SimdAlignmentScout<SimdAlignEqualLength> Type;
};
template<typename TAlignmentAlgorithm, typename TTraits>
struct ScoutSpecForAlignmentAlgorithm_<TAlignmentAlgorithm, DPScoutState_<SimdAlignVariableLength<TTraits> > >
{
typedef SimdAlignmentScout<SimdAlignVariableLength<TTraits> > Type;
};
// ============================================================================
// Functions
// ============================================================================
// ----------------------------------------------------------------------------
// Function _copySimdCell()
// ----------------------------------------------------------------------------
template <typename TValue, typename TSpec, typename TScoreValue>
inline void
_copySimdCell(DPScout_<DPCell_<TValue, LinearGaps>, SimdAlignmentScout<TSpec> > & dpScout,
DPCell_<TValue, LinearGaps> const & activeCell,
TScoreValue const & cmp)
{
dpScout._maxScore._score = blend(dpScout._maxScore._score, activeCell._score, cmp);
}
template <typename TValue, typename TSpec, typename TScoreValue>
inline void
_copySimdCell(DPScout_<DPCell_<TValue, AffineGaps>, SimdAlignmentScout<TSpec> > & dpScout,
DPCell_<TValue, AffineGaps> const & activeCell,
TScoreValue const & cmp)
{
dpScout._maxScore._score = blend(dpScout._maxScore._score, activeCell._score, cmp);
dpScout._maxScore._horizontalScore = blend(dpScout._maxScore._horizontalScore, activeCell._horizontalScore, cmp);
dpScout._maxScore._verticalScore = blend(dpScout._maxScore._verticalScore, activeCell._verticalScore, cmp);
}
template <typename TValue, typename TSpec, typename TScoreValue>
inline void
_copySimdCell(DPScout_<DPCell_<TValue, DynamicGaps>, SimdAlignmentScout<TSpec> > & dpScout,
DPCell_<TValue, DynamicGaps> const & activeCell,
TScoreValue const & cmp)
{
dpScout._maxScore._score = blend(dpScout._maxScore._score, activeCell._score, cmp);
dpScout._maxScore._flagMask = blend(dpScout._maxScore._flagMask, activeCell._flagMask, cmp);
}
// ----------------------------------------------------------------------------
// Function _updateHostPositions()
// ----------------------------------------------------------------------------
template<typename TDPCell, typename TScoutSpec, typename TSimdVec>
inline void
_updateHostPositions(DPScout_<TDPCell, TScoutSpec> & dpScout,
TSimdVec & cmp,
SimdVector<int32_t>::Type positionNavigator)
{
// TODO(rrahn): Refactor!
#if defined(__AVX2__)
dpScout._maxHostLow = blend(dpScout._maxHostLow, positionNavigator,
_mm256_cvtepi16_epi32(_mm256_castsi256_si128(reinterpret_cast<__m256i&>(cmp))));
dpScout._maxHostHigh = blend(dpScout._maxHostHigh, positionNavigator,
_mm256_cvtepi16_epi32(_mm256_extractf128_si256(reinterpret_cast<__m256i&>(cmp),1)));
#elif defined(__SSE3__)
dpScout._maxHostLow = blend(dpScout._maxHostLow, positionNavigator,
_mm_unpacklo_epi16(reinterpret_cast<__m128i&>(cmp), reinterpret_cast<__m128i&>(cmp)));
dpScout._maxHostHigh = blend(dpScout._maxHostHigh, positionNavigator,
_mm_unpackhi_epi16(reinterpret_cast<__m128i&>(cmp), reinterpret_cast<__m128i&>(cmp)));
#endif
}
// ----------------------------------------------------------------------------
// Function _scoutBestScore()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraceMatrixNavigator, typename TIsLastColumn, typename TIsLastRow>
inline void
_scoutBestScore(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignEqualLength> > & dpScout,
TDPCell const & activeCell,
TTraceMatrixNavigator const & navigator,
TIsLastColumn const & /**/,
TIsLastRow const & /**/)
{
auto cmp = cmpGt(_scoreOfCell(activeCell), _scoreOfCell(dpScout._maxScore));
_copySimdCell(dpScout, activeCell, cmp);
_updateHostPositions(dpScout, cmp, createVector<SimdVector<int32_t>::Type>(position(navigator)));
}
template <typename TDPCell, typename TTraits,
typename TTraceMatrixNavigator,
typename TIsLastColumn,
typename TIsLastRow>
inline void
_scoutBestScore(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & dpScout,
TDPCell const & activeCell,
TTraceMatrixNavigator const & navigator,
TIsLastColumn const & /**/,
TIsLastRow const & /**/)
{
auto cmp = cmpGt(_scoreOfCell(activeCell), _scoreOfCell(dpScout._maxScore));
cmp &= dpScout.state->masks[dpScout.state->posV];
_copySimdCell(dpScout, activeCell, cmp);
_updateHostPositions(dpScout, cmp, createVector<SimdVector<int32_t>::Type>(position(navigator)));
}
// ----------------------------------------------------------------------------
// Function maxHostPosition()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TScoutSpec>
inline unsigned int
maxHostPosition(DPScout_<TDPCell, SimdAlignmentScout<TScoutSpec> > const & dpScout)
{
if(dpScout._simdLane < LENGTH<SimdVector<int32_t>::Type>::VALUE)
return value(dpScout._maxHostLow, dpScout._simdLane);
else
return value(dpScout._maxHostHigh, dpScout._simdLane - LENGTH<SimdVector<int32_t>::Type>::VALUE);
}
// ----------------------------------------------------------------------------
// Function _setSimdLane()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TScoutSpec, typename TPosition>
inline void
_setSimdLane(DPScout_<TDPCell, TScoutSpec> & dpScout, TPosition const pos)
{
dpScout._simdLane = pos;
}
// ----------------------------------------------------------------------------
// Function _preInitScoutHorizontal()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraits>
inline void
_preInitScoutHorizontal(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & scout)
{
scout.state->nextEndsH = begin(scout.state->sortedEndsH, Standard());
scout.state->posH = 0;
}
// ----------------------------------------------------------------------------
// Function _preInitScoutVertical()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraits>
inline void
_preInitScoutVertical(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & scout)
{
scout.state->updateMasks();
scout.state->nextEndsV = begin(scout.state->sortedEndsV, Standard());
scout.state->posV = 0;
}
// ----------------------------------------------------------------------------
// Function _reachedHorizontalEndPoint()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraits, typename TIter>
inline bool
_reachedHorizontalEndPoint(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & scout,
TIter const & hIt)
{
return *(scout.state->nextEndsH) == position(hIt);
}
// ----------------------------------------------------------------------------
// Function _reachedVerticalEndPoint()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraits, typename TIter>
inline bool
_reachedVerticalEndPoint(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & scout,
TIter const & vIt)
{
return *(scout.state->nextEndsV) == position(vIt);
}
// ----------------------------------------------------------------------------
// Function _nextHorizontalEndPos()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraits>
inline void
_nextHorizontalEndPos(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & scout)
{
auto oldLength = *scout.state->nextEndsH;
while (scout.state->nextEndsH != end(scout.state->sortedEndsH, Standard()) &&
*scout.state->nextEndsH == oldLength)
{
++scout.state->nextEndsH;
}
}
// ----------------------------------------------------------------------------
// Function _nextVerticalEndPos()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraits>
inline void
_nextVerticalEndPos(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & scout)
{
auto oldLength = *scout.state->nextEndsV;
while (scout.state->nextEndsV != end(scout.state->sortedEndsV, Standard()) &&
*scout.state->nextEndsV == oldLength)
{
++scout.state->nextEndsV;
}
}
// ----------------------------------------------------------------------------
// Function _incHorizontalPos()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraits>
inline void
_incHorizontalPos(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & scout)
{
++scout.state->posH;
}
// ----------------------------------------------------------------------------
// Function _incVerticalPos()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TTraits>
inline void
_incVerticalPos(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > & scout)
{
++scout.state->posV;
}
// ----------------------------------------------------------------------------
// Function _hostLengthH()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TSeqH>
inline auto
_hostLengthH(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignEqualLength> > const & /*scout*/,
TSeqH const & seqH)
{
return length(seqH);
}
template <typename TDPCell, typename TTraits, typename TSeqH>
inline auto
_hostLengthH(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > const & scout,
TSeqH const & /*seqH*/)
{
return host(scout.state->sortedEndsH)[scout._simdLane] + 1;
}
// ----------------------------------------------------------------------------
// Function _hostLengthV()
// ----------------------------------------------------------------------------
template <typename TDPCell, typename TSeqV>
inline auto
_hostLengthV(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignEqualLength> > const & /*scout*/,
TSeqV const & seqV)
{
return length(seqV);
}
template <typename TDPCell, typename TTraits, typename TSeqV>
inline auto
_hostLengthV(DPScout_<TDPCell, SimdAlignmentScout<SimdAlignVariableLength<TTraits> > > const & scout,
TSeqV const & /*seqV*/)
{
return host(scout.state->sortedEndsV)[scout._simdLane] + 1;
}
} // namespace seqan
#endif // #ifndef SEQAN_INCLUDE_SEQAN_ALIGN_SIMD_DP_SCOUT_SIMD_H_
|