ci_queue -> run_queue

Also, some minor refactoring.

1 files changed, 110 insertions, 0 deletions

diff --git a/src/run_queue.c b/src/run_queue.c
new file mode 100644
index 0000000..8b5052b
--- /dev/null
+++ b/src/run_queue.c
@@ -0,0 +1,110 @@
+/*
+ * Copyright (c) 2022 Egor Tensin <Egor.Tensin@gmail.com>
+ * This file is part of the "cimple" project.
+ * For details, see https://github.com/egor-tensin/cimple.
+ * Distributed under the MIT License.
+ */
+
+#include "run_queue.h"
+#include "log.h"
+
+#include <stdlib.h>
+#include <string.h>
+#include <sys/queue.h>
+
+struct run_queue_entry {
+	char *url;
+	char *rev;
+	STAILQ_ENTRY(run_queue_entry) entries;
+};
+
+int run_queue_entry_create(struct run_queue_entry **_entry, const char *_url, const char *_rev)
+{
+	struct run_queue_entry *entry = malloc(sizeof(struct run_queue_entry));
+	if (!entry) {
+		log_errno("malloc");
+		goto fail;
+	}
+
+	char *url = strdup(_url);
+	if (!url) {
+		log_errno("strdup");
+		goto free_entry;
+	}
+
+	char *rev = strdup(_rev);
+	if (!rev) {
+		log_errno("strdup");
+		goto free_url;
+	}
+
+	entry->url = url;
+	entry->rev = rev;
+
+	*_entry = entry;
+	return 0;
+
+free_url:
+	free(url);
+
+free_entry:
+	free(entry);
+
+fail:
+	return -1;
+}
+
+void run_queue_entry_destroy(struct run_queue_entry *entry)
+{
+	free(entry->rev);
+	free(entry->url);
+	free(entry);
+}
+
+const char *run_queue_entry_get_url(const struct run_queue_entry *entry)
+{
+	return entry->url;
+}
+
+const char *run_queue_entry_get_rev(const struct run_queue_entry *entry)
+{
+	return entry->rev;
+}
+
+void run_queue_create(struct run_queue *queue)
+{
+	STAILQ_INIT(queue);
+}
+
+void run_queue_destroy(struct run_queue *queue)
+{
+	struct run_queue_entry *entry1 = STAILQ_FIRST(queue);
+	while (entry1) {
+		struct run_queue_entry *entry2 = STAILQ_NEXT(entry1, entries);
+		run_queue_entry_destroy(entry1);
+		entry1 = entry2;
+	}
+	STAILQ_INIT(queue);
+}
+
+int run_queue_is_empty(const struct run_queue *queue)
+{
+	return STAILQ_EMPTY(queue);
+}
+
+void run_queue_add_last(struct run_queue *queue, struct run_queue_entry *entry)
+{
+	STAILQ_INSERT_TAIL(queue, entry, entries);
+}
+
+void run_queue_add_first(struct run_queue *queue, struct run_queue_entry *entry)
+{
+	STAILQ_INSERT_HEAD(queue, entry, entries);
+}
+
+struct run_queue_entry *run_queue_remove_first(struct run_queue *queue)
+{
+	struct run_queue_entry *entry = STAILQ_FIRST(queue);
+	STAILQ_REMOVE_HEAD(queue, entries);
+	return entry;
+}