Ian Wienand


          <[email protected]>

        

A PDF version is available at www.bottomupcs.com/csbu.pdf. A EPUB version is available at www.bottomupcs.com/csbu.epub The original Souces are available at github.com/ianw/bottom…

Copyright © 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Ian Wienand

This work is licensed under the Creative Commons Attribution-ShareAlike License. To view a copy of this license, Visit creativecommons.org/licenses/by… or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.

  • Introduction
    • Welcome
      • Philosophy
      • Why from the bottom up?
      • Enabling technologies
  • 1. General Unix and Advanced C
    • Everything is a file!
    • Implementing abstraction
      • Implementing abstraction with C
      • Libraries
    • File Descriptors
      • The Shell
  • 2. Binary and Number Representation
    • Binary — the basis of computing
      • Binary Theory
      • Hexadecimal
      • Practical Implications
    • Types and Number Representation
      • C Standards
      • Types
      • Number Representation
  • 3. Computer Architecture
    • The CPU
      • Branching
      • Cycles
      • Fetch, Decode, Execute, Store
      • CISC v RISC
    • Memory
      • Memory Hierarchy
      • Cache in depth
    • Peripherals and buses
      • Peripheral Bus concepts
      • DMA
      • Other Buses
    • Small to big systems
      • Symmetric Multi-Processing
      • Clusters
      • Non-Uniform Memory Access
      • Memory ordering, locking and atomic operations
  • 4. The Operating System
    • The role of the operating system
      • Abstraction of hardware
      • Multitasking
      • Standardised Interfaces
      • Security
      • Performance
    • Operating System Organisation
      • The Kernel
      • Userspace
    • System Calls
      • Overview
      • Analysing a system call
    • Privileges
      • Hardware
      • Other ways of communicating with the kernel
      • File Systems
  • 5. The Process
    • What is a process?
    • Elements of a process
      • Process ID
      • Memory
      • File Descriptors
      • Registers
      • Kernel State
    • Process Hierarchy
    • Fork and Exec
      • Fork
      • Exec
      • How Linux actually handles fork and exec
      • The init process
    • Context Switching
    • Scheduling
      • Preemptive v co-operative scheduling
      • Realtime
      • Nice value
      • A brief look at the Linux Scheduler
    • The Shell
    • Signals
      • Example
  • 6. Virtual Memory
    • What Virtual Memory isn’t
    • What virtual memory is
      • 64 bit computing
      • Using the address space
    • Pages
    • Physical Memory
    • Pages + Frames = Page Tables
    • Virtual Addresses
      • Page
      • Offset
      • Virtual Address Translation
    • Consequences of virtual addresses, pages and page tables
      • Individual address spaces
      • Protection
      • Swap
      • Sharing memory
      • Disk Cache
    • Hardware Support
      • Physical v Virtual Mode
      • The TLB
      • TLB Management
    • Linux Specifics
      • Address Space Layout
      • Three Level Page Table
    • Hardware support for virtual memory
      • x86-64
      • Itanium
  • 7. The Toolchain
    • Compiled v Interpreted Programs
      • Compiled Programs
      • Interpreted programs
    • Building an executable
    • Compiling
      • The process of compiling
      • Syntax
      • Assembly Generation
      • Optimisation
    • Assembler
    • Linker
      • Symbols
      • The linking process
    • A practical example
      • Compiling
      • Assembly
      • Linking
      • The Executable
  • 8. Behind the process
    • Review of executable files
    • Representing executable files
      • Three Standard Sections
      • Binary Format
      • Binary Format History
    • ELF
      • ELF File Header
      • Symbols and Relocations
      • Sections and Segments
    • ELF Executables
    • Libraries
      • Static Libraries
      • Shared Libraries
    • Extending ELF concepts
      • Debugging
      • Custom sections
      • Linker Scripts
    • ABI’s
      • Byte Order
      • Calling Conventions
    • Starting a process
      • Kernel communication to programs
      • Starting the program
  • 9. Dynamic Linking
    • Code Sharing
      • Dynamic Library Details
      • Including libraries in an executable
    • The Dynamic Linker
      • Relocations
      • Position Independence
    • Global Offset Tables
      • The Global Offset Table
    • Libraries
      • The Procedure Lookup Table
    • Working with libraries and the linker
      • Library versions
      • Finding symbols
  • 10. I/O Fundamentals
    • File System Fundamentals
    • Networking Fundamentals
  • Glossary
  • 1.1. Abstraction
  • 1.2. The Default Unix Files
  • 1.3. Abstraction
  • 1.4. A pipe in action
  • 2.1. Masking
  • 2.2. The Types
  • 3.1. The CPU
  • 3.2. Inside the CPU
  • 3.3. The Reorder buffer example
  • 3.4. The Cache Associativity
  • 3.5. The Cache tags
  • Overview of handling an interrupt
  • Overview of a UHCI controller operation
  • 3.8. A Hypercube
  • Acquire and Release Semantics
  • 4.1. The Operating System
  • 4.2. The Operating System
  • 4.3. Rings
  • 4.4 x86 Segmentation Addressing
  • 4.5 x86 segments
  • 5.1. The Elements of a Process
  • 5.2. The Stack
  • 5.3. Process the memory layout
  • 5.4. The Threads
  • 5.5. The O (1) scheduler
  • 6.1. Illustration of canonical addresses
  • 6.2. Virtual memory pages
  • 6.3. Virtual Address Translation
  • 6.4. Segmentation
  • 6.5. Linux address space layout
  • 6.6. Linux Three Level Page Table
  • Illustrationitanium regions and protection keys
  • Illustrationof Itanium TLB translation
  • 6.9. Illustration of a hierarchical page-table
  • 6.10. Itanium short-format VHPT implementation
  • 6.11. Itanium PTE entry formats
  • 7.1. Alignment
  • 7.2. Alignment
  • 8.1. The ELF Overview
  • 9.1 Memory access via the GOT
  • 9.2. sonames
  • 1.1. Standard Files Provided by Unix
  • 1.2. Standard Shell Redirection Facilities
  • 2.1. Binary
  • 2.2. 203 in base 10
  • 2.3. 203 in base 2
  • 2.4. The Bytes
  • 2.5 Convert 203 to binary
  • 2.6. Truth table for not
  • 2.7. Truth table for and
  • 2.8. Truth table for or
  • 2.9. Truth table for XOR
  • 2.10. Boolean operations in C
  • 2.11. Hexadecimal, Binary and Decimal
  • 2.12. Convert 203 to hexadecimal
  • 2.13. Standard Integer Types and Sizes
  • 2.14. Standard Scalar Types and Sizes
  • 2.15. One ‘s Complement Addition
  • 2.16. Two ‘s Complement Addition
  • 2.17. IEEE Floating Point
  • 2.18. Scientific Notation for 1.98765×10^6
  • 2.19. Significands in binary
  • Real ones: Example of normnorming
  • 3.1. The Memory Hierarchy
  • 9.1. Relocation Example
  • 9.2. The ELF symbol fields
  • 1.1. Abstraction with function pointers
  • 1.2. The Abstraction in include/Linux/virtio. H
  • 1.3. Examples of major and minor numbers
  • 2.1. Using the flags
  • 2.2. Example of warnings when types are not matched
  • 2.3. Floats versus Doubles
  • 2.4. Program to find first set bit
  • 2.5. Examining the Floats
  • 2.6. Analysis of 8.45
  • 3.1. The Memory Ordering
  • 4.1. Getpid () example
  • 4.2. PowerPC system call example
  • 4.3. x86 system call example
  • 5.1. The Stack pointer example
  • 5.2. pstree example
  • 5.3. Zombie example process
  • 5.4. Signals Example
  • 7.1. Struct padding example
  • 7.2. The Stack alignment example
  • 7.3. Page alignment manipulations
  • 7.4. Hello World
  • 7.5. The Function Example
  • 7.6. Compilation Example
  • 7.7. The Assembly Example
  • 7.8. The Readelf Example
  • 7.9. Linking the Example
  • 7.10. The Executable Example
  • 8.1. The ELF Header
  • The ELF Header, as shown by readelf
  • (note: An outside note for ELF magic number
  • 8.4. Investigating the entry point
  • 8.5. The Program Header
  • 8.6. Sections
  • 8.7. Sections
  • 8.8 Sections readelf output
  • 8.9. Sections and Segments
  • Segments of an executable file
  • 8.11. Creating and using a static library
  • 8.12. Example of creating a core dump and using it with GDB
  • 8.13. Example of stripping debugging information into separate files using objcopy
  • 8.14. Examples of using readelf and EU-readelf to examine a coredump
  • 8.15. Example of modinfo output
  • 8.16. Putting module info into sections
  • 8.17. Module symbols in .modinfo sections
  • 8.18. The default linker script
  • 8.19. Disassembley of program startup
  • 8.20. Constructors and Destructors
  • 9.1. Specifying the Dynamic Libraries
  • 9.2. Looking at dynamic libraries
  • 9.checking the program interpreter
  • Relocation as defined by ELF
  • 9.5. Specifying the Dynamic Libraries
  • 9.6. Using the GOT
  • And Relocations against the GOT
  • 9.8.Hello World PLT example
  • 9.9. Hello world main ()
  • 9.10. Hello world sections
  • 9.11. Hello world PLT
  • 9.12. Hello world GOT
  • 9.13. The Dynamic Segment
  • 9.14. Code in the dynamic linker for setting up special values (from libc sysDEps /ia64/dl-machine.h)
  • 9.15. Symbol definition from ELF
  • Examples of symbol bindings
  • 9.17. The Example of the LD_PRELOAD
  • 9.18. Example of symbol versioning