SnailOS 0.03的list目录是核心数据结构

weixin_39410618

已于 2022-07-09 21:24:47 修改

阅读量141

点赞数

分类专栏：操作系统文章标签： c语言

于 2022-07-09 21:15:20 首次发布

本文链接：https://blog.csdn.net/weixin_39410618/article/details/125698919

版权

操作系统专栏收录该内容

157 篇文章 4 订阅

订阅专栏

这篇博客详细介绍了双向链表在操作系统中的重要应用，如内存管理、线程和进程控制以及定时器管理。通过提供的`list.h`和`list.c`代码，展示了如何初始化、插入、删除和遍历双向链表的操作。此外，还包含了一个用于查找元素的函数和计算链表长度的方法，这对于理解内核级数据结构的实现非常有帮助。

摘要由CSDN通过智能技术生成

双向链表被用于内存管理、内核线程及进程管理、定时器管理等内核管理的许多地方。

// list.h

#ifndef __LIST_H
#define __LIST_H
#include "global.h"

// 核心数据结构 双向链表

struct list_elem {
	struct list_elem* prev;
	struct list_elem* next;
};

struct list {
	struct list_elem head;
	struct list_elem tail;
};

typedef bool (function)(struct list_elem*, int arg);

void list_init(struct list* list);
void list_insert_before(struct list_elem* before, struct list_elem* elem);
void list_push(struct list* plist, struct list_elem* elem);
void list_append(struct list* plist, struct list_elem* elem);
void list_remove(struct list_elem* pelem);
struct list_elem* list_pop(struct list* plist);
bool elem_find(struct list* plist, struct list_elem* obj_elem);
struct list_elem* list_traversal(struct list* plist, function func, int arg);
unsigned int list_len(struct list* plist);
bool list_empty(struct list* plist);


#endif

// list.c
#include "list.h"
#include "intr_status_op.h"
#include "global.h"

// 核心数据结构 双向链表
void list_init(struct list* list) {
	list->head.prev = NULL;
	list->head.next = &list->tail;
	list->tail.prev = &list->head;
	list->tail.next = NULL;
}

void list_insert_before(struct list_elem* before, struct list_elem* elem) {
	enum intr_status old_status = intr_disable();
	before->prev->next = elem;
	elem->prev = before->prev;
	elem->next = before;
	before->prev = elem;
	intr_set_status(old_status);
}

void list_push(struct list* plist, struct list_elem* elem) {
	list_insert_before(plist->head.next, elem);
}

void list_append(struct list* plist, struct list_elem* elem) {
	list_insert_before(&plist->tail, elem);
}

void list_remove(struct list_elem* pelem) {
	enum intr_status old_status = intr_disable();
	pelem->prev->next = pelem->next;
	pelem->next->prev = pelem->prev;
	intr_set_status(old_status);
}

struct list_elem* list_pop(struct list* plist) {
	struct list_elem* elem = plist->head.next;
	list_remove(elem);
	return elem;
}

bool elem_find(struct list* plist, struct list_elem* obj_elem) {
	struct list_elem* elem = plist->head.next;
	while(elem != &plist->tail) {
		if(elem == obj_elem) {
			return true;
		}
		elem = elem->next;
	}
	return false;
}

struct list_elem* list_traversal(struct list* plist, function func, int arg) {
	struct list_elem* elem = plist->head.next;
	if(list_empty(plist)) {
		return NULL;
	}
	while(elem != &plist->tail) {
		if(func(elem, arg)) {
			return elem;
		}
		elem = elem->next;
	}
	return NULL;
}

unsigned int list_len(struct list* plist) {
	struct list_elem* elem = plist->head.next;
	unsigned int length = 0;
	while(elem != &plist->tail) {
		length++;
		elem = elem->next;
	}
	return length;
}

bool list_empty(struct list* plist) {
	return (plist->head.next == &plist->tail ? true : false);
}