11e51764aSArtem Bityutskiy /* 21e51764aSArtem Bityutskiy * This file is part of UBIFS. 31e51764aSArtem Bityutskiy * 41e51764aSArtem Bityutskiy * Copyright (C) 2006-2008 Nokia Corporation 51e51764aSArtem Bityutskiy * 61e51764aSArtem Bityutskiy * This program is free software; you can redistribute it and/or modify it 71e51764aSArtem Bityutskiy * under the terms of the GNU General Public License version 2 as published by 81e51764aSArtem Bityutskiy * the Free Software Foundation. 91e51764aSArtem Bityutskiy * 101e51764aSArtem Bityutskiy * This program is distributed in the hope that it will be useful, but WITHOUT 111e51764aSArtem Bityutskiy * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 121e51764aSArtem Bityutskiy * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for 131e51764aSArtem Bityutskiy * more details. 141e51764aSArtem Bityutskiy * 151e51764aSArtem Bityutskiy * You should have received a copy of the GNU General Public License along with 161e51764aSArtem Bityutskiy * this program; if not, write to the Free Software Foundation, Inc., 51 171e51764aSArtem Bityutskiy * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 181e51764aSArtem Bityutskiy * 191e51764aSArtem Bityutskiy * Authors: Artem Bityutskiy (Битюцкий Артём) 201e51764aSArtem Bityutskiy * Adrian Hunter 211e51764aSArtem Bityutskiy */ 221e51764aSArtem Bityutskiy 231e51764aSArtem Bityutskiy #ifndef __UBIFS_H__ 241e51764aSArtem Bityutskiy #define __UBIFS_H__ 251e51764aSArtem Bityutskiy 261e51764aSArtem Bityutskiy #include <asm/div64.h> 271e51764aSArtem Bityutskiy #include <linux/statfs.h> 281e51764aSArtem Bityutskiy #include <linux/fs.h> 291e51764aSArtem Bityutskiy #include <linux/err.h> 301e51764aSArtem Bityutskiy #include <linux/sched.h> 315a0e3ad6STejun Heo #include <linux/slab.h> 321e51764aSArtem Bityutskiy #include <linux/vmalloc.h> 331e51764aSArtem Bityutskiy #include <linux/spinlock.h> 341e51764aSArtem Bityutskiy #include <linux/mutex.h> 351e51764aSArtem Bityutskiy #include <linux/rwsem.h> 361e51764aSArtem Bityutskiy #include <linux/mtd/ubi.h> 371e51764aSArtem Bityutskiy #include <linux/pagemap.h> 381e51764aSArtem Bityutskiy #include <linux/backing-dev.h> 39d7f0b70dSSubodh Nijsure #include <linux/security.h> 402b88fc21SAndreas Gruenbacher #include <linux/xattr.h> 411e51764aSArtem Bityutskiy #include "ubifs-media.h" 421e51764aSArtem Bityutskiy 431e51764aSArtem Bityutskiy /* Version of this UBIFS implementation */ 441e51764aSArtem Bityutskiy #define UBIFS_VERSION 1 451e51764aSArtem Bityutskiy 461e51764aSArtem Bityutskiy /* UBIFS file system VFS magic number */ 471e51764aSArtem Bityutskiy #define UBIFS_SUPER_MAGIC 0x24051905 481e51764aSArtem Bityutskiy 491e51764aSArtem Bityutskiy /* Number of UBIFS blocks per VFS page */ 5009cbfeafSKirill A. Shutemov #define UBIFS_BLOCKS_PER_PAGE (PAGE_SIZE / UBIFS_BLOCK_SIZE) 5109cbfeafSKirill A. Shutemov #define UBIFS_BLOCKS_PER_PAGE_SHIFT (PAGE_SHIFT - UBIFS_BLOCK_SHIFT) 521e51764aSArtem Bityutskiy 531e51764aSArtem Bityutskiy /* "File system end of life" sequence number watermark */ 541e51764aSArtem Bityutskiy #define SQNUM_WARN_WATERMARK 0xFFFFFFFF00000000ULL 551e51764aSArtem Bityutskiy #define SQNUM_WATERMARK 0xFFFFFFFFFF000000ULL 561e51764aSArtem Bityutskiy 57af14a1adSArtem Bityutskiy /* 58af14a1adSArtem Bityutskiy * Minimum amount of LEBs reserved for the index. At present the index needs at 59af14a1adSArtem Bityutskiy * least 2 LEBs: one for the index head and one for in-the-gaps method (which 60af14a1adSArtem Bityutskiy * currently does not cater for the index head and so excludes it from 61af14a1adSArtem Bityutskiy * consideration). 62af14a1adSArtem Bityutskiy */ 63af14a1adSArtem Bityutskiy #define MIN_INDEX_LEBS 2 64af14a1adSArtem Bityutskiy 651e51764aSArtem Bityutskiy /* Minimum amount of data UBIFS writes to the flash */ 661e51764aSArtem Bityutskiy #define MIN_WRITE_SZ (UBIFS_DATA_NODE_SZ + 8) 671e51764aSArtem Bityutskiy 681e51764aSArtem Bityutskiy /* 691e51764aSArtem Bityutskiy * Currently we do not support inode number overlapping and re-using, so this 701e51764aSArtem Bityutskiy * watermark defines dangerous inode number level. This should be fixed later, 711e51764aSArtem Bityutskiy * although it is difficult to exceed current limit. Another option is to use 721e51764aSArtem Bityutskiy * 64-bit inode numbers, but this means more overhead. 731e51764aSArtem Bityutskiy */ 741e51764aSArtem Bityutskiy #define INUM_WARN_WATERMARK 0xFFF00000 751e51764aSArtem Bityutskiy #define INUM_WATERMARK 0xFFFFFF00 761e51764aSArtem Bityutskiy 771e51764aSArtem Bityutskiy /* Maximum number of entries in each LPT (LEB category) heap */ 781e51764aSArtem Bityutskiy #define LPT_HEAP_SZ 256 791e51764aSArtem Bityutskiy 801e51764aSArtem Bityutskiy /* 811e51764aSArtem Bityutskiy * Background thread name pattern. The numbers are UBI device and volume 821e51764aSArtem Bityutskiy * numbers. 831e51764aSArtem Bityutskiy */ 841e51764aSArtem Bityutskiy #define BGT_NAME_PATTERN "ubifs_bgt%d_%d" 851e51764aSArtem Bityutskiy 861e51764aSArtem Bityutskiy /* Maximum possible inode number (only 32-bit inodes are supported now) */ 871e51764aSArtem Bityutskiy #define MAX_INUM 0xFFFFFFFF 881e51764aSArtem Bityutskiy 891e51764aSArtem Bityutskiy /* Number of non-data journal heads */ 901e51764aSArtem Bityutskiy #define NONDATA_JHEADS_CNT 2 911e51764aSArtem Bityutskiy 92d6d14009SArtem Bityutskiy /* Shorter names for journal head numbers for internal usage */ 93d6d14009SArtem Bityutskiy #define GCHD UBIFS_GC_HEAD 94d6d14009SArtem Bityutskiy #define BASEHD UBIFS_BASE_HEAD 95d6d14009SArtem Bityutskiy #define DATAHD UBIFS_DATA_HEAD 961e51764aSArtem Bityutskiy 971e51764aSArtem Bityutskiy /* 'No change' value for 'ubifs_change_lp()' */ 981e51764aSArtem Bityutskiy #define LPROPS_NC 0x80000001 991e51764aSArtem Bityutskiy 1001e51764aSArtem Bityutskiy /* 1011e51764aSArtem Bityutskiy * There is no notion of truncation key because truncation nodes do not exist 1021e51764aSArtem Bityutskiy * in TNC. However, when replaying, it is handy to introduce fake "truncation" 1031e51764aSArtem Bityutskiy * keys for truncation nodes because the code becomes simpler. So we define 1041e51764aSArtem Bityutskiy * %UBIFS_TRUN_KEY type. 105ba2f48f7SArtem Bityutskiy * 106ba2f48f7SArtem Bityutskiy * But otherwise, out of the journal reply scope, the truncation keys are 107ba2f48f7SArtem Bityutskiy * invalid. 1081e51764aSArtem Bityutskiy */ 1091e51764aSArtem Bityutskiy #define UBIFS_TRUN_KEY UBIFS_KEY_TYPES_CNT 110ba2f48f7SArtem Bityutskiy #define UBIFS_INVALID_KEY UBIFS_KEY_TYPES_CNT 1111e51764aSArtem Bityutskiy 1121e51764aSArtem Bityutskiy /* 1131e51764aSArtem Bityutskiy * How much a directory entry/extended attribute entry adds to the parent/host 1141e51764aSArtem Bityutskiy * inode. 1151e51764aSArtem Bityutskiy */ 1161e51764aSArtem Bityutskiy #define CALC_DENT_SIZE(name_len) ALIGN(UBIFS_DENT_NODE_SZ + (name_len) + 1, 8) 1171e51764aSArtem Bityutskiy 1181e51764aSArtem Bityutskiy /* How much an extended attribute adds to the host inode */ 1191e51764aSArtem Bityutskiy #define CALC_XATTR_BYTES(data_len) ALIGN(UBIFS_INO_NODE_SZ + (data_len) + 1, 8) 1201e51764aSArtem Bityutskiy 1211e51764aSArtem Bityutskiy /* 1221e51764aSArtem Bityutskiy * Znodes which were not touched for 'OLD_ZNODE_AGE' seconds are considered 1231e51764aSArtem Bityutskiy * "old", and znode which were touched last 'YOUNG_ZNODE_AGE' seconds ago are 1241e51764aSArtem Bityutskiy * considered "young". This is used by shrinker when selecting znode to trim 1251e51764aSArtem Bityutskiy * off. 1261e51764aSArtem Bityutskiy */ 1271e51764aSArtem Bityutskiy #define OLD_ZNODE_AGE 20 1281e51764aSArtem Bityutskiy #define YOUNG_ZNODE_AGE 5 1291e51764aSArtem Bityutskiy 1301e51764aSArtem Bityutskiy /* 1311e51764aSArtem Bityutskiy * Some compressors, like LZO, may end up with more data then the input buffer. 1321e51764aSArtem Bityutskiy * So UBIFS always allocates larger output buffer, to be sure the compressor 1331e51764aSArtem Bityutskiy * will not corrupt memory in case of worst case compression. 1341e51764aSArtem Bityutskiy */ 1351e51764aSArtem Bityutskiy #define WORST_COMPR_FACTOR 2 1361e51764aSArtem Bityutskiy 137d882962fSMatthew L. Creech /* 138d3f9db00SYannick Guerrini * How much memory is needed for a buffer where we compress a data node. 139d882962fSMatthew L. Creech */ 140d882962fSMatthew L. Creech #define COMPRESSED_DATA_NODE_BUF_SZ \ 141d882962fSMatthew L. Creech (UBIFS_DATA_NODE_SZ + UBIFS_BLOCK_SIZE * WORST_COMPR_FACTOR) 142d882962fSMatthew L. Creech 1431e51764aSArtem Bityutskiy /* Maximum expected tree height for use by bottom_up_buf */ 1441e51764aSArtem Bityutskiy #define BOTTOM_UP_HEIGHT 64 1451e51764aSArtem Bityutskiy 1464793e7c5SAdrian Hunter /* Maximum number of data nodes to bulk-read */ 1474793e7c5SAdrian Hunter #define UBIFS_MAX_BULK_READ 32 1484793e7c5SAdrian Hunter 1491e51764aSArtem Bityutskiy /* 1501e51764aSArtem Bityutskiy * Lockdep classes for UBIFS inode @ui_mutex. 1511e51764aSArtem Bityutskiy */ 1521e51764aSArtem Bityutskiy enum { 1531e51764aSArtem Bityutskiy WB_MUTEX_1 = 0, 1541e51764aSArtem Bityutskiy WB_MUTEX_2 = 1, 1551e51764aSArtem Bityutskiy WB_MUTEX_3 = 2, 1569e0a1fffSRichard Weinberger WB_MUTEX_4 = 3, 1571e51764aSArtem Bityutskiy }; 1581e51764aSArtem Bityutskiy 1591e51764aSArtem Bityutskiy /* 1601e51764aSArtem Bityutskiy * Znode flags (actually, bit numbers which store the flags). 1611e51764aSArtem Bityutskiy * 1621e51764aSArtem Bityutskiy * DIRTY_ZNODE: znode is dirty 1631e51764aSArtem Bityutskiy * COW_ZNODE: znode is being committed and a new instance of this znode has to 1641e51764aSArtem Bityutskiy * be created before changing this znode 1651e51764aSArtem Bityutskiy * OBSOLETE_ZNODE: znode is obsolete, which means it was deleted, but it is 1661e51764aSArtem Bityutskiy * still in the commit list and the ongoing commit operation 1671e51764aSArtem Bityutskiy * will commit it, and delete this znode after it is done 1681e51764aSArtem Bityutskiy */ 1691e51764aSArtem Bityutskiy enum { 1701e51764aSArtem Bityutskiy DIRTY_ZNODE = 0, 1711e51764aSArtem Bityutskiy COW_ZNODE = 1, 1721e51764aSArtem Bityutskiy OBSOLETE_ZNODE = 2, 1731e51764aSArtem Bityutskiy }; 1741e51764aSArtem Bityutskiy 1751e51764aSArtem Bityutskiy /* 1761e51764aSArtem Bityutskiy * Commit states. 1771e51764aSArtem Bityutskiy * 1781e51764aSArtem Bityutskiy * COMMIT_RESTING: commit is not wanted 1791e51764aSArtem Bityutskiy * COMMIT_BACKGROUND: background commit has been requested 1801e51764aSArtem Bityutskiy * COMMIT_REQUIRED: commit is required 1811e51764aSArtem Bityutskiy * COMMIT_RUNNING_BACKGROUND: background commit is running 1821e51764aSArtem Bityutskiy * COMMIT_RUNNING_REQUIRED: commit is running and it is required 1831e51764aSArtem Bityutskiy * COMMIT_BROKEN: commit failed 1841e51764aSArtem Bityutskiy */ 1851e51764aSArtem Bityutskiy enum { 1861e51764aSArtem Bityutskiy COMMIT_RESTING = 0, 1871e51764aSArtem Bityutskiy COMMIT_BACKGROUND, 1881e51764aSArtem Bityutskiy COMMIT_REQUIRED, 1891e51764aSArtem Bityutskiy COMMIT_RUNNING_BACKGROUND, 1901e51764aSArtem Bityutskiy COMMIT_RUNNING_REQUIRED, 1911e51764aSArtem Bityutskiy COMMIT_BROKEN, 1921e51764aSArtem Bityutskiy }; 1931e51764aSArtem Bityutskiy 1941e51764aSArtem Bityutskiy /* 1951e51764aSArtem Bityutskiy * 'ubifs_scan_a_node()' return values. 1961e51764aSArtem Bityutskiy * 1971e51764aSArtem Bityutskiy * SCANNED_GARBAGE: scanned garbage 1981e51764aSArtem Bityutskiy * SCANNED_EMPTY_SPACE: scanned empty space 1991e51764aSArtem Bityutskiy * SCANNED_A_NODE: scanned a valid node 2001e51764aSArtem Bityutskiy * SCANNED_A_CORRUPT_NODE: scanned a corrupted node 2011e51764aSArtem Bityutskiy * SCANNED_A_BAD_PAD_NODE: scanned a padding node with invalid pad length 2021e51764aSArtem Bityutskiy * 2031e51764aSArtem Bityutskiy * Greater than zero means: 'scanned that number of padding bytes' 2041e51764aSArtem Bityutskiy */ 2051e51764aSArtem Bityutskiy enum { 2061e51764aSArtem Bityutskiy SCANNED_GARBAGE = 0, 2071e51764aSArtem Bityutskiy SCANNED_EMPTY_SPACE = -1, 2081e51764aSArtem Bityutskiy SCANNED_A_NODE = -2, 2091e51764aSArtem Bityutskiy SCANNED_A_CORRUPT_NODE = -3, 2101e51764aSArtem Bityutskiy SCANNED_A_BAD_PAD_NODE = -4, 2111e51764aSArtem Bityutskiy }; 2121e51764aSArtem Bityutskiy 2131e51764aSArtem Bityutskiy /* 2141e51764aSArtem Bityutskiy * LPT cnode flag bits. 2151e51764aSArtem Bityutskiy * 2161e51764aSArtem Bityutskiy * DIRTY_CNODE: cnode is dirty 2171e51764aSArtem Bityutskiy * OBSOLETE_CNODE: cnode is being committed and has been copied (or deleted), 2181e51764aSArtem Bityutskiy * so it can (and must) be freed when the commit is finished 21937662447SArtem Bityutskiy * COW_CNODE: cnode is being committed and must be copied before writing 2201e51764aSArtem Bityutskiy */ 2211e51764aSArtem Bityutskiy enum { 2221e51764aSArtem Bityutskiy DIRTY_CNODE = 0, 22337662447SArtem Bityutskiy OBSOLETE_CNODE = 1, 22437662447SArtem Bityutskiy COW_CNODE = 2, 2251e51764aSArtem Bityutskiy }; 2261e51764aSArtem Bityutskiy 2271e51764aSArtem Bityutskiy /* 2281e51764aSArtem Bityutskiy * Dirty flag bits (lpt_drty_flgs) for LPT special nodes. 2291e51764aSArtem Bityutskiy * 2301e51764aSArtem Bityutskiy * LTAB_DIRTY: ltab node is dirty 2311e51764aSArtem Bityutskiy * LSAVE_DIRTY: lsave node is dirty 2321e51764aSArtem Bityutskiy */ 2331e51764aSArtem Bityutskiy enum { 2341e51764aSArtem Bityutskiy LTAB_DIRTY = 1, 2351e51764aSArtem Bityutskiy LSAVE_DIRTY = 2, 2361e51764aSArtem Bityutskiy }; 2371e51764aSArtem Bityutskiy 2381e51764aSArtem Bityutskiy /* 2391e51764aSArtem Bityutskiy * Return codes used by the garbage collector. 2401e51764aSArtem Bityutskiy * @LEB_FREED: the logical eraseblock was freed and is ready to use 2411e51764aSArtem Bityutskiy * @LEB_FREED_IDX: indexing LEB was freed and can be used only after the commit 2421e51764aSArtem Bityutskiy * @LEB_RETAINED: the logical eraseblock was freed and retained for GC purposes 2431e51764aSArtem Bityutskiy */ 2441e51764aSArtem Bityutskiy enum { 2451e51764aSArtem Bityutskiy LEB_FREED, 2461e51764aSArtem Bityutskiy LEB_FREED_IDX, 2471e51764aSArtem Bityutskiy LEB_RETAINED, 2481e51764aSArtem Bityutskiy }; 2491e51764aSArtem Bityutskiy 2501e51764aSArtem Bityutskiy /** 2511e51764aSArtem Bityutskiy * struct ubifs_old_idx - index node obsoleted since last commit start. 2521e51764aSArtem Bityutskiy * @rb: rb-tree node 2531e51764aSArtem Bityutskiy * @lnum: LEB number of obsoleted index node 2541e51764aSArtem Bityutskiy * @offs: offset of obsoleted index node 2551e51764aSArtem Bityutskiy */ 2561e51764aSArtem Bityutskiy struct ubifs_old_idx { 2571e51764aSArtem Bityutskiy struct rb_node rb; 2581e51764aSArtem Bityutskiy int lnum; 2591e51764aSArtem Bityutskiy int offs; 2601e51764aSArtem Bityutskiy }; 2611e51764aSArtem Bityutskiy 2621e51764aSArtem Bityutskiy /* The below union makes it easier to deal with keys */ 2631e51764aSArtem Bityutskiy union ubifs_key { 2647ca58badSArtem Bityutskiy uint8_t u8[UBIFS_SK_LEN]; 2657ca58badSArtem Bityutskiy uint32_t u32[UBIFS_SK_LEN/4]; 2667ca58badSArtem Bityutskiy uint64_t u64[UBIFS_SK_LEN/8]; 2677ca58badSArtem Bityutskiy __le32 j32[UBIFS_SK_LEN/4]; 2681e51764aSArtem Bityutskiy }; 2691e51764aSArtem Bityutskiy 2701e51764aSArtem Bityutskiy /** 2711e51764aSArtem Bityutskiy * struct ubifs_scan_node - UBIFS scanned node information. 2721e51764aSArtem Bityutskiy * @list: list of scanned nodes 2731e51764aSArtem Bityutskiy * @key: key of node scanned (if it has one) 2741e51764aSArtem Bityutskiy * @sqnum: sequence number 2751e51764aSArtem Bityutskiy * @type: type of node scanned 2761e51764aSArtem Bityutskiy * @offs: offset with LEB of node scanned 2771e51764aSArtem Bityutskiy * @len: length of node scanned 2781e51764aSArtem Bityutskiy * @node: raw node 2791e51764aSArtem Bityutskiy */ 2801e51764aSArtem Bityutskiy struct ubifs_scan_node { 2811e51764aSArtem Bityutskiy struct list_head list; 2821e51764aSArtem Bityutskiy union ubifs_key key; 2831e51764aSArtem Bityutskiy unsigned long long sqnum; 2841e51764aSArtem Bityutskiy int type; 2851e51764aSArtem Bityutskiy int offs; 2861e51764aSArtem Bityutskiy int len; 2871e51764aSArtem Bityutskiy void *node; 2881e51764aSArtem Bityutskiy }; 2891e51764aSArtem Bityutskiy 2901e51764aSArtem Bityutskiy /** 2911e51764aSArtem Bityutskiy * struct ubifs_scan_leb - UBIFS scanned LEB information. 2921e51764aSArtem Bityutskiy * @lnum: logical eraseblock number 2931e51764aSArtem Bityutskiy * @nodes_cnt: number of nodes scanned 2941e51764aSArtem Bityutskiy * @nodes: list of struct ubifs_scan_node 2951e51764aSArtem Bityutskiy * @endpt: end point (and therefore the start of empty space) 2961e51764aSArtem Bityutskiy * @buf: buffer containing entire LEB scanned 2971e51764aSArtem Bityutskiy */ 2981e51764aSArtem Bityutskiy struct ubifs_scan_leb { 2991e51764aSArtem Bityutskiy int lnum; 3001e51764aSArtem Bityutskiy int nodes_cnt; 3011e51764aSArtem Bityutskiy struct list_head nodes; 3021e51764aSArtem Bityutskiy int endpt; 3031e51764aSArtem Bityutskiy void *buf; 3041e51764aSArtem Bityutskiy }; 3051e51764aSArtem Bityutskiy 3061e51764aSArtem Bityutskiy /** 3071e51764aSArtem Bityutskiy * struct ubifs_gced_idx_leb - garbage-collected indexing LEB. 3081e51764aSArtem Bityutskiy * @list: list 3091e51764aSArtem Bityutskiy * @lnum: LEB number 3101e51764aSArtem Bityutskiy * @unmap: OK to unmap this LEB 3111e51764aSArtem Bityutskiy * 3121e51764aSArtem Bityutskiy * This data structure is used to temporary store garbage-collected indexing 3131e51764aSArtem Bityutskiy * LEBs - they are not released immediately, but only after the next commit. 3141e51764aSArtem Bityutskiy * This is needed to guarantee recoverability. 3151e51764aSArtem Bityutskiy */ 3161e51764aSArtem Bityutskiy struct ubifs_gced_idx_leb { 3171e51764aSArtem Bityutskiy struct list_head list; 3181e51764aSArtem Bityutskiy int lnum; 3191e51764aSArtem Bityutskiy int unmap; 3201e51764aSArtem Bityutskiy }; 3211e51764aSArtem Bityutskiy 3221e51764aSArtem Bityutskiy /** 3231e51764aSArtem Bityutskiy * struct ubifs_inode - UBIFS in-memory inode description. 3241e51764aSArtem Bityutskiy * @vfs_inode: VFS inode description object 3251e51764aSArtem Bityutskiy * @creat_sqnum: sequence number at time of creation 326de94eb55SArtem Bityutskiy * @del_cmtno: commit number corresponding to the time the inode was deleted, 327de94eb55SArtem Bityutskiy * protected by @c->commit_sem; 3281e51764aSArtem Bityutskiy * @xattr_size: summarized size of all extended attributes in bytes 3291e51764aSArtem Bityutskiy * @xattr_cnt: count of extended attributes this inode has 3301e51764aSArtem Bityutskiy * @xattr_names: sum of lengths of all extended attribute names belonging to 3311e51764aSArtem Bityutskiy * this inode 3321e51764aSArtem Bityutskiy * @dirty: non-zero if the inode is dirty 3331e51764aSArtem Bityutskiy * @xattr: non-zero if this is an extended attribute inode 334625bf371SArtem Bityutskiy * @bulk_read: non-zero if bulk-read should be used 3351e51764aSArtem Bityutskiy * @ui_mutex: serializes inode write-back with the rest of VFS operations, 3364793e7c5SAdrian Hunter * serializes "clean <-> dirty" state changes, serializes bulk-read, 337ba60ecabSArtem Bityutskiy * protects @dirty, @bulk_read, @ui_size, and @xattr_size 3381e51764aSArtem Bityutskiy * @ui_lock: protects @synced_i_size 3391e51764aSArtem Bityutskiy * @synced_i_size: synchronized size of inode, i.e. the value of inode size 3401e51764aSArtem Bityutskiy * currently stored on the flash; used only for regular file 3411e51764aSArtem Bityutskiy * inodes 3421e51764aSArtem Bityutskiy * @ui_size: inode size used by UBIFS when writing to flash 3431e51764aSArtem Bityutskiy * @flags: inode flags (@UBIFS_COMPR_FL, etc) 3441e51764aSArtem Bityutskiy * @compr_type: default compression type used for this inode 3454793e7c5SAdrian Hunter * @last_page_read: page number of last page read (for bulk read) 3464793e7c5SAdrian Hunter * @read_in_a_row: number of consecutive pages read in a row (for bulk read) 3471e51764aSArtem Bityutskiy * @data_len: length of the data attached to the inode 3481e51764aSArtem Bityutskiy * @data: inode's data 3491e51764aSArtem Bityutskiy * 3501e51764aSArtem Bityutskiy * @ui_mutex exists for two main reasons. At first it prevents inodes from 3511e51764aSArtem Bityutskiy * being written back while UBIFS changing them, being in the middle of an VFS 3521e51764aSArtem Bityutskiy * operation. This way UBIFS makes sure the inode fields are consistent. For 3531e51764aSArtem Bityutskiy * example, in 'ubifs_rename()' we change 3 inodes simultaneously, and 3541e51764aSArtem Bityutskiy * write-back must not write any of them before we have finished. 3551e51764aSArtem Bityutskiy * 3561e51764aSArtem Bityutskiy * The second reason is budgeting - UBIFS has to budget all operations. If an 3571e51764aSArtem Bityutskiy * operation is going to mark an inode dirty, it has to allocate budget for 3581e51764aSArtem Bityutskiy * this. It cannot just mark it dirty because there is no guarantee there will 3591e51764aSArtem Bityutskiy * be enough flash space to write the inode back later. This means UBIFS has 3601e51764aSArtem Bityutskiy * to have full control over inode "clean <-> dirty" transitions (and pages 3611e51764aSArtem Bityutskiy * actually). But unfortunately, VFS marks inodes dirty in many places, and it 3621e51764aSArtem Bityutskiy * does not ask the file-system if it is allowed to do so (there is a notifier, 3631e51764aSArtem Bityutskiy * but it is not enough), i.e., there is no mechanism to synchronize with this. 3641e51764aSArtem Bityutskiy * So UBIFS has its own inode dirty flag and its own mutex to serialize 3651e51764aSArtem Bityutskiy * "clean <-> dirty" transitions. 3661e51764aSArtem Bityutskiy * 3671e51764aSArtem Bityutskiy * The @synced_i_size field is used to make sure we never write pages which are 3681e51764aSArtem Bityutskiy * beyond last synchronized inode size. See 'ubifs_writepage()' for more 3691e51764aSArtem Bityutskiy * information. 3701e51764aSArtem Bityutskiy * 3711e51764aSArtem Bityutskiy * The @ui_size is a "shadow" variable for @inode->i_size and UBIFS uses 3721e51764aSArtem Bityutskiy * @ui_size instead of @inode->i_size. The reason for this is that UBIFS cannot 3731e51764aSArtem Bityutskiy * make sure @inode->i_size is always changed under @ui_mutex, because it 374c4361570SArtem Bityutskiy * cannot call 'truncate_setsize()' with @ui_mutex locked, because it would 375c4361570SArtem Bityutskiy * deadlock with 'ubifs_writepage()' (see file.c). All the other inode fields 376c4361570SArtem Bityutskiy * are changed under @ui_mutex, so they do not need "shadow" fields. Note, one 3771e51764aSArtem Bityutskiy * could consider to rework locking and base it on "shadow" fields. 3781e51764aSArtem Bityutskiy */ 3791e51764aSArtem Bityutskiy struct ubifs_inode { 3801e51764aSArtem Bityutskiy struct inode vfs_inode; 3811e51764aSArtem Bityutskiy unsigned long long creat_sqnum; 382de94eb55SArtem Bityutskiy unsigned long long del_cmtno; 3831e51764aSArtem Bityutskiy unsigned int xattr_size; 3841e51764aSArtem Bityutskiy unsigned int xattr_cnt; 3851e51764aSArtem Bityutskiy unsigned int xattr_names; 3861e51764aSArtem Bityutskiy unsigned int dirty:1; 3871e51764aSArtem Bityutskiy unsigned int xattr:1; 388625bf371SArtem Bityutskiy unsigned int bulk_read:1; 389a1dc080cSArtem Bityutskiy unsigned int compr_type:2; 3901e51764aSArtem Bityutskiy struct mutex ui_mutex; 3911e51764aSArtem Bityutskiy spinlock_t ui_lock; 3921e51764aSArtem Bityutskiy loff_t synced_i_size; 3931e51764aSArtem Bityutskiy loff_t ui_size; 3941e51764aSArtem Bityutskiy int flags; 3954793e7c5SAdrian Hunter pgoff_t last_page_read; 3964793e7c5SAdrian Hunter pgoff_t read_in_a_row; 3971e51764aSArtem Bityutskiy int data_len; 3981e51764aSArtem Bityutskiy void *data; 3991e51764aSArtem Bityutskiy }; 4001e51764aSArtem Bityutskiy 4011e51764aSArtem Bityutskiy /** 4021e51764aSArtem Bityutskiy * struct ubifs_unclean_leb - records a LEB recovered under read-only mode. 4031e51764aSArtem Bityutskiy * @list: list 4041e51764aSArtem Bityutskiy * @lnum: LEB number of recovered LEB 4051e51764aSArtem Bityutskiy * @endpt: offset where recovery ended 4061e51764aSArtem Bityutskiy * 4071e51764aSArtem Bityutskiy * This structure records a LEB identified during recovery that needs to be 4081e51764aSArtem Bityutskiy * cleaned but was not because UBIFS was mounted read-only. The information 4091e51764aSArtem Bityutskiy * is used to clean the LEB when remounting to read-write mode. 4101e51764aSArtem Bityutskiy */ 4111e51764aSArtem Bityutskiy struct ubifs_unclean_leb { 4121e51764aSArtem Bityutskiy struct list_head list; 4131e51764aSArtem Bityutskiy int lnum; 4141e51764aSArtem Bityutskiy int endpt; 4151e51764aSArtem Bityutskiy }; 4161e51764aSArtem Bityutskiy 4171e51764aSArtem Bityutskiy /* 4181e51764aSArtem Bityutskiy * LEB properties flags. 4191e51764aSArtem Bityutskiy * 4201e51764aSArtem Bityutskiy * LPROPS_UNCAT: not categorized 4217078202eSArtem Bityutskiy * LPROPS_DIRTY: dirty > free, dirty >= @c->dead_wm, not index 42221a60258SArtem Bityutskiy * LPROPS_DIRTY_IDX: dirty + free > @c->min_idx_node_sze and index 4237078202eSArtem Bityutskiy * LPROPS_FREE: free > 0, dirty < @c->dead_wm, not empty, not index 4241e51764aSArtem Bityutskiy * LPROPS_HEAP_CNT: number of heaps used for storing categorized LEBs 4251e51764aSArtem Bityutskiy * LPROPS_EMPTY: LEB is empty, not taken 4261e51764aSArtem Bityutskiy * LPROPS_FREEABLE: free + dirty == leb_size, not index, not taken 4271e51764aSArtem Bityutskiy * LPROPS_FRDI_IDX: free + dirty == leb_size and index, may be taken 4281e51764aSArtem Bityutskiy * LPROPS_CAT_MASK: mask for the LEB categories above 4291e51764aSArtem Bityutskiy * LPROPS_TAKEN: LEB was taken (this flag is not saved on the media) 4301e51764aSArtem Bityutskiy * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash) 4311e51764aSArtem Bityutskiy */ 4321e51764aSArtem Bityutskiy enum { 4331e51764aSArtem Bityutskiy LPROPS_UNCAT = 0, 4341e51764aSArtem Bityutskiy LPROPS_DIRTY = 1, 4351e51764aSArtem Bityutskiy LPROPS_DIRTY_IDX = 2, 4361e51764aSArtem Bityutskiy LPROPS_FREE = 3, 4371e51764aSArtem Bityutskiy LPROPS_HEAP_CNT = 3, 4381e51764aSArtem Bityutskiy LPROPS_EMPTY = 4, 4391e51764aSArtem Bityutskiy LPROPS_FREEABLE = 5, 4401e51764aSArtem Bityutskiy LPROPS_FRDI_IDX = 6, 4411e51764aSArtem Bityutskiy LPROPS_CAT_MASK = 15, 4421e51764aSArtem Bityutskiy LPROPS_TAKEN = 16, 4431e51764aSArtem Bityutskiy LPROPS_INDEX = 32, 4441e51764aSArtem Bityutskiy }; 4451e51764aSArtem Bityutskiy 4461e51764aSArtem Bityutskiy /** 4471e51764aSArtem Bityutskiy * struct ubifs_lprops - logical eraseblock properties. 4481e51764aSArtem Bityutskiy * @free: amount of free space in bytes 4491e51764aSArtem Bityutskiy * @dirty: amount of dirty space in bytes 4501e51764aSArtem Bityutskiy * @flags: LEB properties flags (see above) 4511e51764aSArtem Bityutskiy * @lnum: LEB number 4521e51764aSArtem Bityutskiy * @list: list of same-category lprops (for LPROPS_EMPTY and LPROPS_FREEABLE) 4531e51764aSArtem Bityutskiy * @hpos: heap position in heap of same-category lprops (other categories) 4541e51764aSArtem Bityutskiy */ 4551e51764aSArtem Bityutskiy struct ubifs_lprops { 4561e51764aSArtem Bityutskiy int free; 4571e51764aSArtem Bityutskiy int dirty; 4581e51764aSArtem Bityutskiy int flags; 4591e51764aSArtem Bityutskiy int lnum; 4601e51764aSArtem Bityutskiy union { 4611e51764aSArtem Bityutskiy struct list_head list; 4621e51764aSArtem Bityutskiy int hpos; 4631e51764aSArtem Bityutskiy }; 4641e51764aSArtem Bityutskiy }; 4651e51764aSArtem Bityutskiy 4661e51764aSArtem Bityutskiy /** 4671e51764aSArtem Bityutskiy * struct ubifs_lpt_lprops - LPT logical eraseblock properties. 4681e51764aSArtem Bityutskiy * @free: amount of free space in bytes 4691e51764aSArtem Bityutskiy * @dirty: amount of dirty space in bytes 4701e51764aSArtem Bityutskiy * @tgc: trivial GC flag (1 => unmap after commit end) 4711e51764aSArtem Bityutskiy * @cmt: commit flag (1 => reserved for commit) 4721e51764aSArtem Bityutskiy */ 4731e51764aSArtem Bityutskiy struct ubifs_lpt_lprops { 4741e51764aSArtem Bityutskiy int free; 4751e51764aSArtem Bityutskiy int dirty; 4761e51764aSArtem Bityutskiy unsigned tgc:1; 4771e51764aSArtem Bityutskiy unsigned cmt:1; 4781e51764aSArtem Bityutskiy }; 4791e51764aSArtem Bityutskiy 4801e51764aSArtem Bityutskiy /** 4811e51764aSArtem Bityutskiy * struct ubifs_lp_stats - statistics of eraseblocks in the main area. 4821e51764aSArtem Bityutskiy * @empty_lebs: number of empty LEBs 4831e51764aSArtem Bityutskiy * @taken_empty_lebs: number of taken LEBs 4841e51764aSArtem Bityutskiy * @idx_lebs: number of indexing LEBs 485d3cf502bSArtem Bityutskiy * @total_free: total free space in bytes (includes all LEBs) 486d3cf502bSArtem Bityutskiy * @total_dirty: total dirty space in bytes (includes all LEBs) 487d3cf502bSArtem Bityutskiy * @total_used: total used space in bytes (does not include index LEBs) 488d3cf502bSArtem Bityutskiy * @total_dead: total dead space in bytes (does not include index LEBs) 489d3cf502bSArtem Bityutskiy * @total_dark: total dark space in bytes (does not include index LEBs) 4901e51764aSArtem Bityutskiy * 491d3cf502bSArtem Bityutskiy * The @taken_empty_lebs field counts the LEBs that are in the transient state 492d3cf502bSArtem Bityutskiy * of having been "taken" for use but not yet written to. @taken_empty_lebs is 493d3cf502bSArtem Bityutskiy * needed to account correctly for @gc_lnum, otherwise @empty_lebs could be 494d3cf502bSArtem Bityutskiy * used by itself (in which case 'unused_lebs' would be a better name). In the 495d3cf502bSArtem Bityutskiy * case of @gc_lnum, it is "taken" at mount time or whenever a LEB is retained 496d3cf502bSArtem Bityutskiy * by GC, but unlike other empty LEBs that are "taken", it may not be written 497d3cf502bSArtem Bityutskiy * straight away (i.e. before the next commit start or unmount), so either 498d3cf502bSArtem Bityutskiy * @gc_lnum must be specially accounted for, or the current approach followed 499d3cf502bSArtem Bityutskiy * i.e. count it under @taken_empty_lebs. 5001e51764aSArtem Bityutskiy * 501d3cf502bSArtem Bityutskiy * @empty_lebs includes @taken_empty_lebs. 502d3cf502bSArtem Bityutskiy * 503d3cf502bSArtem Bityutskiy * @total_used, @total_dead and @total_dark fields do not account indexing 504d3cf502bSArtem Bityutskiy * LEBs. 5051e51764aSArtem Bityutskiy */ 5061e51764aSArtem Bityutskiy struct ubifs_lp_stats { 5071e51764aSArtem Bityutskiy int empty_lebs; 5081e51764aSArtem Bityutskiy int taken_empty_lebs; 5091e51764aSArtem Bityutskiy int idx_lebs; 5101e51764aSArtem Bityutskiy long long total_free; 5111e51764aSArtem Bityutskiy long long total_dirty; 5121e51764aSArtem Bityutskiy long long total_used; 5131e51764aSArtem Bityutskiy long long total_dead; 5141e51764aSArtem Bityutskiy long long total_dark; 5151e51764aSArtem Bityutskiy }; 5161e51764aSArtem Bityutskiy 5171e51764aSArtem Bityutskiy struct ubifs_nnode; 5181e51764aSArtem Bityutskiy 5191e51764aSArtem Bityutskiy /** 5201e51764aSArtem Bityutskiy * struct ubifs_cnode - LEB Properties Tree common node. 5211e51764aSArtem Bityutskiy * @parent: parent nnode 5221e51764aSArtem Bityutskiy * @cnext: next cnode to commit 5231e51764aSArtem Bityutskiy * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 5241e51764aSArtem Bityutskiy * @iip: index in parent 5251e51764aSArtem Bityutskiy * @level: level in the tree (zero for pnodes, greater than zero for nnodes) 5261e51764aSArtem Bityutskiy * @num: node number 5271e51764aSArtem Bityutskiy */ 5281e51764aSArtem Bityutskiy struct ubifs_cnode { 5291e51764aSArtem Bityutskiy struct ubifs_nnode *parent; 5301e51764aSArtem Bityutskiy struct ubifs_cnode *cnext; 5311e51764aSArtem Bityutskiy unsigned long flags; 5321e51764aSArtem Bityutskiy int iip; 5331e51764aSArtem Bityutskiy int level; 5341e51764aSArtem Bityutskiy int num; 5351e51764aSArtem Bityutskiy }; 5361e51764aSArtem Bityutskiy 5371e51764aSArtem Bityutskiy /** 5381e51764aSArtem Bityutskiy * struct ubifs_pnode - LEB Properties Tree leaf node. 5391e51764aSArtem Bityutskiy * @parent: parent nnode 5401e51764aSArtem Bityutskiy * @cnext: next cnode to commit 5411e51764aSArtem Bityutskiy * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 5421e51764aSArtem Bityutskiy * @iip: index in parent 5431e51764aSArtem Bityutskiy * @level: level in the tree (always zero for pnodes) 5441e51764aSArtem Bityutskiy * @num: node number 5451e51764aSArtem Bityutskiy * @lprops: LEB properties array 5461e51764aSArtem Bityutskiy */ 5471e51764aSArtem Bityutskiy struct ubifs_pnode { 5481e51764aSArtem Bityutskiy struct ubifs_nnode *parent; 5491e51764aSArtem Bityutskiy struct ubifs_cnode *cnext; 5501e51764aSArtem Bityutskiy unsigned long flags; 5511e51764aSArtem Bityutskiy int iip; 5521e51764aSArtem Bityutskiy int level; 5531e51764aSArtem Bityutskiy int num; 5541e51764aSArtem Bityutskiy struct ubifs_lprops lprops[UBIFS_LPT_FANOUT]; 5551e51764aSArtem Bityutskiy }; 5561e51764aSArtem Bityutskiy 5571e51764aSArtem Bityutskiy /** 5581e51764aSArtem Bityutskiy * struct ubifs_nbranch - LEB Properties Tree internal node branch. 5591e51764aSArtem Bityutskiy * @lnum: LEB number of child 5601e51764aSArtem Bityutskiy * @offs: offset of child 5611e51764aSArtem Bityutskiy * @nnode: nnode child 5621e51764aSArtem Bityutskiy * @pnode: pnode child 5631e51764aSArtem Bityutskiy * @cnode: cnode child 5641e51764aSArtem Bityutskiy */ 5651e51764aSArtem Bityutskiy struct ubifs_nbranch { 5661e51764aSArtem Bityutskiy int lnum; 5671e51764aSArtem Bityutskiy int offs; 5681e51764aSArtem Bityutskiy union { 5691e51764aSArtem Bityutskiy struct ubifs_nnode *nnode; 5701e51764aSArtem Bityutskiy struct ubifs_pnode *pnode; 5711e51764aSArtem Bityutskiy struct ubifs_cnode *cnode; 5721e51764aSArtem Bityutskiy }; 5731e51764aSArtem Bityutskiy }; 5741e51764aSArtem Bityutskiy 5751e51764aSArtem Bityutskiy /** 5761e51764aSArtem Bityutskiy * struct ubifs_nnode - LEB Properties Tree internal node. 5771e51764aSArtem Bityutskiy * @parent: parent nnode 5781e51764aSArtem Bityutskiy * @cnext: next cnode to commit 5791e51764aSArtem Bityutskiy * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 5801e51764aSArtem Bityutskiy * @iip: index in parent 5811e51764aSArtem Bityutskiy * @level: level in the tree (always greater than zero for nnodes) 5821e51764aSArtem Bityutskiy * @num: node number 5831e51764aSArtem Bityutskiy * @nbranch: branches to child nodes 5841e51764aSArtem Bityutskiy */ 5851e51764aSArtem Bityutskiy struct ubifs_nnode { 5861e51764aSArtem Bityutskiy struct ubifs_nnode *parent; 5871e51764aSArtem Bityutskiy struct ubifs_cnode *cnext; 5881e51764aSArtem Bityutskiy unsigned long flags; 5891e51764aSArtem Bityutskiy int iip; 5901e51764aSArtem Bityutskiy int level; 5911e51764aSArtem Bityutskiy int num; 5921e51764aSArtem Bityutskiy struct ubifs_nbranch nbranch[UBIFS_LPT_FANOUT]; 5931e51764aSArtem Bityutskiy }; 5941e51764aSArtem Bityutskiy 5951e51764aSArtem Bityutskiy /** 5961e51764aSArtem Bityutskiy * struct ubifs_lpt_heap - heap of categorized lprops. 5971e51764aSArtem Bityutskiy * @arr: heap array 5981e51764aSArtem Bityutskiy * @cnt: number in heap 5991e51764aSArtem Bityutskiy * @max_cnt: maximum number allowed in heap 6001e51764aSArtem Bityutskiy * 6011e51764aSArtem Bityutskiy * There are %LPROPS_HEAP_CNT heaps. 6021e51764aSArtem Bityutskiy */ 6031e51764aSArtem Bityutskiy struct ubifs_lpt_heap { 6041e51764aSArtem Bityutskiy struct ubifs_lprops **arr; 6051e51764aSArtem Bityutskiy int cnt; 6061e51764aSArtem Bityutskiy int max_cnt; 6071e51764aSArtem Bityutskiy }; 6081e51764aSArtem Bityutskiy 6091e51764aSArtem Bityutskiy /* 6101e51764aSArtem Bityutskiy * Return codes for LPT scan callback function. 6111e51764aSArtem Bityutskiy * 6121e51764aSArtem Bityutskiy * LPT_SCAN_CONTINUE: continue scanning 6131e51764aSArtem Bityutskiy * LPT_SCAN_ADD: add the LEB properties scanned to the tree in memory 6141e51764aSArtem Bityutskiy * LPT_SCAN_STOP: stop scanning 6151e51764aSArtem Bityutskiy */ 6161e51764aSArtem Bityutskiy enum { 6171e51764aSArtem Bityutskiy LPT_SCAN_CONTINUE = 0, 6181e51764aSArtem Bityutskiy LPT_SCAN_ADD = 1, 6191e51764aSArtem Bityutskiy LPT_SCAN_STOP = 2, 6201e51764aSArtem Bityutskiy }; 6211e51764aSArtem Bityutskiy 6221e51764aSArtem Bityutskiy struct ubifs_info; 6231e51764aSArtem Bityutskiy 6241e51764aSArtem Bityutskiy /* Callback used by the 'ubifs_lpt_scan_nolock()' function */ 6251e51764aSArtem Bityutskiy typedef int (*ubifs_lpt_scan_callback)(struct ubifs_info *c, 6261e51764aSArtem Bityutskiy const struct ubifs_lprops *lprops, 6271e51764aSArtem Bityutskiy int in_tree, void *data); 6281e51764aSArtem Bityutskiy 6291e51764aSArtem Bityutskiy /** 6301e51764aSArtem Bityutskiy * struct ubifs_wbuf - UBIFS write-buffer. 6311e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 6321e51764aSArtem Bityutskiy * @buf: write-buffer (of min. flash I/O unit size) 6331e51764aSArtem Bityutskiy * @lnum: logical eraseblock number the write-buffer points to 6341e51764aSArtem Bityutskiy * @offs: write-buffer offset in this logical eraseblock 6351e51764aSArtem Bityutskiy * @avail: number of bytes available in the write-buffer 6361e51764aSArtem Bityutskiy * @used: number of used bytes in the write-buffer 6373c89f396SArtem Bityutskiy * @size: write-buffer size (in [@c->min_io_size, @c->max_write_size] range) 6381e51764aSArtem Bityutskiy * @jhead: journal head the mutex belongs to (note, needed only to shut lockdep 6391e51764aSArtem Bityutskiy * up by 'mutex_lock_nested()). 6401e51764aSArtem Bityutskiy * @sync_callback: write-buffer synchronization callback 6411e51764aSArtem Bityutskiy * @io_mutex: serializes write-buffer I/O 6421e51764aSArtem Bityutskiy * @lock: serializes @buf, @lnum, @offs, @avail, @used, @next_ino and @inodes 6431e51764aSArtem Bityutskiy * fields 6441e51764aSArtem Bityutskiy * @timer: write-buffer timer 645681947d2SAdrian Hunter * @no_timer: non-zero if this write-buffer does not have a timer 646681947d2SAdrian Hunter * @need_sync: non-zero if the timer expired and the wbuf needs sync'ing 6471e51764aSArtem Bityutskiy * @next_ino: points to the next position of the following inode number 6481e51764aSArtem Bityutskiy * @inodes: stores the inode numbers of the nodes which are in wbuf 6491e51764aSArtem Bityutskiy * 6501e51764aSArtem Bityutskiy * The write-buffer synchronization callback is called when the write-buffer is 6511e51764aSArtem Bityutskiy * synchronized in order to notify how much space was wasted due to 6521e51764aSArtem Bityutskiy * write-buffer padding and how much free space is left in the LEB. 6531e51764aSArtem Bityutskiy * 6541e51764aSArtem Bityutskiy * Note: the fields @buf, @lnum, @offs, @avail and @used can be read under 6551e51764aSArtem Bityutskiy * spin-lock or mutex because they are written under both mutex and spin-lock. 6561e51764aSArtem Bityutskiy * @buf is appended to under mutex but overwritten under both mutex and 6571e51764aSArtem Bityutskiy * spin-lock. Thus the data between @buf and @buf + @used can be read under 6581e51764aSArtem Bityutskiy * spinlock. 6591e51764aSArtem Bityutskiy */ 6601e51764aSArtem Bityutskiy struct ubifs_wbuf { 6611e51764aSArtem Bityutskiy struct ubifs_info *c; 6621e51764aSArtem Bityutskiy void *buf; 6631e51764aSArtem Bityutskiy int lnum; 6641e51764aSArtem Bityutskiy int offs; 6651e51764aSArtem Bityutskiy int avail; 6661e51764aSArtem Bityutskiy int used; 6673c89f396SArtem Bityutskiy int size; 6681e51764aSArtem Bityutskiy int jhead; 6691e51764aSArtem Bityutskiy int (*sync_callback)(struct ubifs_info *c, int lnum, int free, int pad); 6701e51764aSArtem Bityutskiy struct mutex io_mutex; 6711e51764aSArtem Bityutskiy spinlock_t lock; 672f2c5dbd7SArtem Bityutskiy struct hrtimer timer; 6730b335b9dSArtem Bityutskiy unsigned int no_timer:1; 6740b335b9dSArtem Bityutskiy unsigned int need_sync:1; 6751e51764aSArtem Bityutskiy int next_ino; 6761e51764aSArtem Bityutskiy ino_t *inodes; 6771e51764aSArtem Bityutskiy }; 6781e51764aSArtem Bityutskiy 6791e51764aSArtem Bityutskiy /** 6801e51764aSArtem Bityutskiy * struct ubifs_bud - bud logical eraseblock. 6811e51764aSArtem Bityutskiy * @lnum: logical eraseblock number 6821e51764aSArtem Bityutskiy * @start: where the (uncommitted) bud data starts 6831e51764aSArtem Bityutskiy * @jhead: journal head number this bud belongs to 6841e51764aSArtem Bityutskiy * @list: link in the list buds belonging to the same journal head 6851e51764aSArtem Bityutskiy * @rb: link in the tree of all buds 6861e51764aSArtem Bityutskiy */ 6871e51764aSArtem Bityutskiy struct ubifs_bud { 6881e51764aSArtem Bityutskiy int lnum; 6891e51764aSArtem Bityutskiy int start; 6901e51764aSArtem Bityutskiy int jhead; 6911e51764aSArtem Bityutskiy struct list_head list; 6921e51764aSArtem Bityutskiy struct rb_node rb; 6931e51764aSArtem Bityutskiy }; 6941e51764aSArtem Bityutskiy 6951e51764aSArtem Bityutskiy /** 6961e51764aSArtem Bityutskiy * struct ubifs_jhead - journal head. 6971e51764aSArtem Bityutskiy * @wbuf: head's write-buffer 6981e51764aSArtem Bityutskiy * @buds_list: list of bud LEBs belonging to this journal head 6991a0b0699SArtem Bityutskiy * @grouped: non-zero if UBIFS groups nodes when writing to this journal head 7001e51764aSArtem Bityutskiy * 7011e51764aSArtem Bityutskiy * Note, the @buds list is protected by the @c->buds_lock. 7021e51764aSArtem Bityutskiy */ 7031e51764aSArtem Bityutskiy struct ubifs_jhead { 7041e51764aSArtem Bityutskiy struct ubifs_wbuf wbuf; 7051e51764aSArtem Bityutskiy struct list_head buds_list; 7061a0b0699SArtem Bityutskiy unsigned int grouped:1; 7071e51764aSArtem Bityutskiy }; 7081e51764aSArtem Bityutskiy 7091e51764aSArtem Bityutskiy /** 7101e51764aSArtem Bityutskiy * struct ubifs_zbranch - key/coordinate/length branch stored in znodes. 7111e51764aSArtem Bityutskiy * @key: key 7121e51764aSArtem Bityutskiy * @znode: znode address in memory 713be61678bSArtem Bityutskiy * @lnum: LEB number of the target node (indexing node or data node) 714be61678bSArtem Bityutskiy * @offs: target node offset within @lnum 7151e51764aSArtem Bityutskiy * @len: target node length 7161e51764aSArtem Bityutskiy */ 7171e51764aSArtem Bityutskiy struct ubifs_zbranch { 7181e51764aSArtem Bityutskiy union ubifs_key key; 7191e51764aSArtem Bityutskiy union { 7201e51764aSArtem Bityutskiy struct ubifs_znode *znode; 7211e51764aSArtem Bityutskiy void *leaf; 7221e51764aSArtem Bityutskiy }; 7231e51764aSArtem Bityutskiy int lnum; 7241e51764aSArtem Bityutskiy int offs; 7251e51764aSArtem Bityutskiy int len; 7261e51764aSArtem Bityutskiy }; 7271e51764aSArtem Bityutskiy 7281e51764aSArtem Bityutskiy /** 7291e51764aSArtem Bityutskiy * struct ubifs_znode - in-memory representation of an indexing node. 7301e51764aSArtem Bityutskiy * @parent: parent znode or NULL if it is the root 7311e51764aSArtem Bityutskiy * @cnext: next znode to commit 7321e51764aSArtem Bityutskiy * @flags: znode flags (%DIRTY_ZNODE, %COW_ZNODE or %OBSOLETE_ZNODE) 7331e51764aSArtem Bityutskiy * @time: last access time (seconds) 7341e51764aSArtem Bityutskiy * @level: level of the entry in the TNC tree 7351e51764aSArtem Bityutskiy * @child_cnt: count of child znodes 7361e51764aSArtem Bityutskiy * @iip: index in parent's zbranch array 7371e51764aSArtem Bityutskiy * @alt: lower bound of key range has altered i.e. child inserted at slot 0 7381e51764aSArtem Bityutskiy * @lnum: LEB number of the corresponding indexing node 7391e51764aSArtem Bityutskiy * @offs: offset of the corresponding indexing node 7401e51764aSArtem Bityutskiy * @len: length of the corresponding indexing node 7411e51764aSArtem Bityutskiy * @zbranch: array of znode branches (@c->fanout elements) 742f70b7e52SArtem Bityutskiy * 743f70b7e52SArtem Bityutskiy * Note! The @lnum, @offs, and @len fields are not really needed - we have them 744f70b7e52SArtem Bityutskiy * only for internal consistency check. They could be removed to save some RAM. 7451e51764aSArtem Bityutskiy */ 7461e51764aSArtem Bityutskiy struct ubifs_znode { 7471e51764aSArtem Bityutskiy struct ubifs_znode *parent; 7481e51764aSArtem Bityutskiy struct ubifs_znode *cnext; 7491e51764aSArtem Bityutskiy unsigned long flags; 7501e51764aSArtem Bityutskiy unsigned long time; 7511e51764aSArtem Bityutskiy int level; 7521e51764aSArtem Bityutskiy int child_cnt; 7531e51764aSArtem Bityutskiy int iip; 7541e51764aSArtem Bityutskiy int alt; 755f70b7e52SArtem Bityutskiy int lnum; 756f70b7e52SArtem Bityutskiy int offs; 757f70b7e52SArtem Bityutskiy int len; 7581e51764aSArtem Bityutskiy struct ubifs_zbranch zbranch[]; 7591e51764aSArtem Bityutskiy }; 7601e51764aSArtem Bityutskiy 7611e51764aSArtem Bityutskiy /** 76239ce81ceSArtem Bityutskiy * struct bu_info - bulk-read information. 7634793e7c5SAdrian Hunter * @key: first data node key 7644793e7c5SAdrian Hunter * @zbranch: zbranches of data nodes to bulk read 7654793e7c5SAdrian Hunter * @buf: buffer to read into 7664793e7c5SAdrian Hunter * @buf_len: buffer length 7674793e7c5SAdrian Hunter * @gc_seq: GC sequence number to detect races with GC 7684793e7c5SAdrian Hunter * @cnt: number of data nodes for bulk read 7694793e7c5SAdrian Hunter * @blk_cnt: number of data blocks including holes 7704793e7c5SAdrian Hunter * @oef: end of file reached 7714793e7c5SAdrian Hunter */ 7724793e7c5SAdrian Hunter struct bu_info { 7734793e7c5SAdrian Hunter union ubifs_key key; 7744793e7c5SAdrian Hunter struct ubifs_zbranch zbranch[UBIFS_MAX_BULK_READ]; 7754793e7c5SAdrian Hunter void *buf; 7764793e7c5SAdrian Hunter int buf_len; 7774793e7c5SAdrian Hunter int gc_seq; 7784793e7c5SAdrian Hunter int cnt; 7794793e7c5SAdrian Hunter int blk_cnt; 7804793e7c5SAdrian Hunter int eof; 7814793e7c5SAdrian Hunter }; 7824793e7c5SAdrian Hunter 7834793e7c5SAdrian Hunter /** 7841e51764aSArtem Bityutskiy * struct ubifs_node_range - node length range description data structure. 7851e51764aSArtem Bityutskiy * @len: fixed node length 7861e51764aSArtem Bityutskiy * @min_len: minimum possible node length 7871e51764aSArtem Bityutskiy * @max_len: maximum possible node length 7881e51764aSArtem Bityutskiy * 7891e51764aSArtem Bityutskiy * If @max_len is %0, the node has fixed length @len. 7901e51764aSArtem Bityutskiy */ 7911e51764aSArtem Bityutskiy struct ubifs_node_range { 7921e51764aSArtem Bityutskiy union { 7931e51764aSArtem Bityutskiy int len; 7941e51764aSArtem Bityutskiy int min_len; 7951e51764aSArtem Bityutskiy }; 7961e51764aSArtem Bityutskiy int max_len; 7971e51764aSArtem Bityutskiy }; 7981e51764aSArtem Bityutskiy 7991e51764aSArtem Bityutskiy /** 8001e51764aSArtem Bityutskiy * struct ubifs_compressor - UBIFS compressor description structure. 8011e51764aSArtem Bityutskiy * @compr_type: compressor type (%UBIFS_COMPR_LZO, etc) 8021e51764aSArtem Bityutskiy * @cc: cryptoapi compressor handle 8031e51764aSArtem Bityutskiy * @comp_mutex: mutex used during compression 8041e51764aSArtem Bityutskiy * @decomp_mutex: mutex used during decompression 8051e51764aSArtem Bityutskiy * @name: compressor name 8061e51764aSArtem Bityutskiy * @capi_name: cryptoapi compressor name 8071e51764aSArtem Bityutskiy */ 8081e51764aSArtem Bityutskiy struct ubifs_compressor { 8091e51764aSArtem Bityutskiy int compr_type; 8101e51764aSArtem Bityutskiy struct crypto_comp *cc; 8111e51764aSArtem Bityutskiy struct mutex *comp_mutex; 8121e51764aSArtem Bityutskiy struct mutex *decomp_mutex; 8131e51764aSArtem Bityutskiy const char *name; 8141e51764aSArtem Bityutskiy const char *capi_name; 8151e51764aSArtem Bityutskiy }; 8161e51764aSArtem Bityutskiy 8171e51764aSArtem Bityutskiy /** 8181e51764aSArtem Bityutskiy * struct ubifs_budget_req - budget requirements of an operation. 8191e51764aSArtem Bityutskiy * 820de94eb55SArtem Bityutskiy * @fast: non-zero if the budgeting should try to acquire budget quickly and 8211e51764aSArtem Bityutskiy * should not try to call write-back 8221e51764aSArtem Bityutskiy * @recalculate: non-zero if @idx_growth, @data_growth, and @dd_growth fields 8231e51764aSArtem Bityutskiy * have to be re-calculated 8241e51764aSArtem Bityutskiy * @new_page: non-zero if the operation adds a new page 8251e51764aSArtem Bityutskiy * @dirtied_page: non-zero if the operation makes a page dirty 8261e51764aSArtem Bityutskiy * @new_dent: non-zero if the operation adds a new directory entry 8271e51764aSArtem Bityutskiy * @mod_dent: non-zero if the operation removes or modifies an existing 8281e51764aSArtem Bityutskiy * directory entry 8291e51764aSArtem Bityutskiy * @new_ino: non-zero if the operation adds a new inode 8307d25b361SDongsheng Yang * @new_ino_d: how much data newly created inode contains 8311e51764aSArtem Bityutskiy * @dirtied_ino: how many inodes the operation makes dirty 8327d25b361SDongsheng Yang * @dirtied_ino_d: how much data dirtied inode contains 8331e51764aSArtem Bityutskiy * @idx_growth: how much the index will supposedly grow 8341e51764aSArtem Bityutskiy * @data_growth: how much new data the operation will supposedly add 8351e51764aSArtem Bityutskiy * @dd_growth: how much data that makes other data dirty the operation will 8361e51764aSArtem Bityutskiy * supposedly add 8371e51764aSArtem Bityutskiy * 8381e51764aSArtem Bityutskiy * @idx_growth, @data_growth and @dd_growth are not used in budget request. The 8391e51764aSArtem Bityutskiy * budgeting subsystem caches index and data growth values there to avoid 8401e51764aSArtem Bityutskiy * re-calculating them when the budget is released. However, if @idx_growth is 8411e51764aSArtem Bityutskiy * %-1, it is calculated by the release function using other fields. 8421e51764aSArtem Bityutskiy * 8431e51764aSArtem Bityutskiy * An inode may contain 4KiB of data at max., thus the widths of @new_ino_d 8441e51764aSArtem Bityutskiy * is 13 bits, and @dirtied_ino_d - 15, because up to 4 inodes may be made 8451e51764aSArtem Bityutskiy * dirty by the re-name operation. 846dab4b4d2SArtem Bityutskiy * 847dab4b4d2SArtem Bityutskiy * Note, UBIFS aligns node lengths to 8-bytes boundary, so the requester has to 848dab4b4d2SArtem Bityutskiy * make sure the amount of inode data which contribute to @new_ino_d and 849dab4b4d2SArtem Bityutskiy * @dirtied_ino_d fields are aligned. 8501e51764aSArtem Bityutskiy */ 8511e51764aSArtem Bityutskiy struct ubifs_budget_req { 8521e51764aSArtem Bityutskiy unsigned int fast:1; 8531e51764aSArtem Bityutskiy unsigned int recalculate:1; 854547000daSArtem Bityutskiy #ifndef UBIFS_DEBUG 8551e51764aSArtem Bityutskiy unsigned int new_page:1; 8561e51764aSArtem Bityutskiy unsigned int dirtied_page:1; 8571e51764aSArtem Bityutskiy unsigned int new_dent:1; 8581e51764aSArtem Bityutskiy unsigned int mod_dent:1; 8591e51764aSArtem Bityutskiy unsigned int new_ino:1; 8601e51764aSArtem Bityutskiy unsigned int new_ino_d:13; 8611e51764aSArtem Bityutskiy unsigned int dirtied_ino:4; 8621e51764aSArtem Bityutskiy unsigned int dirtied_ino_d:15; 8631e51764aSArtem Bityutskiy #else 8641e51764aSArtem Bityutskiy /* Not bit-fields to check for overflows */ 865547000daSArtem Bityutskiy unsigned int new_page; 866547000daSArtem Bityutskiy unsigned int dirtied_page; 867547000daSArtem Bityutskiy unsigned int new_dent; 868547000daSArtem Bityutskiy unsigned int mod_dent; 869547000daSArtem Bityutskiy unsigned int new_ino; 870547000daSArtem Bityutskiy unsigned int new_ino_d; 8711e51764aSArtem Bityutskiy unsigned int dirtied_ino; 8721e51764aSArtem Bityutskiy unsigned int dirtied_ino_d; 8731e51764aSArtem Bityutskiy #endif 8741e51764aSArtem Bityutskiy int idx_growth; 8751e51764aSArtem Bityutskiy int data_growth; 8761e51764aSArtem Bityutskiy int dd_growth; 8771e51764aSArtem Bityutskiy }; 8781e51764aSArtem Bityutskiy 8791e51764aSArtem Bityutskiy /** 8801e51764aSArtem Bityutskiy * struct ubifs_orphan - stores the inode number of an orphan. 8811e51764aSArtem Bityutskiy * @rb: rb-tree node of rb-tree of orphans sorted by inode number 8821e51764aSArtem Bityutskiy * @list: list head of list of orphans in order added 8831e51764aSArtem Bityutskiy * @new_list: list head of list of orphans added since the last commit 8841e51764aSArtem Bityutskiy * @cnext: next orphan to commit 8851e51764aSArtem Bityutskiy * @dnext: next orphan to delete 8861e51764aSArtem Bityutskiy * @inum: inode number 8871e51764aSArtem Bityutskiy * @new: %1 => added since the last commit, otherwise %0 8882928f0d0SAdam Thomas * @cmt: %1 => commit pending, otherwise %0 8898afd500cSAdam Thomas * @del: %1 => delete pending, otherwise %0 8901e51764aSArtem Bityutskiy */ 8911e51764aSArtem Bityutskiy struct ubifs_orphan { 8921e51764aSArtem Bityutskiy struct rb_node rb; 8931e51764aSArtem Bityutskiy struct list_head list; 8941e51764aSArtem Bityutskiy struct list_head new_list; 8951e51764aSArtem Bityutskiy struct ubifs_orphan *cnext; 8961e51764aSArtem Bityutskiy struct ubifs_orphan *dnext; 8971e51764aSArtem Bityutskiy ino_t inum; 8982928f0d0SAdam Thomas unsigned new:1; 8992928f0d0SAdam Thomas unsigned cmt:1; 9008afd500cSAdam Thomas unsigned del:1; 9011e51764aSArtem Bityutskiy }; 9021e51764aSArtem Bityutskiy 9031e51764aSArtem Bityutskiy /** 9041e51764aSArtem Bityutskiy * struct ubifs_mount_opts - UBIFS-specific mount options information. 9051e51764aSArtem Bityutskiy * @unmount_mode: selected unmount mode (%0 default, %1 normal, %2 fast) 906d3f9db00SYannick Guerrini * @bulk_read: enable/disable bulk-reads (%0 default, %1 disable, %2 enable) 907553dea4dSArtem Bityutskiy * @chk_data_crc: enable/disable CRC data checking when reading data nodes 908d3f9db00SYannick Guerrini * (%0 default, %1 disable, %2 enable) 909553dea4dSArtem Bityutskiy * @override_compr: override default compressor (%0 - do not override and use 910553dea4dSArtem Bityutskiy * superblock compressor, %1 - override and use compressor 911553dea4dSArtem Bityutskiy * specified in @compr_type) 912553dea4dSArtem Bityutskiy * @compr_type: compressor type to override the superblock compressor with 913553dea4dSArtem Bityutskiy * (%UBIFS_COMPR_NONE, etc) 9141e51764aSArtem Bityutskiy */ 9151e51764aSArtem Bityutskiy struct ubifs_mount_opts { 9161e51764aSArtem Bityutskiy unsigned int unmount_mode:2; 9174793e7c5SAdrian Hunter unsigned int bulk_read:2; 9182953e73fSAdrian Hunter unsigned int chk_data_crc:2; 919553dea4dSArtem Bityutskiy unsigned int override_compr:1; 920553dea4dSArtem Bityutskiy unsigned int compr_type:2; 9211e51764aSArtem Bityutskiy }; 9221e51764aSArtem Bityutskiy 923b137545cSArtem Bityutskiy /** 924b137545cSArtem Bityutskiy * struct ubifs_budg_info - UBIFS budgeting information. 925b137545cSArtem Bityutskiy * @idx_growth: amount of bytes budgeted for index growth 926b137545cSArtem Bityutskiy * @data_growth: amount of bytes budgeted for cached data 927b137545cSArtem Bityutskiy * @dd_growth: amount of bytes budgeted for cached data that will make 928b137545cSArtem Bityutskiy * other data dirty 929b137545cSArtem Bityutskiy * @uncommitted_idx: amount of bytes were budgeted for growth of the index, but 930b137545cSArtem Bityutskiy * which still have to be taken into account because the index 931b137545cSArtem Bityutskiy * has not been committed so far 932b137545cSArtem Bityutskiy * @old_idx_sz: size of index on flash 933b137545cSArtem Bityutskiy * @min_idx_lebs: minimum number of LEBs required for the index 934b137545cSArtem Bityutskiy * @nospace: non-zero if the file-system does not have flash space (used as 935b137545cSArtem Bityutskiy * optimization) 936b137545cSArtem Bityutskiy * @nospace_rp: the same as @nospace, but additionally means that even reserved 937b137545cSArtem Bityutskiy * pool is full 938d3f9db00SYannick Guerrini * @page_budget: budget for a page (constant, never changed after mount) 939d3f9db00SYannick Guerrini * @inode_budget: budget for an inode (constant, never changed after mount) 940d3f9db00SYannick Guerrini * @dent_budget: budget for a directory entry (constant, never changed after 941b137545cSArtem Bityutskiy * mount) 942b137545cSArtem Bityutskiy */ 943b137545cSArtem Bityutskiy struct ubifs_budg_info { 944b137545cSArtem Bityutskiy long long idx_growth; 945b137545cSArtem Bityutskiy long long data_growth; 946b137545cSArtem Bityutskiy long long dd_growth; 947b137545cSArtem Bityutskiy long long uncommitted_idx; 948b137545cSArtem Bityutskiy unsigned long long old_idx_sz; 949b137545cSArtem Bityutskiy int min_idx_lebs; 950b137545cSArtem Bityutskiy unsigned int nospace:1; 951b137545cSArtem Bityutskiy unsigned int nospace_rp:1; 952b137545cSArtem Bityutskiy int page_budget; 953b137545cSArtem Bityutskiy int inode_budget; 954b137545cSArtem Bityutskiy int dent_budget; 955b137545cSArtem Bityutskiy }; 956b137545cSArtem Bityutskiy 95717c2f9f8SArtem Bityutskiy struct ubifs_debug_info; 95817c2f9f8SArtem Bityutskiy 9591e51764aSArtem Bityutskiy /** 9601e51764aSArtem Bityutskiy * struct ubifs_info - UBIFS file-system description data structure 9611e51764aSArtem Bityutskiy * (per-superblock). 9621e51764aSArtem Bityutskiy * @vfs_sb: VFS @struct super_block object 963de94eb55SArtem Bityutskiy * @bdi: backing device info object to make VFS happy and disable read-ahead 9641e51764aSArtem Bityutskiy * 9651e51764aSArtem Bityutskiy * @highest_inum: highest used inode number 9661e51764aSArtem Bityutskiy * @max_sqnum: current global sequence number 967014eb04bSArtem Bityutskiy * @cmt_no: commit number of the last successfully completed commit, protected 968014eb04bSArtem Bityutskiy * by @commit_sem 96981ffa38eSAdrian Hunter * @cnt_lock: protects @highest_inum and @max_sqnum counters 9701e51764aSArtem Bityutskiy * @fmt_version: UBIFS on-flash format version 971963f0cf6SArtem Bityutskiy * @ro_compat_version: R/O compatibility version 9721e51764aSArtem Bityutskiy * @uuid: UUID from super block 9731e51764aSArtem Bityutskiy * 9741e51764aSArtem Bityutskiy * @lhead_lnum: log head logical eraseblock number 9751e51764aSArtem Bityutskiy * @lhead_offs: log head offset 9761e51764aSArtem Bityutskiy * @ltail_lnum: log tail logical eraseblock number (offset is always 0) 9771e51764aSArtem Bityutskiy * @log_mutex: protects the log, @lhead_lnum, @lhead_offs, @ltail_lnum, and 9781e51764aSArtem Bityutskiy * @bud_bytes 9791e51764aSArtem Bityutskiy * @min_log_bytes: minimum required number of bytes in the log 9801e51764aSArtem Bityutskiy * @cmt_bud_bytes: used during commit to temporarily amount of bytes in 9811e51764aSArtem Bityutskiy * committed buds 9821e51764aSArtem Bityutskiy * 9831e51764aSArtem Bityutskiy * @buds: tree of all buds indexed by bud LEB number 9841e51764aSArtem Bityutskiy * @bud_bytes: how many bytes of flash is used by buds 9851e51764aSArtem Bityutskiy * @buds_lock: protects the @buds tree, @bud_bytes, and per-journal head bud 9861e51764aSArtem Bityutskiy * lists 9871e51764aSArtem Bityutskiy * @jhead_cnt: count of journal heads 9881e51764aSArtem Bityutskiy * @jheads: journal heads (head zero is base head) 9891e51764aSArtem Bityutskiy * @max_bud_bytes: maximum number of bytes allowed in buds 9901e51764aSArtem Bityutskiy * @bg_bud_bytes: number of bud bytes when background commit is initiated 9911e51764aSArtem Bityutskiy * @old_buds: buds to be released after commit ends 9921e51764aSArtem Bityutskiy * @max_bud_cnt: maximum number of buds 9931e51764aSArtem Bityutskiy * 9941e51764aSArtem Bityutskiy * @commit_sem: synchronizes committer with other processes 9951e51764aSArtem Bityutskiy * @cmt_state: commit state 9961e51764aSArtem Bityutskiy * @cs_lock: commit state lock 9971e51764aSArtem Bityutskiy * @cmt_wq: wait queue to sleep on if the log is full and a commit is running 998625bf371SArtem Bityutskiy * 9991e51764aSArtem Bityutskiy * @big_lpt: flag that LPT is too big to write whole during commit 10009f58d350SMatthew L. Creech * @space_fixup: flag indicating that free space in LEBs needs to be cleaned up 1001625bf371SArtem Bityutskiy * @no_chk_data_crc: do not check CRCs when reading data nodes (except during 1002625bf371SArtem Bityutskiy * recovery) 1003625bf371SArtem Bityutskiy * @bulk_read: enable bulk-reads 1004a1dc080cSArtem Bityutskiy * @default_compr: default compression algorithm (%UBIFS_COMPR_LZO, etc) 1005963f0cf6SArtem Bityutskiy * @rw_incompat: the media is not R/W compatible 10061e51764aSArtem Bityutskiy * 10071e51764aSArtem Bityutskiy * @tnc_mutex: protects the Tree Node Cache (TNC), @zroot, @cnext, @enext, and 10081e51764aSArtem Bityutskiy * @calc_idx_sz 10091e51764aSArtem Bityutskiy * @zroot: zbranch which points to the root index node and znode 10101e51764aSArtem Bityutskiy * @cnext: next znode to commit 10111e51764aSArtem Bityutskiy * @enext: next znode to commit to empty space 10121e51764aSArtem Bityutskiy * @gap_lebs: array of LEBs used by the in-gaps commit method 10131e51764aSArtem Bityutskiy * @cbuf: commit buffer 10141e51764aSArtem Bityutskiy * @ileb_buf: buffer for commit in-the-gaps method 10151e51764aSArtem Bityutskiy * @ileb_len: length of data in ileb_buf 10161e51764aSArtem Bityutskiy * @ihead_lnum: LEB number of index head 10171e51764aSArtem Bityutskiy * @ihead_offs: offset of index head 10181e51764aSArtem Bityutskiy * @ilebs: pre-allocated index LEBs 10191e51764aSArtem Bityutskiy * @ileb_cnt: number of pre-allocated index LEBs 10201e51764aSArtem Bityutskiy * @ileb_nxt: next pre-allocated index LEBs 10211e51764aSArtem Bityutskiy * @old_idx: tree of index nodes obsoleted since the last commit start 10221e51764aSArtem Bityutskiy * @bottom_up_buf: a buffer which is used by 'dirty_cow_bottom_up()' in tnc.c 10231e51764aSArtem Bityutskiy * 10241e51764aSArtem Bityutskiy * @mst_node: master node 10251e51764aSArtem Bityutskiy * @mst_offs: offset of valid master node 10263477d204SArtem Bityutskiy * 10276c0c42cdSArtem Bityutskiy * @max_bu_buf_len: maximum bulk-read buffer length 10283477d204SArtem Bityutskiy * @bu_mutex: protects the pre-allocated bulk-read buffer and @c->bu 10293477d204SArtem Bityutskiy * @bu: pre-allocated bulk-read information 10301e51764aSArtem Bityutskiy * 1031d882962fSMatthew L. Creech * @write_reserve_mutex: protects @write_reserve_buf 1032d882962fSMatthew L. Creech * @write_reserve_buf: on the write path we allocate memory, which might 1033d882962fSMatthew L. Creech * sometimes be unavailable, in which case we use this 1034d882962fSMatthew L. Creech * write reserve buffer 1035d882962fSMatthew L. Creech * 10361e51764aSArtem Bityutskiy * @log_lebs: number of logical eraseblocks in the log 10371e51764aSArtem Bityutskiy * @log_bytes: log size in bytes 10381e51764aSArtem Bityutskiy * @log_last: last LEB of the log 10391e51764aSArtem Bityutskiy * @lpt_lebs: number of LEBs used for lprops table 10401e51764aSArtem Bityutskiy * @lpt_first: first LEB of the lprops table area 10411e51764aSArtem Bityutskiy * @lpt_last: last LEB of the lprops table area 10421e51764aSArtem Bityutskiy * @orph_lebs: number of LEBs used for the orphan area 10431e51764aSArtem Bityutskiy * @orph_first: first LEB of the orphan area 10441e51764aSArtem Bityutskiy * @orph_last: last LEB of the orphan area 10451e51764aSArtem Bityutskiy * @main_lebs: count of LEBs in the main area 10461e51764aSArtem Bityutskiy * @main_first: first LEB of the main area 10471e51764aSArtem Bityutskiy * @main_bytes: main area size in bytes 10481e51764aSArtem Bityutskiy * 10491e51764aSArtem Bityutskiy * @key_hash_type: type of the key hash 10501e51764aSArtem Bityutskiy * @key_hash: direntry key hash function 10511e51764aSArtem Bityutskiy * @key_fmt: key format 10521e51764aSArtem Bityutskiy * @key_len: key length 10531e51764aSArtem Bityutskiy * @fanout: fanout of the index tree (number of links per indexing node) 10541e51764aSArtem Bityutskiy * 10551e51764aSArtem Bityutskiy * @min_io_size: minimal input/output unit size 10561e51764aSArtem Bityutskiy * @min_io_shift: number of bits in @min_io_size minus one 10573e8e2e0cSArtem Bityutskiy * @max_write_size: maximum amount of bytes the underlying flash can write at a 10583e8e2e0cSArtem Bityutskiy * time (MTD write buffer size) 10593e8e2e0cSArtem Bityutskiy * @max_write_shift: number of bits in @max_write_size minus one 10601e51764aSArtem Bityutskiy * @leb_size: logical eraseblock size in bytes 1061ca2ec61dSArtem Bityutskiy * @leb_start: starting offset of logical eraseblocks within physical 1062ca2ec61dSArtem Bityutskiy * eraseblocks 10631e51764aSArtem Bityutskiy * @half_leb_size: half LEB size 1064fb1cd01aSArtem Bityutskiy * @idx_leb_size: how many bytes of an LEB are effectively available when it is 1065fb1cd01aSArtem Bityutskiy * used to store indexing nodes (@leb_size - @max_idx_node_sz) 10661e51764aSArtem Bityutskiy * @leb_cnt: count of logical eraseblocks 10671e51764aSArtem Bityutskiy * @max_leb_cnt: maximum count of logical eraseblocks 10681e51764aSArtem Bityutskiy * @old_leb_cnt: count of logical eraseblocks before re-size 10691e51764aSArtem Bityutskiy * @ro_media: the underlying UBI volume is read-only 10702ef13294SArtem Bityutskiy * @ro_mount: the file-system was mounted as read-only 10712680d722SArtem Bityutskiy * @ro_error: UBIFS switched to R/O mode because an error happened 10721e51764aSArtem Bityutskiy * 10731e51764aSArtem Bityutskiy * @dirty_pg_cnt: number of dirty pages (not used) 10741e51764aSArtem Bityutskiy * @dirty_zn_cnt: number of dirty znodes 10751e51764aSArtem Bityutskiy * @clean_zn_cnt: number of clean znodes 10761e51764aSArtem Bityutskiy * 1077b137545cSArtem Bityutskiy * @space_lock: protects @bi and @lst 1078b137545cSArtem Bityutskiy * @lst: lprops statistics 1079b137545cSArtem Bityutskiy * @bi: budgeting information 10801e51764aSArtem Bityutskiy * @calc_idx_sz: temporary variable which is used to calculate new index size 10811e51764aSArtem Bityutskiy * (contains accurate new index size at end of TNC commit start) 10821e51764aSArtem Bityutskiy * 10831e51764aSArtem Bityutskiy * @ref_node_alsz: size of the LEB reference node aligned to the min. flash 10841e51764aSArtem Bityutskiy * I/O unit 10851e51764aSArtem Bityutskiy * @mst_node_alsz: master node aligned size 10861e51764aSArtem Bityutskiy * @min_idx_node_sz: minimum indexing node aligned on 8-bytes boundary 10871e51764aSArtem Bityutskiy * @max_idx_node_sz: maximum indexing node aligned on 8-bytes boundary 10881e51764aSArtem Bityutskiy * @max_inode_sz: maximum possible inode size in bytes 10891e51764aSArtem Bityutskiy * @max_znode_sz: size of znode in bytes 10909bbb5726SArtem Bityutskiy * 10919bbb5726SArtem Bityutskiy * @leb_overhead: how many bytes are wasted in an LEB when it is filled with 10929bbb5726SArtem Bityutskiy * data nodes of maximum size - used in free space reporting 10931e51764aSArtem Bityutskiy * @dead_wm: LEB dead space watermark 10941e51764aSArtem Bityutskiy * @dark_wm: LEB dark space watermark 10951e51764aSArtem Bityutskiy * @block_cnt: count of 4KiB blocks on the FS 10961e51764aSArtem Bityutskiy * 10971e51764aSArtem Bityutskiy * @ranges: UBIFS node length ranges 10981e51764aSArtem Bityutskiy * @ubi: UBI volume descriptor 10991e51764aSArtem Bityutskiy * @di: UBI device information 11001e51764aSArtem Bityutskiy * @vi: UBI volume information 11011e51764aSArtem Bityutskiy * 11021e51764aSArtem Bityutskiy * @orph_tree: rb-tree of orphan inode numbers 11031e51764aSArtem Bityutskiy * @orph_list: list of orphan inode numbers in order added 11041e51764aSArtem Bityutskiy * @orph_new: list of orphan inode numbers added since last commit 11051e51764aSArtem Bityutskiy * @orph_cnext: next orphan to commit 11061e51764aSArtem Bityutskiy * @orph_dnext: next orphan to delete 11071e51764aSArtem Bityutskiy * @orphan_lock: lock for orph_tree and orph_new 11081e51764aSArtem Bityutskiy * @orph_buf: buffer for orphan nodes 11091e51764aSArtem Bityutskiy * @new_orphans: number of orphans since last commit 11101e51764aSArtem Bityutskiy * @cmt_orphans: number of orphans being committed 11111e51764aSArtem Bityutskiy * @tot_orphans: number of orphans in the rb_tree 11121e51764aSArtem Bityutskiy * @max_orphans: maximum number of orphans allowed 11131e51764aSArtem Bityutskiy * @ohead_lnum: orphan head LEB number 11141e51764aSArtem Bityutskiy * @ohead_offs: orphan head offset 11151e51764aSArtem Bityutskiy * @no_orphs: non-zero if there are no orphans 11161e51764aSArtem Bityutskiy * 11171e51764aSArtem Bityutskiy * @bgt: UBIFS background thread 11181e51764aSArtem Bityutskiy * @bgt_name: background thread name 11191e51764aSArtem Bityutskiy * @need_bgt: if background thread should run 11201e51764aSArtem Bityutskiy * @need_wbuf_sync: if write-buffers have to be synchronized 11211e51764aSArtem Bityutskiy * 11221e51764aSArtem Bityutskiy * @gc_lnum: LEB number used for garbage collection 11231e51764aSArtem Bityutskiy * @sbuf: a buffer of LEB size used by GC and replay for scanning 11241e51764aSArtem Bityutskiy * @idx_gc: list of index LEBs that have been garbage collected 11251e51764aSArtem Bityutskiy * @idx_gc_cnt: number of elements on the idx_gc list 1126601c0bc4SAdrian Hunter * @gc_seq: incremented for every non-index LEB garbage collected 1127601c0bc4SAdrian Hunter * @gced_lnum: last non-index LEB that was garbage collected 11281e51764aSArtem Bityutskiy * 11291e51764aSArtem Bityutskiy * @infos_list: links all 'ubifs_info' objects 11301e51764aSArtem Bityutskiy * @umount_mutex: serializes shrinker and un-mount 11311e51764aSArtem Bityutskiy * @shrinker_run_no: shrinker run number 11321e51764aSArtem Bityutskiy * 11331e51764aSArtem Bityutskiy * @space_bits: number of bits needed to record free or dirty space 11341e51764aSArtem Bityutskiy * @lpt_lnum_bits: number of bits needed to record a LEB number in the LPT 11351e51764aSArtem Bityutskiy * @lpt_offs_bits: number of bits needed to record an offset in the LPT 11361e51764aSArtem Bityutskiy * @lpt_spc_bits: number of bits needed to space in the LPT 11371e51764aSArtem Bityutskiy * @pcnt_bits: number of bits needed to record pnode or nnode number 11381e51764aSArtem Bityutskiy * @lnum_bits: number of bits needed to record LEB number 11391e51764aSArtem Bityutskiy * @nnode_sz: size of on-flash nnode 11401e51764aSArtem Bityutskiy * @pnode_sz: size of on-flash pnode 11411e51764aSArtem Bityutskiy * @ltab_sz: size of on-flash LPT lprops table 11421e51764aSArtem Bityutskiy * @lsave_sz: size of on-flash LPT save table 11431e51764aSArtem Bityutskiy * @pnode_cnt: number of pnodes 11441e51764aSArtem Bityutskiy * @nnode_cnt: number of nnodes 11451e51764aSArtem Bityutskiy * @lpt_hght: height of the LPT 11461e51764aSArtem Bityutskiy * @pnodes_have: number of pnodes in memory 11471e51764aSArtem Bityutskiy * 11481e51764aSArtem Bityutskiy * @lp_mutex: protects lprops table and all the other lprops-related fields 11491e51764aSArtem Bityutskiy * @lpt_lnum: LEB number of the root nnode of the LPT 11501e51764aSArtem Bityutskiy * @lpt_offs: offset of the root nnode of the LPT 11511e51764aSArtem Bityutskiy * @nhead_lnum: LEB number of LPT head 11521e51764aSArtem Bityutskiy * @nhead_offs: offset of LPT head 11531e51764aSArtem Bityutskiy * @lpt_drty_flgs: dirty flags for LPT special nodes e.g. ltab 11541e51764aSArtem Bityutskiy * @dirty_nn_cnt: number of dirty nnodes 11551e51764aSArtem Bityutskiy * @dirty_pn_cnt: number of dirty pnodes 115673944a6dSAdrian Hunter * @check_lpt_free: flag that indicates LPT GC may be needed 11571e51764aSArtem Bityutskiy * @lpt_sz: LPT size 11581e51764aSArtem Bityutskiy * @lpt_nod_buf: buffer for an on-flash nnode or pnode 11591e51764aSArtem Bityutskiy * @lpt_buf: buffer of LEB size used by LPT 11601e51764aSArtem Bityutskiy * @nroot: address in memory of the root nnode of the LPT 11611e51764aSArtem Bityutskiy * @lpt_cnext: next LPT node to commit 11621e51764aSArtem Bityutskiy * @lpt_heap: array of heaps of categorized lprops 11631e51764aSArtem Bityutskiy * @dirty_idx: a (reverse sorted) copy of the LPROPS_DIRTY_IDX heap as at 11641e51764aSArtem Bityutskiy * previous commit start 11651e51764aSArtem Bityutskiy * @uncat_list: list of un-categorized LEBs 11661e51764aSArtem Bityutskiy * @empty_list: list of empty LEBs 1167fb1cd01aSArtem Bityutskiy * @freeable_list: list of freeable non-index LEBs (free + dirty == @leb_size) 1168fb1cd01aSArtem Bityutskiy * @frdi_idx_list: list of freeable index LEBs (free + dirty == @leb_size) 11691e51764aSArtem Bityutskiy * @freeable_cnt: number of freeable LEBs in @freeable_list 117098a1eebdSArtem Bityutskiy * @in_a_category_cnt: count of lprops which are in a certain category, which 117198a1eebdSArtem Bityutskiy * basically meants that they were loaded from the flash 11721e51764aSArtem Bityutskiy * 11731e51764aSArtem Bityutskiy * @ltab_lnum: LEB number of LPT's own lprops table 11741e51764aSArtem Bityutskiy * @ltab_offs: offset of LPT's own lprops table 11751e51764aSArtem Bityutskiy * @ltab: LPT's own lprops table 11761e51764aSArtem Bityutskiy * @ltab_cmt: LPT's own lprops table (commit copy) 11771e51764aSArtem Bityutskiy * @lsave_cnt: number of LEB numbers in LPT's save table 11781e51764aSArtem Bityutskiy * @lsave_lnum: LEB number of LPT's save table 11791e51764aSArtem Bityutskiy * @lsave_offs: offset of LPT's save table 11801e51764aSArtem Bityutskiy * @lsave: LPT's save table 11811e51764aSArtem Bityutskiy * @lscan_lnum: LEB number of last LPT scan 11821e51764aSArtem Bityutskiy * 11831e51764aSArtem Bityutskiy * @rp_size: size of the reserved pool in bytes 11841e51764aSArtem Bityutskiy * @report_rp_size: size of the reserved pool reported to user-space 11851e51764aSArtem Bityutskiy * @rp_uid: reserved pool user ID 11861e51764aSArtem Bityutskiy * @rp_gid: reserved pool group ID 11871e51764aSArtem Bityutskiy * 1188d8cdda3eSArtem Bityutskiy * @empty: %1 if the UBI device is empty 1189d8cdda3eSArtem Bityutskiy * @need_recovery: %1 if the file-system needs recovery 1190d8cdda3eSArtem Bityutskiy * @replaying: %1 during journal replay 119118d1d7fbSArtem Bityutskiy * @mounting: %1 while mounting 119290bea5a3SDaniel Golle * @probing: %1 while attempting to mount if MS_SILENT mount flag is set 1193d8cdda3eSArtem Bityutskiy * @remounting_rw: %1 while re-mounting from R/O mode to R/W mode 11941e51764aSArtem Bityutskiy * @replay_list: temporary list used during journal replay 11951e51764aSArtem Bityutskiy * @replay_buds: list of buds to replay 11961e51764aSArtem Bityutskiy * @cs_sqnum: sequence number of first node in the log (commit start node) 11971e51764aSArtem Bityutskiy * @replay_sqnum: sequence number of node currently being replayed 11982ef13294SArtem Bityutskiy * @unclean_leb_list: LEBs to recover when re-mounting R/O mounted FS to R/W 11992ef13294SArtem Bityutskiy * mode 12002ef13294SArtem Bityutskiy * @rcvrd_mst_node: recovered master node to write when re-mounting R/O mounted 12012ef13294SArtem Bityutskiy * FS to R/W mode 12021e51764aSArtem Bityutskiy * @size_tree: inode size information for recovery 12031e51764aSArtem Bityutskiy * @mount_opts: UBIFS-specific mount options 12041e51764aSArtem Bityutskiy * 120517c2f9f8SArtem Bityutskiy * @dbg: debugging-related information 12061e51764aSArtem Bityutskiy */ 12071e51764aSArtem Bityutskiy struct ubifs_info { 12081e51764aSArtem Bityutskiy struct super_block *vfs_sb; 12091e51764aSArtem Bityutskiy struct backing_dev_info bdi; 12101e51764aSArtem Bityutskiy 12111e51764aSArtem Bityutskiy ino_t highest_inum; 12121e51764aSArtem Bityutskiy unsigned long long max_sqnum; 12131e51764aSArtem Bityutskiy unsigned long long cmt_no; 12141e51764aSArtem Bityutskiy spinlock_t cnt_lock; 12151e51764aSArtem Bityutskiy int fmt_version; 1216963f0cf6SArtem Bityutskiy int ro_compat_version; 12171e51764aSArtem Bityutskiy unsigned char uuid[16]; 12181e51764aSArtem Bityutskiy 12191e51764aSArtem Bityutskiy int lhead_lnum; 12201e51764aSArtem Bityutskiy int lhead_offs; 12211e51764aSArtem Bityutskiy int ltail_lnum; 12221e51764aSArtem Bityutskiy struct mutex log_mutex; 12231e51764aSArtem Bityutskiy int min_log_bytes; 12241e51764aSArtem Bityutskiy long long cmt_bud_bytes; 12251e51764aSArtem Bityutskiy 12261e51764aSArtem Bityutskiy struct rb_root buds; 12271e51764aSArtem Bityutskiy long long bud_bytes; 12281e51764aSArtem Bityutskiy spinlock_t buds_lock; 12291e51764aSArtem Bityutskiy int jhead_cnt; 12301e51764aSArtem Bityutskiy struct ubifs_jhead *jheads; 12311e51764aSArtem Bityutskiy long long max_bud_bytes; 12321e51764aSArtem Bityutskiy long long bg_bud_bytes; 12331e51764aSArtem Bityutskiy struct list_head old_buds; 12341e51764aSArtem Bityutskiy int max_bud_cnt; 12351e51764aSArtem Bityutskiy 12361e51764aSArtem Bityutskiy struct rw_semaphore commit_sem; 12371e51764aSArtem Bityutskiy int cmt_state; 12381e51764aSArtem Bityutskiy spinlock_t cs_lock; 12391e51764aSArtem Bityutskiy wait_queue_head_t cmt_wq; 1240625bf371SArtem Bityutskiy 12411e51764aSArtem Bityutskiy unsigned int big_lpt:1; 12429f58d350SMatthew L. Creech unsigned int space_fixup:1; 1243625bf371SArtem Bityutskiy unsigned int no_chk_data_crc:1; 1244625bf371SArtem Bityutskiy unsigned int bulk_read:1; 1245a1dc080cSArtem Bityutskiy unsigned int default_compr:2; 1246963f0cf6SArtem Bityutskiy unsigned int rw_incompat:1; 12471e51764aSArtem Bityutskiy 12481e51764aSArtem Bityutskiy struct mutex tnc_mutex; 12491e51764aSArtem Bityutskiy struct ubifs_zbranch zroot; 12501e51764aSArtem Bityutskiy struct ubifs_znode *cnext; 12511e51764aSArtem Bityutskiy struct ubifs_znode *enext; 12521e51764aSArtem Bityutskiy int *gap_lebs; 12531e51764aSArtem Bityutskiy void *cbuf; 12541e51764aSArtem Bityutskiy void *ileb_buf; 12551e51764aSArtem Bityutskiy int ileb_len; 12561e51764aSArtem Bityutskiy int ihead_lnum; 12571e51764aSArtem Bityutskiy int ihead_offs; 12581e51764aSArtem Bityutskiy int *ilebs; 12591e51764aSArtem Bityutskiy int ileb_cnt; 12601e51764aSArtem Bityutskiy int ileb_nxt; 12611e51764aSArtem Bityutskiy struct rb_root old_idx; 12621e51764aSArtem Bityutskiy int *bottom_up_buf; 12631e51764aSArtem Bityutskiy 12641e51764aSArtem Bityutskiy struct ubifs_mst_node *mst_node; 12651e51764aSArtem Bityutskiy int mst_offs; 12663477d204SArtem Bityutskiy 12676c0c42cdSArtem Bityutskiy int max_bu_buf_len; 12683477d204SArtem Bityutskiy struct mutex bu_mutex; 12693477d204SArtem Bityutskiy struct bu_info bu; 12701e51764aSArtem Bityutskiy 1271d882962fSMatthew L. Creech struct mutex write_reserve_mutex; 1272d882962fSMatthew L. Creech void *write_reserve_buf; 1273d882962fSMatthew L. Creech 12741e51764aSArtem Bityutskiy int log_lebs; 12751e51764aSArtem Bityutskiy long long log_bytes; 12761e51764aSArtem Bityutskiy int log_last; 12771e51764aSArtem Bityutskiy int lpt_lebs; 12781e51764aSArtem Bityutskiy int lpt_first; 12791e51764aSArtem Bityutskiy int lpt_last; 12801e51764aSArtem Bityutskiy int orph_lebs; 12811e51764aSArtem Bityutskiy int orph_first; 12821e51764aSArtem Bityutskiy int orph_last; 12831e51764aSArtem Bityutskiy int main_lebs; 12841e51764aSArtem Bityutskiy int main_first; 12851e51764aSArtem Bityutskiy long long main_bytes; 12861e51764aSArtem Bityutskiy 12871e51764aSArtem Bityutskiy uint8_t key_hash_type; 12881e51764aSArtem Bityutskiy uint32_t (*key_hash)(const char *str, int len); 12891e51764aSArtem Bityutskiy int key_fmt; 12901e51764aSArtem Bityutskiy int key_len; 12911e51764aSArtem Bityutskiy int fanout; 12921e51764aSArtem Bityutskiy 12931e51764aSArtem Bityutskiy int min_io_size; 12941e51764aSArtem Bityutskiy int min_io_shift; 12953e8e2e0cSArtem Bityutskiy int max_write_size; 12963e8e2e0cSArtem Bityutskiy int max_write_shift; 12971e51764aSArtem Bityutskiy int leb_size; 1298ca2ec61dSArtem Bityutskiy int leb_start; 12991e51764aSArtem Bityutskiy int half_leb_size; 1300fb1cd01aSArtem Bityutskiy int idx_leb_size; 13011e51764aSArtem Bityutskiy int leb_cnt; 13021e51764aSArtem Bityutskiy int max_leb_cnt; 13031e51764aSArtem Bityutskiy int old_leb_cnt; 13042680d722SArtem Bityutskiy unsigned int ro_media:1; 13052ef13294SArtem Bityutskiy unsigned int ro_mount:1; 13062680d722SArtem Bityutskiy unsigned int ro_error:1; 13071e51764aSArtem Bityutskiy 13081e51764aSArtem Bityutskiy atomic_long_t dirty_pg_cnt; 13091e51764aSArtem Bityutskiy atomic_long_t dirty_zn_cnt; 13101e51764aSArtem Bityutskiy atomic_long_t clean_zn_cnt; 13111e51764aSArtem Bityutskiy 13121e51764aSArtem Bityutskiy spinlock_t space_lock; 13131e51764aSArtem Bityutskiy struct ubifs_lp_stats lst; 1314b137545cSArtem Bityutskiy struct ubifs_budg_info bi; 1315b137545cSArtem Bityutskiy unsigned long long calc_idx_sz; 13161e51764aSArtem Bityutskiy 13171e51764aSArtem Bityutskiy int ref_node_alsz; 13181e51764aSArtem Bityutskiy int mst_node_alsz; 13191e51764aSArtem Bityutskiy int min_idx_node_sz; 13201e51764aSArtem Bityutskiy int max_idx_node_sz; 13211e51764aSArtem Bityutskiy long long max_inode_sz; 13221e51764aSArtem Bityutskiy int max_znode_sz; 13239bbb5726SArtem Bityutskiy 13249bbb5726SArtem Bityutskiy int leb_overhead; 13251e51764aSArtem Bityutskiy int dead_wm; 13261e51764aSArtem Bityutskiy int dark_wm; 13271e51764aSArtem Bityutskiy int block_cnt; 13281e51764aSArtem Bityutskiy 13291e51764aSArtem Bityutskiy struct ubifs_node_range ranges[UBIFS_NODE_TYPES_CNT]; 13301e51764aSArtem Bityutskiy struct ubi_volume_desc *ubi; 13311e51764aSArtem Bityutskiy struct ubi_device_info di; 13321e51764aSArtem Bityutskiy struct ubi_volume_info vi; 13331e51764aSArtem Bityutskiy 13341e51764aSArtem Bityutskiy struct rb_root orph_tree; 13351e51764aSArtem Bityutskiy struct list_head orph_list; 13361e51764aSArtem Bityutskiy struct list_head orph_new; 13371e51764aSArtem Bityutskiy struct ubifs_orphan *orph_cnext; 13381e51764aSArtem Bityutskiy struct ubifs_orphan *orph_dnext; 13391e51764aSArtem Bityutskiy spinlock_t orphan_lock; 13401e51764aSArtem Bityutskiy void *orph_buf; 13411e51764aSArtem Bityutskiy int new_orphans; 13421e51764aSArtem Bityutskiy int cmt_orphans; 13431e51764aSArtem Bityutskiy int tot_orphans; 13441e51764aSArtem Bityutskiy int max_orphans; 13451e51764aSArtem Bityutskiy int ohead_lnum; 13461e51764aSArtem Bityutskiy int ohead_offs; 13471e51764aSArtem Bityutskiy int no_orphs; 13481e51764aSArtem Bityutskiy 13491e51764aSArtem Bityutskiy struct task_struct *bgt; 13501e51764aSArtem Bityutskiy char bgt_name[sizeof(BGT_NAME_PATTERN) + 9]; 13511e51764aSArtem Bityutskiy int need_bgt; 13521e51764aSArtem Bityutskiy int need_wbuf_sync; 13531e51764aSArtem Bityutskiy 13541e51764aSArtem Bityutskiy int gc_lnum; 13551e51764aSArtem Bityutskiy void *sbuf; 13561e51764aSArtem Bityutskiy struct list_head idx_gc; 13571e51764aSArtem Bityutskiy int idx_gc_cnt; 1358f92b9826SArtem Bityutskiy int gc_seq; 1359f92b9826SArtem Bityutskiy int gced_lnum; 13601e51764aSArtem Bityutskiy 13611e51764aSArtem Bityutskiy struct list_head infos_list; 13621e51764aSArtem Bityutskiy struct mutex umount_mutex; 13631e51764aSArtem Bityutskiy unsigned int shrinker_run_no; 13641e51764aSArtem Bityutskiy 13651e51764aSArtem Bityutskiy int space_bits; 13661e51764aSArtem Bityutskiy int lpt_lnum_bits; 13671e51764aSArtem Bityutskiy int lpt_offs_bits; 13681e51764aSArtem Bityutskiy int lpt_spc_bits; 13691e51764aSArtem Bityutskiy int pcnt_bits; 13701e51764aSArtem Bityutskiy int lnum_bits; 13711e51764aSArtem Bityutskiy int nnode_sz; 13721e51764aSArtem Bityutskiy int pnode_sz; 13731e51764aSArtem Bityutskiy int ltab_sz; 13741e51764aSArtem Bityutskiy int lsave_sz; 13751e51764aSArtem Bityutskiy int pnode_cnt; 13761e51764aSArtem Bityutskiy int nnode_cnt; 13771e51764aSArtem Bityutskiy int lpt_hght; 13781e51764aSArtem Bityutskiy int pnodes_have; 13791e51764aSArtem Bityutskiy 13801e51764aSArtem Bityutskiy struct mutex lp_mutex; 13811e51764aSArtem Bityutskiy int lpt_lnum; 13821e51764aSArtem Bityutskiy int lpt_offs; 13831e51764aSArtem Bityutskiy int nhead_lnum; 13841e51764aSArtem Bityutskiy int nhead_offs; 13851e51764aSArtem Bityutskiy int lpt_drty_flgs; 13861e51764aSArtem Bityutskiy int dirty_nn_cnt; 13871e51764aSArtem Bityutskiy int dirty_pn_cnt; 138873944a6dSAdrian Hunter int check_lpt_free; 13891e51764aSArtem Bityutskiy long long lpt_sz; 13901e51764aSArtem Bityutskiy void *lpt_nod_buf; 13911e51764aSArtem Bityutskiy void *lpt_buf; 13921e51764aSArtem Bityutskiy struct ubifs_nnode *nroot; 13931e51764aSArtem Bityutskiy struct ubifs_cnode *lpt_cnext; 13941e51764aSArtem Bityutskiy struct ubifs_lpt_heap lpt_heap[LPROPS_HEAP_CNT]; 13951e51764aSArtem Bityutskiy struct ubifs_lpt_heap dirty_idx; 13961e51764aSArtem Bityutskiy struct list_head uncat_list; 13971e51764aSArtem Bityutskiy struct list_head empty_list; 13981e51764aSArtem Bityutskiy struct list_head freeable_list; 13991e51764aSArtem Bityutskiy struct list_head frdi_idx_list; 14001e51764aSArtem Bityutskiy int freeable_cnt; 140198a1eebdSArtem Bityutskiy int in_a_category_cnt; 14021e51764aSArtem Bityutskiy 14031e51764aSArtem Bityutskiy int ltab_lnum; 14041e51764aSArtem Bityutskiy int ltab_offs; 14051e51764aSArtem Bityutskiy struct ubifs_lpt_lprops *ltab; 14061e51764aSArtem Bityutskiy struct ubifs_lpt_lprops *ltab_cmt; 14071e51764aSArtem Bityutskiy int lsave_cnt; 14081e51764aSArtem Bityutskiy int lsave_lnum; 14091e51764aSArtem Bityutskiy int lsave_offs; 14101e51764aSArtem Bityutskiy int *lsave; 14111e51764aSArtem Bityutskiy int lscan_lnum; 14121e51764aSArtem Bityutskiy 14131e51764aSArtem Bityutskiy long long rp_size; 14141e51764aSArtem Bityutskiy long long report_rp_size; 141539241bebSEric W. Biederman kuid_t rp_uid; 141639241bebSEric W. Biederman kgid_t rp_gid; 14171e51764aSArtem Bityutskiy 14181e51764aSArtem Bityutskiy /* The below fields are used only during mounting and re-mounting */ 1419d8cdda3eSArtem Bityutskiy unsigned int empty:1; 1420d8cdda3eSArtem Bityutskiy unsigned int need_recovery:1; 1421d8cdda3eSArtem Bityutskiy unsigned int replaying:1; 142218d1d7fbSArtem Bityutskiy unsigned int mounting:1; 1423d8cdda3eSArtem Bityutskiy unsigned int remounting_rw:1; 142490bea5a3SDaniel Golle unsigned int probing:1; 14251e51764aSArtem Bityutskiy struct list_head replay_list; 14261e51764aSArtem Bityutskiy struct list_head replay_buds; 14271e51764aSArtem Bityutskiy unsigned long long cs_sqnum; 14281e51764aSArtem Bityutskiy unsigned long long replay_sqnum; 14291e51764aSArtem Bityutskiy struct list_head unclean_leb_list; 14301e51764aSArtem Bityutskiy struct ubifs_mst_node *rcvrd_mst_node; 14311e51764aSArtem Bityutskiy struct rb_root size_tree; 14321e51764aSArtem Bityutskiy struct ubifs_mount_opts mount_opts; 14331e51764aSArtem Bityutskiy 143417c2f9f8SArtem Bityutskiy struct ubifs_debug_info *dbg; 14351e51764aSArtem Bityutskiy }; 14361e51764aSArtem Bityutskiy 14371e51764aSArtem Bityutskiy extern struct list_head ubifs_infos; 14381e51764aSArtem Bityutskiy extern spinlock_t ubifs_infos_lock; 14391e51764aSArtem Bityutskiy extern atomic_long_t ubifs_clean_zn_cnt; 14401e51764aSArtem Bityutskiy extern struct kmem_cache *ubifs_inode_slab; 1441e8b81566SArtem Bityutskiy extern const struct super_operations ubifs_super_operations; 1442e8b81566SArtem Bityutskiy extern const struct address_space_operations ubifs_file_address_operations; 1443e8b81566SArtem Bityutskiy extern const struct file_operations ubifs_file_operations; 1444e8b81566SArtem Bityutskiy extern const struct inode_operations ubifs_file_inode_operations; 1445e8b81566SArtem Bityutskiy extern const struct file_operations ubifs_dir_operations; 1446e8b81566SArtem Bityutskiy extern const struct inode_operations ubifs_dir_inode_operations; 1447e8b81566SArtem Bityutskiy extern const struct inode_operations ubifs_symlink_inode_operations; 14481e51764aSArtem Bityutskiy extern struct backing_dev_info ubifs_backing_dev_info; 14491e51764aSArtem Bityutskiy extern struct ubifs_compressor *ubifs_compressors[UBIFS_COMPR_TYPES_CNT]; 14501e51764aSArtem Bityutskiy 14511e51764aSArtem Bityutskiy /* io.c */ 1452ff46d7b3SAdrian Hunter void ubifs_ro_mode(struct ubifs_info *c, int err); 145383cef708SArtem Bityutskiy int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, 145483cef708SArtem Bityutskiy int len, int even_ebadmsg); 145583cef708SArtem Bityutskiy int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, 1456b36a261eSRichard Weinberger int len); 1457b36a261eSRichard Weinberger int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len); 145883cef708SArtem Bityutskiy int ubifs_leb_unmap(struct ubifs_info *c, int lnum); 1459b36a261eSRichard Weinberger int ubifs_leb_map(struct ubifs_info *c, int lnum); 146083cef708SArtem Bityutskiy int ubifs_is_mapped(const struct ubifs_info *c, int lnum); 14611e51764aSArtem Bityutskiy int ubifs_wbuf_write_nolock(struct ubifs_wbuf *wbuf, void *buf, int len); 1462b36a261eSRichard Weinberger int ubifs_wbuf_seek_nolock(struct ubifs_wbuf *wbuf, int lnum, int offs); 14631e51764aSArtem Bityutskiy int ubifs_wbuf_init(struct ubifs_info *c, struct ubifs_wbuf *wbuf); 14641e51764aSArtem Bityutskiy int ubifs_read_node(const struct ubifs_info *c, void *buf, int type, int len, 14651e51764aSArtem Bityutskiy int lnum, int offs); 14661e51764aSArtem Bityutskiy int ubifs_read_node_wbuf(struct ubifs_wbuf *wbuf, void *buf, int type, int len, 14671e51764aSArtem Bityutskiy int lnum, int offs); 14681e51764aSArtem Bityutskiy int ubifs_write_node(struct ubifs_info *c, void *node, int len, int lnum, 1469b36a261eSRichard Weinberger int offs); 14701e51764aSArtem Bityutskiy int ubifs_check_node(const struct ubifs_info *c, const void *buf, int lnum, 14716f7ab6d4SArtem Bityutskiy int offs, int quiet, int must_chk_crc); 14721e51764aSArtem Bityutskiy void ubifs_prepare_node(struct ubifs_info *c, void *buf, int len, int pad); 14731e51764aSArtem Bityutskiy void ubifs_prep_grp_node(struct ubifs_info *c, void *node, int len, int last); 14741e51764aSArtem Bityutskiy int ubifs_io_init(struct ubifs_info *c); 14751e51764aSArtem Bityutskiy void ubifs_pad(const struct ubifs_info *c, void *buf, int pad); 14761e51764aSArtem Bityutskiy int ubifs_wbuf_sync_nolock(struct ubifs_wbuf *wbuf); 14771e51764aSArtem Bityutskiy int ubifs_bg_wbufs_sync(struct ubifs_info *c); 14781e51764aSArtem Bityutskiy void ubifs_wbuf_add_ino_nolock(struct ubifs_wbuf *wbuf, ino_t inum); 14791e51764aSArtem Bityutskiy int ubifs_sync_wbufs_by_inode(struct ubifs_info *c, struct inode *inode); 14801e51764aSArtem Bityutskiy 14811e51764aSArtem Bityutskiy /* scan.c */ 14821e51764aSArtem Bityutskiy struct ubifs_scan_leb *ubifs_scan(const struct ubifs_info *c, int lnum, 1483348709baSArtem Bityutskiy int offs, void *sbuf, int quiet); 14841e51764aSArtem Bityutskiy void ubifs_scan_destroy(struct ubifs_scan_leb *sleb); 14851e51764aSArtem Bityutskiy int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, 14861e51764aSArtem Bityutskiy int offs, int quiet); 14871e51764aSArtem Bityutskiy struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, 14881e51764aSArtem Bityutskiy int offs, void *sbuf); 14891e51764aSArtem Bityutskiy void ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, 14901e51764aSArtem Bityutskiy int lnum, int offs); 14911e51764aSArtem Bityutskiy int ubifs_add_snod(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, 14921e51764aSArtem Bityutskiy void *buf, int offs); 14931e51764aSArtem Bityutskiy void ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs, 14941e51764aSArtem Bityutskiy void *buf); 14951e51764aSArtem Bityutskiy 14961e51764aSArtem Bityutskiy /* log.c */ 14971e51764aSArtem Bityutskiy void ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud); 14981e51764aSArtem Bityutskiy void ubifs_create_buds_lists(struct ubifs_info *c); 14991e51764aSArtem Bityutskiy int ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs); 15001e51764aSArtem Bityutskiy struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum); 15011e51764aSArtem Bityutskiy struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum); 15021e51764aSArtem Bityutskiy int ubifs_log_start_commit(struct ubifs_info *c, int *ltail_lnum); 15031e51764aSArtem Bityutskiy int ubifs_log_end_commit(struct ubifs_info *c, int new_ltail_lnum); 15041e51764aSArtem Bityutskiy int ubifs_log_post_commit(struct ubifs_info *c, int old_ltail_lnum); 15051e51764aSArtem Bityutskiy int ubifs_consolidate_log(struct ubifs_info *c); 15061e51764aSArtem Bityutskiy 15071e51764aSArtem Bityutskiy /* journal.c */ 15081e51764aSArtem Bityutskiy int ubifs_jnl_update(struct ubifs_info *c, const struct inode *dir, 15091e51764aSArtem Bityutskiy const struct qstr *nm, const struct inode *inode, 15101e51764aSArtem Bityutskiy int deletion, int xent); 15111e51764aSArtem Bityutskiy int ubifs_jnl_write_data(struct ubifs_info *c, const struct inode *inode, 15121e51764aSArtem Bityutskiy const union ubifs_key *key, const void *buf, int len); 15131f28681aSArtem Bityutskiy int ubifs_jnl_write_inode(struct ubifs_info *c, const struct inode *inode); 1514de94eb55SArtem Bityutskiy int ubifs_jnl_delete_inode(struct ubifs_info *c, const struct inode *inode); 15159ec64962SRichard Weinberger int ubifs_jnl_xrename(struct ubifs_info *c, const struct inode *fst_dir, 15169ec64962SRichard Weinberger const struct dentry *fst_dentry, 15179ec64962SRichard Weinberger const struct inode *snd_dir, 15189ec64962SRichard Weinberger const struct dentry *snd_dentry, int sync); 15191e51764aSArtem Bityutskiy int ubifs_jnl_rename(struct ubifs_info *c, const struct inode *old_dir, 15201e51764aSArtem Bityutskiy const struct dentry *old_dentry, 15211e51764aSArtem Bityutskiy const struct inode *new_dir, 15229e0a1fffSRichard Weinberger const struct dentry *new_dentry, 15239e0a1fffSRichard Weinberger const struct inode *whiteout, int sync); 15241e51764aSArtem Bityutskiy int ubifs_jnl_truncate(struct ubifs_info *c, const struct inode *inode, 15251e51764aSArtem Bityutskiy loff_t old_size, loff_t new_size); 15261e51764aSArtem Bityutskiy int ubifs_jnl_delete_xattr(struct ubifs_info *c, const struct inode *host, 15271e51764aSArtem Bityutskiy const struct inode *inode, const struct qstr *nm); 15281e51764aSArtem Bityutskiy int ubifs_jnl_change_xattr(struct ubifs_info *c, const struct inode *inode1, 15291e51764aSArtem Bityutskiy const struct inode *inode2); 15301e51764aSArtem Bityutskiy 15311e51764aSArtem Bityutskiy /* budget.c */ 15321e51764aSArtem Bityutskiy int ubifs_budget_space(struct ubifs_info *c, struct ubifs_budget_req *req); 15331e51764aSArtem Bityutskiy void ubifs_release_budget(struct ubifs_info *c, struct ubifs_budget_req *req); 15341e51764aSArtem Bityutskiy void ubifs_release_dirty_inode_budget(struct ubifs_info *c, 15351e51764aSArtem Bityutskiy struct ubifs_inode *ui); 15361e51764aSArtem Bityutskiy int ubifs_budget_inode_op(struct ubifs_info *c, struct inode *inode, 15371e51764aSArtem Bityutskiy struct ubifs_budget_req *req); 15381e51764aSArtem Bityutskiy void ubifs_release_ino_dirty(struct ubifs_info *c, struct inode *inode, 15391e51764aSArtem Bityutskiy struct ubifs_budget_req *req); 15401e51764aSArtem Bityutskiy void ubifs_cancel_ino_op(struct ubifs_info *c, struct inode *inode, 15411e51764aSArtem Bityutskiy struct ubifs_budget_req *req); 15427dad181bSArtem Bityutskiy long long ubifs_get_free_space(struct ubifs_info *c); 154384abf972SArtem Bityutskiy long long ubifs_get_free_space_nolock(struct ubifs_info *c); 15441e51764aSArtem Bityutskiy int ubifs_calc_min_idx_lebs(struct ubifs_info *c); 15451e51764aSArtem Bityutskiy void ubifs_convert_page_budget(struct ubifs_info *c); 15464d61db4fSArtem Bityutskiy long long ubifs_reported_space(const struct ubifs_info *c, long long free); 15471e51764aSArtem Bityutskiy long long ubifs_calc_available(const struct ubifs_info *c, int min_idx_lebs); 15481e51764aSArtem Bityutskiy 15491e51764aSArtem Bityutskiy /* find.c */ 15503edaae7cSArtem Bityutskiy int ubifs_find_free_space(struct ubifs_info *c, int min_space, int *offs, 15511e51764aSArtem Bityutskiy int squeeze); 15521e51764aSArtem Bityutskiy int ubifs_find_free_leb_for_idx(struct ubifs_info *c); 15531e51764aSArtem Bityutskiy int ubifs_find_dirty_leb(struct ubifs_info *c, struct ubifs_lprops *ret_lp, 15541e51764aSArtem Bityutskiy int min_space, int pick_free); 15551e51764aSArtem Bityutskiy int ubifs_find_dirty_idx_leb(struct ubifs_info *c); 15561e51764aSArtem Bityutskiy int ubifs_save_dirty_idx_lnums(struct ubifs_info *c); 15571e51764aSArtem Bityutskiy 15581e51764aSArtem Bityutskiy /* tnc.c */ 15591e51764aSArtem Bityutskiy int ubifs_lookup_level0(struct ubifs_info *c, const union ubifs_key *key, 15601e51764aSArtem Bityutskiy struct ubifs_znode **zn, int *n); 15611e51764aSArtem Bityutskiy int ubifs_tnc_lookup_nm(struct ubifs_info *c, const union ubifs_key *key, 15621e51764aSArtem Bityutskiy void *node, const struct qstr *nm); 15631e51764aSArtem Bityutskiy int ubifs_tnc_locate(struct ubifs_info *c, const union ubifs_key *key, 15641e51764aSArtem Bityutskiy void *node, int *lnum, int *offs); 15651e51764aSArtem Bityutskiy int ubifs_tnc_add(struct ubifs_info *c, const union ubifs_key *key, int lnum, 15661e51764aSArtem Bityutskiy int offs, int len); 15671e51764aSArtem Bityutskiy int ubifs_tnc_replace(struct ubifs_info *c, const union ubifs_key *key, 15681e51764aSArtem Bityutskiy int old_lnum, int old_offs, int lnum, int offs, int len); 15691e51764aSArtem Bityutskiy int ubifs_tnc_add_nm(struct ubifs_info *c, const union ubifs_key *key, 15701e51764aSArtem Bityutskiy int lnum, int offs, int len, const struct qstr *nm); 15711e51764aSArtem Bityutskiy int ubifs_tnc_remove(struct ubifs_info *c, const union ubifs_key *key); 15721e51764aSArtem Bityutskiy int ubifs_tnc_remove_nm(struct ubifs_info *c, const union ubifs_key *key, 15731e51764aSArtem Bityutskiy const struct qstr *nm); 15741e51764aSArtem Bityutskiy int ubifs_tnc_remove_range(struct ubifs_info *c, union ubifs_key *from_key, 15751e51764aSArtem Bityutskiy union ubifs_key *to_key); 15761e51764aSArtem Bityutskiy int ubifs_tnc_remove_ino(struct ubifs_info *c, ino_t inum); 15771e51764aSArtem Bityutskiy struct ubifs_dent_node *ubifs_tnc_next_ent(struct ubifs_info *c, 15781e51764aSArtem Bityutskiy union ubifs_key *key, 15791e51764aSArtem Bityutskiy const struct qstr *nm); 15801e51764aSArtem Bityutskiy void ubifs_tnc_close(struct ubifs_info *c); 15811e51764aSArtem Bityutskiy int ubifs_tnc_has_node(struct ubifs_info *c, union ubifs_key *key, int level, 15821e51764aSArtem Bityutskiy int lnum, int offs, int is_idx); 15831e51764aSArtem Bityutskiy int ubifs_dirty_idx_node(struct ubifs_info *c, union ubifs_key *key, int level, 15841e51764aSArtem Bityutskiy int lnum, int offs); 15851e51764aSArtem Bityutskiy /* Shared by tnc.c for tnc_commit.c */ 15861e51764aSArtem Bityutskiy void destroy_old_idx(struct ubifs_info *c); 15871e51764aSArtem Bityutskiy int is_idx_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int level, 15881e51764aSArtem Bityutskiy int lnum, int offs); 15891e51764aSArtem Bityutskiy int insert_old_idx_znode(struct ubifs_info *c, struct ubifs_znode *znode); 15904793e7c5SAdrian Hunter int ubifs_tnc_get_bu_keys(struct ubifs_info *c, struct bu_info *bu); 15914793e7c5SAdrian Hunter int ubifs_tnc_bulk_read(struct ubifs_info *c, struct bu_info *bu); 15921e51764aSArtem Bityutskiy 15931e51764aSArtem Bityutskiy /* tnc_misc.c */ 15941e51764aSArtem Bityutskiy struct ubifs_znode *ubifs_tnc_levelorder_next(struct ubifs_znode *zr, 15951e51764aSArtem Bityutskiy struct ubifs_znode *znode); 15961e51764aSArtem Bityutskiy int ubifs_search_zbranch(const struct ubifs_info *c, 15971e51764aSArtem Bityutskiy const struct ubifs_znode *znode, 15981e51764aSArtem Bityutskiy const union ubifs_key *key, int *n); 15991e51764aSArtem Bityutskiy struct ubifs_znode *ubifs_tnc_postorder_first(struct ubifs_znode *znode); 16001e51764aSArtem Bityutskiy struct ubifs_znode *ubifs_tnc_postorder_next(struct ubifs_znode *znode); 16011e51764aSArtem Bityutskiy long ubifs_destroy_tnc_subtree(struct ubifs_znode *zr); 16021e51764aSArtem Bityutskiy struct ubifs_znode *ubifs_load_znode(struct ubifs_info *c, 16031e51764aSArtem Bityutskiy struct ubifs_zbranch *zbr, 16041e51764aSArtem Bityutskiy struct ubifs_znode *parent, int iip); 16051e51764aSArtem Bityutskiy int ubifs_tnc_read_node(struct ubifs_info *c, struct ubifs_zbranch *zbr, 16061e51764aSArtem Bityutskiy void *node); 16071e51764aSArtem Bityutskiy 16081e51764aSArtem Bityutskiy /* tnc_commit.c */ 16091e51764aSArtem Bityutskiy int ubifs_tnc_start_commit(struct ubifs_info *c, struct ubifs_zbranch *zroot); 16101e51764aSArtem Bityutskiy int ubifs_tnc_end_commit(struct ubifs_info *c); 16111e51764aSArtem Bityutskiy 16121e51764aSArtem Bityutskiy /* shrinker.c */ 16131ab6c499SDave Chinner unsigned long ubifs_shrink_scan(struct shrinker *shrink, 16141ab6c499SDave Chinner struct shrink_control *sc); 16151ab6c499SDave Chinner unsigned long ubifs_shrink_count(struct shrinker *shrink, 16161ab6c499SDave Chinner struct shrink_control *sc); 16171e51764aSArtem Bityutskiy 16181e51764aSArtem Bityutskiy /* commit.c */ 16191e51764aSArtem Bityutskiy int ubifs_bg_thread(void *info); 16201e51764aSArtem Bityutskiy void ubifs_commit_required(struct ubifs_info *c); 16211e51764aSArtem Bityutskiy void ubifs_request_bg_commit(struct ubifs_info *c); 16221e51764aSArtem Bityutskiy int ubifs_run_commit(struct ubifs_info *c); 16231e51764aSArtem Bityutskiy void ubifs_recovery_commit(struct ubifs_info *c); 16241e51764aSArtem Bityutskiy int ubifs_gc_should_commit(struct ubifs_info *c); 16251e51764aSArtem Bityutskiy void ubifs_wait_for_commit(struct ubifs_info *c); 16261e51764aSArtem Bityutskiy 16271e51764aSArtem Bityutskiy /* master.c */ 16281e51764aSArtem Bityutskiy int ubifs_read_master(struct ubifs_info *c); 16291e51764aSArtem Bityutskiy int ubifs_write_master(struct ubifs_info *c); 16301e51764aSArtem Bityutskiy 16311e51764aSArtem Bityutskiy /* sb.c */ 16321e51764aSArtem Bityutskiy int ubifs_read_superblock(struct ubifs_info *c); 16331e51764aSArtem Bityutskiy struct ubifs_sb_node *ubifs_read_sb_node(struct ubifs_info *c); 16341e51764aSArtem Bityutskiy int ubifs_write_sb_node(struct ubifs_info *c, struct ubifs_sb_node *sup); 16356554a657SMatthew L. Creech int ubifs_fixup_free_space(struct ubifs_info *c); 16361e51764aSArtem Bityutskiy 16371e51764aSArtem Bityutskiy /* replay.c */ 16381e51764aSArtem Bityutskiy int ubifs_validate_entry(struct ubifs_info *c, 16391e51764aSArtem Bityutskiy const struct ubifs_dent_node *dent); 16401e51764aSArtem Bityutskiy int ubifs_replay_journal(struct ubifs_info *c); 16411e51764aSArtem Bityutskiy 16421e51764aSArtem Bityutskiy /* gc.c */ 16431e51764aSArtem Bityutskiy int ubifs_garbage_collect(struct ubifs_info *c, int anyway); 16441e51764aSArtem Bityutskiy int ubifs_gc_start_commit(struct ubifs_info *c); 16451e51764aSArtem Bityutskiy int ubifs_gc_end_commit(struct ubifs_info *c); 1646b466f17dSAdrian Hunter void ubifs_destroy_idx_gc(struct ubifs_info *c); 16471e51764aSArtem Bityutskiy int ubifs_get_idx_gc_leb(struct ubifs_info *c); 16481e51764aSArtem Bityutskiy int ubifs_garbage_collect_leb(struct ubifs_info *c, struct ubifs_lprops *lp); 16491e51764aSArtem Bityutskiy 16501e51764aSArtem Bityutskiy /* orphan.c */ 16511e51764aSArtem Bityutskiy int ubifs_add_orphan(struct ubifs_info *c, ino_t inum); 16521e51764aSArtem Bityutskiy void ubifs_delete_orphan(struct ubifs_info *c, ino_t inum); 16531e51764aSArtem Bityutskiy int ubifs_orphan_start_commit(struct ubifs_info *c); 16541e51764aSArtem Bityutskiy int ubifs_orphan_end_commit(struct ubifs_info *c); 16551e51764aSArtem Bityutskiy int ubifs_mount_orphans(struct ubifs_info *c, int unclean, int read_only); 165649d128aaSAdrian Hunter int ubifs_clear_orphans(struct ubifs_info *c); 16571e51764aSArtem Bityutskiy 16581e51764aSArtem Bityutskiy /* lpt.c */ 16591e51764aSArtem Bityutskiy int ubifs_calc_lpt_geom(struct ubifs_info *c); 16601e51764aSArtem Bityutskiy int ubifs_create_dflt_lpt(struct ubifs_info *c, int *main_lebs, int lpt_first, 16611e51764aSArtem Bityutskiy int *lpt_lebs, int *big_lpt); 16621e51764aSArtem Bityutskiy int ubifs_lpt_init(struct ubifs_info *c, int rd, int wr); 16631e51764aSArtem Bityutskiy struct ubifs_lprops *ubifs_lpt_lookup(struct ubifs_info *c, int lnum); 16641e51764aSArtem Bityutskiy struct ubifs_lprops *ubifs_lpt_lookup_dirty(struct ubifs_info *c, int lnum); 16651e51764aSArtem Bityutskiy int ubifs_lpt_scan_nolock(struct ubifs_info *c, int start_lnum, int end_lnum, 16661e51764aSArtem Bityutskiy ubifs_lpt_scan_callback scan_cb, void *data); 16671e51764aSArtem Bityutskiy 16681e51764aSArtem Bityutskiy /* Shared by lpt.c for lpt_commit.c */ 16691e51764aSArtem Bityutskiy void ubifs_pack_lsave(struct ubifs_info *c, void *buf, int *lsave); 16701e51764aSArtem Bityutskiy void ubifs_pack_ltab(struct ubifs_info *c, void *buf, 16711e51764aSArtem Bityutskiy struct ubifs_lpt_lprops *ltab); 16721e51764aSArtem Bityutskiy void ubifs_pack_pnode(struct ubifs_info *c, void *buf, 16731e51764aSArtem Bityutskiy struct ubifs_pnode *pnode); 16741e51764aSArtem Bityutskiy void ubifs_pack_nnode(struct ubifs_info *c, void *buf, 16751e51764aSArtem Bityutskiy struct ubifs_nnode *nnode); 16761e51764aSArtem Bityutskiy struct ubifs_pnode *ubifs_get_pnode(struct ubifs_info *c, 16771e51764aSArtem Bityutskiy struct ubifs_nnode *parent, int iip); 16781e51764aSArtem Bityutskiy struct ubifs_nnode *ubifs_get_nnode(struct ubifs_info *c, 16791e51764aSArtem Bityutskiy struct ubifs_nnode *parent, int iip); 16801e51764aSArtem Bityutskiy int ubifs_read_nnode(struct ubifs_info *c, struct ubifs_nnode *parent, int iip); 16811e51764aSArtem Bityutskiy void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty); 16821e51764aSArtem Bityutskiy void ubifs_add_nnode_dirt(struct ubifs_info *c, struct ubifs_nnode *nnode); 16831e51764aSArtem Bityutskiy uint32_t ubifs_unpack_bits(uint8_t **addr, int *pos, int nrbits); 16841e51764aSArtem Bityutskiy struct ubifs_nnode *ubifs_first_nnode(struct ubifs_info *c, int *hght); 16852ba5f7aeSArtem Bityutskiy /* Needed only in debugging code in lpt_commit.c */ 16862ba5f7aeSArtem Bityutskiy int ubifs_unpack_nnode(const struct ubifs_info *c, void *buf, 16872ba5f7aeSArtem Bityutskiy struct ubifs_nnode *nnode); 16881e51764aSArtem Bityutskiy 16891e51764aSArtem Bityutskiy /* lpt_commit.c */ 16901e51764aSArtem Bityutskiy int ubifs_lpt_start_commit(struct ubifs_info *c); 16911e51764aSArtem Bityutskiy int ubifs_lpt_end_commit(struct ubifs_info *c); 16921e51764aSArtem Bityutskiy int ubifs_lpt_post_commit(struct ubifs_info *c); 16931e51764aSArtem Bityutskiy void ubifs_lpt_free(struct ubifs_info *c, int wr_only); 16941e51764aSArtem Bityutskiy 16951e51764aSArtem Bityutskiy /* lprops.c */ 16961e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_change_lp(struct ubifs_info *c, 16971e51764aSArtem Bityutskiy const struct ubifs_lprops *lp, 16981e51764aSArtem Bityutskiy int free, int dirty, int flags, 16991e51764aSArtem Bityutskiy int idx_gc_cnt); 170084abf972SArtem Bityutskiy void ubifs_get_lp_stats(struct ubifs_info *c, struct ubifs_lp_stats *lst); 17011e51764aSArtem Bityutskiy void ubifs_add_to_cat(struct ubifs_info *c, struct ubifs_lprops *lprops, 17021e51764aSArtem Bityutskiy int cat); 17031e51764aSArtem Bityutskiy void ubifs_replace_cat(struct ubifs_info *c, struct ubifs_lprops *old_lprops, 17041e51764aSArtem Bityutskiy struct ubifs_lprops *new_lprops); 17051e51764aSArtem Bityutskiy void ubifs_ensure_cat(struct ubifs_info *c, struct ubifs_lprops *lprops); 17061e51764aSArtem Bityutskiy int ubifs_categorize_lprops(const struct ubifs_info *c, 17071e51764aSArtem Bityutskiy const struct ubifs_lprops *lprops); 17081e51764aSArtem Bityutskiy int ubifs_change_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, 17091e51764aSArtem Bityutskiy int flags_set, int flags_clean, int idx_gc_cnt); 17101e51764aSArtem Bityutskiy int ubifs_update_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, 17111e51764aSArtem Bityutskiy int flags_set, int flags_clean); 17121e51764aSArtem Bityutskiy int ubifs_read_one_lp(struct ubifs_info *c, int lnum, struct ubifs_lprops *lp); 17131e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_fast_find_free(struct ubifs_info *c); 17141e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_fast_find_empty(struct ubifs_info *c); 17151e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_fast_find_freeable(struct ubifs_info *c); 17161e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_fast_find_frdi_idx(struct ubifs_info *c); 1717be9e62a7SArtem Bityutskiy int ubifs_calc_dark(const struct ubifs_info *c, int spc); 17181e51764aSArtem Bityutskiy 17191e51764aSArtem Bityutskiy /* file.c */ 172002c24a82SJosef Bacik int ubifs_fsync(struct file *file, loff_t start, loff_t end, int datasync); 17211e51764aSArtem Bityutskiy int ubifs_setattr(struct dentry *dentry, struct iattr *attr); 17228c1c5f26SDongsheng Yang #ifdef CONFIG_UBIFS_ATIME_SUPPORT 17238c1c5f26SDongsheng Yang int ubifs_update_time(struct inode *inode, struct timespec *time, int flags); 17248c1c5f26SDongsheng Yang #endif 17251e51764aSArtem Bityutskiy 17261e51764aSArtem Bityutskiy /* dir.c */ 17271e51764aSArtem Bityutskiy struct inode *ubifs_new_inode(struct ubifs_info *c, const struct inode *dir, 1728ad44be5cSAl Viro umode_t mode); 17291e51764aSArtem Bityutskiy int ubifs_getattr(struct vfsmount *mnt, struct dentry *dentry, 17301e51764aSArtem Bityutskiy struct kstat *stat); 1731f6337d84SRichard Weinberger int ubifs_check_dir_empty(struct inode *dir); 17321e51764aSArtem Bityutskiy 17331e51764aSArtem Bityutskiy /* xattr.c */ 17342b88fc21SAndreas Gruenbacher extern const struct xattr_handler *ubifs_xattr_handlers[]; 17351e51764aSArtem Bityutskiy ssize_t ubifs_listxattr(struct dentry *dentry, char *buffer, size_t size); 1736d7f0b70dSSubodh Nijsure int ubifs_init_security(struct inode *dentry, struct inode *inode, 1737d7f0b70dSSubodh Nijsure const struct qstr *qstr); 17381e51764aSArtem Bityutskiy 17391e51764aSArtem Bityutskiy /* super.c */ 17401e51764aSArtem Bityutskiy struct inode *ubifs_iget(struct super_block *sb, unsigned long inum); 17411e51764aSArtem Bityutskiy 17421e51764aSArtem Bityutskiy /* recovery.c */ 17431e51764aSArtem Bityutskiy int ubifs_recover_master_node(struct ubifs_info *c); 17441e51764aSArtem Bityutskiy int ubifs_write_rcvrd_mst_node(struct ubifs_info *c); 17451e51764aSArtem Bityutskiy struct ubifs_scan_leb *ubifs_recover_leb(struct ubifs_info *c, int lnum, 1746efcfde54SArtem Bityutskiy int offs, void *sbuf, int jhead); 17471e51764aSArtem Bityutskiy struct ubifs_scan_leb *ubifs_recover_log_leb(struct ubifs_info *c, int lnum, 17481e51764aSArtem Bityutskiy int offs, void *sbuf); 174983cef708SArtem Bityutskiy int ubifs_recover_inl_heads(struct ubifs_info *c, void *sbuf); 175083cef708SArtem Bityutskiy int ubifs_clean_lebs(struct ubifs_info *c, void *sbuf); 17511e51764aSArtem Bityutskiy int ubifs_rcvry_gc_commit(struct ubifs_info *c); 17521e51764aSArtem Bityutskiy int ubifs_recover_size_accum(struct ubifs_info *c, union ubifs_key *key, 17531e51764aSArtem Bityutskiy int deletion, loff_t new_size); 17541e51764aSArtem Bityutskiy int ubifs_recover_size(struct ubifs_info *c); 17551e51764aSArtem Bityutskiy void ubifs_destroy_size_tree(struct ubifs_info *c); 17561e51764aSArtem Bityutskiy 17571e51764aSArtem Bityutskiy /* ioctl.c */ 17581e51764aSArtem Bityutskiy long ubifs_ioctl(struct file *file, unsigned int cmd, unsigned long arg); 17591e51764aSArtem Bityutskiy void ubifs_set_inode_flags(struct inode *inode); 17601e51764aSArtem Bityutskiy #ifdef CONFIG_COMPAT 17611e51764aSArtem Bityutskiy long ubifs_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg); 17621e51764aSArtem Bityutskiy #endif 17631e51764aSArtem Bityutskiy 17641e51764aSArtem Bityutskiy /* compressor.c */ 17651e51764aSArtem Bityutskiy int __init ubifs_compressors_init(void); 1766995be045SAlexey Dobriyan void ubifs_compressors_exit(void); 1767235c362bSSheng Yong void ubifs_compress(const struct ubifs_info *c, const void *in_buf, int in_len, 1768235c362bSSheng Yong void *out_buf, int *out_len, int *compr_type); 1769235c362bSSheng Yong int ubifs_decompress(const struct ubifs_info *c, const void *buf, int len, 1770235c362bSSheng Yong void *out, int *out_len, int compr_type); 17711e51764aSArtem Bityutskiy 17721e51764aSArtem Bityutskiy #include "debug.h" 17731e51764aSArtem Bityutskiy #include "misc.h" 17741e51764aSArtem Bityutskiy #include "key.h" 17751e51764aSArtem Bityutskiy 17763e7f2c51SJoe Perches /* Normal UBIFS messages */ 17773e7f2c51SJoe Perches __printf(2, 3) 17783e7f2c51SJoe Perches void ubifs_msg(const struct ubifs_info *c, const char *fmt, ...); 17793e7f2c51SJoe Perches __printf(2, 3) 17803e7f2c51SJoe Perches void ubifs_err(const struct ubifs_info *c, const char *fmt, ...); 17813e7f2c51SJoe Perches __printf(2, 3) 17823e7f2c51SJoe Perches void ubifs_warn(const struct ubifs_info *c, const char *fmt, ...); 17833e7f2c51SJoe Perches /* 1784380bc8b7SDaniel Golle * A conditional variant of 'ubifs_err()' which doesn't output anything 1785380bc8b7SDaniel Golle * if probing (ie. MS_SILENT set). 17863e7f2c51SJoe Perches */ 17873e7f2c51SJoe Perches #define ubifs_errc(c, fmt, ...) \ 17883e7f2c51SJoe Perches do { \ 17893e7f2c51SJoe Perches if (!(c)->probing) \ 17903e7f2c51SJoe Perches ubifs_err(c, fmt, ##__VA_ARGS__); \ 17913e7f2c51SJoe Perches } while (0) 17923e7f2c51SJoe Perches 17931e51764aSArtem Bityutskiy #endif /* !__UBIFS_H__ */ 1794