forked from samtools/samtools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
bam_rmdup.c
325 lines (290 loc) · 10.4 KB
/
bam_rmdup.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
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
/* bam_rmdup.c -- duplicate read detection.
Copyright (C) 2009, 2015, 2016, 2019 Genome Research Ltd.
Portions copyright (C) 2009 Broad Institute.
Author: Heng Li <lh3@sanger.ac.uk>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. */
#include <config.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <zlib.h>
#include <unistd.h>
#include "htslib/sam.h"
#include "sam_opts.h"
#include "samtools.h"
#include "bam.h" // for bam_get_library
typedef bam1_t *bam1_p;
#include "htslib/khash.h"
KHASH_SET_INIT_STR(name)
KHASH_MAP_INIT_INT64(pos, bam1_p)
#define BUFFER_SIZE 0x40000
typedef struct {
uint64_t n_checked, n_removed;
khash_t(pos) *best_hash;
} lib_aux_t;
KHASH_MAP_INIT_STR(lib, lib_aux_t)
typedef struct {
int n, max;
bam1_t **a;
} tmp_stack_t;
static inline void stack_insert(tmp_stack_t *stack, bam1_t *b)
{
if (stack->n == stack->max) {
stack->max = stack->max? stack->max<<1 : 0x10000;
stack->a = (bam1_t**)realloc(stack->a, sizeof(bam1_t*) * stack->max);
}
stack->a[stack->n++] = b;
}
static inline int dump_best(tmp_stack_t *stack, samFile *out, sam_hdr_t *hdr)
{
int i;
for (i = 0; i != stack->n; ++i) {
if (sam_write1(out, hdr, stack->a[i]) < 0) return -1;
bam_destroy1(stack->a[i]);
stack->a[i] = NULL;
}
stack->n = 0;
return 0;
}
static inline void clear_stack(tmp_stack_t *stack) {
int i;
if (!stack->a) return;
for (i = 0; i != stack->n; ++i) {
bam_destroy1(stack->a[i]);
}
}
static void clear_del_set(khash_t(name) *del_set)
{
khint_t k;
for (k = kh_begin(del_set); k < kh_end(del_set); ++k)
if (kh_exist(del_set, k))
free((char*)kh_key(del_set, k));
kh_clear(name, del_set);
}
static lib_aux_t *get_aux(khash_t(lib) *aux, const char *lib)
{
khint_t k = kh_get(lib, aux, lib);
if (k == kh_end(aux)) {
int ret;
char *p = strdup(lib);
lib_aux_t *q;
k = kh_put(lib, aux, p, &ret);
q = &kh_val(aux, k);
q->n_checked = q->n_removed = 0;
q->best_hash = kh_init(pos);
return q;
} else return &kh_val(aux, k);
}
static void clear_best(khash_t(lib) *aux, int max)
{
khint_t k;
for (k = kh_begin(aux); k != kh_end(aux); ++k) {
if (kh_exist(aux, k)) {
lib_aux_t *q = &kh_val(aux, k);
if (kh_size(q->best_hash) >= max)
kh_clear(pos, q->best_hash);
}
}
}
static inline int sum_qual(const bam1_t *b)
{
int i, q;
uint8_t *qual = bam_get_qual(b);
for (i = q = 0; i < b->core.l_qseq; ++i) q += qual[i];
return q;
}
int bam_rmdup_core(samFile *in, sam_hdr_t *hdr, samFile *out)
{
bam1_t *b = NULL;
int last_tid = -1, last_pos = -1, r;
tmp_stack_t stack;
khint_t k;
khash_t(lib) *aux = NULL;
khash_t(name) *del_set = NULL;
memset(&stack, 0, sizeof(tmp_stack_t));
aux = kh_init(lib);
del_set = kh_init(name);
b = bam_init1();
if (!aux || !del_set || !b) {
perror(__func__);
goto fail;
}
kh_resize(name, del_set, 4 * BUFFER_SIZE);
while ((r = sam_read1(in, hdr, b)) >= 0) {
bam1_core_t *c = &b->core;
if (c->tid != last_tid || last_pos != c->pos) {
if (dump_best(&stack, out, hdr) < 0) goto write_fail; // write the result
clear_best(aux, BUFFER_SIZE);
if (c->tid != last_tid) {
clear_best(aux, 0);
if (kh_size(del_set)) { // check
fprintf(stderr, "[bam_rmdup_core] %llu unmatched pairs\n", (long long)kh_size(del_set));
clear_del_set(del_set);
}
if ((int)c->tid == -1) { // append unmapped reads
if (sam_write1(out, hdr, b) < 0) goto write_fail;
while ((r = sam_read1(in, hdr, b)) >= 0) {
if (sam_write1(out, hdr, b) < 0) goto write_fail;
}
break;
}
last_tid = c->tid;
fprintf(stderr, "[bam_rmdup_core] processing reference %s...\n", sam_hdr_tid2name(hdr, c->tid));
}
}
if (!(c->flag&BAM_FPAIRED) || (c->flag&(BAM_FUNMAP|BAM_FMUNMAP)) || (c->mtid >= 0 && c->tid != c->mtid)) {
if (sam_write1(out, hdr, b) < 0) goto write_fail;
} else if (c->isize > 0) { // paired, head
uint64_t key = (uint64_t)c->pos<<32 | c->isize;
const char *lib;
lib_aux_t *q;
int ret;
lib = bam_get_library(hdr, b);
q = lib? get_aux(aux, lib) : get_aux(aux, "\t");
++q->n_checked;
k = kh_put(pos, q->best_hash, key, &ret);
if (ret < 0) goto fail;
if (ret == 0) { // found in best_hash
bam1_t *p = kh_val(q->best_hash, k);
++q->n_removed;
if (sum_qual(p) < sum_qual(b)) { // the current alignment is better; this can be accelerated in principle
kh_put(name, del_set, strdup(bam_get_qname(p)), &ret); // p will be removed
if (ret < 0) goto fail;
if (bam_copy1(p, b) == NULL) goto fail; // replaced as b
} else kh_put(name, del_set, strdup(bam_get_qname(b)), &ret); // b will be removed
if (ret < 0) goto fail;
if (ret == 0)
fprintf(stderr, "[bam_rmdup_core] inconsistent BAM file for pair '%s'. Continue anyway.\n", bam_get_qname(b));
} else { // not found in best_hash
kh_val(q->best_hash, k) = bam_dup1(b);
stack_insert(&stack, kh_val(q->best_hash, k));
}
} else { // paired, tail
k = kh_get(name, del_set, bam_get_qname(b));
if (k != kh_end(del_set)) {
free((char*)kh_key(del_set, k));
kh_del(name, del_set, k);
} else {
if (sam_write1(out, hdr, b) < 0) goto write_fail;
}
}
last_pos = c->pos;
}
if (r < -1) {
fprintf(stderr, "[%s] failed to read input file\n", __func__);
goto fail;
}
for (k = kh_begin(aux); k != kh_end(aux); ++k) {
if (kh_exist(aux, k)) {
lib_aux_t *q = &kh_val(aux, k);
if (dump_best(&stack, out, hdr) < 0) goto write_fail;
fprintf(stderr, "[bam_rmdup_core] %lld / %lld = %.4lf in library '%s'\n", (long long)q->n_removed,
(long long)q->n_checked, (double)q->n_removed/q->n_checked, kh_key(aux, k));
kh_destroy(pos, q->best_hash);
free((char*)kh_key(aux, k));
kh_del(lib, aux, k);
}
}
kh_destroy(lib, aux);
clear_del_set(del_set);
kh_destroy(name, del_set);
free(stack.a);
bam_destroy1(b);
return 0;
write_fail:
print_error_errno("rmdup", "failed to write record");
fail:
clear_stack(&stack);
free(stack.a);
if (aux) {
for (k = kh_begin(aux); k != kh_end(aux); ++k) {
if (kh_exist(aux, k)) {
lib_aux_t *q = &kh_val(aux, k);
kh_destroy(pos, q->best_hash);
free((char*)kh_key(aux, k));
}
}
kh_destroy(lib, aux);
}
if (del_set) {
clear_del_set(del_set);
kh_destroy(name, del_set);
}
bam_destroy1(b);
return 1;
}
int bam_rmdupse_core(samFile *in, sam_hdr_t *hdr, samFile *out, int force_se);
static int rmdup_usage(void) {
fprintf(stderr, "\n");
fprintf(stderr, "Usage: samtools rmdup [-sS] <input.srt.bam> <output.bam>\n\n");
fprintf(stderr, "Option: -s rmdup for SE reads\n");
fprintf(stderr, " -S treat PE reads as SE in rmdup (force -s)\n");
sam_global_opt_help(stderr, "-....--.");
return 1;
}
int bam_rmdup(int argc, char *argv[])
{
int c, ret, is_se = 0, force_se = 0;
samFile *in, *out;
sam_hdr_t *header;
char wmode[3] = {'w', 'b', 0};
sam_global_args ga = SAM_GLOBAL_ARGS_INIT;
static const struct option lopts[] = {
SAM_OPT_GLOBAL_OPTIONS('-', 0, 0, 0, 0, '-'),
{ NULL, 0, NULL, 0 }
};
while ((c = getopt_long(argc, argv, "sS", lopts, NULL)) >= 0) {
switch (c) {
case 's': is_se = 1; break;
case 'S': force_se = is_se = 1; break;
default: if (parse_sam_global_opt(c, optarg, lopts, &ga) == 0) break;
/* else fall-through */
case '?': return rmdup_usage();
}
}
if (optind + 2 > argc)
return rmdup_usage();
in = sam_open_format(argv[optind], "r", &ga.in);
if (!in) {
print_error_errno("rmdup", "failed to open \"%s\" for input", argv[optind]);
return 1;
}
header = sam_hdr_read(in);
if (header == NULL || sam_hdr_nref(header) == 0) {
fprintf(stderr, "[bam_rmdup] input SAM does not have header. Abort!\n");
return 1;
}
sam_open_mode(wmode+1, argv[optind+1], NULL);
out = sam_open_format(argv[optind+1], wmode, &ga.out);
if (!out) {
print_error_errno("rmdup", "failed to open \"%s\" for output", argv[optind+1]);
return 1;
}
if (sam_hdr_write(out, header) < 0) {
print_error_errno("rmdup", "failed to write header");
return 1;
}
if (is_se) ret = bam_rmdupse_core(in, header, out, force_se);
else ret = bam_rmdup_core(in, header, out);
sam_hdr_destroy(header);
sam_close(in);
if (sam_close(out) < 0) {
fprintf(stderr, "[bam_rmdup] error closing output file\n");
ret = 1;
}
return ret;
}