/* test-expr.c -- Testing: filter expression parsing and processing. Copyright (C) 2020, 2022 Genome Research Ltd. Author: James Bonfield 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 notices 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 "../htslib/hts_expr.h" int lookup(void *data, char *str, char **end, hts_expr_val_t *res) { int foo = 15551; // my favourite palindromic prime int a = 1; int b = 2; int c = 3; res->is_str = 0; if (strncmp(str, "foo", 3) == 0) { *end = str+3; res->d = foo; } else if (*str == 'a') { *end = str+1; res->d = a; } else if (*str == 'b') { *end = str+1; res->d = b; } else if (*str == 'c') { *end = str+1; res->d = c; } else if (strncmp(str, "magic", 5) == 0) { // non-empty string *end = str+5; res->is_str = 1; kputs("plugh", ks_clear(&res->s)); } else if (strncmp(str, "empty-but-true", 14) == 0) { // empty string *end = str+14; res->is_true = 1; res->is_str = 1; kputs("", ks_clear(&res->s)); } else if (strncmp(str, "empty", 5) == 0) { // empty string *end = str+5; res->is_str = 1; kputs("", ks_clear(&res->s)); } else if (strncmp(str, "zero-but-true", 13) == 0) { *end = str+13; res->d = 0; res->is_true = 1; } else if (strncmp(str, "null-but-true", 13) == 0) { *end = str+13; hts_expr_val_undef(res); res->is_true = 1; } else if (strncmp(str, "null", 4) == 0) { // null string (eg aux:Z tag is absent) *end = str+4; hts_expr_val_undef(res); } else if (strncmp(str, "nan", 3) == 0) { // sqrt(-1), 0/0 and similar // Semantically the same operations as null. *end = str+3; hts_expr_val_undef(res); } else { return -1; } return 0; } typedef struct { int truth_val; double dval; char *sval; char *str; } test_ev; static inline int strcmpnull(const char *a, const char *b) { if (!a && !b) return 0; if (!a && b) return -1; if (a && !b) return 1; return strcmp(a, b); } // Compare NAN as equal, for testing we returned the correct values static inline int cmpfloat(double d1, double d2) { // If needs be, can use DBL_EPSILON in comparisons here. return d1 == d2 || (isnan(d1) && isnan(d2)); } int test(void) { // These are all valid expressions that should work test_ev tests[] = { { 1, 1, NULL, "1"}, { 1, 1, NULL, "+1"}, { 1, -1, NULL, "-1"}, { 0, 0, NULL, "!7"}, { 1, 1, NULL, "!0"}, { 1, 1, NULL, "!(!7)"}, { 1, 1, NULL, "!!7"}, { 1, 5, NULL, "2+3"}, { 1, -1, NULL, "2+-3"}, { 1, 6, NULL, "1+2+3"}, { 1, 1, NULL, "-2+3"}, { 0, NAN, NULL, "1+null" }, { 0, NAN, NULL, "null-1" }, { 0, NAN, NULL, "-null" }, { 1, 6, NULL, "2*3"}, { 1, 6, NULL, "1*2*3"}, { 0, 0, NULL, "2*0"}, { 1, 7, NULL, "(7)"}, { 1, 7, NULL, "((7))"}, { 1, 21, NULL, "(1+2)*(3+4)"}, { 1, 14, NULL, "(4*5)-(-2*-3)"}, { 0, NAN, NULL, "2*null"}, { 0, NAN, NULL, "null/2"}, { 0, NAN, NULL, "0/0"}, { 1, 1, NULL, "(1+2)*3==9"}, { 1, 1, NULL, "(1+2)*3!=8"}, { 0, 0, NULL, "(1+2)*3!=9"}, { 0, 0, NULL, "(1+2)*3==8"}, { 0, 0, NULL, "1>2"}, { 1, 1, NULL, "1<2"}, { 0, 0, NULL, "3<3"}, { 0, 0, NULL, "3>3"}, { 1, 1, NULL, "9<=9"}, { 1, 1, NULL, "9>=9"}, { 1, 1, NULL, "2*4==8"}, { 1, 1, NULL, "16==0x10"}, { 1, 1, NULL, "15<0x10"}, { 1, 1, NULL, "17>0x10"}, { 0, 0, NULL, "2*4!=8"}, { 1, 1, NULL, "4+2<3+4"}, { 0, 0, NULL, "4*2<3+4"}, { 1, 8, NULL, "4*(2<3)+4"}, // boolean; 4*(1)+4 { 1, 1, NULL, "(1<2) == (3>2)"}, { 1, 1, NULL, "1<2 == 3>2"}, { 0, NAN, NULL, "null <= 0" }, { 0, NAN, NULL, "null >= 0" }, { 0, NAN, NULL, "null < 0" }, { 0, NAN, NULL, "null > 0" }, { 0, NAN, NULL, "null == null" }, { 0, NAN, NULL, "null != null" }, { 0, NAN, NULL, "null < 10" }, { 0, NAN, NULL, "10 > null" }, { 1, 1, NULL, "2 && 1"}, { 0, 0, NULL, "2 && 0"}, { 0, 0, NULL, "0 && 2"}, { 1, 1, NULL, "2 || 1"}, { 1, 1, NULL, "2 || 0"}, { 1, 1, NULL, "0 || 2"}, { 1, 1, NULL, "1 || 2 && 3"}, { 1, 1, NULL, "2 && 3 || 1"}, { 1, 1, NULL, "0 && 3 || 2"}, { 0, 0, NULL, "0 && 3 || 0"}, { 0, 0, NULL, " 5 - 5 && 1"}, { 0, 0, NULL, "+5 - 5 && 1"}, { 0, 0, NULL, "null && 1"}, // null && x == null { 0, 0, NULL, "1 && null"}, { 1, 1, NULL, "!null && 1"}, { 1, 1, NULL, "1 && !null"}, { 1, 1, NULL, "1 && null-but-true"}, { 0, 0, NULL, "null || 0"}, // null || 0 == null { 0, 0, NULL, "0 || null"}, { 1, 1, NULL, "!null || 0"}, { 1, 1, NULL, "0 || !null"}, { 1, 1, NULL, "0 || null-but-true"}, { 1, 1, NULL, "null || 1"}, // null || 1 == 1 { 1, 1, NULL, "1 || null"}, { 1, 1, NULL, "3 & 1"}, { 1, 2, NULL, "3 & 2"}, { 1, 3, NULL, "1 | 2"}, { 1, 3, NULL, "1 | 3"}, { 1, 7, NULL, "1 | 6"}, { 1, 2, NULL, "1 ^ 3"}, { 0, NAN, NULL, "1 | null"}, { 0, NAN, NULL, "null | 1"}, { 0, NAN, NULL, "1 & null"}, { 0, NAN, NULL, "null & 1"}, { 0, NAN, NULL, "0 ^ null"}, { 0, NAN, NULL, "null ^ 0"}, { 0, NAN, NULL, "1 ^ null"}, { 0, NAN, NULL, "null ^ 1"}, { 1, 1, NULL, "(1^0)&(4^3)"}, { 1, 2, NULL, "1 ^(0&4)^ 3"}, { 1, 2, NULL, "1 ^ 0&4 ^ 3"}, // precedence, & before ^ { 1, 6, NULL, "(1|0)^(4|3)"}, { 1, 7, NULL, "1 |(0^4)| 3"}, { 1, 7, NULL, "1 | 0^4 | 3"}, // precedence, ^ before | { 1, 1, NULL, "4 & 2 || 1"}, { 1, 1, NULL, "(4 & 2) || 1"}, { 0, 0, NULL, "4 & (2 || 1)"}, { 1, 1, NULL, "1 || 4 & 2"}, { 1, 1, NULL, "1 || (4 & 2)"}, { 0, 0, NULL, "(1 || 4) & 2"}, { 1, 1, NULL, " (2*3)&7 > 4"}, { 0, 0, NULL, " (2*3)&(7 > 4)"}, // C precedence equiv { 1, 1, NULL, "((2*3)&7) > 4"}, // Python precedence equiv { 1, 1, NULL, "((2*3)&7) > 4 && 2*2 <= 4"}, { 1, 1, "plugh", "magic"}, { 1, 1, "", "empty"}, { 1, 1, NULL, "magic == \"plugh\""}, { 1, 1, NULL, "magic != \"xyzzy\""}, { 1, 1, NULL, "\"abc\" < \"def\""}, { 1, 1, NULL, "\"abc\" <= \"abc\""}, { 0, 0, NULL, "\"abc\" < \"ab\""}, { 0, 0, NULL, "\"abc\" <= \"ab\""}, { 0, 0, NULL, "\"abc\" > \"def\""}, { 1, 1, NULL, "\"abc\" >= \"abc\""}, { 1, 1, NULL, "\"abc\" > \"ab\""}, { 1, 1, NULL, "\"abc\" >= \"ab\""}, { 0, NAN, NULL, "null == \"x\"" }, { 0, NAN, NULL, "null != \"x\"" }, { 0, NAN, NULL, "null < \"x\"" }, { 0, NAN, NULL, "null > \"x\"" }, { 1, 1, NULL, "\"abbc\" =~ \"^a+b+c+$\""}, { 0, 0, NULL, "\"aBBc\" =~ \"^a+b+c+$\""}, { 1, 1, NULL, "\"aBBc\" !~ \"^a+b+c+$\""}, { 1, 1, NULL, "\"xyzzy plugh abracadabra\" =~ magic"}, { 1, 1, "", "empty-but-true" }, { 0, 0, NULL, "!empty-but-true" }, { 1, 1, NULL, "!!empty-but-true" }, { 1, 1, NULL, "1 && empty-but-true && 1" }, { 0, 0, NULL, "1 && empty-but-true && 0" }, { 0, NAN, NULL, "null" }, { 1, 1, NULL, "!null" }, { 0, 0, NULL, "!!null", }, { 0, 0, NULL, "!\"foo\"" }, { 1, 1, NULL, "!!\"foo\"" }, { 1, NAN, NULL, "null-but-true" }, { 0, 0, NULL, "!null-but-true" }, { 1, 1, NULL, "!!null-but-true" }, { 1, 0, NULL, "zero-but-true" }, { 0, 0, NULL, "!zero-but-true" }, { 1, 1, NULL, "!!zero-but-true" }, { 1, log(2), NULL, "log(2)"}, { 1, exp(9), NULL, "exp(9)"}, { 1, 9, NULL, "log(exp(9))"}, { 1, 8, NULL, "pow(2,3)"}, { 1, 3, NULL, "sqrt(9)"}, { 0, NAN, NULL, "sqrt(-9)"}, { 1, 2, NULL, "default(2,3)"}, { 1, 3, NULL, "default(null,3)"}, { 0, 0, NULL, "default(null,0)"}, { 1, NAN, NULL, "default(null-but-true,0)"}, { 1, NAN, NULL, "default(null-but-true,null)"}, { 1, NAN, NULL, "default(null,null-but-true)"}, { 1, 1, NULL, "exists(\"foo\")"}, { 1, 1, NULL, "exists(12)"}, { 1, 1, NULL, "exists(\"\")"}, { 1, 1, NULL, "exists(0)"}, { 0, 0, NULL, "exists(null)"}, { 1, 1, NULL, "exists(null-but-true)"}, }; int i, res = 0; hts_expr_val_t r = HTS_EXPR_VAL_INIT; for (i = 0; i < sizeof(tests) / sizeof(*tests); i++) { hts_filter_t *filt = hts_filter_init(tests[i].str); if (!filt) return 1; if (hts_filter_eval2(filt, NULL, lookup, &r)) { fprintf(stderr, "Failed to parse filter string %s\n", tests[i].str); res = 1; hts_filter_free(filt); continue; } if (!hts_expr_val_exists(&r)) { if (r.is_true != tests[i].truth_val || !cmpfloat(r.d, tests[i].dval)) { fprintf(stderr, "Failed test: \"%s\" == \"%f\", got %s, \"%s\", %f\n", tests[i].str, tests[i].dval, r.is_true ? "true" : "false", r.s.s, r.d); res = 1; } } else if (r.is_str && (strcmpnull(r.s.s, tests[i].sval) != 0 || !cmpfloat(r.d, tests[i].dval) || r.is_true != tests[i].truth_val)) { fprintf(stderr, "Failed test: \"%s\" == \"%s\", got %s, \"%s\", %f\n", tests[i].str, tests[i].sval, r.is_true ? "true" : "false", r.s.s, r.d); res = 1; } else if (!r.is_str && (!cmpfloat(r.d, tests[i].dval) || r.is_true != tests[i].truth_val)) { fprintf(stderr, "Failed test: %s == %f, got %s, %f\n", tests[i].str, tests[i].dval, r.is_true ? "true" : "false", r.d); res = 1; } hts_expr_val_free(&r); hts_filter_free(filt); } return res; } int main(int argc, char **argv) { if (argc > 1) { hts_expr_val_t v = HTS_EXPR_VAL_INIT; hts_filter_t *filt = hts_filter_init(argv[1]); if (hts_filter_eval2(filt, NULL, lookup, &v)) return 1; printf("%s\t", v.is_true ? "true":"false"); if (v.is_str) puts(v.s.s); else printf("%g\n", v.d); hts_expr_val_free(&v); hts_filter_free(filt); return 0; } return test(); }