David Evans, profile picture
Uploaded byDavid Evans
PPTX, PDF5,993 views

Kernel-Level Programming: Entering Ring Naught

The document outlines an agenda for a computing class, emphasizing key milestones, upcoming exams, and programming concepts, particularly focusing on hardware vs. software memory isolation. It features discussions around mutual exclusion algorithms and their significance, specifically the bakery algorithm, alongside practical coding examples in Rust for building a kernel. Additionally, it highlights the challenges in kernel programming without an underlying operating system and the steps for compiling ARM binaries.

Technology◦
Related topics:
OS•

Embed presentation

Downloaded 51 times
Entering Ring Naught
Plan for Today Review (Exam 1 Questions) Milestones in Computing Building a Kernel 1 Reminder: PS4 (part 1) is out now. If you want to have more time to work on your project idea instead of PS4, need to let me know this week. Everyone should have received an email with the recorded results for PS2, PS3, and Exam 1.
No Exam 2, 30 Final Instead, 2 Another Assignment, 1 March 20- 21, 14 March 25- 27, 37 Near End of Semester, 11 Took it already!, 1 Exam2 2
No Exam 2, 30 Final Instead, 2 Another Assignment, 1 March 20- 21, 14 March 25- 27, 37 Near End of Semester, 11 Took it already!, 1 Exam2 3 Exam 2 will be out March 25 and due March 27 (12:25pm)
Talk After Class Today! 4 Cyber War, Cyber Peace, Stones, and Glass Houses Gary McGraw, CTO Cigital 2:00 PM Rice Hall 130
5
6 “What is significant about the bakery algorithm is that it implements mutual exclusion without relying on any lower-level mutual exclusion. Assuming that reads and writes of a memory location are atomic actions, as previous mutual exclusion algorithms had done, is tantamount to assuming mutually exclusive access to the location. So a mutual exclusion algorithm that assumes atomic reads and writes is assuming lower-level mutual exclusion. Such an algorithm cannot really be said to solve the mutual exclusion problem. Before the bakery algorithm, people believed that the mutual exclusion problem was unsolvable--that you could implement mutual exclusion only by using lower-level mutual exclusion.”Communications of the ACM, August 1974 (2 pages) We will explore this next Tuesday!
What are the advantages/disadvantages of hardware-based memory isolation over software-based memory isolation? 7
8 Hardware Memory Isolation a[i] = x mem.rs
9 Hardware Memory Isolation STR r0, [r1] a[i] = x compiler assembler rustc as 0100101101011… mem.rs mem
10 Hardware Memory Isolation STR r0, [r1] a[i] = x compiler assembler rustc as 0100101101011… mem.rs mem process running code gash> mem loader
11 Hardware Memory Isolation STR r0, [r1] a[i] = x WRITE 0x57283952, 0x413024 LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory compiler assembler rustc as 0100101101011… mem.rs mem process running code gash> mem loader
12 Hardware Memory Isolation STR r0, [r1] a[i] = x WRITE 0x57283952, 0x413024 compiler assembler rustc as 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL!
Hardware Memory Protection 13 Page Table + L1 Index
14
15 Software-Based Memory Isolation? STR r0, [r1] a[i] = x WRITE 0x57283952, 0x413024 compiler assembler rustc as 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL!
16 Software-Based Memory Isolation …lots of code… STR r0, [r1] a[i] = x WRITE 0x57283952, 0x413024 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory
17 Software-Based Memory Isolation …lots of code… STR r0, [r1] a[i] = x WRITE 0x57283952, 0x413024 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory fn main() { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; } > rustc oob.rs > ./oob task '<main>' failed at 'index out of bounds: the len is 4 but the index is 6', oob.rs:5
18 rustc -S oob.rsLtmp4: … movq $6, -40(%rbp) movq -40(%rbp), %rcx cmpq $4, %rcx setae %dl testb $1, %dl movq %rdi, -48(%rbp) movq %rax, -56(%rbp) movq %rcx, -64(%rbp) jne LBB0_2 movq -56(%rbp), %rax movq -64(%rbp), %rcx movq $7, (%rax,%rcx,8) addq $64, %rsp popq %rbp ret LBB0_2: leaq _str1253(%rip), %rsi movabsq $5, %rdx movabsq $4, %r8 movq -64(%rbp), %rcx callq __ZN8unstable4lang17fail_bounds_check19h71a9f1 .cfi_endproc
19 Software-Based Memory Isolation …lots of code… STR r0, [r1] a[i] = x jne LBB0_2 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL!
20 Software-Based Memory Isolation …lots of code… STR r0, [r1] a[i] = x jne LBB0_2 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL! What if you aren’t starting with source code in a type-safe language?
21 Software-Based Memory Isolation STR r0, [r1] a[i] = x jne LBB0_2 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL!transformer / loader
This is hard! 22
Which is more “expensive”? Hardware-Based Memory Isolation Transistors + wires OS sets up page permissions, loads programs Software-Based Memory Isolation Trusted compiler/loader Statically safe: no runtime cost! 23
Entering the Kernel 24 Photo: RDTaken
Hello World? 25 fn main() { println("Hello?"); }
1. What’s the difference between a programming language and an operating system? 26
27 Image: flickr cc: Ruben Alexander
28
Which came first? • Early programming languages did not run on an Operating System – Turing’s language, Church’s Lambda Calculus – IPL/Lisp, FLOW-MATIC, etc. • Early operating systems were not written in programming languages 29
Programming Language Operating System 30
Programming Language • Mostly a precise way for humans to describe programs • Provides abstractions of (abstract) machine resources • Associated programs like compilers translate into a program for machines to execute • Modern programming languages usually depend on an underlying OS Operating System • A program that runs on some hardware • Provides abstractions for (real) machine resources • Manages sharing of machine resources • Modern operating systems are mostly implemented in C (arguably a programming language) and assembly 31
Kernel Programming in Rust 32 #[no_std]; fn main() { println("Hello?"); }
Kernel Programming in Rust 33 #[no_std]; fn main() { println("Hello?"); } > rustc hello.rs hello.rs:4:5: 4:12 error: unresolved name `println`. hello.rs:4 println("Hello?"); ^~~~~~~ error: aborting due to previous error
Printing is For The Weak! 34 #[no_std]; fn main() { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; }
Main is For The Weak! 35 #[no_std]; fn main() { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; } > rustc oob1.rs error: requires `start` lang_item
36 #[no_std]; #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; }
37 #[no_std]; #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; } gash> rustc oob2.rs oob2.rs:4:1: 9:2 error: not all control paths return a value oob2.rs:4 fn main(_: int, _: **u8) -> int { oob2.rs:5 let mut a = [0, 1, 2, 3]; oob2.rs:6 let i = 6; oob2.rs:7 oob2.rs:8 a[i] = 7; oob2.rs:9 } error: aborting due to previous error
38 #[no_std]; #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; return 0; }
39 rustc -S oob.rsLtmp4: … movq $6, -40(%rbp) movq -40(%rbp), %rcx cmpq $4, %rcx setae %dl testb $1, %dl movq %rdi, -48(%rbp) movq %rax, -56(%rbp) movq %rcx, -64(%rbp) jne LBB0_2 movq -56(%rbp), %rax movq -64(%rbp), %rcx movq $7, (%rax,%rcx,8) addq $64, %rsp popq %rbp ret LBB0_2: leaq _str1253(%rip), %rsi movabsq $5, %rdx movabsq $4, %r8 movq -64(%rbp), %rcx callq __ZN8unstable4lang17fail_bounds_check19h71a9f1 .cfi_endproc
40 #[no_std]; #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; return 0; } bash-3.2$ rustc oob3.rs oob3.rs:8:5: 8:8 error: requires `fail_bounds_check` lang_item oob3.rs:8 a[i] = 7; ^~~
41 #[no_std]; extern "rust-intrinsic" { fn abort() -> !; } #[no_mangle] pub extern fn rust_stack_exhausted() { unsafe { abort() } } #[lang="fail_bounds_check"] pub fn fail_bounds_check(_: *i8, _: uint, _: uint, _: uint) { unsafe { abort() } } #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; return 0; }
42 #[no_std]; extern "rust-intrinsic" { fn abort() -> !; } #[no_mangle] pub extern fn rust_stack_exhausted() { unsafe { abort() } } #[lang="fail_bounds_check"] pub fn fail_bounds_check(_: *i8, _: uint, _: uint, _: uint) { unsafe { abort() } } #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; return 0; } gash> rustc oob4.rs gash> ./oob4 Illegal instruction: 4
43 #[no_std]; extern "rust-intrinsic" { fn abort() -> !; } #[no_mangle] pub extern fn rust_stack_exhausted() { unsafe { abort() } } #[lang="fail_bounds_check"] pub fn fail_bounds_check(_: *i8, _: uint, _: uint, _: uint) { unsafe { abort() } } #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 2; a[i] = 7; return 0; } gash> rustc oob5.rs gash> ./oob5 gash>
IronKernel 44 Kevin Broderick, Alex Lamana, Zeming Lin, John Stevans, Wil Thomason
Building a Kernel 45 #[no_std] Remove everything from Rust that depends on OS: everything that uses system calls rust-core Library that doesn’t depend on OS.
// Copyright 2014 The Rust Project Developers. See the COPYRIGHT // file at the top-level directory of this distribution and at // http://rust-lang.org/COPYRIGHT. // // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your // option. This file may not be copied, modified, or distributed // except according to those terms. use fail::abort; use mem::replace; pub enum Option<T> { Some(T), None } impl<T> Option<T> { /// Returns true if the option contains a `Some` value pub fn is_some(&self) -> bool { match *self { Some(_) => true, None => false } } core/option.rs 46 /// Convert from `Option<T>` to `Option<&T>` pub fn as_ref<'a>(&'a self) -> Option<&'a T> { match *self { Some(ref x) => Some(x), None => None } } /// Convert from `Option<T>` to `Option<&mut T>` pub fn as_mut<'a>(&'a mut self) -> Option<&'a mut T> { match *self { Some(ref mut x) => Some(x), None => None } } /// Return the value in an `Option` or call `abort` if it is `None`. pub fn get(self) -> T { match self { Some(x) => x, None => abort() } } /// Maps an `Option<T>` to `Option<U>` by applying a function to a contained value. pub fn map<U>(self, f: |T| -> U) -> Option<U> { match self { Some(x) => Some(f(x)), None => None } } /// Applies a function to the contained value or returns a default. pub fn map_or<U>(self, def: U, f: |T| -> U) -> U { match self { None => def, Some(t) => f(t) } } /// Take the value out of the option, leaving a `None` in its place. #[inline(always)] pub fn take(&mut self) -> Option<T> { replace(self, None) } } Why does normal Option type need OS?
47 https://github.com/mozilla/rust/blob/master/src/libstd/option.rs Almost all normal code relies on an underlying OS!
Building a Kernel 48 #[no_std] Remove everything from Rust that depends on OS: everything that uses system calls rust-core Library that doesn’t depend on OS. rustboot
49
50
51
Building a Kernel 52 #[no_std] Remove everything from Rust that depends on OS: everything that uses system calls rust-core Library that doesn’t depend on OS. rustboot Boot! IronKernel 32-bit ARM OS kernel that can print text on the screen (in many colors!), handle keyboard input (as long as you don’t press any “dangerous” keys
53 Photo: flickr cc:Randy OHC
Kernel Programming 54 Development Machine (Ubuntu 64-bit x86 Linux) editors, file system, networ k, compilers Target Machine (32-bit ARM)
Kernel Programming 55 Development Machine (Ubuntu 64-bit x86 Linux) editors, file system, networ k, cross-compilers Target Machine (32-bit ARM) ARM binary
Kernel Programming 56 Development Machine (Ubuntu 64-bit x86 Linux) editors, file system, networ k, cross-compilers QEMU: Emulator (32-bit ARM) ARM binary
57 How the kernel is built: > rustc --emit-llvm mod.rs > llc -march=arm -mcpu=arm926ej-s mod.bc > arm-none-eabi-as mod.as > objcopy mod.o … mod.rs mod.bc mod.s mod.o kernel.bin rustc llc arm-none-eabi-as objcopyassembler naming convention: [processor]-[os]-[application binary interface]
58 How the kernel is built: > rustc --emit-llvm mod.rs > llc -march=arm -mcpu=arm926ej-s mod.bc > arm-none-eabi-as mod.as > objcopy mod.o … mod.rs mod.bc mod.s mod.o kernel.bin rustc llc arm-none-eabi-as objcopyassembler naming convention: [processor]-[os]-[application binary interface] Easy way: make run
IronKernel Demo 59
60 *((addr + (i * 4)) as * mut u32) = val
61 Reminder: stay for Gary McGraw talk! Form PS4 Teams while you are waiting for Gary’s talk! A PS4 team can be any 3 people.

