6 KHASH_MAP_INIT_STR(str2id, int)
8 void *bcf_build_refhash(bcf_hdr_t *h)
10 khash_t(str2id) *hash;
12 hash = kh_init(str2id);
13 for (i = 0; i < h->n_ref; ++i) {
15 k = kh_put(str2id, hash, h->ns[i], &ret); // FIXME: check ret
21 void *bcf_str2id_init()
23 return kh_init(str2id);
26 void bcf_str2id_destroy(void *_hash)
28 khash_t(str2id) *hash = (khash_t(str2id)*)_hash;
29 if (hash) kh_destroy(str2id, hash); // Note that strings are not freed.
32 void bcf_str2id_thorough_destroy(void *_hash)
34 khash_t(str2id) *hash = (khash_t(str2id)*)_hash;
36 if (hash == 0) return;
37 for (k = 0; k < kh_end(hash); ++k)
38 if (kh_exist(hash, k)) free((char*)kh_key(hash, k));
39 kh_destroy(str2id, hash);
42 int bcf_str2id(void *_hash, const char *str)
44 khash_t(str2id) *hash = (khash_t(str2id)*)_hash;
47 k = kh_get(str2id, hash, str);
48 return k == kh_end(hash)? -1 : kh_val(hash, k);
51 int bcf_str2id_add(void *_hash, const char *str)
55 khash_t(str2id) *hash = (khash_t(str2id)*)_hash;
57 k = kh_put(str2id, hash, str, &ret);
58 if (ret == 0) return kh_val(hash, k);
59 kh_val(hash, k) = kh_size(hash) - 1;
60 return kh_val(hash, k);
63 int bcf_shrink_alt(bcf1_t *b, int n)
66 int i, j, k, *z, n_smpl = b->n_smpl;
67 if (b->n_alleles <= n) return -1;
69 for (p = b->alt, k = 1; *p; ++p)
70 if (*p == ',' && ++k == n) break;
72 } else p = b->alt, *p = '\0';
74 memmove(p, b->flt, b->str + b->l_str - b->flt);
75 b->l_str -= b->flt - p;
76 z = alloca(sizeof(int) / 2 * n * (n+1));
77 for (i = k = 0; i < n; ++i)
78 for (j = 0; j < n - i; ++j)
79 z[k++] = i * b->n_alleles + j;
80 for (i = 0; i < b->n_gi; ++i) {
81 bcf_ginfo_t *g = b->gi + i;
82 if (g->fmt == bcf_str2int("PL", 2)) {
83 int l, x = b->n_alleles * (b->n_alleles + 1) / 2;
84 uint8_t *d = (uint8_t*)g->data;
85 g->len = n * (n + 1) / 2;
86 for (l = k = 0; l < n_smpl; ++l) {
87 uint8_t *dl = d + l * x;
88 for (j = 0; j < g->len; ++j) d[k++] = dl[z[j]];
97 int bcf_gl2pl(bcf1_t *b)
100 int i, n_smpl = b->n_smpl;
104 if (strstr(b->fmt, "PL")) return -1;
105 if ((p = strstr(b->fmt, "GL")) == 0) return -1;
107 for (i = 0; i < b->n_gi; ++i)
108 if (b->gi[i].fmt == bcf_str2int("GL", 2))
111 g->fmt = bcf_str2int("PL", 2);
112 g->len /= 4; // 4 == sizeof(float)
113 d0 = (float*)g->data; d1 = (uint8_t*)g->data;
114 for (i = 0; i < n_smpl * g->len; ++i) {
115 int x = (int)(-10. * d0[i] + .499);
116 if (x > 255) x = 255;
122 /* FIXME: this function will fail given AB:GTX:GT. BCFtools never
123 * produces such FMT, but others may do. */
124 int bcf_fix_gt(bcf1_t *b)
130 // check the presence of the GT FMT
131 if ((s = strstr(b->fmt, ":GT")) == 0) return 0; // no GT or GT is already the first
132 if (s[3] != '\0' && s[3] != ':') return 0; // :GTX in fact
133 tmp = bcf_str2int("GT", 2);
134 for (i = 0; i < b->n_gi; ++i)
135 if (b->gi[i].fmt == tmp) break;
136 if (i == b->n_gi) return 0; // no GT in b->gi; probably a bug...
138 // move GT to the first
139 for (; i > 0; --i) b->gi[i] = b->gi[i-1];
141 memmove(b->fmt + 3, b->fmt, s + 1 - b->fmt);
142 b->fmt[0] = 'G'; b->fmt[1] = 'T'; b->fmt[2] = ':';
146 static void *locate_field(const bcf1_t *b, const char *fmt, int l)
150 tmp = bcf_str2int(fmt, l);
151 for (i = 0; i < b->n_gi; ++i)
152 if (b->gi[i].fmt == tmp) break;
153 return i == b->n_gi? 0 : b->gi[i].data;
156 int bcf_anno_max(bcf1_t *b)
158 int k, max_gq, max_sp, n_het;
160 uint8_t *gt, *gq, *sp;
161 max_gq = max_sp = n_het = 0;
162 gt = locate_field(b, "GT", 2);
163 if (gt == 0) return -1;
164 gq = locate_field(b, "GQ", 2);
165 sp = locate_field(b, "SP", 2);
167 for (k = 0; k < b->n_smpl; ++k)
169 max_sp = max_sp > (int)sp[k]? max_sp : sp[k];
171 for (k = 0; k < b->n_smpl; ++k)
173 max_gq = max_gq > (int)gq[k]? max_gq : gq[k];
174 for (k = 0; k < b->n_smpl; ++k) {
176 a1 = gt[k]&7; a2 = gt[k]>>3&7;
177 if ((!a1 && a2) || (!a2 && a1)) { // a het
178 if (gq == 0) ++n_het;
179 else if (gq[k] >= 20) ++n_het;
182 if (n_het) max_sp -= (int)(4.343 * log(n_het) + .499);
183 if (max_sp < 0) max_sp = 0;
184 memset(&str, 0, sizeof(kstring_t));
185 if (*b->info) kputc(';', &str);
186 ksprintf(&str, "MXSP=%d;MXGQ=%d", max_sp, max_gq);
187 bcf_append_info(b, str.s, str.l);
192 bcf_hdr_t *bcf_hdr_subsam(const bcf_hdr_t *h0, int n, char *const* samples, int *list)
197 khash_t(str2id) *hash;
199 s.l = s.m = 0; s.s = 0;
200 hash = kh_init(str2id);
201 for (i = 0; i < n; ++i)
202 k = kh_put(str2id, hash, samples[i], &ret);
203 for (i = j = 0; i < h0->n_smpl; ++i) {
204 if (kh_get(str2id, hash, h0->sns[i]) != kh_end(hash)) {
206 kputs(h0->sns[i], &s); kputc('\0', &s);
209 if (j < n) fprintf(stderr, "<%s> %d samples in the list but not in BCF.", __func__, n - j);
210 kh_destroy(str2id, hash);
211 h = calloc(1, sizeof(bcf_hdr_t));
213 h->ns = 0; h->sns = 0;
214 h->name = malloc(h->l_nm); memcpy(h->name, h0->name, h->l_nm);
215 h->txt = calloc(1, h->l_txt + 1); memcpy(h->txt, h0->txt, h->l_txt);
216 h->l_smpl = s.l; h->sname = s.s;
221 int bcf_subsam(int n_smpl, int *list, bcf1_t *b) // list MUST BE sorted
224 for (j = 0; j < b->n_gi; ++j) {
225 bcf_ginfo_t *gi = b->gi + j;
226 for (i = 0; i < n_smpl; ++i)
227 memcpy((uint8_t*)gi->data + i * gi->len, (uint8_t*)gi->data + list[i] * gi->len, gi->len);