9 #include "bam_endian.h"
15 #define TAD_MIN_CHUNK_GAP 32768
16 // 1<<14 is the size of minimum bin.
17 #define TAD_LIDX_SHIFT 14
23 #define pair64_lt(a,b) ((a).u < (b).u)
24 KSORT_INIT(offt, pair64_t, pair64_lt)
36 KHASH_MAP_INIT_INT(i, ti_binlist_t)
37 KHASH_MAP_INIT_STR(s, int)
48 int from_first; // read from the first record; no random access
49 int tid, beg, end, n_off, i, finished;
52 const ti_index_t *idx;
57 int tid, beg, end, bin;
60 ti_conf_t ti_conf_gff = { 0, 1, 4, 5, '#', 0 };
61 ti_conf_t ti_conf_bed = { TI_FLAG_UCSC, 1, 2, 3, '#', 0 };
62 ti_conf_t ti_conf_psltbl = { TI_FLAG_UCSC, 15, 17, 18, '#', 0 };
63 ti_conf_t ti_conf_sam = { TI_PRESET_SAM, 3, 4, 0, '@', 0 };
64 ti_conf_t ti_conf_vcf = { TI_PRESET_VCF, 1, 2, 0, '#', 0 };
71 int ti_readline(BGZF *fp, kstring_t *str)
75 while ((c = bgzf_getc(fp)) >= 0 && c != '\n') {
77 if (c != '\r') kputc(c, str);
79 if (c < 0 && l == 0) return -1; // end of file
84 /* Below is a faster implementation largely equivalent to the one
85 * commented out above. */
86 int ti_readline(BGZF *fp, kstring_t *str)
89 unsigned char *buf = (unsigned char*)fp->uncompressed_block;
92 if (fp->block_offset >= fp->block_length) {
93 if (bgzf_read_block(fp) != 0) { state = -2; break; }
94 if (fp->block_length == 0) { state = -1; break; }
96 for (l = fp->block_offset; l < fp->block_length && buf[l] != '\n'; ++l);
97 if (l < fp->block_length) state = 1;
98 l -= fp->block_offset;
99 if (str->l + l + 1 >= str->m) {
100 str->m = str->l + l + 2;
102 str->s = (char*)realloc(str->s, str->m);
104 memcpy(str->s + str->l, buf + fp->block_offset, l);
106 fp->block_offset += l + 1;
107 if (fp->block_offset >= fp->block_length) {
109 fp->block_address = knet_tell(fp->x.fpr);
111 fp->block_address = ftello(fp->file);
113 fp->block_offset = 0;
114 fp->block_length = 0;
116 } while (state == 0);
117 if (str->l == 0 && state < 0) return state;
122 /*************************************
123 * get the interval from a data line *
124 *************************************/
126 static inline int ti_reg2bin(uint32_t beg, uint32_t end)
129 if (beg>>14 == end>>14) return 4681 + (beg>>14);
130 if (beg>>17 == end>>17) return 585 + (beg>>17);
131 if (beg>>20 == end>>20) return 73 + (beg>>20);
132 if (beg>>23 == end>>23) return 9 + (beg>>23);
133 if (beg>>26 == end>>26) return 1 + (beg>>26);
137 static int get_tid(ti_index_t *idx, const char *ss)
141 k = kh_get(s, idx->tname, ss);
142 if (k == kh_end(idx->tname)) { // a new target sequence
144 // update idx->n, ->max, ->index and ->index2
145 if (idx->n == idx->max) {
146 idx->max = idx->max? idx->max<<1 : 8;
147 idx->index = realloc(idx->index, idx->max * sizeof(void*));
148 idx->index2 = realloc(idx->index2, idx->max * sizeof(ti_lidx_t));
150 memset(&idx->index2[idx->n], 0, sizeof(ti_lidx_t));
151 idx->index[idx->n++] = kh_init(i);
153 tid = size = kh_size(idx->tname);
154 k = kh_put(s, idx->tname, strdup(ss), &ret);
155 kh_value(idx->tname, k) = size;
156 assert(idx->n == kh_size(idx->tname));
157 } else tid = kh_value(idx->tname, k);
161 int ti_get_intv(const ti_conf_t *conf, int len, char *line, ti_interval_t *intv)
163 int i, b = 0, id = 1, ncols = 0;
165 intv->ss = intv->se = 0; intv->beg = intv->end = -1;
166 for (i = 0; i <= len; ++i) {
167 if (line[i] == '\t' || line[i] == 0) {
169 if (id == conf->sc) {
170 intv->ss = line + b; intv->se = line + i;
171 } else if (id == conf->bc) {
172 // here ->beg is 0-based.
173 intv->beg = intv->end = strtol(line + b, &s, 0);
174 if (!(conf->preset&TI_FLAG_UCSC)) --intv->beg;
176 if (intv->beg < 0) intv->beg = 0;
177 if (intv->end < 1) intv->end = 1;
179 if ((conf->preset&0xffff) == TI_PRESET_GENERIC) {
180 if (id == conf->ec) intv->end = strtol(line + b, &s, 0);
181 } else if ((conf->preset&0xffff) == TI_PRESET_SAM) {
182 if (id == 6) { // CIGAR
185 for (s = line + b; s < line + i;) {
186 long x = strtol(s, &t, 10);
188 if (op == 'M' || op == 'D' || op == 'N') l += x;
192 intv->end = intv->beg + l;
194 } else if ((conf->preset&0xffff) == TI_PRESET_VCF) {
195 // FIXME: the following is NOT tested and is likely to be buggy
197 if (b < i) intv->end = intv->beg + (i - b);
198 } else if (id == 8) { // look for "END="
201 s = strstr(line + b, "END=");
202 if (s == line + b) s += 4;
204 s = strstr(line + b, ";END=");
207 if (s) intv->end = strtol(s, &s, 0);
217 if (ncols < conf->sc || ncols < conf->bc || ncols < conf->ec) {
218 if (ncols == 1) fprintf(pysamerr,"[get_intv] Is the file tab-delimited? The line has %d field only: %s\n", ncols, line);
219 else fprintf(pysamerr,"[get_intv] The line has %d field(s) only: %s\n", ncols, line);
223 if (intv->ss == 0 || intv->se == 0 || intv->beg < 0 || intv->end < 0) return -1;
227 static int get_intv(ti_index_t *idx, kstring_t *str, ti_intv_t *intv)
230 intv->tid = intv->beg = intv->end = intv->bin = -1;
231 if (ti_get_intv(&idx->conf, str->l, str->s, &x) == 0) {
233 *x.se = '\0'; intv->tid = get_tid(idx, x.ss); *x.se = c;
234 intv->beg = x.beg; intv->end = x.end;
235 intv->bin = ti_reg2bin(intv->beg, intv->end);
236 return (intv->tid >= 0 && intv->beg >= 0 && intv->end >= 0)? 0 : -1;
238 fprintf(pysamerr, "[%s] the following line cannot be parsed and skipped: %s\n", __func__, str->s);
247 // requirement: len <= LEN_MASK
248 static inline void insert_offset(khash_t(i) *h, int bin, uint64_t beg, uint64_t end)
253 k = kh_put(i, h, bin, &ret);
255 if (ret) { // not present
257 l->list = (pair64_t*)calloc(l->m, 16);
261 l->list = (pair64_t*)realloc(l->list, l->m * 16);
263 l->list[l->n].u = beg; l->list[l->n++].v = end;
266 static inline uint64_t insert_offset2(ti_lidx_t *index2, int _beg, int _end, uint64_t offset)
269 beg = _beg >> TAD_LIDX_SHIFT;
270 end = (_end - 1) >> TAD_LIDX_SHIFT;
271 if (index2->m < end + 1) {
272 int old_m = index2->m;
274 kroundup32(index2->m);
275 index2->offset = (uint64_t*)realloc(index2->offset, index2->m * 8);
276 memset(index2->offset + old_m, 0, 8 * (index2->m - old_m));
279 if (index2->offset[beg] == 0) index2->offset[beg] = offset;
281 for (i = beg; i <= end; ++i)
282 if (index2->offset[i] == 0) index2->offset[i] = offset;
284 if (index2->n < end + 1) index2->n = end + 1;
285 return (uint64_t)beg<<32 | end;
288 static void merge_chunks(ti_index_t *idx)
293 for (i = 0; i < idx->n; ++i) {
294 index = idx->index[i];
295 for (k = kh_begin(index); k != kh_end(index); ++k) {
297 if (!kh_exist(index, k)) continue;
298 p = &kh_value(index, k);
300 for (l = 1; l < p->n; ++l) {
301 if (p->list[m].v>>16 == p->list[l].u>>16) p->list[m].v = p->list[l].v;
302 else p->list[++m] = p->list[l];
309 static void fill_missing(ti_index_t *idx)
312 for (i = 0; i < idx->n; ++i) {
313 ti_lidx_t *idx2 = &idx->index2[i];
314 for (j = 1; j < idx2->n; ++j)
315 if (idx2->offset[j] == 0)
316 idx2->offset[j] = idx2->offset[j-1];
320 ti_index_t *ti_index_core(BGZF *fp, const ti_conf_t *conf)
324 uint32_t last_bin, save_bin;
325 int32_t last_coor, last_tid, save_tid;
326 uint64_t save_off, last_off, lineno = 0, offset0 = (uint64_t)-1, tmp;
329 str = calloc(1, sizeof(kstring_t));
331 idx = (ti_index_t*)calloc(1, sizeof(ti_index_t));
333 idx->n = idx->max = 0;
334 idx->tname = kh_init(s);
338 save_bin = save_tid = last_tid = last_bin = 0xffffffffu;
339 save_off = last_off = bgzf_tell(fp); last_coor = 0xffffffffu;
340 while ((ret = ti_readline(fp, str)) >= 0) {
343 if (lineno <= idx->conf.line_skip || str->s[0] == idx->conf.meta_char) {
344 last_off = bgzf_tell(fp);
347 get_intv(idx, str, &intv);
348 if ( intv.beg<0 || intv.end<0 )
350 fprintf(pysamerr,"[ti_index_core] the indexes overlap or are out of bounds\n");
353 if (last_tid != intv.tid) { // change of chromosomes
354 if (last_tid>intv.tid )
356 fprintf(pysamerr,"[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);
360 last_bin = 0xffffffffu;
361 } else if (last_coor > intv.beg) {
362 fprintf(pysamerr, "[ti_index_core] the file out of order at line %llu\n", (unsigned long long)lineno);
365 tmp = insert_offset2(&idx->index2[intv.tid], intv.beg, intv.end, last_off);
366 if (last_off == 0) offset0 = tmp;
367 if (intv.bin != last_bin) { // then possibly write the binning index
368 if (save_bin != 0xffffffffu) // save_bin==0xffffffffu only happens to the first record
369 insert_offset(idx->index[save_tid], save_bin, save_off, last_off);
371 save_bin = last_bin = intv.bin;
373 if (save_tid < 0) break;
375 if (bgzf_tell(fp) <= last_off) {
376 fprintf(pysamerr, "[ti_index_core] bug in BGZF: %llx < %llx\n",
377 (unsigned long long)bgzf_tell(fp), (unsigned long long)last_off);
380 last_off = bgzf_tell(fp);
381 last_coor = intv.beg;
383 if (save_tid >= 0) insert_offset(idx->index[save_tid], save_bin, save_off, bgzf_tell(fp));
386 if (offset0 != (uint64_t)-1 && idx->n && idx->index2[0].offset) {
387 int i, beg = offset0>>32, end = offset0&0xffffffffu;
388 for (i = beg; i <= end; ++i) idx->index2[0].offset[i] = 0;
391 free(str->s); free(str);
395 void ti_index_destroy(ti_index_t *idx)
399 if (idx == 0) return;
400 // destroy the name hash table
401 for (k = kh_begin(idx->tname); k != kh_end(idx->tname); ++k) {
402 if (kh_exist(idx->tname, k))
403 free((char*)kh_key(idx->tname, k));
405 kh_destroy(s, idx->tname);
406 // destroy the binning index
407 for (i = 0; i < idx->n; ++i) {
408 khash_t(i) *index = idx->index[i];
409 ti_lidx_t *index2 = idx->index2 + i;
410 for (k = kh_begin(index); k != kh_end(index); ++k) {
411 if (kh_exist(index, k))
412 free(kh_value(index, k).list);
414 kh_destroy(i, index);
415 free(index2->offset);
418 // destroy the linear index
427 void ti_index_save(const ti_index_t *idx, BGZF *fp)
429 int32_t i, size, ti_is_be;
431 ti_is_be = bam_is_big_endian();
432 bgzf_write(fp, "TBI\1", 4);
435 bgzf_write(fp, bam_swap_endian_4p(&x), 4);
436 } else bgzf_write(fp, &idx->n, 4);
437 assert(sizeof(ti_conf_t) == 24);
438 if (ti_is_be) { // write ti_conf_t;
440 memcpy(x, &idx->conf, 24);
441 for (i = 0; i < 6; ++i) bgzf_write(fp, bam_swap_endian_4p(&x[i]), 4);
442 } else bgzf_write(fp, &idx->conf, sizeof(ti_conf_t));
443 { // write target names
446 name = calloc(kh_size(idx->tname), sizeof(void*));
447 for (k = kh_begin(idx->tname); k != kh_end(idx->tname); ++k)
448 if (kh_exist(idx->tname, k))
449 name[kh_value(idx->tname, k)] = (char*)kh_key(idx->tname, k);
450 for (i = 0; i < kh_size(idx->tname); ++i)
451 l += strlen(name[i]) + 1;
452 if (ti_is_be) bgzf_write(fp, bam_swap_endian_4p(&l), 4);
453 else bgzf_write(fp, &l, 4);
454 for (i = 0; i < kh_size(idx->tname); ++i)
455 bgzf_write(fp, name[i], strlen(name[i]) + 1);
458 for (i = 0; i < idx->n; ++i) {
459 khash_t(i) *index = idx->index[i];
460 ti_lidx_t *index2 = idx->index2 + i;
461 // write binning index
462 size = kh_size(index);
463 if (ti_is_be) { // big endian
465 bgzf_write(fp, bam_swap_endian_4p(&x), 4);
466 } else bgzf_write(fp, &size, 4);
467 for (k = kh_begin(index); k != kh_end(index); ++k) {
468 if (kh_exist(index, k)) {
469 ti_binlist_t *p = &kh_value(index, k);
470 if (ti_is_be) { // big endian
472 x = kh_key(index, k); bgzf_write(fp, bam_swap_endian_4p(&x), 4);
473 x = p->n; bgzf_write(fp, bam_swap_endian_4p(&x), 4);
474 for (x = 0; (int)x < p->n; ++x) {
475 bam_swap_endian_8p(&p->list[x].u);
476 bam_swap_endian_8p(&p->list[x].v);
478 bgzf_write(fp, p->list, 16 * p->n);
479 for (x = 0; (int)x < p->n; ++x) {
480 bam_swap_endian_8p(&p->list[x].u);
481 bam_swap_endian_8p(&p->list[x].v);
484 bgzf_write(fp, &kh_key(index, k), 4);
485 bgzf_write(fp, &p->n, 4);
486 bgzf_write(fp, p->list, 16 * p->n);
490 // write linear index (index2)
493 bgzf_write(fp, bam_swap_endian_4p(&x), 4);
494 } else bgzf_write(fp, &index2->n, 4);
495 if (ti_is_be) { // big endian
497 for (x = 0; (int)x < index2->n; ++x)
498 bam_swap_endian_8p(&index2->offset[x]);
499 bgzf_write(fp, index2->offset, 8 * index2->n);
500 for (x = 0; (int)x < index2->n; ++x)
501 bam_swap_endian_8p(&index2->offset[x]);
502 } else bgzf_write(fp, index2->offset, 8 * index2->n);
506 static ti_index_t *ti_index_load_core(BGZF *fp)
511 ti_is_be = bam_is_big_endian();
513 fprintf(pysamerr, "[ti_index_load_core] fail to load index.\n");
516 bgzf_read(fp, magic, 4);
517 if (strncmp(magic, "TBI\1", 4)) {
518 fprintf(pysamerr, "[ti_index_load] wrong magic number.\n");
521 idx = (ti_index_t*)calloc(1, sizeof(ti_index_t));
522 bgzf_read(fp, &idx->n, 4);
523 if (ti_is_be) bam_swap_endian_4p(&idx->n);
524 idx->tname = kh_init(s);
525 idx->index = (khash_t(i)**)calloc(idx->n, sizeof(void*));
526 idx->index2 = (ti_lidx_t*)calloc(idx->n, sizeof(ti_lidx_t));
528 bgzf_read(fp, &idx->conf, sizeof(ti_conf_t));
530 bam_swap_endian_4p(&idx->conf.preset);
531 bam_swap_endian_4p(&idx->conf.sc);
532 bam_swap_endian_4p(&idx->conf.bc);
533 bam_swap_endian_4p(&idx->conf.ec);
534 bam_swap_endian_4p(&idx->conf.meta_char);
535 bam_swap_endian_4p(&idx->conf.line_skip);
537 { // read target names
542 bgzf_read(fp, &l, 4);
543 if (ti_is_be) bam_swap_endian_4p(&l);
545 bgzf_read(fp, buf, l);
546 str = calloc(1, sizeof(kstring_t));
547 for (i = j = 0; i < l; ++i) {
549 khint_t k = kh_put(s, idx->tname, strdup(str->s), &ret);
550 kh_value(idx->tname, k) = j++;
552 } else kputc(buf[i], str);
554 free(str->s); free(str); free(buf);
556 for (i = 0; i < idx->n; ++i) {
558 ti_lidx_t *index2 = idx->index2 + i;
563 index = idx->index[i] = kh_init(i);
564 // load binning index
565 bgzf_read(fp, &size, 4);
566 if (ti_is_be) bam_swap_endian_4p(&size);
567 for (j = 0; j < (int)size; ++j) {
568 bgzf_read(fp, &key, 4);
569 if (ti_is_be) bam_swap_endian_4p(&key);
570 k = kh_put(i, index, key, &ret);
571 p = &kh_value(index, k);
572 bgzf_read(fp, &p->n, 4);
573 if (ti_is_be) bam_swap_endian_4p(&p->n);
575 p->list = (pair64_t*)malloc(p->m * 16);
576 bgzf_read(fp, p->list, 16 * p->n);
579 for (x = 0; x < p->n; ++x) {
580 bam_swap_endian_8p(&p->list[x].u);
581 bam_swap_endian_8p(&p->list[x].v);
586 bgzf_read(fp, &index2->n, 4);
587 if (ti_is_be) bam_swap_endian_4p(&index2->n);
588 index2->m = index2->n;
589 index2->offset = (uint64_t*)calloc(index2->m, 8);
590 bgzf_read(fp, index2->offset, index2->n * 8);
592 for (j = 0; j < index2->n; ++j) bam_swap_endian_8p(&index2->offset[j]);
597 ti_index_t *ti_index_load_local(const char *fnidx)
600 fp = bgzf_open(fnidx, "r");
602 ti_index_t *idx = ti_index_load_core(fp);
609 static void download_from_remote(const char *url)
611 const int buf_size = 1 * 1024 * 1024;
617 if (strstr(url, "ftp://") != url && strstr(url, "http://") != url) return;
619 for (fn = (char*)url + l - 1; fn >= url; --fn)
620 if (*fn == '/') break;
621 ++fn; // fn now points to the file name
622 fp_remote = knet_open(url, "r");
623 if (fp_remote == 0) {
624 fprintf(pysamerr, "[download_from_remote] fail to open remote file.\n");
627 if ((fp = fopen(fn, "w")) == 0) {
628 fprintf(pysamerr, "[download_from_remote] fail to create file in the working directory.\n");
629 knet_close(fp_remote);
632 buf = (uint8_t*)calloc(buf_size, 1);
633 while ((l = knet_read(fp_remote, buf, buf_size)) != 0)
634 fwrite(buf, 1, l, fp);
637 knet_close(fp_remote);
640 static void download_from_remote(const char *url)
646 static char *get_local_version(const char *fn)
649 char *fnidx = (char*)calloc(strlen(fn) + 5, 1);
650 strcat(strcpy(fnidx, fn), ".tbi");
651 if ((strstr(fnidx, "ftp://") == fnidx || strstr(fnidx, "http://") == fnidx)) {
653 int l = strlen(fnidx);
654 for (p = fnidx + l - 1; p >= fnidx; --p)
655 if (*p == '/') break;
656 url = fnidx; fnidx = strdup(p + 1);
657 if (stat(fnidx, &sbuf) == 0) {
661 fprintf(pysamerr, "[%s] downloading the index file...\n", __func__);
662 download_from_remote(url);
665 if (stat(fnidx, &sbuf) == 0) return fnidx;
666 free(fnidx); return 0;
669 const char **ti_seqname(const ti_index_t *idx, int *n)
674 names = calloc(idx->n, sizeof(void*));
675 for (k = kh_begin(idx->tname); k < kh_end(idx->tname); ++k)
676 if (kh_exist(idx->tname, k))
677 names[kh_val(idx->tname, k)] = kh_key(idx->tname, k);
681 ti_index_t *ti_index_load(const char *fn)
684 char *fname = get_local_version(fn);
685 if (fname == 0) return 0;
686 idx = ti_index_load_local(fname);
687 if (idx == 0) fprintf(pysamerr, "[ti_index_load] fail to load the index: %s\n", fname);
692 int ti_index_build2(const char *fn, const ti_conf_t *conf, const char *_fnidx)
697 if ((fp = bgzf_open(fn, "r")) == 0) {
698 fprintf(pysamerr, "[ti_index_build2] fail to open the file: %s\n", fn);
701 idx = ti_index_core(fp, conf);
704 fnidx = (char*)calloc(strlen(fn) + 5, 1);
705 strcpy(fnidx, fn); strcat(fnidx, ".tbi");
706 } else fnidx = strdup(_fnidx);
707 fpidx = bgzf_open(fnidx, "w");
709 fprintf(pysamerr, "[ti_index_build2] fail to create the index file.\n");
713 ti_index_save(idx, fpidx);
714 ti_index_destroy(idx);
720 int ti_index_build(const char *fn, const ti_conf_t *conf)
722 return ti_index_build2(fn, conf, 0);
725 /********************************************
726 * parse a region in the format chr:beg-end *
727 ********************************************/
729 int ti_get_tid(const ti_index_t *idx, const char *name)
732 const khash_t(s) *h = idx->tname;
733 iter = kh_get(s, h, name); /* get the tid */
734 if (iter == kh_end(h)) return -1;
735 return kh_value(h, iter);
738 int ti_parse_region(const ti_index_t *idx, const char *str, int *tid, int *begin, int *end)
743 p = s = (char*)malloc(l+1);
744 /* squeeze out "," */
745 for (i = k = 0; i != l; ++i)
746 if (str[i] != ',' && !isspace(str[i])) s[k++] = str[i];
748 for (i = 0; i != k; ++i) if (s[i] == ':') break;
750 if ((*tid = ti_get_tid(idx, s)) < 0) {
754 if (i == k) { /* dump the whole sequence */
755 *begin = 0; *end = 1<<29; free(s);
758 for (p = s + i + 1; i != k; ++i) if (s[i] == '-') break;
764 if (*begin > 0) --*begin;
766 if (*begin > *end) return -1;
770 /*******************************
771 * retrieve a specified region *
772 *******************************/
774 #define MAX_BIN 37450 // =(8^6-1)/7+1
776 static inline int reg2bins(uint32_t beg, uint32_t end, uint16_t list[MAX_BIN])
779 if (beg >= end) return 0;
780 if (end >= 1u<<29) end = 1u<<29;
783 for (k = 1 + (beg>>26); k <= 1 + (end>>26); ++k) list[i++] = k;
784 for (k = 9 + (beg>>23); k <= 9 + (end>>23); ++k) list[i++] = k;
785 for (k = 73 + (beg>>20); k <= 73 + (end>>20); ++k) list[i++] = k;
786 for (k = 585 + (beg>>17); k <= 585 + (end>>17); ++k) list[i++] = k;
787 for (k = 4681 + (beg>>14); k <= 4681 + (end>>14); ++k) list[i++] = k;
791 ti_iter_t ti_iter_first()
794 iter = calloc(1, sizeof(struct __ti_iter_t));
795 iter->from_first = 1;
799 ti_iter_t ti_iter_query(const ti_index_t *idx, int tid, int beg, int end)
802 int i, n_bins, n_off;
809 if (beg < 0) beg = 0;
810 if (end < beg) return 0;
811 // initialize the iterator
812 iter = calloc(1, sizeof(struct __ti_iter_t));
813 iter->idx = idx; iter->tid = tid; iter->beg = beg; iter->end = end; iter->i = -1;
815 bins = (uint16_t*)calloc(MAX_BIN, 2);
816 n_bins = reg2bins(beg, end, bins);
817 index = idx->index[tid];
818 if (idx->index2[tid].n > 0) {
819 min_off = (beg>>TAD_LIDX_SHIFT >= idx->index2[tid].n)? idx->index2[tid].offset[idx->index2[tid].n-1]
820 : idx->index2[tid].offset[beg>>TAD_LIDX_SHIFT];
821 if (min_off == 0) { // improvement for index files built by tabix prior to 0.1.4
822 int n = beg>>TAD_LIDX_SHIFT;
823 if (n > idx->index2[tid].n) n = idx->index2[tid].n;
824 for (i = n - 1; i >= 0; --i)
825 if (idx->index2[tid].offset[i] != 0) break;
826 if (i >= 0) min_off = idx->index2[tid].offset[i];
828 } else min_off = 0; // tabix 0.1.2 may produce such index files
829 for (i = n_off = 0; i < n_bins; ++i) {
830 if ((k = kh_get(i, index, bins[i])) != kh_end(index))
831 n_off += kh_value(index, k).n;
834 free(bins); return iter;
836 off = (pair64_t*)calloc(n_off, 16);
837 for (i = n_off = 0; i < n_bins; ++i) {
838 if ((k = kh_get(i, index, bins[i])) != kh_end(index)) {
840 ti_binlist_t *p = &kh_value(index, k);
841 for (j = 0; j < p->n; ++j)
842 if (p->list[j].v > min_off) off[n_off++] = p->list[j];
846 free(bins); free(off); return iter;
851 ks_introsort(offt, n_off, off);
852 // resolve completely contained adjacent blocks
853 for (i = 1, l = 0; i < n_off; ++i)
854 if (off[l].v < off[i].v)
857 // resolve overlaps between adjacent blocks; this may happen due to the merge in indexing
858 for (i = 1; i < n_off; ++i)
859 if (off[i-1].v >= off[i].u) off[i-1].v = off[i].u;
860 { // merge adjacent blocks
861 for (i = 1, l = 0; i < n_off; ++i) {
862 if (off[l].v>>16 == off[i].u>>16) off[l].v = off[i].v;
863 else off[++l] = off[i];
868 iter->n_off = n_off; iter->off = off;
872 const char *ti_iter_read(BGZF *fp, ti_iter_t iter, int *len)
874 if (iter->finished) return 0;
875 if (iter->from_first) {
877 if ((ret = ti_readline(fp, &iter->str)) < 0) {
881 if (len) *len = iter->str.l;
885 if (iter->n_off == 0) return 0;
888 if (iter->curr_off == 0 || iter->curr_off >= iter->off[iter->i].v) { // then jump to the next chunk
889 if (iter->i == iter->n_off - 1) break; // no more chunks
890 if (iter->i >= 0) assert(iter->curr_off == iter->off[iter->i].v); // otherwise bug
891 if (iter->i < 0 || iter->off[iter->i].v != iter->off[iter->i+1].u) { // not adjacent chunks; then seek
892 bgzf_seek(fp, iter->off[iter->i+1].u, SEEK_SET);
893 iter->curr_off = bgzf_tell(fp);
897 if ((ret = ti_readline(fp, &iter->str)) >= 0) {
899 iter->curr_off = bgzf_tell(fp);
900 if (iter->str.s[0] == iter->idx->conf.meta_char) continue;
901 get_intv((ti_index_t*)iter->idx, &iter->str, &intv);
902 if (intv.tid != iter->tid || intv.beg >= iter->end) break; // no need to proceed
903 else if (intv.end > iter->beg && iter->end > intv.beg) {
904 if (len) *len = iter->str.l;
907 } else break; // end of file
913 void ti_iter_destroy(ti_iter_t iter)
916 free(iter->str.s); free(iter->off);
921 int ti_fetch(BGZF *fp, const ti_index_t *idx, int tid, int beg, int end, void *data, ti_fetch_f func)
926 iter = ti_iter_query(idx, tid, beg, end);
927 while ((s = ti_iter_read(fp, iter, &len)) != 0)
929 ti_iter_destroy(iter);
933 const ti_conf_t *ti_get_conf(ti_index_t *idx) { return idx? &idx->conf : 0; }
939 tabix_t *ti_open(const char *fn, const char *fnidx)
943 if ((fp = bgzf_open(fn, "r")) == 0) return 0;
944 t = calloc(1, sizeof(tabix_t));
946 if (fnidx) t->fnidx = strdup(fnidx);
951 void ti_close(tabix_t *t)
955 if (t->idx) ti_index_destroy(t->idx);
956 free(t->fn); free(t->fnidx);
961 int ti_lazy_index_load(tabix_t *t)
963 if (t->idx == 0) { // load index
964 if (t->fnidx) t->idx = ti_index_load_local(t->fnidx);
965 else t->idx = ti_index_load(t->fn);
966 if (t->idx == 0) return -1; // fail to load index
971 ti_iter_t ti_queryi(tabix_t *t, int tid, int beg, int end)
973 if (tid < 0) return ti_iter_first();
974 if (ti_lazy_index_load(t) != 0) return 0;
975 return ti_iter_query(t->idx, tid, beg, end);
978 ti_iter_t ti_querys(tabix_t *t, const char *reg)
981 if (reg == 0) return ti_iter_first();
982 if (ti_lazy_index_load(t) != 0) return 0;
983 if (ti_parse_region(t->idx, reg, &tid, &beg, &end) < 0) return 0;
984 return ti_iter_query(t->idx, tid, beg, end);
987 ti_iter_t ti_query(tabix_t *t, const char *name, int beg, int end)
990 if (name == 0) return ti_iter_first();
991 // then need to load the index
992 if (ti_lazy_index_load(t) != 0) return 0;
993 if ((tid = ti_get_tid(t->idx, name)) < 0) return 0;
994 return ti_iter_query(t->idx, tid, beg, end);
997 const char *ti_read(tabix_t *t, ti_iter_t iter, int *len)
999 return ti_iter_read(t->fp, iter, len);