return NULL;
compnode->node = node;
- TAILQ_INIT(&compnode->matches);
+ TAILQ_INIT(&compnode->items);
return compnode;
}
-static struct ec_completed_match *
-ec_completed_match(enum ec_completed_type type, struct ec_parsed *state,
- const struct ec_node *node, const char *add)
+static struct ec_completed_item *
+ec_completed_item(struct ec_parsed *state, const struct ec_node *node)
{
- struct ec_completed_match *item = NULL;
+ struct ec_completed_item *item = NULL;
+ struct ec_parsed *p;
+ size_t len;
item = ec_calloc(1, sizeof(*item));
if (item == NULL)
return NULL;
- /* XXX can state be NULL? */
- if (state != NULL) {
- struct ec_parsed *p;
- size_t len;
+ /* get path len */
+ for (p = state, len = 0; p != NULL;
+ p = ec_parsed_get_parent(p), len++)
+ ;
+ /* allocate room for path */
+ item->path = ec_calloc(len, sizeof(*item->path));
+ if (item->path == NULL)
+ goto fail;
+ item->pathlen = len;
+ /* write path in array */
+ for (p = state, len = 0; p != NULL;
+ p = ec_parsed_get_parent(p), len++)
+ item->path[len] = p->node;
- /* get path len */
- for (p = state, len = 0; p != NULL;
- p = ec_parsed_get_parent(p), len++)
- ;
+ item->type = EC_NO_MATCH;
+ item->node = node;
- item->path = ec_calloc(len, sizeof(*item->path));
- if (item->path == NULL)
- goto fail;
+ return item;
- item->pathlen = len;
+fail:
+ if (item != NULL) {
+ ec_free(item->path);
+ ec_free(item->str);
+ }
+ ec_completed_item_free(item);
- /* write path in array */
- for (p = state, len = 0; p != NULL;
- p = ec_parsed_get_parent(p), len++)
- item->path[len] = p->node;
+ return NULL;
+}
+
+static int
+__ec_completed_add_match(enum ec_completed_type type,
+ struct ec_completed *completed,
+ struct ec_parsed *parsed_state,
+ const struct ec_node *node, const char *str)
+{
+ struct ec_completed_node *compnode = NULL;
+ struct ec_completed_item *item = NULL;
+ int ret = -ENOMEM;
+
+ /* find the compnode entry corresponding to this node */
+ TAILQ_FOREACH(compnode, &completed->nodes, next) {
+ if (compnode->node == node)
+ break;
}
+ if (compnode == NULL)
+ return -ENOENT;
+ item = ec_completed_item(parsed_state, node);
+ if (item == NULL)
+ goto fail;
item->type = type;
- item->node = node;
- if (add != NULL) {
- item->add = ec_strdup(add);
- if (item->add == NULL)
+ if (str != NULL) {
+ item->str = ec_strdup(str);
+ if (item->str == NULL)
goto fail;
}
- return item;
+ if (item->str != NULL)
+ completed->count_match++;
-fail:
- if (item != NULL) {
- ec_free(item->path);
- ec_free(item->add);
- }
- ec_completed_match_free(item);
+ TAILQ_INSERT_TAIL(&compnode->items, item, next);
+ completed->count++;
- return NULL;
+ return 0;
+
+fail:
+ ec_completed_item_free(item);
+ return ret;
}
int
ec_completed_add_match(struct ec_completed *completed,
struct ec_parsed *parsed_state,
- const struct ec_node *node, const char *add)
+ const struct ec_node *node, const char *str)
{
struct ec_completed_node *compnode = NULL;
- struct ec_completed_match *item = NULL;
+ struct ec_completed_item *item = NULL;
int ret = -ENOMEM;
- size_t n;
+ /* find the compnode entry corresponding to this node */
TAILQ_FOREACH(compnode, &completed->nodes, next) {
if (compnode->node == node)
break;
if (compnode == NULL)
return -ENOENT;
- item = ec_completed_match(EC_MATCH, parsed_state, node, add);
+ item = ec_completed_item(parsed_state, node);
if (item == NULL)
goto fail;
+ item->type = EC_MATCH;
+ if (str != NULL) {
+ item->str = ec_strdup(str);
+ if (item->str == NULL)
+ goto fail;
+ }
- if (item->add != NULL) {
- if (completed->smallest_start == NULL) {
- completed->smallest_start = ec_strdup(item->add);
- if (completed->smallest_start == NULL)
- goto fail;
- } else {
- n = strcmp_count(item->add,
- completed->smallest_start);
- completed->smallest_start[n] = '\0';
- }
+ if (item->str != NULL)
completed->count_match++;
- }
- TAILQ_INSERT_TAIL(&compnode->matches, item, next);
+ TAILQ_INSERT_TAIL(&compnode->items, item, next);
completed->count++;
return 0;
fail:
- ec_completed_match_free(item);
+ ec_completed_item_free(item);
return ret;
}
+int
+ec_completed_add_no_match(struct ec_completed *completed,
+ struct ec_parsed *parsed_state,
+ const struct ec_node *node)
+{
+ return __ec_completed_add_match(EC_NO_MATCH, completed, parsed_state,
+ node, NULL);
+}
+
+int
+ec_completed_add_partial_match(struct ec_completed *completed,
+ struct ec_parsed *parsed_state,
+ const struct ec_node *node, const char *str)
+{
+ return __ec_completed_add_match(EC_PARTIAL_MATCH, completed, parsed_state,
+ node, str);
+}
+
int
ec_completed_add_node(struct ec_completed *completed,
const struct ec_node *node)
{
- struct ec_completed_node *item = NULL;
+ struct ec_completed_node *compnode = NULL;
- item = ec_completed_node(node);
- if (item == NULL)
+ compnode = ec_completed_node(node);
+ if (compnode == NULL)
return -ENOMEM;
- TAILQ_INSERT_TAIL(&completed->nodes, item, next);
+ TAILQ_INSERT_TAIL(&completed->nodes, compnode, next);
return 0;
}
-void ec_completed_match_free(struct ec_completed_match *item)
+void ec_completed_item_free(struct ec_completed_item *match)
{
- ec_free(item->add);
- ec_free(item->path);
- ec_free(item);
+ ec_free(match->str);
+ ec_free(match->path);
+ ec_free(match);
}
-/* default completion function: return a no-item element */
+/* default completion function: return a no-match element */
int
ec_node_default_complete(const struct ec_node *gen_node,
struct ec_completed *completed,
- struct ec_parsed *parsed,
+ struct ec_parsed *parsed_state,
const struct ec_strvec *strvec)
{
- (void)gen_node;
- (void)completed;
- (void)parsed;
+ int ret;
- if (ec_strvec_len(strvec) != 1) //XXX needed?
+ if (ec_strvec_len(strvec) != 1)
return 0;
+ ret = ec_completed_add_no_match(completed, parsed_state, gen_node);
+ if (ret < 0)
+ return ret;
+
return 0;
}
void ec_completed_free(struct ec_completed *completed)
{
struct ec_completed_node *compnode;
- struct ec_completed_match *item;
+ struct ec_completed_item *item;
if (completed == NULL)
return;
compnode = TAILQ_FIRST(&completed->nodes);
TAILQ_REMOVE(&completed->nodes, compnode, next);
- while (!TAILQ_EMPTY(&compnode->matches)) {
- item = TAILQ_FIRST(&compnode->matches);
- TAILQ_REMOVE(&compnode->matches, item, next);
- ec_completed_match_free(item);
+ while (!TAILQ_EMPTY(&compnode->items)) {
+ item = TAILQ_FIRST(&compnode->items);
+ TAILQ_REMOVE(&compnode->items, item, next);
+ ec_completed_item_free(item);
}
ec_free(compnode);
}
- ec_free(completed->smallest_start);
ec_free(completed);
}
void ec_completed_dump(FILE *out, const struct ec_completed *completed)
{
struct ec_completed_node *compnode;
- struct ec_completed_match *item;
+ struct ec_completed_item *item;
if (completed == NULL || completed->count == 0) {
fprintf(out, "no completion\n");
return;
}
- fprintf(out, "completion: count=%u match=%u smallest_start=<%s>\n",
- completed->count, completed->count_match,
- completed->smallest_start);
+ fprintf(out, "completion: count=%u match=%u\n",
+ completed->count, completed->count_match);
TAILQ_FOREACH(compnode, &completed->nodes, next) {
fprintf(out, "node=%p, node_type=%s\n",
compnode->node, compnode->node->type->name);
- TAILQ_FOREACH(item, &compnode->matches, next) {
- fprintf(out, "add=<%s>\n", item->add); /* XXX comp type */
+ TAILQ_FOREACH(item, &compnode->items, next) {
+ const char *typestr;
+
+ switch (item->type) {
+ case EC_NO_MATCH: typestr = "no-match"; break;
+ case EC_MATCH: typestr = "match"; break;
+ case EC_PARTIAL_MATCH: typestr = "partial-match"; break;
+ default: typestr = "unknown"; break;
+ }
+
+ fprintf(out, " type=%s str=<%s>\n", typestr, item->str);
}
}
}
-const char *ec_completed_smallest_start(
- const struct ec_completed *completed)
+char *ec_completed_smallest_start(const struct ec_completed *completed)
{
- if (completed == NULL || completed->smallest_start == NULL)
- return "";
+ struct ec_completed_node *compnode;
+ struct ec_completed_item *item;
+ char *smallest_start = NULL;
+ size_t n;
+
+ if (completed == NULL)
+ goto fail;
- return completed->smallest_start;
+ TAILQ_FOREACH(compnode, &completed->nodes, next) {
+ TAILQ_FOREACH(item, &compnode->items, next) {
+ if (item->str == NULL)
+ continue;
+ if (smallest_start == NULL) {
+ smallest_start = ec_strdup(item->str);
+ if (smallest_start == NULL)
+ goto fail;
+ } else {
+ n = strcmp_count(item->str, smallest_start);
+ smallest_start[n] = '\0';
+ }
+ }
+ }
+
+ return smallest_start;
+
+fail:
+ ec_free(smallest_start);
+ return NULL;
}
unsigned int ec_completed_count(
return iter;
}
-const struct ec_completed_match *ec_completed_iter_next(
+const struct ec_completed_item *ec_completed_iter_next(
struct ec_completed_iter *iter)
{
const struct ec_completed *completed = iter->completed;
const struct ec_completed_node *cur_node;
- const struct ec_completed_match *cur_match;
+ const struct ec_completed_item *cur_match;
if (completed == NULL)
return NULL;
/* first call */
if (cur_node == NULL) {
TAILQ_FOREACH(cur_node, &completed->nodes, next) {
- TAILQ_FOREACH(cur_match, &cur_node->matches, next) {
- if (cur_match != NULL)
+ TAILQ_FOREACH(cur_match, &cur_node->items, next) {
+ if (cur_match != NULL &&
+ cur_match->type & iter->type)
goto found;
}
}
return NULL;
} else {
cur_match = TAILQ_NEXT(cur_match, next);
- if (cur_match != NULL)
+ if (cur_match != NULL &&
+ cur_match->type & iter->type)
goto found;
cur_node = TAILQ_NEXT(cur_node, next);
while (cur_node != NULL) {
- cur_match = TAILQ_FIRST(&cur_node->matches);
- if (cur_match != NULL)
+ cur_match = TAILQ_FIRST(&cur_node->items);
+ if (cur_match != NULL &&
+ cur_match->type & iter->type)
goto found;
cur_node = TAILQ_NEXT(cur_node, next);
}
git.droids-corp.org / protos / libecoli.git / blobdiff