Project 4 Work with a real file system Given: Goals:

Slides:



Advertisements
Similar presentations
Chapter 12: File System Implementation
Advertisements

CS140 Review Session Project 4 – File Systems Samir Selman 02/27/09cs140 Review Session Due Thursday March,11.
Concepts about the file system 2. The disk structure 3. Files in disk – The ext2 FS 4. The Virtual File System (c) 2013, Prof. Jordi Garcia.
Chapter 4 : File Systems What is a file system?
File Systems Examples.
File System Basics Brandon Checketts. Some terminology Superblocks Inodes Journaling Hard links Symbolic links Directory entries.
CSE506: Operating Systems Block Cache. CSE506: Operating Systems Address Space Abstraction Given a file, which physical pages store its data? Each file.
CSE 451: Operating Systems Section 8 Linux buffer cache; design principles.
CSE 451: Operating Systems Section 7 File Systems; Project 3.
File Management Systems
Operating Systems File Systems (in a Day) Ch
File Systems Implementation
1 Administrivia Project 4 due in a week Turnin only, no report Homework 4 due next Wednesday EC Today: Project 4 and file system stuff EC questions?
CS 333 Introduction to Operating Systems Class 18 - File System Performance Jonathan Walpole Computer Science Portland State University.
1 Administrivia Project 4 out today, due next Friday (March 10) Design exercise only Today: Project 4 and file system stuff.
Chapter 3.2 : Virtual Memory
Ceng Operating Systems
6/24/2015B.RamamurthyPage 1 File System B. Ramamurthy.
Project 3: File System Design COS318 Fall Last Time Web Server Extensive use of a file system on server machine without actually worrying about.
7/15/2015B.RamamurthyPage 1 File System B. Ramamurthy.
CS140 Review Session Project 4 – File Systems Varun Arora Based on Vincenzo Di Nicola’s slide 7/16/2015cs140 Review Session1.
I/O Tanenbaum, ch. 5 p. 329 – 427 Silberschatz, ch. 13 p
File System. NET+OS 6 File System Architecture Design Goals File System Layer Design Storage Services Layer Design RAM Services Layer Design Flash Services.
CS 6560 Operating System Design Lecture 13 Finish File Systems Block I/O Layer.
Linux & The File System by Dale Brunner CS430 Spring 2006.
CSCC69: Operating Systems Assignment 3 Review. Assignment Review Implement the file-related system calls – open, close, dup2 – read, write, lseek – chdir,
Disk Access. DISK STRUCTURE Sector: Smallest unit of data transfer from/to disk; 512B 2/4/8 adjacent sectors transferred together: Blocks Read/write heads.
1 File Systems Chapter Files 6.2 Directories 6.3 File system implementation 6.4 Example file systems.
CS 346 – Chapter 12 File systems –Structure –Information to maintain –How to access a file –Directory implementation –Disk allocation methods  efficient.
Files CS Spring Overview Example: FAT File System File Organization File System Organization –File Directories and File Sharing –Record Blocking.
SIMULATED UNIX FILE SYSTEM Implementation in C Tarek Youssef Bipanjit Sihra.
CSE 451: Operating Systems
1 Chapter 3.2 : Virtual Memory What is virtual memory? What is virtual memory? Virtual memory management schemes Virtual memory management schemes Paging.
File System Implementation Chapter 12. File system Organization Application programs Application programs Logical file system Logical file system manages.
1 Interface Two most common types of interfaces –SCSI: Small Computer Systems Interface (servers and high-performance desktops) –IDE/ATA: Integrated Drive.
File System Implementation
File Systems Security File Systems Implementation.
Files & File system. A Possible File System Layout Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
Project 6 Unix File System. Administrative No Design Review – A design document instead 2-3 pages max No collaboration with peers – Piazza is for clarifications.
Linux+ Guide to Linux Certification, Third Edition
Disk & File System Management Disk Allocation Free Space Management Directory Structure Naming Disk Scheduling Protection CSE 331 Operating Systems Design.
UNIX File System (UFS) Chapter Five.
Jeff's Filesystem Papers Review Part I. Review of "Design and Implementation of The Second Extended Filesystem"
Linux File system Implementations
CS 3204 Operating Systems Godmar Back Lecture 21.
11.1 Silberschatz, Galvin and Gagne ©2005 Operating System Principles 11.5 Free-Space Management Bit vector (n blocks) … 012n-1 bit[i] =  1  block[i]
Linux file systems Name: Peijun Li Student ID: Prof. Morteza Anvari.
CSCC69: Operating Systems Tutorial 10. Hints on testing Assignment 3 How to test tlb replacement algorithms? – Write a program that creates an array larger.
Lecture 02 File and File system. Topics Describe the layout of a Linux file system Display and set paths Describe the most important files, including.
Fall 2013 SILICON VALLEY UNIVERSITY CONFIDENTIAL 1 Introduction to Embedded Systems Dr. Jerry Shiao, Silicon Valley University.
CS140 Project 4 Due Thursday March 10th Slides adapted from Samir Selman’s Kiyoshi Shikuma.
1 The File System. 2 Linux File System Linux supports 15 file systems –ext, ext2, xia, minix, umsdos, msdos, vfat, proc, smb, ncp, iso9660, sysv, hpfs,
ECE 456 Computer Architecture Lecture #9 – Input/Output Instructor: Dr. Honggang Wang Fall 2013.
1 Reminders Project 3 due tomorrow in lecture turnin + report Today’s office hours in 006 changed to 5:30-6:30 Project 4 out soon, due last day of classes.
Lecture Topics: 11/22 HW 7 File systems –block allocation Unix and NT –disk scheduling –file caches –RAID.
1 Section 8: File Systems Project 3. 2 Questions?
1 Administrivia ● Project 2b (parts 4, 5, 6) due tomorrow at 11:59 pm – Questions? ● Project 3 Light to be released tomorrow ● Project 3 Full will be same.
1 Section 9: Project 3 – The Buffer Cache Network File Systems.
Getting Started with Linux
File-System Management
Today topics: File System Implementation
Chapter 11: File System Implementation
Chapter 12: File System Implementation
Main Memory Management
Operation System Program 4
File System B. Ramamurthy B.Ramamurthy 11/27/2018.
CSE 451 Fall 2003 Section 11/20/2003.
Computer Science and Engineering Four Hundred and Fifty One
Reminders Project 4 due Dec 10 If you used your late pass on HW5
Week 9 March 4, 2004 Adrienne Noble.
Presentation transcript:

