Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux
at v4.20-rc2 159 lines 3.4 kB view raw
1// SPDX-License-Identifier: GPL-2.0 2/* 3 * f2fs IO tracer 4 * 5 * Copyright (c) 2014 Motorola Mobility 6 * Copyright (c) 2014 Jaegeuk Kim <jaegeuk@kernel.org> 7 */ 8#include <linux/fs.h> 9#include <linux/f2fs_fs.h> 10#include <linux/sched.h> 11#include <linux/radix-tree.h> 12 13#include "f2fs.h" 14#include "trace.h" 15 16static RADIX_TREE(pids, GFP_ATOMIC); 17static struct mutex pids_lock; 18static struct last_io_info last_io; 19 20static inline void __print_last_io(void) 21{ 22 if (!last_io.len) 23 return; 24 25 trace_printk("%3x:%3x %4x %-16s %2x %5x %5x %12x %4x\n", 26 last_io.major, last_io.minor, 27 last_io.pid, "----------------", 28 last_io.type, 29 last_io.fio.op, last_io.fio.op_flags, 30 last_io.fio.new_blkaddr, 31 last_io.len); 32 memset(&last_io, 0, sizeof(last_io)); 33} 34 35static int __file_type(struct inode *inode, pid_t pid) 36{ 37 if (f2fs_is_atomic_file(inode)) 38 return __ATOMIC_FILE; 39 else if (f2fs_is_volatile_file(inode)) 40 return __VOLATILE_FILE; 41 else if (S_ISDIR(inode->i_mode)) 42 return __DIR_FILE; 43 else if (inode->i_ino == F2FS_NODE_INO(F2FS_I_SB(inode))) 44 return __NODE_FILE; 45 else if (inode->i_ino == F2FS_META_INO(F2FS_I_SB(inode))) 46 return __META_FILE; 47 else if (pid) 48 return __NORMAL_FILE; 49 else 50 return __MISC_FILE; 51} 52 53void f2fs_trace_pid(struct page *page) 54{ 55 struct inode *inode = page->mapping->host; 56 pid_t pid = task_pid_nr(current); 57 void *p; 58 59 set_page_private(page, (unsigned long)pid); 60 61 if (radix_tree_preload(GFP_NOFS)) 62 return; 63 64 mutex_lock(&pids_lock); 65 p = radix_tree_lookup(&pids, pid); 66 if (p == current) 67 goto out; 68 if (p) 69 radix_tree_delete(&pids, pid); 70 71 f2fs_radix_tree_insert(&pids, pid, current); 72 73 trace_printk("%3x:%3x %4x %-16s\n", 74 MAJOR(inode->i_sb->s_dev), MINOR(inode->i_sb->s_dev), 75 pid, current->comm); 76out: 77 mutex_unlock(&pids_lock); 78 radix_tree_preload_end(); 79} 80 81void f2fs_trace_ios(struct f2fs_io_info *fio, int flush) 82{ 83 struct inode *inode; 84 pid_t pid; 85 int major, minor; 86 87 if (flush) { 88 __print_last_io(); 89 return; 90 } 91 92 inode = fio->page->mapping->host; 93 pid = page_private(fio->page); 94 95 major = MAJOR(inode->i_sb->s_dev); 96 minor = MINOR(inode->i_sb->s_dev); 97 98 if (last_io.major == major && last_io.minor == minor && 99 last_io.pid == pid && 100 last_io.type == __file_type(inode, pid) && 101 last_io.fio.op == fio->op && 102 last_io.fio.op_flags == fio->op_flags && 103 last_io.fio.new_blkaddr + last_io.len == 104 fio->new_blkaddr) { 105 last_io.len++; 106 return; 107 } 108 109 __print_last_io(); 110 111 last_io.major = major; 112 last_io.minor = minor; 113 last_io.pid = pid; 114 last_io.type = __file_type(inode, pid); 115 last_io.fio = *fio; 116 last_io.len = 1; 117 return; 118} 119 120void f2fs_build_trace_ios(void) 121{ 122 mutex_init(&pids_lock); 123} 124 125#define PIDVEC_SIZE 128 126static unsigned int gang_lookup_pids(pid_t *results, unsigned long first_index, 127 unsigned int max_items) 128{ 129 struct radix_tree_iter iter; 130 void **slot; 131 unsigned int ret = 0; 132 133 if (unlikely(!max_items)) 134 return 0; 135 136 radix_tree_for_each_slot(slot, &pids, &iter, first_index) { 137 results[ret] = iter.index; 138 if (++ret == max_items) 139 break; 140 } 141 return ret; 142} 143 144void f2fs_destroy_trace_ios(void) 145{ 146 pid_t pid[PIDVEC_SIZE]; 147 pid_t next_pid = 0; 148 unsigned int found; 149 150 mutex_lock(&pids_lock); 151 while ((found = gang_lookup_pids(pid, next_pid, PIDVEC_SIZE))) { 152 unsigned idx; 153 154 next_pid = pid[found - 1] + 1; 155 for (idx = 0; idx < found; idx++) 156 radix_tree_delete(&pids, pid[idx]); 157 } 158 mutex_unlock(&pids_lock); 159}