57 #define ks_eof(ks) ((ks)->is_eof && (ks)->begin >= (ks)->end)  argument
58 #define ks_rewind(ks) ((ks)->is_eof = (ks)->begin = (ks)->end = 0)  argument
63 		kstream_t *ks = (kstream_t*)calloc(1, sizeof(kstream_t)); \
64 		ks->f = f; ks->bufsize = __bufsize; \
65 		ks->buf = (unsigned char*)malloc(__bufsize); \
66 		return ks; \
68 	SCOPE void ks_destroy(kstream_t *ks) \
70 		if (!ks) return; \
71 		free(ks->buf); \
72 		free(ks); \
76 	static inline klib_unused int ks_getc(kstream_t *ks) \
78 		if (ks->is_eof && ks->begin >= ks->end) return -1; \
79 		if (ks->begin >= ks->end) { \
80 			ks->begin = 0; \
81 			ks->end = __read(ks->f, ks->buf, ks->bufsize); \
82 			if (ks->end == 0) { ks->is_eof = 1; return -1; } \
84         ks->seek_pos++; \
85 		return (int)ks->buf[ks->begin++]; \
87 …static inline klib_unused int ks_getuntil(kstream_t *ks, int delimiter, kstring_t *str, int *dret)…
88 	{ return ks_getuntil2(ks, delimiter, str, dret, 0); }
103 	SCOPE int ks_getuntil2(kstream_t *ks, int delimiter, kstring_t *str, int *dret, int append)  \
111 			if (ks->begin >= ks->end) { \
112 				if (!ks->is_eof) { \
113 					ks->begin = 0; \
114 					ks->end = __read(ks->f, ks->buf, ks->bufsize); \
115 					if (ks->end == 0) { ks->is_eof = 1; break; } \
119 				for (i = ks->begin; i < ks->end; ++i)  \
120 					if (ks->buf[i] == '\n') break; \
122 				for (i = ks->begin; i < ks->end; ++i) \
123 					if (ks->buf[i] == delimiter) break; \
125 				for (i = ks->begin; i < ks->end; ++i) \
126 					if (isspace(ks->buf[i])) break; \
128 				for (i = ks->begin; i < ks->end; ++i) \
129 					if (isspace(ks->buf[i]) && ks->buf[i] != ' ') break;  \
131 			if (str->m - str->l < (size_t)(i - ks->begin + 1)) { \
132 				str->m = str->l + (i - ks->begin) + 1; \
136             seek_pos += i - ks->begin; if ( i < ks->end ) seek_pos++; \
138 			memcpy(str->s + str->l, ks->buf + ks->begin, i - ks->begin);  \
139 			str->l = str->l + (i - ks->begin); \
140 			ks->begin = i + 1; \
141 			if (i < ks->end) { \
142 				if (dret) *dret = ks->buf[i]; \
146 		if (!gotany && ks_eof(ks)) return -1; \
147         ks->seek_pos += seek_pos; \
166 	extern int ks_getuntil2(kstream_t *ks, int delimiter, kstring_t *str, int *dret, int append); \
168 	extern void ks_destroy(kstream_t *ks); \
175 #define kseq_rewind(ks) ((ks)->last_char = (ks)->f->is_eof = (ks)->f->begin = (ks)->f->end = 0)  argument
184 	SCOPE void kseq_destroy(kseq_t *ks)									\
186 		if (!ks) return;												\
187 		free(ks->name.s); free(ks->comment.s); free(ks->seq.s);	free(ks->qual.s); \
188 		ks_destroy(ks->f);												\
189 		free(ks);														\
201 		kstream_t *ks = seq->f; \
203 			while ((c = ks_getc(ks)) != -1 && c != '>' && c != '@'); \
208 		if (ks_getuntil(ks, 0, &seq->name, &c) < 0) return -1; /* normal exit: EOF */ \
209 		if (c != '\n') ks_getuntil(ks, KS_SEP_LINE, &seq->comment, 0); /* read FASTA/Q comment */ \
214 		while ((c = ks_getc(ks)) != -1 && c != '>' && c != '+' && c != '@') { \
217 			ks_getuntil2(ks, KS_SEP_LINE, &seq->seq, 0, 1); /* read the rest of the line */ \
231 		while ((c = ks_getc(ks)) != -1 && c != '\n'); /* skip the rest of '+' line */ \
233 		while (ks_getuntil2(ks, KS_SEP_LINE, &seq->qual, 0, 1) >= 0 && seq->qual.l < seq->seq.l); \
258 	void kseq_destroy(kseq_t *ks); \