10 static int g_is_by_qname = 0;
12 static inline int strnum_cmp(const char *a, const char *b)
15 pa = (char*)a; pb = (char*)b;
17 if (isdigit(*pa) && isdigit(*pb)) {
19 ai = strtol(pa, &pa, 10);
20 bi = strtol(pb, &pb, 10);
21 if (ai != bi) return ai<bi? -1 : ai>bi? 1 : 0;
23 if (*pa != *pb) break;
28 return (pa-a) < (pb-b)? -1 : (pa-a) > (pb-b)? 1 : 0;
29 return *pa<*pb? -1 : *pa>*pb? 1 : 0;
32 #define HEAP_EMPTY 0xffffffffffffffffull
40 #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))))
42 static inline int heap_lt(const heap1_t a, const heap1_t b)
46 if (a.b == 0 || b.b == 0) return a.b == 0? 1 : 0;
47 t = strnum_cmp(bam1_qname(a.b), bam1_qname(b.b));
48 return (t > 0 || (t == 0 && __pos_cmp(a, b)));
49 } else return __pos_cmp(a, b);
52 KSORT_INIT(heap, heap1_t, heap_lt)
54 static void swap_header_text(bam_header_t *h1, bam_header_t *h2)
58 tempi = h1->l_text, h1->l_text = h2->l_text, h2->l_text = tempi;
59 temps = h1->text, h1->text = h2->text, h2->text = temps;
63 #define MERGE_UNCOMP 2
66 @abstract Merge multiple sorted BAM.
67 @param is_by_qname whether to sort by query name
68 @param out output BAM file name
69 @param headers name of SAM file from which to copy '@' header lines,
70 or NULL to copy them from the first file to be merged
71 @param n number of files to be merged
72 @param fn names of files to be merged
74 @discussion Padding information may NOT correctly maintained. This
75 function is NOT thread safe.
77 int bam_merge_core(int by_qname, const char *out, const char *headers, int n, char * const *fn,
78 int flag, const char *reg)
82 bam_header_t *hout = 0;
83 bam_header_t *hheaders = NULL;
84 int i, j, *RG_len = 0;
90 tamFile fpheaders = sam_open(headers);
92 fprintf(stderr, "[bam_merge_core] Cannot open file `%s'. Continue anyway.\n", headers);
94 hheaders = sam_header_read(fpheaders);
99 g_is_by_qname = by_qname;
100 fp = (bamFile*)calloc(n, sizeof(bamFile));
101 heap = (heap1_t*)calloc(n, sizeof(heap1_t));
102 iter = (bam_iter_t*)calloc(n, sizeof(bam_iter_t));
104 if (flag & MERGE_RG) {
105 RG = (char**)calloc(n, sizeof(void*));
106 RG_len = (int*)calloc(n, sizeof(int));
107 for (i = 0; i != n; ++i) {
108 int l = strlen(fn[i]);
109 const char *s = fn[i];
110 if (l > 4 && strcmp(s + l - 4, ".bam") == 0) l -= 4;
111 for (j = l - 1; j >= 0; --j) if (s[j] == '/') break;
113 RG[i] = calloc(l + 1, 1);
115 strncpy(RG[i], s + j, l);
119 for (i = 0; i != n; ++i) {
121 fp[i] = bam_open(fn[i], "r");
124 fprintf(stderr, "[bam_merge_core] fail to open file %s\n", fn[i]);
125 for (j = 0; j < i; ++j) bam_close(fp[j]);
126 free(fp); free(heap);
127 // FIXME: possible memory leak
130 hin = bam_header_read(fp[i]);
131 if (i == 0) { // the first SAM
134 // If the text headers to be swapped in include any @SQ headers,
135 // check that they are consistent with the existing binary list
136 // of reference information.
137 if (hheaders->n_targets > 0) {
138 if (hout->n_targets != hheaders->n_targets)
139 fprintf(stderr, "[bam_merge_core] number of @SQ headers in `%s' differs from number of target sequences", headers);
140 for (j = 0; j < hout->n_targets; ++j)
141 if (strcmp(hout->target_name[j], hheaders->target_name[j]) != 0)
142 fprintf(stderr, "[bam_merge_core] @SQ header '%s' in '%s' differs from target sequence", hheaders->target_name[j], headers);
144 swap_header_text(hout, hheaders);
145 bam_header_destroy(hheaders);
148 } else { // validate multiple baf
149 if (hout->n_targets != hin->n_targets) {
150 fprintf(stderr, "[bam_merge_core] file '%s' has different number of target sequences. Abort!\n", fn[i]);
153 for (j = 0; j < hout->n_targets; ++j) {
154 if (strcmp(hout->target_name[j], hin->target_name[j])) {
155 fprintf(stderr, "[bam_merge_core] different target sequence name: '%s' != '%s' in file '%s'. Abort!\n",
156 hout->target_name[j], hin->target_name[j], fn[i]);
160 bam_header_destroy(hin);
166 if (bam_parse_region(hout, reg, &tid, &beg, &end) < 0) {
167 fprintf(stderr, "[%s] Malformated region string or undefined reference name\n", __func__);
170 for (i = 0; i < n; ++i) {
172 idx = bam_index_load(fn[i]);
173 iter[i] = bam_iter_query(idx, tid, beg, end);
174 bam_index_destroy(idx);
178 for (i = 0; i < n; ++i) {
179 heap1_t *h = heap + i;
181 h->b = (bam1_t*)calloc(1, sizeof(bam1_t));
182 if (bam_iter_read(fp[i], iter[i], h->b) >= 0) {
183 h->pos = ((uint64_t)h->b->core.tid<<32) | (uint32_t)h->b->core.pos<<1 | bam1_strand(h->b);
186 else h->pos = HEAP_EMPTY;
188 if (flag & MERGE_UNCOMP) {
189 fpout = strcmp(out, "-")? bam_open(out, "wu") : bam_dopen(fileno(stdout), "wu");
191 fpout = strcmp(out, "-")? bam_open(out, "w") : bam_dopen(fileno(stdout), "w");
194 fprintf(stderr, "[%s] fail to create the output file.\n", __func__);
197 bam_header_write(fpout, hout);
198 bam_header_destroy(hout);
200 ks_heapmake(heap, n, heap);
201 while (heap->pos != HEAP_EMPTY) {
203 if ((flag & MERGE_RG) && bam_aux_get(b, "RG") == 0)
204 bam_aux_append(b, "RG", 'Z', RG_len[heap->i] + 1, (uint8_t*)RG[heap->i]);
205 bam_write1_core(fpout, &b->core, b->data_len, b->data);
206 if ((j = bam_iter_read(fp[heap->i], iter[heap->i], b)) >= 0) {
207 heap->pos = ((uint64_t)b->core.tid<<32) | (uint32_t)b->core.pos<<1 | bam1_strand(b);
209 } else if (j == -1) {
210 heap->pos = HEAP_EMPTY;
211 free(heap->b->data); free(heap->b);
213 } else fprintf(stderr, "[bam_merge_core] '%s' is truncated. Continue anyway.\n", fn[heap->i]);
214 ks_heapadjust(heap, 0, n, heap);
217 if (flag & MERGE_RG) {
218 for (i = 0; i != n; ++i) free(RG[i]);
219 free(RG); free(RG_len);
221 for (i = 0; i != n; ++i) {
222 bam_iter_destroy(iter[i]);
226 free(fp); free(heap); free(iter);
230 int bam_merge(int argc, char *argv[])
232 int c, is_by_qname = 0, flag = 0;
233 char *fn_headers = NULL, *reg = 0;
235 while ((c = getopt(argc, argv, "h:nruR:")) >= 0) {
237 case 'r': flag |= MERGE_RG; break;
238 case 'h': fn_headers = strdup(optarg); break;
239 case 'n': is_by_qname = 1; break;
240 case 'u': flag |= MERGE_UNCOMP; break;
241 case 'R': reg = strdup(optarg); break;
244 if (optind + 2 >= argc) {
245 fprintf(stderr, "\n");
246 fprintf(stderr, "Usage: samtools merge [-nr] [-h inh.sam] <out.bam> <in1.bam> <in2.bam> [...]\n\n");
247 fprintf(stderr, "Options: -n sort by read names\n");
248 fprintf(stderr, " -r attach RG tag (inferred from file names)\n");
249 fprintf(stderr, " -u uncompressed BAM output\n");
250 fprintf(stderr, " -R STR merge file in the specified region STR [all]\n");
251 fprintf(stderr, " -h FILE copy the header in FILE to <out.bam> [in1.bam]\n\n");
252 fprintf(stderr, "Note: Samtools' merge does not reconstruct the @RG dictionary in the header. Users\n");
253 fprintf(stderr, " must provide the correct header with -h, or uses Picard which properly maintains\n");
254 fprintf(stderr, " the header dictionary in merging.\n\n");
257 bam_merge_core(is_by_qname, argv[optind], fn_headers, argc - optind - 1, argv + optind + 1, flag, reg);
263 typedef bam1_t *bam1_p;
265 static inline int bam1_lt(const bam1_p a, const bam1_p b)
268 int t = strnum_cmp(bam1_qname(a), bam1_qname(b));
269 return (t < 0 || (t == 0 && (((uint64_t)a->core.tid<<32|a->core.pos) < ((uint64_t)b->core.tid<<32|b->core.pos))));
270 } else return (((uint64_t)a->core.tid<<32|a->core.pos) < ((uint64_t)b->core.tid<<32|b->core.pos));
272 KSORT_INIT(sort, bam1_p, bam1_lt)
274 static void sort_blocks(int n, int k, bam1_p *buf, const char *prefix, const bam_header_t *h, int is_stdout)
279 ks_mergesort(sort, k, buf, 0);
280 name = (char*)calloc(strlen(prefix) + 20, 1);
281 if (n >= 0) sprintf(name, "%s.%.4d.bam", prefix, n);
282 else sprintf(name, "%s.bam", prefix);
283 fp = is_stdout? bam_dopen(fileno(stdout), "w") : bam_open(name, "w");
285 fprintf(stderr, "[sort_blocks] fail to create file %s.\n", name);
287 // FIXME: possible memory leak
291 bam_header_write(fp, h);
292 for (i = 0; i < k; ++i)
293 bam_write1_core(fp, &buf[i]->core, buf[i]->data_len, buf[i]->data);
298 @abstract Sort an unsorted BAM file based on the chromosome order
299 and the leftmost position of an alignment
301 @param is_by_qname whether to sort by query name
302 @param fn name of the file to be sorted
303 @param prefix prefix of the output and the temporary files; upon
304 sucessess, prefix.bam will be written.
305 @param max_mem approxiate maximum memory (very inaccurate)
307 @discussion It may create multiple temporary subalignment files
308 and then merge them by calling bam_merge_core(). This function is
311 void bam_sort_core_ext(int is_by_qname, const char *fn, const char *prefix, size_t max_mem, int is_stdout)
315 bam_header_t *header;
319 g_is_by_qname = is_by_qname;
321 fp = strcmp(fn, "-")? bam_open(fn, "r") : bam_dopen(fileno(stdin), "r");
323 fprintf(stderr, "[bam_sort_core] fail to open file %s\n", fn);
326 header = bam_header_read(fp);
327 buf = (bam1_t**)calloc(max_mem / BAM_CORE_SIZE, sizeof(bam1_t*));
330 if (buf[k] == 0) buf[k] = (bam1_t*)calloc(1, sizeof(bam1_t));
332 if ((ret = bam_read1(fp, b)) < 0) break;
335 if (mem >= max_mem) {
336 sort_blocks(n++, k, buf, prefix, header, 0);
341 fprintf(stderr, "[bam_sort_core] truncated file. Continue anyway.\n");
342 if (n == 0) sort_blocks(-1, k, buf, prefix, header, is_stdout);
345 fprintf(stderr, "[bam_sort_core] merging from %d files...\n", n+1);
346 sort_blocks(n++, k, buf, prefix, header, 0);
347 fnout = (char*)calloc(strlen(prefix) + 20, 1);
348 if (is_stdout) sprintf(fnout, "-");
349 else sprintf(fnout, "%s.bam", prefix);
350 fns = (char**)calloc(n, sizeof(char*));
351 for (i = 0; i < n; ++i) {
352 fns[i] = (char*)calloc(strlen(prefix) + 20, 1);
353 sprintf(fns[i], "%s.%.4d.bam", prefix, i);
355 bam_merge_core(is_by_qname, fnout, 0, n, fns, 0, 0);
357 for (i = 0; i < n; ++i) {
363 for (k = 0; k < max_mem / BAM_CORE_SIZE; ++k) {
370 bam_header_destroy(header);
374 void bam_sort_core(int is_by_qname, const char *fn, const char *prefix, size_t max_mem)
376 bam_sort_core_ext(is_by_qname, fn, prefix, max_mem, 0);
379 int bam_sort(int argc, char *argv[])
381 size_t max_mem = 500000000;
382 int c, is_by_qname = 0, is_stdout = 0;
383 while ((c = getopt(argc, argv, "nom:")) >= 0) {
385 case 'o': is_stdout = 1; break;
386 case 'n': is_by_qname = 1; break;
387 case 'm': max_mem = atol(optarg); break;
390 if (optind + 2 > argc) {
391 fprintf(stderr, "Usage: samtools sort [-on] [-m <maxMem>] <in.bam> <out.prefix>\n");
394 bam_sort_core_ext(is_by_qname, argv[optind], argv[optind+1], max_mem, is_stdout);