Project 4 Work with a real file system Given: Goals: cse451fs: simplified file system for Linux Goals: Understand how it works Modify implementation to: Increase maximum size of files (currently 13KB) Allow for longer file names (currently 30 chars)

Linux FS layers User apps VFS Buffer cache Disk drivers  Common FS interface cse451fs ext2 ext3 vfat Buffer cache  $ for disk blocks Disk drivers

File systems in Linux Layered on top of a block device Device provides a big array of blocks Blocks are cached in the buffer cache Implement a standard interface file_operations read/write/seek files; read directory inode_operations create / lookup / unlink / mkdir / rmdir / rename super_operations read/write inodes address_space_operations readpage/writepage for memory-mapped IO file_system_operations read in superblock

Project 4 Setup Build a kernel module for cse451fs (and a kernel supporting cse451fs) Transfer it to VMware On VMware, use the virtual disk drive to test your file system. load cse451fs Make a file system using (modified) mkfs tool mount, test Step 1: try this procedure with given code Step 2: read cse451fs.h, then dir.c Need to change this? Or let them use the ramdisk?

cse451fs disk structure Superblock: tells where all other things are Contains inode map: Bit array, tracks which inodes are currently in use E.g. for 3 dirs + 4 files, need 7 inodes Data map: Bit array, tracks which data blocks are in use

