* src/completions.c (completions_next_completion): check

c->last_match as a match to partial on a virgin completion.

* src/group.c (free_groups): new function

* src/group.h (free_groups): new prototype

* src/main.c (clean_up): call free_groups

* src/actions.c (cmd_fdump): free the string returned by frame_dump.

* src/completions.c (completions_update): free new_list.

1 files changed, 17 insertions, 1 deletions

diff --git a/src/completions.c b/src/completions.c
index 970897d..6f2ed12 100644
--- a/src/completions.c
+++ b/src/completions.c
@@ -71,6 +71,9 @@ completions_update (rp_completions *c, char *partial)
   c->partial = xstrdup (partial);
 
   completions_assign (c, new_list);
+
+  /* Free the head structure for our list. */
+  free (new_list);
 }
 
 /* Return a completed string that starts with partial. */
@@ -80,11 +83,24 @@ completions_next_completion (rp_completions *c, char *partial)
   struct sbuf *cur;
 
   if (c->virgin)
-    completions_update (c, partial);
+    {
+      completions_update (c, partial);
+      
+      /* Since it's never been completed on and c->last_match points
+	 to the first element of the list which may be a match. So
+	 check it. FIXME: This is a bit of a hack. */
+      if (c->last_match == NULL)
+	return NULL;
+
+      if (str_comp (sbuf_get (c->last_match), c->partial, strlen (c->partial)))
+	return sbuf_get (c->last_match);
+    }
 
   if (c->last_match == NULL)
     return NULL;
 
+  /*  */
+
   /* search forward from our last match through the list looking for
      another match. */
   for (cur = list_next_entry (c->last_match, &c->completion_list, node);