2 * Copyright (c) 2016, Olivier MATZ <zer0@droids-corp.org>
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
7 * * Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * * Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 * * Neither the name of the University of California, Berkeley nor the
13 * names of its contributors may be used to endorse or promote products
14 * derived from this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
17 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 * DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
20 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 #include <ecoli_log.h>
34 #include <ecoli_malloc.h>
35 #include <ecoli_test.h>
36 #include <ecoli_strvec.h>
37 #include <ecoli_node.h>
38 #include <ecoli_parsed.h>
39 #include <ecoli_completed.h>
40 #include <ecoli_parsed.h>
42 static struct ec_test_list test_list = TAILQ_HEAD_INITIALIZER(test_list);
44 /* register a driver */
45 void ec_test_register(struct ec_test *test)
47 TAILQ_INSERT_TAIL(&test_list, test, next);
48 // XXX check if already exist, like for type
51 int ec_test_check_parse(struct ec_node *tk, int expected, ...)
54 struct ec_strvec *vec = NULL;
59 va_start(ap, expected);
61 /* build a string vector */
66 for (s = va_arg(ap, const char *);
68 s = va_arg(ap, const char *)) {
72 if (ec_strvec_add(vec, s) < 0)
76 p = ec_node_parse_strvec(tk, vec);
77 ec_parsed_dump(stdout, p); /* XXX only for debug */
79 ec_log(EC_LOG_ERR, "parsed is NULL\n");
81 if (ec_parsed_matches(p))
82 match = ec_parsed_len(p);
85 if (expected == match) {
89 "tk parsed len (%d) does not match expected (%d)\n",
101 int ec_test_check_complete(struct ec_node *tk, ...)
103 struct ec_completed *c = NULL;
104 struct ec_strvec *vec = NULL;
105 const char *s, *expected;
107 unsigned int count = 0;
112 /* build a string vector */
117 for (s = va_arg(ap, const char *);
118 s != EC_NODE_ENDLIST;
119 s = va_arg(ap, const char *)) {
123 if (ec_strvec_add(vec, s) < 0)
127 c = ec_node_complete_strvec(tk, vec);
133 /* for each expected completion, check it is there */
134 for (s = va_arg(ap, const char *);
135 s != EC_NODE_ENDLIST;
136 s = va_arg(ap, const char *)) {
137 struct ec_completed_iter *iter;
138 const struct ec_completed_match *item;
147 /* only check matching completions */
148 iter = ec_completed_iter(c, EC_MATCH);
149 while ((item = ec_completed_iter_next(iter)) != NULL) {
150 if (item->add != NULL && strcmp(item->add, s) == 0)
156 "completion <%s> not in list\n", s);
159 ec_completed_iter_free(iter);
162 /* check if we have more completions (or less) than expected */
163 if (count != ec_completed_count(c, EC_MATCH)) {
165 "nb_completion (%d) does not match (%d)\n",
166 count, ec_completed_count(c, EC_MATCH));
167 ec_completed_dump(stdout, c);
171 /* check the expected smallest start */
172 expected = va_arg(ap, const char *);
173 s = ec_completed_smallest_start(c);
174 if (strcmp(s, expected)) {
177 "should complete with <%s> but completes with <%s>\n",
183 ec_completed_free(c);
188 static int launch_test(const char *name)
190 struct ec_test *test;
192 unsigned int count = 0;
194 TAILQ_FOREACH(test, &test_list, next) {
195 if (name != NULL && strcmp(name, test->name))
198 ec_log(EC_LOG_INFO, "== starting test %-20s\n", test->name);
201 if (test->test() == 0) {
202 ec_log(EC_LOG_INFO, "== test %-20s success\n",
205 ec_log(EC_LOG_INFO, "== test %-20s failed\n",
211 if (name != NULL && count == 0) {
212 ec_log(EC_LOG_WARNING, "== test %s not found\n", name);
219 int ec_test_all(void)
221 return launch_test(NULL);
224 int ec_test_one(const char *name)
226 return launch_test(name);