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_malloc.h>
35 #include <ecoli_strvec.h>
36 #include <ecoli_keyval.h>
37 #include <ecoli_log.h>
38 #include <ecoli_node.h>
39 #include <ecoli_parsed.h>
40 #include <ecoli_completed.h>
42 struct ec_completed *ec_completed(void)
44 struct ec_completed *completed = NULL;
46 completed = ec_calloc(1, sizeof(*completed));
47 if (completed == NULL)
50 TAILQ_INIT(&completed->nodes);
55 /* XXX on error, states are not freed ?
56 * they can be left in a bad state and should not be reused */
58 ec_node_complete_child(struct ec_node *node,
59 struct ec_completed *completed,
60 struct ec_parsed *parsed_state,
61 const struct ec_strvec *strvec)
63 struct ec_parsed *child_state = NULL;
66 /* build the node if required */
67 if (node->type->build != NULL) {
68 if ((node->flags & EC_NODE_F_BUILT) == 0) {
69 ret = node->type->build(node);
74 node->flags |= EC_NODE_F_BUILT;
76 if (node->type->complete == NULL)
79 child_state = ec_parsed();
80 if (child_state == NULL)
82 child_state->node = node;
83 ec_parsed_add_child(parsed_state, child_state);
85 ret = ec_completed_add_node(completed, node);
89 ret = node->type->complete(node, completed,
95 printf("----------------------------------------------------------\n");
96 ec_node_dump(stdout, node);
97 ec_strvec_dump(stdout, strvec);
98 ec_completed_dump(stdout, completed);
99 ec_parsed_dump(stdout, parsed_state);
102 ec_parsed_del_child(parsed_state, child_state);
103 assert(TAILQ_EMPTY(&child_state->children));
104 ec_parsed_free(child_state);
109 struct ec_completed *ec_node_complete_strvec(struct ec_node *node,
110 const struct ec_strvec *strvec)
112 struct ec_parsed *parsed_state = NULL;
113 struct ec_completed *completed = NULL;
116 parsed_state = ec_parsed();
117 if (parsed_state == NULL)
120 completed = ec_completed();
121 if (completed == NULL)
124 ret = ec_node_complete_child(node, completed,
125 parsed_state, strvec);
129 ec_parsed_free(parsed_state);
134 ec_parsed_free(parsed_state);
135 ec_completed_free(completed);
139 struct ec_completed *ec_node_complete(struct ec_node *node,
142 struct ec_strvec *strvec = NULL;
143 struct ec_completed *completed;
146 strvec = ec_strvec();
150 if (ec_strvec_add(strvec, str) < 0)
153 completed = ec_node_complete_strvec(node, strvec);
154 if (completed == NULL)
157 ec_strvec_free(strvec);
161 ec_strvec_free(strvec);
165 /* count the number of identical chars at the beginning of 2 strings */
166 static size_t strcmp_count(const char *s1, const char *s2)
170 while (s1[i] && s2[i] && s1[i] == s2[i])
176 static struct ec_completed_node *
177 ec_completed_node(const struct ec_node *node)
179 struct ec_completed_node *compnode = NULL;
181 compnode = ec_calloc(1, sizeof(*compnode));
182 if (compnode == NULL)
185 compnode->node = node;
186 TAILQ_INIT(&compnode->items);
191 static struct ec_completed_item *
192 ec_completed_item(struct ec_parsed *state, const struct ec_node *node)
194 struct ec_completed_item *item = NULL;
198 item = ec_calloc(1, sizeof(*item));
203 for (p = state, len = 0; p != NULL;
204 p = ec_parsed_get_parent(p), len++)
206 /* allocate room for path */
207 item->path = ec_calloc(len, sizeof(*item->path));
208 if (item->path == NULL)
211 /* write path in array */
212 for (p = state, len = 0; p != NULL;
213 p = ec_parsed_get_parent(p), len++)
214 item->path[len] = p->node;
216 item->type = EC_NO_MATCH;
226 ec_completed_item_free(item);
232 __ec_completed_add_match(enum ec_completed_type type,
233 struct ec_completed *completed,
234 struct ec_parsed *parsed_state,
235 const struct ec_node *node, const char *str)
237 struct ec_completed_node *compnode = NULL;
238 struct ec_completed_item *item = NULL;
241 /* find the compnode entry corresponding to this node */
242 TAILQ_FOREACH(compnode, &completed->nodes, next) {
243 if (compnode->node == node)
246 if (compnode == NULL)
249 item = ec_completed_item(parsed_state, node);
254 item->str = ec_strdup(str);
255 if (item->str == NULL)
259 if (item->str != NULL)
260 completed->count_match++;
262 TAILQ_INSERT_TAIL(&compnode->items, item, next);
268 ec_completed_item_free(item);
273 ec_completed_add_match(struct ec_completed *completed,
274 struct ec_parsed *parsed_state,
275 const struct ec_node *node, const char *str)
277 struct ec_completed_node *compnode = NULL;
278 struct ec_completed_item *item = NULL;
281 /* find the compnode entry corresponding to this node */
282 TAILQ_FOREACH(compnode, &completed->nodes, next) {
283 if (compnode->node == node)
286 if (compnode == NULL)
289 item = ec_completed_item(parsed_state, node);
292 item->type = EC_MATCH;
294 item->str = ec_strdup(str);
295 if (item->str == NULL)
299 if (item->str != NULL)
300 completed->count_match++;
302 TAILQ_INSERT_TAIL(&compnode->items, item, next);
308 ec_completed_item_free(item);
313 ec_completed_add_no_match(struct ec_completed *completed,
314 struct ec_parsed *parsed_state,
315 const struct ec_node *node)
317 return __ec_completed_add_match(EC_NO_MATCH, completed, parsed_state,
322 ec_completed_add_partial_match(struct ec_completed *completed,
323 struct ec_parsed *parsed_state,
324 const struct ec_node *node, const char *str)
326 return __ec_completed_add_match(EC_PARTIAL_MATCH, completed, parsed_state,
331 ec_completed_add_node(struct ec_completed *completed,
332 const struct ec_node *node)
334 struct ec_completed_node *compnode = NULL;
336 compnode = ec_completed_node(node);
337 if (compnode == NULL)
340 TAILQ_INSERT_TAIL(&completed->nodes, compnode, next);
344 void ec_completed_item_free(struct ec_completed_item *match)
347 ec_free(match->path);
351 /* default completion function: return a no-match element */
353 ec_node_default_complete(const struct ec_node *gen_node,
354 struct ec_completed *completed,
355 struct ec_parsed *parsed_state,
356 const struct ec_strvec *strvec)
360 if (ec_strvec_len(strvec) != 1)
363 ret = ec_completed_add_no_match(completed, parsed_state, gen_node);
370 void ec_completed_free(struct ec_completed *completed)
372 struct ec_completed_node *compnode;
373 struct ec_completed_item *item;
375 if (completed == NULL)
378 while (!TAILQ_EMPTY(&completed->nodes)) {
379 compnode = TAILQ_FIRST(&completed->nodes);
380 TAILQ_REMOVE(&completed->nodes, compnode, next);
382 while (!TAILQ_EMPTY(&compnode->items)) {
383 item = TAILQ_FIRST(&compnode->items);
384 TAILQ_REMOVE(&compnode->items, item, next);
385 ec_completed_item_free(item);
392 void ec_completed_dump(FILE *out, const struct ec_completed *completed)
394 struct ec_completed_node *compnode;
395 struct ec_completed_item *item;
397 if (completed == NULL || completed->count == 0) {
398 fprintf(out, "no completion\n");
402 fprintf(out, "completion: count=%u match=%u\n",
403 completed->count, completed->count_match);
405 TAILQ_FOREACH(compnode, &completed->nodes, next) {
406 fprintf(out, "node=%p, node_type=%s\n",
407 compnode->node, compnode->node->type->name);
408 TAILQ_FOREACH(item, &compnode->items, next) {
411 switch (item->type) {
412 case EC_NO_MATCH: typestr = "no-match"; break;
413 case EC_MATCH: typestr = "match"; break;
414 case EC_PARTIAL_MATCH: typestr = "partial-match"; break;
415 default: typestr = "unknown"; break;
418 fprintf(out, " type=%s str=<%s>\n", typestr, item->str);
423 char *ec_completed_smallest_start(const struct ec_completed *completed)
425 struct ec_completed_node *compnode;
426 struct ec_completed_item *item;
427 char *smallest_start = NULL;
430 if (completed == NULL)
433 TAILQ_FOREACH(compnode, &completed->nodes, next) {
434 TAILQ_FOREACH(item, &compnode->items, next) {
435 if (item->str == NULL)
437 if (smallest_start == NULL) {
438 smallest_start = ec_strdup(item->str);
439 if (smallest_start == NULL)
442 n = strcmp_count(item->str, smallest_start);
443 smallest_start[n] = '\0';
448 return smallest_start;
451 ec_free(smallest_start);
455 unsigned int ec_completed_count(
456 const struct ec_completed *completed,
457 enum ec_completed_type type)
459 unsigned int count = 0;
461 if (completed == NULL)
465 count += completed->count_match;
466 if (type & EC_NO_MATCH)
467 count += (completed->count - completed->count_match); //XXX
472 struct ec_completed_iter *
473 ec_completed_iter(struct ec_completed *completed,
474 enum ec_completed_type type)
476 struct ec_completed_iter *iter;
478 iter = ec_calloc(1, sizeof(*iter));
482 iter->completed = completed;
484 iter->cur_node = NULL;
485 iter->cur_match = NULL;
490 const struct ec_completed_item *ec_completed_iter_next(
491 struct ec_completed_iter *iter)
493 const struct ec_completed *completed = iter->completed;
494 const struct ec_completed_node *cur_node;
495 const struct ec_completed_item *cur_match;
497 if (completed == NULL)
500 cur_node = iter->cur_node;
501 cur_match = iter->cur_match;
504 if (cur_node == NULL) {
505 TAILQ_FOREACH(cur_node, &completed->nodes, next) {
506 TAILQ_FOREACH(cur_match, &cur_node->items, next) {
507 if (cur_match != NULL &&
508 cur_match->type & iter->type)
514 cur_match = TAILQ_NEXT(cur_match, next);
515 if (cur_match != NULL &&
516 cur_match->type & iter->type)
518 cur_node = TAILQ_NEXT(cur_node, next);
519 while (cur_node != NULL) {
520 cur_match = TAILQ_FIRST(&cur_node->items);
521 if (cur_match != NULL &&
522 cur_match->type & iter->type)
524 cur_node = TAILQ_NEXT(cur_node, next);
530 iter->cur_node = cur_node;
531 iter->cur_match = cur_match;
533 return iter->cur_match;
536 void ec_completed_iter_free(struct ec_completed_iter *iter)