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> 41cc41a536SRichard Weinberger #include <linux/random.h> 4249525e5eSSascha Hauer #include <crypto/hash_info.h> 4349525e5eSSascha Hauer #include <crypto/hash.h> 4449525e5eSSascha Hauer #include <crypto/algapi.h> 45734f0d24SDave Chinner 46734f0d24SDave Chinner #define __FS_HAS_ENCRYPTION IS_ENABLED(CONFIG_UBIFS_FS_ENCRYPTION) 47734f0d24SDave Chinner #include <linux/fscrypt.h> 48734f0d24SDave Chinner 491e51764aSArtem Bityutskiy #include "ubifs-media.h" 501e51764aSArtem Bityutskiy 511e51764aSArtem Bityutskiy /* Version of this UBIFS implementation */ 521e51764aSArtem Bityutskiy #define UBIFS_VERSION 1 531e51764aSArtem Bityutskiy 541e51764aSArtem Bityutskiy /* UBIFS file system VFS magic number */ 551e51764aSArtem Bityutskiy #define UBIFS_SUPER_MAGIC 0x24051905 561e51764aSArtem Bityutskiy 571e51764aSArtem Bityutskiy /* Number of UBIFS blocks per VFS page */ 5809cbfeafSKirill A. Shutemov #define UBIFS_BLOCKS_PER_PAGE (PAGE_SIZE / UBIFS_BLOCK_SIZE) 5909cbfeafSKirill A. Shutemov #define UBIFS_BLOCKS_PER_PAGE_SHIFT (PAGE_SHIFT - UBIFS_BLOCK_SHIFT) 601e51764aSArtem Bityutskiy 611e51764aSArtem Bityutskiy /* "File system end of life" sequence number watermark */ 621e51764aSArtem Bityutskiy #define SQNUM_WARN_WATERMARK 0xFFFFFFFF00000000ULL 631e51764aSArtem Bityutskiy #define SQNUM_WATERMARK 0xFFFFFFFFFF000000ULL 641e51764aSArtem Bityutskiy 65af14a1adSArtem Bityutskiy /* 66af14a1adSArtem Bityutskiy * Minimum amount of LEBs reserved for the index. At present the index needs at 67af14a1adSArtem Bityutskiy * least 2 LEBs: one for the index head and one for in-the-gaps method (which 68af14a1adSArtem Bityutskiy * currently does not cater for the index head and so excludes it from 69af14a1adSArtem Bityutskiy * consideration). 70af14a1adSArtem Bityutskiy */ 71af14a1adSArtem Bityutskiy #define MIN_INDEX_LEBS 2 72af14a1adSArtem Bityutskiy 731e51764aSArtem Bityutskiy /* Minimum amount of data UBIFS writes to the flash */ 741e51764aSArtem Bityutskiy #define MIN_WRITE_SZ (UBIFS_DATA_NODE_SZ + 8) 751e51764aSArtem Bityutskiy 761e51764aSArtem Bityutskiy /* 771e51764aSArtem Bityutskiy * Currently we do not support inode number overlapping and re-using, so this 781e51764aSArtem Bityutskiy * watermark defines dangerous inode number level. This should be fixed later, 791e51764aSArtem Bityutskiy * although it is difficult to exceed current limit. Another option is to use 801e51764aSArtem Bityutskiy * 64-bit inode numbers, but this means more overhead. 811e51764aSArtem Bityutskiy */ 821e51764aSArtem Bityutskiy #define INUM_WARN_WATERMARK 0xFFF00000 831e51764aSArtem Bityutskiy #define INUM_WATERMARK 0xFFFFFF00 841e51764aSArtem Bityutskiy 851e51764aSArtem Bityutskiy /* Maximum number of entries in each LPT (LEB category) heap */ 861e51764aSArtem Bityutskiy #define LPT_HEAP_SZ 256 871e51764aSArtem Bityutskiy 881e51764aSArtem Bityutskiy /* 891e51764aSArtem Bityutskiy * Background thread name pattern. The numbers are UBI device and volume 901e51764aSArtem Bityutskiy * numbers. 911e51764aSArtem Bityutskiy */ 921e51764aSArtem Bityutskiy #define BGT_NAME_PATTERN "ubifs_bgt%d_%d" 931e51764aSArtem Bityutskiy 941e51764aSArtem Bityutskiy /* Maximum possible inode number (only 32-bit inodes are supported now) */ 951e51764aSArtem Bityutskiy #define MAX_INUM 0xFFFFFFFF 961e51764aSArtem Bityutskiy 971e51764aSArtem Bityutskiy /* Number of non-data journal heads */ 981e51764aSArtem Bityutskiy #define NONDATA_JHEADS_CNT 2 991e51764aSArtem Bityutskiy 100d6d14009SArtem Bityutskiy /* Shorter names for journal head numbers for internal usage */ 101d6d14009SArtem Bityutskiy #define GCHD UBIFS_GC_HEAD 102d6d14009SArtem Bityutskiy #define BASEHD UBIFS_BASE_HEAD 103d6d14009SArtem Bityutskiy #define DATAHD UBIFS_DATA_HEAD 1041e51764aSArtem Bityutskiy 1051e51764aSArtem Bityutskiy /* 'No change' value for 'ubifs_change_lp()' */ 1061e51764aSArtem Bityutskiy #define LPROPS_NC 0x80000001 1071e51764aSArtem Bityutskiy 1081e51764aSArtem Bityutskiy /* 1091e51764aSArtem Bityutskiy * There is no notion of truncation key because truncation nodes do not exist 1101e51764aSArtem Bityutskiy * in TNC. However, when replaying, it is handy to introduce fake "truncation" 1111e51764aSArtem Bityutskiy * keys for truncation nodes because the code becomes simpler. So we define 1121e51764aSArtem Bityutskiy * %UBIFS_TRUN_KEY type. 113ba2f48f7SArtem Bityutskiy * 114ba2f48f7SArtem Bityutskiy * But otherwise, out of the journal reply scope, the truncation keys are 115ba2f48f7SArtem Bityutskiy * invalid. 1161e51764aSArtem Bityutskiy */ 1171e51764aSArtem Bityutskiy #define UBIFS_TRUN_KEY UBIFS_KEY_TYPES_CNT 118ba2f48f7SArtem Bityutskiy #define UBIFS_INVALID_KEY UBIFS_KEY_TYPES_CNT 1191e51764aSArtem Bityutskiy 1201e51764aSArtem Bityutskiy /* 1211e51764aSArtem Bityutskiy * How much a directory entry/extended attribute entry adds to the parent/host 1221e51764aSArtem Bityutskiy * inode. 1231e51764aSArtem Bityutskiy */ 1241e51764aSArtem Bityutskiy #define CALC_DENT_SIZE(name_len) ALIGN(UBIFS_DENT_NODE_SZ + (name_len) + 1, 8) 1251e51764aSArtem Bityutskiy 1261e51764aSArtem Bityutskiy /* How much an extended attribute adds to the host inode */ 1271e51764aSArtem Bityutskiy #define CALC_XATTR_BYTES(data_len) ALIGN(UBIFS_INO_NODE_SZ + (data_len) + 1, 8) 1281e51764aSArtem Bityutskiy 1291e51764aSArtem Bityutskiy /* 1301e51764aSArtem Bityutskiy * Znodes which were not touched for 'OLD_ZNODE_AGE' seconds are considered 1311e51764aSArtem Bityutskiy * "old", and znode which were touched last 'YOUNG_ZNODE_AGE' seconds ago are 1321e51764aSArtem Bityutskiy * considered "young". This is used by shrinker when selecting znode to trim 1331e51764aSArtem Bityutskiy * off. 1341e51764aSArtem Bityutskiy */ 1351e51764aSArtem Bityutskiy #define OLD_ZNODE_AGE 20 1361e51764aSArtem Bityutskiy #define YOUNG_ZNODE_AGE 5 1371e51764aSArtem Bityutskiy 1381e51764aSArtem Bityutskiy /* 1391e51764aSArtem Bityutskiy * Some compressors, like LZO, may end up with more data then the input buffer. 1401e51764aSArtem Bityutskiy * So UBIFS always allocates larger output buffer, to be sure the compressor 1411e51764aSArtem Bityutskiy * will not corrupt memory in case of worst case compression. 1421e51764aSArtem Bityutskiy */ 1431e51764aSArtem Bityutskiy #define WORST_COMPR_FACTOR 2 1441e51764aSArtem Bityutskiy 1457799953bSRichard Weinberger #ifdef CONFIG_UBIFS_FS_ENCRYPTION 1467799953bSRichard Weinberger #define UBIFS_CIPHER_BLOCK_SIZE FS_CRYPTO_BLOCK_SIZE 1477799953bSRichard Weinberger #else 1487799953bSRichard Weinberger #define UBIFS_CIPHER_BLOCK_SIZE 0 1497799953bSRichard Weinberger #endif 1507799953bSRichard Weinberger 151d882962fSMatthew L. Creech /* 152d3f9db00SYannick Guerrini * How much memory is needed for a buffer where we compress a data node. 153d882962fSMatthew L. Creech */ 154d882962fSMatthew L. Creech #define COMPRESSED_DATA_NODE_BUF_SZ \ 155d882962fSMatthew L. Creech (UBIFS_DATA_NODE_SZ + UBIFS_BLOCK_SIZE * WORST_COMPR_FACTOR) 156d882962fSMatthew L. Creech 1571e51764aSArtem Bityutskiy /* Maximum expected tree height for use by bottom_up_buf */ 1581e51764aSArtem Bityutskiy #define BOTTOM_UP_HEIGHT 64 1591e51764aSArtem Bityutskiy 1604793e7c5SAdrian Hunter /* Maximum number of data nodes to bulk-read */ 1614793e7c5SAdrian Hunter #define UBIFS_MAX_BULK_READ 32 1624793e7c5SAdrian Hunter 16349525e5eSSascha Hauer #ifdef CONFIG_UBIFS_FS_AUTHENTICATION 16449525e5eSSascha Hauer #define UBIFS_HASH_ARR_SZ UBIFS_MAX_HASH_LEN 16549525e5eSSascha Hauer #define UBIFS_HMAC_ARR_SZ UBIFS_MAX_HMAC_LEN 16649525e5eSSascha Hauer #else 16749525e5eSSascha Hauer #define UBIFS_HASH_ARR_SZ 0 16849525e5eSSascha Hauer #define UBIFS_HMAC_ARR_SZ 0 16949525e5eSSascha Hauer #endif 17049525e5eSSascha Hauer 1711e51764aSArtem Bityutskiy /* 1721e51764aSArtem Bityutskiy * Lockdep classes for UBIFS inode @ui_mutex. 1731e51764aSArtem Bityutskiy */ 1741e51764aSArtem Bityutskiy enum { 1751e51764aSArtem Bityutskiy WB_MUTEX_1 = 0, 1761e51764aSArtem Bityutskiy WB_MUTEX_2 = 1, 1771e51764aSArtem Bityutskiy WB_MUTEX_3 = 2, 1789e0a1fffSRichard Weinberger WB_MUTEX_4 = 3, 1791e51764aSArtem Bityutskiy }; 1801e51764aSArtem Bityutskiy 1811e51764aSArtem Bityutskiy /* 1821e51764aSArtem Bityutskiy * Znode flags (actually, bit numbers which store the flags). 1831e51764aSArtem Bityutskiy * 1841e51764aSArtem Bityutskiy * DIRTY_ZNODE: znode is dirty 1851e51764aSArtem Bityutskiy * COW_ZNODE: znode is being committed and a new instance of this znode has to 1861e51764aSArtem Bityutskiy * be created before changing this znode 1871e51764aSArtem Bityutskiy * OBSOLETE_ZNODE: znode is obsolete, which means it was deleted, but it is 1881e51764aSArtem Bityutskiy * still in the commit list and the ongoing commit operation 1891e51764aSArtem Bityutskiy * will commit it, and delete this znode after it is done 1901e51764aSArtem Bityutskiy */ 1911e51764aSArtem Bityutskiy enum { 1921e51764aSArtem Bityutskiy DIRTY_ZNODE = 0, 1931e51764aSArtem Bityutskiy COW_ZNODE = 1, 1941e51764aSArtem Bityutskiy OBSOLETE_ZNODE = 2, 1951e51764aSArtem Bityutskiy }; 1961e51764aSArtem Bityutskiy 1971e51764aSArtem Bityutskiy /* 1981e51764aSArtem Bityutskiy * Commit states. 1991e51764aSArtem Bityutskiy * 2001e51764aSArtem Bityutskiy * COMMIT_RESTING: commit is not wanted 2011e51764aSArtem Bityutskiy * COMMIT_BACKGROUND: background commit has been requested 2021e51764aSArtem Bityutskiy * COMMIT_REQUIRED: commit is required 2031e51764aSArtem Bityutskiy * COMMIT_RUNNING_BACKGROUND: background commit is running 2041e51764aSArtem Bityutskiy * COMMIT_RUNNING_REQUIRED: commit is running and it is required 2051e51764aSArtem Bityutskiy * COMMIT_BROKEN: commit failed 2061e51764aSArtem Bityutskiy */ 2071e51764aSArtem Bityutskiy enum { 2081e51764aSArtem Bityutskiy COMMIT_RESTING = 0, 2091e51764aSArtem Bityutskiy COMMIT_BACKGROUND, 2101e51764aSArtem Bityutskiy COMMIT_REQUIRED, 2111e51764aSArtem Bityutskiy COMMIT_RUNNING_BACKGROUND, 2121e51764aSArtem Bityutskiy COMMIT_RUNNING_REQUIRED, 2131e51764aSArtem Bityutskiy COMMIT_BROKEN, 2141e51764aSArtem Bityutskiy }; 2151e51764aSArtem Bityutskiy 2161e51764aSArtem Bityutskiy /* 2171e51764aSArtem Bityutskiy * 'ubifs_scan_a_node()' return values. 2181e51764aSArtem Bityutskiy * 2191e51764aSArtem Bityutskiy * SCANNED_GARBAGE: scanned garbage 2201e51764aSArtem Bityutskiy * SCANNED_EMPTY_SPACE: scanned empty space 2211e51764aSArtem Bityutskiy * SCANNED_A_NODE: scanned a valid node 2221e51764aSArtem Bityutskiy * SCANNED_A_CORRUPT_NODE: scanned a corrupted node 2231e51764aSArtem Bityutskiy * SCANNED_A_BAD_PAD_NODE: scanned a padding node with invalid pad length 2241e51764aSArtem Bityutskiy * 2251e51764aSArtem Bityutskiy * Greater than zero means: 'scanned that number of padding bytes' 2261e51764aSArtem Bityutskiy */ 2271e51764aSArtem Bityutskiy enum { 2281e51764aSArtem Bityutskiy SCANNED_GARBAGE = 0, 2291e51764aSArtem Bityutskiy SCANNED_EMPTY_SPACE = -1, 2301e51764aSArtem Bityutskiy SCANNED_A_NODE = -2, 2311e51764aSArtem Bityutskiy SCANNED_A_CORRUPT_NODE = -3, 2321e51764aSArtem Bityutskiy SCANNED_A_BAD_PAD_NODE = -4, 2331e51764aSArtem Bityutskiy }; 2341e51764aSArtem Bityutskiy 2351e51764aSArtem Bityutskiy /* 2361e51764aSArtem Bityutskiy * LPT cnode flag bits. 2371e51764aSArtem Bityutskiy * 2381e51764aSArtem Bityutskiy * DIRTY_CNODE: cnode is dirty 2391e51764aSArtem Bityutskiy * OBSOLETE_CNODE: cnode is being committed and has been copied (or deleted), 2401e51764aSArtem Bityutskiy * so it can (and must) be freed when the commit is finished 24137662447SArtem Bityutskiy * COW_CNODE: cnode is being committed and must be copied before writing 2421e51764aSArtem Bityutskiy */ 2431e51764aSArtem Bityutskiy enum { 2441e51764aSArtem Bityutskiy DIRTY_CNODE = 0, 24537662447SArtem Bityutskiy OBSOLETE_CNODE = 1, 24637662447SArtem Bityutskiy COW_CNODE = 2, 2471e51764aSArtem Bityutskiy }; 2481e51764aSArtem Bityutskiy 2491e51764aSArtem Bityutskiy /* 2501e51764aSArtem Bityutskiy * Dirty flag bits (lpt_drty_flgs) for LPT special nodes. 2511e51764aSArtem Bityutskiy * 2521e51764aSArtem Bityutskiy * LTAB_DIRTY: ltab node is dirty 2531e51764aSArtem Bityutskiy * LSAVE_DIRTY: lsave node is dirty 2541e51764aSArtem Bityutskiy */ 2551e51764aSArtem Bityutskiy enum { 2561e51764aSArtem Bityutskiy LTAB_DIRTY = 1, 2571e51764aSArtem Bityutskiy LSAVE_DIRTY = 2, 2581e51764aSArtem Bityutskiy }; 2591e51764aSArtem Bityutskiy 2601e51764aSArtem Bityutskiy /* 2611e51764aSArtem Bityutskiy * Return codes used by the garbage collector. 2621e51764aSArtem Bityutskiy * @LEB_FREED: the logical eraseblock was freed and is ready to use 2631e51764aSArtem Bityutskiy * @LEB_FREED_IDX: indexing LEB was freed and can be used only after the commit 2641e51764aSArtem Bityutskiy * @LEB_RETAINED: the logical eraseblock was freed and retained for GC purposes 2651e51764aSArtem Bityutskiy */ 2661e51764aSArtem Bityutskiy enum { 2671e51764aSArtem Bityutskiy LEB_FREED, 2681e51764aSArtem Bityutskiy LEB_FREED_IDX, 2691e51764aSArtem Bityutskiy LEB_RETAINED, 2701e51764aSArtem Bityutskiy }; 2711e51764aSArtem Bityutskiy 2722e52eb74SRichard Weinberger /* 2732e52eb74SRichard Weinberger * Action taken upon a failed ubifs_assert(). 2742e52eb74SRichard Weinberger * @ASSACT_REPORT: just report the failed assertion 2752e52eb74SRichard Weinberger * @ASSACT_RO: switch to read-only mode 2762e52eb74SRichard Weinberger * @ASSACT_PANIC: call BUG() and possible panic the kernel 2772e52eb74SRichard Weinberger */ 2782e52eb74SRichard Weinberger enum { 2792e52eb74SRichard Weinberger ASSACT_REPORT = 0, 2802e52eb74SRichard Weinberger ASSACT_RO, 2812e52eb74SRichard Weinberger ASSACT_PANIC, 2822e52eb74SRichard Weinberger }; 2832e52eb74SRichard Weinberger 2841e51764aSArtem Bityutskiy /** 2851e51764aSArtem Bityutskiy * struct ubifs_old_idx - index node obsoleted since last commit start. 2861e51764aSArtem Bityutskiy * @rb: rb-tree node 2871e51764aSArtem Bityutskiy * @lnum: LEB number of obsoleted index node 2881e51764aSArtem Bityutskiy * @offs: offset of obsoleted index node 2891e51764aSArtem Bityutskiy */ 2901e51764aSArtem Bityutskiy struct ubifs_old_idx { 2911e51764aSArtem Bityutskiy struct rb_node rb; 2921e51764aSArtem Bityutskiy int lnum; 2931e51764aSArtem Bityutskiy int offs; 2941e51764aSArtem Bityutskiy }; 2951e51764aSArtem Bityutskiy 2961e51764aSArtem Bityutskiy /* The below union makes it easier to deal with keys */ 2971e51764aSArtem Bityutskiy union ubifs_key { 2987ca58badSArtem Bityutskiy uint8_t u8[UBIFS_SK_LEN]; 2997ca58badSArtem Bityutskiy uint32_t u32[UBIFS_SK_LEN/4]; 3007ca58badSArtem Bityutskiy uint64_t u64[UBIFS_SK_LEN/8]; 3017ca58badSArtem Bityutskiy __le32 j32[UBIFS_SK_LEN/4]; 3021e51764aSArtem Bityutskiy }; 3031e51764aSArtem Bityutskiy 3041e51764aSArtem Bityutskiy /** 3051e51764aSArtem Bityutskiy * struct ubifs_scan_node - UBIFS scanned node information. 3061e51764aSArtem Bityutskiy * @list: list of scanned nodes 3071e51764aSArtem Bityutskiy * @key: key of node scanned (if it has one) 3081e51764aSArtem Bityutskiy * @sqnum: sequence number 3091e51764aSArtem Bityutskiy * @type: type of node scanned 3101e51764aSArtem Bityutskiy * @offs: offset with LEB of node scanned 3111e51764aSArtem Bityutskiy * @len: length of node scanned 3121e51764aSArtem Bityutskiy * @node: raw node 3131e51764aSArtem Bityutskiy */ 3141e51764aSArtem Bityutskiy struct ubifs_scan_node { 3151e51764aSArtem Bityutskiy struct list_head list; 3161e51764aSArtem Bityutskiy union ubifs_key key; 3171e51764aSArtem Bityutskiy unsigned long long sqnum; 3181e51764aSArtem Bityutskiy int type; 3191e51764aSArtem Bityutskiy int offs; 3201e51764aSArtem Bityutskiy int len; 3211e51764aSArtem Bityutskiy void *node; 3221e51764aSArtem Bityutskiy }; 3231e51764aSArtem Bityutskiy 3241e51764aSArtem Bityutskiy /** 3251e51764aSArtem Bityutskiy * struct ubifs_scan_leb - UBIFS scanned LEB information. 3261e51764aSArtem Bityutskiy * @lnum: logical eraseblock number 3271e51764aSArtem Bityutskiy * @nodes_cnt: number of nodes scanned 3281e51764aSArtem Bityutskiy * @nodes: list of struct ubifs_scan_node 3291e51764aSArtem Bityutskiy * @endpt: end point (and therefore the start of empty space) 3301e51764aSArtem Bityutskiy * @buf: buffer containing entire LEB scanned 3311e51764aSArtem Bityutskiy */ 3321e51764aSArtem Bityutskiy struct ubifs_scan_leb { 3331e51764aSArtem Bityutskiy int lnum; 3341e51764aSArtem Bityutskiy int nodes_cnt; 3351e51764aSArtem Bityutskiy struct list_head nodes; 3361e51764aSArtem Bityutskiy int endpt; 3371e51764aSArtem Bityutskiy void *buf; 3381e51764aSArtem Bityutskiy }; 3391e51764aSArtem Bityutskiy 3401e51764aSArtem Bityutskiy /** 3411e51764aSArtem Bityutskiy * struct ubifs_gced_idx_leb - garbage-collected indexing LEB. 3421e51764aSArtem Bityutskiy * @list: list 3431e51764aSArtem Bityutskiy * @lnum: LEB number 3441e51764aSArtem Bityutskiy * @unmap: OK to unmap this LEB 3451e51764aSArtem Bityutskiy * 3461e51764aSArtem Bityutskiy * This data structure is used to temporary store garbage-collected indexing 3471e51764aSArtem Bityutskiy * LEBs - they are not released immediately, but only after the next commit. 3481e51764aSArtem Bityutskiy * This is needed to guarantee recoverability. 3491e51764aSArtem Bityutskiy */ 3501e51764aSArtem Bityutskiy struct ubifs_gced_idx_leb { 3511e51764aSArtem Bityutskiy struct list_head list; 3521e51764aSArtem Bityutskiy int lnum; 3531e51764aSArtem Bityutskiy int unmap; 3541e51764aSArtem Bityutskiy }; 3551e51764aSArtem Bityutskiy 3561e51764aSArtem Bityutskiy /** 3571e51764aSArtem Bityutskiy * struct ubifs_inode - UBIFS in-memory inode description. 3581e51764aSArtem Bityutskiy * @vfs_inode: VFS inode description object 3591e51764aSArtem Bityutskiy * @creat_sqnum: sequence number at time of creation 360de94eb55SArtem Bityutskiy * @del_cmtno: commit number corresponding to the time the inode was deleted, 361de94eb55SArtem Bityutskiy * protected by @c->commit_sem; 3621e51764aSArtem Bityutskiy * @xattr_size: summarized size of all extended attributes in bytes 3631e51764aSArtem Bityutskiy * @xattr_cnt: count of extended attributes this inode has 3641e51764aSArtem Bityutskiy * @xattr_names: sum of lengths of all extended attribute names belonging to 3651e51764aSArtem Bityutskiy * this inode 3661e51764aSArtem Bityutskiy * @dirty: non-zero if the inode is dirty 3671e51764aSArtem Bityutskiy * @xattr: non-zero if this is an extended attribute inode 368625bf371SArtem Bityutskiy * @bulk_read: non-zero if bulk-read should be used 3691e51764aSArtem Bityutskiy * @ui_mutex: serializes inode write-back with the rest of VFS operations, 3704793e7c5SAdrian Hunter * serializes "clean <-> dirty" state changes, serializes bulk-read, 371ba60ecabSArtem Bityutskiy * protects @dirty, @bulk_read, @ui_size, and @xattr_size 3721e51764aSArtem Bityutskiy * @ui_lock: protects @synced_i_size 3731e51764aSArtem Bityutskiy * @synced_i_size: synchronized size of inode, i.e. the value of inode size 3741e51764aSArtem Bityutskiy * currently stored on the flash; used only for regular file 3751e51764aSArtem Bityutskiy * inodes 3761e51764aSArtem Bityutskiy * @ui_size: inode size used by UBIFS when writing to flash 3771e51764aSArtem Bityutskiy * @flags: inode flags (@UBIFS_COMPR_FL, etc) 3781e51764aSArtem Bityutskiy * @compr_type: default compression type used for this inode 3794793e7c5SAdrian Hunter * @last_page_read: page number of last page read (for bulk read) 3804793e7c5SAdrian Hunter * @read_in_a_row: number of consecutive pages read in a row (for bulk read) 3811e51764aSArtem Bityutskiy * @data_len: length of the data attached to the inode 3821e51764aSArtem Bityutskiy * @data: inode's data 3831e51764aSArtem Bityutskiy * 3841e51764aSArtem Bityutskiy * @ui_mutex exists for two main reasons. At first it prevents inodes from 3851e51764aSArtem Bityutskiy * being written back while UBIFS changing them, being in the middle of an VFS 3861e51764aSArtem Bityutskiy * operation. This way UBIFS makes sure the inode fields are consistent. For 3871e51764aSArtem Bityutskiy * example, in 'ubifs_rename()' we change 3 inodes simultaneously, and 3881e51764aSArtem Bityutskiy * write-back must not write any of them before we have finished. 3891e51764aSArtem Bityutskiy * 3901e51764aSArtem Bityutskiy * The second reason is budgeting - UBIFS has to budget all operations. If an 3911e51764aSArtem Bityutskiy * operation is going to mark an inode dirty, it has to allocate budget for 3921e51764aSArtem Bityutskiy * this. It cannot just mark it dirty because there is no guarantee there will 3931e51764aSArtem Bityutskiy * be enough flash space to write the inode back later. This means UBIFS has 3941e51764aSArtem Bityutskiy * to have full control over inode "clean <-> dirty" transitions (and pages 3951e51764aSArtem Bityutskiy * actually). But unfortunately, VFS marks inodes dirty in many places, and it 3961e51764aSArtem Bityutskiy * does not ask the file-system if it is allowed to do so (there is a notifier, 3971e51764aSArtem Bityutskiy * but it is not enough), i.e., there is no mechanism to synchronize with this. 3981e51764aSArtem Bityutskiy * So UBIFS has its own inode dirty flag and its own mutex to serialize 3991e51764aSArtem Bityutskiy * "clean <-> dirty" transitions. 4001e51764aSArtem Bityutskiy * 4011e51764aSArtem Bityutskiy * The @synced_i_size field is used to make sure we never write pages which are 4021e51764aSArtem Bityutskiy * beyond last synchronized inode size. See 'ubifs_writepage()' for more 4031e51764aSArtem Bityutskiy * information. 4041e51764aSArtem Bityutskiy * 4051e51764aSArtem Bityutskiy * The @ui_size is a "shadow" variable for @inode->i_size and UBIFS uses 4061e51764aSArtem Bityutskiy * @ui_size instead of @inode->i_size. The reason for this is that UBIFS cannot 4071e51764aSArtem Bityutskiy * make sure @inode->i_size is always changed under @ui_mutex, because it 408c4361570SArtem Bityutskiy * cannot call 'truncate_setsize()' with @ui_mutex locked, because it would 409c4361570SArtem Bityutskiy * deadlock with 'ubifs_writepage()' (see file.c). All the other inode fields 410c4361570SArtem Bityutskiy * are changed under @ui_mutex, so they do not need "shadow" fields. Note, one 4111e51764aSArtem Bityutskiy * could consider to rework locking and base it on "shadow" fields. 4121e51764aSArtem Bityutskiy */ 4131e51764aSArtem Bityutskiy struct ubifs_inode { 4141e51764aSArtem Bityutskiy struct inode vfs_inode; 4151e51764aSArtem Bityutskiy unsigned long long creat_sqnum; 416de94eb55SArtem Bityutskiy unsigned long long del_cmtno; 4171e51764aSArtem Bityutskiy unsigned int xattr_size; 4181e51764aSArtem Bityutskiy unsigned int xattr_cnt; 4191e51764aSArtem Bityutskiy unsigned int xattr_names; 4201e51764aSArtem Bityutskiy unsigned int dirty:1; 4211e51764aSArtem Bityutskiy unsigned int xattr:1; 422625bf371SArtem Bityutskiy unsigned int bulk_read:1; 423a1dc080cSArtem Bityutskiy unsigned int compr_type:2; 4241e51764aSArtem Bityutskiy struct mutex ui_mutex; 4251e51764aSArtem Bityutskiy spinlock_t ui_lock; 4261e51764aSArtem Bityutskiy loff_t synced_i_size; 4271e51764aSArtem Bityutskiy loff_t ui_size; 4281e51764aSArtem Bityutskiy int flags; 4294793e7c5SAdrian Hunter pgoff_t last_page_read; 4304793e7c5SAdrian Hunter pgoff_t read_in_a_row; 4311e51764aSArtem Bityutskiy int data_len; 4321e51764aSArtem Bityutskiy void *data; 4331e51764aSArtem Bityutskiy }; 4341e51764aSArtem Bityutskiy 4351e51764aSArtem Bityutskiy /** 4361e51764aSArtem Bityutskiy * struct ubifs_unclean_leb - records a LEB recovered under read-only mode. 4371e51764aSArtem Bityutskiy * @list: list 4381e51764aSArtem Bityutskiy * @lnum: LEB number of recovered LEB 4391e51764aSArtem Bityutskiy * @endpt: offset where recovery ended 4401e51764aSArtem Bityutskiy * 4411e51764aSArtem Bityutskiy * This structure records a LEB identified during recovery that needs to be 4421e51764aSArtem Bityutskiy * cleaned but was not because UBIFS was mounted read-only. The information 4431e51764aSArtem Bityutskiy * is used to clean the LEB when remounting to read-write mode. 4441e51764aSArtem Bityutskiy */ 4451e51764aSArtem Bityutskiy struct ubifs_unclean_leb { 4461e51764aSArtem Bityutskiy struct list_head list; 4471e51764aSArtem Bityutskiy int lnum; 4481e51764aSArtem Bityutskiy int endpt; 4491e51764aSArtem Bityutskiy }; 4501e51764aSArtem Bityutskiy 4511e51764aSArtem Bityutskiy /* 4521e51764aSArtem Bityutskiy * LEB properties flags. 4531e51764aSArtem Bityutskiy * 4541e51764aSArtem Bityutskiy * LPROPS_UNCAT: not categorized 4557078202eSArtem Bityutskiy * LPROPS_DIRTY: dirty > free, dirty >= @c->dead_wm, not index 45621a60258SArtem Bityutskiy * LPROPS_DIRTY_IDX: dirty + free > @c->min_idx_node_sze and index 4577078202eSArtem Bityutskiy * LPROPS_FREE: free > 0, dirty < @c->dead_wm, not empty, not index 4581e51764aSArtem Bityutskiy * LPROPS_HEAP_CNT: number of heaps used for storing categorized LEBs 4591e51764aSArtem Bityutskiy * LPROPS_EMPTY: LEB is empty, not taken 4601e51764aSArtem Bityutskiy * LPROPS_FREEABLE: free + dirty == leb_size, not index, not taken 4611e51764aSArtem Bityutskiy * LPROPS_FRDI_IDX: free + dirty == leb_size and index, may be taken 4621e51764aSArtem Bityutskiy * LPROPS_CAT_MASK: mask for the LEB categories above 4631e51764aSArtem Bityutskiy * LPROPS_TAKEN: LEB was taken (this flag is not saved on the media) 4641e51764aSArtem Bityutskiy * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash) 4651e51764aSArtem Bityutskiy */ 4661e51764aSArtem Bityutskiy enum { 4671e51764aSArtem Bityutskiy LPROPS_UNCAT = 0, 4681e51764aSArtem Bityutskiy LPROPS_DIRTY = 1, 4691e51764aSArtem Bityutskiy LPROPS_DIRTY_IDX = 2, 4701e51764aSArtem Bityutskiy LPROPS_FREE = 3, 4711e51764aSArtem Bityutskiy LPROPS_HEAP_CNT = 3, 4721e51764aSArtem Bityutskiy LPROPS_EMPTY = 4, 4731e51764aSArtem Bityutskiy LPROPS_FREEABLE = 5, 4741e51764aSArtem Bityutskiy LPROPS_FRDI_IDX = 6, 4751e51764aSArtem Bityutskiy LPROPS_CAT_MASK = 15, 4761e51764aSArtem Bityutskiy LPROPS_TAKEN = 16, 4771e51764aSArtem Bityutskiy LPROPS_INDEX = 32, 4781e51764aSArtem Bityutskiy }; 4791e51764aSArtem Bityutskiy 4801e51764aSArtem Bityutskiy /** 4811e51764aSArtem Bityutskiy * struct ubifs_lprops - logical eraseblock properties. 4821e51764aSArtem Bityutskiy * @free: amount of free space in bytes 4831e51764aSArtem Bityutskiy * @dirty: amount of dirty space in bytes 4841e51764aSArtem Bityutskiy * @flags: LEB properties flags (see above) 4851e51764aSArtem Bityutskiy * @lnum: LEB number 4861e51764aSArtem Bityutskiy * @list: list of same-category lprops (for LPROPS_EMPTY and LPROPS_FREEABLE) 4871e51764aSArtem Bityutskiy * @hpos: heap position in heap of same-category lprops (other categories) 4881e51764aSArtem Bityutskiy */ 4891e51764aSArtem Bityutskiy struct ubifs_lprops { 4901e51764aSArtem Bityutskiy int free; 4911e51764aSArtem Bityutskiy int dirty; 4921e51764aSArtem Bityutskiy int flags; 4931e51764aSArtem Bityutskiy int lnum; 4941e51764aSArtem Bityutskiy union { 4951e51764aSArtem Bityutskiy struct list_head list; 4961e51764aSArtem Bityutskiy int hpos; 4971e51764aSArtem Bityutskiy }; 4981e51764aSArtem Bityutskiy }; 4991e51764aSArtem Bityutskiy 5001e51764aSArtem Bityutskiy /** 5011e51764aSArtem Bityutskiy * struct ubifs_lpt_lprops - LPT logical eraseblock properties. 5021e51764aSArtem Bityutskiy * @free: amount of free space in bytes 5031e51764aSArtem Bityutskiy * @dirty: amount of dirty space in bytes 5041e51764aSArtem Bityutskiy * @tgc: trivial GC flag (1 => unmap after commit end) 5051e51764aSArtem Bityutskiy * @cmt: commit flag (1 => reserved for commit) 5061e51764aSArtem Bityutskiy */ 5071e51764aSArtem Bityutskiy struct ubifs_lpt_lprops { 5081e51764aSArtem Bityutskiy int free; 5091e51764aSArtem Bityutskiy int dirty; 5101e51764aSArtem Bityutskiy unsigned tgc:1; 5111e51764aSArtem Bityutskiy unsigned cmt:1; 5121e51764aSArtem Bityutskiy }; 5131e51764aSArtem Bityutskiy 5141e51764aSArtem Bityutskiy /** 5151e51764aSArtem Bityutskiy * struct ubifs_lp_stats - statistics of eraseblocks in the main area. 5161e51764aSArtem Bityutskiy * @empty_lebs: number of empty LEBs 5171e51764aSArtem Bityutskiy * @taken_empty_lebs: number of taken LEBs 5181e51764aSArtem Bityutskiy * @idx_lebs: number of indexing LEBs 519d3cf502bSArtem Bityutskiy * @total_free: total free space in bytes (includes all LEBs) 520d3cf502bSArtem Bityutskiy * @total_dirty: total dirty space in bytes (includes all LEBs) 521d3cf502bSArtem Bityutskiy * @total_used: total used space in bytes (does not include index LEBs) 522d3cf502bSArtem Bityutskiy * @total_dead: total dead space in bytes (does not include index LEBs) 523d3cf502bSArtem Bityutskiy * @total_dark: total dark space in bytes (does not include index LEBs) 5241e51764aSArtem Bityutskiy * 525d3cf502bSArtem Bityutskiy * The @taken_empty_lebs field counts the LEBs that are in the transient state 526d3cf502bSArtem Bityutskiy * of having been "taken" for use but not yet written to. @taken_empty_lebs is 527d3cf502bSArtem Bityutskiy * needed to account correctly for @gc_lnum, otherwise @empty_lebs could be 528d3cf502bSArtem Bityutskiy * used by itself (in which case 'unused_lebs' would be a better name). In the 529d3cf502bSArtem Bityutskiy * case of @gc_lnum, it is "taken" at mount time or whenever a LEB is retained 530d3cf502bSArtem Bityutskiy * by GC, but unlike other empty LEBs that are "taken", it may not be written 531d3cf502bSArtem Bityutskiy * straight away (i.e. before the next commit start or unmount), so either 532d3cf502bSArtem Bityutskiy * @gc_lnum must be specially accounted for, or the current approach followed 533d3cf502bSArtem Bityutskiy * i.e. count it under @taken_empty_lebs. 5341e51764aSArtem Bityutskiy * 535d3cf502bSArtem Bityutskiy * @empty_lebs includes @taken_empty_lebs. 536d3cf502bSArtem Bityutskiy * 537d3cf502bSArtem Bityutskiy * @total_used, @total_dead and @total_dark fields do not account indexing 538d3cf502bSArtem Bityutskiy * LEBs. 5391e51764aSArtem Bityutskiy */ 5401e51764aSArtem Bityutskiy struct ubifs_lp_stats { 5411e51764aSArtem Bityutskiy int empty_lebs; 5421e51764aSArtem Bityutskiy int taken_empty_lebs; 5431e51764aSArtem Bityutskiy int idx_lebs; 5441e51764aSArtem Bityutskiy long long total_free; 5451e51764aSArtem Bityutskiy long long total_dirty; 5461e51764aSArtem Bityutskiy long long total_used; 5471e51764aSArtem Bityutskiy long long total_dead; 5481e51764aSArtem Bityutskiy long long total_dark; 5491e51764aSArtem Bityutskiy }; 5501e51764aSArtem Bityutskiy 5511e51764aSArtem Bityutskiy struct ubifs_nnode; 5521e51764aSArtem Bityutskiy 5531e51764aSArtem Bityutskiy /** 5541e51764aSArtem Bityutskiy * struct ubifs_cnode - LEB Properties Tree common node. 5551e51764aSArtem Bityutskiy * @parent: parent nnode 5561e51764aSArtem Bityutskiy * @cnext: next cnode to commit 5571e51764aSArtem Bityutskiy * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 5581e51764aSArtem Bityutskiy * @iip: index in parent 5591e51764aSArtem Bityutskiy * @level: level in the tree (zero for pnodes, greater than zero for nnodes) 5601e51764aSArtem Bityutskiy * @num: node number 5611e51764aSArtem Bityutskiy */ 5621e51764aSArtem Bityutskiy struct ubifs_cnode { 5631e51764aSArtem Bityutskiy struct ubifs_nnode *parent; 5641e51764aSArtem Bityutskiy struct ubifs_cnode *cnext; 5651e51764aSArtem Bityutskiy unsigned long flags; 5661e51764aSArtem Bityutskiy int iip; 5671e51764aSArtem Bityutskiy int level; 5681e51764aSArtem Bityutskiy int num; 5691e51764aSArtem Bityutskiy }; 5701e51764aSArtem Bityutskiy 5711e51764aSArtem Bityutskiy /** 5721e51764aSArtem Bityutskiy * struct ubifs_pnode - LEB Properties Tree leaf node. 5731e51764aSArtem Bityutskiy * @parent: parent nnode 5741e51764aSArtem Bityutskiy * @cnext: next cnode to commit 5751e51764aSArtem Bityutskiy * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 5761e51764aSArtem Bityutskiy * @iip: index in parent 5771e51764aSArtem Bityutskiy * @level: level in the tree (always zero for pnodes) 5781e51764aSArtem Bityutskiy * @num: node number 5791e51764aSArtem Bityutskiy * @lprops: LEB properties array 5801e51764aSArtem Bityutskiy */ 5811e51764aSArtem Bityutskiy struct ubifs_pnode { 5821e51764aSArtem Bityutskiy struct ubifs_nnode *parent; 5831e51764aSArtem Bityutskiy struct ubifs_cnode *cnext; 5841e51764aSArtem Bityutskiy unsigned long flags; 5851e51764aSArtem Bityutskiy int iip; 5861e51764aSArtem Bityutskiy int level; 5871e51764aSArtem Bityutskiy int num; 5881e51764aSArtem Bityutskiy struct ubifs_lprops lprops[UBIFS_LPT_FANOUT]; 5891e51764aSArtem Bityutskiy }; 5901e51764aSArtem Bityutskiy 5911e51764aSArtem Bityutskiy /** 5921e51764aSArtem Bityutskiy * struct ubifs_nbranch - LEB Properties Tree internal node branch. 5931e51764aSArtem Bityutskiy * @lnum: LEB number of child 5941e51764aSArtem Bityutskiy * @offs: offset of child 5951e51764aSArtem Bityutskiy * @nnode: nnode child 5961e51764aSArtem Bityutskiy * @pnode: pnode child 5971e51764aSArtem Bityutskiy * @cnode: cnode child 5981e51764aSArtem Bityutskiy */ 5991e51764aSArtem Bityutskiy struct ubifs_nbranch { 6001e51764aSArtem Bityutskiy int lnum; 6011e51764aSArtem Bityutskiy int offs; 6021e51764aSArtem Bityutskiy union { 6031e51764aSArtem Bityutskiy struct ubifs_nnode *nnode; 6041e51764aSArtem Bityutskiy struct ubifs_pnode *pnode; 6051e51764aSArtem Bityutskiy struct ubifs_cnode *cnode; 6061e51764aSArtem Bityutskiy }; 6071e51764aSArtem Bityutskiy }; 6081e51764aSArtem Bityutskiy 6091e51764aSArtem Bityutskiy /** 6101e51764aSArtem Bityutskiy * struct ubifs_nnode - LEB Properties Tree internal node. 6111e51764aSArtem Bityutskiy * @parent: parent nnode 6121e51764aSArtem Bityutskiy * @cnext: next cnode to commit 6131e51764aSArtem Bityutskiy * @flags: flags (%DIRTY_LPT_NODE or %OBSOLETE_LPT_NODE) 6141e51764aSArtem Bityutskiy * @iip: index in parent 6151e51764aSArtem Bityutskiy * @level: level in the tree (always greater than zero for nnodes) 6161e51764aSArtem Bityutskiy * @num: node number 6171e51764aSArtem Bityutskiy * @nbranch: branches to child nodes 6181e51764aSArtem Bityutskiy */ 6191e51764aSArtem Bityutskiy struct ubifs_nnode { 6201e51764aSArtem Bityutskiy struct ubifs_nnode *parent; 6211e51764aSArtem Bityutskiy struct ubifs_cnode *cnext; 6221e51764aSArtem Bityutskiy unsigned long flags; 6231e51764aSArtem Bityutskiy int iip; 6241e51764aSArtem Bityutskiy int level; 6251e51764aSArtem Bityutskiy int num; 6261e51764aSArtem Bityutskiy struct ubifs_nbranch nbranch[UBIFS_LPT_FANOUT]; 6271e51764aSArtem Bityutskiy }; 6281e51764aSArtem Bityutskiy 6291e51764aSArtem Bityutskiy /** 6301e51764aSArtem Bityutskiy * struct ubifs_lpt_heap - heap of categorized lprops. 6311e51764aSArtem Bityutskiy * @arr: heap array 6321e51764aSArtem Bityutskiy * @cnt: number in heap 6331e51764aSArtem Bityutskiy * @max_cnt: maximum number allowed in heap 6341e51764aSArtem Bityutskiy * 6351e51764aSArtem Bityutskiy * There are %LPROPS_HEAP_CNT heaps. 6361e51764aSArtem Bityutskiy */ 6371e51764aSArtem Bityutskiy struct ubifs_lpt_heap { 6381e51764aSArtem Bityutskiy struct ubifs_lprops **arr; 6391e51764aSArtem Bityutskiy int cnt; 6401e51764aSArtem Bityutskiy int max_cnt; 6411e51764aSArtem Bityutskiy }; 6421e51764aSArtem Bityutskiy 6431e51764aSArtem Bityutskiy /* 6441e51764aSArtem Bityutskiy * Return codes for LPT scan callback function. 6451e51764aSArtem Bityutskiy * 6461e51764aSArtem Bityutskiy * LPT_SCAN_CONTINUE: continue scanning 6471e51764aSArtem Bityutskiy * LPT_SCAN_ADD: add the LEB properties scanned to the tree in memory 6481e51764aSArtem Bityutskiy * LPT_SCAN_STOP: stop scanning 6491e51764aSArtem Bityutskiy */ 6501e51764aSArtem Bityutskiy enum { 6511e51764aSArtem Bityutskiy LPT_SCAN_CONTINUE = 0, 6521e51764aSArtem Bityutskiy LPT_SCAN_ADD = 1, 6531e51764aSArtem Bityutskiy LPT_SCAN_STOP = 2, 6541e51764aSArtem Bityutskiy }; 6551e51764aSArtem Bityutskiy 6561e51764aSArtem Bityutskiy struct ubifs_info; 6571e51764aSArtem Bityutskiy 6581e51764aSArtem Bityutskiy /* Callback used by the 'ubifs_lpt_scan_nolock()' function */ 6591e51764aSArtem Bityutskiy typedef int (*ubifs_lpt_scan_callback)(struct ubifs_info *c, 6601e51764aSArtem Bityutskiy const struct ubifs_lprops *lprops, 6611e51764aSArtem Bityutskiy int in_tree, void *data); 6621e51764aSArtem Bityutskiy 6631e51764aSArtem Bityutskiy /** 6641e51764aSArtem Bityutskiy * struct ubifs_wbuf - UBIFS write-buffer. 6651e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 6661e51764aSArtem Bityutskiy * @buf: write-buffer (of min. flash I/O unit size) 6671e51764aSArtem Bityutskiy * @lnum: logical eraseblock number the write-buffer points to 6681e51764aSArtem Bityutskiy * @offs: write-buffer offset in this logical eraseblock 6691e51764aSArtem Bityutskiy * @avail: number of bytes available in the write-buffer 6701e51764aSArtem Bityutskiy * @used: number of used bytes in the write-buffer 6713c89f396SArtem Bityutskiy * @size: write-buffer size (in [@c->min_io_size, @c->max_write_size] range) 6721e51764aSArtem Bityutskiy * @jhead: journal head the mutex belongs to (note, needed only to shut lockdep 6731e51764aSArtem Bityutskiy * up by 'mutex_lock_nested()). 6741e51764aSArtem Bityutskiy * @sync_callback: write-buffer synchronization callback 6751e51764aSArtem Bityutskiy * @io_mutex: serializes write-buffer I/O 6761e51764aSArtem Bityutskiy * @lock: serializes @buf, @lnum, @offs, @avail, @used, @next_ino and @inodes 6771e51764aSArtem Bityutskiy * fields 6781e51764aSArtem Bityutskiy * @timer: write-buffer timer 679681947d2SAdrian Hunter * @no_timer: non-zero if this write-buffer does not have a timer 680681947d2SAdrian Hunter * @need_sync: non-zero if the timer expired and the wbuf needs sync'ing 6811e51764aSArtem Bityutskiy * @next_ino: points to the next position of the following inode number 6821e51764aSArtem Bityutskiy * @inodes: stores the inode numbers of the nodes which are in wbuf 6831e51764aSArtem Bityutskiy * 6841e51764aSArtem Bityutskiy * The write-buffer synchronization callback is called when the write-buffer is 6851e51764aSArtem Bityutskiy * synchronized in order to notify how much space was wasted due to 6861e51764aSArtem Bityutskiy * write-buffer padding and how much free space is left in the LEB. 6871e51764aSArtem Bityutskiy * 6881e51764aSArtem Bityutskiy * Note: the fields @buf, @lnum, @offs, @avail and @used can be read under 6891e51764aSArtem Bityutskiy * spin-lock or mutex because they are written under both mutex and spin-lock. 6901e51764aSArtem Bityutskiy * @buf is appended to under mutex but overwritten under both mutex and 6911e51764aSArtem Bityutskiy * spin-lock. Thus the data between @buf and @buf + @used can be read under 6921e51764aSArtem Bityutskiy * spinlock. 6931e51764aSArtem Bityutskiy */ 6941e51764aSArtem Bityutskiy struct ubifs_wbuf { 6951e51764aSArtem Bityutskiy struct ubifs_info *c; 6961e51764aSArtem Bityutskiy void *buf; 6971e51764aSArtem Bityutskiy int lnum; 6981e51764aSArtem Bityutskiy int offs; 6991e51764aSArtem Bityutskiy int avail; 7001e51764aSArtem Bityutskiy int used; 7013c89f396SArtem Bityutskiy int size; 7021e51764aSArtem Bityutskiy int jhead; 7031e51764aSArtem Bityutskiy int (*sync_callback)(struct ubifs_info *c, int lnum, int free, int pad); 7041e51764aSArtem Bityutskiy struct mutex io_mutex; 7051e51764aSArtem Bityutskiy spinlock_t lock; 706f2c5dbd7SArtem Bityutskiy struct hrtimer timer; 7070b335b9dSArtem Bityutskiy unsigned int no_timer:1; 7080b335b9dSArtem Bityutskiy unsigned int need_sync:1; 7091e51764aSArtem Bityutskiy int next_ino; 7101e51764aSArtem Bityutskiy ino_t *inodes; 7111e51764aSArtem Bityutskiy }; 7121e51764aSArtem Bityutskiy 7131e51764aSArtem Bityutskiy /** 7141e51764aSArtem Bityutskiy * struct ubifs_bud - bud logical eraseblock. 7151e51764aSArtem Bityutskiy * @lnum: logical eraseblock number 7161e51764aSArtem Bityutskiy * @start: where the (uncommitted) bud data starts 7171e51764aSArtem Bityutskiy * @jhead: journal head number this bud belongs to 7181e51764aSArtem Bityutskiy * @list: link in the list buds belonging to the same journal head 7191e51764aSArtem Bityutskiy * @rb: link in the tree of all buds 7206a98bc46SSascha Hauer * @log_hash: the log hash from the commit start node up to this bud 7211e51764aSArtem Bityutskiy */ 7221e51764aSArtem Bityutskiy struct ubifs_bud { 7231e51764aSArtem Bityutskiy int lnum; 7241e51764aSArtem Bityutskiy int start; 7251e51764aSArtem Bityutskiy int jhead; 7261e51764aSArtem Bityutskiy struct list_head list; 7271e51764aSArtem Bityutskiy struct rb_node rb; 7286a98bc46SSascha Hauer struct shash_desc *log_hash; 7291e51764aSArtem Bityutskiy }; 7301e51764aSArtem Bityutskiy 7311e51764aSArtem Bityutskiy /** 7321e51764aSArtem Bityutskiy * struct ubifs_jhead - journal head. 7331e51764aSArtem Bityutskiy * @wbuf: head's write-buffer 7341e51764aSArtem Bityutskiy * @buds_list: list of bud LEBs belonging to this journal head 7351a0b0699SArtem Bityutskiy * @grouped: non-zero if UBIFS groups nodes when writing to this journal head 7366a98bc46SSascha Hauer * @log_hash: the log hash from the commit start node up to this journal head 7371e51764aSArtem Bityutskiy * 7381e51764aSArtem Bityutskiy * Note, the @buds list is protected by the @c->buds_lock. 7391e51764aSArtem Bityutskiy */ 7401e51764aSArtem Bityutskiy struct ubifs_jhead { 7411e51764aSArtem Bityutskiy struct ubifs_wbuf wbuf; 7421e51764aSArtem Bityutskiy struct list_head buds_list; 7431a0b0699SArtem Bityutskiy unsigned int grouped:1; 7446a98bc46SSascha Hauer struct shash_desc *log_hash; 7451e51764aSArtem Bityutskiy }; 7461e51764aSArtem Bityutskiy 7471e51764aSArtem Bityutskiy /** 7481e51764aSArtem Bityutskiy * struct ubifs_zbranch - key/coordinate/length branch stored in znodes. 7491e51764aSArtem Bityutskiy * @key: key 7501e51764aSArtem Bityutskiy * @znode: znode address in memory 751be61678bSArtem Bityutskiy * @lnum: LEB number of the target node (indexing node or data node) 752be61678bSArtem Bityutskiy * @offs: target node offset within @lnum 7531e51764aSArtem Bityutskiy * @len: target node length 754823838a4SSascha Hauer * @hash: the hash of the target node 7551e51764aSArtem Bityutskiy */ 7561e51764aSArtem Bityutskiy struct ubifs_zbranch { 7571e51764aSArtem Bityutskiy union ubifs_key key; 7581e51764aSArtem Bityutskiy union { 7591e51764aSArtem Bityutskiy struct ubifs_znode *znode; 7601e51764aSArtem Bityutskiy void *leaf; 7611e51764aSArtem Bityutskiy }; 7621e51764aSArtem Bityutskiy int lnum; 7631e51764aSArtem Bityutskiy int offs; 7641e51764aSArtem Bityutskiy int len; 765823838a4SSascha Hauer u8 hash[UBIFS_HASH_ARR_SZ]; 7661e51764aSArtem Bityutskiy }; 7671e51764aSArtem Bityutskiy 7681e51764aSArtem Bityutskiy /** 7691e51764aSArtem Bityutskiy * struct ubifs_znode - in-memory representation of an indexing node. 7701e51764aSArtem Bityutskiy * @parent: parent znode or NULL if it is the root 7711e51764aSArtem Bityutskiy * @cnext: next znode to commit 77216a26b20SSascha Hauer * @cparent: parent node for this commit 77316a26b20SSascha Hauer * @ciip: index in cparent's zbranch array 7741e51764aSArtem Bityutskiy * @flags: znode flags (%DIRTY_ZNODE, %COW_ZNODE or %OBSOLETE_ZNODE) 7751e51764aSArtem Bityutskiy * @time: last access time (seconds) 7761e51764aSArtem Bityutskiy * @level: level of the entry in the TNC tree 7771e51764aSArtem Bityutskiy * @child_cnt: count of child znodes 7781e51764aSArtem Bityutskiy * @iip: index in parent's zbranch array 7791e51764aSArtem Bityutskiy * @alt: lower bound of key range has altered i.e. child inserted at slot 0 7801e51764aSArtem Bityutskiy * @lnum: LEB number of the corresponding indexing node 7811e51764aSArtem Bityutskiy * @offs: offset of the corresponding indexing node 7821e51764aSArtem Bityutskiy * @len: length of the corresponding indexing node 7831e51764aSArtem Bityutskiy * @zbranch: array of znode branches (@c->fanout elements) 784f70b7e52SArtem Bityutskiy * 785f70b7e52SArtem Bityutskiy * Note! The @lnum, @offs, and @len fields are not really needed - we have them 786f70b7e52SArtem Bityutskiy * only for internal consistency check. They could be removed to save some RAM. 7871e51764aSArtem Bityutskiy */ 7881e51764aSArtem Bityutskiy struct ubifs_znode { 7891e51764aSArtem Bityutskiy struct ubifs_znode *parent; 7901e51764aSArtem Bityutskiy struct ubifs_znode *cnext; 79116a26b20SSascha Hauer struct ubifs_znode *cparent; 79216a26b20SSascha Hauer int ciip; 7931e51764aSArtem Bityutskiy unsigned long flags; 7946cff5732SArnd Bergmann time64_t time; 7951e51764aSArtem Bityutskiy int level; 7961e51764aSArtem Bityutskiy int child_cnt; 7971e51764aSArtem Bityutskiy int iip; 7981e51764aSArtem Bityutskiy int alt; 799f70b7e52SArtem Bityutskiy int lnum; 800f70b7e52SArtem Bityutskiy int offs; 801f70b7e52SArtem Bityutskiy int len; 8021e51764aSArtem Bityutskiy struct ubifs_zbranch zbranch[]; 8031e51764aSArtem Bityutskiy }; 8041e51764aSArtem Bityutskiy 8051e51764aSArtem Bityutskiy /** 80639ce81ceSArtem Bityutskiy * struct bu_info - bulk-read information. 8074793e7c5SAdrian Hunter * @key: first data node key 8084793e7c5SAdrian Hunter * @zbranch: zbranches of data nodes to bulk read 8094793e7c5SAdrian Hunter * @buf: buffer to read into 8104793e7c5SAdrian Hunter * @buf_len: buffer length 8114793e7c5SAdrian Hunter * @gc_seq: GC sequence number to detect races with GC 8124793e7c5SAdrian Hunter * @cnt: number of data nodes for bulk read 8134793e7c5SAdrian Hunter * @blk_cnt: number of data blocks including holes 8144793e7c5SAdrian Hunter * @oef: end of file reached 8154793e7c5SAdrian Hunter */ 8164793e7c5SAdrian Hunter struct bu_info { 8174793e7c5SAdrian Hunter union ubifs_key key; 8184793e7c5SAdrian Hunter struct ubifs_zbranch zbranch[UBIFS_MAX_BULK_READ]; 8194793e7c5SAdrian Hunter void *buf; 8204793e7c5SAdrian Hunter int buf_len; 8214793e7c5SAdrian Hunter int gc_seq; 8224793e7c5SAdrian Hunter int cnt; 8234793e7c5SAdrian Hunter int blk_cnt; 8244793e7c5SAdrian Hunter int eof; 8254793e7c5SAdrian Hunter }; 8264793e7c5SAdrian Hunter 8274793e7c5SAdrian Hunter /** 8281e51764aSArtem Bityutskiy * struct ubifs_node_range - node length range description data structure. 8291e51764aSArtem Bityutskiy * @len: fixed node length 8301e51764aSArtem Bityutskiy * @min_len: minimum possible node length 8311e51764aSArtem Bityutskiy * @max_len: maximum possible node length 8321e51764aSArtem Bityutskiy * 8331e51764aSArtem Bityutskiy * If @max_len is %0, the node has fixed length @len. 8341e51764aSArtem Bityutskiy */ 8351e51764aSArtem Bityutskiy struct ubifs_node_range { 8361e51764aSArtem Bityutskiy union { 8371e51764aSArtem Bityutskiy int len; 8381e51764aSArtem Bityutskiy int min_len; 8391e51764aSArtem Bityutskiy }; 8401e51764aSArtem Bityutskiy int max_len; 8411e51764aSArtem Bityutskiy }; 8421e51764aSArtem Bityutskiy 8431e51764aSArtem Bityutskiy /** 8441e51764aSArtem Bityutskiy * struct ubifs_compressor - UBIFS compressor description structure. 8451e51764aSArtem Bityutskiy * @compr_type: compressor type (%UBIFS_COMPR_LZO, etc) 8461e51764aSArtem Bityutskiy * @cc: cryptoapi compressor handle 8471e51764aSArtem Bityutskiy * @comp_mutex: mutex used during compression 8481e51764aSArtem Bityutskiy * @decomp_mutex: mutex used during decompression 8491e51764aSArtem Bityutskiy * @name: compressor name 8501e51764aSArtem Bityutskiy * @capi_name: cryptoapi compressor name 8511e51764aSArtem Bityutskiy */ 8521e51764aSArtem Bityutskiy struct ubifs_compressor { 8531e51764aSArtem Bityutskiy int compr_type; 8541e51764aSArtem Bityutskiy struct crypto_comp *cc; 8551e51764aSArtem Bityutskiy struct mutex *comp_mutex; 8561e51764aSArtem Bityutskiy struct mutex *decomp_mutex; 8571e51764aSArtem Bityutskiy const char *name; 8581e51764aSArtem Bityutskiy const char *capi_name; 8591e51764aSArtem Bityutskiy }; 8601e51764aSArtem Bityutskiy 8611e51764aSArtem Bityutskiy /** 8621e51764aSArtem Bityutskiy * struct ubifs_budget_req - budget requirements of an operation. 8631e51764aSArtem Bityutskiy * 864de94eb55SArtem Bityutskiy * @fast: non-zero if the budgeting should try to acquire budget quickly and 8651e51764aSArtem Bityutskiy * should not try to call write-back 8661e51764aSArtem Bityutskiy * @recalculate: non-zero if @idx_growth, @data_growth, and @dd_growth fields 8671e51764aSArtem Bityutskiy * have to be re-calculated 8681e51764aSArtem Bityutskiy * @new_page: non-zero if the operation adds a new page 8691e51764aSArtem Bityutskiy * @dirtied_page: non-zero if the operation makes a page dirty 8701e51764aSArtem Bityutskiy * @new_dent: non-zero if the operation adds a new directory entry 8711e51764aSArtem Bityutskiy * @mod_dent: non-zero if the operation removes or modifies an existing 8721e51764aSArtem Bityutskiy * directory entry 8731e51764aSArtem Bityutskiy * @new_ino: non-zero if the operation adds a new inode 8747d25b361SDongsheng Yang * @new_ino_d: how much data newly created inode contains 8751e51764aSArtem Bityutskiy * @dirtied_ino: how many inodes the operation makes dirty 8767d25b361SDongsheng Yang * @dirtied_ino_d: how much data dirtied inode contains 8771e51764aSArtem Bityutskiy * @idx_growth: how much the index will supposedly grow 8781e51764aSArtem Bityutskiy * @data_growth: how much new data the operation will supposedly add 8791e51764aSArtem Bityutskiy * @dd_growth: how much data that makes other data dirty the operation will 8801e51764aSArtem Bityutskiy * supposedly add 8811e51764aSArtem Bityutskiy * 8821e51764aSArtem Bityutskiy * @idx_growth, @data_growth and @dd_growth are not used in budget request. The 8831e51764aSArtem Bityutskiy * budgeting subsystem caches index and data growth values there to avoid 8841e51764aSArtem Bityutskiy * re-calculating them when the budget is released. However, if @idx_growth is 8851e51764aSArtem Bityutskiy * %-1, it is calculated by the release function using other fields. 8861e51764aSArtem Bityutskiy * 8871e51764aSArtem Bityutskiy * An inode may contain 4KiB of data at max., thus the widths of @new_ino_d 8881e51764aSArtem Bityutskiy * is 13 bits, and @dirtied_ino_d - 15, because up to 4 inodes may be made 8891e51764aSArtem Bityutskiy * dirty by the re-name operation. 890dab4b4d2SArtem Bityutskiy * 891dab4b4d2SArtem Bityutskiy * Note, UBIFS aligns node lengths to 8-bytes boundary, so the requester has to 892dab4b4d2SArtem Bityutskiy * make sure the amount of inode data which contribute to @new_ino_d and 893dab4b4d2SArtem Bityutskiy * @dirtied_ino_d fields are aligned. 8941e51764aSArtem Bityutskiy */ 8951e51764aSArtem Bityutskiy struct ubifs_budget_req { 8961e51764aSArtem Bityutskiy unsigned int fast:1; 8971e51764aSArtem Bityutskiy unsigned int recalculate:1; 898547000daSArtem Bityutskiy #ifndef UBIFS_DEBUG 8991e51764aSArtem Bityutskiy unsigned int new_page:1; 9001e51764aSArtem Bityutskiy unsigned int dirtied_page:1; 9011e51764aSArtem Bityutskiy unsigned int new_dent:1; 9021e51764aSArtem Bityutskiy unsigned int mod_dent:1; 9031e51764aSArtem Bityutskiy unsigned int new_ino:1; 9041e51764aSArtem Bityutskiy unsigned int new_ino_d:13; 9051e51764aSArtem Bityutskiy unsigned int dirtied_ino:4; 9061e51764aSArtem Bityutskiy unsigned int dirtied_ino_d:15; 9071e51764aSArtem Bityutskiy #else 9081e51764aSArtem Bityutskiy /* Not bit-fields to check for overflows */ 909547000daSArtem Bityutskiy unsigned int new_page; 910547000daSArtem Bityutskiy unsigned int dirtied_page; 911547000daSArtem Bityutskiy unsigned int new_dent; 912547000daSArtem Bityutskiy unsigned int mod_dent; 913547000daSArtem Bityutskiy unsigned int new_ino; 914547000daSArtem Bityutskiy unsigned int new_ino_d; 9151e51764aSArtem Bityutskiy unsigned int dirtied_ino; 9161e51764aSArtem Bityutskiy unsigned int dirtied_ino_d; 9171e51764aSArtem Bityutskiy #endif 9181e51764aSArtem Bityutskiy int idx_growth; 9191e51764aSArtem Bityutskiy int data_growth; 9201e51764aSArtem Bityutskiy int dd_growth; 9211e51764aSArtem Bityutskiy }; 9221e51764aSArtem Bityutskiy 9231e51764aSArtem Bityutskiy /** 9241e51764aSArtem Bityutskiy * struct ubifs_orphan - stores the inode number of an orphan. 9251e51764aSArtem Bityutskiy * @rb: rb-tree node of rb-tree of orphans sorted by inode number 9261e51764aSArtem Bityutskiy * @list: list head of list of orphans in order added 9271e51764aSArtem Bityutskiy * @new_list: list head of list of orphans added since the last commit 9281e51764aSArtem Bityutskiy * @cnext: next orphan to commit 9291e51764aSArtem Bityutskiy * @dnext: next orphan to delete 9301e51764aSArtem Bityutskiy * @inum: inode number 9311e51764aSArtem Bityutskiy * @new: %1 => added since the last commit, otherwise %0 9322928f0d0SAdam Thomas * @cmt: %1 => commit pending, otherwise %0 9338afd500cSAdam Thomas * @del: %1 => delete pending, otherwise %0 9341e51764aSArtem Bityutskiy */ 9351e51764aSArtem Bityutskiy struct ubifs_orphan { 9361e51764aSArtem Bityutskiy struct rb_node rb; 9371e51764aSArtem Bityutskiy struct list_head list; 9381e51764aSArtem Bityutskiy struct list_head new_list; 9391e51764aSArtem Bityutskiy struct ubifs_orphan *cnext; 9401e51764aSArtem Bityutskiy struct ubifs_orphan *dnext; 9411e51764aSArtem Bityutskiy ino_t inum; 9422928f0d0SAdam Thomas unsigned new:1; 9432928f0d0SAdam Thomas unsigned cmt:1; 9448afd500cSAdam Thomas unsigned del:1; 9451e51764aSArtem Bityutskiy }; 9461e51764aSArtem Bityutskiy 9471e51764aSArtem Bityutskiy /** 9481e51764aSArtem Bityutskiy * struct ubifs_mount_opts - UBIFS-specific mount options information. 9491e51764aSArtem Bityutskiy * @unmount_mode: selected unmount mode (%0 default, %1 normal, %2 fast) 950d3f9db00SYannick Guerrini * @bulk_read: enable/disable bulk-reads (%0 default, %1 disable, %2 enable) 951553dea4dSArtem Bityutskiy * @chk_data_crc: enable/disable CRC data checking when reading data nodes 952d3f9db00SYannick Guerrini * (%0 default, %1 disable, %2 enable) 953553dea4dSArtem Bityutskiy * @override_compr: override default compressor (%0 - do not override and use 954553dea4dSArtem Bityutskiy * superblock compressor, %1 - override and use compressor 955553dea4dSArtem Bityutskiy * specified in @compr_type) 956553dea4dSArtem Bityutskiy * @compr_type: compressor type to override the superblock compressor with 957553dea4dSArtem Bityutskiy * (%UBIFS_COMPR_NONE, etc) 9581e51764aSArtem Bityutskiy */ 9591e51764aSArtem Bityutskiy struct ubifs_mount_opts { 9601e51764aSArtem Bityutskiy unsigned int unmount_mode:2; 9614793e7c5SAdrian Hunter unsigned int bulk_read:2; 9622953e73fSAdrian Hunter unsigned int chk_data_crc:2; 963553dea4dSArtem Bityutskiy unsigned int override_compr:1; 964553dea4dSArtem Bityutskiy unsigned int compr_type:2; 9651e51764aSArtem Bityutskiy }; 9661e51764aSArtem Bityutskiy 967b137545cSArtem Bityutskiy /** 968b137545cSArtem Bityutskiy * struct ubifs_budg_info - UBIFS budgeting information. 969b137545cSArtem Bityutskiy * @idx_growth: amount of bytes budgeted for index growth 970b137545cSArtem Bityutskiy * @data_growth: amount of bytes budgeted for cached data 971b137545cSArtem Bityutskiy * @dd_growth: amount of bytes budgeted for cached data that will make 972b137545cSArtem Bityutskiy * other data dirty 973b137545cSArtem Bityutskiy * @uncommitted_idx: amount of bytes were budgeted for growth of the index, but 974b137545cSArtem Bityutskiy * which still have to be taken into account because the index 975b137545cSArtem Bityutskiy * has not been committed so far 976b137545cSArtem Bityutskiy * @old_idx_sz: size of index on flash 977b137545cSArtem Bityutskiy * @min_idx_lebs: minimum number of LEBs required for the index 978b137545cSArtem Bityutskiy * @nospace: non-zero if the file-system does not have flash space (used as 979b137545cSArtem Bityutskiy * optimization) 980b137545cSArtem Bityutskiy * @nospace_rp: the same as @nospace, but additionally means that even reserved 981b137545cSArtem Bityutskiy * pool is full 982d3f9db00SYannick Guerrini * @page_budget: budget for a page (constant, never changed after mount) 983d3f9db00SYannick Guerrini * @inode_budget: budget for an inode (constant, never changed after mount) 984d3f9db00SYannick Guerrini * @dent_budget: budget for a directory entry (constant, never changed after 985b137545cSArtem Bityutskiy * mount) 986b137545cSArtem Bityutskiy */ 987b137545cSArtem Bityutskiy struct ubifs_budg_info { 988b137545cSArtem Bityutskiy long long idx_growth; 989b137545cSArtem Bityutskiy long long data_growth; 990b137545cSArtem Bityutskiy long long dd_growth; 991b137545cSArtem Bityutskiy long long uncommitted_idx; 992b137545cSArtem Bityutskiy unsigned long long old_idx_sz; 993b137545cSArtem Bityutskiy int min_idx_lebs; 994b137545cSArtem Bityutskiy unsigned int nospace:1; 995b137545cSArtem Bityutskiy unsigned int nospace_rp:1; 996b137545cSArtem Bityutskiy int page_budget; 997b137545cSArtem Bityutskiy int inode_budget; 998b137545cSArtem Bityutskiy int dent_budget; 999b137545cSArtem Bityutskiy }; 1000b137545cSArtem Bityutskiy 100117c2f9f8SArtem Bityutskiy struct ubifs_debug_info; 100217c2f9f8SArtem Bityutskiy 10031e51764aSArtem Bityutskiy /** 10041e51764aSArtem Bityutskiy * struct ubifs_info - UBIFS file-system description data structure 10051e51764aSArtem Bityutskiy * (per-superblock). 10061e51764aSArtem Bityutskiy * @vfs_sb: VFS @struct super_block object 1007fd615005SSascha Hauer * @sup_node: The super block node as read from the device 10081e51764aSArtem Bityutskiy * 10091e51764aSArtem Bityutskiy * @highest_inum: highest used inode number 10101e51764aSArtem Bityutskiy * @max_sqnum: current global sequence number 1011014eb04bSArtem Bityutskiy * @cmt_no: commit number of the last successfully completed commit, protected 1012014eb04bSArtem Bityutskiy * by @commit_sem 101381ffa38eSAdrian Hunter * @cnt_lock: protects @highest_inum and @max_sqnum counters 10141e51764aSArtem Bityutskiy * @fmt_version: UBIFS on-flash format version 1015963f0cf6SArtem Bityutskiy * @ro_compat_version: R/O compatibility version 10161e51764aSArtem Bityutskiy * @uuid: UUID from super block 10171e51764aSArtem Bityutskiy * 10181e51764aSArtem Bityutskiy * @lhead_lnum: log head logical eraseblock number 10191e51764aSArtem Bityutskiy * @lhead_offs: log head offset 10201e51764aSArtem Bityutskiy * @ltail_lnum: log tail logical eraseblock number (offset is always 0) 10211e51764aSArtem Bityutskiy * @log_mutex: protects the log, @lhead_lnum, @lhead_offs, @ltail_lnum, and 10221e51764aSArtem Bityutskiy * @bud_bytes 10231e51764aSArtem Bityutskiy * @min_log_bytes: minimum required number of bytes in the log 10241e51764aSArtem Bityutskiy * @cmt_bud_bytes: used during commit to temporarily amount of bytes in 10251e51764aSArtem Bityutskiy * committed buds 10261e51764aSArtem Bityutskiy * 10271e51764aSArtem Bityutskiy * @buds: tree of all buds indexed by bud LEB number 10281e51764aSArtem Bityutskiy * @bud_bytes: how many bytes of flash is used by buds 10291e51764aSArtem Bityutskiy * @buds_lock: protects the @buds tree, @bud_bytes, and per-journal head bud 10301e51764aSArtem Bityutskiy * lists 10311e51764aSArtem Bityutskiy * @jhead_cnt: count of journal heads 10321e51764aSArtem Bityutskiy * @jheads: journal heads (head zero is base head) 10331e51764aSArtem Bityutskiy * @max_bud_bytes: maximum number of bytes allowed in buds 10341e51764aSArtem Bityutskiy * @bg_bud_bytes: number of bud bytes when background commit is initiated 10351e51764aSArtem Bityutskiy * @old_buds: buds to be released after commit ends 10361e51764aSArtem Bityutskiy * @max_bud_cnt: maximum number of buds 10371e51764aSArtem Bityutskiy * 10381e51764aSArtem Bityutskiy * @commit_sem: synchronizes committer with other processes 10391e51764aSArtem Bityutskiy * @cmt_state: commit state 10401e51764aSArtem Bityutskiy * @cs_lock: commit state lock 10411e51764aSArtem Bityutskiy * @cmt_wq: wait queue to sleep on if the log is full and a commit is running 1042625bf371SArtem Bityutskiy * 10431e51764aSArtem Bityutskiy * @big_lpt: flag that LPT is too big to write whole during commit 10449f58d350SMatthew L. Creech * @space_fixup: flag indicating that free space in LEBs needs to be cleaned up 1045d63d61c1SRichard Weinberger * @double_hash: flag indicating that we can do lookups by hash 1046e021986eSRichard Weinberger * @encrypted: flag indicating that this file system contains encrypted files 1047625bf371SArtem Bityutskiy * @no_chk_data_crc: do not check CRCs when reading data nodes (except during 1048625bf371SArtem Bityutskiy * recovery) 1049625bf371SArtem Bityutskiy * @bulk_read: enable bulk-reads 1050a1dc080cSArtem Bityutskiy * @default_compr: default compression algorithm (%UBIFS_COMPR_LZO, etc) 1051963f0cf6SArtem Bityutskiy * @rw_incompat: the media is not R/W compatible 10522e52eb74SRichard Weinberger * @assert_action: action to take when a ubifs_assert() fails 105349525e5eSSascha Hauer * @authenticated: flag indigating the FS is mounted in authenticated mode 10541e51764aSArtem Bityutskiy * 10551e51764aSArtem Bityutskiy * @tnc_mutex: protects the Tree Node Cache (TNC), @zroot, @cnext, @enext, and 10561e51764aSArtem Bityutskiy * @calc_idx_sz 10571e51764aSArtem Bityutskiy * @zroot: zbranch which points to the root index node and znode 10581e51764aSArtem Bityutskiy * @cnext: next znode to commit 10591e51764aSArtem Bityutskiy * @enext: next znode to commit to empty space 10601e51764aSArtem Bityutskiy * @gap_lebs: array of LEBs used by the in-gaps commit method 10611e51764aSArtem Bityutskiy * @cbuf: commit buffer 10621e51764aSArtem Bityutskiy * @ileb_buf: buffer for commit in-the-gaps method 10631e51764aSArtem Bityutskiy * @ileb_len: length of data in ileb_buf 10641e51764aSArtem Bityutskiy * @ihead_lnum: LEB number of index head 10651e51764aSArtem Bityutskiy * @ihead_offs: offset of index head 10661e51764aSArtem Bityutskiy * @ilebs: pre-allocated index LEBs 10671e51764aSArtem Bityutskiy * @ileb_cnt: number of pre-allocated index LEBs 10681e51764aSArtem Bityutskiy * @ileb_nxt: next pre-allocated index LEBs 10691e51764aSArtem Bityutskiy * @old_idx: tree of index nodes obsoleted since the last commit start 10701e51764aSArtem Bityutskiy * @bottom_up_buf: a buffer which is used by 'dirty_cow_bottom_up()' in tnc.c 10711e51764aSArtem Bityutskiy * 10721e51764aSArtem Bityutskiy * @mst_node: master node 10731e51764aSArtem Bityutskiy * @mst_offs: offset of valid master node 10743477d204SArtem Bityutskiy * 10756c0c42cdSArtem Bityutskiy * @max_bu_buf_len: maximum bulk-read buffer length 10763477d204SArtem Bityutskiy * @bu_mutex: protects the pre-allocated bulk-read buffer and @c->bu 10773477d204SArtem Bityutskiy * @bu: pre-allocated bulk-read information 10781e51764aSArtem Bityutskiy * 1079d882962fSMatthew L. Creech * @write_reserve_mutex: protects @write_reserve_buf 1080d882962fSMatthew L. Creech * @write_reserve_buf: on the write path we allocate memory, which might 1081d882962fSMatthew L. Creech * sometimes be unavailable, in which case we use this 1082d882962fSMatthew L. Creech * write reserve buffer 1083d882962fSMatthew L. Creech * 10841e51764aSArtem Bityutskiy * @log_lebs: number of logical eraseblocks in the log 10851e51764aSArtem Bityutskiy * @log_bytes: log size in bytes 10861e51764aSArtem Bityutskiy * @log_last: last LEB of the log 10871e51764aSArtem Bityutskiy * @lpt_lebs: number of LEBs used for lprops table 10881e51764aSArtem Bityutskiy * @lpt_first: first LEB of the lprops table area 10891e51764aSArtem Bityutskiy * @lpt_last: last LEB of the lprops table area 10901e51764aSArtem Bityutskiy * @orph_lebs: number of LEBs used for the orphan area 10911e51764aSArtem Bityutskiy * @orph_first: first LEB of the orphan area 10921e51764aSArtem Bityutskiy * @orph_last: last LEB of the orphan area 10931e51764aSArtem Bityutskiy * @main_lebs: count of LEBs in the main area 10941e51764aSArtem Bityutskiy * @main_first: first LEB of the main area 10951e51764aSArtem Bityutskiy * @main_bytes: main area size in bytes 10961e51764aSArtem Bityutskiy * 10971e51764aSArtem Bityutskiy * @key_hash_type: type of the key hash 10981e51764aSArtem Bityutskiy * @key_hash: direntry key hash function 10991e51764aSArtem Bityutskiy * @key_fmt: key format 11001e51764aSArtem Bityutskiy * @key_len: key length 110149525e5eSSascha Hauer * @hash_len: The length of the index node hashes 11021e51764aSArtem Bityutskiy * @fanout: fanout of the index tree (number of links per indexing node) 11031e51764aSArtem Bityutskiy * 11041e51764aSArtem Bityutskiy * @min_io_size: minimal input/output unit size 11051e51764aSArtem Bityutskiy * @min_io_shift: number of bits in @min_io_size minus one 11063e8e2e0cSArtem Bityutskiy * @max_write_size: maximum amount of bytes the underlying flash can write at a 11073e8e2e0cSArtem Bityutskiy * time (MTD write buffer size) 11083e8e2e0cSArtem Bityutskiy * @max_write_shift: number of bits in @max_write_size minus one 11091e51764aSArtem Bityutskiy * @leb_size: logical eraseblock size in bytes 1110ca2ec61dSArtem Bityutskiy * @leb_start: starting offset of logical eraseblocks within physical 1111ca2ec61dSArtem Bityutskiy * eraseblocks 11121e51764aSArtem Bityutskiy * @half_leb_size: half LEB size 1113fb1cd01aSArtem Bityutskiy * @idx_leb_size: how many bytes of an LEB are effectively available when it is 1114fb1cd01aSArtem Bityutskiy * used to store indexing nodes (@leb_size - @max_idx_node_sz) 11151e51764aSArtem Bityutskiy * @leb_cnt: count of logical eraseblocks 11161e51764aSArtem Bityutskiy * @max_leb_cnt: maximum count of logical eraseblocks 11171e51764aSArtem Bityutskiy * @old_leb_cnt: count of logical eraseblocks before re-size 11181e51764aSArtem Bityutskiy * @ro_media: the underlying UBI volume is read-only 11192ef13294SArtem Bityutskiy * @ro_mount: the file-system was mounted as read-only 11202680d722SArtem Bityutskiy * @ro_error: UBIFS switched to R/O mode because an error happened 11211e51764aSArtem Bityutskiy * 11221e51764aSArtem Bityutskiy * @dirty_pg_cnt: number of dirty pages (not used) 11231e51764aSArtem Bityutskiy * @dirty_zn_cnt: number of dirty znodes 11241e51764aSArtem Bityutskiy * @clean_zn_cnt: number of clean znodes 11251e51764aSArtem Bityutskiy * 1126b137545cSArtem Bityutskiy * @space_lock: protects @bi and @lst 1127b137545cSArtem Bityutskiy * @lst: lprops statistics 1128b137545cSArtem Bityutskiy * @bi: budgeting information 11291e51764aSArtem Bityutskiy * @calc_idx_sz: temporary variable which is used to calculate new index size 11301e51764aSArtem Bityutskiy * (contains accurate new index size at end of TNC commit start) 11311e51764aSArtem Bityutskiy * 11321e51764aSArtem Bityutskiy * @ref_node_alsz: size of the LEB reference node aligned to the min. flash 11331e51764aSArtem Bityutskiy * I/O unit 11341e51764aSArtem Bityutskiy * @mst_node_alsz: master node aligned size 11351e51764aSArtem Bityutskiy * @min_idx_node_sz: minimum indexing node aligned on 8-bytes boundary 11361e51764aSArtem Bityutskiy * @max_idx_node_sz: maximum indexing node aligned on 8-bytes boundary 11371e51764aSArtem Bityutskiy * @max_inode_sz: maximum possible inode size in bytes 11381e51764aSArtem Bityutskiy * @max_znode_sz: size of znode in bytes 11399bbb5726SArtem Bityutskiy * 11409bbb5726SArtem Bityutskiy * @leb_overhead: how many bytes are wasted in an LEB when it is filled with 11419bbb5726SArtem Bityutskiy * data nodes of maximum size - used in free space reporting 11421e51764aSArtem Bityutskiy * @dead_wm: LEB dead space watermark 11431e51764aSArtem Bityutskiy * @dark_wm: LEB dark space watermark 11441e51764aSArtem Bityutskiy * @block_cnt: count of 4KiB blocks on the FS 11451e51764aSArtem Bityutskiy * 11461e51764aSArtem Bityutskiy * @ranges: UBIFS node length ranges 11471e51764aSArtem Bityutskiy * @ubi: UBI volume descriptor 11481e51764aSArtem Bityutskiy * @di: UBI device information 11491e51764aSArtem Bityutskiy * @vi: UBI volume information 11501e51764aSArtem Bityutskiy * 11511e51764aSArtem Bityutskiy * @orph_tree: rb-tree of orphan inode numbers 11521e51764aSArtem Bityutskiy * @orph_list: list of orphan inode numbers in order added 11531e51764aSArtem Bityutskiy * @orph_new: list of orphan inode numbers added since last commit 11541e51764aSArtem Bityutskiy * @orph_cnext: next orphan to commit 11551e51764aSArtem Bityutskiy * @orph_dnext: next orphan to delete 11561e51764aSArtem Bityutskiy * @orphan_lock: lock for orph_tree and orph_new 11571e51764aSArtem Bityutskiy * @orph_buf: buffer for orphan nodes 11581e51764aSArtem Bityutskiy * @new_orphans: number of orphans since last commit 11591e51764aSArtem Bityutskiy * @cmt_orphans: number of orphans being committed 11601e51764aSArtem Bityutskiy * @tot_orphans: number of orphans in the rb_tree 11611e51764aSArtem Bityutskiy * @max_orphans: maximum number of orphans allowed 11621e51764aSArtem Bityutskiy * @ohead_lnum: orphan head LEB number 11631e51764aSArtem Bityutskiy * @ohead_offs: orphan head offset 11641e51764aSArtem Bityutskiy * @no_orphs: non-zero if there are no orphans 11651e51764aSArtem Bityutskiy * 11661e51764aSArtem Bityutskiy * @bgt: UBIFS background thread 11671e51764aSArtem Bityutskiy * @bgt_name: background thread name 11681e51764aSArtem Bityutskiy * @need_bgt: if background thread should run 11691e51764aSArtem Bityutskiy * @need_wbuf_sync: if write-buffers have to be synchronized 11701e51764aSArtem Bityutskiy * 11711e51764aSArtem Bityutskiy * @gc_lnum: LEB number used for garbage collection 11721e51764aSArtem Bityutskiy * @sbuf: a buffer of LEB size used by GC and replay for scanning 11731e51764aSArtem Bityutskiy * @idx_gc: list of index LEBs that have been garbage collected 11741e51764aSArtem Bityutskiy * @idx_gc_cnt: number of elements on the idx_gc list 1175601c0bc4SAdrian Hunter * @gc_seq: incremented for every non-index LEB garbage collected 1176601c0bc4SAdrian Hunter * @gced_lnum: last non-index LEB that was garbage collected 11771e51764aSArtem Bityutskiy * 11781e51764aSArtem Bityutskiy * @infos_list: links all 'ubifs_info' objects 11791e51764aSArtem Bityutskiy * @umount_mutex: serializes shrinker and un-mount 11801e51764aSArtem Bityutskiy * @shrinker_run_no: shrinker run number 11811e51764aSArtem Bityutskiy * 11821e51764aSArtem Bityutskiy * @space_bits: number of bits needed to record free or dirty space 11831e51764aSArtem Bityutskiy * @lpt_lnum_bits: number of bits needed to record a LEB number in the LPT 11841e51764aSArtem Bityutskiy * @lpt_offs_bits: number of bits needed to record an offset in the LPT 11851e51764aSArtem Bityutskiy * @lpt_spc_bits: number of bits needed to space in the LPT 11861e51764aSArtem Bityutskiy * @pcnt_bits: number of bits needed to record pnode or nnode number 11871e51764aSArtem Bityutskiy * @lnum_bits: number of bits needed to record LEB number 11881e51764aSArtem Bityutskiy * @nnode_sz: size of on-flash nnode 11891e51764aSArtem Bityutskiy * @pnode_sz: size of on-flash pnode 11901e51764aSArtem Bityutskiy * @ltab_sz: size of on-flash LPT lprops table 11911e51764aSArtem Bityutskiy * @lsave_sz: size of on-flash LPT save table 11921e51764aSArtem Bityutskiy * @pnode_cnt: number of pnodes 11931e51764aSArtem Bityutskiy * @nnode_cnt: number of nnodes 11941e51764aSArtem Bityutskiy * @lpt_hght: height of the LPT 11951e51764aSArtem Bityutskiy * @pnodes_have: number of pnodes in memory 11961e51764aSArtem Bityutskiy * 11971e51764aSArtem Bityutskiy * @lp_mutex: protects lprops table and all the other lprops-related fields 11981e51764aSArtem Bityutskiy * @lpt_lnum: LEB number of the root nnode of the LPT 11991e51764aSArtem Bityutskiy * @lpt_offs: offset of the root nnode of the LPT 12001e51764aSArtem Bityutskiy * @nhead_lnum: LEB number of LPT head 12011e51764aSArtem Bityutskiy * @nhead_offs: offset of LPT head 12021e51764aSArtem Bityutskiy * @lpt_drty_flgs: dirty flags for LPT special nodes e.g. ltab 12031e51764aSArtem Bityutskiy * @dirty_nn_cnt: number of dirty nnodes 12041e51764aSArtem Bityutskiy * @dirty_pn_cnt: number of dirty pnodes 120573944a6dSAdrian Hunter * @check_lpt_free: flag that indicates LPT GC may be needed 12061e51764aSArtem Bityutskiy * @lpt_sz: LPT size 12071e51764aSArtem Bityutskiy * @lpt_nod_buf: buffer for an on-flash nnode or pnode 12081e51764aSArtem Bityutskiy * @lpt_buf: buffer of LEB size used by LPT 12091e51764aSArtem Bityutskiy * @nroot: address in memory of the root nnode of the LPT 12101e51764aSArtem Bityutskiy * @lpt_cnext: next LPT node to commit 12111e51764aSArtem Bityutskiy * @lpt_heap: array of heaps of categorized lprops 12121e51764aSArtem Bityutskiy * @dirty_idx: a (reverse sorted) copy of the LPROPS_DIRTY_IDX heap as at 12131e51764aSArtem Bityutskiy * previous commit start 12141e51764aSArtem Bityutskiy * @uncat_list: list of un-categorized LEBs 12151e51764aSArtem Bityutskiy * @empty_list: list of empty LEBs 1216fb1cd01aSArtem Bityutskiy * @freeable_list: list of freeable non-index LEBs (free + dirty == @leb_size) 1217fb1cd01aSArtem Bityutskiy * @frdi_idx_list: list of freeable index LEBs (free + dirty == @leb_size) 12181e51764aSArtem Bityutskiy * @freeable_cnt: number of freeable LEBs in @freeable_list 121998a1eebdSArtem Bityutskiy * @in_a_category_cnt: count of lprops which are in a certain category, which 122098a1eebdSArtem Bityutskiy * basically meants that they were loaded from the flash 12211e51764aSArtem Bityutskiy * 12221e51764aSArtem Bityutskiy * @ltab_lnum: LEB number of LPT's own lprops table 12231e51764aSArtem Bityutskiy * @ltab_offs: offset of LPT's own lprops table 12241e51764aSArtem Bityutskiy * @ltab: LPT's own lprops table 12251e51764aSArtem Bityutskiy * @ltab_cmt: LPT's own lprops table (commit copy) 12261e51764aSArtem Bityutskiy * @lsave_cnt: number of LEB numbers in LPT's save table 12271e51764aSArtem Bityutskiy * @lsave_lnum: LEB number of LPT's save table 12281e51764aSArtem Bityutskiy * @lsave_offs: offset of LPT's save table 12291e51764aSArtem Bityutskiy * @lsave: LPT's save table 12301e51764aSArtem Bityutskiy * @lscan_lnum: LEB number of last LPT scan 12311e51764aSArtem Bityutskiy * 12321e51764aSArtem Bityutskiy * @rp_size: size of the reserved pool in bytes 12331e51764aSArtem Bityutskiy * @report_rp_size: size of the reserved pool reported to user-space 12341e51764aSArtem Bityutskiy * @rp_uid: reserved pool user ID 12351e51764aSArtem Bityutskiy * @rp_gid: reserved pool group ID 12361e51764aSArtem Bityutskiy * 123749525e5eSSascha Hauer * @hash_tfm: the hash transformation used for hashing nodes 123849525e5eSSascha Hauer * @hmac_tfm: the HMAC transformation for this filesystem 123949525e5eSSascha Hauer * @hmac_desc_len: length of the HMAC used for authentication 124049525e5eSSascha Hauer * @auth_key_name: the authentication key name 124149525e5eSSascha Hauer * @auth_hash_name: the name of the hash algorithm used for authentication 124249525e5eSSascha Hauer * @auth_hash_algo: the authentication hash used for this fs 12436a98bc46SSascha Hauer * @log_hash: the log hash from the commit start node up to the latest reference 12446a98bc46SSascha Hauer * node. 124549525e5eSSascha Hauer * 1246d8cdda3eSArtem Bityutskiy * @empty: %1 if the UBI device is empty 1247d8cdda3eSArtem Bityutskiy * @need_recovery: %1 if the file-system needs recovery 1248d8cdda3eSArtem Bityutskiy * @replaying: %1 during journal replay 124918d1d7fbSArtem Bityutskiy * @mounting: %1 while mounting 12501751e8a6SLinus Torvalds * @probing: %1 while attempting to mount if SB_SILENT mount flag is set 1251d8cdda3eSArtem Bityutskiy * @remounting_rw: %1 while re-mounting from R/O mode to R/W mode 12521e51764aSArtem Bityutskiy * @replay_list: temporary list used during journal replay 12531e51764aSArtem Bityutskiy * @replay_buds: list of buds to replay 12541e51764aSArtem Bityutskiy * @cs_sqnum: sequence number of first node in the log (commit start node) 12552ef13294SArtem Bityutskiy * @unclean_leb_list: LEBs to recover when re-mounting R/O mounted FS to R/W 12562ef13294SArtem Bityutskiy * mode 12572ef13294SArtem Bityutskiy * @rcvrd_mst_node: recovered master node to write when re-mounting R/O mounted 12582ef13294SArtem Bityutskiy * FS to R/W mode 12591e51764aSArtem Bityutskiy * @size_tree: inode size information for recovery 12601e51764aSArtem Bityutskiy * @mount_opts: UBIFS-specific mount options 12611e51764aSArtem Bityutskiy * 126217c2f9f8SArtem Bityutskiy * @dbg: debugging-related information 12631e51764aSArtem Bityutskiy */ 12641e51764aSArtem Bityutskiy struct ubifs_info { 12651e51764aSArtem Bityutskiy struct super_block *vfs_sb; 1266fd615005SSascha Hauer struct ubifs_sb_node *sup_node; 12671e51764aSArtem Bityutskiy 12681e51764aSArtem Bityutskiy ino_t highest_inum; 12691e51764aSArtem Bityutskiy unsigned long long max_sqnum; 12701e51764aSArtem Bityutskiy unsigned long long cmt_no; 12711e51764aSArtem Bityutskiy spinlock_t cnt_lock; 12721e51764aSArtem Bityutskiy int fmt_version; 1273963f0cf6SArtem Bityutskiy int ro_compat_version; 12741e51764aSArtem Bityutskiy unsigned char uuid[16]; 12751e51764aSArtem Bityutskiy 12761e51764aSArtem Bityutskiy int lhead_lnum; 12771e51764aSArtem Bityutskiy int lhead_offs; 12781e51764aSArtem Bityutskiy int ltail_lnum; 12791e51764aSArtem Bityutskiy struct mutex log_mutex; 12801e51764aSArtem Bityutskiy int min_log_bytes; 12811e51764aSArtem Bityutskiy long long cmt_bud_bytes; 12821e51764aSArtem Bityutskiy 12831e51764aSArtem Bityutskiy struct rb_root buds; 12841e51764aSArtem Bityutskiy long long bud_bytes; 12851e51764aSArtem Bityutskiy spinlock_t buds_lock; 12861e51764aSArtem Bityutskiy int jhead_cnt; 12871e51764aSArtem Bityutskiy struct ubifs_jhead *jheads; 12881e51764aSArtem Bityutskiy long long max_bud_bytes; 12891e51764aSArtem Bityutskiy long long bg_bud_bytes; 12901e51764aSArtem Bityutskiy struct list_head old_buds; 12911e51764aSArtem Bityutskiy int max_bud_cnt; 12921e51764aSArtem Bityutskiy 12931e51764aSArtem Bityutskiy struct rw_semaphore commit_sem; 12941e51764aSArtem Bityutskiy int cmt_state; 12951e51764aSArtem Bityutskiy spinlock_t cs_lock; 12961e51764aSArtem Bityutskiy wait_queue_head_t cmt_wq; 1297625bf371SArtem Bityutskiy 12981e51764aSArtem Bityutskiy unsigned int big_lpt:1; 12999f58d350SMatthew L. Creech unsigned int space_fixup:1; 1300d63d61c1SRichard Weinberger unsigned int double_hash:1; 1301e021986eSRichard Weinberger unsigned int encrypted:1; 1302625bf371SArtem Bityutskiy unsigned int no_chk_data_crc:1; 1303625bf371SArtem Bityutskiy unsigned int bulk_read:1; 1304a1dc080cSArtem Bityutskiy unsigned int default_compr:2; 1305963f0cf6SArtem Bityutskiy unsigned int rw_incompat:1; 13062e52eb74SRichard Weinberger unsigned int assert_action:2; 130749525e5eSSascha Hauer unsigned int authenticated:1; 13081e51764aSArtem Bityutskiy 13091e51764aSArtem Bityutskiy struct mutex tnc_mutex; 13101e51764aSArtem Bityutskiy struct ubifs_zbranch zroot; 13111e51764aSArtem Bityutskiy struct ubifs_znode *cnext; 13121e51764aSArtem Bityutskiy struct ubifs_znode *enext; 13131e51764aSArtem Bityutskiy int *gap_lebs; 13141e51764aSArtem Bityutskiy void *cbuf; 13151e51764aSArtem Bityutskiy void *ileb_buf; 13161e51764aSArtem Bityutskiy int ileb_len; 13171e51764aSArtem Bityutskiy int ihead_lnum; 13181e51764aSArtem Bityutskiy int ihead_offs; 13191e51764aSArtem Bityutskiy int *ilebs; 13201e51764aSArtem Bityutskiy int ileb_cnt; 13211e51764aSArtem Bityutskiy int ileb_nxt; 13221e51764aSArtem Bityutskiy struct rb_root old_idx; 13231e51764aSArtem Bityutskiy int *bottom_up_buf; 13241e51764aSArtem Bityutskiy 13251e51764aSArtem Bityutskiy struct ubifs_mst_node *mst_node; 13261e51764aSArtem Bityutskiy int mst_offs; 13273477d204SArtem Bityutskiy 13286c0c42cdSArtem Bityutskiy int max_bu_buf_len; 13293477d204SArtem Bityutskiy struct mutex bu_mutex; 13303477d204SArtem Bityutskiy struct bu_info bu; 13311e51764aSArtem Bityutskiy 1332d882962fSMatthew L. Creech struct mutex write_reserve_mutex; 1333d882962fSMatthew L. Creech void *write_reserve_buf; 1334d882962fSMatthew L. Creech 13351e51764aSArtem Bityutskiy int log_lebs; 13361e51764aSArtem Bityutskiy long long log_bytes; 13371e51764aSArtem Bityutskiy int log_last; 13381e51764aSArtem Bityutskiy int lpt_lebs; 13391e51764aSArtem Bityutskiy int lpt_first; 13401e51764aSArtem Bityutskiy int lpt_last; 13411e51764aSArtem Bityutskiy int orph_lebs; 13421e51764aSArtem Bityutskiy int orph_first; 13431e51764aSArtem Bityutskiy int orph_last; 13441e51764aSArtem Bityutskiy int main_lebs; 13451e51764aSArtem Bityutskiy int main_first; 13461e51764aSArtem Bityutskiy long long main_bytes; 13471e51764aSArtem Bityutskiy 13481e51764aSArtem Bityutskiy uint8_t key_hash_type; 13491e51764aSArtem Bityutskiy uint32_t (*key_hash)(const char *str, int len); 13501e51764aSArtem Bityutskiy int key_fmt; 13511e51764aSArtem Bityutskiy int key_len; 135249525e5eSSascha Hauer int hash_len; 13531e51764aSArtem Bityutskiy int fanout; 13541e51764aSArtem Bityutskiy 13551e51764aSArtem Bityutskiy int min_io_size; 13561e51764aSArtem Bityutskiy int min_io_shift; 13573e8e2e0cSArtem Bityutskiy int max_write_size; 13583e8e2e0cSArtem Bityutskiy int max_write_shift; 13591e51764aSArtem Bityutskiy int leb_size; 1360ca2ec61dSArtem Bityutskiy int leb_start; 13611e51764aSArtem Bityutskiy int half_leb_size; 1362fb1cd01aSArtem Bityutskiy int idx_leb_size; 13631e51764aSArtem Bityutskiy int leb_cnt; 13641e51764aSArtem Bityutskiy int max_leb_cnt; 13651e51764aSArtem Bityutskiy int old_leb_cnt; 13662680d722SArtem Bityutskiy unsigned int ro_media:1; 13672ef13294SArtem Bityutskiy unsigned int ro_mount:1; 13682680d722SArtem Bityutskiy unsigned int ro_error:1; 13691e51764aSArtem Bityutskiy 13701e51764aSArtem Bityutskiy atomic_long_t dirty_pg_cnt; 13711e51764aSArtem Bityutskiy atomic_long_t dirty_zn_cnt; 13721e51764aSArtem Bityutskiy atomic_long_t clean_zn_cnt; 13731e51764aSArtem Bityutskiy 13741e51764aSArtem Bityutskiy spinlock_t space_lock; 13751e51764aSArtem Bityutskiy struct ubifs_lp_stats lst; 1376b137545cSArtem Bityutskiy struct ubifs_budg_info bi; 1377b137545cSArtem Bityutskiy unsigned long long calc_idx_sz; 13781e51764aSArtem Bityutskiy 13791e51764aSArtem Bityutskiy int ref_node_alsz; 13801e51764aSArtem Bityutskiy int mst_node_alsz; 13811e51764aSArtem Bityutskiy int min_idx_node_sz; 13821e51764aSArtem Bityutskiy int max_idx_node_sz; 13831e51764aSArtem Bityutskiy long long max_inode_sz; 13841e51764aSArtem Bityutskiy int max_znode_sz; 13859bbb5726SArtem Bityutskiy 13869bbb5726SArtem Bityutskiy int leb_overhead; 13871e51764aSArtem Bityutskiy int dead_wm; 13881e51764aSArtem Bityutskiy int dark_wm; 13891e51764aSArtem Bityutskiy int block_cnt; 13901e51764aSArtem Bityutskiy 13911e51764aSArtem Bityutskiy struct ubifs_node_range ranges[UBIFS_NODE_TYPES_CNT]; 13921e51764aSArtem Bityutskiy struct ubi_volume_desc *ubi; 13931e51764aSArtem Bityutskiy struct ubi_device_info di; 13941e51764aSArtem Bityutskiy struct ubi_volume_info vi; 13951e51764aSArtem Bityutskiy 13961e51764aSArtem Bityutskiy struct rb_root orph_tree; 13971e51764aSArtem Bityutskiy struct list_head orph_list; 13981e51764aSArtem Bityutskiy struct list_head orph_new; 13991e51764aSArtem Bityutskiy struct ubifs_orphan *orph_cnext; 14001e51764aSArtem Bityutskiy struct ubifs_orphan *orph_dnext; 14011e51764aSArtem Bityutskiy spinlock_t orphan_lock; 14021e51764aSArtem Bityutskiy void *orph_buf; 14031e51764aSArtem Bityutskiy int new_orphans; 14041e51764aSArtem Bityutskiy int cmt_orphans; 14051e51764aSArtem Bityutskiy int tot_orphans; 14061e51764aSArtem Bityutskiy int max_orphans; 14071e51764aSArtem Bityutskiy int ohead_lnum; 14081e51764aSArtem Bityutskiy int ohead_offs; 14091e51764aSArtem Bityutskiy int no_orphs; 14101e51764aSArtem Bityutskiy 14111e51764aSArtem Bityutskiy struct task_struct *bgt; 14121e51764aSArtem Bityutskiy char bgt_name[sizeof(BGT_NAME_PATTERN) + 9]; 14131e51764aSArtem Bityutskiy int need_bgt; 14141e51764aSArtem Bityutskiy int need_wbuf_sync; 14151e51764aSArtem Bityutskiy 14161e51764aSArtem Bityutskiy int gc_lnum; 14171e51764aSArtem Bityutskiy void *sbuf; 14181e51764aSArtem Bityutskiy struct list_head idx_gc; 14191e51764aSArtem Bityutskiy int idx_gc_cnt; 1420f92b9826SArtem Bityutskiy int gc_seq; 1421f92b9826SArtem Bityutskiy int gced_lnum; 14221e51764aSArtem Bityutskiy 14231e51764aSArtem Bityutskiy struct list_head infos_list; 14241e51764aSArtem Bityutskiy struct mutex umount_mutex; 14251e51764aSArtem Bityutskiy unsigned int shrinker_run_no; 14261e51764aSArtem Bityutskiy 14271e51764aSArtem Bityutskiy int space_bits; 14281e51764aSArtem Bityutskiy int lpt_lnum_bits; 14291e51764aSArtem Bityutskiy int lpt_offs_bits; 14301e51764aSArtem Bityutskiy int lpt_spc_bits; 14311e51764aSArtem Bityutskiy int pcnt_bits; 14321e51764aSArtem Bityutskiy int lnum_bits; 14331e51764aSArtem Bityutskiy int nnode_sz; 14341e51764aSArtem Bityutskiy int pnode_sz; 14351e51764aSArtem Bityutskiy int ltab_sz; 14361e51764aSArtem Bityutskiy int lsave_sz; 14371e51764aSArtem Bityutskiy int pnode_cnt; 14381e51764aSArtem Bityutskiy int nnode_cnt; 14391e51764aSArtem Bityutskiy int lpt_hght; 14401e51764aSArtem Bityutskiy int pnodes_have; 14411e51764aSArtem Bityutskiy 14421e51764aSArtem Bityutskiy struct mutex lp_mutex; 14431e51764aSArtem Bityutskiy int lpt_lnum; 14441e51764aSArtem Bityutskiy int lpt_offs; 14451e51764aSArtem Bityutskiy int nhead_lnum; 14461e51764aSArtem Bityutskiy int nhead_offs; 14471e51764aSArtem Bityutskiy int lpt_drty_flgs; 14481e51764aSArtem Bityutskiy int dirty_nn_cnt; 14491e51764aSArtem Bityutskiy int dirty_pn_cnt; 145073944a6dSAdrian Hunter int check_lpt_free; 14511e51764aSArtem Bityutskiy long long lpt_sz; 14521e51764aSArtem Bityutskiy void *lpt_nod_buf; 14531e51764aSArtem Bityutskiy void *lpt_buf; 14541e51764aSArtem Bityutskiy struct ubifs_nnode *nroot; 14551e51764aSArtem Bityutskiy struct ubifs_cnode *lpt_cnext; 14561e51764aSArtem Bityutskiy struct ubifs_lpt_heap lpt_heap[LPROPS_HEAP_CNT]; 14571e51764aSArtem Bityutskiy struct ubifs_lpt_heap dirty_idx; 14581e51764aSArtem Bityutskiy struct list_head uncat_list; 14591e51764aSArtem Bityutskiy struct list_head empty_list; 14601e51764aSArtem Bityutskiy struct list_head freeable_list; 14611e51764aSArtem Bityutskiy struct list_head frdi_idx_list; 14621e51764aSArtem Bityutskiy int freeable_cnt; 146398a1eebdSArtem Bityutskiy int in_a_category_cnt; 14641e51764aSArtem Bityutskiy 14651e51764aSArtem Bityutskiy int ltab_lnum; 14661e51764aSArtem Bityutskiy int ltab_offs; 14671e51764aSArtem Bityutskiy struct ubifs_lpt_lprops *ltab; 14681e51764aSArtem Bityutskiy struct ubifs_lpt_lprops *ltab_cmt; 14691e51764aSArtem Bityutskiy int lsave_cnt; 14701e51764aSArtem Bityutskiy int lsave_lnum; 14711e51764aSArtem Bityutskiy int lsave_offs; 14721e51764aSArtem Bityutskiy int *lsave; 14731e51764aSArtem Bityutskiy int lscan_lnum; 14741e51764aSArtem Bityutskiy 14751e51764aSArtem Bityutskiy long long rp_size; 14761e51764aSArtem Bityutskiy long long report_rp_size; 147739241bebSEric W. Biederman kuid_t rp_uid; 147839241bebSEric W. Biederman kgid_t rp_gid; 14791e51764aSArtem Bityutskiy 148049525e5eSSascha Hauer struct crypto_shash *hash_tfm; 148149525e5eSSascha Hauer struct crypto_shash *hmac_tfm; 148249525e5eSSascha Hauer int hmac_desc_len; 148349525e5eSSascha Hauer char *auth_key_name; 148449525e5eSSascha Hauer char *auth_hash_name; 148549525e5eSSascha Hauer enum hash_algo auth_hash_algo; 148649525e5eSSascha Hauer 14876a98bc46SSascha Hauer struct shash_desc *log_hash; 14886a98bc46SSascha Hauer 14891e51764aSArtem Bityutskiy /* The below fields are used only during mounting and re-mounting */ 1490d8cdda3eSArtem Bityutskiy unsigned int empty:1; 1491d8cdda3eSArtem Bityutskiy unsigned int need_recovery:1; 1492d8cdda3eSArtem Bityutskiy unsigned int replaying:1; 149318d1d7fbSArtem Bityutskiy unsigned int mounting:1; 1494d8cdda3eSArtem Bityutskiy unsigned int remounting_rw:1; 149590bea5a3SDaniel Golle unsigned int probing:1; 14961e51764aSArtem Bityutskiy struct list_head replay_list; 14971e51764aSArtem Bityutskiy struct list_head replay_buds; 14981e51764aSArtem Bityutskiy unsigned long long cs_sqnum; 14991e51764aSArtem Bityutskiy struct list_head unclean_leb_list; 15001e51764aSArtem Bityutskiy struct ubifs_mst_node *rcvrd_mst_node; 15011e51764aSArtem Bityutskiy struct rb_root size_tree; 15021e51764aSArtem Bityutskiy struct ubifs_mount_opts mount_opts; 15031e51764aSArtem Bityutskiy 150417c2f9f8SArtem Bityutskiy struct ubifs_debug_info *dbg; 15051e51764aSArtem Bityutskiy }; 15061e51764aSArtem Bityutskiy 15071e51764aSArtem Bityutskiy extern struct list_head ubifs_infos; 15081e51764aSArtem Bityutskiy extern spinlock_t ubifs_infos_lock; 15091e51764aSArtem Bityutskiy extern atomic_long_t ubifs_clean_zn_cnt; 1510e8b81566SArtem Bityutskiy extern const struct super_operations ubifs_super_operations; 1511e8b81566SArtem Bityutskiy extern const struct address_space_operations ubifs_file_address_operations; 1512e8b81566SArtem Bityutskiy extern const struct file_operations ubifs_file_operations; 1513e8b81566SArtem Bityutskiy extern const struct inode_operations ubifs_file_inode_operations; 1514e8b81566SArtem Bityutskiy extern const struct file_operations ubifs_dir_operations; 1515e8b81566SArtem Bityutskiy extern const struct inode_operations ubifs_dir_inode_operations; 1516e8b81566SArtem Bityutskiy extern const struct inode_operations ubifs_symlink_inode_operations; 15171e51764aSArtem Bityutskiy extern struct ubifs_compressor *ubifs_compressors[UBIFS_COMPR_TYPES_CNT]; 15181e51764aSArtem Bityutskiy 151949525e5eSSascha Hauer /* auth.c */ 152049525e5eSSascha Hauer static inline int ubifs_authenticated(const struct ubifs_info *c) 152149525e5eSSascha Hauer { 152249525e5eSSascha Hauer return (IS_ENABLED(CONFIG_UBIFS_FS_AUTHENTICATION)) && c->authenticated; 152349525e5eSSascha Hauer } 152449525e5eSSascha Hauer 152549525e5eSSascha Hauer struct shash_desc *__ubifs_hash_get_desc(const struct ubifs_info *c); 152649525e5eSSascha Hauer static inline struct shash_desc *ubifs_hash_get_desc(const struct ubifs_info *c) 152749525e5eSSascha Hauer { 152849525e5eSSascha Hauer return ubifs_authenticated(c) ? __ubifs_hash_get_desc(c) : NULL; 152949525e5eSSascha Hauer } 153049525e5eSSascha Hauer 153149525e5eSSascha Hauer static inline int ubifs_shash_init(const struct ubifs_info *c, 153249525e5eSSascha Hauer struct shash_desc *desc) 153349525e5eSSascha Hauer { 153449525e5eSSascha Hauer if (ubifs_authenticated(c)) 153549525e5eSSascha Hauer return crypto_shash_init(desc); 153649525e5eSSascha Hauer else 153749525e5eSSascha Hauer return 0; 153849525e5eSSascha Hauer } 153949525e5eSSascha Hauer 154049525e5eSSascha Hauer static inline int ubifs_shash_update(const struct ubifs_info *c, 154149525e5eSSascha Hauer struct shash_desc *desc, const void *buf, 154249525e5eSSascha Hauer unsigned int len) 154349525e5eSSascha Hauer { 154449525e5eSSascha Hauer int err = 0; 154549525e5eSSascha Hauer 154649525e5eSSascha Hauer if (ubifs_authenticated(c)) { 154749525e5eSSascha Hauer err = crypto_shash_update(desc, buf, len); 154849525e5eSSascha Hauer if (err < 0) 154949525e5eSSascha Hauer return err; 155049525e5eSSascha Hauer } 155149525e5eSSascha Hauer 155249525e5eSSascha Hauer return 0; 155349525e5eSSascha Hauer } 155449525e5eSSascha Hauer 155549525e5eSSascha Hauer static inline int ubifs_shash_final(const struct ubifs_info *c, 155649525e5eSSascha Hauer struct shash_desc *desc, u8 *out) 155749525e5eSSascha Hauer { 155849525e5eSSascha Hauer return ubifs_authenticated(c) ? crypto_shash_final(desc, out) : 0; 155949525e5eSSascha Hauer } 156049525e5eSSascha Hauer 156149525e5eSSascha Hauer int __ubifs_node_calc_hash(const struct ubifs_info *c, const void *buf, 156249525e5eSSascha Hauer u8 *hash); 156349525e5eSSascha Hauer static inline int ubifs_node_calc_hash(const struct ubifs_info *c, 156449525e5eSSascha Hauer const void *buf, u8 *hash) 156549525e5eSSascha Hauer { 156649525e5eSSascha Hauer if (ubifs_authenticated(c)) 156749525e5eSSascha Hauer return __ubifs_node_calc_hash(c, buf, hash); 156849525e5eSSascha Hauer else 156949525e5eSSascha Hauer return 0; 157049525e5eSSascha Hauer } 157149525e5eSSascha Hauer 157249525e5eSSascha Hauer int ubifs_prepare_auth_node(struct ubifs_info *c, void *node, 157349525e5eSSascha Hauer struct shash_desc *inhash); 157449525e5eSSascha Hauer 157549525e5eSSascha Hauer /** 157649525e5eSSascha Hauer * ubifs_check_hash - compare two hashes 157749525e5eSSascha Hauer * @c: UBIFS file-system description object 157849525e5eSSascha Hauer * @expected: first hash 157949525e5eSSascha Hauer * @got: second hash 158049525e5eSSascha Hauer * 158149525e5eSSascha Hauer * Compare two hashes @expected and @got. Returns 0 when they are equal, a 158249525e5eSSascha Hauer * negative error code otherwise. 158349525e5eSSascha Hauer */ 158449525e5eSSascha Hauer static inline int ubifs_check_hash(const struct ubifs_info *c, 158549525e5eSSascha Hauer const u8 *expected, const u8 *got) 158649525e5eSSascha Hauer { 158749525e5eSSascha Hauer return crypto_memneq(expected, got, c->hash_len); 158849525e5eSSascha Hauer } 158949525e5eSSascha Hauer 159049525e5eSSascha Hauer /** 159149525e5eSSascha Hauer * ubifs_check_hmac - compare two HMACs 159249525e5eSSascha Hauer * @c: UBIFS file-system description object 159349525e5eSSascha Hauer * @expected: first HMAC 159449525e5eSSascha Hauer * @got: second HMAC 159549525e5eSSascha Hauer * 159649525e5eSSascha Hauer * Compare two hashes @expected and @got. Returns 0 when they are equal, a 159749525e5eSSascha Hauer * negative error code otherwise. 159849525e5eSSascha Hauer */ 159949525e5eSSascha Hauer static inline int ubifs_check_hmac(const struct ubifs_info *c, 160049525e5eSSascha Hauer const u8 *expected, const u8 *got) 160149525e5eSSascha Hauer { 160249525e5eSSascha Hauer return crypto_memneq(expected, got, c->hmac_desc_len); 160349525e5eSSascha Hauer } 160449525e5eSSascha Hauer 160549525e5eSSascha Hauer void ubifs_bad_hash(const struct ubifs_info *c, const void *node, 160649525e5eSSascha Hauer const u8 *hash, int lnum, int offs); 160749525e5eSSascha Hauer 160849525e5eSSascha Hauer int __ubifs_node_check_hash(const struct ubifs_info *c, const void *buf, 160949525e5eSSascha Hauer const u8 *expected); 161049525e5eSSascha Hauer static inline int ubifs_node_check_hash(const struct ubifs_info *c, 161149525e5eSSascha Hauer const void *buf, const u8 *expected) 161249525e5eSSascha Hauer { 161349525e5eSSascha Hauer if (ubifs_authenticated(c)) 161449525e5eSSascha Hauer return __ubifs_node_check_hash(c, buf, expected); 161549525e5eSSascha Hauer else 161649525e5eSSascha Hauer return 0; 161749525e5eSSascha Hauer } 161849525e5eSSascha Hauer 161949525e5eSSascha Hauer int ubifs_init_authentication(struct ubifs_info *c); 162049525e5eSSascha Hauer void __ubifs_exit_authentication(struct ubifs_info *c); 162149525e5eSSascha Hauer static inline void ubifs_exit_authentication(struct ubifs_info *c) 162249525e5eSSascha Hauer { 162349525e5eSSascha Hauer if (ubifs_authenticated(c)) 162449525e5eSSascha Hauer __ubifs_exit_authentication(c); 162549525e5eSSascha Hauer } 162649525e5eSSascha Hauer 162749525e5eSSascha Hauer /** 162849525e5eSSascha Hauer * ubifs_branch_hash - returns a pointer to the hash of a branch 162949525e5eSSascha Hauer * @c: UBIFS file-system description object 163049525e5eSSascha Hauer * @br: branch to get the hash from 163149525e5eSSascha Hauer * 163249525e5eSSascha Hauer * This returns a pointer to the hash of a branch. Since the key already is a 163349525e5eSSascha Hauer * dynamically sized object we cannot use a struct member here. 163449525e5eSSascha Hauer */ 163549525e5eSSascha Hauer static inline u8 *ubifs_branch_hash(struct ubifs_info *c, 163649525e5eSSascha Hauer struct ubifs_branch *br) 163749525e5eSSascha Hauer { 163849525e5eSSascha Hauer return (void *)br + sizeof(*br) + c->key_len; 163949525e5eSSascha Hauer } 164049525e5eSSascha Hauer 164149525e5eSSascha Hauer /** 164249525e5eSSascha Hauer * ubifs_copy_hash - copy a hash 164349525e5eSSascha Hauer * @c: UBIFS file-system description object 164449525e5eSSascha Hauer * @from: source hash 164549525e5eSSascha Hauer * @to: destination hash 164649525e5eSSascha Hauer * 164749525e5eSSascha Hauer * With authentication this copies a hash, otherwise does nothing. 164849525e5eSSascha Hauer */ 164949525e5eSSascha Hauer static inline void ubifs_copy_hash(const struct ubifs_info *c, const u8 *from, 165049525e5eSSascha Hauer u8 *to) 165149525e5eSSascha Hauer { 165249525e5eSSascha Hauer if (ubifs_authenticated(c)) 165349525e5eSSascha Hauer memcpy(to, from, c->hash_len); 165449525e5eSSascha Hauer } 165549525e5eSSascha Hauer 165649525e5eSSascha Hauer int __ubifs_node_insert_hmac(const struct ubifs_info *c, void *buf, 165749525e5eSSascha Hauer int len, int ofs_hmac); 165849525e5eSSascha Hauer static inline int ubifs_node_insert_hmac(const struct ubifs_info *c, void *buf, 165949525e5eSSascha Hauer int len, int ofs_hmac) 166049525e5eSSascha Hauer { 166149525e5eSSascha Hauer if (ubifs_authenticated(c)) 166249525e5eSSascha Hauer return __ubifs_node_insert_hmac(c, buf, len, ofs_hmac); 166349525e5eSSascha Hauer else 166449525e5eSSascha Hauer return 0; 166549525e5eSSascha Hauer } 166649525e5eSSascha Hauer 166749525e5eSSascha Hauer int __ubifs_node_verify_hmac(const struct ubifs_info *c, const void *buf, 166849525e5eSSascha Hauer int len, int ofs_hmac); 166949525e5eSSascha Hauer static inline int ubifs_node_verify_hmac(const struct ubifs_info *c, 167049525e5eSSascha Hauer const void *buf, int len, int ofs_hmac) 167149525e5eSSascha Hauer { 167249525e5eSSascha Hauer if (ubifs_authenticated(c)) 167349525e5eSSascha Hauer return __ubifs_node_verify_hmac(c, buf, len, ofs_hmac); 167449525e5eSSascha Hauer else 167549525e5eSSascha Hauer return 0; 167649525e5eSSascha Hauer } 167749525e5eSSascha Hauer 167849525e5eSSascha Hauer /** 167949525e5eSSascha Hauer * ubifs_auth_node_sz - returns the size of an authentication node 168049525e5eSSascha Hauer * @c: UBIFS file-system description object 168149525e5eSSascha Hauer * 168249525e5eSSascha Hauer * This function returns the size of an authentication node which can 168349525e5eSSascha Hauer * be 0 for unauthenticated filesystems or the real size of an auth node 168449525e5eSSascha Hauer * authentication is enabled. 168549525e5eSSascha Hauer */ 168649525e5eSSascha Hauer static inline int ubifs_auth_node_sz(const struct ubifs_info *c) 168749525e5eSSascha Hauer { 168849525e5eSSascha Hauer if (ubifs_authenticated(c)) 168949525e5eSSascha Hauer return sizeof(struct ubifs_auth_node) + c->hmac_desc_len; 169049525e5eSSascha Hauer else 169149525e5eSSascha Hauer return 0; 169249525e5eSSascha Hauer } 169349525e5eSSascha Hauer 169449525e5eSSascha Hauer int ubifs_hmac_wkm(struct ubifs_info *c, u8 *hmac); 169549525e5eSSascha Hauer 169649525e5eSSascha Hauer int __ubifs_shash_copy_state(const struct ubifs_info *c, struct shash_desc *src, 169749525e5eSSascha Hauer struct shash_desc *target); 169849525e5eSSascha Hauer static inline int ubifs_shash_copy_state(const struct ubifs_info *c, 169949525e5eSSascha Hauer struct shash_desc *src, 170049525e5eSSascha Hauer struct shash_desc *target) 170149525e5eSSascha Hauer { 170249525e5eSSascha Hauer if (ubifs_authenticated(c)) 170349525e5eSSascha Hauer return __ubifs_shash_copy_state(c, src, target); 170449525e5eSSascha Hauer else 170549525e5eSSascha Hauer return 0; 170649525e5eSSascha Hauer } 170749525e5eSSascha Hauer 17081e51764aSArtem Bityutskiy /* io.c */ 1709ff46d7b3SAdrian Hunter void ubifs_ro_mode(struct ubifs_info *c, int err); 171083cef708SArtem Bityutskiy int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, 171183cef708SArtem Bityutskiy int len, int even_ebadmsg); 171283cef708SArtem Bityutskiy int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, 1713b36a261eSRichard Weinberger int len); 1714b36a261eSRichard Weinberger int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len); 171583cef708SArtem Bityutskiy int ubifs_leb_unmap(struct ubifs_info *c, int lnum); 1716b36a261eSRichard Weinberger int ubifs_leb_map(struct ubifs_info *c, int lnum); 171783cef708SArtem Bityutskiy int ubifs_is_mapped(const struct ubifs_info *c, int lnum); 17181e51764aSArtem Bityutskiy int ubifs_wbuf_write_nolock(struct ubifs_wbuf *wbuf, void *buf, int len); 1719b36a261eSRichard Weinberger int ubifs_wbuf_seek_nolock(struct ubifs_wbuf *wbuf, int lnum, int offs); 17201e51764aSArtem Bityutskiy int ubifs_wbuf_init(struct ubifs_info *c, struct ubifs_wbuf *wbuf); 17211e51764aSArtem Bityutskiy int ubifs_read_node(const struct ubifs_info *c, void *buf, int type, int len, 17221e51764aSArtem Bityutskiy int lnum, int offs); 17231e51764aSArtem Bityutskiy int ubifs_read_node_wbuf(struct ubifs_wbuf *wbuf, void *buf, int type, int len, 17241e51764aSArtem Bityutskiy int lnum, int offs); 17251e51764aSArtem Bityutskiy int ubifs_write_node(struct ubifs_info *c, void *node, int len, int lnum, 1726b36a261eSRichard Weinberger int offs); 1727a384b47eSSascha Hauer int ubifs_write_node_hmac(struct ubifs_info *c, void *buf, int len, int lnum, 1728a384b47eSSascha Hauer int offs, int hmac_offs); 17291e51764aSArtem Bityutskiy int ubifs_check_node(const struct ubifs_info *c, const void *buf, int lnum, 17306f7ab6d4SArtem Bityutskiy int offs, int quiet, int must_chk_crc); 1731dead9726SSascha Hauer void ubifs_init_node(struct ubifs_info *c, void *buf, int len, int pad); 1732dead9726SSascha Hauer void ubifs_crc_node(struct ubifs_info *c, void *buf, int len); 17331e51764aSArtem Bityutskiy void ubifs_prepare_node(struct ubifs_info *c, void *buf, int len, int pad); 1734a384b47eSSascha Hauer int ubifs_prepare_node_hmac(struct ubifs_info *c, void *node, int len, 1735a384b47eSSascha Hauer int hmac_offs, int pad); 17361e51764aSArtem Bityutskiy void ubifs_prep_grp_node(struct ubifs_info *c, void *node, int len, int last); 17371e51764aSArtem Bityutskiy int ubifs_io_init(struct ubifs_info *c); 17381e51764aSArtem Bityutskiy void ubifs_pad(const struct ubifs_info *c, void *buf, int pad); 17391e51764aSArtem Bityutskiy int ubifs_wbuf_sync_nolock(struct ubifs_wbuf *wbuf); 17401e51764aSArtem Bityutskiy int ubifs_bg_wbufs_sync(struct ubifs_info *c); 17411e51764aSArtem Bityutskiy void ubifs_wbuf_add_ino_nolock(struct ubifs_wbuf *wbuf, ino_t inum); 17421e51764aSArtem Bityutskiy int ubifs_sync_wbufs_by_inode(struct ubifs_info *c, struct inode *inode); 17431e51764aSArtem Bityutskiy 17441e51764aSArtem Bityutskiy /* scan.c */ 17451e51764aSArtem Bityutskiy struct ubifs_scan_leb *ubifs_scan(const struct ubifs_info *c, int lnum, 1746348709baSArtem Bityutskiy int offs, void *sbuf, int quiet); 17471e51764aSArtem Bityutskiy void ubifs_scan_destroy(struct ubifs_scan_leb *sleb); 17481e51764aSArtem Bityutskiy int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, 17491e51764aSArtem Bityutskiy int offs, int quiet); 17501e51764aSArtem Bityutskiy struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, 17511e51764aSArtem Bityutskiy int offs, void *sbuf); 17521e51764aSArtem Bityutskiy void ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, 17531e51764aSArtem Bityutskiy int lnum, int offs); 17541e51764aSArtem Bityutskiy int ubifs_add_snod(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, 17551e51764aSArtem Bityutskiy void *buf, int offs); 17561e51764aSArtem Bityutskiy void ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs, 17571e51764aSArtem Bityutskiy void *buf); 17581e51764aSArtem Bityutskiy 17591e51764aSArtem Bityutskiy /* log.c */ 17601e51764aSArtem Bityutskiy void ubifs_add_bud(struct ubifs_info *c, struct ubifs_bud *bud); 17611e51764aSArtem Bityutskiy void ubifs_create_buds_lists(struct ubifs_info *c); 17621e51764aSArtem Bityutskiy int ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs); 17631e51764aSArtem Bityutskiy struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum); 17641e51764aSArtem Bityutskiy struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum); 17651e51764aSArtem Bityutskiy int ubifs_log_start_commit(struct ubifs_info *c, int *ltail_lnum); 17661e51764aSArtem Bityutskiy int ubifs_log_end_commit(struct ubifs_info *c, int new_ltail_lnum); 17671e51764aSArtem Bityutskiy int ubifs_log_post_commit(struct ubifs_info *c, int old_ltail_lnum); 17681e51764aSArtem Bityutskiy int ubifs_consolidate_log(struct ubifs_info *c); 17691e51764aSArtem Bityutskiy 17701e51764aSArtem Bityutskiy /* journal.c */ 17711e51764aSArtem Bityutskiy int ubifs_jnl_update(struct ubifs_info *c, const struct inode *dir, 1772f4f61d2cSRichard Weinberger const struct fscrypt_name *nm, const struct inode *inode, 17731e51764aSArtem Bityutskiy int deletion, int xent); 17741e51764aSArtem Bityutskiy int ubifs_jnl_write_data(struct ubifs_info *c, const struct inode *inode, 17751e51764aSArtem Bityutskiy const union ubifs_key *key, const void *buf, int len); 17761f28681aSArtem Bityutskiy int ubifs_jnl_write_inode(struct ubifs_info *c, const struct inode *inode); 1777de94eb55SArtem Bityutskiy int ubifs_jnl_delete_inode(struct ubifs_info *c, const struct inode *inode); 17789ec64962SRichard Weinberger int ubifs_jnl_xrename(struct ubifs_info *c, const struct inode *fst_dir, 1779f4f61d2cSRichard Weinberger const struct inode *fst_inode, 1780f4f61d2cSRichard Weinberger const struct fscrypt_name *fst_nm, 17819ec64962SRichard Weinberger const struct inode *snd_dir, 1782f4f61d2cSRichard Weinberger const struct inode *snd_inode, 1783f4f61d2cSRichard Weinberger const struct fscrypt_name *snd_nm, int sync); 17841e51764aSArtem Bityutskiy int ubifs_jnl_rename(struct ubifs_info *c, const struct inode *old_dir, 1785f4f61d2cSRichard Weinberger const struct inode *old_inode, 1786f4f61d2cSRichard Weinberger const struct fscrypt_name *old_nm, 17871e51764aSArtem Bityutskiy const struct inode *new_dir, 1788f4f61d2cSRichard Weinberger const struct inode *new_inode, 1789f4f61d2cSRichard Weinberger const struct fscrypt_name *new_nm, 17909e0a1fffSRichard Weinberger const struct inode *whiteout, int sync); 17911e51764aSArtem Bityutskiy int ubifs_jnl_truncate(struct ubifs_info *c, const struct inode *inode, 17921e51764aSArtem Bityutskiy loff_t old_size, loff_t new_size); 17931e51764aSArtem Bityutskiy int ubifs_jnl_delete_xattr(struct ubifs_info *c, const struct inode *host, 1794f4f61d2cSRichard Weinberger const struct inode *inode, const struct fscrypt_name *nm); 17951e51764aSArtem Bityutskiy int ubifs_jnl_change_xattr(struct ubifs_info *c, const struct inode *inode1, 17961e51764aSArtem Bityutskiy const struct inode *inode2); 17971e51764aSArtem Bityutskiy 17981e51764aSArtem Bityutskiy /* budget.c */ 17991e51764aSArtem Bityutskiy int ubifs_budget_space(struct ubifs_info *c, struct ubifs_budget_req *req); 18001e51764aSArtem Bityutskiy void ubifs_release_budget(struct ubifs_info *c, struct ubifs_budget_req *req); 18011e51764aSArtem Bityutskiy void ubifs_release_dirty_inode_budget(struct ubifs_info *c, 18021e51764aSArtem Bityutskiy struct ubifs_inode *ui); 18031e51764aSArtem Bityutskiy int ubifs_budget_inode_op(struct ubifs_info *c, struct inode *inode, 18041e51764aSArtem Bityutskiy struct ubifs_budget_req *req); 18051e51764aSArtem Bityutskiy void ubifs_release_ino_dirty(struct ubifs_info *c, struct inode *inode, 18061e51764aSArtem Bityutskiy struct ubifs_budget_req *req); 18071e51764aSArtem Bityutskiy void ubifs_cancel_ino_op(struct ubifs_info *c, struct inode *inode, 18081e51764aSArtem Bityutskiy struct ubifs_budget_req *req); 18097dad181bSArtem Bityutskiy long long ubifs_get_free_space(struct ubifs_info *c); 181084abf972SArtem Bityutskiy long long ubifs_get_free_space_nolock(struct ubifs_info *c); 18111e51764aSArtem Bityutskiy int ubifs_calc_min_idx_lebs(struct ubifs_info *c); 18121e51764aSArtem Bityutskiy void ubifs_convert_page_budget(struct ubifs_info *c); 18134d61db4fSArtem Bityutskiy long long ubifs_reported_space(const struct ubifs_info *c, long long free); 18141e51764aSArtem Bityutskiy long long ubifs_calc_available(const struct ubifs_info *c, int min_idx_lebs); 18151e51764aSArtem Bityutskiy 18161e51764aSArtem Bityutskiy /* find.c */ 18173edaae7cSArtem Bityutskiy int ubifs_find_free_space(struct ubifs_info *c, int min_space, int *offs, 18181e51764aSArtem Bityutskiy int squeeze); 18191e51764aSArtem Bityutskiy int ubifs_find_free_leb_for_idx(struct ubifs_info *c); 18201e51764aSArtem Bityutskiy int ubifs_find_dirty_leb(struct ubifs_info *c, struct ubifs_lprops *ret_lp, 18211e51764aSArtem Bityutskiy int min_space, int pick_free); 18221e51764aSArtem Bityutskiy int ubifs_find_dirty_idx_leb(struct ubifs_info *c); 18231e51764aSArtem Bityutskiy int ubifs_save_dirty_idx_lnums(struct ubifs_info *c); 18241e51764aSArtem Bityutskiy 18251e51764aSArtem Bityutskiy /* tnc.c */ 18261e51764aSArtem Bityutskiy int ubifs_lookup_level0(struct ubifs_info *c, const union ubifs_key *key, 18271e51764aSArtem Bityutskiy struct ubifs_znode **zn, int *n); 18281e51764aSArtem Bityutskiy int ubifs_tnc_lookup_nm(struct ubifs_info *c, const union ubifs_key *key, 1829f4f61d2cSRichard Weinberger void *node, const struct fscrypt_name *nm); 1830528e3d17SRichard Weinberger int ubifs_tnc_lookup_dh(struct ubifs_info *c, const union ubifs_key *key, 1831528e3d17SRichard Weinberger void *node, uint32_t secondary_hash); 18321e51764aSArtem Bityutskiy int ubifs_tnc_locate(struct ubifs_info *c, const union ubifs_key *key, 18331e51764aSArtem Bityutskiy void *node, int *lnum, int *offs); 18341e51764aSArtem Bityutskiy int ubifs_tnc_add(struct ubifs_info *c, const union ubifs_key *key, int lnum, 1835823838a4SSascha Hauer int offs, int len, const u8 *hash); 18361e51764aSArtem Bityutskiy int ubifs_tnc_replace(struct ubifs_info *c, const union ubifs_key *key, 18371e51764aSArtem Bityutskiy int old_lnum, int old_offs, int lnum, int offs, int len); 18381e51764aSArtem Bityutskiy int ubifs_tnc_add_nm(struct ubifs_info *c, const union ubifs_key *key, 1839823838a4SSascha Hauer int lnum, int offs, int len, const u8 *hash, 1840823838a4SSascha Hauer const struct fscrypt_name *nm); 18411e51764aSArtem Bityutskiy int ubifs_tnc_remove(struct ubifs_info *c, const union ubifs_key *key); 18421e51764aSArtem Bityutskiy int ubifs_tnc_remove_nm(struct ubifs_info *c, const union ubifs_key *key, 1843f4f61d2cSRichard Weinberger const struct fscrypt_name *nm); 1844781f675eSRichard Weinberger int ubifs_tnc_remove_dh(struct ubifs_info *c, const union ubifs_key *key, 1845781f675eSRichard Weinberger uint32_t cookie); 18461e51764aSArtem Bityutskiy int ubifs_tnc_remove_range(struct ubifs_info *c, union ubifs_key *from_key, 18471e51764aSArtem Bityutskiy union ubifs_key *to_key); 18481e51764aSArtem Bityutskiy int ubifs_tnc_remove_ino(struct ubifs_info *c, ino_t inum); 18491e51764aSArtem Bityutskiy struct ubifs_dent_node *ubifs_tnc_next_ent(struct ubifs_info *c, 18501e51764aSArtem Bityutskiy union ubifs_key *key, 1851f4f61d2cSRichard Weinberger const struct fscrypt_name *nm); 18521e51764aSArtem Bityutskiy void ubifs_tnc_close(struct ubifs_info *c); 18531e51764aSArtem Bityutskiy int ubifs_tnc_has_node(struct ubifs_info *c, union ubifs_key *key, int level, 18541e51764aSArtem Bityutskiy int lnum, int offs, int is_idx); 18551e51764aSArtem Bityutskiy int ubifs_dirty_idx_node(struct ubifs_info *c, union ubifs_key *key, int level, 18561e51764aSArtem Bityutskiy int lnum, int offs); 18571e51764aSArtem Bityutskiy /* Shared by tnc.c for tnc_commit.c */ 18581e51764aSArtem Bityutskiy void destroy_old_idx(struct ubifs_info *c); 18591e51764aSArtem Bityutskiy int is_idx_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int level, 18601e51764aSArtem Bityutskiy int lnum, int offs); 18611e51764aSArtem Bityutskiy int insert_old_idx_znode(struct ubifs_info *c, struct ubifs_znode *znode); 18624793e7c5SAdrian Hunter int ubifs_tnc_get_bu_keys(struct ubifs_info *c, struct bu_info *bu); 18634793e7c5SAdrian Hunter int ubifs_tnc_bulk_read(struct ubifs_info *c, struct bu_info *bu); 18641e51764aSArtem Bityutskiy 18651e51764aSArtem Bityutskiy /* tnc_misc.c */ 18666eb61d58SRichard Weinberger struct ubifs_znode *ubifs_tnc_levelorder_next(const struct ubifs_info *c, 18676eb61d58SRichard Weinberger struct ubifs_znode *zr, 18681e51764aSArtem Bityutskiy struct ubifs_znode *znode); 18691e51764aSArtem Bityutskiy int ubifs_search_zbranch(const struct ubifs_info *c, 18701e51764aSArtem Bityutskiy const struct ubifs_znode *znode, 18711e51764aSArtem Bityutskiy const union ubifs_key *key, int *n); 18721e51764aSArtem Bityutskiy struct ubifs_znode *ubifs_tnc_postorder_first(struct ubifs_znode *znode); 18736eb61d58SRichard Weinberger struct ubifs_znode *ubifs_tnc_postorder_next(const struct ubifs_info *c, 18746eb61d58SRichard Weinberger struct ubifs_znode *znode); 18756eb61d58SRichard Weinberger long ubifs_destroy_tnc_subtree(const struct ubifs_info *c, 18766eb61d58SRichard Weinberger struct ubifs_znode *zr); 18771e51764aSArtem Bityutskiy struct ubifs_znode *ubifs_load_znode(struct ubifs_info *c, 18781e51764aSArtem Bityutskiy struct ubifs_zbranch *zbr, 18791e51764aSArtem Bityutskiy struct ubifs_znode *parent, int iip); 18801e51764aSArtem Bityutskiy int ubifs_tnc_read_node(struct ubifs_info *c, struct ubifs_zbranch *zbr, 18811e51764aSArtem Bityutskiy void *node); 18821e51764aSArtem Bityutskiy 18831e51764aSArtem Bityutskiy /* tnc_commit.c */ 18841e51764aSArtem Bityutskiy int ubifs_tnc_start_commit(struct ubifs_info *c, struct ubifs_zbranch *zroot); 18851e51764aSArtem Bityutskiy int ubifs_tnc_end_commit(struct ubifs_info *c); 18861e51764aSArtem Bityutskiy 18871e51764aSArtem Bityutskiy /* shrinker.c */ 18881ab6c499SDave Chinner unsigned long ubifs_shrink_scan(struct shrinker *shrink, 18891ab6c499SDave Chinner struct shrink_control *sc); 18901ab6c499SDave Chinner unsigned long ubifs_shrink_count(struct shrinker *shrink, 18911ab6c499SDave Chinner struct shrink_control *sc); 18921e51764aSArtem Bityutskiy 18931e51764aSArtem Bityutskiy /* commit.c */ 18941e51764aSArtem Bityutskiy int ubifs_bg_thread(void *info); 18951e51764aSArtem Bityutskiy void ubifs_commit_required(struct ubifs_info *c); 18961e51764aSArtem Bityutskiy void ubifs_request_bg_commit(struct ubifs_info *c); 18971e51764aSArtem Bityutskiy int ubifs_run_commit(struct ubifs_info *c); 18981e51764aSArtem Bityutskiy void ubifs_recovery_commit(struct ubifs_info *c); 18991e51764aSArtem Bityutskiy int ubifs_gc_should_commit(struct ubifs_info *c); 19001e51764aSArtem Bityutskiy void ubifs_wait_for_commit(struct ubifs_info *c); 19011e51764aSArtem Bityutskiy 19021e51764aSArtem Bityutskiy /* master.c */ 19031e51764aSArtem Bityutskiy int ubifs_read_master(struct ubifs_info *c); 19041e51764aSArtem Bityutskiy int ubifs_write_master(struct ubifs_info *c); 19051e51764aSArtem Bityutskiy 19061e51764aSArtem Bityutskiy /* sb.c */ 19071e51764aSArtem Bityutskiy int ubifs_read_superblock(struct ubifs_info *c); 19081e51764aSArtem Bityutskiy int ubifs_write_sb_node(struct ubifs_info *c, struct ubifs_sb_node *sup); 19096554a657SMatthew L. Creech int ubifs_fixup_free_space(struct ubifs_info *c); 1910e021986eSRichard Weinberger int ubifs_enable_encryption(struct ubifs_info *c); 19111e51764aSArtem Bityutskiy 19121e51764aSArtem Bityutskiy /* replay.c */ 19131e51764aSArtem Bityutskiy int ubifs_validate_entry(struct ubifs_info *c, 19141e51764aSArtem Bityutskiy const struct ubifs_dent_node *dent); 19151e51764aSArtem Bityutskiy int ubifs_replay_journal(struct ubifs_info *c); 19161e51764aSArtem Bityutskiy 19171e51764aSArtem Bityutskiy /* gc.c */ 19181e51764aSArtem Bityutskiy int ubifs_garbage_collect(struct ubifs_info *c, int anyway); 19191e51764aSArtem Bityutskiy int ubifs_gc_start_commit(struct ubifs_info *c); 19201e51764aSArtem Bityutskiy int ubifs_gc_end_commit(struct ubifs_info *c); 1921b466f17dSAdrian Hunter void ubifs_destroy_idx_gc(struct ubifs_info *c); 19221e51764aSArtem Bityutskiy int ubifs_get_idx_gc_leb(struct ubifs_info *c); 19231e51764aSArtem Bityutskiy int ubifs_garbage_collect_leb(struct ubifs_info *c, struct ubifs_lprops *lp); 19241e51764aSArtem Bityutskiy 19251e51764aSArtem Bityutskiy /* orphan.c */ 19261e51764aSArtem Bityutskiy int ubifs_add_orphan(struct ubifs_info *c, ino_t inum); 19271e51764aSArtem Bityutskiy void ubifs_delete_orphan(struct ubifs_info *c, ino_t inum); 19281e51764aSArtem Bityutskiy int ubifs_orphan_start_commit(struct ubifs_info *c); 19291e51764aSArtem Bityutskiy int ubifs_orphan_end_commit(struct ubifs_info *c); 19301e51764aSArtem Bityutskiy int ubifs_mount_orphans(struct ubifs_info *c, int unclean, int read_only); 193149d128aaSAdrian Hunter int ubifs_clear_orphans(struct ubifs_info *c); 19321e51764aSArtem Bityutskiy 19331e51764aSArtem Bityutskiy /* lpt.c */ 19341e51764aSArtem Bityutskiy int ubifs_calc_lpt_geom(struct ubifs_info *c); 19351e51764aSArtem Bityutskiy int ubifs_create_dflt_lpt(struct ubifs_info *c, int *main_lebs, int lpt_first, 19361e51764aSArtem Bityutskiy int *lpt_lebs, int *big_lpt); 19371e51764aSArtem Bityutskiy int ubifs_lpt_init(struct ubifs_info *c, int rd, int wr); 19381e51764aSArtem Bityutskiy struct ubifs_lprops *ubifs_lpt_lookup(struct ubifs_info *c, int lnum); 19391e51764aSArtem Bityutskiy struct ubifs_lprops *ubifs_lpt_lookup_dirty(struct ubifs_info *c, int lnum); 19401e51764aSArtem Bityutskiy int ubifs_lpt_scan_nolock(struct ubifs_info *c, int start_lnum, int end_lnum, 19411e51764aSArtem Bityutskiy ubifs_lpt_scan_callback scan_cb, void *data); 19421e51764aSArtem Bityutskiy 19431e51764aSArtem Bityutskiy /* Shared by lpt.c for lpt_commit.c */ 19441e51764aSArtem Bityutskiy void ubifs_pack_lsave(struct ubifs_info *c, void *buf, int *lsave); 19451e51764aSArtem Bityutskiy void ubifs_pack_ltab(struct ubifs_info *c, void *buf, 19461e51764aSArtem Bityutskiy struct ubifs_lpt_lprops *ltab); 19471e51764aSArtem Bityutskiy void ubifs_pack_pnode(struct ubifs_info *c, void *buf, 19481e51764aSArtem Bityutskiy struct ubifs_pnode *pnode); 19491e51764aSArtem Bityutskiy void ubifs_pack_nnode(struct ubifs_info *c, void *buf, 19501e51764aSArtem Bityutskiy struct ubifs_nnode *nnode); 19511e51764aSArtem Bityutskiy struct ubifs_pnode *ubifs_get_pnode(struct ubifs_info *c, 19521e51764aSArtem Bityutskiy struct ubifs_nnode *parent, int iip); 19531e51764aSArtem Bityutskiy struct ubifs_nnode *ubifs_get_nnode(struct ubifs_info *c, 19541e51764aSArtem Bityutskiy struct ubifs_nnode *parent, int iip); 19550e26b6e2SSascha Hauer struct ubifs_pnode *ubifs_pnode_lookup(struct ubifs_info *c, int i); 19561e51764aSArtem Bityutskiy int ubifs_read_nnode(struct ubifs_info *c, struct ubifs_nnode *parent, int iip); 19571e51764aSArtem Bityutskiy void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty); 19581e51764aSArtem Bityutskiy void ubifs_add_nnode_dirt(struct ubifs_info *c, struct ubifs_nnode *nnode); 19596eb61d58SRichard Weinberger uint32_t ubifs_unpack_bits(const struct ubifs_info *c, uint8_t **addr, int *pos, int nrbits); 19601e51764aSArtem Bityutskiy struct ubifs_nnode *ubifs_first_nnode(struct ubifs_info *c, int *hght); 19612ba5f7aeSArtem Bityutskiy /* Needed only in debugging code in lpt_commit.c */ 19622ba5f7aeSArtem Bityutskiy int ubifs_unpack_nnode(const struct ubifs_info *c, void *buf, 19632ba5f7aeSArtem Bityutskiy struct ubifs_nnode *nnode); 19641e51764aSArtem Bityutskiy 19651e51764aSArtem Bityutskiy /* lpt_commit.c */ 19661e51764aSArtem Bityutskiy int ubifs_lpt_start_commit(struct ubifs_info *c); 19671e51764aSArtem Bityutskiy int ubifs_lpt_end_commit(struct ubifs_info *c); 19681e51764aSArtem Bityutskiy int ubifs_lpt_post_commit(struct ubifs_info *c); 19691e51764aSArtem Bityutskiy void ubifs_lpt_free(struct ubifs_info *c, int wr_only); 19701e51764aSArtem Bityutskiy 19711e51764aSArtem Bityutskiy /* lprops.c */ 19721e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_change_lp(struct ubifs_info *c, 19731e51764aSArtem Bityutskiy const struct ubifs_lprops *lp, 19741e51764aSArtem Bityutskiy int free, int dirty, int flags, 19751e51764aSArtem Bityutskiy int idx_gc_cnt); 197684abf972SArtem Bityutskiy void ubifs_get_lp_stats(struct ubifs_info *c, struct ubifs_lp_stats *lst); 19771e51764aSArtem Bityutskiy void ubifs_add_to_cat(struct ubifs_info *c, struct ubifs_lprops *lprops, 19781e51764aSArtem Bityutskiy int cat); 19791e51764aSArtem Bityutskiy void ubifs_replace_cat(struct ubifs_info *c, struct ubifs_lprops *old_lprops, 19801e51764aSArtem Bityutskiy struct ubifs_lprops *new_lprops); 19811e51764aSArtem Bityutskiy void ubifs_ensure_cat(struct ubifs_info *c, struct ubifs_lprops *lprops); 19821e51764aSArtem Bityutskiy int ubifs_categorize_lprops(const struct ubifs_info *c, 19831e51764aSArtem Bityutskiy const struct ubifs_lprops *lprops); 19841e51764aSArtem Bityutskiy int ubifs_change_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, 19851e51764aSArtem Bityutskiy int flags_set, int flags_clean, int idx_gc_cnt); 19861e51764aSArtem Bityutskiy int ubifs_update_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, 19871e51764aSArtem Bityutskiy int flags_set, int flags_clean); 19881e51764aSArtem Bityutskiy int ubifs_read_one_lp(struct ubifs_info *c, int lnum, struct ubifs_lprops *lp); 19891e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_fast_find_free(struct ubifs_info *c); 19901e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_fast_find_empty(struct ubifs_info *c); 19911e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_fast_find_freeable(struct ubifs_info *c); 19921e51764aSArtem Bityutskiy const struct ubifs_lprops *ubifs_fast_find_frdi_idx(struct ubifs_info *c); 1993be9e62a7SArtem Bityutskiy int ubifs_calc_dark(const struct ubifs_info *c, int spc); 19941e51764aSArtem Bityutskiy 19951e51764aSArtem Bityutskiy /* file.c */ 199602c24a82SJosef Bacik int ubifs_fsync(struct file *file, loff_t start, loff_t end, int datasync); 19971e51764aSArtem Bityutskiy int ubifs_setattr(struct dentry *dentry, struct iattr *attr); 19988c1c5f26SDongsheng Yang #ifdef CONFIG_UBIFS_ATIME_SUPPORT 199995582b00SDeepa Dinamani int ubifs_update_time(struct inode *inode, struct timespec64 *time, int flags); 20008c1c5f26SDongsheng Yang #endif 20011e51764aSArtem Bityutskiy 20021e51764aSArtem Bityutskiy /* dir.c */ 2003d475a507SRichard Weinberger struct inode *ubifs_new_inode(struct ubifs_info *c, struct inode *dir, 2004ad44be5cSAl Viro umode_t mode); 2005a528d35eSDavid Howells int ubifs_getattr(const struct path *path, struct kstat *stat, 2006a528d35eSDavid Howells u32 request_mask, unsigned int flags); 2007f6337d84SRichard Weinberger int ubifs_check_dir_empty(struct inode *dir); 20081e51764aSArtem Bityutskiy 20091e51764aSArtem Bityutskiy /* xattr.c */ 20102b88fc21SAndreas Gruenbacher extern const struct xattr_handler *ubifs_xattr_handlers[]; 20111e51764aSArtem Bityutskiy ssize_t ubifs_listxattr(struct dentry *dentry, char *buffer, size_t size); 2012ade46c3aSRichard Weinberger int ubifs_xattr_set(struct inode *host, const char *name, const void *value, 2013d8db5b1cSXiaolei Li size_t size, int flags, bool check_lock); 2014ade46c3aSRichard Weinberger ssize_t ubifs_xattr_get(struct inode *host, const char *name, void *buf, 2015ade46c3aSRichard Weinberger size_t size); 20167e5471ceSStefan Agner 20177e5471ceSStefan Agner #ifdef CONFIG_UBIFS_FS_XATTR 2018272eda82SRichard Weinberger void ubifs_evict_xattr_inode(struct ubifs_info *c, ino_t xattr_inum); 20197e5471ceSStefan Agner #else 20207e5471ceSStefan Agner static inline void ubifs_evict_xattr_inode(struct ubifs_info *c, 20217e5471ceSStefan Agner ino_t xattr_inum) { } 20227e5471ceSStefan Agner #endif 20231e51764aSArtem Bityutskiy 20248326c1eeSHyunchul Lee #ifdef CONFIG_UBIFS_FS_SECURITY 20258326c1eeSHyunchul Lee extern int ubifs_init_security(struct inode *dentry, struct inode *inode, 20268326c1eeSHyunchul Lee const struct qstr *qstr); 20278326c1eeSHyunchul Lee #else 20288326c1eeSHyunchul Lee static inline int ubifs_init_security(struct inode *dentry, 20298326c1eeSHyunchul Lee struct inode *inode, const struct qstr *qstr) 20308326c1eeSHyunchul Lee { 20318326c1eeSHyunchul Lee return 0; 20328326c1eeSHyunchul Lee } 20338326c1eeSHyunchul Lee #endif 20348326c1eeSHyunchul Lee 20358326c1eeSHyunchul Lee 20361e51764aSArtem Bityutskiy /* super.c */ 20371e51764aSArtem Bityutskiy struct inode *ubifs_iget(struct super_block *sb, unsigned long inum); 20381e51764aSArtem Bityutskiy 20391e51764aSArtem Bityutskiy /* recovery.c */ 20401e51764aSArtem Bityutskiy int ubifs_recover_master_node(struct ubifs_info *c); 20411e51764aSArtem Bityutskiy int ubifs_write_rcvrd_mst_node(struct ubifs_info *c); 20421e51764aSArtem Bityutskiy struct ubifs_scan_leb *ubifs_recover_leb(struct ubifs_info *c, int lnum, 2043efcfde54SArtem Bityutskiy int offs, void *sbuf, int jhead); 20441e51764aSArtem Bityutskiy struct ubifs_scan_leb *ubifs_recover_log_leb(struct ubifs_info *c, int lnum, 20451e51764aSArtem Bityutskiy int offs, void *sbuf); 204683cef708SArtem Bityutskiy int ubifs_recover_inl_heads(struct ubifs_info *c, void *sbuf); 204783cef708SArtem Bityutskiy int ubifs_clean_lebs(struct ubifs_info *c, void *sbuf); 20481e51764aSArtem Bityutskiy int ubifs_rcvry_gc_commit(struct ubifs_info *c); 20491e51764aSArtem Bityutskiy int ubifs_recover_size_accum(struct ubifs_info *c, union ubifs_key *key, 20501e51764aSArtem Bityutskiy int deletion, loff_t new_size); 20511e51764aSArtem Bityutskiy int ubifs_recover_size(struct ubifs_info *c); 20521e51764aSArtem Bityutskiy void ubifs_destroy_size_tree(struct ubifs_info *c); 20531e51764aSArtem Bityutskiy 20541e51764aSArtem Bityutskiy /* ioctl.c */ 20551e51764aSArtem Bityutskiy long ubifs_ioctl(struct file *file, unsigned int cmd, unsigned long arg); 20561e51764aSArtem Bityutskiy void ubifs_set_inode_flags(struct inode *inode); 20571e51764aSArtem Bityutskiy #ifdef CONFIG_COMPAT 20581e51764aSArtem Bityutskiy long ubifs_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg); 20591e51764aSArtem Bityutskiy #endif 20601e51764aSArtem Bityutskiy 20611e51764aSArtem Bityutskiy /* compressor.c */ 20621e51764aSArtem Bityutskiy int __init ubifs_compressors_init(void); 2063995be045SAlexey Dobriyan void ubifs_compressors_exit(void); 2064235c362bSSheng Yong void ubifs_compress(const struct ubifs_info *c, const void *in_buf, int in_len, 2065235c362bSSheng Yong void *out_buf, int *out_len, int *compr_type); 2066235c362bSSheng Yong int ubifs_decompress(const struct ubifs_info *c, const void *buf, int len, 2067235c362bSSheng Yong void *out, int *out_len, int compr_type); 20681e51764aSArtem Bityutskiy 20691e51764aSArtem Bityutskiy #include "debug.h" 20701e51764aSArtem Bityutskiy #include "misc.h" 20711e51764aSArtem Bityutskiy #include "key.h" 20721e51764aSArtem Bityutskiy 2073d475a507SRichard Weinberger #ifndef CONFIG_UBIFS_FS_ENCRYPTION 20747799953bSRichard Weinberger static inline int ubifs_encrypt(const struct inode *inode, 20757799953bSRichard Weinberger struct ubifs_data_node *dn, 20767799953bSRichard Weinberger unsigned int in_len, unsigned int *out_len, 20777799953bSRichard Weinberger int block) 20787799953bSRichard Weinberger { 20796eb61d58SRichard Weinberger struct ubifs_info *c = inode->i_sb->s_fs_info; 20806eb61d58SRichard Weinberger ubifs_assert(c, 0); 20817799953bSRichard Weinberger return -EOPNOTSUPP; 20827799953bSRichard Weinberger } 20837799953bSRichard Weinberger static inline int ubifs_decrypt(const struct inode *inode, 20847799953bSRichard Weinberger struct ubifs_data_node *dn, 20857799953bSRichard Weinberger unsigned int *out_len, int block) 20867799953bSRichard Weinberger { 20876eb61d58SRichard Weinberger struct ubifs_info *c = inode->i_sb->s_fs_info; 20886eb61d58SRichard Weinberger ubifs_assert(c, 0); 20897799953bSRichard Weinberger return -EOPNOTSUPP; 20907799953bSRichard Weinberger } 20917799953bSRichard Weinberger #else 20927799953bSRichard Weinberger /* crypto.c */ 20937799953bSRichard Weinberger int ubifs_encrypt(const struct inode *inode, struct ubifs_data_node *dn, 20947799953bSRichard Weinberger unsigned int in_len, unsigned int *out_len, int block); 20957799953bSRichard Weinberger int ubifs_decrypt(const struct inode *inode, struct ubifs_data_node *dn, 20967799953bSRichard Weinberger unsigned int *out_len, int block); 2097d475a507SRichard Weinberger #endif 2098d475a507SRichard Weinberger 20996f69f0edSEric Biggers extern const struct fscrypt_operations ubifs_crypt_operations; 21007799953bSRichard Weinberger 21011ee77870SRichard Weinberger static inline bool ubifs_crypt_is_encrypted(const struct inode *inode) 21021ee77870SRichard Weinberger { 2103f7293e48SEric Biggers const struct ubifs_inode *ui = ubifs_inode(inode); 2104f7293e48SEric Biggers 2105f7293e48SEric Biggers return ui->flags & UBIFS_CRYPT_FL; 21061ee77870SRichard Weinberger } 21071ee77870SRichard Weinberger 21083e7f2c51SJoe Perches /* Normal UBIFS messages */ 21093e7f2c51SJoe Perches __printf(2, 3) 21103e7f2c51SJoe Perches void ubifs_msg(const struct ubifs_info *c, const char *fmt, ...); 21113e7f2c51SJoe Perches __printf(2, 3) 21123e7f2c51SJoe Perches void ubifs_err(const struct ubifs_info *c, const char *fmt, ...); 21133e7f2c51SJoe Perches __printf(2, 3) 21143e7f2c51SJoe Perches void ubifs_warn(const struct ubifs_info *c, const char *fmt, ...); 21153e7f2c51SJoe Perches /* 2116380bc8b7SDaniel Golle * A conditional variant of 'ubifs_err()' which doesn't output anything 21171751e8a6SLinus Torvalds * if probing (ie. SB_SILENT set). 21183e7f2c51SJoe Perches */ 21193e7f2c51SJoe Perches #define ubifs_errc(c, fmt, ...) \ 21203e7f2c51SJoe Perches do { \ 21213e7f2c51SJoe Perches if (!(c)->probing) \ 21223e7f2c51SJoe Perches ubifs_err(c, fmt, ##__VA_ARGS__); \ 21233e7f2c51SJoe Perches } while (0) 21243e7f2c51SJoe Perches 21251e51764aSArtem Bityutskiy #endif /* !__UBIFS_H__ */ 2126