Save this video free

ECE344 Fall 2026 (Sec 1) Lec 24 - inodes

Jon Eyolfson · 1:00:30 · Watch on YouTube

Part of University of Toronto ECE 344. See all 22 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Jon Eyolfson explains how Linux inodes combine file metadata with direct and multi-level indirect block pointers, then shows how directories map names to inodes through hard links and symbolic links. He connects these structures to practical Unix behavior, including `ls`, `stat`, timestamps, permissions, setuid programs, and the filesystem cache, with capacity examples ranging from XV6's 268 KiB limit to roughly 64 TiB.

Key takeaways

Chapters

0:00 From Indexed Allocation to Linux Inodes
2:50 Direct and Indirect Pointers Balance Speed and Capacity
11:10 Small-File Optimization and Maximum File Sizes
15:07 Reading `ls -l` and Finding Inode Numbers
19:02 Hard Links, `unlink`, and File Lifetime
27:33 Symbolic Links Store Paths Instead of Sharing Inodes
34:20 Broken Paths, Renames, and Symbolic-Link Loops
40:52 Inode Timestamps and Directory-Entry Changes
46:07 Directories Are Files Containing Name-Inode Pairs
50:29 Inode Metadata, Ownership, and Octal Modes
53:25 Directory Permissions and the Kernel's Access-Check Order
58:14 Umask and Setuid Programs Such as `passwd`
59:30 Filesystem Caching, Writeback, and Sync Calls

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

1:41 I >> All righty. Welcome back to operating

2:53 systems. So today, we get to talk about inodes. Fun. So recall we were talking before about how we store information about a file, how we would describe it. We left off with with indexed allocation where basically we have an array of blocks of the file. So at index zero, that's the first block of that file, whatever the value there would be would be where it is physically on disk and you'd go through like an array. So we discovered we would have a limit on the size of our file. If we only have one index block for our files, even if we had like 8 kilobyte blocks on our disk and only four byte pointers, well, that would still be blocks that can only hold two to the 11

3:41 entries. So in total, the maximum size of file would be 16 megabytes, which is still pretty lame. So what if some of these pointers pointed to blocks of more pointers? What does that sound like? >> Page table? >> Yeah, multi-level page right? Same idea. We don't have that many ideas in this course. We just use them for different things. So, small files, if you have a really small file, you only need one block of pointers. But if you have a much larger file you want to support, well, maybe you have like a two-level structure where one points to instead of just where the information is, where the next index block is, and then you use that and you go through two hops.

4:30 So, that exactly that's basically exactly what an inode is. So, inode on Linux describes all the metadata about a file, like where it lives on disk, and a few other things that we'll go into today,

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Jon Eyolfson.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.