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;
50 /* reverse order: [0] = last, [len-1] = root */
51 const struct ec_node **path;
55 TAILQ_HEAD(ec_completed_item_list, ec_completed_item);
57 struct ec_completed_node {
58 TAILQ_ENTRY(ec_completed_node) next;
59 const struct ec_node *node;
60 struct ec_completed_item_list items;
63 TAILQ_HEAD(ec_completed_node_list, ec_completed_node);
68 struct ec_completed_node_list nodes;
72 * return a completed object filled with items
73 * return NULL on error (nomem?)
75 struct ec_completed *ec_node_complete(struct ec_node *node,
77 struct ec_completed *ec_node_complete_strvec(struct ec_node *node,
78 const struct ec_strvec *strvec);
80 /* internal: used by nodes */
81 int ec_node_complete_child(struct ec_node *node,
82 struct ec_completed *completed,
83 struct ec_parsed *parsed_state,
84 const struct ec_strvec *strvec);
86 struct ec_completed *ec_completed(void);
88 struct ec_completed_item *
89 ec_completed_item(struct ec_parsed *state, const struct ec_node *node);
90 int ec_completed_item_set(struct ec_completed_item *item,
91 enum ec_completed_type type, const char *str);
92 int ec_completed_item_add(struct ec_completed *completed,
93 struct ec_completed_item *item);
94 void ec_completed_item_free(struct ec_completed_item *item);
96 int ec_completed_item_set_display(struct ec_completed_item *item,
99 void ec_completed_free(struct ec_completed *completed);
100 void ec_completed_dump(FILE *out,
101 const struct ec_completed *completed);
103 ec_node_default_complete(const struct ec_node *gen_node,
104 struct ec_completed *completed,
105 struct ec_parsed *state,
106 const struct ec_strvec *strvec);
108 unsigned int ec_completed_count(
109 const struct ec_completed *completed,
110 enum ec_completed_type flags);
112 struct ec_completed_iter {
113 enum ec_completed_type type;
114 const struct ec_completed *completed;
115 const struct ec_completed_node *cur_node;
116 const struct ec_completed_item *cur_match;
119 struct ec_completed_iter *
120 ec_completed_iter(struct ec_completed *completed,
121 enum ec_completed_type type);
123 const struct ec_completed_item *ec_completed_iter_next(
124 struct ec_completed_iter *iter);
126 void ec_completed_iter_free(struct ec_completed_iter *iter);