More Related Content

PPTX
Making a Process (Virtualizing Memory)
byDavid Evans
 
PPTX
Segmentation Faults, Page Faults, Processes, Threads, and Tasks
byDavid Evans
 
PPTX
Mutual Exclusion
byDavid Evans
 
PPTX
Once Upon a Process
byDavid Evans
 
PPTX
Managing Memory
byDavid Evans
 
PPTX
System Calls
byDavid Evans
 
PPTX
Synchronization
byDavid Evans
 
PPTX
Bakers and Philosophers
byDavid Evans
 
Making a Process (Virtualizing Memory)
byDavid Evans
 
Segmentation Faults, Page Faults, Processes, Threads, and Tasks
byDavid Evans
 
Mutual Exclusion
byDavid Evans
 
Once Upon a Process
byDavid Evans
 
Managing Memory
byDavid Evans
 
System Calls
byDavid Evans
 
Synchronization
byDavid Evans
 
Bakers and Philosophers
byDavid Evans
 

What's hot

PDF
Exploitation of counter overflows in the Linux kernel
byVitaly Nikolenko
 
PDF
Meltdown & spectre
bySergio Shevchenko
 
PDF
Meltdown & Spectre
byMarco Cipriano
 
PPTX
Operating System Engineering Quiz
byProgramming Homework Help
 
