11 static int g_is_by_qname = 0;
13 static inline int strnum_cmp(const char *a, const char *b)
16 pa = (char*)a; pb = (char*)b;
18 if (isdigit(*pa) && isdigit(*pb)) {
20 ai = strtol(pa, &pa, 10);
21 bi = strtol(pb, &pb, 10);
22 if (ai != bi) return ai<bi? -1 : ai>bi? 1 : 0;
24 if (*pa != *pb) break;
29 return (pa-a) < (pb-b)? -1 : (pa-a) > (pb-b)? 1 : 0;
30 return *pa<*pb? -1 : *pa>*pb? 1 : 0;
33 #define HEAP_EMPTY 0xffffffffffffffffull
41 #define __pos_cmp(a, b) ((a).pos > (b).pos || ((a).pos == (b).pos && ((a).i > (b).i || ((a).i == (b).i && (a).idx > (b).idx))))
43 static inline int heap_lt(const heap1_t a, const heap1_t b)
47 if (a.b == 0 || b.b == 0) return a.b == 0? 1 : 0;
48 t = strnum_cmp(bam1_qname(a.b), bam1_qname(b.b));
49 return (t > 0 || (t == 0 && __pos_cmp(a, b)));
50 } else return __pos_cmp(a, b);
53 KSORT_INIT(heap, heap1_t, heap_lt)
55 static void swap_header_text(bam_header_t *h1, bam_header_t *h2)
59 tempi = h1->l_text, h1->l_text = h2->l_text, h2->l_text = tempi;
60 temps = h1->text, h1->text = h2->text, h2->text = temps;
64 #define MERGE_UNCOMP 2
67 @abstract Merge multiple sorted BAM.
68 @param is_by_qname whether to sort by query name
69 @param out output BAM file name
70 @param headers name of SAM file from which to copy '@' header lines,
71 or NULL to copy them from the first file to be merged
72 @param n number of files to be merged
73 @param fn names of files to be merged
75 @discussion Padding information may NOT correctly maintained. This
76 function is NOT thread safe.
78 int bam_merge_core(int by_qname, const char *out, const char *headers, int n, char * const *fn,
79 int flag, const char *reg)
83 bam_header_t *hout = 0;
84 bam_header_t *hheaders = NULL;
85 int i, j, *RG_len = 0;
91 tamFile fpheaders = sam_open(headers);
93 const char *message = strerror(errno);
94 fprintf(stderr, "[bam_merge_core] cannot open '%s': %s\n", headers, message);
97 hheaders = sam_header_read(fpheaders);
101 g_is_by_qname = by_qname;
102 fp = (bamFile*)calloc(n, sizeof(bamFile));
103 heap = (heap1_t*)calloc(n, sizeof(heap1_t));
104 iter = (bam_iter_t*)calloc(n, sizeof(bam_iter_t));
106 if (flag & MERGE_RG) {
107 RG = (char**)calloc(n, sizeof(void*));
108 RG_len = (int*)calloc(n, sizeof(int));
109 for (i = 0; i != n; ++i) {
110 int l = strlen(fn[i]);
111 const char *s = fn[i];
112 if (l > 4 && strcmp(s + l - 4, ".bam") == 0) l -= 4;
113 for (j = l - 1; j >= 0; --j) if (s[j] == '/') break;
115 RG[i] = calloc(l + 1, 1);
117 strncpy(RG[i], s + j, l);
121 for (i = 0; i != n; ++i) {
123 fp[i] = bam_open(fn[i], "r");
126 fprintf(stderr, "[bam_merge_core] fail to open file %s\n", fn[i]);
127 for (j = 0; j < i; ++j) bam_close(fp[j]);
128 free(fp); free(heap);
129 // FIXME: possible memory leak
132 hin = bam_header_read(fp[i]);
133 if (i == 0) { // the first SAM
136 // If the text headers to be swapped in include any @SQ headers,
137 // check that they are consistent with the existing binary list
138 // of reference information.
139 if (hheaders->n_targets > 0) {
140 if (hout->n_targets != hheaders->n_targets)
141 fprintf(stderr, "[bam_merge_core] number of @SQ headers in `%s' differs from number of target sequences", headers);
142 for (j = 0; j < hout->n_targets; ++j)
143 if (strcmp(hout->target_name[j], hheaders->target_name[j]) != 0)
144 fprintf(stderr, "[bam_merge_core] @SQ header '%s' in '%s' differs from target sequence", hheaders->target_name[j], headers);
146 swap_header_text(hout, hheaders);
147 bam_header_destroy(hheaders);
150 } else { // validate multiple baf
151 if (hout->n_targets != hin->n_targets) {
152 fprintf(stderr, "[bam_merge_core] file '%s' has different number of target sequences. Abort!\n", fn[i]);
155 for (j = 0; j < hout->n_targets; ++j) {
156 if (strcmp(hout->target_name[j], hin->target_name[j])) {
157 fprintf(stderr, "[bam_merge_core] different target sequence name: '%s' != '%s' in file '%s'. Abort!\n",
158 hout->target_name[j], hin->target_name[j], fn[i]);
162 bam_header_destroy(hin);
168 if (bam_parse_region(hout, reg, &tid, &beg, &end) < 0) {
169 fprintf(stderr, "[%s] Malformated region string or undefined reference name\n", __func__);
172 for (i = 0; i < n; ++i) {
174 idx = bam_index_load(fn[i]);
175 iter[i] = bam_iter_query(idx, tid, beg, end);
176 bam_index_destroy(idx);
180 for (i = 0; i < n; ++i) {
181 heap1_t *h = heap + i;
183 h->b = (bam1_t*)calloc(1, sizeof(bam1_t));
184 if (bam_iter_read(fp[i], iter[i], h->b) >= 0) {
185 h->pos = ((uint64_t)h->b->core.tid<<32) | (uint32_t)h->b->core.pos<<1 | bam1_strand(h->b);
188 else h->pos = HEAP_EMPTY;
190 if (flag & MERGE_UNCOMP) {
191 fpout = strcmp(out, "-")? bam_open(out, "wu") : bam_dopen(fileno(stdout), "wu");
193 fpout = strcmp(out, "-")? bam_open(out, "w") : bam_dopen(fileno(stdout), "w");
196 fprintf(stderr, "[%s] fail to create the output file.\n", __func__);
199 bam_header_write(fpout, hout);
200 bam_header_destroy(hout);
202 ks_heapmake(heap, n, heap);
203 while (heap->pos != HEAP_EMPTY) {
205 if ((flag & MERGE_RG) && bam_aux_get(b, "RG") == 0)
206 bam_aux_append(b, "RG", 'Z', RG_len[heap->i] + 1, (uint8_t*)RG[heap->i]);
207 bam_write1_core(fpout, &b->core, b->data_len, b->data);
208 if ((j = bam_iter_read(fp[heap->i], iter[heap->i], b)) >= 0) {
209 heap->pos = ((uint64_t)b->core.tid<<32) | (uint32_t)b->core.pos<<1 | bam1_strand(b);
211 } else if (j == -1) {
212 heap->pos = HEAP_EMPTY;
213 free(heap->b->data); free(heap->b);
215 } else fprintf(stderr, "[bam_merge_core] '%s' is truncated. Continue anyway.\n", fn[heap->i]);
216 ks_heapadjust(heap, 0, n, heap);
219 if (flag & MERGE_RG) {
220 for (i = 0; i != n; ++i) free(RG[i]);
221 free(RG); free(RG_len);
223 for (i = 0; i != n; ++i) {
224 bam_iter_destroy(iter[i]);
228 free(fp); free(heap); free(iter);
232 int bam_merge(int argc, char *argv[])
234 int c, is_by_qname = 0, flag = 0, ret = 0;
235 char *fn_headers = NULL, *reg = 0;
237 while ((c = getopt(argc, argv, "h:nruR:")) >= 0) {
239 case 'r': flag |= MERGE_RG; break;
240 case 'h': fn_headers = strdup(optarg); break;
241 case 'n': is_by_qname = 1; break;
242 case 'u': flag |= MERGE_UNCOMP; break;
243 case 'R': reg = strdup(optarg); break;
246 if (optind + 2 >= argc) {
247 fprintf(stderr, "\n");
248 fprintf(stderr, "Usage: samtools merge [-nr] [-h inh.sam] <out.bam> <in1.bam> <in2.bam> [...]\n\n");
249 fprintf(stderr, "Options: -n sort by read names\n");
250 fprintf(stderr, " -r attach RG tag (inferred from file names)\n");
251 fprintf(stderr, " -u uncompressed BAM output\n");
252 fprintf(stderr, " -R STR merge file in the specified region STR [all]\n");
253 fprintf(stderr, " -h FILE copy the header in FILE to <out.bam> [in1.bam]\n\n");
254 fprintf(stderr, "Note: Samtools' merge does not reconstruct the @RG dictionary in the header. Users\n");
255 fprintf(stderr, " must provide the correct header with -h, or uses Picard which properly maintains\n");
256 fprintf(stderr, " the header dictionary in merging.\n\n");
259 if (bam_merge_core(is_by_qname, argv[optind], fn_headers, argc - optind - 1, argv + optind + 1, flag, reg) < 0) ret = 1;
265 typedef bam1_t *bam1_p;
267 static inline int bam1_lt(const bam1_p a, const bam1_p b)
270 int t = strnum_cmp(bam1_qname(a), bam1_qname(b));
271 return (t < 0 || (t == 0 && (((uint64_t)a->core.tid<<32|a->core.pos) < ((uint64_t)b->core.tid<<32|b->core.pos))));
272 } else return (((uint64_t)a->core.tid<<32|a->core.pos) < ((uint64_t)b->core.tid<<32|b->core.pos));
274 KSORT_INIT(sort, bam1_p, bam1_lt)
276 static void sort_blocks(int n, int k, bam1_p *buf, const char *prefix, const bam_header_t *h, int is_stdout)
281 ks_mergesort(sort, k, buf, 0);
282 name = (char*)calloc(strlen(prefix) + 20, 1);
283 if (n >= 0) sprintf(name, "%s.%.4d.bam", prefix, n);
284 else sprintf(name, "%s.bam", prefix);
285 fp = is_stdout? bam_dopen(fileno(stdout), "w") : bam_open(name, "w");
287 fprintf(stderr, "[sort_blocks] fail to create file %s.\n", name);
289 // FIXME: possible memory leak
293 bam_header_write(fp, h);
294 for (i = 0; i < k; ++i)
295 bam_write1_core(fp, &buf[i]->core, buf[i]->data_len, buf[i]->data);
300 @abstract Sort an unsorted BAM file based on the chromosome order
301 and the leftmost position of an alignment
303 @param is_by_qname whether to sort by query name
304 @param fn name of the file to be sorted
305 @param prefix prefix of the output and the temporary files; upon
306 sucessess, prefix.bam will be written.
307 @param max_mem approxiate maximum memory (very inaccurate)
309 @discussion It may create multiple temporary subalignment files
310 and then merge them by calling bam_merge_core(). This function is
313 void bam_sort_core_ext(int is_by_qname, const char *fn, const char *prefix, size_t max_mem, int is_stdout)
317 bam_header_t *header;
321 g_is_by_qname = is_by_qname;
323 fp = strcmp(fn, "-")? bam_open(fn, "r") : bam_dopen(fileno(stdin), "r");
325 fprintf(stderr, "[bam_sort_core] fail to open file %s\n", fn);
328 header = bam_header_read(fp);
329 buf = (bam1_t**)calloc(max_mem / BAM_CORE_SIZE, sizeof(bam1_t*));
332 if (buf[k] == 0) buf[k] = (bam1_t*)calloc(1, sizeof(bam1_t));
334 if ((ret = bam_read1(fp, b)) < 0) break;
337 if (mem >= max_mem) {
338 sort_blocks(n++, k, buf, prefix, header, 0);
343 fprintf(stderr, "[bam_sort_core] truncated file. Continue anyway.\n");
344 if (n == 0) sort_blocks(-1, k, buf, prefix, header, is_stdout);
347 fprintf(stderr, "[bam_sort_core] merging from %d files...\n", n+1);
348 sort_blocks(n++, k, buf, prefix, header, 0);
349 fnout = (char*)calloc(strlen(prefix) + 20, 1);
350 if (is_stdout) sprintf(fnout, "-");
351 else sprintf(fnout, "%s.bam", prefix);
352 fns = (char**)calloc(n, sizeof(char*));
353 for (i = 0; i < n; ++i) {
354 fns[i] = (char*)calloc(strlen(prefix) + 20, 1);
355 sprintf(fns[i], "%s.%.4d.bam", prefix, i);
357 bam_merge_core(is_by_qname, fnout, 0, n, fns, 0, 0);
359 for (i = 0; i < n; ++i) {
365 for (k = 0; k < max_mem / BAM_CORE_SIZE; ++k) {
372 bam_header_destroy(header);
376 void bam_sort_core(int is_by_qname, const char *fn, const char *prefix, size_t max_mem)
378 bam_sort_core_ext(is_by_qname, fn, prefix, max_mem, 0);
381 int bam_sort(int argc, char *argv[])
383 size_t max_mem = 500000000;
384 int c, is_by_qname = 0, is_stdout = 0;
385 while ((c = getopt(argc, argv, "nom:")) >= 0) {
387 case 'o': is_stdout = 1; break;
388 case 'n': is_by_qname = 1; break;
389 case 'm': max_mem = atol(optarg); break;
392 if (optind + 2 > argc) {
393 fprintf(stderr, "Usage: samtools sort [-on] [-m <maxMem>] <in.bam> <out.prefix>\n");
396 bam_sort_core_ext(is_by_qname, argv[optind], argv[optind+1], max_mem, is_stdout);