Rust OS

Created2025-11-05|Updated2025-11-05|OS

|Post Views:

Writing an Operating System in Rust, code can be found here: (https://github.com/Interstellarss/rcore-os). This project is a hands-on way to deepen my understanding of Rust and operating system internals. By building the kernel from scratch, I can explore approaches to limitations encountered in mainstream operating systems and experiment with ideas without the constraints of an established platform.

Some ideas I want to explore:

The materils I used:

Also, docs for Rosh: (https://os.puxuan.cc)

Author: Puxuan

Link: http://puxuan.cc/2025/11/05/rust/rust-os-1/

Copyright Notice: All articles on this blog are licensed under CC BY-NC-SA 4.0 unless otherwise stated.

Related Articles

(TEST) C++ 知识记录

整理日常使用 C++ 时的语法要点、标准库技巧与工程实践经验，便于快速查阅与复习。语言基础关键字速查表（constexpr、noexcept、concept 等）常见陷阱：窄化转换、悬垂引用、未定义行为初始化策略：聚合初始化、列表初始化与构造函数优先级现代 C++ 技法特性使用场景示例注意事项 std::optional 显式表达可空返回值 return std::nullopt; 避免在热路径频繁构造拷贝 std::ranges 管道式算法组合 views::filter + views::transform ranges 头文件包含与编译器支持协程 (co_await) 异步执行与生成器 task<int> 自定义调度器 & 生命周期管理模板：知识卡片12345### 主题：<概念 / API>- 摘要：核心定义或直观描述- 示例：代码片段，突出最佳实践- 细节：性能、异常安全、跨平台兼容性- TODO：需要进一步实验或补充的点调试与性能常用工具链：perf、valgrind、sanitize...

C++ write your own STL - List

在 MyList 里，我们定义了： 1node_ptr head_; 它不是存放用户数据的节点，而是一个特殊的空节点 —— 就叫 sentinel（哨兵）。它用来简化边界处理。传统链表在插入、删除时需要考虑很多“特殊情况”：如果在头部插入怎么办？如果在尾部删除怎么办？如果链表是空的怎么办？有了 sentinel，一切都变统一了 sentinel 的结构当链表为空时： 123456+---------+| head_ | |---------|| prev → |───┐| next → |───┘+---------+ 当链表有元素时，比如 [A, B, C]： 1head_ <-> A <-> B <-> C <-> head_ 也就是说： head_->next 指向第一个元素节点 head_->prev 指向最后一个元素节点 head_ 本身不存数据，仅作为“循环起点”使用 iterator for my list, should be bidiractional ite...

C++ write your own STL

My stl implementation code in c++ can be found here: my_stl 一、STL 六大组件体系组件说明示例 Allocators 内存分配器，管理对象生命周期 std::allocator Containers 容器，存储数据 vector, list, map Iterators 迭代器，统一访问接口 RandomAccessIterator, BidirectionalIterator Algorithms 泛型算法 sort, find, copy Adapters 容器适配器 stack, queue, priority_queue Functors / Traits 函数对象、类型萃取工具 less, iterator_traits 二、项目分层设计1️⃣ 基础层：类型萃取与工具 ccstl::type_traits: is_integral, remove_reference, enable_if ccstl::utility: move, forward, swap,...

C++ write your own STL - Vector

iterator for vector(对于ector来说， iterator可以直接复用基类的base iterator，因为迭代模式是随机访问的，并且vector的内存布局是连续的，所以vector的iterator可以复用base iterator)iterator之后就是my_vector具体实现。 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869// =========== vector iterator ===========template <typename T>class vector_iterator : public mystl::iterator<random_access_iterator_tag, T> {public: using iterator_type = T*; using iter...

C++ write your own STL - Algorithm

一个简单的算法模板库： 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155#ifndef MY_ALGORITHM_H#define MY_ALGORITHM_H#include "my_iterator.h"#include "my_utility.h"namespace mystl&#...

C++ write your own STL - Utility

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115#ifndef MY_UTILITY_H#define MY_UTILITY_Hnamespace mystl{// remove_referencetemplate <class T> struct remove_reference {using type = T;};template <class T> struct remove_reference<T&> {using type = T;};template <...