| 1 |
#include <zlib.h> |
| 2 |
#include <ctype.h> |
| 3 |
#include "bwtaln.h" |
| 4 |
#include "utils.h" |
| 5 |
#include "bamlite.h" |
| 6 |
|
| 7 |
#include "kseq.h" |
| 8 |
KSEQ_DECLARE(gzFile) |
| 9 |
|
| 10 |
#ifdef USE_MALLOC_WRAPPERS |
| 11 |
# include "malloc_wrap.h" |
| 12 |
#endif |
| 13 |
|
| 14 |
extern unsigned char nst_nt4_table[256]; |
| 15 |
static char bam_nt16_nt4_table[] = { 4, 0, 1, 4, 2, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4 }; |
| 16 |
|
| 17 |
struct __bwa_seqio_t { |
| 18 |
// for BAM input |
| 19 |
int is_bam, which; // 1st bit: read1, 2nd bit: read2, 3rd: SE |
| 20 |
bamFile fp; |
| 21 |
// for fastq input |
| 22 |
kseq_t *ks; |
| 23 |
}; |
| 24 |
|
| 25 |
bwa_seqio_t *bwa_bam_open(const char *fn, int which) |
| 26 |
{ |
| 27 |
bwa_seqio_t *bs; |
| 28 |
bam_header_t *h; |
| 29 |
bs = (bwa_seqio_t*)calloc(1, sizeof(bwa_seqio_t)); |
| 30 |
bs->is_bam = 1; |
| 31 |
bs->which = which; |
| 32 |
bs->fp = bam_open(fn, "r"); |
| 33 |
if (0 == bs->fp) err_fatal_simple("Couldn't open bam file"); |
| 34 |
h = bam_header_read(bs->fp); |
| 35 |
bam_header_destroy(h); |
| 36 |
return bs; |
| 37 |
} |
| 38 |
|
| 39 |
bwa_seqio_t *bwa_seq_open(const char *fn) |
| 40 |
{ |
| 41 |
gzFile fp; |
| 42 |
bwa_seqio_t *bs; |
| 43 |
bs = (bwa_seqio_t*)calloc(1, sizeof(bwa_seqio_t)); |
| 44 |
fp = xzopen(fn, "r"); |
| 45 |
bs->ks = kseq_init(fp); |
| 46 |
return bs; |
| 47 |
} |
| 48 |
|
| 49 |
void bwa_seq_close(bwa_seqio_t *bs) |
| 50 |
{ |
| 51 |
if (bs == 0) return; |
| 52 |
if (bs->is_bam) { |
| 53 |
if (0 != bam_close(bs->fp)) err_fatal_simple("Error closing bam file"); |
| 54 |
} else { |
| 55 |
err_gzclose(bs->ks->f->f); |
| 56 |
kseq_destroy(bs->ks); |
| 57 |
} |
| 58 |
free(bs); |
| 59 |
} |
| 60 |
|
| 61 |
void seq_reverse(int len, ubyte_t *seq, int is_comp) |
| 62 |
{ |
| 63 |
int i; |
| 64 |
if (is_comp) { |
| 65 |
for (i = 0; i < len>>1; ++i) { |
| 66 |
char tmp = seq[len-1-i]; |
| 67 |
if (tmp < 4) tmp = 3 - tmp; |
| 68 |
seq[len-1-i] = (seq[i] >= 4)? seq[i] : 3 - seq[i]; |
| 69 |
seq[i] = tmp; |
| 70 |
} |
| 71 |
if (len&1) seq[i] = (seq[i] >= 4)? seq[i] : 3 - seq[i]; |
| 72 |
} else { |
| 73 |
for (i = 0; i < len>>1; ++i) { |
| 74 |
char tmp = seq[len-1-i]; |
| 75 |
seq[len-1-i] = seq[i]; seq[i] = tmp; |
| 76 |
} |
| 77 |
} |
| 78 |
} |
| 79 |
|
| 80 |
int bwa_trim_read(int trim_qual, bwa_seq_t *p) |
| 81 |
{ |
| 82 |
int s = 0, l, max = 0, max_l = p->len; |
| 83 |
if (trim_qual < 1 || p->qual == 0) return 0; |
| 84 |
for (l = p->len - 1; l >= BWA_MIN_RDLEN; --l) { |
| 85 |
s += trim_qual - (p->qual[l] - 33); |
| 86 |
if (s < 0) break; |
| 87 |
if (s > max) max = s, max_l = l; |
| 88 |
} |
| 89 |
p->clip_len = p->len = max_l; |
| 90 |
return p->full_len - p->len; |
| 91 |
} |
| 92 |
|
| 93 |
static bwa_seq_t *bwa_read_bam(bwa_seqio_t *bs, int n_needed, int *n, int is_comp, int trim_qual) |
| 94 |
{ |
| 95 |
bwa_seq_t *seqs, *p; |
| 96 |
int n_seqs, l, i; |
| 97 |
long n_trimmed = 0, n_tot = 0; |
| 98 |
bam1_t *b; |
| 99 |
int res; |
| 100 |
|
| 101 |
b = bam_init1(); |
| 102 |
n_seqs = 0; |
| 103 |
seqs = (bwa_seq_t*)calloc(n_needed, sizeof(bwa_seq_t)); |
| 104 |
while ((res = bam_read1(bs->fp, b)) >= 0) { |
| 105 |
uint8_t *s, *q; |
| 106 |
int go = 0; |
| 107 |
if ((bs->which & 1) && (b->core.flag & BAM_FREAD1)) go = 1; |
| 108 |
if ((bs->which & 2) && (b->core.flag & BAM_FREAD2)) go = 1; |
| 109 |
if ((bs->which & 4) && !(b->core.flag& BAM_FREAD1) && !(b->core.flag& BAM_FREAD2))go = 1; |
| 110 |
if (go == 0) continue; |
| 111 |
l = b->core.l_qseq; |
| 112 |
p = &seqs[n_seqs++]; |
| 113 |
p->tid = -1; // no assigned to a thread |
| 114 |
p->qual = 0; |
| 115 |
p->full_len = p->clip_len = p->len = l; |
| 116 |
n_tot += p->full_len; |
| 117 |
s = bam1_seq(b); q = bam1_qual(b); |
| 118 |
p->seq = (ubyte_t*)calloc(p->len + 1, 1); |
| 119 |
p->qual = (ubyte_t*)calloc(p->len + 1, 1); |
| 120 |
for (i = 0; i != p->full_len; ++i) { |
| 121 |
p->seq[i] = bam_nt16_nt4_table[(int)bam1_seqi(s, i)]; |
| 122 |
p->qual[i] = q[i] + 33 < 126? q[i] + 33 : 126; |
| 123 |
} |
| 124 |
if (bam1_strand(b)) { // then reverse |
| 125 |
seq_reverse(p->len, p->seq, 1); |
| 126 |
seq_reverse(p->len, p->qual, 0); |
| 127 |
} |
| 128 |
if (trim_qual >= 1) n_trimmed += bwa_trim_read(trim_qual, p); |
| 129 |
p->rseq = (ubyte_t*)calloc(p->full_len, 1); |
| 130 |
memcpy(p->rseq, p->seq, p->len); |
| 131 |
seq_reverse(p->len, p->seq, 0); // *IMPORTANT*: will be reversed back in bwa_refine_gapped() |
| 132 |
seq_reverse(p->len, p->rseq, is_comp); |
| 133 |
p->name = strdup((const char*)bam1_qname(b)); |
| 134 |
if (n_seqs == n_needed) break; |
| 135 |
} |
| 136 |
if (res < 0 && res != -1) err_fatal_simple("Error reading bam file"); |
| 137 |
*n = n_seqs; |
| 138 |
if (n_seqs && trim_qual >= 1) |
| 139 |
fprintf(stderr, "[bwa_read_seq] %.1f%% bases are trimmed.\n", 100.0f * n_trimmed/n_tot); |
| 140 |
if (n_seqs == 0) { |
| 141 |
free(seqs); |
| 142 |
bam_destroy1(b); |
| 143 |
return 0; |
| 144 |
} |
| 145 |
bam_destroy1(b); |
| 146 |
return seqs; |
| 147 |
} |
| 148 |
|
| 149 |
#define BARCODE_LOW_QUAL 13 |
| 150 |
|
| 151 |
bwa_seq_t *bwa_read_seq(bwa_seqio_t *bs, int n_needed, int *n, int mode, int trim_qual) |
| 152 |
{ |
| 153 |
bwa_seq_t *seqs, *p; |
| 154 |
kseq_t *seq = bs->ks; |
| 155 |
int n_seqs, l, i, is_comp = mode&BWA_MODE_COMPREAD, is_64 = mode&BWA_MODE_IL13, l_bc = mode>>24; |
| 156 |
long n_trimmed = 0, n_tot = 0; |
| 157 |
|
| 158 |
if (l_bc > BWA_MAX_BCLEN) { |
| 159 |
fprintf(stderr, "[%s] the maximum barcode length is %d.\n", __func__, BWA_MAX_BCLEN); |
| 160 |
return 0; |
| 161 |
} |
| 162 |
if (bs->is_bam) return bwa_read_bam(bs, n_needed, n, is_comp, trim_qual); // l_bc has no effect for BAM input |
| 163 |
n_seqs = 0; |
| 164 |
seqs = (bwa_seq_t*)calloc(n_needed, sizeof(bwa_seq_t)); |
| 165 |
while ((l = kseq_read(seq)) >= 0) { |
| 166 |
if ((mode & BWA_MODE_CFY) && (seq->comment.l != 0)) { |
| 167 |
// skip reads that are marked to be filtered by Casava |
| 168 |
char *s = index(seq->comment.s, ':'); |
| 169 |
if (s && *(++s) == 'Y') { |
| 170 |
continue; |
| 171 |
} |
| 172 |
} |
| 173 |
if (is_64 && seq->qual.l) |
| 174 |
for (i = 0; i < seq->qual.l; ++i) seq->qual.s[i] -= 31; |
| 175 |
if (seq->seq.l <= l_bc) continue; // sequence length equals or smaller than the barcode length |
| 176 |
p = &seqs[n_seqs++]; |
| 177 |
if (l_bc) { // then trim barcode |
| 178 |
for (i = 0; i < l_bc; ++i) |
| 179 |
p->bc[i] = (seq->qual.l && seq->qual.s[i]-33 < BARCODE_LOW_QUAL)? tolower(seq->seq.s[i]) : toupper(seq->seq.s[i]); |
| 180 |
p->bc[i] = 0; |
| 181 |
for (; i < seq->seq.l; ++i) |
| 182 |
seq->seq.s[i - l_bc] = seq->seq.s[i]; |
| 183 |
seq->seq.l -= l_bc; seq->seq.s[seq->seq.l] = 0; |
| 184 |
if (seq->qual.l) { |
| 185 |
for (i = l_bc; i < seq->qual.l; ++i) |
| 186 |
seq->qual.s[i - l_bc] = seq->qual.s[i]; |
| 187 |
seq->qual.l -= l_bc; seq->qual.s[seq->qual.l] = 0; |
| 188 |
} |
| 189 |
l = seq->seq.l; |
| 190 |
} else p->bc[0] = 0; |
| 191 |
p->tid = -1; // no assigned to a thread |
| 192 |
p->qual = 0; |
| 193 |
p->full_len = p->clip_len = p->len = l; |
| 194 |
n_tot += p->full_len; |
| 195 |
p->seq = (ubyte_t*)calloc(p->full_len, 1); |
| 196 |
for (i = 0; i != p->full_len; ++i) |
| 197 |
p->seq[i] = nst_nt4_table[(int)seq->seq.s[i]]; |
| 198 |
if (seq->qual.l) { // copy quality |
| 199 |
p->qual = (ubyte_t*)strdup((char*)seq->qual.s); |
| 200 |
if (trim_qual >= 1) n_trimmed += bwa_trim_read(trim_qual, p); |
| 201 |
} |
| 202 |
p->rseq = (ubyte_t*)calloc(p->full_len, 1); |
| 203 |
memcpy(p->rseq, p->seq, p->len); |
| 204 |
seq_reverse(p->len, p->seq, 0); // *IMPORTANT*: will be reversed back in bwa_refine_gapped() |
| 205 |
seq_reverse(p->len, p->rseq, is_comp); |
| 206 |
p->name = strdup((const char*)seq->name.s); |
| 207 |
{ // trim /[12]$ |
| 208 |
int t = seq->name.l; |
| 209 |
if (t > 2 && p->name[t-2] == '/' && (p->name[t-1] == '1' || p->name[t-1] == '2')) p->name[t-2] = '\0'; |
| 210 |
} |
| 211 |
if (n_seqs == n_needed) break; |
| 212 |
} |
| 213 |
*n = n_seqs; |
| 214 |
if (n_seqs && trim_qual >= 1) |
| 215 |
fprintf(stderr, "[bwa_read_seq] %.1f%% bases are trimmed.\n", 100.0f * n_trimmed/n_tot); |
| 216 |
if (n_seqs == 0) { |
| 217 |
free(seqs); |
| 218 |
return 0; |
| 219 |
} |
| 220 |
return seqs; |
| 221 |
} |
| 222 |
|
| 223 |
void bwa_free_read_seq(int n_seqs, bwa_seq_t *seqs) |
| 224 |
{ |
| 225 |
int i, j; |
| 226 |
for (i = 0; i != n_seqs; ++i) { |
| 227 |
bwa_seq_t *p = seqs + i; |
| 228 |
for (j = 0; j < p->n_multi; ++j) |
| 229 |
if (p->multi[j].cigar) free(p->multi[j].cigar); |
| 230 |
free(p->name); |
| 231 |
free(p->seq); free(p->rseq); free(p->qual); free(p->aln); free(p->md); free(p->multi); |
| 232 |
free(p->cigar); |
| 233 |
} |
| 234 |
free(seqs); |
| 235 |
} |