#include <ecoli_log.h>
#include <ecoli_malloc.h>
#include <ecoli_test.h>
-#include <ecoli_tk.h>
+#include <ecoli_strvec.h>
+#include <ecoli_node.h>
+#include <ecoli_parsed.h>
+#include <ecoli_completed.h>
+#include <ecoli_parsed.h>
static struct ec_test_list test_list = TAILQ_HEAD_INITIALIZER(test_list);
void ec_test_register(struct ec_test *test)
{
TAILQ_INSERT_TAIL(&test_list, test, next);
+ // XXX check if already exist, like for type
}
-int ec_test_check_tk_parse(const struct ec_tk *tk, const char *input,
- const char *expected)
+int ec_test_check_parse(struct ec_node *tk, int expected, ...)
{
- struct ec_parsed_tk *p;
+ struct ec_parsed *p;
+ struct ec_strvec *vec = NULL;
const char *s;
- int ret = -1;
-
- p = ec_tk_parse(tk, input);
- s = ec_parsed_tk_to_string(p);
- if (s == NULL && expected == NULL)
- ret = 0;
- else if (s != NULL && expected != NULL &&
- !strcmp(s, expected))
- ret = 0;
-
- if (expected == NULL && ret != 0)
- ec_log(EC_LOG_ERR, "tk should not match but matches <%s>\n", s);
- if (expected != NULL && ret != 0)
- ec_log(EC_LOG_ERR, "tk should match <%s> but matches <%s>\n",
- expected, s);
+ int ret = -1, match;
+ va_list ap;
- ec_parsed_tk_free(p);
+ va_start(ap, expected);
- return ret;
-}
+ /* build a string vector */
+ vec = ec_strvec();
+ if (vec == NULL)
+ goto out;
-int ec_test_check_tk_complete(const struct ec_tk *tk, const char *input,
- const char *expected)
-{
- struct ec_completed_tk *c;
- const char *s;
- int ret = -1;
+ for (s = va_arg(ap, const char *);
+ s != EC_NODE_ENDLIST;
+ s = va_arg(ap, const char *)) {
+ if (s == NULL)
+ goto out;
- assert(expected != NULL);
+ if (ec_strvec_add(vec, s) < 0)
+ goto out;
+ }
- c = ec_tk_complete(tk, input);
- s = ec_completed_tk_smallest_start(c);
- if (!strcmp(s, expected))
+ p = ec_node_parse_strvec(tk, vec);
+ ec_parsed_dump(stdout, p); /* XXX only for debug */
+ if (p == NULL) {
+ ec_log(EC_LOG_ERR, "parsed is NULL\n");
+ }
+ if (ec_parsed_matches(p))
+ match = ec_parsed_len(p);
+ else
+ match = -1;
+ if (expected == match) {
ret = 0;
-
- if (ret != 0)
+ } else {
ec_log(EC_LOG_ERR,
- "should complete with <%s> but completes with <%s>\n",
- expected, s);
+ "tk parsed len (%d) does not match expected (%d)\n",
+ match, expected);
+ }
- ec_completed_tk_free(c);
+ ec_parsed_free(p);
+out:
+ ec_strvec_free(vec);
+ va_end(ap);
return ret;
}
-int ec_test_check_tk_complete_list(const struct ec_tk *tk,
- const char *input, ...)
+int ec_test_check_complete(struct ec_node *tk, ...)
{
- struct ec_completed_tk *c = NULL;
- struct ec_completed_tk_elt *elt;
- const char *s;
- int ret = -1;
+ struct ec_completed *c = NULL;
+ struct ec_strvec *vec = NULL;
+ const char *s, *expected;
+ int ret = 0;
unsigned int count = 0;
va_list ap;
- va_start(ap, input);
+ va_start(ap, tk);
- c = ec_tk_complete(tk, input);
- if (c == NULL)
+ /* build a string vector */
+ vec = ec_strvec();
+ if (vec == NULL)
goto out;
for (s = va_arg(ap, const char *);
- s != EC_TK_ENDLIST;
+ 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_completed_iter *iter;
+ const struct ec_completed_match *item;
+
+ if (s == NULL) {
+ ret = -1;
+ goto out;
+ }
+
count++;
- TAILQ_FOREACH(elt, &c->elts, next) {
- if (strcmp(elt->add, s) == 0)
+
+ /* only check matching completions */
+ iter = ec_completed_iter(c, EC_MATCH);
+ while ((item = ec_completed_iter_next(iter)) != NULL) {
+ if (item->add != NULL && strcmp(item->add, s) == 0)
break;
}
- if (elt == NULL) {
+ if (item == NULL) {
ec_log(EC_LOG_ERR,
"completion <%s> not in list\n", s);
- goto out;
+ ret = -1;
}
+ ec_completed_iter_free(iter);
}
- if (count != ec_completed_tk_count(c)) {
+ /* check if we have more completions (or less) than expected */
+ if (count != ec_completed_count(c, EC_MATCH)) {
ec_log(EC_LOG_ERR,
"nb_completion (%d) does not match (%d)\n",
- count, ec_completed_tk_count(c));
- ec_completed_tk_dump(stdout, c);
- goto out;
+ count, ec_completed_count(c, EC_MATCH));
+ ec_completed_dump(stdout, c);
+ ret = -1;
+ } else
+ ec_completed_dump(stdout, c); //XXX
+
+ /* check the expected smallest start */
+ expected = va_arg(ap, const char *);
+ s = ec_completed_smallest_start(c);
+ if (strcmp(s, expected)) {
+ ret = -1;
+ ec_log(EC_LOG_ERR,
+ "should complete with <%s> but completes with <%s>\n",
+ expected, s);
}
- ret = 0;
-
out:
- ec_completed_tk_free(c);
+ ec_strvec_free(vec);
+ ec_completed_free(c);
va_end(ap);
return ret;
}
-int ec_test_all(void)
+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);
}
}
+ 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);
+}
git.droids-corp.org / protos / libecoli.git / blobdiff