forked from samtools/samtools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
bam_split.c
486 lines (424 loc) · 13.7 KB
/
bam_split.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
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
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
/* The MIT License
*
* Copyright (c) 2013, 2014 Genome Research Limited.
*
* 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.
*/
/* Contact: Martin Pollard <[email protected]> */
#include <htslib/sam.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <limits.h>
#include <assert.h>
#include <unistd.h>
#include <regex.h>
#include <htslib/khash.h>
#include <htslib/kstring.h>
KHASH_MAP_INIT_STR(c2i, int)
struct parsed_opts {
char* merged_input_name;
char* unaccounted_header_name;
char* unaccounted_name;
char* output_format_string;
bool verbose;
};
typedef struct parsed_opts parsed_opts_t;
struct state {
samFile* merged_input_file;
bam_hdr_t* merged_input_header;
samFile* unaccounted_file;
bam_hdr_t* unaccounted_header;
size_t output_count;
char** rg_id;
samFile** rg_output_file;
bam_hdr_t** rg_output_header;
kh_c2i_t* rg_hash;
};
typedef struct state state_t;
static void cleanup_state(state_t* status);
static void cleanup_opts(parsed_opts_t* opts);
static void usage(bool error)
{
FILE* write_to = error ? stderr : stdout;
fprintf(write_to,
"Usage: samtools split [-v] [-f <format string>] [-u <unaccounted.bam>[:<unaccounted_header.sam>]] <merged.bam>\n\n"
"Where:\n"
"<merged.bam> is your file to separate out into individual read groups.\n"
"Options:\n"
"\t-v verbose output.\n"
"\t-f STRING output filename format string: [\"%%*_%%#.bam\")]\n"
"\t %%%% %%\n"
"\t %%* basename\n"
"\t %%# @RG index\n"
"\t %%! @RG ID\n"
"\t-u FILE1[:FILE2] put reads where no RG tag is set or the RG tag is unrecognised in FILE1 and optionally override the header with FILE2.\n"
);
}
// Takes the command line options and turns them into something we can understand
static parsed_opts_t* parse_args(int argc, char** argv)
{
if (argc == 1) { usage(false); return NULL; }
const char* optstring = "vf:u:";
parsed_opts_t* retval = calloc(sizeof(parsed_opts_t), 1);
if (! retval ) { perror("cannot allocate option parsing memory"); return NULL; }
int opt;
while ((opt = getopt(argc, argv, optstring)) != -1) {
switch (opt) {
case 'f':
retval->output_format_string = strdup(optarg);
if (! retval->output_format_string ) { perror("cannot allocate output format string memory"); return NULL; }
break;
case 'v':
retval->verbose = true;
break;
case 'u':
{
char* sep = strdup(optarg);
if (!sep ) { perror("cannot allocate string memory"); return NULL; }
retval->unaccounted_name = strsep(&sep, ":");
retval->unaccounted_header_name = sep;
break;
}
default:
usage(false);
free(retval);
return NULL;
}
}
if (retval->output_format_string == NULL) retval->output_format_string = strdup("%*_%#.bam");
argc -= optind;
argv += optind;
if (argc != 1) {
fprintf(stderr, "Invalid number of arguments: %d\n", argc);
usage(true);
free(retval);
return NULL;
}
retval->merged_input_name = strdup(argv[0]);
if (! retval->merged_input_name ) { perror("cannot allocate string memory"); return NULL; }
return retval;
}
// Expands a output filename format string
static char* expand_format_string(const char* format_string, const char* basename, const char* rg_id, const int rg_idx)
{
kstring_t str = { 0, 0, NULL };
const char* pointer = format_string;
const char* next;
while ((next = strchr(pointer, '%')) != NULL) {
kputsn(pointer, next-pointer, &str);
++next;
switch (*next) {
case '%':
kputc('%', &str);
break;
case '*':
kputs(basename, &str);
break;
case '#':
kputl(rg_idx, &str);
break;
case '!':
kputs(rg_id, &str);
break;
case '\0':
// Error is: fprintf(stderr, "bad format string, trailing %%\n");
return NULL;
default:
// Error is: fprintf(stderr, "bad format string, unknown format specifier\n");
return NULL;
}
pointer = next + 1;
}
kputs(pointer, &str);
return ks_str(&str);
}
// Parse the header, count the number of RG tags and return a list of their names
static bool count_RG(bam_hdr_t* hdr, size_t* count, char*** output_name)
{
if (hdr->l_text < 3 ) {
*count = 0;
*output_name = NULL;
return true;
}
char* input = strndup(hdr->text, hdr->l_text);
if ( input == NULL ) {
return false;
}
//////////////////////////////////////////
// First stage count number of @RG tags //
//////////////////////////////////////////
char* pointer = input;
size_t n_rg = 0;
// Guard against rare case where @RG is first header line
// This shouldn't happen but could where @HD is omitted
if (pointer[0] == '@' && pointer[1] == 'R' && pointer[2] == 'G' ) {
++n_rg;
pointer += 3;
}
char* line;
while ((line = strstr(pointer, "\n@RG")) != NULL) {
++n_rg;
pointer = line + 1;
}
//////////////////////////////////
// Second stage locate @RG ID's //
//////////////////////////////////
char** names = (char**)calloc(sizeof(char*), n_rg);
size_t next = 0;
regex_t rg_finder;
if (regcomp(&rg_finder, "^@RG.*\tID:([!-)+-<>-~][ !-~]*)(\t.*$|$)", REG_EXTENDED|REG_NEWLINE) != 0) {
free(input);
free(names);
return false;
}
regmatch_t* matches = (regmatch_t*)calloc(sizeof(regmatch_t),2);
int error;
char* begin = input;
while ((error = regexec(&rg_finder, begin, 2, matches, 0)) == 0) {
names[next++] = strndup(begin+matches[1].rm_so, matches[1].rm_eo-matches[1].rm_so);
begin += matches[0].rm_eo;
}
if (error != REG_NOMATCH) {
// cleanup
regfree(&rg_finder);
free(matches);
free(names);
free(input);
return false;
}
free(matches);
// return results
*count = n_rg;
*output_name = names;
regfree(&rg_finder);
free(input);
return true;
}
// Filters a header of @RG lines where ID != id_keep
// TODO: strip @PG's descended from other RGs and their descendants
static bool filter_header_rg(bam_hdr_t* hdr, const char* id_keep)
{
kstring_t str = {0, 0, NULL};
regex_t rg_finder;
if (regcomp(&rg_finder, "^@RG.*\tID:([!-)+-<>-~][ !-~]*)(\t.*$|$)", REG_EXTENDED|REG_NEWLINE) != 0) {
return false;
}
// regex vars
char* header = hdr->text;
regmatch_t* matches = (regmatch_t*)calloc(sizeof(regmatch_t),2);
int error;
while ((error = regexec(&rg_finder, header, 2, matches, 0)) == 0) {
kputsn(header, matches[0].rm_so, &str); // copy header up until the found RG line
char* found_id = strndup(header+matches[1].rm_so, matches[1].rm_eo-matches[1].rm_so); // extract ID
// if it matches keep keep it, else we can just ignore it
if (!strcmp(found_id, id_keep)) {
kputsn(header+matches[0].rm_so, (matches[0].rm_eo+1)-matches[0].rm_so, &str);
}
free(found_id);
// move pointer forward
header += matches[0].rm_eo+1;
}
// cleanup
free(matches);
regfree(&rg_finder);
// Did we leave loop because of an error?
if (error != REG_NOMATCH) {
return false;
}
// Write remainder of string
kputs(header, &str);
// Modify header
hdr->l_text = ks_len(&str);
free(hdr->text);
hdr->text = ks_release(&str);
return true;
}
// Set the initial state
static state_t* init(parsed_opts_t* opts)
{
state_t* retval = calloc(sizeof(state_t), 1);
if (!retval) {
fprintf(stderr, "Out of memory");
return NULL;
}
retval->merged_input_file = sam_open(opts->merged_input_name, "rb");
if (!retval->merged_input_file) {
fprintf(stderr, "Could not open input file (%s)\n", opts->merged_input_name);
return NULL;
}
retval->merged_input_header = sam_hdr_read(retval->merged_input_file);
if (opts->unaccounted_name) {
if (opts->unaccounted_header_name) {
samFile* hdr_load = sam_open(opts->unaccounted_header_name, "r");
if (!hdr_load) {
fprintf(stderr, "Could not open unaccounted header file (%s)\n", opts->unaccounted_header_name);
return NULL;
}
retval->unaccounted_header = sam_hdr_read(hdr_load);
sam_close(hdr_load);
} else {
retval->unaccounted_header = bam_hdr_dup(retval->merged_input_header);
}
retval->unaccounted_file = sam_open(opts->unaccounted_name, "wb");
if (retval->unaccounted_file == NULL) {
fprintf(stderr, "Could not open unaccounted output file: %s\n", opts->unaccounted_name);
cleanup_state(retval);
return NULL;
}
}
// Open output files for RGs
if (!count_RG(retval->merged_input_header, &retval->output_count, &retval->rg_id)) return NULL;
if (opts->verbose) fprintf(stderr, "@RG's found %zu\n",retval->output_count);
retval->rg_output_file = (samFile**)calloc(retval->output_count, sizeof(samFile*));
retval->rg_output_header = (bam_hdr_t**)calloc(retval->output_count, sizeof(bam_hdr_t*));
retval->rg_hash = kh_init_c2i();
if (!retval->rg_output_file || !retval->rg_output_header) {
fprintf(stderr, "Could not allocate memory for output file array. Out of memory?");
free(retval);
return NULL;
}
char* dirsep = strrchr(opts->merged_input_name, '/');
char* input_base_name = strdup(dirsep? dirsep+1 : opts->merged_input_name);
if (!input_base_name) {
fprintf(stderr, "Out of memory\n");
return NULL;
}
char* extension = strrchr(input_base_name, '.');
if (extension) *extension = '\0';
size_t i;
for (i = 0; i < retval->output_count; i++) {
char* output_filename = NULL;
if ( ( output_filename = expand_format_string(opts->output_format_string, input_base_name, retval->rg_id[i], i) ) == NULL) {
fprintf(stderr, "Error expanding output filename format string.\r\n");
return NULL;
}
retval->rg_output_file[i] = sam_open(output_filename, "wb");
if (retval->rg_output_file[i] == NULL) {
fprintf(stderr, "Could not open output file: %s\r\n", output_filename);
return NULL;
}
// Record index in hash
int ret;
khiter_t iter = kh_put_c2i(retval->rg_hash, retval->rg_id[i], &ret);
kh_val(retval->rg_hash,iter) = i;
free(output_filename);
// Set and edit header
retval->rg_output_header[i] = bam_hdr_dup(retval->merged_input_header);
if ( !filter_header_rg(retval->rg_output_header[i], retval->rg_id[i]) ) {
fprintf(stderr, "Could not rewrite header for file: %s\r\n", output_filename);
return NULL;
}
}
free(input_base_name);
return retval;
}
static bool split(state_t* state)
{
if (state->unaccounted_file && sam_hdr_write(state->unaccounted_file, state->unaccounted_header) != 0) {
fprintf(stderr, "Could not write output file header\n");
return false;
}
size_t i;
for (i = 0; i < state->output_count; i++) {
if (sam_hdr_write(state->rg_output_file[i], state->rg_output_header[i]) != 0) {
fprintf(stderr, "Could not write output file header\n");
return false;
}
}
bam1_t* file_read = bam_init1();
// Read the first record
if (sam_read1(state->merged_input_file, state->merged_input_header, file_read) < 0) {
// Nothing more to read? Ignore this file
bam_destroy1(file_read);
file_read = NULL;
}
while (file_read != NULL) {
// Get RG tag from read and look it up in hash to find file to output it to
uint8_t* tag = bam_aux_get(file_read, "RG");
khiter_t iter;
if ( tag != NULL ) {
char* rg = bam_aux2Z(tag);
iter = kh_get_c2i(state->rg_hash, rg);
} else {
iter = kh_end(state->rg_hash);
}
// Write the read out to correct file
if (iter != kh_end(state->rg_hash)) {
// if found write to the appropriate untangled bam
int i = kh_val(state->rg_hash,iter);
sam_write1(state->rg_output_file[i], state->rg_output_header[i], file_read);
} else {
// otherwise write to the unaccounted bam if there is one or fail
if (state->unaccounted_file == NULL) {
if (tag) {
fprintf(stderr, "Read \"%s\" with unaccounted for tag \"%s\".\n", bam_get_qname(file_read), bam_aux2Z(tag));
} else {
fprintf(stderr, "Read \"%s\" has no RG tag.\n", bam_get_qname(file_read));
}
bam_destroy1(file_read);
return false;
} else {
sam_write1(state->unaccounted_file, state->unaccounted_header, file_read);
}
}
// Replace written read with the next one to process
if (sam_read1(state->merged_input_file, state->merged_input_header, file_read) < 0) {
// Nothing more to read? Ignore this file in future
bam_destroy1(file_read);
file_read = NULL;
}
}
return true;
}
static void cleanup_state(state_t* status)
{
if (status->unaccounted_file) sam_close(status->unaccounted_file);
sam_close(status->merged_input_file);
size_t i;
for (i = 0; i < status->output_count; i++) {
bam_hdr_destroy(status->rg_output_header[i]);
sam_close(status->rg_output_file[i]);
}
bam_hdr_destroy(status->merged_input_header);
free(status->rg_output_header);
free(status->rg_output_file);
kh_destroy_c2i(status->rg_hash);
}
static void cleanup_opts(parsed_opts_t* opts)
{
free(opts->merged_input_name);
free(opts->unaccounted_header_name);
free(opts->unaccounted_name);
free(opts->output_format_string);
}
int main_split(int argc, char** argv)
{
parsed_opts_t* opts = parse_args(argc, argv);
if (!opts ) return 1;
state_t* status = init(opts);
if (!status) return 1;
if (!split(status)) return 1;
cleanup_state(status);
cleanup_opts(opts);
return 0;
}