-
Notifications
You must be signed in to change notification settings - Fork 443
/
tbx.c
529 lines (483 loc) · 17.1 KB
/
tbx.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
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
/* tbx.c -- tabix API functions.
Copyright (C) 2009, 2010, 2012-2015, 2017-2020, 2022-2023 Genome Research Ltd.
Copyright (C) 2010-2012 Broad Institute.
Author: Heng Li <[email protected]>
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. */
#define HTS_BUILDING_LIBRARY // Enables HTSLIB_EXPORT, see htslib/hts_defs.h
#include <config.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <assert.h>
#include <errno.h>
#include "htslib/tbx.h"
#include "htslib/bgzf.h"
#include "htslib/hts_endian.h"
#include "hts_internal.h"
#include "htslib/khash.h"
KHASH_DECLARE(s2i, kh_cstr_t, int64_t)
HTSLIB_EXPORT
const tbx_conf_t tbx_conf_gff = { 0, 1, 4, 5, '#', 0 };
HTSLIB_EXPORT
const tbx_conf_t tbx_conf_bed = { TBX_UCSC, 1, 2, 3, '#', 0 };
HTSLIB_EXPORT
const tbx_conf_t tbx_conf_psltbl = { TBX_UCSC, 15, 17, 18, '#', 0 };
HTSLIB_EXPORT
const tbx_conf_t tbx_conf_sam = { TBX_SAM, 3, 4, 0, '@', 0 };
HTSLIB_EXPORT
const tbx_conf_t tbx_conf_vcf = { TBX_VCF, 1, 2, 0, '#', 0 };
const tbx_conf_t tbx_conf_gaf = { TBX_GAF, 1, 6, 0, '#', 0 };
typedef struct {
int64_t beg, end;
char *ss, *se;
int tid;
} tbx_intv_t;
static inline int get_tid(tbx_t *tbx, const char *ss, int is_add)
{
khint_t k;
khash_t(s2i) *d;
if ((tbx->conf.preset&0xffff) == TBX_GAF) return(0);
if (tbx->dict == 0) tbx->dict = kh_init(s2i);
if (!tbx->dict) return -1; // Out of memory
d = (khash_t(s2i)*)tbx->dict;
if (is_add) {
int absent;
k = kh_put(s2i, d, ss, &absent);
if (absent < 0) {
return -1; // Out of memory
} else if (absent) {
char *ss_dup = strdup(ss);
if (ss_dup) {
kh_key(d, k) = ss_dup;
kh_val(d, k) = kh_size(d) - 1;
} else {
kh_del(s2i, d, k);
return -1; // Out of memory
}
}
} else k = kh_get(s2i, d, ss);
return k == kh_end(d)? -1 : kh_val(d, k);
}
int tbx_name2id(tbx_t *tbx, const char *ss)
{
return get_tid(tbx, ss, 0);
}
int tbx_parse1(const tbx_conf_t *conf, size_t len, char *line, tbx_intv_t *intv)
{
size_t i, b = 0;
int id = 1;
char *s;
intv->ss = intv->se = 0; intv->beg = intv->end = -1;
for (i = 0; i <= len; ++i) {
if (line[i] == '\t' || line[i] == 0) {
if (id == conf->sc) {
intv->ss = line + b; intv->se = line + i;
} else if (id == conf->bc) {
// here ->beg is 0-based.
if ((conf->preset&0xffff) == TBX_GAF){
// if gaf find the smallest and largest node id
char *t;
int64_t nodeid = -1;
for (s = line + b + 1; s < line + i;) {
nodeid = strtoll(s, &t, 0);
if(intv->beg == -1){
intv->beg = intv->end = nodeid;
} else {
if(nodeid < intv->beg){
intv->beg = nodeid;
}
if(nodeid > intv->end){
intv->end = nodeid;
}
}
s = t + 1;
}
} else {
intv->beg = strtoll(line + b, &s, 0);
if (conf->bc <= conf->ec) // don't overwrite an already set end point
intv->end = intv->beg;
if ( s==line+b ) return -1; // expected int
if (!(conf->preset&TBX_UCSC))
--intv->beg;
else if (conf->bc <= conf->ec)
++intv->end;
if (intv->beg < 0) {
hts_log_warning("Coordinate <= 0 detected. "
"Did you forget to use the -0 option?");
intv->beg = 0;
}
if (intv->end < 1) intv->end = 1;
}
} else {
if ((conf->preset&0xffff) == TBX_GENERIC) {
if (id == conf->ec)
{
intv->end = strtoll(line + b, &s, 0);
if ( s==line+b ) return -1; // expected int
}
} else if ((conf->preset&0xffff) == TBX_SAM) {
if (id == 6) { // CIGAR
int l = 0;
char *t;
for (s = line + b; s < line + i;) {
long x = strtol(s, &t, 10);
char op = toupper_c(*t);
if (op == 'M' || op == 'D' || op == 'N') l += x;
s = t + 1;
}
if (l == 0) l = 1;
intv->end = intv->beg + l;
}
} else if ((conf->preset&0xffff) == TBX_VCF) {
if (id == 4) {
if (b < i) intv->end = intv->beg + (i - b);
} else if (id == 8) { // look for "END="
int c = line[i];
line[i] = 0;
s = strstr(line + b, "END=");
if (s == line + b) s += 4;
else if (s) {
s = strstr(line + b, ";END=");
if (s) s += 5;
}
if (s && *s != '.') {
long long end = strtoll(s, &s, 0);
if (end <= intv->beg) {
static int reported = 0;
if (!reported) {
int l = intv->ss ? (int) (intv->se - intv->ss) : 0;
hts_log_warning("VCF INFO/END=%lld is smaller than POS at %.*s:%"PRIhts_pos"\n"
"This tag will be ignored. "
"Note: only one invalid END tag will be reported.",
end, l >= 0 ? l : 0,
intv->ss ? intv->ss : "",
intv->beg);
reported = 1;
}
} else {
intv->end = end;
}
}
line[i] = c;
}
}
}
b = i + 1;
++id;
}
}
if (intv->ss == 0 || intv->se == 0 || intv->beg < 0 || intv->end < 0) return -1;
return 0;
}
static inline int get_intv(tbx_t *tbx, kstring_t *str, tbx_intv_t *intv, int is_add)
{
if (tbx_parse1(&tbx->conf, str->l, str->s, intv) == 0) {
int c = *intv->se;
*intv->se = '\0';
if ((tbx->conf.preset&0xffff) == TBX_GAF){
intv->tid = 0;
} else {
intv->tid = get_tid(tbx, intv->ss, is_add);
}
*intv->se = c;
if (intv->tid < 0) return -2; // get_tid out of memory
return (intv->beg >= 0 && intv->end >= 0)? 0 : -1;
} else {
char *type = NULL;
switch (tbx->conf.preset&0xffff)
{
case TBX_SAM: type = "TBX_SAM"; break;
case TBX_VCF: type = "TBX_VCF"; break;
case TBX_GAF: type = "TBX_GAF"; break;
case TBX_UCSC: type = "TBX_UCSC"; break;
default: type = "TBX_GENERIC"; break;
}
if (hts_is_utf16_text(str))
hts_log_error("Failed to parse %s: offending line appears to be encoded as UTF-16", type);
else
hts_log_error("Failed to parse %s: was wrong -p [type] used?\nThe offending line was: \"%s\"",
type, str->s);
return -1;
}
}
/*
* Called by tabix iterator to read the next record.
* Returns >= 0 on success
* -1 on EOF
* <= -2 on error
*/
int tbx_readrec(BGZF *fp, void *tbxv, void *sv, int *tid, hts_pos_t *beg, hts_pos_t *end)
{
tbx_t *tbx = (tbx_t *) tbxv;
kstring_t *s = (kstring_t *) sv;
int ret;
if ((ret = bgzf_getline(fp, '\n', s)) >= 0) {
tbx_intv_t intv;
if (get_intv(tbx, s, &intv, 0) < 0)
return -2;
*tid = intv.tid; *beg = intv.beg; *end = intv.end;
}
return ret;
}
static int tbx_set_meta(tbx_t *tbx)
{
int i, l = 0, l_nm;
uint32_t x[7];
char **name;
uint8_t *meta;
khint_t k;
khash_t(s2i) *d = (khash_t(s2i)*)tbx->dict;
memcpy(x, &tbx->conf, 24);
name = (char**)malloc(sizeof(char*) * kh_size(d));
if (!name) return -1;
for (k = kh_begin(d), l = 0; k != kh_end(d); ++k) {
if (!kh_exist(d, k)) continue;
name[kh_val(d, k)] = (char*)kh_key(d, k);
l += strlen(kh_key(d, k)) + 1; // +1 to include '\0'
}
l_nm = x[6] = l;
meta = (uint8_t*)malloc(l_nm + 28);
if (!meta) { free(name); return -1; }
if (ed_is_big())
for (i = 0; i < 7; ++i)
x[i] = ed_swap_4(x[i]);
memcpy(meta, x, 28);
for (l = 28, i = 0; i < (int)kh_size(d); ++i) {
int x = strlen(name[i]) + 1;
memcpy(meta + l, name[i], x);
l += x;
}
free(name);
hts_idx_set_meta(tbx->idx, l, meta, 0);
return 0;
}
// Minimal effort parser to extract reference length out of VCF header line
// This is used only used to adjust the number of levels if necessary,
// so not a major problem if it doesn't always work.
static void adjust_max_ref_len_vcf(const char *str, int64_t *max_ref_len)
{
const char *ptr;
int64_t len;
if (strncmp(str, "##contig", 8) != 0) return;
ptr = strstr(str + 8, "length");
if (!ptr) return;
for (ptr += 6; *ptr == ' ' || *ptr == '='; ptr++) {}
len = strtoll(ptr, NULL, 10);
if (*max_ref_len < len) *max_ref_len = len;
}
// Same for sam files
static void adjust_max_ref_len_sam(const char *str, int64_t *max_ref_len)
{
const char *ptr;
int64_t len;
if (strncmp(str, "@SQ", 3) != 0) return;
ptr = strstr(str + 3, "\tLN:");
if (!ptr) return;
ptr += 4;
len = strtoll(ptr, NULL, 10);
if (*max_ref_len < len) *max_ref_len = len;
}
// Adjusts number of levels if not big enough. This can happen for
// files with very large contigs.
static int adjust_n_lvls(int min_shift, int n_lvls, int64_t max_len)
{
int64_t s = hts_bin_maxpos(min_shift, n_lvls);
max_len += 256;
for (; max_len > s; ++n_lvls, s <<= 3) {}
return n_lvls;
}
tbx_t *tbx_index(BGZF *fp, int min_shift, const tbx_conf_t *conf)
{
tbx_t *tbx;
kstring_t str;
int ret, first = 0, n_lvls, fmt;
int64_t lineno = 0;
uint64_t last_off = 0;
tbx_intv_t intv;
int64_t max_ref_len = 0;
str.s = 0; str.l = str.m = 0;
tbx = (tbx_t*)calloc(1, sizeof(tbx_t));
if (!tbx) return NULL;
tbx->conf = *conf;
if (min_shift > 0) n_lvls = (TBX_MAX_SHIFT - min_shift + 2) / 3, fmt = HTS_FMT_CSI;
else min_shift = 14, n_lvls = 5, fmt = HTS_FMT_TBI;
while ((ret = bgzf_getline(fp, '\n', &str)) >= 0) {
++lineno;
if (str.s[0] == tbx->conf.meta_char && fmt == HTS_FMT_CSI) {
switch (tbx->conf.preset) {
case TBX_SAM:
adjust_max_ref_len_sam(str.s, &max_ref_len); break;
case TBX_VCF:
adjust_max_ref_len_vcf(str.s, &max_ref_len); break;
default:
break;
}
}
if (lineno <= tbx->conf.line_skip || str.s[0] == tbx->conf.meta_char) {
last_off = bgzf_tell(fp);
continue;
}
if (first == 0) {
if (fmt == HTS_FMT_CSI) {
if (!max_ref_len)
max_ref_len = (int64_t)100*1024*1024*1024; // 100G default
n_lvls = adjust_n_lvls(min_shift, n_lvls, max_ref_len);
}
tbx->idx = hts_idx_init(0, fmt, last_off, min_shift, n_lvls);
if (!tbx->idx) goto fail;
first = 1;
}
ret = get_intv(tbx, &str, &intv, 1);
if (ret < -1) goto fail; // Out of memory
if (ret < 0) continue; // Skip unparsable lines
if (hts_idx_push(tbx->idx, intv.tid, intv.beg, intv.end,
bgzf_tell(fp), 1) < 0) {
goto fail;
}
}
if (ret < -1) goto fail;
if ( !tbx->idx ) tbx->idx = hts_idx_init(0, fmt, last_off, min_shift, n_lvls); // empty file
if (!tbx->idx) goto fail;
if ( !tbx->dict ) tbx->dict = kh_init(s2i);
if (!tbx->dict) goto fail;
if (hts_idx_finish(tbx->idx, bgzf_tell(fp)) != 0) goto fail;
if (tbx_set_meta(tbx) != 0) goto fail;
free(str.s);
return tbx;
fail:
free(str.s);
tbx_destroy(tbx);
return NULL;
}
void tbx_destroy(tbx_t *tbx)
{
khash_t(s2i) *d = (khash_t(s2i)*)tbx->dict;
if (d != NULL)
{
khint_t k;
for (k = kh_begin(d); k != kh_end(d); ++k)
if (kh_exist(d, k)) free((char*)kh_key(d, k));
}
hts_idx_destroy(tbx->idx);
kh_destroy(s2i, d);
free(tbx);
}
int tbx_index_build3(const char *fn, const char *fnidx, int min_shift, int n_threads, const tbx_conf_t *conf)
{
tbx_t *tbx;
BGZF *fp;
int ret;
if ((fp = bgzf_open(fn, "r")) == 0) return -1;
if ( n_threads ) bgzf_mt(fp, n_threads, 256);
if ( bgzf_compression(fp) != bgzf ) { bgzf_close(fp); return -2; }
tbx = tbx_index(fp, min_shift, conf);
bgzf_close(fp);
if ( !tbx ) return -1;
ret = hts_idx_save_as(tbx->idx, fn, fnidx, min_shift > 0? HTS_FMT_CSI : HTS_FMT_TBI);
tbx_destroy(tbx);
return ret;
}
int tbx_index_build2(const char *fn, const char *fnidx, int min_shift, const tbx_conf_t *conf)
{
return tbx_index_build3(fn, fnidx, min_shift, 0, conf);
}
int tbx_index_build(const char *fn, int min_shift, const tbx_conf_t *conf)
{
return tbx_index_build3(fn, NULL, min_shift, 0, conf);
}
static tbx_t *index_load(const char *fn, const char *fnidx, int flags)
{
tbx_t *tbx;
uint8_t *meta;
char *nm, *p;
uint32_t l_meta, l_nm;
tbx = (tbx_t*)calloc(1, sizeof(tbx_t));
if (!tbx)
return NULL;
tbx->idx = hts_idx_load3(fn, fnidx, HTS_FMT_TBI, flags);
if ( !tbx->idx )
{
free(tbx);
return NULL;
}
meta = hts_idx_get_meta(tbx->idx, &l_meta);
if ( !meta || l_meta < 28) goto invalid;
tbx->conf.preset = le_to_i32(&meta[0]);
tbx->conf.sc = le_to_i32(&meta[4]);
tbx->conf.bc = le_to_i32(&meta[8]);
tbx->conf.ec = le_to_i32(&meta[12]);
tbx->conf.meta_char = le_to_i32(&meta[16]);
tbx->conf.line_skip = le_to_i32(&meta[20]);
l_nm = le_to_u32(&meta[24]);
if (l_nm > l_meta - 28) goto invalid;
p = nm = (char*)meta + 28;
// This assumes meta is NUL-terminated, so we can merrily strlen away.
// hts_idx_load_local() assures this for us by adding a NUL on the end
// of whatever it reads.
for (; p - nm < l_nm; p += strlen(p) + 1) {
if (get_tid(tbx, p, 1) < 0) {
hts_log_error("%s", strerror(errno));
goto fail;
}
}
return tbx;
invalid:
hts_log_error("Invalid index header for %s", fnidx ? fnidx : fn);
fail:
tbx_destroy(tbx);
return NULL;
}
tbx_t *tbx_index_load3(const char *fn, const char *fnidx, int flags)
{
return index_load(fn, fnidx, flags);
}
tbx_t *tbx_index_load2(const char *fn, const char *fnidx)
{
return index_load(fn, fnidx, 1);
}
tbx_t *tbx_index_load(const char *fn)
{
return index_load(fn, NULL, 1);
}
const char **tbx_seqnames(tbx_t *tbx, int *n)
{
khash_t(s2i) *d = (khash_t(s2i)*)tbx->dict;
if (d == NULL)
{
*n = 0;
return calloc(1, sizeof(char *));
}
int tid, m = kh_size(d);
const char **names = (const char**) calloc(m,sizeof(const char*));
khint_t k;
if (!names) {
*n = 0;
return NULL;
}
for (k=kh_begin(d); k<kh_end(d); k++)
{
if ( !kh_exist(d,k) ) continue;
tid = kh_val(d,k);
assert( tid<m );
names[tid] = kh_key(d,k);
}
// sanity check: there should be no gaps
for (tid=0; tid<m; tid++)
assert(names[tid]);
*n = m;
return names;
}