1 files changed, 184 insertions, 0 deletions
diff --git a/history.c b/history.c
new file mode 100644
index 0000000..c8c7b2e
--- /dev/null
+++ b/history.c
@@ -0,0 +1,184 @@
+#include "history.h"
+#include "link.h"
+#include "util.h"
+
+#include <string.h>
+#include <wchar.h>
+
+
+void
+history_init(struct history *history)
+{
+	history->list = LIST_HEAD;
+	history->query = inputln_init();
+	history->cmd = history->query;
+}
+
+void
+history_submit(struct history *history)
+{
+	/* if chose from history free query */
+	if (history->cmd != history->query) {
+		history_pop(history->query);
+		inputln_free(history->query);
+	}
+
+	/* pop first in case already in history */
+	history_pop(history->cmd);
+	history_add(history, history->cmd);
+
+	/* create new input buf and add to hist */
+	history->query = inputln_init();
+	history->cmd = history->query;
+	history_add(history, history->cmd);
+}
+
+void
+history_free(struct history *history)
+{
+	struct link *iter, *next;
+	struct inputln *ln;
+
+	for (iter = &history->list; iter; iter = next) {
+		next = iter->next;
+		ln = UPCAST(iter, struct inputln);
+		free(ln);
+	}
+	free(history->cmd);
+}
+
+struct inputln *
+history_list_prev(struct inputln *cur, const wchar_t *search)
+{
+	struct link *iter;
+	struct inputln *ln;
+
+	for (iter = cur->link.prev; iter && iter->prev; iter = iter->prev) {
+		ln = UPCAST(iter, struct inputln);
+		if (!search || !*search || wcsstr(ln->buf, search))
+			return ln;
+	}
+
+	return NULL;
+}
+
+struct inputln *
+history_list_next(struct inputln *cur, const wchar_t *search)
+{
+	struct link *iter;
+	struct inputln *ln;
+
+	for (iter = cur->link.next; iter; iter = iter->next) {
+		ln = UPCAST(iter, struct inputln);
+		if (!search || !*search || wcsstr(ln->buf, search))
+			return ln;
+	}
+
+	return cur;
+}
+
+void
+history_prev(struct history *history)
+{
+	history->cmd = history_list_prev(history->cmd, history->query->buf);
+	if (!history->cmd) history->cmd = history->query;
+}
+
+void
+history_next(struct history *history)
+{
+	history->cmd = history_list_next(history->cmd, history->query->buf);
+}
+
+void
+history_pop(struct inputln *line)
+{
+	link_pop(&line->link);
+}
+
+void
+history_add(struct history *history, struct inputln *line)
+{
+	struct inputln *ln;
+	struct link *back;
+
+	if (list_len(&history->list) == HISTORY_MAX) {
+		back = list_back(&history->list);
+		back->prev->next = NULL;
+		ln = UPCAST(back, struct inputln);
+		inputln_free(ln);
+	}
+
+	link_append(&history->list, &line->link);
+}
+
+struct inputln *
+inputln_init(void)
+{
+	struct inputln *ln;
+
+	ln = malloc(sizeof(struct inputln));
+	ASSERT(ln != NULL);
+	ln->cap = 128;
+	ln->buf = malloc(ln->cap * sizeof(wchar_t));
+	ASSERT(ln->buf != NULL);
+	ln->len = 0;
+	ln->buf[ln->len] = '\0';
+	ln->cur = 0;
+	ln->link.next = NULL;
+	ln->link.prev = NULL;
+
+	return ln;
+}
+
+void
+inputln_free(struct inputln *ln)
+{
+	free(ln->buf);
+	free(ln);
+}
+
+void
+inputln_left(struct inputln *cmd)
+{
+	cmd->cur = MAX(0, cmd->cur-1);
+}
+
+void
+inputln_right(struct inputln *cmd)
+{
+	cmd->cur = MIN(cmd->len, cmd->cur+1);
+}
+
+void
+inputln_addch(struct inputln *line, wchar_t c)
+{
+	int i;
+
+	if (line->len + 1 == line->cap) {
+		line->cap *= 2;
+		line->buf = realloc(line->buf, line->cap);
+	}
+
+	for (i = line->len; i > line->cur; i--)
+		line->buf[i] = line->buf[i-1];
+	line->buf[line->cur] = c;
+	line->len++;
+	line->cur++;
+}
+
+void
+inputln_del(struct inputln *line, int n)
+{
+	int i;
+
+	if (!line->cur) return;
+
+	n = MIN(n, line->cur);
+	for (i = line->cur; i <= line->len; i++)
+		line->buf[i-n] = line->buf[i];
+	for (i = line->len - n; i <= line->len; i++)
+		line->buf[i] = 0;
+	line->len -= n;
+	line->cur -= n;
+}