-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbwslib2.c
174 lines (164 loc) · 4.07 KB
/
bwslib2.c
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
/*
* See Copyright Notice in bwslib.h
*/
#include "bwslib.h"
#include <stdlib.h>
/* Binary search for inverse bwt. */
static
saidx_t
binarysearch_lower(const saidx_t *A, saidx_t size, saidx_t value) {
saidx_t half, i;
for(i = 0, half = size >> 1;
0 < size;
size = half, half >>= 1) {
if(A[i + half] < value) {
i += half + 1;
half -= (size & 1) ^ 1;
}
}
return i;
}
saint_t
bws_inverse_bw_transform(const sauchar_t *T, sauchar_t *U, saidx_t *A,
saidx_t n, saidx_t idx,
csaidx_t *pindex) {
saidx_t *B;
saidx_t i, j, p;
saint_t c;
saidx_t *ISA;
saidx_t *C;
sauchar_t *D;
saidx_t d;
/* Check arguments. */
if((T == NULL) || (U == NULL) || (n < 0) || (idx < 0) ||
(n < idx) || ((0 < n) && (idx == 0))) {
return -1;
}
if (pindex == NULL)
{
return -3;
}
ISA = pindex->ISA;
C = pindex->C;
D = pindex->AtoC;
d = pindex->m;
if((ISA == NULL) || (C == NULL) || (D == NULL) || (d < 0) || (d > pindex->s))
{
return -3;
}
if(n <= 1) { return 0; }
if((B = A) == NULL) {
/* Allocate n*sizeof(saidx_t) bytes of memory. */
if((B = (saidx_t *)malloc((size_t)n * sizeof(saidx_t))) == NULL) { return -2; }
}
/* Inverse BW transform. */
for(c = 0, i = 0; c < pindex->s; ++c) {
p = C[c];
if(0 < p) {
C[c] = i;
i += p;
}
}
for(i = 0; i < idx; ++i) { B[C[T[i]]++] = i; }
for( ; i < n; ++i) { B[C[T[i]]++] = i + 1; }
for(c = 0; c < d; ++c) { C[c] = C[D[c]]; }
/*
* F[i] = T[SA[i]] => T[i] = F[ISA[i]]
* LF[i] = ISA[SA[i] - 1] => FL[i] = ISA[SA[i] + 1]
* T[i + 1] = F[FL[ISA[i]]]
* FL == Psi
*/
#ifdef _OPENMP
#pragma omp parallel for default(shared) private(i, j, p)
#endif
for (j = 0; j <= pindex->n_sub_1_div_d2; ++j)
{
int k = (j + 1) * pindex->d2;
if (n < k)
{
k = n;
}
for (i = j * pindex->d2, p = GET_SAIDX(*pindex, ISA, j); i < k; ++i)
{
U[i] = D[binarysearch_lower(C, d, p)];
p = B[p - 1];
}
}
if(A == NULL) {
/* Deallocate memory. */
free(B);
}
return 0;
}
sauchar_t *bws_substr_mt(csaidx_t *pcsa, bwsidx_t *pbws,
bw_file_t *fpbw,
saidx_t i, int len)
{
sauchar_t *s;
if (!pcsa || !pbws || !fpbw || i >= pbws->n || len <= 0)
{
return NULL;
}
if (i + len > pbws->n)
{
len = pbws->n - i;
}
s = (sauchar_t *) malloc(len + 1);
if (s)
{
/*
* BW[j] = T[SA[j] - 1] => T[i] = BW[ISA[i + 1]]
* LF[j] = ISA[SA[j] - 1] => ISA[i] = LF[ISA[i + 1]]
*/
saidx_t j, k, l;
sauchar_t *p = s + len;
*p-- = 0;
j = ((i >> pbws->logLB) + 1) << pbws->logLB;
l = i + len;
k = i;
if (j <= l)
{
len = j - i;
i = j;
p = s + (i - k) - 1;
i = bws_isa_r(pcsa, pbws,
fpbw,
i);
do
{
*p-- = bws_bw(pcsa, pbws,
fpbw,
i);
i = bws_lf(pcsa, pbws,
fpbw,
i);
} while (--len);
i = j;
}
#ifdef _OPENMP
#pragma omp parallel for default(shared) private(j, p, len) firstprivate(i)
#endif
for (j = i; j < l; j += pbws->lb)
{
bw_file_t *bwfp = fpbw->dup(fpbw);
len = j + pbws->lb > l ? l - j : pbws->lb;
i = j + len;
p = s + (i - k) - 1;
i = bws_isa_r(pcsa, pbws,
bwfp,
i);
do
{
*p-- = bws_bw(pcsa, pbws,
bwfp,
i);
i = bws_lf(pcsa, pbws,
bwfp,
i);
} while (--len);
bwfp->close(bwfp);
}
}
return s;
}
/* vim: set ts=4 sw=4 et cino=l1,t0,(0,w1,W2s,M1 fo+=mM tw=80 cc=80 : */