PPTX
Putting a Fork in Fork (Linux Process and Memory Management)
byDavid Evans
 
PPTX
java memory management & gc
byexsuns
 
PPTX
Scheduling in Linux and Web Servers
byDavid Evans
 
PDF
Where destructors meet threads
byShuo Chen
 
PPTX
Crossing into Kernel Space
byDavid Evans
 
PPT
Coding for multiple cores
byLee Hanxue
 
PDF
MyShell - English
byJohnnatan Messias
 
PPT
Lockless Programming GDC 09
byLee Hanxue
 
PDF
Intro to Rust from Applicative / NY Meetup
bynikomatsakis
 
PDF
Kernel Recipes 2019 - Formal modeling made easy
byAnne Nicolas
 
PPTX
Making a Process
byDavid Evans
 
PPTX
Угадываем пароль за минуту
byPositive Hack Days
 
PDF
Rust: Reach Further (from QCon Sao Paolo 2018)
bynikomatsakis
 
PDF
Class 1: What is an Operating System?
byDavid Evans
 
PPTX
Virtual Memory (Making a Process)
byDavid Evans
 
PPTX
Scheduling
byDavid Evans
 
Exploitation of counter overflows in the Linux kernel
byVitaly Nikolenko
 
Meltdown & spectre
bySergio Shevchenko
 
Meltdown & Spectre
byMarco Cipriano
 
Operating System Engineering Quiz
byProgramming Homework Help
 
Putting a Fork in Fork (Linux Process and Memory Management)
byDavid Evans
 
java memory management & gc
byexsuns
 
Scheduling in Linux and Web Servers
byDavid Evans
 
Where destructors meet threads
byShuo Chen
 
Crossing into Kernel Space
byDavid Evans
 
Coding for multiple cores
byLee Hanxue
 
