7 #include "bam_endian.h"
13 #define TAD_MIN_CHUNK_GAP 32768
14 // 1<<14 is the size of minimum bin.
15 #define TAD_LIDX_SHIFT 14
21 #define pair64_lt(a,b) ((a).u < (b).u)
22 KSORT_INIT(offt, pair64_t, pair64_lt)
34 KHASH_MAP_INIT_INT(i, ti_binlist_t)
35 KHASH_MAP_INIT_STR(s, int)
46 int from_first; // read from the first record; no random access
47 int tid, beg, end, n_off, i, finished;
50 const ti_index_t *idx;
55 int tid, beg, end, bin;
58 ti_conf_t ti_conf_gff = { 0, 1, 4, 5, '#', 0 };
59 ti_conf_t ti_conf_bed = { TI_FLAG_UCSC, 1, 2, 3, '#', 0 };
60 ti_conf_t ti_conf_psltbl = { TI_FLAG_UCSC, 15, 17, 18, '#', 0 };
61 ti_conf_t ti_conf_sam = { TI_PRESET_SAM, 3, 4, 0, '@', 0 };
62 ti_conf_t ti_conf_vcf = { TI_PRESET_VCF, 1, 2, 0, '#', 0 };
69 int ti_readline(BGZF *fp, kstring_t *str)
73 while ((c = bgzf_getc(fp)) >= 0 && c != '\n') {
75 if (c != '\r') kputc(c, str);
77 if (c < 0 && l == 0) return -1; // end of file
82 /* Below is a faster implementation largely equivalent to the one
83 * commented out above. */
84 int ti_readline(BGZF *fp, kstring_t *str)
86 return bgzf_getline(fp, '\n', str);
89 /*************************************
90 * get the interval from a data line *
91 *************************************/
93 static inline int ti_reg2bin(uint32_t beg, uint32_t end)
96 if (beg>>14 == end>>14) return 4681 + (beg>>14);
97 if (beg>>17 == end>>17) return 585 + (beg>>17);
98 if (beg>>20 == end>>20) return 73 + (beg>>20);
99 if (beg>>23 == end>>23) return 9 + (beg>>23);
100 if (beg>>26 == end>>26) return 1 + (beg>>26);
104 static int get_tid(ti_index_t *idx, const char *ss)
108 k = kh_get(s, idx->tname, ss);
109 if (k == kh_end(idx->tname)) { // a new target sequence
111 // update idx->n, ->max, ->index and ->index2
112 if (idx->n == idx->max) {
113 idx->max = idx->max? idx->max<<1 : 8;
114 idx->index = realloc(idx->index, idx->max * sizeof(void*));
115 idx->index2 = realloc(idx->index2, idx->max * sizeof(ti_lidx_t));
117 memset(&idx->index2[idx->n], 0, sizeof(ti_lidx_t));
118 idx->index[idx->n++] = kh_init(i);
120 tid = size = kh_size(idx->tname);
121 k = kh_put(s, idx->tname, strdup(ss), &ret);
122 kh_value(idx->tname, k) = size;
123 assert(idx->n == kh_size(idx->tname));
124 } else tid = kh_value(idx->tname, k);
128 int ti_get_intv(const ti_conf_t *conf, int len, char *line, ti_interval_t *intv)
130 int i, b = 0, id = 1, ncols = 0;
132 intv->ss = intv->se = 0; intv->beg = intv->end = -1;
133 for (i = 0; i <= len; ++i) {
134 if (line[i] == '\t' || line[i] == 0) {
136 if (id == conf->sc) {
137 intv->ss = line + b; intv->se = line + i;
138 } else if (id == conf->bc) {
139 // here ->beg is 0-based.
140 intv->beg = intv->end = strtol(line + b, &s, 0);
141 if (!(conf->preset&TI_FLAG_UCSC)) --intv->beg;
143 if (intv->beg < 0) intv->beg = 0;
144 if (intv->end < 1) intv->end = 1;
146 if ((conf->preset&0xffff) == TI_PRESET_GENERIC) {
147 if (id == conf->ec) intv->end = strtol(line + b, &s, 0);
148 } else if ((conf->preset&0xffff) == TI_PRESET_SAM) {
149 if (id == 6) { // CIGAR
152 for (s = line + b; s < line + i;) {
153 long x = strtol(s, &t, 10);
155 if (op == 'M' || op == 'D' || op == 'N') l += x;
159 intv->end = intv->beg + l;
161 } else if ((conf->preset&0xffff) == TI_PRESET_VCF) {
162 // FIXME: the following is NOT tested and is likely to be buggy
164 if (b < i) intv->end = intv->beg + (i - b);
165 } else if (id == 8) { // look for "END="
168 s = strstr(line + b, "END=");
169 if (s == line + b) s += 4;
171 s = strstr(line + b, ";END=");
174 if (s) intv->end = strtol(s, &s, 0);
184 if (ncols < conf->sc || ncols < conf->bc || ncols < conf->ec) {
185 if (ncols == 1) fprintf(stderr,"[get_intv] Is the file tab-delimited? The line has %d field only: %s\n", ncols, line);
186 else fprintf(stderr,"[get_intv] The line has %d field(s) only: %s\n", ncols, line);
190 if (intv->ss == 0 || intv->se == 0 || intv->beg < 0 || intv->end < 0) return -1;
194 static int get_intv(ti_index_t *idx, kstring_t *str, ti_intv_t *intv)
197 intv->tid = intv->beg = intv->end = intv->bin = -1;
198 if (ti_get_intv(&idx->conf, str->l, str->s, &x) == 0) {
200 *x.se = '\0'; intv->tid = get_tid(idx, x.ss); *x.se = c;
201 intv->beg = x.beg; intv->end = x.end;
202 intv->bin = ti_reg2bin(intv->beg, intv->end);
203 return (intv->tid >= 0 && intv->beg >= 0 && intv->end >= 0)? 0 : -1;
205 fprintf(stderr, "[%s] the following line cannot be parsed and skipped: %s\n", __func__, str->s);
214 // requirement: len <= LEN_MASK
215 static inline void insert_offset(khash_t(i) *h, int bin, uint64_t beg, uint64_t end)
220 k = kh_put(i, h, bin, &ret);
222 if (ret) { // not present
224 l->list = (pair64_t*)calloc(l->m, 16);
228 l->list = (pair64_t*)realloc(l->list, l->m * 16);
230 l->list[l->n].u = beg; l->list[l->n++].v = end;
233 static inline uint64_t insert_offset2(ti_lidx_t *index2, int _beg, int _end, uint64_t offset)
236 beg = _beg >> TAD_LIDX_SHIFT;
237 end = (_end - 1) >> TAD_LIDX_SHIFT;
238 if (index2->m < end + 1) {
239 int old_m = index2->m;
241 kroundup32(index2->m);
242 index2->offset = (uint64_t*)realloc(index2->offset, index2->m * 8);
243 memset(index2->offset + old_m, 0, 8 * (index2->m - old_m));
246 if (index2->offset[beg] == 0) index2->offset[beg] = offset;
248 for (i = beg; i <= end; ++i)
249 if (index2->offset[i] == 0) index2->offset[i] = offset;
251 if (index2->n < end + 1) index2->n = end + 1;
252 return (uint64_t)beg<<32 | end;
255 static void merge_chunks(ti_index_t *idx)
260 for (i = 0; i < idx->n; ++i) {
261 index = idx->index[i];
262 for (k = kh_begin(index); k != kh_end(index); ++k) {
264 if (!kh_exist(index, k)) continue;
265 p = &kh_value(index, k);
267 for (l = 1; l < p->n; ++l) {
268 if (p->list[m].v>>16 == p->list[l].u>>16) p->list[m].v = p->list[l].v;
269 else p->list[++m] = p->list[l];
276 static void fill_missing(ti_index_t *idx)
279 for (i = 0; i < idx->n; ++i) {
280 ti_lidx_t *idx2 = &idx->index2[i];
281 for (j = 1; j < idx2->n; ++j)
282 if (idx2->offset[j] == 0)
283 idx2->offset[j] = idx2->offset[j-1];
287 ti_index_t *ti_index_core(BGZF *fp, const ti_conf_t *conf)
291 uint32_t last_bin, save_bin;
292 int32_t last_coor, last_tid, save_tid;
293 uint64_t save_off, last_off, lineno = 0, offset0 = (uint64_t)-1, tmp;
296 str = calloc(1, sizeof(kstring_t));
298 idx = (ti_index_t*)calloc(1, sizeof(ti_index_t));
300 idx->n = idx->max = 0;
301 idx->tname = kh_init(s);
305 save_bin = save_tid = last_tid = last_bin = 0xffffffffu;
306 save_off = last_off = bgzf_tell(fp); last_coor = 0xffffffffu;
307 while ((ret = ti_readline(fp, str)) >= 0) {
310 if (lineno <= idx->conf.line_skip || str->s[0] == idx->conf.meta_char) {
311 last_off = bgzf_tell(fp);
314 get_intv(idx, str, &intv);
315 if ( intv.beg<0 || intv.end<0 )
317 fprintf(stderr,"[ti_index_core] the indexes overlap or are out of bounds\n");
320 if (last_tid != intv.tid) { // change of chromosomes
321 if (last_tid>intv.tid )
323 fprintf(stderr,"[ti_index_core] the chromosome blocks not continuous at line %llu, is the file sorted? [pos %d]\n",(unsigned long long)lineno,intv.beg+1);
327 last_bin = 0xffffffffu;
328 } else if (last_coor > intv.beg) {
329 fprintf(stderr, "[ti_index_core] the file out of order at line %llu\n", (unsigned long long)lineno);
332 tmp = insert_offset2(&idx->index2[intv.tid], intv.beg, intv.end, last_off);
333 if (last_off == 0) offset0 = tmp;
334 if (intv.bin != last_bin) { // then possibly write the binning index
335 if (save_bin != 0xffffffffu) // save_bin==0xffffffffu only happens to the first record
336 insert_offset(idx->index[save_tid], save_bin, save_off, last_off);
338 save_bin = last_bin = intv.bin;
340 if (save_tid < 0) break;
342 if (bgzf_tell(fp) <= last_off) {
343 fprintf(stderr, "[ti_index_core] bug in BGZF: %llx < %llx\n",
344 (unsigned long long)bgzf_tell(fp), (unsigned long long)last_off);
347 last_off = bgzf_tell(fp);
348 last_coor = intv.beg;
350 if (save_tid >= 0) insert_offset(idx->index[save_tid], save_bin, save_off, bgzf_tell(fp));
353 if (offset0 != (uint64_t)-1 && idx->n && idx->index2[0].offset) {
354 int i, beg = offset0>>32, end = offset0&0xffffffffu;
355 for (i = beg; i <= end; ++i) idx->index2[0].offset[i] = 0;
358 free(str->s); free(str);
362 void ti_index_destroy(ti_index_t *idx)
366 if (idx == 0) return;
367 // destroy the name hash table
368 for (k = kh_begin(idx->tname); k != kh_end(idx->tname); ++k) {
369 if (kh_exist(idx->tname, k))
370 free((char*)kh_key(idx->tname, k));
372 kh_destroy(s, idx->tname);
373 // destroy the binning index
374 for (i = 0; i < idx->n; ++i) {
375 khash_t(i) *index = idx->index[i];
376 ti_lidx_t *index2 = idx->index2 + i;
377 for (k = kh_begin(index); k != kh_end(index); ++k) {
378 if (kh_exist(index, k))
379 free(kh_value(index, k).list);
381 kh_destroy(i, index);
382 free(index2->offset);
385 // destroy the linear index
394 void ti_index_save(const ti_index_t *idx, BGZF *fp)
396 int32_t i, size, ti_is_be;
398 ti_is_be = bam_is_big_endian();
399 bgzf_write(fp, "TBI\1", 4);
402 bgzf_write(fp, bam_swap_endian_4p(&x), 4);
403 } else bgzf_write(fp, &idx->n, 4);
404 assert(sizeof(ti_conf_t) == 24);
405 if (ti_is_be) { // write ti_conf_t;
407 memcpy(x, &idx->conf, 24);
408 for (i = 0; i < 6; ++i) bgzf_write(fp, bam_swap_endian_4p(&x[i]), 4);
409 } else bgzf_write(fp, &idx->conf, sizeof(ti_conf_t));
410 { // write target names
413 name = calloc(kh_size(idx->tname), sizeof(void*));
414 for (k = kh_begin(idx->tname); k != kh_end(idx->tname); ++k)
415 if (kh_exist(idx->tname, k))
416 name[kh_value(idx->tname, k)] = (char*)kh_key(idx->tname, k);
417 for (i = 0; i < kh_size(idx->tname); ++i)
418 l += strlen(name[i]) + 1;
419 if (ti_is_be) bgzf_write(fp, bam_swap_endian_4p(&l), 4);
420 else bgzf_write(fp, &l, 4);
421 for (i = 0; i < kh_size(idx->tname); ++i)
422 bgzf_write(fp, name[i], strlen(name[i]) + 1);
425 for (i = 0; i < idx->n; ++i) {
426 khash_t(i) *index = idx->index[i];
427 ti_lidx_t *index2 = idx->index2 + i;
428 // write binning index
429 size = kh_size(index);
430 if (ti_is_be) { // big endian
432 bgzf_write(fp, bam_swap_endian_4p(&x), 4);
433 } else bgzf_write(fp, &size, 4);
434 for (k = kh_begin(index); k != kh_end(index); ++k) {
435 if (kh_exist(index, k)) {
436 ti_binlist_t *p = &kh_value(index, k);
437 if (ti_is_be) { // big endian
439 x = kh_key(index, k); bgzf_write(fp, bam_swap_endian_4p(&x), 4);
440 x = p->n; bgzf_write(fp, bam_swap_endian_4p(&x), 4);
441 for (x = 0; (int)x < p->n; ++x) {
442 bam_swap_endian_8p(&p->list[x].u);
443 bam_swap_endian_8p(&p->list[x].v);
445 bgzf_write(fp, p->list, 16 * p->n);
446 for (x = 0; (int)x < p->n; ++x) {
447 bam_swap_endian_8p(&p->list[x].u);
448 bam_swap_endian_8p(&p->list[x].v);
451 bgzf_write(fp, &kh_key(index, k), 4);
452 bgzf_write(fp, &p->n, 4);
453 bgzf_write(fp, p->list, 16 * p->n);
457 // write linear index (index2)
460 bgzf_write(fp, bam_swap_endian_4p(&x), 4);
461 } else bgzf_write(fp, &index2->n, 4);
462 if (ti_is_be) { // big endian
464 for (x = 0; (int)x < index2->n; ++x)
465 bam_swap_endian_8p(&index2->offset[x]);
466 bgzf_write(fp, index2->offset, 8 * index2->n);
467 for (x = 0; (int)x < index2->n; ++x)
468 bam_swap_endian_8p(&index2->offset[x]);
469 } else bgzf_write(fp, index2->offset, 8 * index2->n);
473 static ti_index_t *ti_index_load_core(BGZF *fp)
478 ti_is_be = bam_is_big_endian();
480 fprintf(stderr, "[ti_index_load_core] fail to load index.\n");
483 bgzf_read(fp, magic, 4);
484 if (strncmp(magic, "TBI\1", 4)) {
485 fprintf(stderr, "[ti_index_load] wrong magic number.\n");
488 idx = (ti_index_t*)calloc(1, sizeof(ti_index_t));
489 bgzf_read(fp, &idx->n, 4);
490 if (ti_is_be) bam_swap_endian_4p(&idx->n);
491 idx->tname = kh_init(s);
492 idx->index = (khash_t(i)**)calloc(idx->n, sizeof(void*));
493 idx->index2 = (ti_lidx_t*)calloc(idx->n, sizeof(ti_lidx_t));
495 bgzf_read(fp, &idx->conf, sizeof(ti_conf_t));
497 bam_swap_endian_4p(&idx->conf.preset);
498 bam_swap_endian_4p(&idx->conf.sc);
499 bam_swap_endian_4p(&idx->conf.bc);
500 bam_swap_endian_4p(&idx->conf.ec);
501 bam_swap_endian_4p(&idx->conf.meta_char);
502 bam_swap_endian_4p(&idx->conf.line_skip);
504 { // read target names
509 bgzf_read(fp, &l, 4);
510 if (ti_is_be) bam_swap_endian_4p(&l);
512 bgzf_read(fp, buf, l);
513 str = calloc(1, sizeof(kstring_t));
514 for (i = j = 0; i < l; ++i) {
516 khint_t k = kh_put(s, idx->tname, strdup(str->s), &ret);
517 kh_value(idx->tname, k) = j++;
519 } else kputc(buf[i], str);
521 free(str->s); free(str); free(buf);
523 for (i = 0; i < idx->n; ++i) {
525 ti_lidx_t *index2 = idx->index2 + i;
530 index = idx->index[i] = kh_init(i);
531 // load binning index
532 bgzf_read(fp, &size, 4);
533 if (ti_is_be) bam_swap_endian_4p(&size);
534 for (j = 0; j < (int)size; ++j) {
535 bgzf_read(fp, &key, 4);
536 if (ti_is_be) bam_swap_endian_4p(&key);
537 k = kh_put(i, index, key, &ret);
538 p = &kh_value(index, k);
539 bgzf_read(fp, &p->n, 4);
540 if (ti_is_be) bam_swap_endian_4p(&p->n);
542 p->list = (pair64_t*)malloc(p->m * 16);
543 bgzf_read(fp, p->list, 16 * p->n);
546 for (x = 0; x < p->n; ++x) {
547 bam_swap_endian_8p(&p->list[x].u);
548 bam_swap_endian_8p(&p->list[x].v);
553 bgzf_read(fp, &index2->n, 4);
554 if (ti_is_be) bam_swap_endian_4p(&index2->n);
555 index2->m = index2->n;
556 index2->offset = (uint64_t*)calloc(index2->m, 8);
557 bgzf_read(fp, index2->offset, index2->n * 8);
559 for (j = 0; j < index2->n; ++j) bam_swap_endian_8p(&index2->offset[j]);
564 ti_index_t *ti_index_load_local(const char *fnidx)
567 fp = bgzf_open(fnidx, "r");
569 ti_index_t *idx = ti_index_load_core(fp);
576 static void download_from_remote(const char *url)
578 const int buf_size = 1 * 1024 * 1024;
584 if (strstr(url, "ftp://") != url && strstr(url, "http://") != url) return;
586 for (fn = (char*)url + l - 1; fn >= url; --fn)
587 if (*fn == '/') break;
588 ++fn; // fn now points to the file name
589 fp_remote = knet_open(url, "r");
590 if (fp_remote == 0) {
591 fprintf(stderr, "[download_from_remote] fail to open remote file.\n");
594 if ((fp = fopen(fn, "w")) == 0) {
595 fprintf(stderr, "[download_from_remote] fail to create file in the working directory.\n");
596 knet_close(fp_remote);
599 buf = (uint8_t*)calloc(buf_size, 1);
600 while ((l = knet_read(fp_remote, buf, buf_size)) != 0)
601 fwrite(buf, 1, l, fp);
604 knet_close(fp_remote);
607 static void download_from_remote(const char *url)
613 static char *get_local_version(const char *fn)
616 char *fnidx = (char*)calloc(strlen(fn) + 5, 1);
617 strcat(strcpy(fnidx, fn), ".tbi");
618 if ((strstr(fnidx, "ftp://") == fnidx || strstr(fnidx, "http://") == fnidx)) {
620 int l = strlen(fnidx);
621 for (p = fnidx + l - 1; p >= fnidx; --p)
622 if (*p == '/') break;
623 url = fnidx; fnidx = strdup(p + 1);
624 if (stat(fnidx, &sbuf) == 0) {
628 fprintf(stderr, "[%s] downloading the index file...\n", __func__);
629 download_from_remote(url);
632 if (stat(fnidx, &sbuf) == 0) return fnidx;
633 free(fnidx); return 0;
636 const char **ti_seqname(const ti_index_t *idx, int *n)
641 names = calloc(idx->n, sizeof(void*));
642 for (k = kh_begin(idx->tname); k < kh_end(idx->tname); ++k)
643 if (kh_exist(idx->tname, k))
644 names[kh_val(idx->tname, k)] = kh_key(idx->tname, k);
648 ti_index_t *ti_index_load(const char *fn)
651 char *fname = get_local_version(fn);
652 if (fname == 0) return 0;
653 idx = ti_index_load_local(fname);
654 if (idx == 0) fprintf(stderr, "[ti_index_load] fail to load the index: %s\n", fname);
659 int ti_index_build2(const char *fn, const ti_conf_t *conf, const char *_fnidx)
664 if ((fp = bgzf_open(fn, "r")) == 0) {
665 fprintf(stderr, "[ti_index_build2] fail to open the file: %s\n", fn);
668 idx = ti_index_core(fp, conf);
671 fnidx = (char*)calloc(strlen(fn) + 5, 1);
672 strcpy(fnidx, fn); strcat(fnidx, ".tbi");
673 } else fnidx = strdup(_fnidx);
674 fpidx = bgzf_open(fnidx, "w");
676 fprintf(stderr, "[ti_index_build2] fail to create the index file.\n");
680 ti_index_save(idx, fpidx);
681 ti_index_destroy(idx);
687 int ti_index_build(const char *fn, const ti_conf_t *conf)
689 return ti_index_build2(fn, conf, 0);
692 /********************************************
693 * parse a region in the format chr:beg-end *
694 ********************************************/
696 int ti_get_tid(const ti_index_t *idx, const char *name)
699 const khash_t(s) *h = idx->tname;
700 iter = kh_get(s, h, name); /* get the tid */
701 if (iter == kh_end(h)) return -1;
702 return kh_value(h, iter);
705 int ti_parse_region(const ti_index_t *idx, const char *str, int *tid, int *begin, int *end)
710 p = s = (char*)malloc(l+1);
711 /* squeeze out "," */
712 for (i = k = 0; i != l; ++i)
713 if (str[i] != ',' && !isspace(str[i])) s[k++] = str[i];
715 for (i = 0; i != k; ++i) if (s[i] == ':') break;
717 if ((*tid = ti_get_tid(idx, s)) < 0) {
721 if (i == k) { /* dump the whole sequence */
722 *begin = 0; *end = 1<<29; free(s);
725 for (p = s + i + 1; i != k; ++i) if (s[i] == '-') break;
731 if (*begin > 0) --*begin;
733 if (*begin > *end) return -1;
737 /*******************************
738 * retrieve a specified region *
739 *******************************/
741 #define MAX_BIN 37450 // =(8^6-1)/7+1
743 static inline int reg2bins(uint32_t beg, uint32_t end, uint16_t list[MAX_BIN])
746 if (beg >= end) return 0;
747 if (end >= 1u<<29) end = 1u<<29;
750 for (k = 1 + (beg>>26); k <= 1 + (end>>26); ++k) list[i++] = k;
751 for (k = 9 + (beg>>23); k <= 9 + (end>>23); ++k) list[i++] = k;
752 for (k = 73 + (beg>>20); k <= 73 + (end>>20); ++k) list[i++] = k;
753 for (k = 585 + (beg>>17); k <= 585 + (end>>17); ++k) list[i++] = k;
754 for (k = 4681 + (beg>>14); k <= 4681 + (end>>14); ++k) list[i++] = k;
758 ti_iter_t ti_iter_first()
761 iter = calloc(1, sizeof(struct __ti_iter_t));
762 iter->from_first = 1;
766 ti_iter_t ti_iter_query(const ti_index_t *idx, int tid, int beg, int end)
769 int i, n_bins, n_off;
776 if (beg < 0) beg = 0;
777 if (end < beg) return 0;
778 // initialize the iterator
779 iter = calloc(1, sizeof(struct __ti_iter_t));
780 iter->idx = idx; iter->tid = tid; iter->beg = beg; iter->end = end; iter->i = -1;
782 bins = (uint16_t*)calloc(MAX_BIN, 2);
783 n_bins = reg2bins(beg, end, bins);
784 index = idx->index[tid];
785 if (idx->index2[tid].n > 0) {
786 min_off = (beg>>TAD_LIDX_SHIFT >= idx->index2[tid].n)? idx->index2[tid].offset[idx->index2[tid].n-1]
787 : idx->index2[tid].offset[beg>>TAD_LIDX_SHIFT];
788 if (min_off == 0) { // improvement for index files built by tabix prior to 0.1.4
789 int n = beg>>TAD_LIDX_SHIFT;
790 if (n > idx->index2[tid].n) n = idx->index2[tid].n;
791 for (i = n - 1; i >= 0; --i)
792 if (idx->index2[tid].offset[i] != 0) break;
793 if (i >= 0) min_off = idx->index2[tid].offset[i];
795 } else min_off = 0; // tabix 0.1.2 may produce such index files
796 for (i = n_off = 0; i < n_bins; ++i) {
797 if ((k = kh_get(i, index, bins[i])) != kh_end(index))
798 n_off += kh_value(index, k).n;
801 free(bins); return iter;
803 off = (pair64_t*)calloc(n_off, 16);
804 for (i = n_off = 0; i < n_bins; ++i) {
805 if ((k = kh_get(i, index, bins[i])) != kh_end(index)) {
807 ti_binlist_t *p = &kh_value(index, k);
808 for (j = 0; j < p->n; ++j)
809 if (p->list[j].v > min_off) off[n_off++] = p->list[j];
813 free(bins); free(off); return iter;
818 ks_introsort(offt, n_off, off);
819 // resolve completely contained adjacent blocks
820 for (i = 1, l = 0; i < n_off; ++i)
821 if (off[l].v < off[i].v)
824 // resolve overlaps between adjacent blocks; this may happen due to the merge in indexing
825 for (i = 1; i < n_off; ++i)
826 if (off[i-1].v >= off[i].u) off[i-1].v = off[i].u;
827 { // merge adjacent blocks
828 for (i = 1, l = 0; i < n_off; ++i) {
829 if (off[l].v>>16 == off[i].u>>16) off[l].v = off[i].v;
830 else off[++l] = off[i];
835 iter->n_off = n_off; iter->off = off;
839 const char *ti_iter_read(BGZF *fp, ti_iter_t iter, int *len)
841 if (iter->finished) return 0;
842 if (iter->from_first) {
844 if ((ret = ti_readline(fp, &iter->str)) < 0) {
848 if (len) *len = iter->str.l;
852 if (iter->n_off == 0) return 0;
855 if (iter->curr_off == 0 || iter->curr_off >= iter->off[iter->i].v) { // then jump to the next chunk
856 if (iter->i == iter->n_off - 1) break; // no more chunks
857 if (iter->i >= 0) assert(iter->curr_off == iter->off[iter->i].v); // otherwise bug
858 if (iter->i < 0 || iter->off[iter->i].v != iter->off[iter->i+1].u) { // not adjacent chunks; then seek
859 bgzf_seek(fp, iter->off[iter->i+1].u, SEEK_SET);
860 iter->curr_off = bgzf_tell(fp);
864 if ((ret = ti_readline(fp, &iter->str)) >= 0) {
866 iter->curr_off = bgzf_tell(fp);
867 if (iter->str.s[0] == iter->idx->conf.meta_char) continue;
868 get_intv((ti_index_t*)iter->idx, &iter->str, &intv);
869 if (intv.tid != iter->tid || intv.beg >= iter->end) break; // no need to proceed
870 else if (intv.end > iter->beg && iter->end > intv.beg) {
871 if (len) *len = iter->str.l;
874 } else break; // end of file
880 void ti_iter_destroy(ti_iter_t iter)
883 free(iter->str.s); free(iter->off);
888 int ti_fetch(BGZF *fp, const ti_index_t *idx, int tid, int beg, int end, void *data, ti_fetch_f func)
893 iter = ti_iter_query(idx, tid, beg, end);
894 while ((s = ti_iter_read(fp, iter, &len)) != 0)
896 ti_iter_destroy(iter);
900 const ti_conf_t *ti_get_conf(ti_index_t *idx) { return idx? &idx->conf : 0; }
906 tabix_t *ti_open(const char *fn, const char *fnidx)
910 if ((fp = bgzf_open(fn, "r")) == 0) return 0;
911 t = calloc(1, sizeof(tabix_t));
913 if (fnidx) t->fnidx = strdup(fnidx);
918 void ti_close(tabix_t *t)
922 if (t->idx) ti_index_destroy(t->idx);
923 free(t->fn); free(t->fnidx);
928 int ti_lazy_index_load(tabix_t *t)
930 if (t->idx == 0) { // load index
931 if (t->fnidx) t->idx = ti_index_load_local(t->fnidx);
932 else t->idx = ti_index_load(t->fn);
933 if (t->idx == 0) return -1; // fail to load index
938 ti_iter_t ti_queryi(tabix_t *t, int tid, int beg, int end)
940 if (tid < 0) return ti_iter_first();
941 if (ti_lazy_index_load(t) != 0) return 0;
942 return ti_iter_query(t->idx, tid, beg, end);
945 ti_iter_t ti_querys(tabix_t *t, const char *reg)
948 if (reg == 0) return ti_iter_first();
949 if (ti_lazy_index_load(t) != 0) return 0;
950 if (ti_parse_region(t->idx, reg, &tid, &beg, &end) < 0) return 0;
951 return ti_iter_query(t->idx, tid, beg, end);
954 ti_iter_t ti_query(tabix_t *t, const char *name, int beg, int end)
957 if (name == 0) return ti_iter_first();
958 // then need to load the index
959 if (ti_lazy_index_load(t) != 0) return 0;
960 if ((tid = ti_get_tid(t->idx, name)) < 0) return 0;
961 return ti_iter_query(t->idx, tid, beg, end);
964 const char *ti_read(tabix_t *t, ti_iter_t iter, int *len)
966 return ti_iter_read(t->fp, iter, len);