/* test_kstring.c -- kstring unit tests Copyright (C) 2018, 2020 Genome Research Ltd. Author: Rob Davies 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. */ #include #include #include #include #include #include #include #include "../htslib/kstring.h" static inline void clamp(int64_t *val, int64_t min, int64_t max) { if (*val < min) *val = min; if (*val > max) *val = max; } static int test_kroundup_size_t(int verbose) { size_t val, exp; int ret = 0; val = 0; kroundup_size_t(val); if (verbose) { printf("kroundup_size_t(0) = 0x%zx\n", val); } if (val != 0) { fprintf(stderr, "kroundup_size_t(0) produced 0x%zx, expected 0\n", val); ret = -1; } for (exp = 0; exp < sizeof(val) * 8; exp++) { size_t expected = ((size_t) 1) << exp; ssize_t delta; for (delta = exp > 1 ? -1 : 0; delta <= (exp < 2 ? 0 : 1); delta++) { size_t val_in = expected + delta; val = val_in; kroundup_size_t(val); if (verbose) { printf("kroundup_size_t(0x%zx) = 0x%zx\n", val_in, val); } if (delta <= 0) { if (val != expected) { fprintf(stderr, "kroundup_size_t(0x%zx) produced 0x%zx, " "expected 0x%zx\n", val_in, val, expected); ret = -1; } } else { expected *= 2; if (!expected) --expected; if (val != expected) { fprintf(stderr, "kroundup_size_t(0x%zx) produced 0x%zx, " "expected 0x%zx\n", val_in, val, expected); ret = -1; } } } } return ret; } static int test_kroundup_signed(int verbose) { int32_t val, ret = 0; size_t exp; for (exp = 0; exp < sizeof(val) * 8 - 1; exp++) { uint32_t expected = ((uint32_t) 1) << exp; ssize_t delta; for (delta = exp > 1 ? -1 : 0; delta <= (exp < 2 ? 0 : 1); delta++) { int32_t val_in = expected + delta; val = val_in; kroundup32(val); if (verbose) { printf("kroundup32(%d) = %d\n", val_in, val); } if (delta <= 0) { if ((uint32_t) val != expected) { fprintf(stderr, "kroundup32(%d) produced %d, expected %u\n", val_in, val, expected); ret = -1; } } else { if (exp < sizeof(val) * 8 - 2) { expected *= 2; } else { expected = ((expected - 1) << 1 | 1); } if ((uint32_t) val != expected) { fprintf(stderr, "kroundup32(%d) produced %d, expected %u\n", val_in, val, expected); ret = -1; } } } } return ret; } static int test_kputuw_from_to(kstring_t *str, unsigned int s, unsigned int e) { unsigned int i = s; for (;;) { str->l = 0; memset(str->s, 0xff, str->m); if (kputuw(i, str) < 0 || !str->s) { perror("kputuw"); return -1; } if (str->l >= str->m || str->s[str->l] != '\0') { fprintf(stderr, "No NUL termination on string from kputuw\n"); return -1; } if (i != strtoul(str->s, NULL, 10)) { fprintf(stderr, "kputuw wrote the wrong value, expected %u, got %s\n", i, str->s); return -1; } if (i >= e) break; i++; } return 0; } static int test_kputuw(int64_t start, int64_t end) { kstring_t str = { 0, 0, NULL }; int64_t val; str.s = malloc(2); if (!str.s) { perror("malloc"); return -1; } str.m = 2; for (val = 0; val < UINT_MAX; val = val == 0 ? 1 : val * 10) { unsigned int s = val == 0 ? 0 : val - 5; unsigned int e = val + 5; if (test_kputuw_from_to(&str, s, e) < 0) { free(ks_release(&str)); return -1; } } if (test_kputuw_from_to(&str, UINT_MAX - 5, UINT_MAX) < 0) { free(ks_release(&str)); return -1; } str.m = 1; // Force a resize clamp(&start, 0, UINT_MAX); clamp(&end, 0, UINT_MAX); if (test_kputuw_from_to(&str, start, end) < 0) { free(ks_release(&str)); return -1; } free(ks_release(&str)); return 0; } static int test_kputw_from_to(kstring_t *str, int s, int e) { int i = s; for (;;) { str->l = 0; memset(str->s, 0xff, str->m); if (kputw(i, str) < 0 || !str->s) { perror("kputw"); return -1; } if (str->l >= str->m || str->s[str->l] != '\0') { fprintf(stderr, "No NUL termination on string from kputw\n"); return -1; } if (i != strtol(str->s, NULL, 10)) { fprintf(stderr, "kputw wrote the wrong value, expected %d, got %s\n", i, str->s); return -1; } if (i >= e) break; i++; } return 0; } static int test_kputw(int64_t start, int64_t end) { kstring_t str = { 0, 0, NULL }; int64_t val; str.s = malloc(2); if (!str.s) { perror("malloc"); return -1; } str.m = 2; for (val = 1; val < INT_MAX; val *= 10) { if (test_kputw_from_to(&str, val > 5 ? val - 5 : 0, val + 5) < 0) { free(ks_release(&str)); return -1; } } for (val = -1; val > INT_MIN; val *= 10) { if (test_kputw_from_to(&str, val - 5, val < -5 ? val + 5 : 0) < 0) { free(ks_release(&str)); return -1; } } if (test_kputw_from_to(&str, INT_MAX - 5, INT_MAX) < 0) { free(ks_release(&str)); return -1; } if (test_kputw_from_to(&str, INT_MIN, INT_MIN + 5) < 0) { free(ks_release(&str)); return -1; } str.m = 1; // Force a resize clamp(&start, INT_MIN, INT_MAX); clamp(&end, INT_MIN, INT_MAX); if (test_kputw_from_to(&str, start, end) < 0) { free(ks_release(&str)); return -1; } free(ks_release(&str)); return 0; } // callback used by test_kgetline static char *mock_fgets(char *str, int num, void *p) { int *mock_state = (int*)p; (*mock_state)++; switch (*mock_state) { case 1: case 4: case 7: // a few characters, no endline strcpy(str, "ABCD"); break; case 2: case 3: // \n endline strcpy(str, "\n"); break; case 5: case 6: // \r\n endline strcpy(str, "\r\n"); break; default: // eof return 0; } return str; } static int test_kgetline() { kstring_t s = KS_INITIALIZE; int mock_state = 0; // normal line, \n terminated, called with non-empty s kputs("_", &s); if (0 != kgetline(&s, mock_fgets, &mock_state) || 0 != strcmp("_ABCD", s.s) || 5 != s.l) return -1; s.l = 0; // empty line, \n terminated if (0 != kgetline(&s, mock_fgets, &mock_state) || 0 != strcmp("", s.s) || 0 != s.l) return -1; s.l = 0; // normal line, \r\n terminated if (0 != kgetline(&s, mock_fgets, &mock_state) || 0 != strcmp("ABCD", s.s) || 4 != s.l) return -1; s.l = 0; // empty line, \r\n terminated if (0 != kgetline(&s, mock_fgets, &mock_state) || 0 != strcmp("", s.s) || 0 != s.l) return -1; s.l = 0; // line terminated by EOF if (0 != kgetline(&s, mock_fgets, &mock_state) || 0 != strcmp("ABCD", s.s) || 4 != s.l) return -1; s.l = 0; // EOF if (EOF != kgetline(&s, mock_fgets, &mock_state) || 0 != s.l) return -1; ks_free(&s); return EXIT_SUCCESS; } // callback used by test_kgetline2 static ssize_t mock_fgets2(char *str, size_t num, void *p) { int *mock_state = (int*)p; (*mock_state)++; switch (*mock_state) { case 1: case 4: case 7: // a few characters, no endline strcpy(str, "ABCD"); break; case 2: case 3: // \n endline strcpy(str, "\n"); break; case 5: case 6: // \r\n endline strcpy(str, "\r\n"); break; default: // eof return 0; } return strlen(str); } static int test_kgetline2() { kstring_t s = KS_INITIALIZE; int mock_state = 0; // normal line, \n terminated, called with non-empty s kputs("_", &s); if (0 != kgetline2(&s, mock_fgets2, &mock_state) || 0 != strcmp("_ABCD", s.s) || 5 != s.l) return -1; s.l = 0; // empty line, \n terminated if (0 != kgetline2(&s, mock_fgets2, &mock_state) || 0 != strcmp("", s.s) || 0 != s.l) return -1; s.l = 0; // normal line, \r\n terminated if (0 != kgetline2(&s, mock_fgets2, &mock_state) || 0 != strcmp("ABCD", s.s) || 4 != s.l) return -1; s.l = 0; // empty line, \r\n terminated if (0 != kgetline2(&s, mock_fgets2, &mock_state) || 0 != strcmp("", s.s) || 0 != s.l) return -1; s.l = 0; // line terminated by EOF if (0 != kgetline2(&s, mock_fgets2, &mock_state) || 0 != strcmp("ABCD", s.s) || 4 != s.l) return -1; s.l = 0; // EOF if (EOF != kgetline2(&s, mock_fgets2, &mock_state) || 0 != s.l) return -1; ks_free(&s); return EXIT_SUCCESS; } int main(int argc, char **argv) { int opt, res = EXIT_SUCCESS; int64_t start = 0; int64_t end = 0; char *test = NULL; int verbose = 0; while ((opt = getopt(argc, argv, "e:s:t:v")) != -1) { switch (opt) { case 's': start = strtoll(optarg, NULL, 0); break; case 'e': end = strtoll(optarg, NULL, 0); break; case 't': test = optarg; break; case 'v': verbose++; break; default: fprintf(stderr, "Usage : %s [-s ] [-e ] [-t ]\n", argv[0]); return EXIT_FAILURE; } } if (!test || strcmp(test, "kroundup_size_t") == 0) if (test_kroundup_size_t(verbose) != 0) res = EXIT_FAILURE; if (!test || strcmp(test, "kroundup_signed") == 0) if (test_kroundup_signed(verbose) != 0) res = EXIT_FAILURE; if (!test || strcmp(test, "kputuw") == 0) if (test_kputuw(start, end) != 0) res = EXIT_FAILURE; if (!test || strcmp(test, "kputw") == 0) if (test_kputw(start, end) != 0) res = EXIT_FAILURE; if (!test || strcmp(test, "kgetline") == 0) if (test_kgetline() != 0) res = EXIT_FAILURE; if (!test || strcmp(test, "kgetline2") == 0) if (test_kgetline2() != 0) res = EXIT_FAILURE; return res; }