MyShell - English
byJohnnatan Messias
 
Lockless Programming GDC 09
byLee Hanxue
 
Intro to Rust from Applicative / NY Meetup
bynikomatsakis
 
Kernel Recipes 2019 - Formal modeling made easy
byAnne Nicolas
 
Making a Process
byDavid Evans
 
Угадываем пароль за минуту
byPositive Hack Days
 
Rust: Reach Further (from QCon Sao Paolo 2018)
bynikomatsakis
 
Class 1: What is an Operating System?
byDavid Evans
 
Virtual Memory (Making a Process)
byDavid Evans
 
Scheduling
byDavid Evans
 

Viewers also liked

PDF
Rust Workshop - NITC FOSSMEET 2017
bypramode_ce
 
PDF
OOP in Rust
byKENZ_gelsoft
 
PPTX
Flash! (Modern File Systems)
byDavid Evans
 
PDF
Rust: Unlocking Systems Programming
byC4Media
 
PDF
Hey! There's OCaml in my Rust!
byKel Cecil
 
PPTX
Inventing the Future
byDavid Evans
 
PPTX
Gash Has No Privileges
byDavid Evans
 
PPTX
What the &~#@&lt;!? (Pointers in Rust)
byDavid Evans
 
PDF
Type-Directed TDD in Rust: a case study using FizzBuzz
byFranklin Chen
 
PPTX
The Internet
byDavid Evans
 
PPTX
SSL Failing, Sharing, and Scheduling
byDavid Evans
 
PDF
RUSTing -- Partially Ordered Rust Programming Ruminations
byAngelo Corsaro
 
PPTX
Storage
byDavid Evans
 
PPTX
Zero to a Billion in 4.86 Years (A Whirlwind History of Operating Systems)
byDavid Evans
 
