Compare commits

...

137 Commits

Author SHA1 Message Date
Philipp Oppermann
9258e04b7a Update to latest version 2020-07-07 11:22:06 +02:00
Philipp Oppermann
705435da8a Test for new idt::set_default_handler macro of x86_64 crate 2020-07-06 17:05:42 +02:00
Philipp Oppermann
991c3c863a Merge branch 'post-11' into post-12 2020-06-08 12:30:28 +02:00
Philipp Oppermann
bd4487cefa Merge branch 'post-10' into post-11 2020-06-08 12:30:28 +02:00
Philipp Oppermann
e68f7a1d31 Merge branch 'post-09' into post-10 2020-06-08 12:30:28 +02:00
Philipp Oppermann
832ab43bdd Merge branch 'post-08' into post-09 2020-06-08 12:30:28 +02:00
Philipp Oppermann
2a88224080 Merge branch 'post-07' into post-08 2020-06-08 12:30:28 +02:00
Philipp Oppermann
96a02c441e Merge branch 'post-06' into post-07 2020-06-08 12:30:28 +02:00
Philipp Oppermann
0dd32e2680 Merge pull request #818 from phil-opp/post-06-prevent-tail-recursion
Do a volatile read in stack_overflow test to avoid tail recursion
2020-06-08 12:29:58 +02:00
Philipp Oppermann
5735cb8ec0 Do a volatile read in stack_overflow test to avoid tail recursion
This prevents the compiler from transforming the tail recursive function into a loop, which does not lead to a stack overflow. It also avoids the LLVM bug where functions with side-effect-free endless loops are removed. Thus, the test now also works in `--release` mode.
2020-06-08 12:17:06 +02:00
Philipp Oppermann
ae504f6a61 Merge branch 'post-11' into post-12 2020-06-08 12:09:51 +02:00
Philipp Oppermann
cc8ecaadc2 Remove superfluous printing from many_boxes_long_lived test 2020-06-08 12:09:49 +02:00
Philipp Oppermann
07b4e93ec7 Merge branch 'post-11' into post-12 2020-06-08 12:09:01 +02:00
Philipp Oppermann
c66758ccad Merge branch 'post-10' into post-11 2020-06-08 12:09:01 +02:00
Philipp Oppermann
e7fd27b648 Remove superfluous printing from heap_allocation tests 2020-06-08 12:08:25 +02:00
Philipp Oppermann
0a97c2c97b Merge branch 'post-11' into post-12 2020-06-08 12:06:49 +02:00
Philipp Oppermann
cecab1a310 Merge branch 'post-08' into post-09 2020-06-08 12:06:37 +02:00
Philipp Oppermann
d26577ad86 Merge branch 'post-07' into post-08 2020-06-08 12:06:37 +02:00
Philipp Oppermann
f54a2d7574 Merge branch 'post-10' into post-11 2020-06-08 12:06:37 +02:00
Philipp Oppermann
9809ea57ae Merge branch 'post-09' into post-10 2020-06-08 12:06:37 +02:00
Philipp Oppermann
95612c1d3c Merge branch 'post-06' into post-07 2020-06-08 12:05:05 +02:00
Philipp Oppermann
12d94fd2e9 Adjust stack_overflow test print message 2020-06-08 12:01:04 +02:00
Philipp Oppermann
8c10bbb096 Merge branch 'post-05' into post-06 2020-06-08 11:57:12 +02:00
Philipp Oppermann
7846bd0559 Remove superfluous printing from test_breakpoint_exception 2020-06-08 11:55:24 +02:00
Philipp Oppermann
3ccc602e38 Merge branch 'post-04' into post-05 2020-06-08 11:53:01 +02:00
Philipp Oppermann
bf33685d00 Merge pull request #816 from phil-opp/post-04-testable-trait
Create a testable trait for printing test messages automatically
2020-06-08 11:50:57 +02:00
Philipp Oppermann
3ee6badb33 Keep trivial_assertion test 2020-06-08 11:39:09 +02:00
Philipp Oppermann
9f9ff59489 Create a testable trait for printing test messages automatically 2020-06-08 11:04:03 +02:00
Philipp Oppermann
c2790cf352 Merge branch 'post-11' into post-12 2020-06-05 15:52:04 +02:00
Philipp Oppermann
e6c4c63c00 Update post-11 code for #813 2020-06-05 15:52:01 +02:00
Philipp Oppermann
0e7a2dc6ae Merge branch 'post-11' into post-12 2020-05-22 10:54:54 +02:00
Philipp Oppermann
ed543a4591 Merge branch 'post-10' into post-11 2020-05-22 10:54:54 +02:00
Philipp Oppermann
b567d06108 Improve simple_allocation test
Proposed in https://github.com/phil-opp/blog_os/issues/627#issuecomment-632578270.
2020-05-22 10:54:49 +02:00
Philipp Oppermann
8b90c04c62 Merge branch 'post-08' into post-09 2020-05-21 09:29:56 +02:00
Philipp Oppermann
b9f5b43c04 Merge branch 'post-07' into post-08 2020-05-21 09:29:56 +02:00
Philipp Oppermann
080be9bca6 Merge branch 'post-11' into post-12 2020-05-21 09:29:56 +02:00
Philipp Oppermann
0d661fcfdd Merge branch 'post-10' into post-11 2020-05-21 09:29:56 +02:00
Philipp Oppermann
384902502c Merge branch 'post-09' into post-10 2020-05-21 09:29:56 +02:00
Philipp Oppermann
93b96f21ac Update pic8259_simple to v0.2.0 2020-05-21 09:29:49 +02:00
Philipp Oppermann
f9446883e2 Merge branch 'post-05' into post-06 2020-05-20 14:56:19 +02:00
Philipp Oppermann
735210fc8f Merge branch 'post-04' into post-05 2020-05-20 14:56:19 +02:00
Philipp Oppermann
5e510e41ee Merge branch 'post-08' into post-09 2020-05-20 14:56:19 +02:00
Philipp Oppermann
729c56d4ae Merge branch 'post-07' into post-08 2020-05-20 14:56:19 +02:00
Philipp Oppermann
0404ceb1af Merge branch 'post-11' into post-12 2020-05-20 14:56:19 +02:00
Philipp Oppermann
6f12524245 Merge branch 'post-10' into post-11 2020-05-20 14:56:19 +02:00
Philipp Oppermann
0db15e5ee5 Merge branch 'post-09' into post-10 2020-05-20 14:56:19 +02:00
Philipp Oppermann
22b49dea49 Merge branch 'post-06' into post-07 2020-05-20 14:56:19 +02:00
Philipp Oppermann
a1c7931a77 Run cargo update for post-04 2020-05-20 14:56:06 +02:00
Philipp Oppermann
60b5f3402e Merge branch 'post-11' into post-12 2020-05-20 14:31:12 +02:00
Philipp Oppermann
9828ec0eff Merge branch 'post-10' into post-11 2020-05-20 14:30:53 +02:00
Philipp Oppermann
44ab90f92d Update allocator code for x86_64 v0.11.0 2020-05-20 14:30:48 +02:00
Philipp Oppermann
7a5d91cb96 Merge branch 'post-09' into post-10 2020-05-20 14:29:43 +02:00
Philipp Oppermann
491889a237 Update paging code for x86_64 v0.11.0 2020-05-20 14:29:36 +02:00
Philipp Oppermann
a2f07828e4 Merge branch 'post-08' into post-09 2020-05-20 14:27:06 +02:00
Philipp Oppermann
8d5aade432 Merge branch 'post-07' into post-08 2020-05-20 14:26:48 +02:00
Philipp Oppermann
067f2c9b39 Merge branch 'post-06' into post-07 2020-05-20 14:26:29 +02:00
Philipp Oppermann
2bf84f60e9 Merge branch 'post-05' into post-06 2020-05-20 14:25:56 +02:00
Philipp Oppermann
0d506d5dd5 Merge branch 'post-04' into post-05 2020-05-20 14:25:23 +02:00
Philipp Oppermann
2c30310281 Update x86_64 to version 0.11.0 2020-05-20 14:25:16 +02:00
Philipp Oppermann
a076ff16ad Merge branch 'post-11' into post-12 2020-05-20 14:10:59 +02:00
Philipp Oppermann
d95da1d511 Merge branch 'post-10' into post-11 2020-05-20 14:10:17 +02:00
Philipp Oppermann
1eab81f58d Merge branch 'post-09' into post-10 2020-05-20 14:09:09 +02:00
Philipp Oppermann
d94b9513e7 Merge branch 'post-08' into post-09 2020-05-20 14:08:32 +02:00
Philipp Oppermann
50853609d1 Merge branch 'post-07' into post-08 2020-05-20 14:07:29 +02:00
Philipp Oppermann
122bc99766 Merge branch 'post-06' into post-07 2020-05-20 14:06:59 +02:00
Philipp Oppermann
bfed1f44e2 Merge branch 'post-05' into post-06 2020-05-20 14:06:06 +02:00
Philipp Oppermann
158873acd4 Merge branch 'post-04' into post-05 2020-05-20 14:05:29 +02:00
Philipp Oppermann
57cd52b7f5 Merge branch 'post-03' into post-04 2020-05-20 14:04:54 +02:00
Philipp Oppermann
a004e7da9c Merge branch 'post-02' into post-03 2020-05-20 14:04:37 +02:00
Philipp Oppermann
b1bf0873ce Update bootloader to v0.9.3 2020-05-20 14:03:59 +02:00
Philipp Oppermann
84c1070b0b Merge branch 'post-11' into post-12 2020-05-20 10:51:40 +02:00
Aaron Hill
7bfacb39c4 Remove #![feature(alloc_layout_extra)] (#806)
A subset of this feature was stabilized in https://github.com/rust-lang/rust/pull/69362,
and none of the still-unstable methods are in use in `blog_os`
2020-05-20 10:51:09 +02:00
Philipp Oppermann
f118749cb2 Merge pull request #804 from phil-opp/post-12-merge-queues
Simplify executor by merging task_queue and wake_queue
2020-05-19 14:32:51 +02:00
Philipp Oppermann
9887c1257d Keep task in map instead of repeatedly removing it
Also: Use entry API on waker_cache map.
2020-05-19 14:24:51 +02:00
Philipp Oppermann
ee0c11d316 Simplify executor by merging task_queue and wake_queue 2020-05-18 12:07:45 +02:00
Philipp Oppermann
b862534be5 Use a static counter for assigning task IDs (#782)
Deriving the task ID from the heap address of the future does not work for zero-sized futures because they are not backed by a real allocation.
2020-04-01 12:53:25 +02:00
Philipp Oppermann
e465c5b278 Put the CPU to sleep when no task is ready 2020-03-27 17:17:34 +01:00
Philipp Oppermann
50b4b89ac2 Implement an executor with waker support 2020-03-27 17:01:33 +01:00
Philipp Oppermann
d7b144364d Add an asynchronous print_keypresses task 2020-03-27 17:01:33 +01:00
Philipp Oppermann
d63ddde756 Add waker support to ScancodeStream 2020-03-27 17:01:33 +01:00
Philipp Oppermann
79dbd2968a Create a ScancodeStream based on the SCANCODE_QUEUE 2020-03-27 15:46:26 +01:00
Philipp Oppermann
b1be646e46 Add an add_scancode function and call it from keyboard interrupt handler 2020-03-27 13:25:43 +01:00
Philipp Oppermann
71b10a70df Add dependencies on crossbeam and conquer_once to define a SCANCODE_QUEUE 2020-03-27 13:16:05 +01:00
Philipp Oppermann
629fe0fdec Use SimpleExecutor in kernel_main to run example_task 2020-03-27 13:04:33 +01:00
Philipp Oppermann
b25b841467 Create a SimpleExecutor that polls tasks in a busy loop 2020-03-27 13:03:24 +01:00
Philipp Oppermann
dac7e67403 Add a task module with a Task struct 2020-03-27 12:55:40 +01:00
Philipp Oppermann
2cc188a403 Add some example async functions 2020-03-27 12:48:55 +01:00
Philipp Oppermann
fbeedde68f Update Readme for async/await post 2020-03-27 12:26:50 +01:00
Philipp Oppermann
3c28d7f364 Update README.md 2020-03-20 16:09:09 +01:00
Philipp Oppermann
02c36bae29 Merge branch 'post-09' into post-10 2020-03-08 14:39:38 +01:00
Philipp Oppermann
70deb3168e Merge branch 'post-08' into post-09 2020-03-08 14:39:38 +01:00
Philipp Oppermann
9d4a960bcb Merge branch 'post-07' into post-08 2020-03-08 14:39:38 +01:00
Philipp Oppermann
564ba9f9ac Merge branch 'post-06' into post-07 2020-03-08 14:39:38 +01:00
Philipp Oppermann
83b67df8af Merge branch 'post-10' into post-11 2020-03-08 14:39:38 +01:00
Philipp Oppermann
8a4f3ab2a8 Merge branch 'post-05' into post-06 2020-03-08 14:39:37 +01:00
Philipp Oppermann
e402af005b Merge branch 'post-04' into post-05 2020-03-08 14:39:37 +01:00
Philipp Oppermann
d7e505da9e Update x86_64 dependency to version 0.9.6 2020-03-08 14:39:27 +01:00
Philipp Oppermann
714d9cef7d Merge branch 'post-10' into post-11 2020-03-08 14:30:38 +01:00
Philipp Oppermann
7b0d8f05ba Fix code for x86_64 v0.9.5 update 2020-03-08 14:30:33 +01:00
Philipp Oppermann
3735ae51c9 Merge branch 'post-10' into post-11 2020-03-08 14:29:03 +01:00
Philipp Oppermann
f230ee4258 Merge branch 'post-09' into post-10 2020-03-08 14:29:00 +01:00
Philipp Oppermann
a5d409b777 Merge branch 'post-08' into post-09 2020-03-08 14:28:03 +01:00
Philipp Oppermann
33df0bb2a3 Merge branch 'post-07' into post-08 2020-03-08 14:28:03 +01:00
Philipp Oppermann
9a61e1724b Merge branch 'post-06' into post-07 2020-03-08 14:27:58 +01:00
Philipp Oppermann
dbe1353fd2 Merge branch 'post-05' into post-06 2020-03-08 14:27:42 +01:00
Philipp Oppermann
813bc41a74 Merge branch 'post-04' into post-05 2020-03-08 14:27:42 +01:00
Philipp Oppermann
2039cd7a64 Update x86_64 to version 0.9.5 2020-03-08 14:27:36 +01:00
Philipp Oppermann
a430d5ef06 Merge branch 'post-10' into post-11 2020-03-06 11:58:45 +01:00
Philipp Oppermann
39f14b6d0b Merge pull request #763 from phil-opp/post-10-update-linked-list-alloc
Update linked_list_allocator to v0.8.0
2020-03-06 11:58:23 +01:00
Philipp Oppermann
dd1daf2652 Update linked_list_allocator to v0.8.0 2020-03-06 11:47:49 +01:00
Philipp Oppermann
f4331daa25 Merge branch 'post-10' into post-11 2020-02-26 12:48:22 +01:00
Philipp Oppermann
9a415c85b9 Merge branch 'post-09' into post-10 2020-02-26 12:47:51 +01:00
Philipp Oppermann
79a0172ace Merge branch 'post-08' into post-09 2020-02-26 12:47:32 +01:00
Philipp Oppermann
9af6337f67 Merge branch 'post-07' into post-08 2020-02-26 12:47:23 +01:00
Philipp Oppermann
725e03b5c5 Merge branch 'post-06' into post-07 2020-02-26 12:47:07 +01:00
Philipp Oppermann
16afb268f8 Merge branch 'post-05' into post-06 2020-02-26 12:46:19 +01:00
Philipp Oppermann
5ef73aaa30 Merge branch 'post-04' into post-05 2020-02-26 12:46:09 +01:00
Philipp Oppermann
ebb862de2a Run cargo update for post-04 2020-02-26 12:46:04 +01:00
Philipp Oppermann
d588dca953 Merge branch 'post-03' into post-04 2020-02-26 12:45:45 +01:00
Philipp Oppermann
f23269ed93 Merge branch 'post-02' into post-03 2020-02-26 12:45:27 +01:00
Philipp Oppermann
46264d08ca Run cargo update 2020-02-26 12:43:51 +01:00
Philipp Oppermann
921dd54207 Merge branch 'post-10' into post-11 2020-02-26 12:22:10 +01:00
Philipp Oppermann
c7cc718ae3 Merge branch 'post-09' into post-10 2020-02-26 12:22:06 +01:00
Philipp Oppermann
8fc746555d Merge branch 'post-08' into post-09 2020-02-26 12:21:28 +01:00
Philipp Oppermann
9324ea45a5 Merge branch 'post-07' into post-08 2020-02-26 12:21:28 +01:00
Philipp Oppermann
d35ab51629 Merge pull request #756 from RKennedy9064/post-07
Updated pc-keyboard to `0.5.0`
2020-02-26 12:18:13 +01:00
Ryan Kennedy
de509e058f Switched to HandleControl::Ignore 2020-02-25 10:32:39 -06:00
Ryan Kennedy
2a8f499f73 Might help if I use cargo fmt 2020-02-22 19:02:57 -06:00
Ryan Kennedy
2634bb2d37 Updated pc-keyboard to 0.5.0 2020-02-22 18:55:21 -06:00
Philipp Oppermann
3a6d3153a4 Don't panic on overflow in allocator; return null pointer instead (#738) 2020-02-04 09:47:39 +01:00
Philipp Oppermann
9fb6c1d0bd Merge branch 'post-10' into post-11 2020-02-04 09:39:02 +01:00
Philipp Oppermann
5ed04baab0 Update linked_list_allocator dependency 2020-02-04 09:38:52 +01:00
Philipp Oppermann
00fedc801e Use LinkedListAllocator::lock instead of self.inner.lock() 2020-01-30 13:03:34 +01:00
Philipp Oppermann
0f74db4812 Implement align_up using align_offset from Rust's standard library (#723)
Improve `align_up` performance using a bitmask
2020-01-28 10:39:14 +01:00
Philipp Oppermann
93fd330ab9 Use bitmask instead of align_offset 2020-01-28 10:29:53 +01:00
Philipp Oppermann
3ad5f117c2 Use checked addition for allocator implementations (#726) 2020-01-27 13:25:08 +01:00
Philipp Oppermann
d1678f5a96 Implement align_up using align_offset from Rust's standard library 2020-01-22 11:35:29 +01:00
19 changed files with 519 additions and 170 deletions

195
Cargo.lock generated
View File

@@ -1,13 +1,10 @@
# This file is automatically @generated by Cargo.
# It is not intended for manual editing.
[[package]]
name = "array-init"
version = "0.0.4"
name = "autocfg"
version = "1.0.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "23589ecb866b460d3a0f1278834750268c607e8e28a1b982c907219f3178cd72"
dependencies = [
"nodrop",
]
checksum = "f8aac770f1885fd7e387acedd76065302551364496e46b3dd00860b2f8359b9d"
[[package]]
name = "bit_field"
@@ -26,6 +23,9 @@ name = "blog_os"
version = "0.1.0"
dependencies = [
"bootloader",
"conquer-once",
"crossbeam-queue",
"futures-util",
"lazy_static",
"linked_list_allocator",
"pc-keyboard",
@@ -33,29 +33,84 @@ dependencies = [
"spin",
"uart_16550",
"volatile",
"x86_64 0.8.1",
"x86_64 0.11.1",
]
[[package]]
name = "bootloader"
version = "0.8.3"
version = "0.9.3"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "d596849a47f28abdea62d7a6a25c4f6e69c3d9b09b0a2877db6e9cda004ca993"
checksum = "44ac0bdf4930c3c4d7f0d04eb6f15d7dcb9d5972b1ff9cd2bee0128112260fc7"
[[package]]
name = "cast"
version = "0.2.3"
name = "cfg-if"
version = "0.1.10"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "4b9434b9a5aa1450faa3f9cb14ea0e8c53bb5d2b3c1bfd1ab4fc03e9f33fbfb0"
checksum = "4785bdd1c96b2a846b2bd7cc02e86b6b3dbf14e7e53446c4f54c92a361040822"
[[package]]
name = "conquer-once"
version = "0.2.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "6f7644600a548ecad74e4a918392af1798f7dd045be610be3203b9e129b4f98f"
dependencies = [
"rustc_version",
"conquer-util",
]
[[package]]
name = "cpuio"
name = "conquer-util"
version = "0.2.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "22b8e308ccfc5acf3b82f79c0eac444cf6114cb2ac67a230ca6c177210068daa"
checksum = "654fb2472cc369d311c547103a1fa81d467bef370ae7a0680f65939895b1182a"
[[package]]
name = "cpuio"
version = "0.3.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "d531514efb06912141fa65967447de805691b685a7565c87d1765afe34a98aa7"
[[package]]
name = "crossbeam-queue"
version = "0.2.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "c695eeca1e7173472a32221542ae469b3e9aac3a4fc81f7696bcad82029493db"
dependencies = [
"cfg-if",
"crossbeam-utils",
]
[[package]]
name = "crossbeam-utils"
version = "0.7.2"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "c3c7c73a2d1e9fc0886a08b93e98eb643461230d5f1925e4036204d5f2e261a8"
dependencies = [
"autocfg",
"cfg-if",
]
[[package]]
name = "futures-core"
version = "0.3.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "f25592f769825e89b92358db00d26f965761e094951ac44d3663ef25b7ac464a"
[[package]]
name = "futures-task"
version = "0.3.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "7b0a34e53cf6cdcd0178aa573aed466b646eb3db769570841fda0c7ede375a27"
[[package]]
name = "futures-util"
version = "0.3.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "22766cf25d64306bedf0384da004d05c9974ab104fcc4528f1236181c18004c5"
dependencies = [
"futures-core",
"futures-task",
"pin-utils",
]
[[package]]
name = "lazy_static"
@@ -68,57 +123,66 @@ dependencies = [
[[package]]
name = "linked_list_allocator"
version = "0.6.4"
version = "0.8.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "47314ec1d29aa869ee7cb5a5be57be9b1055c56567d59c3fb6689926743e0bea"
checksum = "18c618c431dfe4419afbe22852f6aceffbc17bd82ba0a18b982def291000824c"
dependencies = [
"spin",
"spinning_top",
]
[[package]]
name = "nodrop"
version = "0.1.14"
name = "lock_api"
version = "0.3.3"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "72ef4a56884ca558e5ddb05a1d1e7e1bfd9a68d9ed024c21704cc98872dae1bb"
checksum = "79b2de95ecb4691949fea4716ca53cdbcfccb2c612e19644a8bad05edcf9f47b"
dependencies = [
"scopeguard",
]
[[package]]
name = "pc-keyboard"
version = "0.3.1"
version = "0.5.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "fff50ab09ba31bcebc0669f4e64c0952fae1acdca9e6e0587e68e4e8443808ac"
checksum = "c48392db76c4e9a69e0b3be356c5f97ebb7b14413c5e4fd0af4755dbf86e2fce"
[[package]]
name = "pic8259_simple"
version = "0.1.1"
version = "0.2.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "dc64b2fd10828da8521b6cdabe0679385d7d2a3a6d4c336b819d1fa31ba35c72"
checksum = "af2a5497fb8e59bf8015f67b7dff238d75ef445e03f23edac24ac3a8f09be952"
dependencies = [
"cpuio",
]
[[package]]
name = "rustc_version"
version = "0.2.3"
name = "pin-utils"
version = "0.1.0-alpha.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "138e3e0acb6c9fb258b19b67cb8abd63c00679d2851805ea151465464fe9030a"
checksum = "5894c618ce612a3fa23881b152b608bafb8c56cfc22f434a3ba3120b40f7b587"
[[package]]
name = "proc-macro2"
version = "1.0.18"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "beae6331a816b1f65d04c45b078fd8e6c93e8071771f41b8163255bbd8d7c8fa"
dependencies = [
"semver",
"unicode-xid",
]
[[package]]
name = "semver"
version = "0.9.0"
name = "quote"
version = "1.0.7"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "1d7eb9ef2c18661902cc47e535f9bc51b78acd254da71d375c2f6720d9a40403"
checksum = "aa563d17ecb180e500da1cfd2b028310ac758de548efdd203e18f283af693f37"
dependencies = [
"semver-parser",
"proc-macro2",
]
[[package]]
name = "semver-parser"
version = "0.7.0"
name = "scopeguard"
version = "1.1.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "388a1df253eca08550bef6c72392cfe7c30914bf41df5269b68cbd6ff8f570a3"
checksum = "d29ab0c6d3fc0ee92fe66e2d99f700eab17a8d57d1c1d3b748380fb20baa78cd"
[[package]]
name = "spin"
@@ -127,20 +191,40 @@ source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "6e63cff320ae2c57904679ba7cb63280a3dc4613885beafb148ee7bf9aa9042d"
[[package]]
name = "uart_16550"
version = "0.2.1"
name = "spinning_top"
version = "0.1.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "803ea8cb602dbb32c1a657a866d2dd79fe7dbeab0fb2ac667cb4dcc7de12a58b"
checksum = "32d801a3a53bcf5071f85fef8d5cab9e5f638fc5580a37e6eb7aba4b37438d24"
dependencies = [
"bitflags",
"x86_64 0.7.7",
"lock_api",
]
[[package]]
name = "ux"
version = "0.1.3"
name = "syn"
version = "1.0.33"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "88dfeb711b61ce620c0cb6fd9f8e3e678622f0c971da2a63c4b3e25e88ed012f"
checksum = "e8d5d96e8cbb005d6959f119f773bfaebb5684296108fb32600c00cde305b2cd"
dependencies = [
"proc-macro2",
"quote",
"unicode-xid",
]
[[package]]
name = "uart_16550"
version = "0.2.7"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "e58fc40dc1712664fc9b0a7bd8ca2f21ab49960924fb245a80a05e1e92f3dfe9"
dependencies = [
"bitflags",
"x86_64 0.11.0",
]
[[package]]
name = "unicode-xid"
version = "0.2.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "f7fe0bb3479651439c9112f72b6c505038574c9fbb575ed1bf3b797fa39dd564"
[[package]]
name = "volatile"
@@ -150,25 +234,28 @@ checksum = "6af0edf5b4faacc31fc51159244d78d65ec580f021afcef7bd53c04aeabc7f29"
[[package]]
name = "x86_64"
version = "0.7.7"
version = "0.11.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "1f27d9168654aee1b0c1b73746caeb4aa33248f8b8c8f6e100e697fcc2a794b2"
checksum = "365de37eb7c6da582cbb510dd0f3f1235d24ff6309a8a96e8a9909cc9bfd608f"
dependencies = [
"array-init",
"bit_field",
"bitflags",
"cast",
"ux",
]
[[package]]
name = "x86_64"
version = "0.8.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "f21672dcbed52bc09eea030d189600c0189c66c97bc5b31779eb780e064a201f"
version = "0.11.1"
dependencies = [
"array-init",
"bit_field",
"bitflags",
"cast",
"x86_64-idt-general-handler",
]
[[package]]
name = "x86_64-idt-general-handler"
version = "0.1.0"
dependencies = [
"proc-macro2",
"quote",
"syn",
]

View File

@@ -13,19 +13,32 @@ name = "stack_overflow"
harness = false
[dependencies]
bootloader = { version = "0.8.0", features = ["map_physical_memory"]}
bootloader = { version = "0.9.3", features = ["map_physical_memory"]}
volatile = "0.2.6"
spin = "0.5.2"
x86_64 = "0.8.1"
x86_64 = { path = "../../x86_64" }
uart_16550 = "0.2.0"
pic8259_simple = "0.1.1"
pc-keyboard = "0.3.1"
linked_list_allocator = "0.6.4"
pic8259_simple = "0.2.0"
pc-keyboard = "0.5.0"
linked_list_allocator = "0.8.0"
[dependencies.lazy_static]
version = "1.0"
features = ["spin_no_std"]
[dependencies.crossbeam-queue]
version = "0.2.1"
default-features = false
features = ["alloc"]
[dependencies.conquer-once]
version = "0.2.0"
default-features = false
[dependencies.futures-util]
version = "0.3.4"
default-features = false
features = ["alloc"]
[package.metadata.bootimage]
test-args = [

View File

@@ -1,10 +1,10 @@
# Blog OS (Heap Allocation)
# Blog OS (Async/Await)
[![Build Status](https://github.com/phil-opp/blog_os/workflows/Build%20Code/badge.svg?branch=post-10)](https://github.com/phil-opp/blog_os/actions?query=workflow%3A%22Build+Code%22+branch%3Apost-10)
[![Build Status](https://github.com/phil-opp/blog_os/workflows/Build%20Code/badge.svg?branch=post-12)](https://github.com/phil-opp/blog_os/actions?query=workflow%3A%22Build+Code%22+branch%3Apost-12)
This repository contains the source code for the [Heap Allocation][post] post of the [Writing an OS in Rust](https://os.phil-opp.com) series.
This repository contains the source code for the [Async/Await][post] post of the [Writing an OS in Rust](https://os.phil-opp.com) series.
[post]: https://os.phil-opp.com/heap-allocation/
[post]: https://os.phil-opp.com/async-await/
**Check out the [master branch](https://github.com/phil-opp/blog_os) for more information.**

View File

@@ -21,7 +21,7 @@ static ALLOCATOR: Locked<FixedSizeBlockAllocator> = Locked::new(FixedSizeBlockAl
pub fn init_heap(
mapper: &mut impl Mapper<Size4KiB>,
frame_allocator: &mut impl FrameAllocator<Size4KiB>,
) -> Result<(), MapToError> {
) -> Result<(), MapToError<Size4KiB>> {
let page_range = {
let heap_start = VirtAddr::new(HEAP_START as u64);
let heap_end = heap_start + HEAP_SIZE - 1u64;
@@ -35,7 +35,7 @@ pub fn init_heap(
.allocate_frame()
.ok_or(MapToError::FrameAllocationFailed)?;
let flags = PageTableFlags::PRESENT | PageTableFlags::WRITABLE;
mapper.map_to(page, frame, flags, frame_allocator)?.flush();
unsafe { mapper.map_to(page, frame, flags, frame_allocator)?.flush() };
}
unsafe {
@@ -74,11 +74,9 @@ impl<A> Locked<A> {
}
}
/// Align the given address `addr` upwards to alignment `align`.
///
/// Requires that `align` is a power of two.
fn align_up(addr: usize, align: usize) -> usize {
let remainder = addr % align;
if remainder == 0 {
addr // addr already aligned
} else {
addr - remainder + align
}
(addr + align - 1) & !(align - 1)
}

View File

@@ -26,7 +26,7 @@ impl BumpAllocator {
/// memory range is unused. Also, this method must be called only once.
pub unsafe fn init(&mut self, heap_start: usize, heap_size: usize) {
self.heap_start = heap_start;
self.heap_end = heap_start + heap_size;
self.heap_end = heap_start.saturating_add(heap_size);
self.next = heap_start;
}
}
@@ -36,7 +36,10 @@ unsafe impl GlobalAlloc for Locked<BumpAllocator> {
let mut bump = self.lock(); // get a mutable reference
let alloc_start = align_up(bump.next, layout.align());
let alloc_end = alloc_start + layout.size();
let alloc_end = match alloc_start.checked_add(layout.size()) {
Some(end) => end,
None => return ptr::null_mut(),
};
if alloc_end > bump.heap_end {
ptr::null_mut() // out of memory

View File

@@ -45,7 +45,7 @@ impl LinkedListAllocator {
/// Adds the given memory region to the front of the list.
unsafe fn add_free_region(&mut self, addr: usize, size: usize) {
// ensure that the freed region is capable of holding ListNode
assert!(align_up(addr, mem::align_of::<ListNode>()) == addr);
assert_eq!(align_up(addr, mem::align_of::<ListNode>()), addr);
assert!(size >= mem::size_of::<ListNode>());
// create a new list node and append it at the start of the list
@@ -86,7 +86,7 @@ impl LinkedListAllocator {
/// Returns the allocation start address on success.
fn alloc_from_region(region: &ListNode, size: usize, align: usize) -> Result<usize, ()> {
let alloc_start = align_up(region.start_addr(), align);
let alloc_end = alloc_start + size;
let alloc_end = alloc_start.checked_add(size).ok_or(())?;
if alloc_end > region.end_addr() {
// region too small
@@ -122,10 +122,10 @@ unsafe impl GlobalAlloc for Locked<LinkedListAllocator> {
unsafe fn alloc(&self, layout: Layout) -> *mut u8 {
// perform layout adjustments
let (size, align) = LinkedListAllocator::size_align(layout);
let mut allocator = self.inner.lock();
let mut allocator = self.lock();
if let Some((region, alloc_start)) = allocator.find_region(size, align) {
let alloc_end = alloc_start + size;
let alloc_end = alloc_start.checked_add(size).expect("overflow");
let excess_size = region.end_addr() - alloc_end;
if excess_size > 0 {
allocator.add_free_region(alloc_end, excess_size);
@@ -140,6 +140,6 @@ unsafe impl GlobalAlloc for Locked<LinkedListAllocator> {
// perform layout adjustments
let (size, _) = LinkedListAllocator::size_align(layout);
self.inner.lock().add_free_region(ptr as usize, size)
self.lock().add_free_region(ptr as usize, size)
}
}

View File

@@ -2,7 +2,9 @@ use crate::{gdt, hlt_loop, print, println};
use lazy_static::lazy_static;
use pic8259_simple::ChainedPics;
use spin;
use x86_64::structures::idt::{InterruptDescriptorTable, InterruptStackFrame, PageFaultErrorCode};
use x86_64::structures::idt::{
self, InterruptDescriptorTable, InterruptStackFrame, PageFaultErrorCode,
};
pub const PIC_1_OFFSET: u8 = 32;
pub const PIC_2_OFFSET: u8 = PIC_1_OFFSET + 8;
@@ -30,6 +32,8 @@ pub static PICS: spin::Mutex<ChainedPics> =
lazy_static! {
static ref IDT: InterruptDescriptorTable = {
let mut idt = InterruptDescriptorTable::new();
idt::set_general_handler!(&mut idt, default_handler);
idt.breakpoint.set_handler_fn(breakpoint_handler);
idt.page_fault.set_handler_fn(page_fault_handler);
unsafe {
@@ -37,8 +41,6 @@ lazy_static! {
.set_handler_fn(double_fault_handler)
.set_stack_index(gdt::DOUBLE_FAULT_IST_INDEX);
}
idt[InterruptIndex::Timer.as_usize()].set_handler_fn(timer_interrupt_handler);
idt[InterruptIndex::Keyboard.as_usize()].set_handler_fn(keyboard_interrupt_handler);
idt
};
}
@@ -47,6 +49,18 @@ pub fn init_idt() {
IDT.load();
}
fn default_handler(stack_frame: &mut InterruptStackFrame, index: u8, error_code: Option<u64>) {
if index == 32 {
print!("{} ", index);
} else {
println!("INTERRUPT {}: \n{:#?}", index, stack_frame);
}
unsafe {
PICS.lock().notify_end_of_interrupt(index);
}
}
extern "x86-interrupt" fn breakpoint_handler(stack_frame: &mut InterruptStackFrame) {
println!("EXCEPTION: BREAKPOINT\n{:#?}", stack_frame);
}
@@ -80,27 +94,11 @@ extern "x86-interrupt" fn timer_interrupt_handler(_stack_frame: &mut InterruptSt
}
extern "x86-interrupt" fn keyboard_interrupt_handler(_stack_frame: &mut InterruptStackFrame) {
use pc_keyboard::{layouts, DecodedKey, Keyboard, ScancodeSet1};
use spin::Mutex;
use x86_64::instructions::port::Port;
lazy_static! {
static ref KEYBOARD: Mutex<Keyboard<layouts::Us104Key, ScancodeSet1>> =
Mutex::new(Keyboard::new(layouts::Us104Key, ScancodeSet1));
}
let mut keyboard = KEYBOARD.lock();
let mut port = Port::new(0x60);
let scancode: u8 = unsafe { port.read() };
if let Ok(Some(key_event)) = keyboard.add_byte(scancode) {
if let Some(key) = keyboard.process_keyevent(key_event) {
match key {
DecodedKey::Unicode(character) => print!("{}", character),
DecodedKey::RawKey(key) => print!("{:?}", key),
}
}
}
crate::task::keyboard::add_scancode(scancode);
unsafe {
PICS.lock()
@@ -108,13 +106,8 @@ extern "x86-interrupt" fn keyboard_interrupt_handler(_stack_frame: &mut Interrup
}
}
#[cfg(test)]
use crate::{serial_print, serial_println};
#[test_case]
fn test_breakpoint_exception() {
serial_print!("test_breakpoint_exception...");
// invoke a breakpoint exception
x86_64::instructions::interrupts::int3();
serial_println!("[ok]");
}

View File

@@ -4,8 +4,8 @@
#![feature(abi_x86_interrupt)]
#![feature(alloc_error_handler)]
#![feature(const_fn)]
#![feature(alloc_layout_extra)]
#![feature(const_in_array_repeat_expressions)]
#![feature(wake_trait)]
#![test_runner(crate::test_runner)]
#![reexport_test_harness_main = "test_main"]
@@ -18,6 +18,7 @@ pub mod gdt;
pub mod interrupts;
pub mod memory;
pub mod serial;
pub mod task;
pub mod vga_buffer;
pub fn init() {
@@ -26,11 +27,25 @@ pub fn init() {
unsafe { interrupts::PICS.lock().initialize() };
x86_64::instructions::interrupts::enable();
}
pub trait Testable {
fn run(&self) -> ();
}
pub fn test_runner(tests: &[&dyn Fn()]) {
impl<T> Testable for T
where
T: Fn(),
{
fn run(&self) {
serial_print!("{}...\t", core::any::type_name::<T>());
self();
serial_println!("[ok]");
}
}
pub fn test_runner(tests: &[&dyn Testable]) {
serial_println!("Running {} tests", tests.len());
for test in tests {
test();
test.run();
}
exit_qemu(QemuExitCode::Success);
}

View File

@@ -6,8 +6,8 @@
extern crate alloc;
use alloc::{boxed::Box, rc::Rc, vec, vec::Vec};
use blog_os::println;
use blog_os::task::{executor::Executor, keyboard, Task};
use bootloader::{entry_point, BootInfo};
use core::panic::PanicInfo;
@@ -27,35 +27,13 @@ fn kernel_main(boot_info: &'static BootInfo) -> ! {
allocator::init_heap(&mut mapper, &mut frame_allocator).expect("heap initialization failed");
// allocate a number on the heap
let heap_value = Box::new(41);
println!("heap_value at {:p}", heap_value);
// create a dynamically sized vector
let mut vec = Vec::new();
for i in 0..500 {
vec.push(i);
}
println!("vec at {:p}", vec.as_slice());
// create a reference counted vector -> will be freed when count reaches 0
let reference_counted = Rc::new(vec![1, 2, 3]);
let cloned_reference = reference_counted.clone();
println!(
"current reference count is {}",
Rc::strong_count(&cloned_reference)
);
core::mem::drop(reference_counted);
println!(
"reference count is {} now",
Rc::strong_count(&cloned_reference)
);
#[cfg(test)]
test_main();
println!("It did not crash!");
blog_os::hlt_loop();
let mut executor = Executor::new();
executor.spawn(Task::new(example_task()));
executor.spawn(Task::new(keyboard::print_keypresses()));
executor.run();
}
/// This function is called on panic.
@@ -71,3 +49,17 @@ fn panic(info: &PanicInfo) -> ! {
fn panic(info: &PanicInfo) -> ! {
blog_os::test_panic_handler(info)
}
async fn async_number() -> u32 {
42
}
async fn example_task() {
let number = async_number().await;
println!("async number: {}", number);
}
#[test_case]
fn trivial_assertion() {
assert_eq!(1, 1);
}

View File

@@ -2,7 +2,6 @@ use bootloader::bootinfo::{MemoryMap, MemoryRegionType};
use x86_64::{
structures::paging::{
FrameAllocator, Mapper, OffsetPageTable, Page, PageTable, PhysFrame, Size4KiB,
UnusedPhysFrame,
},
PhysAddr, VirtAddr,
};
@@ -45,11 +44,12 @@ pub fn create_example_mapping(
use x86_64::structures::paging::PageTableFlags as Flags;
let frame = PhysFrame::containing_address(PhysAddr::new(0xb8000));
// FIXME: ONLY FOR TEMPORARY TESTING
let unused_frame = unsafe { UnusedPhysFrame::new(frame) };
let flags = Flags::PRESENT | Flags::WRITABLE;
let map_to_result = mapper.map_to(page, unused_frame, flags, frame_allocator);
let map_to_result = unsafe {
// FIXME: this is not safe, we do it only for testing
mapper.map_to(page, frame, flags, frame_allocator)
};
map_to_result.expect("map_to failed").flush();
}
@@ -57,7 +57,7 @@ pub fn create_example_mapping(
pub struct EmptyFrameAllocator;
unsafe impl FrameAllocator<Size4KiB> for EmptyFrameAllocator {
fn allocate_frame(&mut self) -> Option<UnusedPhysFrame> {
fn allocate_frame(&mut self) -> Option<PhysFrame> {
None
}
}
@@ -82,7 +82,7 @@ impl BootInfoFrameAllocator {
}
/// Returns an iterator over the usable frames specified in the memory map.
fn usable_frames(&self) -> impl Iterator<Item = UnusedPhysFrame> {
fn usable_frames(&self) -> impl Iterator<Item = PhysFrame> {
// get usable regions from memory map
let regions = self.memory_map.iter();
let usable_regions = regions.filter(|r| r.region_type == MemoryRegionType::Usable);
@@ -91,14 +91,12 @@ impl BootInfoFrameAllocator {
// transform to an iterator of frame start addresses
let frame_addresses = addr_ranges.flat_map(|r| r.step_by(4096));
// create `PhysFrame` types from the start addresses
let frames = frame_addresses.map(|addr| PhysFrame::containing_address(PhysAddr::new(addr)));
// we know that the frames are really unused
frames.map(|f| unsafe { UnusedPhysFrame::new(f) })
frame_addresses.map(|addr| PhysFrame::containing_address(PhysAddr::new(addr)))
}
}
unsafe impl FrameAllocator<Size4KiB> for BootInfoFrameAllocator {
fn allocate_frame(&mut self) -> Option<UnusedPhysFrame> {
fn allocate_frame(&mut self) -> Option<PhysFrame> {
let frame = self.usable_frames().nth(self.next);
self.next += 1;
frame

102
src/task/executor.rs Normal file
View File

@@ -0,0 +1,102 @@
use super::{Task, TaskId};
use alloc::{collections::BTreeMap, sync::Arc, task::Wake};
use core::task::{Context, Poll, Waker};
use crossbeam_queue::ArrayQueue;
pub struct Executor {
tasks: BTreeMap<TaskId, Task>,
task_queue: Arc<ArrayQueue<TaskId>>,
waker_cache: BTreeMap<TaskId, Waker>,
}
impl Executor {
pub fn new() -> Self {
Executor {
tasks: BTreeMap::new(),
task_queue: Arc::new(ArrayQueue::new(100)),
waker_cache: BTreeMap::new(),
}
}
pub fn spawn(&mut self, task: Task) {
let task_id = task.id;
if self.tasks.insert(task.id, task).is_some() {
panic!("task with same ID already in tasks");
}
self.task_queue.push(task_id).expect("queue full");
}
pub fn run(&mut self) -> ! {
loop {
self.run_ready_tasks();
self.sleep_if_idle();
}
}
fn run_ready_tasks(&mut self) {
// destructure `self` to avoid borrow checker errors
let Self {
tasks,
task_queue,
waker_cache,
} = self;
while let Ok(task_id) = task_queue.pop() {
let task = match tasks.get_mut(&task_id) {
Some(task) => task,
None => continue, // task no longer exists
};
let waker = waker_cache
.entry(task_id)
.or_insert_with(|| TaskWaker::new(task_id, task_queue.clone()));
let mut context = Context::from_waker(waker);
match task.poll(&mut context) {
Poll::Ready(()) => {
// task done -> remove it and its cached waker
tasks.remove(&task_id);
waker_cache.remove(&task_id);
}
Poll::Pending => {}
}
}
}
fn sleep_if_idle(&self) {
use x86_64::instructions::interrupts::{self, enable_interrupts_and_hlt};
interrupts::disable();
if self.task_queue.is_empty() {
enable_interrupts_and_hlt();
} else {
interrupts::enable();
}
}
}
struct TaskWaker {
task_id: TaskId,
task_queue: Arc<ArrayQueue<TaskId>>,
}
impl TaskWaker {
fn new(task_id: TaskId, task_queue: Arc<ArrayQueue<TaskId>>) -> Waker {
Waker::from(Arc::new(TaskWaker {
task_id,
task_queue,
}))
}
fn wake_task(&self) {
self.task_queue.push(self.task_id).expect("task_queue full");
}
}
impl Wake for TaskWaker {
fn wake(self: Arc<Self>) {
self.wake_task();
}
fn wake_by_ref(self: &Arc<Self>) {
self.wake_task();
}
}

83
src/task/keyboard.rs Normal file
View File

@@ -0,0 +1,83 @@
use crate::{print, println};
use conquer_once::spin::OnceCell;
use core::{
pin::Pin,
task::{Context, Poll},
};
use crossbeam_queue::ArrayQueue;
use futures_util::{
stream::{Stream, StreamExt},
task::AtomicWaker,
};
use pc_keyboard::{layouts, DecodedKey, HandleControl, Keyboard, ScancodeSet1};
static SCANCODE_QUEUE: OnceCell<ArrayQueue<u8>> = OnceCell::uninit();
static WAKER: AtomicWaker = AtomicWaker::new();
/// Called by the keyboard interrupt handler
///
/// Must not block or allocate.
pub(crate) fn add_scancode(scancode: u8) {
if let Ok(queue) = SCANCODE_QUEUE.try_get() {
if let Err(_) = queue.push(scancode) {
println!("WARNING: scancode queue full; dropping keyboard input");
} else {
WAKER.wake();
}
} else {
println!("WARNING: scancode queue uninitialized");
}
}
pub struct ScancodeStream {
_private: (),
}
impl ScancodeStream {
pub fn new() -> Self {
SCANCODE_QUEUE
.try_init_once(|| ArrayQueue::new(100))
.expect("ScancodeStream::new should only be called once");
ScancodeStream { _private: () }
}
}
impl Stream for ScancodeStream {
type Item = u8;
fn poll_next(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<u8>> {
let queue = SCANCODE_QUEUE
.try_get()
.expect("scancode queue not initialized");
// fast path
if let Ok(scancode) = queue.pop() {
return Poll::Ready(Some(scancode));
}
WAKER.register(&cx.waker());
match queue.pop() {
Ok(scancode) => {
WAKER.take();
Poll::Ready(Some(scancode))
}
Err(crossbeam_queue::PopError) => Poll::Pending,
}
}
}
pub async fn print_keypresses() {
let mut scancodes = ScancodeStream::new();
let mut keyboard = Keyboard::new(layouts::Us104Key, ScancodeSet1, HandleControl::Ignore);
while let Some(scancode) = scancodes.next().await {
if let Ok(Some(key_event)) = keyboard.add_byte(scancode) {
if let Some(key) = keyboard.process_keyevent(key_event) {
match key {
DecodedKey::Unicode(character) => print!("{}", character),
DecodedKey::RawKey(key) => print!("{:?}", key),
}
}
}
}
}

39
src/task/mod.rs Normal file
View File

@@ -0,0 +1,39 @@
use alloc::boxed::Box;
use core::{
future::Future,
pin::Pin,
sync::atomic::{AtomicU64, Ordering},
task::{Context, Poll},
};
pub mod executor;
pub mod keyboard;
pub mod simple_executor;
pub struct Task {
id: TaskId,
future: Pin<Box<dyn Future<Output = ()>>>,
}
impl Task {
pub fn new(future: impl Future<Output = ()> + 'static) -> Task {
Task {
id: TaskId::new(),
future: Box::pin(future),
}
}
fn poll(&mut self, context: &mut Context) -> Poll<()> {
self.future.as_mut().poll(context)
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
struct TaskId(u64);
impl TaskId {
fn new() -> Self {
static NEXT_ID: AtomicU64 = AtomicU64::new(0);
TaskId(NEXT_ID.fetch_add(1, Ordering::Relaxed))
}
}

View File

@@ -0,0 +1,44 @@
use super::Task;
use alloc::collections::VecDeque;
use core::task::{Context, Poll, RawWaker, RawWakerVTable, Waker};
pub struct SimpleExecutor {
task_queue: VecDeque<Task>,
}
impl SimpleExecutor {
pub fn new() -> SimpleExecutor {
SimpleExecutor {
task_queue: VecDeque::new(),
}
}
pub fn spawn(&mut self, task: Task) {
self.task_queue.push_back(task)
}
pub fn run(&mut self) {
while let Some(mut task) = self.task_queue.pop_front() {
let waker = dummy_waker();
let mut context = Context::from_waker(&waker);
match task.poll(&mut context) {
Poll::Ready(()) => {} // task done
Poll::Pending => self.task_queue.push_back(task),
}
}
}
}
fn dummy_raw_waker() -> RawWaker {
fn no_op(_: *const ()) {}
fn clone(_: *const ()) -> RawWaker {
dummy_raw_waker()
}
let vtable = &RawWakerVTable::new(clone, no_op, no_op, no_op);
RawWaker::new(0 as *const (), vtable)
}
fn dummy_waker() -> Waker {
unsafe { Waker::from_raw(dummy_raw_waker()) }
}

View File

@@ -3,9 +3,6 @@ use lazy_static::lazy_static;
use spin::Mutex;
use volatile::Volatile;
#[cfg(test)]
use crate::{serial_print, serial_println};
lazy_static! {
/// A global `Writer` instance that can be used for printing to the VGA text buffer.
///
@@ -180,18 +177,14 @@ pub fn _print(args: fmt::Arguments) {
#[test_case]
fn test_println_simple() {
serial_print!("test_println... ");
println!("test_println_simple output");
serial_println!("[ok]");
}
#[test_case]
fn test_println_many() {
serial_print!("test_println_many... ");
for _ in 0..200 {
println!("test_println_many output");
}
serial_println!("[ok]");
}
#[test_case]
@@ -199,8 +192,6 @@ fn test_println_output() {
use core::fmt::Write;
use x86_64::instructions::interrupts;
serial_print!("test_println_output... ");
let s = "Some test string that fits on a single line";
interrupts::without_interrupts(|| {
let mut writer = WRITER.lock();
@@ -210,6 +201,4 @@ fn test_println_output() {
assert_eq!(char::from(screen_char.ascii_character), c);
}
});
serial_println!("[ok]");
}

View File

@@ -4,7 +4,7 @@
#![test_runner(blog_os::test_runner)]
#![reexport_test_harness_main = "test_main"]
use blog_os::{println, serial_print, serial_println};
use blog_os::println;
use core::panic::PanicInfo;
#[no_mangle] // don't mangle the name of this function
@@ -21,7 +21,5 @@ fn panic(info: &PanicInfo) -> ! {
#[test_case]
fn test_println() {
serial_print!("test_println... ");
println!("test_println output");
serial_println!("[ok]");
}

View File

@@ -7,7 +7,7 @@
extern crate alloc;
use alloc::{boxed::Box, vec::Vec};
use blog_os::{allocator::HEAP_SIZE, serial_print, serial_println};
use blog_os::allocator::HEAP_SIZE;
use bootloader::{entry_point, BootInfo};
use core::panic::PanicInfo;
@@ -30,44 +30,38 @@ fn main(boot_info: &'static BootInfo) -> ! {
#[test_case]
fn simple_allocation() {
serial_print!("simple_allocation... ");
let heap_value = Box::new(41);
assert_eq!(*heap_value, 41);
serial_println!("[ok]");
let heap_value_1 = Box::new(41);
let heap_value_2 = Box::new(13);
assert_eq!(*heap_value_1, 41);
assert_eq!(*heap_value_2, 13);
}
#[test_case]
fn large_vec() {
serial_print!("large_vec... ");
let n = 1000;
let mut vec = Vec::new();
for i in 0..n {
vec.push(i);
}
assert_eq!(vec.iter().sum::<u64>(), (n - 1) * n / 2);
serial_println!("[ok]");
}
#[test_case]
fn many_boxes() {
serial_print!("many_boxes... ");
for i in 0..HEAP_SIZE {
let x = Box::new(i);
assert_eq!(*x, i);
}
serial_println!("[ok]");
}
#[test_case]
fn many_boxes_long_lived() {
serial_print!("many_boxes_long_lived... ");
let long_lived = Box::new(1); // new
for i in 0..HEAP_SIZE {
let x = Box::new(i);
assert_eq!(*x, i);
}
assert_eq!(*long_lived, 1); // new
serial_println!("[ok]");
}
#[panic_handler]

View File

@@ -13,7 +13,7 @@ pub extern "C" fn _start() -> ! {
}
fn should_fail() {
serial_print!("should_fail... ");
serial_print!("should_panic::should_fail...\t");
assert_eq!(0, 1);
}

View File

@@ -9,7 +9,7 @@ use x86_64::structures::idt::{InterruptDescriptorTable, InterruptStackFrame};
#[no_mangle]
pub extern "C" fn _start() -> ! {
serial_print!("stack_overflow... ");
serial_print!("stack_overflow::stack_overflow...\t");
blog_os::gdt::init();
init_test_idt();
@@ -23,6 +23,7 @@ pub extern "C" fn _start() -> ! {
#[allow(unconditional_recursion)]
fn stack_overflow() {
stack_overflow(); // for each recursion, the return address is pushed
volatile::Volatile::new(0).read(); // prevent tail recursion optimizations
}
lazy_static! {