cse451fs structure 1 1 1 85 4008 struct cse451_super_block { 1365 __u16 s_nNumInodes; // inode map is tail of superblock 2 __u16 s_nDataMapStart; // block # of first data map block 1 __u32 s_nDataMapBlocks; // data map size, in blocks 3 __u32 s_nInodeStart; // block # of first inode block 85 __u32 s_nNumInodeBlocks; // number of blocks of inodes 88 __u32 s_nDataBlocksStart; // block # of first data block 4008 __u32 s_nDataBlocks; // number of blocks of data 7 __u32 s_nBusyInodes; // number of inodes in use 0x451f __u16 s_magic; // magic number unsigned long s_imap; // name for inode map }; Sample values for a 4MB disk with 4 files and 3 dirs using 1K blocks

Inode structure Inode size? Multiple inodes per block! #define CSE451_NUMDATAPTRS 13 struct cse451_inode { __u16 i_mode;  determines if file or dir __u16 i_nlinks; (+ protection) __u16 i_uid; __u16 i_gid; time_t i_atime; <- the most recent access time time_t i_mtime; <- the most recent modification time time_t i_ctime; <- creation time __u32 i_filesize; __u32 i_datablocks[CSE451_NUMDATAPTRS]; }; Inode size? Multiple inodes per block! How many for 1K block? mkfs decides how many inodes to create mk451fs.c : create an inode for every three data blocks

Data blocks Blocks for regular files contain file data Blocks for directories contain: #define CSE451_MAXDIRNAMELENGTH 30 struct cse451_dir_entry { __u16 inode; char name[CSE451_MAXDIRNAMELENGTH]; }; Data block for / directory containing: . .. etc bin What’s this dir’s inode number? What is the “file size” field in this dir’s inode? Directory block for / Entry Field Value Inode 1 Name “.” “..” 2 “etc” 3 “bin” 4

Sample data block usage For a 4MB file system with 1KB blocks / etc passwd fstab bin sh date File/Directory Size Data Blocks / 4 entries + 1 null entry 1 /etc /bin /etc/passwd 1024 bytes /etc/fstab 100 bytes /bin/sh 10,000 bytes 10 /bin/date 5,000 bytes 5 Total: 20

Project 4 requirements Increasing maximum size of files Be efficient for small files but allow large files Changing constant (=13) is not enough. Come up with a better design/structure for locating data blocks. Indirect blocks? Don’t have to support arbitrarily large files But support at least 256KB for full credit Allow for longer file names Be efficient for short files names but allow large file names Again, don’t just change the constant

Approaches for longer file names Store long names in a separate data block, and keep a pointer to that in the directory entry. Short names can be stored as they are. Recommended Combine multiple fixed-length dir entries into a single long dir entry (win95) It is easier if the entries are adjacent. Put a length field in the dir entry and store variable length strings need to make sure that when reading a directory, that you are positioned at the beginning of an entry.

Getting started with the code Understand the source of the limits in the existing implementation Look at the code that manipulates dir entries mkfs code dir.c in the file system source code Longer file names: The code for will largely be in dir.c: cse451_add_entry() and cse451_find_entry() In mkfs, change how the first two entries (for “.” and “..”) are stored Bigger files: super.c:get_block() References to i_datablock[] array in an inode will have to change

VFS vs cse451fs Don’t conflate VFS structures and cse451fs structures! inodes, superblocks E.g., there are “two” inodes: VFS struct inode Generic inode used in Linux source (works for any FS) Lives in memory cse451 struct cse451_inode Actual inode representation on disk inode.c:cse451_read_inode converts from cse451_inode to struct inode Copies over mode, size, etc Copies over i_datablocks[] to struct inode’s generic_ip field (which will now be used as type cse451_inode_info) inode.c:cse451_write_inode converts the other way

Linux Buffer Manager Code To manipulate disk blocks, you need to go through the buffer cache include/linux/buffer_head.h fs/buffer.c Linux buffer cache fundamentals: blocks are represented by buffer_heads Just another data structure Actual data is in buffer_head->b_data For a given disk block, buffer manager could be: Complete unaware of it no buffer_head exists, block not in memory Aware of block information buffer_head exists, but block data (b_data) not in memory Aware of block information and data Both the buffer_head and its b_data are valid (“$ hit”)

Accessing blocks To read a block, FS uses sb_bread(…): Find the corresponding buffer_head Create if doesn’t exist Make sure the data is in memory (read from disk if necessary) To write a block: mark_buffer_dirty() + brelse() - mark buffer as changed and release to kernel (which does the writing)

Some buffer manager functions cse451_bread(pbh, inode, block, create) Get the buffer_head for the given disk block, ensuring that the data is in memory and ready for use. Increments ref count; always pair with a brelse. cse451_getblk(pbh, inode, block, create) Get the buffer_head for the given disk block. Does not guarantee anything about the state of the actual data. Increments ref count; always pair with a brelse. Zeros out new blocks (required for security). brelse(bh) Decrement the ref. count of the given buffer. mark_buffer_dirty(bh) Mark the buffer modified, meaning needs to be written to disk at some point. mark_buffer_uptodate(bh) Indicate that the data pointed to by bh is valid.

Hints Learn how to use sb_bread/brelse and other buffer cache stuff by looking at provided code All printk messages stored in /var/log/messages Can view to examine long debug outputs Q: “It is extremely frustrating not to be able to read debug messages because they scroll off screen in vmware so quickly :(” A: Use Shift-pageup and Shift-pagedown Q: “How does ls get its entries?” dir.c:readdir()

A gcc warning gcc might insert extra space into structs How big do you think this is? struct test { char a; int b; } Why is this a problem? What if test represents something you want on disk? e.g. directory entries Discrepancy between the disk layout and memory layout Fix: struct test2 {      char a;      int b; } __attribute__((packed)); sizeof(test2) is now 5

More hints Some stuff in linux kernel is limited to 256 chars e.g. VFS, ls Be careful when testing long filenames! dd is useful for creating large test files dd if=/dev/zero of=200k bs=1024 count=200 df is useful to check you’re freeing everything correctly

More & more hints Provided mkfs has useful functions Dump data map Print inode contents/map Print superblock Use lots of existing programs to test cp, tar, mv, diff … Recursive option is useful to test file & directory routines in a single execution Be aware of buffer cache! Change to the file system may not be reflected instantly