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.
28 #ifndef ECOLI_COMPLETED_
29 #define ECOLI_COMPLETED_
31 #include <sys/queue.h>
32 #include <sys/types.h>
37 enum ec_completed_type {
43 struct ec_completed_item {
44 TAILQ_ENTRY(ec_completed_item) next;
45 enum ec_completed_type type;
46 const struct ec_node *node;
49 /* reverse order: [0] = last parsed, [len-1] = root */
50 const struct ec_node **path;
54 TAILQ_HEAD(ec_completed_item_list, ec_completed_item);
56 struct ec_completed_node {
57 const struct ec_node *node;
60 TAILQ_HEAD(ec_completed_node_list, ec_completed_node);
66 struct ec_completed_node_list nodes;
67 struct ec_completed_item_list matches;
71 * return a completed object filled with items
72 * return NULL on error (nomem?)
74 struct ec_completed *ec_node_complete(struct ec_node *node,
76 struct ec_completed *ec_node_complete_strvec(struct ec_node *node,
77 const struct ec_strvec *strvec);
79 /* internal: used by nodes */
80 struct ec_completed *ec_node_complete_child(struct ec_node *node,
81 struct ec_parsed *state,
82 const struct ec_strvec *strvec);
84 struct ec_completed *ec_completed(void);
86 int ec_completed_add_match(struct ec_completed *completed,
87 struct ec_parsed *state,
88 const struct ec_node *node, const char *add);
89 int ec_completed_add_no_match(struct ec_completed *completed,
90 struct ec_parsed *state, const struct ec_node *node);
92 void ec_completed_item_free(struct ec_completed_item *item);
93 void ec_completed_merge(struct ec_completed *completed1,
94 struct ec_completed *completed2);
95 void ec_completed_free(struct ec_completed *completed);
96 void ec_completed_dump(FILE *out,
97 const struct ec_completed *completed);
98 struct ec_completed *ec_node_default_complete(const struct ec_node *gen_node,
99 struct ec_parsed *state,
100 const struct ec_strvec *strvec);
102 /* cannot return NULL */
103 const char *ec_completed_smallest_start(
104 const struct ec_completed *completed);
106 unsigned int ec_completed_count(
107 const struct ec_completed *completed,
108 enum ec_completed_type flags);
110 struct ec_completed_iter {
111 enum ec_completed_type type;
112 const struct ec_completed *completed;
113 const struct ec_completed_item *cur_item;
116 struct ec_completed_iter *
117 ec_completed_iter(struct ec_completed *completed,
118 enum ec_completed_type type);
120 const struct ec_completed_item *ec_completed_iter_next(
121 struct ec_completed_iter *iter);
123 void ec_completed_iter_free(struct ec_completed_iter *iter);