PPTX
Smarter Scheduling (Priorities, Preemptive Priority Scheduling, Lottery and S...
byDavid Evans
 
PPTX
What the &~#@&lt;!? (Memory Management in Rust)
byDavid Evans
 
PPTX
Ruby is Awesome and Rust is Awesome and Building a Game in Both is AWESOME
byJulien Fitzpatrick
 
PDF
Servo: The parallel web engine
byBruno Abinader
 
PPTX
Invent the Future (Operating Systems in 2029)
byDavid Evans
 
Rust Workshop - NITC FOSSMEET 2017
bypramode_ce
 
OOP in Rust
byKENZ_gelsoft
 
Flash! (Modern File Systems)
byDavid Evans
 
Rust: Unlocking Systems Programming
byC4Media
 
Hey! There's OCaml in my Rust!
byKel Cecil
 
Inventing the Future
byDavid Evans
 
Gash Has No Privileges
byDavid Evans
 
What the &~#@&lt;!? (Pointers in Rust)
byDavid Evans
 
Type-Directed TDD in Rust: a case study using FizzBuzz
byFranklin Chen
 
The Internet
byDavid Evans
 
SSL Failing, Sharing, and Scheduling
byDavid Evans
 
RUSTing -- Partially Ordered Rust Programming Ruminations
byAngelo Corsaro
 
Storage
byDavid Evans
 
Zero to a Billion in 4.86 Years (A Whirlwind History of Operating Systems)
byDavid Evans
 
Smarter Scheduling (Priorities, Preemptive Priority Scheduling, Lottery and S...
byDavid Evans
 
What the &~#@&lt;!? (Memory Management in Rust)
byDavid Evans
 
Ruby is Awesome and Rust is Awesome and Building a Game in Both is AWESOME
byJulien Fitzpatrick
 
Servo: The parallel web engine
byBruno Abinader
 
Invent the Future (Operating Systems in 2029)
byDavid Evans
 

Similar to Kernel-Level Programming: Entering Ring Naught

PDF
rrxv6 Build a Riscv xv6 Kernel in Rust.pdf
byYodalee
 
PPTX
Introduction to Rust language programming
byRodolfo Finochietti
 
PDF
Rust All Hands Winter 2011
byPatrick Walton
 
PDF
Rust in Action Systems programming concepts and techniques 1st Edition Tim Mc...
bypaaolablan
 
PPTX
GOSIM 2024 - Incremental Linking and Hot Code Reloading for Rust
byGOSIM Foundation
 
PPTX
Rust vs C++
bycorehard_by
 
PDF
Intro to Rust 2019
byTimothy Bess
 
PDF
The Rust Programming Language
byMario Alexandro Santini
 
PDF
Daniel Phillipe Gonçalves Menezes Aracaju Sergipe
byDaniel Phillipe Gonçalves Menezes
 
PDF
RUST FOR SECURE IOT - DANIEL PHILLIPE GONÇALVES MENEZES
byDaniel Phillipe Gonçalves Menezes
 
ODP
Rust Primer
byKnoldus Inc.
 
PDF
Short intro to the Rust language
byGines Espada
 
PDF
Rust: Reach Further
bynikomatsakis
 
PDF
Le langage rust
byGeeks Anonymes
 
PDF
Rust "Hot or Not" at Sioux
bynikomatsakis
 
PPTX
The Rust Programming Language vs The C Programming Language
byjmquimosing
 
PDF
C言語静的解析ツールと Ruby 1.9 trunk
byikegami__
 
PDF
Rust Intro @ Roma Rust meetup
byClaudio Capobianco
 
PDF
Guaranteeing Memory Safety in Rust
bynikomatsakis
 
PDF
Is it time to rewrite the operating system in Rust?
bybcantrill
 
rrxv6 Build a Riscv xv6 Kernel in Rust.pdf
byYodalee
 
Introduction to Rust language programming
byRodolfo Finochietti
 
Rust All Hands Winter 2011
byPatrick Walton
 
Rust in Action Systems programming concepts and techniques 1st Edition Tim Mc...
bypaaolablan
 
GOSIM 2024 - Incremental Linking and Hot Code Reloading for Rust
byGOSIM Foundation
 
Rust vs C++
bycorehard_by
 
Intro to Rust 2019
byTimothy Bess
 
The Rust Programming Language
byMario Alexandro Santini
 
Daniel Phillipe Gonçalves Menezes Aracaju Sergipe
byDaniel Phillipe Gonçalves Menezes
 
RUST FOR SECURE IOT - DANIEL PHILLIPE GONÇALVES MENEZES
byDaniel Phillipe Gonçalves Menezes
 
Rust Primer
byKnoldus Inc.
 
Short intro to the Rust language
byGines Espada
 
Rust: Reach Further
bynikomatsakis
 
Le langage rust
byGeeks Anonymes
 
Rust "Hot or Not" at Sioux
bynikomatsakis
 
The Rust Programming Language vs The C Programming Language
byjmquimosing
 
C言語静的解析ツールと Ruby 1.9 trunk
byikegami__
 
Rust Intro @ Roma Rust meetup
byClaudio Capobianco
 
Guaranteeing Memory Safety in Rust
bynikomatsakis
 
Is it time to rewrite the operating system in Rust?
bybcantrill
 

More from David Evans

PPTX
Scripting Transactions
byDavid Evans
 
PPTX
Cryptocurrency Jeopardy!
byDavid Evans
 
PPTX
Multi-Party Computation for the Masses
byDavid Evans
 
PPTX
Silk Road
byDavid Evans
 
PPTX
Hidden Services, Zero Knowledge
byDavid Evans
 
PPTX
The Blockchain
byDavid Evans
 
PPTX
Mining Economics
byDavid Evans
 
PPTX
Bitcoin Script
byDavid Evans
 
PPTX
Anonymity in Bitcoin
byDavid Evans
 
PPTX
Mining
byDavid Evans
 
PPTX
Asymmetric Key Signatures
byDavid Evans
 
PPTX
Useful Proofs of Work, Permacoin
byDavid Evans
 
PPTX
Midterm Confirmations
byDavid Evans
 
PPTX
Introduction to Cryptography
byDavid Evans
 
PPTX
Becoming More Paranoid
byDavid Evans
 
PPTX
Blooming Sidechains!
byDavid Evans
 
PPTX
Trick or Treat?: Bitcoin for Non-Believers, Cryptocurrencies for Cypherpunks
byDavid Evans
 
PPTX
Proof of Reserve
byDavid Evans
 
PPTX
How to Live in Paradise
byDavid Evans
 
PPTX
Class 1: What is Money?
byDavid Evans
 
Scripting Transactions
byDavid Evans
 
Cryptocurrency Jeopardy!
byDavid Evans
 
Multi-Party Computation for the Masses
byDavid Evans
 
Silk Road
byDavid Evans
 
Hidden Services, Zero Knowledge
byDavid Evans
 
The Blockchain
byDavid Evans
 
Mining Economics
byDavid Evans
 
Bitcoin Script
byDavid Evans
 
Anonymity in Bitcoin
byDavid Evans
 
Mining
byDavid Evans
 
Asymmetric Key Signatures
byDavid Evans
 
Useful Proofs of Work, Permacoin
byDavid Evans
 
Midterm Confirmations
byDavid Evans
 
Introduction to Cryptography
byDavid Evans
 
Becoming More Paranoid
byDavid Evans
 
Blooming Sidechains!
byDavid Evans
 
Trick or Treat?: Bitcoin for Non-Believers, Cryptocurrencies for Cypherpunks
byDavid Evans
 
Proof of Reserve
byDavid Evans
 
How to Live in Paradise
byDavid Evans
 
Class 1: What is Money?
byDavid Evans
 

Recently uploaded

PPTX
Coded Agents – with UiPath SDK + LangGraph [Virtual Hands-on Workshop]
byUiPathCommunity
 
PDF
Data Virtualization in Action: Scaling APIs and Apps with FME
bySafe Software
 
PDF
Real-Time Data Insight Using Microsoft Forms for Business
byElevate
 
PPTX
communication-skills-with-technology tools
byJaleto Sunkemo
 
PPTX
Technology Consulting _ by Slidesgo.pptx
byfh82277
 
PPTX
Software Analysis &Design ethiopia chap-2.pptx
byAbbas484771
 
PDF
Security Forum Sessions from Houston 2025 Event
byMark Simos
 
PDF
Unlocking the Power of Salesforce Architecture: Frameworks for Effective Solu...
byvarsha30tiwari
 
PDF
Unser Jahresrückblick – MarvelClient in 2025
bypanagenda
 
PDF
Six Shifts For 2026 (And The Next Six Years)
byDavid Armano
 
PPTX
From Backup to Resilience: How MSPs Are Preparing for 2026
byMSP360
 
PPTX
Data Privacy and Protection: Safeguarding Information in a Connected World
byYasir Naveed Riaz
 
PPTX
cybercrime in Information security .pptx
byismaeelsahib032
 
PDF
Day 5 - Red Team + Blue Team in the Cloud - 2nd Sight Lab Cloud Security Class
by2nd Sight Lab
 
PDF
Cybersecurity: Safeguarding Digital Assets
byYasir Naveed Riaz
 
PPTX
AI's Impact on Cybersecurity - Challenges and Opportunities
byYasir Naveed Riaz
 
PPTX
Cybersecurity Best Practices - Step by Step guidelines
byYasir Naveed Riaz
 
PDF
TrustArc Webinar - Looking Ahead: The 2026 Privacy Landscape
byTrustArc
 
PDF
Is It Possible to Have Wi-Fi Without an Internet Provider
bySidra Jefferi
 
PDF
Session 1 - Solving Semi-Structured Documents with Document Understanding
byDianaGray10
 
Coded Agents – with UiPath SDK + LangGraph [Virtual Hands-on Workshop]
byUiPathCommunity
 
Data Virtualization in Action: Scaling APIs and Apps with FME
bySafe Software
 
Real-Time Data Insight Using Microsoft Forms for Business
byElevate
 
communication-skills-with-technology tools
byJaleto Sunkemo
 
Technology Consulting _ by Slidesgo.pptx
byfh82277
 
Software Analysis &Design ethiopia chap-2.pptx
byAbbas484771
 
Security Forum Sessions from Houston 2025 Event
byMark Simos
 
Unlocking the Power of Salesforce Architecture: Frameworks for Effective Solu...
byvarsha30tiwari
 
Unser Jahresrückblick – MarvelClient in 2025
bypanagenda
 
Six Shifts For 2026 (And The Next Six Years)
byDavid Armano
 
From Backup to Resilience: How MSPs Are Preparing for 2026
byMSP360
 
Data Privacy and Protection: Safeguarding Information in a Connected World
byYasir Naveed Riaz
 
cybercrime in Information security .pptx
byismaeelsahib032
 
Day 5 - Red Team + Blue Team in the Cloud - 2nd Sight Lab Cloud Security Class
by2nd Sight Lab
 
Cybersecurity: Safeguarding Digital Assets
byYasir Naveed Riaz
 
AI's Impact on Cybersecurity - Challenges and Opportunities
byYasir Naveed Riaz
 
Cybersecurity Best Practices - Step by Step guidelines
byYasir Naveed Riaz
 
TrustArc Webinar - Looking Ahead: The 2026 Privacy Landscape
byTrustArc
 
Is It Possible to Have Wi-Fi Without an Internet Provider
bySidra Jefferi
 
Session 1 - Solving Semi-Structured Documents with Document Understanding
byDianaGray10
 

Kernel-Level Programming: Entering Ring Naught

  • 1.
  • 2.
    Plan for Today Review(Exam 1 Questions) Milestones in Computing Building a Kernel 1 Reminder: PS4 (part 1) is out now. If you want to have more time to work on your project idea instead of PS4, need to let me know this week. Everyone should have received an email with the recorded results for PS2, PS3, and Exam 1.
  • 3.
    No Exam 2,30 Final Instead, 2 Another Assignment, 1 March 20- 21, 14 March 25- 27, 37 Near End of Semester, 11 Took it already!, 1 Exam2 2
  • 4.
    No Exam 2,30 Final Instead, 2 Another Assignment, 1 March 20- 21, 14 March 25- 27, 37 Near End of Semester, 11 Took it already!, 1 Exam2 3 Exam 2 will be out March 25 and due March 27 (12:25pm)
  • 5.
    Talk After ClassToday! 4 Cyber War, Cyber Peace, Stones, and Glass Houses Gary McGraw, CTO Cigital 2:00 PM Rice Hall 130
  • 6.
  • 7.
    6 “What is significantabout the bakery algorithm is that it implements mutual exclusion without relying on any lower-level mutual exclusion. Assuming that reads and writes of a memory location are atomic actions, as previous mutual exclusion algorithms had done, is tantamount to assuming mutually exclusive access to the location. So a mutual exclusion algorithm that assumes atomic reads and writes is assuming lower-level mutual exclusion. Such an algorithm cannot really be said to solve the mutual exclusion problem. Before the bakery algorithm, people believed that the mutual exclusion problem was unsolvable--that you could implement mutual exclusion only by using lower-level mutual exclusion.”Communications of the ACM, August 1974 (2 pages) We will explore this next Tuesday!
  • 8.
    What are the advantages/disadvantagesof hardware-based memory isolation over software-based memory isolation? 7
  • 9.
  • 10.
    9 Hardware Memory Isolation STRr0, [r1] a[i] = x compiler assembler rustc as 0100101101011… mem.rs mem
  • 11.
    10 Hardware Memory Isolation STRr0, [r1] a[i] = x compiler assembler rustc as 0100101101011… mem.rs mem process running code gash> mem loader
  • 12.
    11 Hardware Memory Isolation STRr0, [r1] a[i] = x WRITE 0x57283952, 0x413024 LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory compiler assembler rustc as 0100101101011… mem.rs mem process running code gash> mem loader
  • 13.
    12 Hardware Memory Isolation STRr0, [r1] a[i] = x WRITE 0x57283952, 0x413024 compiler assembler rustc as 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL!
  • 14.
  • 15.
  • 16.
    15 Software-Based Memory Isolation? STRr0, [r1] a[i] = x WRITE 0x57283952, 0x413024 compiler assembler rustc as 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL!
  • 17.
    16 Software-Based Memory Isolation …lotsof code… STR r0, [r1] a[i] = x WRITE 0x57283952, 0x413024 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory
  • 18.
    17 Software-Based Memory Isolation …lotsof code… STR r0, [r1] a[i] = x WRITE 0x57283952, 0x413024 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory fn main() { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; } > rustc oob.rs > ./oob task '<main>' failed at 'index out of bounds: the len is 4 but the index is 6', oob.rs:5
  • 19.
    18 rustc -S oob.rsLtmp4: … movq$6, -40(%rbp) movq -40(%rbp), %rcx cmpq $4, %rcx setae %dl testb $1, %dl movq %rdi, -48(%rbp) movq %rax, -56(%rbp) movq %rcx, -64(%rbp) jne LBB0_2 movq -56(%rbp), %rax movq -64(%rbp), %rcx movq $7, (%rax,%rcx,8) addq $64, %rsp popq %rbp ret LBB0_2: leaq _str1253(%rip), %rsi movabsq $5, %rdx movabsq $4, %r8 movq -64(%rbp), %rcx callq __ZN8unstable4lang17fail_bounds_check19h71a9f1 .cfi_endproc
  • 20.
    19 Software-Based Memory Isolation …lotsof code… STR r0, [r1] a[i] = x jne LBB0_2 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL!
  • 21.
    20 Software-Based Memory Isolation …lotsof code… STR r0, [r1] a[i] = x jne LBB0_2 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL! What if you aren’t starting with source code in a type-safe language?
  • 22.
    21 Software-Based Memory Isolation STRr0, [r1] a[i] = x jne LBB0_2 compiler assembler rustc 0100101101011… mem.rs mem process running code gash> mem loader LogicalAddress Segmentation Unit LinearAddress Paging Unit PhysicalAddress Memory FAIL!transformer / loader
  • 23.
  • 24.
    Which is more“expensive”? Hardware-Based Memory Isolation Transistors + wires OS sets up page permissions, loads programs Software-Based Memory Isolation Trusted compiler/loader Statically safe: no runtime cost! 23
  • 25.
  • 26.
    Hello World? 25 fn main(){ println("Hello?"); }
  • 27.
    1. What’s thedifference between a programming language and an operating system? 26
  • 28.
    27 Image: flickr cc:Ruben Alexander
  • 29.
  • 30.
    Which came first? •Early programming languages did not run on an Operating System – Turing’s language, Church’s Lambda Calculus – IPL/Lisp, FLOW-MATIC, etc. • Early operating systems were not written in programming languages 29
  • 31.
  • 32.
    Programming Language • Mostlya precise way for humans to describe programs • Provides abstractions of (abstract) machine resources • Associated programs like compilers translate into a program for machines to execute • Modern programming languages usually depend on an underlying OS Operating System • A program that runs on some hardware • Provides abstractions for (real) machine resources • Manages sharing of machine resources • Modern operating systems are mostly implemented in C (arguably a programming language) and assembly 31
  • 33.
    Kernel Programming inRust 32 #[no_std]; fn main() { println("Hello?"); }
  • 34.
    Kernel Programming inRust 33 #[no_std]; fn main() { println("Hello?"); } > rustc hello.rs hello.rs:4:5: 4:12 error: unresolved name `println`. hello.rs:4 println("Hello?"); ^~~~~~~ error: aborting due to previous error
  • 35.
    Printing is ForThe Weak! 34 #[no_std]; fn main() { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; }
  • 36.
    Main is ForThe Weak! 35 #[no_std]; fn main() { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; } > rustc oob1.rs error: requires `start` lang_item
  • 37.
    36 #[no_std]; #[start] fn main(_: int,_: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; }
  • 38.
    37 #[no_std]; #[start] fn main(_: int,_: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; } gash> rustc oob2.rs oob2.rs:4:1: 9:2 error: not all control paths return a value oob2.rs:4 fn main(_: int, _: **u8) -> int { oob2.rs:5 let mut a = [0, 1, 2, 3]; oob2.rs:6 let i = 6; oob2.rs:7 oob2.rs:8 a[i] = 7; oob2.rs:9 } error: aborting due to previous error
  • 39.
    38 #[no_std]; #[start] fn main(_: int,_: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; return 0; }
  • 40.
    39 rustc -S oob.rsLtmp4: … movq$6, -40(%rbp) movq -40(%rbp), %rcx cmpq $4, %rcx setae %dl testb $1, %dl movq %rdi, -48(%rbp) movq %rax, -56(%rbp) movq %rcx, -64(%rbp) jne LBB0_2 movq -56(%rbp), %rax movq -64(%rbp), %rcx movq $7, (%rax,%rcx,8) addq $64, %rsp popq %rbp ret LBB0_2: leaq _str1253(%rip), %rsi movabsq $5, %rdx movabsq $4, %r8 movq -64(%rbp), %rcx callq __ZN8unstable4lang17fail_bounds_check19h71a9f1 .cfi_endproc
  • 41.
    40 #[no_std]; #[start] fn main(_: int,_: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; return 0; } bash-3.2$ rustc oob3.rs oob3.rs:8:5: 8:8 error: requires `fail_bounds_check` lang_item oob3.rs:8 a[i] = 7; ^~~
  • 42.
    41 #[no_std]; extern "rust-intrinsic" {fn abort() -> !; } #[no_mangle] pub extern fn rust_stack_exhausted() { unsafe { abort() } } #[lang="fail_bounds_check"] pub fn fail_bounds_check(_: *i8, _: uint, _: uint, _: uint) { unsafe { abort() } } #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; return 0; }
  • 43.
    42 #[no_std]; extern "rust-intrinsic" {fn abort() -> !; } #[no_mangle] pub extern fn rust_stack_exhausted() { unsafe { abort() } } #[lang="fail_bounds_check"] pub fn fail_bounds_check(_: *i8, _: uint, _: uint, _: uint) { unsafe { abort() } } #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 6; a[i] = 7; return 0; } gash> rustc oob4.rs gash> ./oob4 Illegal instruction: 4
  • 44.
    43 #[no_std]; extern "rust-intrinsic" {fn abort() -> !; } #[no_mangle] pub extern fn rust_stack_exhausted() { unsafe { abort() } } #[lang="fail_bounds_check"] pub fn fail_bounds_check(_: *i8, _: uint, _: uint, _: uint) { unsafe { abort() } } #[start] fn main(_: int, _: **u8) -> int { let mut a = [0, 1, 2, 3]; let i = 2; a[i] = 7; return 0; } gash> rustc oob5.rs gash> ./oob5 gash>
  • 45.
    IronKernel 44 Kevin Broderick, AlexLamana, Zeming Lin, John Stevans, Wil Thomason
  • 46.
    Building a Kernel 45 #[no_std]Remove everything from Rust that depends on OS: everything that uses system calls rust-core Library that doesn’t depend on OS.
  • 47.
    // Copyright 2014The Rust Project Developers. See the COPYRIGHT // file at the top-level directory of this distribution and at // http://rust-lang.org/COPYRIGHT. // // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your // option. This file may not be copied, modified, or distributed // except according to those terms. use fail::abort; use mem::replace; pub enum Option<T> { Some(T), None } impl<T> Option<T> { /// Returns true if the option contains a `Some` value pub fn is_some(&self) -> bool { match *self { Some(_) => true, None => false } } core/option.rs 46 /// Convert from `Option<T>` to `Option<&T>` pub fn as_ref<'a>(&'a self) -> Option<&'a T> { match *self { Some(ref x) => Some(x), None => None } } /// Convert from `Option<T>` to `Option<&mut T>` pub fn as_mut<'a>(&'a mut self) -> Option<&'a mut T> { match *self { Some(ref mut x) => Some(x), None => None } } /// Return the value in an `Option` or call `abort` if it is `None`. pub fn get(self) -> T { match self { Some(x) => x, None => abort() } } /// Maps an `Option<T>` to `Option<U>` by applying a function to a contained value. pub fn map<U>(self, f: |T| -> U) -> Option<U> { match self { Some(x) => Some(f(x)), None => None } } /// Applies a function to the contained value or returns a default. pub fn map_or<U>(self, def: U, f: |T| -> U) -> U { match self { None => def, Some(t) => f(t) } } /// Take the value out of the option, leaving a `None` in its place. #[inline(always)] pub fn take(&mut self) -> Option<T> { replace(self, None) } } Why does normal Option type need OS?
  • 48.
  • 49.
    Building a Kernel 48 #[no_std]Remove everything from Rust that depends on OS: everything that uses system calls rust-core Library that doesn’t depend on OS. rustboot
  • 50.
  • 51.
  • 52.
  • 53.
    Building a Kernel 52 #[no_std]Remove everything from Rust that depends on OS: everything that uses system calls rust-core Library that doesn’t depend on OS. rustboot Boot! IronKernel 32-bit ARM OS kernel that can print text on the screen (in many colors!), handle keyboard input (as long as you don’t press any “dangerous” keys
  • 54.
  • 55.
    Kernel Programming 54 Development Machine (Ubuntu64-bit x86 Linux) editors, file system, networ k, compilers Target Machine (32-bit ARM)
  • 56.
    Kernel Programming 55 Development Machine (Ubuntu64-bit x86 Linux) editors, file system, networ k, cross-compilers Target Machine (32-bit ARM) ARM binary
  • 57.
    Kernel Programming 56 Development Machine (Ubuntu64-bit x86 Linux) editors, file system, networ k, cross-compilers QEMU: Emulator (32-bit ARM) ARM binary
  • 58.
    57 How the kernelis built: > rustc --emit-llvm mod.rs > llc -march=arm -mcpu=arm926ej-s mod.bc > arm-none-eabi-as mod.as > objcopy mod.o … mod.rs mod.bc mod.s mod.o kernel.bin rustc llc arm-none-eabi-as objcopyassembler naming convention: [processor]-[os]-[application binary interface]
  • 59.
    58 How the kernelis built: > rustc --emit-llvm mod.rs > llc -march=arm -mcpu=arm926ej-s mod.bc > arm-none-eabi-as mod.as > objcopy mod.o … mod.rs mod.bc mod.s mod.o kernel.bin rustc llc arm-none-eabi-as objcopyassembler naming convention: [processor]-[os]-[application binary interface] Easy way: make run
  • 60.
  • 61.
    60 *((addr + (i* 4)) as * mut u32) = val
  • 62.
    61 Reminder: stay for GaryMcGraw talk! Form PS4 Teams while you are waiting for Gary’s talk! A PS4 team can be any 3 people.