add meson support

[protos/libecoli.git] / src / ecoli_test.c

diff --git a/src/ecoli_test.c b/src/ecoli_test.c
new file mode 100644 (file)
index 0000000..b090bd3
--- /dev/null
+++ b/src/ecoli_test.c
@@ -0,0 +1,217 @@
+/* SPDX-License-Identifier: BSD-3-Clause
+ * Copyright 2016, Olivier MATZ <zer0@droids-corp.org>
+ */
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <assert.h>
+#include <errno.h>
+
+#include <ecoli_log.h>
+#include <ecoli_malloc.h>
+#include <ecoli_test.h>
+#include <ecoli_strvec.h>
+#include <ecoli_node.h>
+#include <ecoli_parse.h>
+#include <ecoli_complete.h>
+#include <ecoli_parse.h>
+
+static struct ec_test_list test_list = TAILQ_HEAD_INITIALIZER(test_list);
+
+EC_LOG_TYPE_REGISTER(test);
+
+static struct ec_test *ec_test_lookup(const char *name)
+{
+       struct ec_test *test;
+
+       TAILQ_FOREACH(test, &test_list, next) {
+               if (!strcmp(name, test->name))
+                       return test;
+       }
+
+       errno = EEXIST;
+       return NULL;
+}
+
+int ec_test_register(struct ec_test *test)
+{
+       if (ec_test_lookup(test->name) != NULL)
+               return -1;
+
+       TAILQ_INSERT_TAIL(&test_list, test, next);
+
+       return 0;
+}
+
+int ec_test_check_parse(struct ec_node *tk, int expected, ...)
+{
+       struct ec_parse *p;
+       struct ec_strvec *vec = NULL;
+       const char *s;
+       int ret = -1, match;
+       va_list ap;
+
+       va_start(ap, expected);
+
+       /* build a string vector */
+       vec = ec_strvec();
+       if (vec == NULL)
+               goto out;
+
+       for (s = va_arg(ap, const char *);
+            s != EC_NODE_ENDLIST;
+            s = va_arg(ap, const char *)) {
+               if (s == NULL)
+                       goto out;
+
+               if (ec_strvec_add(vec, s) < 0)
+                       goto out;
+       }
+
+       p = ec_node_parse_strvec(tk, vec);
+       if (p == NULL) {
+               EC_LOG(EC_LOG_ERR, "parse is NULL\n");
+       }
+       if (ec_parse_matches(p))
+               match = ec_parse_len(p);
+       else
+               match = -1;
+       if (expected == match) {
+               ret = 0;
+       } else {
+               EC_LOG(EC_LOG_ERR,
+                       "parse len (%d) does not match expected (%d)\n",
+                       match, expected);
+       }
+
+       ec_parse_free(p);
+
+out:
+       ec_strvec_free(vec);
+       va_end(ap);
+       return ret;
+}
+
+int ec_test_check_complete(struct ec_node *tk, enum ec_comp_type type, ...)
+{
+       struct ec_comp *c = NULL;
+       struct ec_strvec *vec = NULL;
+       const char *s;
+       int ret = 0;
+       unsigned int count = 0;
+       va_list ap;
+
+       va_start(ap, type);
+
+       /* build a string vector */
+       vec = ec_strvec();
+       if (vec == NULL)
+               goto out;
+
+       for (s = va_arg(ap, const char *);
+            s != EC_NODE_ENDLIST;
+            s = va_arg(ap, const char *)) {
+               if (s == NULL)
+                       goto out;
+
+               if (ec_strvec_add(vec, s) < 0)
+                       goto out;
+       }
+
+       c = ec_node_complete_strvec(tk, vec);
+       if (c == NULL) {
+               ret = -1;
+               goto out;
+       }
+
+       /* for each expected completion, check it is there */
+       for (s = va_arg(ap, const char *);
+            s != EC_NODE_ENDLIST;
+            s = va_arg(ap, const char *)) {
+               struct ec_comp_iter *iter;
+               const struct ec_comp_item *item;
+
+               if (s == NULL) {
+                       ret = -1;
+                       goto out;
+               }
+
+               count++;
+
+               /* only check matching completions */
+               iter = ec_comp_iter(c, type);
+               while ((item = ec_comp_iter_next(iter)) != NULL) {
+                       const char *str = ec_comp_item_get_str(item);
+                       if (str != NULL && strcmp(str, s) == 0)
+                               break;
+               }
+
+               if (item == NULL) {
+                       EC_LOG(EC_LOG_ERR,
+                               "completion <%s> not in list\n", s);
+                       ret = -1;
+               }
+               ec_comp_iter_free(iter);
+       }
+
+       /* check if we have more completions (or less) than expected */
+       if (count != ec_comp_count(c, type)) {
+               EC_LOG(EC_LOG_ERR,
+                       "nb_completion (%d) does not match (%d)\n",
+                       count, ec_comp_count(c, type));
+               ec_comp_dump(stdout, c);
+               ret = -1;
+       }
+
+out:
+       ec_strvec_free(vec);
+       ec_comp_free(c);
+       va_end(ap);
+       return ret;
+}
+
+static int launch_test(const char *name)
+{
+       struct ec_test *test;
+       int ret = 0;
+       unsigned int count = 0;
+
+       TAILQ_FOREACH(test, &test_list, next) {
+               if (name != NULL && strcmp(name, test->name))
+                       continue;
+
+               EC_LOG(EC_LOG_INFO, "== starting test %-20s\n",
+                       test->name);
+
+               count++;
+               if (test->test() == 0) {
+                       EC_LOG(EC_LOG_INFO,
+                               "== test %-20s success\n",
+                               test->name);
+               } else {
+                       EC_LOG(EC_LOG_INFO,
+                               "== test %-20s failed\n",
+                               test->name);
+                       ret = -1;
+               }
+       }
+
+       if (name != NULL && count == 0) {
+               EC_LOG(EC_LOG_WARNING,
+                       "== test %s not found\n", name);
+               ret = -1;
+       }
+
+       return ret;
+}
+
+int ec_test_all(void)
+{
+       return launch_test(NULL);
+}
+
+int ec_test_one(const char *name)
+{
+       return launch_test(name);
+}