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.
34 #include <ecoli_log.h>
35 #include <ecoli_malloc.h>
36 #include <ecoli_test.h>
37 #include <ecoli_strvec.h>
38 #include <ecoli_node.h>
39 #include <ecoli_parsed.h>
40 #include <ecoli_completed.h>
41 #include <ecoli_parsed.h>
43 static struct ec_test_list test_list = TAILQ_HEAD_INITIALIZER(test_list);
45 EC_LOG_TYPE_REGISTER(test);
47 static struct ec_test *ec_test_lookup(const char *name)
51 TAILQ_FOREACH(test, &test_list, next) {
52 if (!strcmp(name, test->name))
60 int ec_test_register(struct ec_test *test)
62 if (ec_test_lookup(test->name) != NULL)
65 TAILQ_INSERT_TAIL(&test_list, test, next);
70 int ec_test_check_parse(struct ec_node *tk, int expected, ...)
73 struct ec_strvec *vec = NULL;
78 va_start(ap, expected);
80 /* build a string vector */
85 for (s = va_arg(ap, const char *);
87 s = va_arg(ap, const char *)) {
91 if (ec_strvec_add(vec, s) < 0)
95 p = ec_node_parse_strvec(tk, vec);
97 EC_LOG(EC_LOG_ERR, "parsed is NULL\n");
99 if (ec_parsed_matches(p))
100 match = ec_parsed_len(p);
103 if (expected == match) {
107 "tk parsed len (%d) does not match expected (%d)\n",
119 int ec_test_check_complete(struct ec_node *tk, enum ec_completed_type type, ...)
121 struct ec_completed *c = NULL;
122 struct ec_strvec *vec = NULL;
125 unsigned int count = 0;
130 /* build a string vector */
135 for (s = va_arg(ap, const char *);
136 s != EC_NODE_ENDLIST;
137 s = va_arg(ap, const char *)) {
141 if (ec_strvec_add(vec, s) < 0)
145 c = ec_node_complete_strvec(tk, vec);
151 /* for each expected completion, check it is there */
152 for (s = va_arg(ap, const char *);
153 s != EC_NODE_ENDLIST;
154 s = va_arg(ap, const char *)) {
155 struct ec_completed_iter *iter;
156 const struct ec_completed_item *item;
165 /* only check matching completions */
166 iter = ec_completed_iter(c, type);
167 while ((item = ec_completed_iter_next(iter)) != NULL) {
168 const char *str = ec_completed_item_get_str(item);
169 if (str != NULL && strcmp(str, s) == 0)
175 "completion <%s> not in list\n", s);
178 ec_completed_iter_free(iter);
181 /* check if we have more completions (or less) than expected */
182 if (count != ec_completed_count(c, type)) {
184 "nb_completion (%d) does not match (%d)\n",
185 count, ec_completed_count(c, type));
186 ec_completed_dump(stdout, c);
192 ec_completed_free(c);
197 static int launch_test(const char *name)
199 struct ec_test *test;
201 unsigned int count = 0;
203 TAILQ_FOREACH(test, &test_list, next) {
204 if (name != NULL && strcmp(name, test->name))
207 EC_LOG(EC_LOG_INFO, "== starting test %-20s\n",
211 if (test->test() == 0) {
213 "== test %-20s success\n",
217 "== test %-20s failed\n",
223 if (name != NULL && count == 0) {
224 EC_LOG(EC_LOG_WARNING,
225 "== test %s not found\n", name);
232 int ec_test_all(void)
234 return launch_test(NULL);
237 int ec_test_one(const char *name)
239 return launch_test(name);