queue: カーネルに汎用キュー構造追加

Author: Yuma Arakawa

kernel/Makefile

@@ -7,7 +7,7 @@ CFLAGS	+=	-Iinclude
 .c.o:
 	gcc $(CFLAGS) -o $@ $<
 
-kernel.bin: sys.o cpu.o intr.o excp.o memory.o sched.o timer.o console_io.o debug.o main.o kern_task_init.o
+kernel.bin: sys.o cpu.o intr.o excp.o memory.o sched.o timer.o console_io.o queue.o debug.o main.o kern_task_init.o
 	ld -o $@ $+ -Map System.map -s -T sys.ld -x
 
 sys.o: sys.S
@@ -26,6 +26,8 @@ timer.o: timer.c
 
 console_io.o: console_io.c
 
+queue.o: queue.c
+
 debug.o: debug.c
 
 main.o: main.c

kernel/include/list.h

@@ -0,0 +1,9 @@
+#ifndef _LIST_H_
+#define _LIST_H_
+
+struct list {
+	struct list *next;
+	struct list *prev;
+};
+
+#endif /* _LIST_H_ */

kernel/include/queue.h

@@ -0,0 +1,11 @@
+#ifndef _QUEUE_H_
+#define _QUEUE_H_
+
+#include <list.h>
+
+void queue_init(struct list *head);
+void queue_enq(struct list *entry, struct list *head);
+void queue_del(struct list *entry);
+void queue_dump(struct list *head);
+
+#endif /* _QUEUE_H_ */

kernel/queue.c

@@ -0,0 +1,44 @@
+#include <queue.h>
+#include <list.h>
+#include <console_io.h>
+
+void queue_init(struct list *head)
+{
+	head->next = head;
+	head->prev = head;
+}
+
+void queue_enq(struct list *entry, struct list *head)
+{
+	entry->prev = head->prev;
+	entry->next = head;
+	head->prev->next = entry;
+	head->prev = entry;
+}
+
+void queue_del(struct list *entry)
+{
+	entry->prev->next = entry->next;
+	entry->next->prev = entry->prev;
+}
+
+void queue_dump(struct list *head)
+{
+	unsigned int n;
+	struct list *entry;
+
+	put_str("h : p=");
+	dump_hex((unsigned int)head->prev, 8);
+	put_str(", n=");
+	dump_hex((unsigned int)head->next, 8);
+	put_str("\r\n");
+
+	for (entry = head->next, n = 0; entry != head; entry = entry->next, n++) {
+		dump_hex(n, 2);
+		put_str(": p=");
+		dump_hex((unsigned int)entry->prev, 8);
+		put_str(", n=");
+		dump_hex((unsigned int)entry->next, 8);
+		put_str("\r\n");
+	}
+}