forked from DaehwanKimLab/hisat2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
aligner_swsse.cpp
88 lines (84 loc) · 2.61 KB
/
aligner_swsse.cpp
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
/*
* Copyright 2011, Ben Langmead <[email protected]>
*
* This file is part of Bowtie 2.
*
* Bowtie 2 is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Bowtie 2 is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Bowtie 2. If not, see <http://www.gnu.org/licenses/>.
*/
#include <string.h>
#include "aligner_sw_common.h"
#include "aligner_swsse.h"
/**
* Given a number of rows (nrow), a number of columns (ncol), and the
* number of words to fit inside a single __m128i vector, initialize the
* matrix buffer to accomodate the needed configuration of vectors.
*/
void SSEMatrix::init(
size_t nrow,
size_t ncol,
size_t wperv)
{
nrow_ = nrow;
ncol_ = ncol;
wperv_ = wperv;
nvecPerCol_ = (nrow + (wperv-1)) / wperv;
// The +1 is so that we don't have to special-case the final column;
// instead, we just write off the end of the useful part of the table
// with pvEStore.
try {
matbuf_.resizeNoCopy((ncol+1) * nvecPerCell_ * nvecPerCol_);
} catch(exception& e) {
cerr << "Tried to allocate DP matrix with " << (ncol+1)
<< " columns, " << nvecPerCol_
<< " vectors per column, and and " << nvecPerCell_
<< " vectors per cell" << endl;
throw e;
}
assert(wperv_ == 8 || wperv_ == 16);
vecshift_ = (wperv_ == 8) ? 3 : 4;
nvecrow_ = (nrow + (wperv_-1)) >> vecshift_;
nveccol_ = ncol;
colstride_ = nvecPerCol_ * nvecPerCell_;
rowstride_ = nvecPerCell_;
inited_ = true;
}
/**
* Initialize the matrix of masks and backtracking flags.
*/
void SSEMatrix::initMasks() {
assert_gt(nrow_, 0);
assert_gt(ncol_, 0);
masks_.resize(nrow_);
reset_.resizeNoCopy(nrow_);
reset_.fill(false);
}
/**
* Given a row, col and matrix (i.e. E, F or H), return the corresponding
* element.
*/
int SSEMatrix::eltSlow(size_t row, size_t col, size_t mat) const {
assert_lt(row, nrow_);
assert_lt(col, ncol_);
assert_leq(mat, 3);
// Move to beginning of column/row
size_t rowelt = row / nvecrow_;
size_t rowvec = row % nvecrow_;
size_t eltvec = (col * colstride_) + (rowvec * rowstride_) + mat;
if(wperv_ == 16) {
return (int)((uint8_t*)(matbuf_.ptr() + eltvec))[rowelt];
} else {
assert_eq(8, wperv_);
return (int)((int16_t*)(matbuf_.ptr() + eltvec))[rowelt];
}
}