10 uint64_t len:32, line_len:16, line_blen:16;
13 KHASH_MAP_INIT_STR(s, faidx1_t)
18 extern off_t ftello(FILE *stream);
19 extern int fseeko(FILE *stream, off_t offset, int whence);
21 #define razf_read(fp, buf, size) fread(buf, 1, size, fp)
22 #define razf_open(fn, mode) fopen(fn, mode)
23 #define razf_close(fp) fclose(fp)
24 #define razf_seek(fp, offset, whence) fseeko(fp, offset, whence)
25 #define razf_tell(fp) ftello(fp)
36 #define kroundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
39 static inline void fai_insert_index(faidx_t *idx, const char *name, int len, int line_len, int line_blen, uint64_t offset)
44 if (idx->n == idx->m) {
45 idx->m = idx->m? idx->m<<1 : 16;
46 idx->name = (char**)realloc(idx->name, sizeof(void*) * idx->m);
48 idx->name[idx->n] = strdup(name);
49 k = kh_put(s, idx->hash, idx->name[idx->n], &ret);
50 t.len = len; t.line_len = line_len; t.line_blen = line_blen; t.offset = offset;
51 kh_value(idx->hash, k) = t;
55 faidx_t *fai_build_core(RAZF *rz)
58 int l_name, m_name, ret;
59 int len, line_len, line_blen, state;
64 idx = (faidx_t*)calloc(1, sizeof(faidx_t));
65 idx->hash = kh_init(s);
66 name = 0; l_name = m_name = 0;
67 len = line_len = line_blen = -1; state = 0; l1 = l2 = -1; offset = 0;
68 while (razf_read(rz, &c, 1)) {
69 if (c == '>') { // fasta header
71 fai_insert_index(idx, name, len, line_len, line_blen, offset);
73 while ((ret = razf_read(rz, &c, 1)) != 0 && !isspace(c)) {
74 if (m_name < l_name + 2) {
77 name = (char*)realloc(name, m_name);
83 if (c != '\n') while (razf_read(rz, &c, 1) && c != '\n');
85 offset = razf_tell(rz);
88 fprintf(stderr, "[fai_build_core] inlined empty line is not allowed in sequence '%s'. Abort!\n", name);
91 if (state == 2) state = 3;
96 } while ((ret = razf_read(rz, &c, 1)) && c != '\n');
97 if (state == 3 && l2) {
98 fprintf(stderr, "[fai_build_core] different line length in sequence '%s'. Abort!\n", name);
103 fprintf(stderr, "[fai_build_core] line length exceeds 65535 in sequence '%s'. Abort!\n", name);
106 if (state == 1) line_len = l1, line_blen = l2, state = 0;
107 else if (state == 0) {
108 if (l1 != line_len || l2 != line_blen) state = 2;
112 fai_insert_index(idx, name, len, line_len, line_blen, offset);
117 void fai_save(const faidx_t *fai, FILE *fp)
121 for (i = 0; i < fai->n; ++i) {
123 k = kh_get(s, fai->hash, fai->name[i]);
124 x = kh_value(fai->hash, k);
125 fprintf(fp, "%s\t%d\t%lld\t%d\t%d\n", fai->name[i], (int)x.len, (long long)x.offset, (int)x.line_blen, (int)x.line_len);
129 faidx_t *fai_read(FILE *fp)
133 int len, line_len, line_blen;
135 fai = (faidx_t*)calloc(1, sizeof(faidx_t));
136 fai->hash = kh_init(s);
137 buf = (char*)calloc(0x10000, 1);
138 while (!feof(fp) && fgets(buf, 0x10000, fp)) {
139 for (p = buf; *p && isgraph(*p); ++p);
141 sscanf(p, "%d%lld%d%d", &len, &offset, &line_blen, &line_len);
142 fai_insert_index(fai, buf, len, line_len, line_blen, offset);
148 void fai_destroy(faidx_t *fai)
151 for (i = 0; i < fai->n; ++i) free(fai->name[i]);
153 kh_destroy(s, fai->hash);
154 if (fai->rz) razf_close(fai->rz);
158 void fai_build(const char *fn)
164 str = (char*)calloc(strlen(fn) + 5, 1);
165 sprintf(str, "%s.fai", fn);
166 rz = razf_open(fn, "r");
168 fai = fai_build_core(rz);
170 fp = fopen(str, "w");
178 faidx_t *fai_load(const char *fn)
183 str = (char*)calloc(strlen(fn) + 5, 1);
184 sprintf(str, "%s.fai", fn);
185 fp = fopen(str, "r");
187 fprintf(stderr, "[fai_load] build FASTA index.\n");
189 fp = fopen(str, "r");
197 fai->rz = razf_open(fn, "r");
198 if (fai->rz == 0) return 0;
204 char *fai_fetch(const faidx_t *fai, const char *str, int *len)
216 p = s = (char*)malloc(l+1);
217 /* squeeze out "," */
218 for (i = k = 0; i != l; ++i)
219 if (str[i] != ',' && !isspace(str[i])) s[k++] = str[i];
221 for (i = 0; i != k; ++i) if (s[i] == ':') break;
223 iter = kh_get(s, h, s); /* get the ref_id */
224 if (iter == kh_end(h)) {
228 val = kh_value(h, iter);
229 if (i == k) { /* dump the whole sequence */
230 beg = 0; end = val.len;
232 for (p = s + i + 1; i != k; ++i) if (s[i] == '-') break;
237 } else end = val.len;
240 if (beg >= val.len) beg = val.len;
241 if (end >= val.len) end = val.len;
242 if (beg > end) beg = end;
245 // now retrieve the sequence
247 s = (char*)malloc(end - beg + 2);
248 razf_seek(fai->rz, val.offset + beg / val.line_blen * val.line_len + beg % val.line_blen, SEEK_SET);
249 while (razf_read(fai->rz, &c, 1) == 1 && l < end - beg)
250 if (isgraph(c)) s[l++] = c;
256 int faidx_main(int argc, char *argv[])
259 fprintf(stderr, "Usage: faidx <in.fasta> [<reg> [...]]\n");
262 if (argc == 2) fai_build(argv[1]);
267 fai = fai_load(argv[1]);
269 for (i = 2; i != argc; ++i) {
270 printf(">%s\n", argv[i]);
271 s = fai_fetch(fai, argv[i], &l);
272 for (j = 0; j < l; j += 60) {
273 for (k = 0; k < 60 && k < l - j; ++k)
286 int main(int argc, char *argv[]) { return faidx_main(argc, argv); }