11e51764aSArtem Bityutskiy /* 21e51764aSArtem Bityutskiy * This file is part of UBIFS. 31e51764aSArtem Bityutskiy * 41e51764aSArtem Bityutskiy * Copyright (C) 2006-2008 Nokia Corporation. 51e51764aSArtem Bityutskiy * Copyright (C) 2006, 2007 University of Szeged, Hungary 61e51764aSArtem Bityutskiy * 71e51764aSArtem Bityutskiy * This program is free software; you can redistribute it and/or modify it 81e51764aSArtem Bityutskiy * under the terms of the GNU General Public License version 2 as published by 91e51764aSArtem Bityutskiy * the Free Software Foundation. 101e51764aSArtem Bityutskiy * 111e51764aSArtem Bityutskiy * This program is distributed in the hope that it will be useful, but WITHOUT 121e51764aSArtem Bityutskiy * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 131e51764aSArtem Bityutskiy * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for 141e51764aSArtem Bityutskiy * more details. 151e51764aSArtem Bityutskiy * 161e51764aSArtem Bityutskiy * You should have received a copy of the GNU General Public License along with 171e51764aSArtem Bityutskiy * this program; if not, write to the Free Software Foundation, Inc., 51 181e51764aSArtem Bityutskiy * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 191e51764aSArtem Bityutskiy * 201e51764aSArtem Bityutskiy * Authors: Artem Bityutskiy (Битюцкий Артём) 211e51764aSArtem Bityutskiy * Adrian Hunter 221e51764aSArtem Bityutskiy * Zoltan Sogor 231e51764aSArtem Bityutskiy */ 241e51764aSArtem Bityutskiy 251e51764aSArtem Bityutskiy /* 261e51764aSArtem Bityutskiy * This file implements UBIFS I/O subsystem which provides various I/O-related 271e51764aSArtem Bityutskiy * helper functions (reading/writing/checking/validating nodes) and implements 281e51764aSArtem Bityutskiy * write-buffering support. Write buffers help to save space which otherwise 291e51764aSArtem Bityutskiy * would have been wasted for padding to the nearest minimal I/O unit boundary. 301e51764aSArtem Bityutskiy * Instead, data first goes to the write-buffer and is flushed when the 311e51764aSArtem Bityutskiy * buffer is full or when it is not used for some time (by timer). This is 321e51764aSArtem Bityutskiy * similar to the mechanism is used by JFFS2. 331e51764aSArtem Bityutskiy * 346c7f74f7SArtem Bityutskiy * UBIFS distinguishes between minimum write size (@c->min_io_size) and maximum 356c7f74f7SArtem Bityutskiy * write size (@c->max_write_size). The latter is the maximum amount of bytes 366c7f74f7SArtem Bityutskiy * the underlying flash is able to program at a time, and writing in 376c7f74f7SArtem Bityutskiy * @c->max_write_size units should presumably be faster. Obviously, 386c7f74f7SArtem Bityutskiy * @c->min_io_size <= @c->max_write_size. Write-buffers are of 396c7f74f7SArtem Bityutskiy * @c->max_write_size bytes in size for maximum performance. However, when a 406c7f74f7SArtem Bityutskiy * write-buffer is flushed, only the portion of it (aligned to @c->min_io_size 416c7f74f7SArtem Bityutskiy * boundary) which contains data is written, not the whole write-buffer, 426c7f74f7SArtem Bityutskiy * because this is more space-efficient. 436c7f74f7SArtem Bityutskiy * 446c7f74f7SArtem Bityutskiy * This optimization adds few complications to the code. Indeed, on the one 456c7f74f7SArtem Bityutskiy * hand, we want to write in optimal @c->max_write_size bytes chunks, which 466c7f74f7SArtem Bityutskiy * also means aligning writes at the @c->max_write_size bytes offsets. On the 476c7f74f7SArtem Bityutskiy * other hand, we do not want to waste space when synchronizing the write 486c7f74f7SArtem Bityutskiy * buffer, so during synchronization we writes in smaller chunks. And this makes 496c7f74f7SArtem Bityutskiy * the next write offset to be not aligned to @c->max_write_size bytes. So the 506c7f74f7SArtem Bityutskiy * have to make sure that the write-buffer offset (@wbuf->offs) becomes aligned 516c7f74f7SArtem Bityutskiy * to @c->max_write_size bytes again. We do this by temporarily shrinking 526c7f74f7SArtem Bityutskiy * write-buffer size (@wbuf->size). 536c7f74f7SArtem Bityutskiy * 541e51764aSArtem Bityutskiy * Write-buffers are defined by 'struct ubifs_wbuf' objects and protected by 551e51764aSArtem Bityutskiy * mutexes defined inside these objects. Since sometimes upper-level code 561e51764aSArtem Bityutskiy * has to lock the write-buffer (e.g. journal space reservation code), many 571e51764aSArtem Bityutskiy * functions related to write-buffers have "nolock" suffix which means that the 581e51764aSArtem Bityutskiy * caller has to lock the write-buffer before calling this function. 591e51764aSArtem Bityutskiy * 601e51764aSArtem Bityutskiy * UBIFS stores nodes at 64 bit-aligned addresses. If the node length is not 611e51764aSArtem Bityutskiy * aligned, UBIFS starts the next node from the aligned address, and the padded 621e51764aSArtem Bityutskiy * bytes may contain any rubbish. In other words, UBIFS does not put padding 631e51764aSArtem Bityutskiy * bytes in those small gaps. Common headers of nodes store real node lengths, 641e51764aSArtem Bityutskiy * not aligned lengths. Indexing nodes also store real lengths in branches. 651e51764aSArtem Bityutskiy * 661e51764aSArtem Bityutskiy * UBIFS uses padding when it pads to the next min. I/O unit. In this case it 671e51764aSArtem Bityutskiy * uses padding nodes or padding bytes, if the padding node does not fit. 681e51764aSArtem Bityutskiy * 696c7f74f7SArtem Bityutskiy * All UBIFS nodes are protected by CRC checksums and UBIFS checks CRC when 706c7f74f7SArtem Bityutskiy * they are read from the flash media. 711e51764aSArtem Bityutskiy */ 721e51764aSArtem Bityutskiy 731e51764aSArtem Bityutskiy #include <linux/crc32.h> 745a0e3ad6STejun Heo #include <linux/slab.h> 751e51764aSArtem Bityutskiy #include "ubifs.h" 761e51764aSArtem Bityutskiy 771e51764aSArtem Bityutskiy /** 78ff46d7b3SAdrian Hunter * ubifs_ro_mode - switch UBIFS to read read-only mode. 79ff46d7b3SAdrian Hunter * @c: UBIFS file-system description object 80ff46d7b3SAdrian Hunter * @err: error code which is the reason of switching to R/O mode 81ff46d7b3SAdrian Hunter */ 82ff46d7b3SAdrian Hunter void ubifs_ro_mode(struct ubifs_info *c, int err) 83ff46d7b3SAdrian Hunter { 842680d722SArtem Bityutskiy if (!c->ro_error) { 852680d722SArtem Bityutskiy c->ro_error = 1; 86ccb3eba7SArtem Bityutskiy c->no_chk_data_crc = 0; 871751e8a6SLinus Torvalds c->vfs_sb->s_flags |= SB_RDONLY; 88235c362bSSheng Yong ubifs_warn(c, "switched to read-only mode, error %d", err); 89d033c98bSArtem Bityutskiy dump_stack(); 90ff46d7b3SAdrian Hunter } 91ff46d7b3SAdrian Hunter } 92ff46d7b3SAdrian Hunter 9383cef708SArtem Bityutskiy /* 9483cef708SArtem Bityutskiy * Below are simple wrappers over UBI I/O functions which include some 9583cef708SArtem Bityutskiy * additional checks and UBIFS debugging stuff. See corresponding UBI function 9683cef708SArtem Bityutskiy * for more information. 9783cef708SArtem Bityutskiy */ 9883cef708SArtem Bityutskiy 9983cef708SArtem Bityutskiy int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, 10083cef708SArtem Bityutskiy int len, int even_ebadmsg) 10183cef708SArtem Bityutskiy { 10283cef708SArtem Bityutskiy int err; 10383cef708SArtem Bityutskiy 10483cef708SArtem Bityutskiy err = ubi_read(c->ubi, lnum, buf, offs, len); 10583cef708SArtem Bityutskiy /* 10683cef708SArtem Bityutskiy * In case of %-EBADMSG print the error message only if the 10783cef708SArtem Bityutskiy * @even_ebadmsg is true. 10883cef708SArtem Bityutskiy */ 10983cef708SArtem Bityutskiy if (err && (err != -EBADMSG || even_ebadmsg)) { 110235c362bSSheng Yong ubifs_err(c, "reading %d bytes from LEB %d:%d failed, error %d", 11183cef708SArtem Bityutskiy len, lnum, offs, err); 1127c46d0aeSArtem Bityutskiy dump_stack(); 11383cef708SArtem Bityutskiy } 11483cef708SArtem Bityutskiy return err; 11583cef708SArtem Bityutskiy } 11683cef708SArtem Bityutskiy 11783cef708SArtem Bityutskiy int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, 118b36a261eSRichard Weinberger int len) 11983cef708SArtem Bityutskiy { 12083cef708SArtem Bityutskiy int err; 12183cef708SArtem Bityutskiy 1226eb61d58SRichard Weinberger ubifs_assert(c, !c->ro_media && !c->ro_mount); 12383cef708SArtem Bityutskiy if (c->ro_error) 12483cef708SArtem Bityutskiy return -EROFS; 12583cef708SArtem Bityutskiy if (!dbg_is_tst_rcvry(c)) 126b36a261eSRichard Weinberger err = ubi_leb_write(c->ubi, lnum, buf, offs, len); 12783cef708SArtem Bityutskiy else 128b36a261eSRichard Weinberger err = dbg_leb_write(c, lnum, buf, offs, len); 12983cef708SArtem Bityutskiy if (err) { 130235c362bSSheng Yong ubifs_err(c, "writing %d bytes to LEB %d:%d failed, error %d", 13183cef708SArtem Bityutskiy len, lnum, offs, err); 13283cef708SArtem Bityutskiy ubifs_ro_mode(c, err); 1337c46d0aeSArtem Bityutskiy dump_stack(); 13483cef708SArtem Bityutskiy } 13583cef708SArtem Bityutskiy return err; 13683cef708SArtem Bityutskiy } 13783cef708SArtem Bityutskiy 138b36a261eSRichard Weinberger int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) 13983cef708SArtem Bityutskiy { 14083cef708SArtem Bityutskiy int err; 14183cef708SArtem Bityutskiy 1426eb61d58SRichard Weinberger ubifs_assert(c, !c->ro_media && !c->ro_mount); 14383cef708SArtem Bityutskiy if (c->ro_error) 14483cef708SArtem Bityutskiy return -EROFS; 14583cef708SArtem Bityutskiy if (!dbg_is_tst_rcvry(c)) 146b36a261eSRichard Weinberger err = ubi_leb_change(c->ubi, lnum, buf, len); 14783cef708SArtem Bityutskiy else 148b36a261eSRichard Weinberger err = dbg_leb_change(c, lnum, buf, len); 14983cef708SArtem Bityutskiy if (err) { 150235c362bSSheng Yong ubifs_err(c, "changing %d bytes in LEB %d failed, error %d", 15183cef708SArtem Bityutskiy len, lnum, err); 15283cef708SArtem Bityutskiy ubifs_ro_mode(c, err); 1537c46d0aeSArtem Bityutskiy dump_stack(); 15483cef708SArtem Bityutskiy } 15583cef708SArtem Bityutskiy return err; 15683cef708SArtem Bityutskiy } 15783cef708SArtem Bityutskiy 15883cef708SArtem Bityutskiy int ubifs_leb_unmap(struct ubifs_info *c, int lnum) 15983cef708SArtem Bityutskiy { 16083cef708SArtem Bityutskiy int err; 16183cef708SArtem Bityutskiy 1626eb61d58SRichard Weinberger ubifs_assert(c, !c->ro_media && !c->ro_mount); 16383cef708SArtem Bityutskiy if (c->ro_error) 16483cef708SArtem Bityutskiy return -EROFS; 16583cef708SArtem Bityutskiy if (!dbg_is_tst_rcvry(c)) 16683cef708SArtem Bityutskiy err = ubi_leb_unmap(c->ubi, lnum); 16783cef708SArtem Bityutskiy else 168f57cb188SArtem Bityutskiy err = dbg_leb_unmap(c, lnum); 16983cef708SArtem Bityutskiy if (err) { 170235c362bSSheng Yong ubifs_err(c, "unmap LEB %d failed, error %d", lnum, err); 17183cef708SArtem Bityutskiy ubifs_ro_mode(c, err); 1727c46d0aeSArtem Bityutskiy dump_stack(); 17383cef708SArtem Bityutskiy } 17483cef708SArtem Bityutskiy return err; 17583cef708SArtem Bityutskiy } 17683cef708SArtem Bityutskiy 177b36a261eSRichard Weinberger int ubifs_leb_map(struct ubifs_info *c, int lnum) 17883cef708SArtem Bityutskiy { 17983cef708SArtem Bityutskiy int err; 18083cef708SArtem Bityutskiy 1816eb61d58SRichard Weinberger ubifs_assert(c, !c->ro_media && !c->ro_mount); 18283cef708SArtem Bityutskiy if (c->ro_error) 18383cef708SArtem Bityutskiy return -EROFS; 18483cef708SArtem Bityutskiy if (!dbg_is_tst_rcvry(c)) 185b36a261eSRichard Weinberger err = ubi_leb_map(c->ubi, lnum); 18683cef708SArtem Bityutskiy else 187b36a261eSRichard Weinberger err = dbg_leb_map(c, lnum); 18883cef708SArtem Bityutskiy if (err) { 189235c362bSSheng Yong ubifs_err(c, "mapping LEB %d failed, error %d", lnum, err); 19083cef708SArtem Bityutskiy ubifs_ro_mode(c, err); 1917c46d0aeSArtem Bityutskiy dump_stack(); 19283cef708SArtem Bityutskiy } 19383cef708SArtem Bityutskiy return err; 19483cef708SArtem Bityutskiy } 19583cef708SArtem Bityutskiy 19683cef708SArtem Bityutskiy int ubifs_is_mapped(const struct ubifs_info *c, int lnum) 19783cef708SArtem Bityutskiy { 19883cef708SArtem Bityutskiy int err; 19983cef708SArtem Bityutskiy 20083cef708SArtem Bityutskiy err = ubi_is_mapped(c->ubi, lnum); 20183cef708SArtem Bityutskiy if (err < 0) { 202235c362bSSheng Yong ubifs_err(c, "ubi_is_mapped failed for LEB %d, error %d", 20383cef708SArtem Bityutskiy lnum, err); 2047c46d0aeSArtem Bityutskiy dump_stack(); 20583cef708SArtem Bityutskiy } 20683cef708SArtem Bityutskiy return err; 20783cef708SArtem Bityutskiy } 20883cef708SArtem Bityutskiy 209ff46d7b3SAdrian Hunter /** 2101e51764aSArtem Bityutskiy * ubifs_check_node - check node. 2111e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 2121e51764aSArtem Bityutskiy * @buf: node to check 2131e51764aSArtem Bityutskiy * @lnum: logical eraseblock number 2141e51764aSArtem Bityutskiy * @offs: offset within the logical eraseblock 2151e51764aSArtem Bityutskiy * @quiet: print no messages 2166f7ab6d4SArtem Bityutskiy * @must_chk_crc: indicates whether to always check the CRC 2171e51764aSArtem Bityutskiy * 2181e51764aSArtem Bityutskiy * This function checks node magic number and CRC checksum. This function also 2191e51764aSArtem Bityutskiy * validates node length to prevent UBIFS from becoming crazy when an attacker 2201e51764aSArtem Bityutskiy * feeds it a file-system image with incorrect nodes. For example, too large 2211e51764aSArtem Bityutskiy * node length in the common header could cause UBIFS to read memory outside of 2221e51764aSArtem Bityutskiy * allocated buffer when checking the CRC checksum. 2231e51764aSArtem Bityutskiy * 2246f7ab6d4SArtem Bityutskiy * This function may skip data nodes CRC checking if @c->no_chk_data_crc is 2256f7ab6d4SArtem Bityutskiy * true, which is controlled by corresponding UBIFS mount option. However, if 2266f7ab6d4SArtem Bityutskiy * @must_chk_crc is true, then @c->no_chk_data_crc is ignored and CRC is 22718d1d7fbSArtem Bityutskiy * checked. Similarly, if @c->mounting or @c->remounting_rw is true (we are 22818d1d7fbSArtem Bityutskiy * mounting or re-mounting to R/W mode), @c->no_chk_data_crc is ignored and CRC 22918d1d7fbSArtem Bityutskiy * is checked. This is because during mounting or re-mounting from R/O mode to 23018d1d7fbSArtem Bityutskiy * R/W mode we may read journal nodes (when replying the journal or doing the 23118d1d7fbSArtem Bityutskiy * recovery) and the journal nodes may potentially be corrupted, so checking is 23218d1d7fbSArtem Bityutskiy * required. 2336f7ab6d4SArtem Bityutskiy * 2346f7ab6d4SArtem Bityutskiy * This function returns zero in case of success and %-EUCLEAN in case of bad 2356f7ab6d4SArtem Bityutskiy * CRC or magic. 2361e51764aSArtem Bityutskiy */ 2371e51764aSArtem Bityutskiy int ubifs_check_node(const struct ubifs_info *c, const void *buf, int lnum, 2386f7ab6d4SArtem Bityutskiy int offs, int quiet, int must_chk_crc) 2391e51764aSArtem Bityutskiy { 2401e51764aSArtem Bityutskiy int err = -EINVAL, type, node_len; 2411e51764aSArtem Bityutskiy uint32_t crc, node_crc, magic; 2421e51764aSArtem Bityutskiy const struct ubifs_ch *ch = buf; 2431e51764aSArtem Bityutskiy 2446eb61d58SRichard Weinberger ubifs_assert(c, lnum >= 0 && lnum < c->leb_cnt && offs >= 0); 2456eb61d58SRichard Weinberger ubifs_assert(c, !(offs & 7) && offs < c->leb_size); 2461e51764aSArtem Bityutskiy 2471e51764aSArtem Bityutskiy magic = le32_to_cpu(ch->magic); 2481e51764aSArtem Bityutskiy if (magic != UBIFS_NODE_MAGIC) { 2491e51764aSArtem Bityutskiy if (!quiet) 250235c362bSSheng Yong ubifs_err(c, "bad magic %#08x, expected %#08x", 2511e51764aSArtem Bityutskiy magic, UBIFS_NODE_MAGIC); 2521e51764aSArtem Bityutskiy err = -EUCLEAN; 2531e51764aSArtem Bityutskiy goto out; 2541e51764aSArtem Bityutskiy } 2551e51764aSArtem Bityutskiy 2561e51764aSArtem Bityutskiy type = ch->node_type; 2571e51764aSArtem Bityutskiy if (type < 0 || type >= UBIFS_NODE_TYPES_CNT) { 2581e51764aSArtem Bityutskiy if (!quiet) 259235c362bSSheng Yong ubifs_err(c, "bad node type %d", type); 2601e51764aSArtem Bityutskiy goto out; 2611e51764aSArtem Bityutskiy } 2621e51764aSArtem Bityutskiy 2631e51764aSArtem Bityutskiy node_len = le32_to_cpu(ch->len); 2641e51764aSArtem Bityutskiy if (node_len + offs > c->leb_size) 2651e51764aSArtem Bityutskiy goto out_len; 2661e51764aSArtem Bityutskiy 2671e51764aSArtem Bityutskiy if (c->ranges[type].max_len == 0) { 2681e51764aSArtem Bityutskiy if (node_len != c->ranges[type].len) 2691e51764aSArtem Bityutskiy goto out_len; 2701e51764aSArtem Bityutskiy } else if (node_len < c->ranges[type].min_len || 2711e51764aSArtem Bityutskiy node_len > c->ranges[type].max_len) 2721e51764aSArtem Bityutskiy goto out_len; 2731e51764aSArtem Bityutskiy 27418d1d7fbSArtem Bityutskiy if (!must_chk_crc && type == UBIFS_DATA_NODE && !c->mounting && 27518d1d7fbSArtem Bityutskiy !c->remounting_rw && c->no_chk_data_crc) 2762953e73fSAdrian Hunter return 0; 2772953e73fSAdrian Hunter 2781e51764aSArtem Bityutskiy crc = crc32(UBIFS_CRC32_INIT, buf + 8, node_len - 8); 2791e51764aSArtem Bityutskiy node_crc = le32_to_cpu(ch->crc); 2801e51764aSArtem Bityutskiy if (crc != node_crc) { 2811e51764aSArtem Bityutskiy if (!quiet) 282235c362bSSheng Yong ubifs_err(c, "bad CRC: calculated %#08x, read %#08x", 2831e51764aSArtem Bityutskiy crc, node_crc); 2841e51764aSArtem Bityutskiy err = -EUCLEAN; 2851e51764aSArtem Bityutskiy goto out; 2861e51764aSArtem Bityutskiy } 2871e51764aSArtem Bityutskiy 2881e51764aSArtem Bityutskiy return 0; 2891e51764aSArtem Bityutskiy 2901e51764aSArtem Bityutskiy out_len: 2911e51764aSArtem Bityutskiy if (!quiet) 292235c362bSSheng Yong ubifs_err(c, "bad node length %d", node_len); 2931e51764aSArtem Bityutskiy out: 2941e51764aSArtem Bityutskiy if (!quiet) { 295235c362bSSheng Yong ubifs_err(c, "bad node at LEB %d:%d", lnum, offs); 296edf6be24SArtem Bityutskiy ubifs_dump_node(c, buf); 2977c46d0aeSArtem Bityutskiy dump_stack(); 2981e51764aSArtem Bityutskiy } 2991e51764aSArtem Bityutskiy return err; 3001e51764aSArtem Bityutskiy } 3011e51764aSArtem Bityutskiy 3021e51764aSArtem Bityutskiy /** 3031e51764aSArtem Bityutskiy * ubifs_pad - pad flash space. 3041e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 3051e51764aSArtem Bityutskiy * @buf: buffer to put padding to 3061e51764aSArtem Bityutskiy * @pad: how many bytes to pad 3071e51764aSArtem Bityutskiy * 3081e51764aSArtem Bityutskiy * The flash media obliges us to write only in chunks of %c->min_io_size and 3091e51764aSArtem Bityutskiy * when we have to write less data we add padding node to the write-buffer and 3101e51764aSArtem Bityutskiy * pad it to the next minimal I/O unit's boundary. Padding nodes help when the 3111e51764aSArtem Bityutskiy * media is being scanned. If the amount of wasted space is not enough to fit a 3121e51764aSArtem Bityutskiy * padding node which takes %UBIFS_PAD_NODE_SZ bytes, we write padding bytes 3131e51764aSArtem Bityutskiy * pattern (%UBIFS_PADDING_BYTE). 3141e51764aSArtem Bityutskiy * 3151e51764aSArtem Bityutskiy * Padding nodes are also used to fill gaps when the "commit-in-gaps" method is 3161e51764aSArtem Bityutskiy * used. 3171e51764aSArtem Bityutskiy */ 3181e51764aSArtem Bityutskiy void ubifs_pad(const struct ubifs_info *c, void *buf, int pad) 3191e51764aSArtem Bityutskiy { 3201e51764aSArtem Bityutskiy uint32_t crc; 3211e51764aSArtem Bityutskiy 3226eb61d58SRichard Weinberger ubifs_assert(c, pad >= 0 && !(pad & 7)); 3231e51764aSArtem Bityutskiy 3241e51764aSArtem Bityutskiy if (pad >= UBIFS_PAD_NODE_SZ) { 3251e51764aSArtem Bityutskiy struct ubifs_ch *ch = buf; 3261e51764aSArtem Bityutskiy struct ubifs_pad_node *pad_node = buf; 3271e51764aSArtem Bityutskiy 3281e51764aSArtem Bityutskiy ch->magic = cpu_to_le32(UBIFS_NODE_MAGIC); 3291e51764aSArtem Bityutskiy ch->node_type = UBIFS_PAD_NODE; 3301e51764aSArtem Bityutskiy ch->group_type = UBIFS_NO_NODE_GROUP; 3311e51764aSArtem Bityutskiy ch->padding[0] = ch->padding[1] = 0; 3321e51764aSArtem Bityutskiy ch->sqnum = 0; 3331e51764aSArtem Bityutskiy ch->len = cpu_to_le32(UBIFS_PAD_NODE_SZ); 3341e51764aSArtem Bityutskiy pad -= UBIFS_PAD_NODE_SZ; 3351e51764aSArtem Bityutskiy pad_node->pad_len = cpu_to_le32(pad); 3361e51764aSArtem Bityutskiy crc = crc32(UBIFS_CRC32_INIT, buf + 8, UBIFS_PAD_NODE_SZ - 8); 3371e51764aSArtem Bityutskiy ch->crc = cpu_to_le32(crc); 3381e51764aSArtem Bityutskiy memset(buf + UBIFS_PAD_NODE_SZ, 0, pad); 3391e51764aSArtem Bityutskiy } else if (pad > 0) 3401e51764aSArtem Bityutskiy /* Too little space, padding node won't fit */ 3411e51764aSArtem Bityutskiy memset(buf, UBIFS_PADDING_BYTE, pad); 3421e51764aSArtem Bityutskiy } 3431e51764aSArtem Bityutskiy 3441e51764aSArtem Bityutskiy /** 3451e51764aSArtem Bityutskiy * next_sqnum - get next sequence number. 3461e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 3471e51764aSArtem Bityutskiy */ 3481e51764aSArtem Bityutskiy static unsigned long long next_sqnum(struct ubifs_info *c) 3491e51764aSArtem Bityutskiy { 3501e51764aSArtem Bityutskiy unsigned long long sqnum; 3511e51764aSArtem Bityutskiy 3521e51764aSArtem Bityutskiy spin_lock(&c->cnt_lock); 3531e51764aSArtem Bityutskiy sqnum = ++c->max_sqnum; 3541e51764aSArtem Bityutskiy spin_unlock(&c->cnt_lock); 3551e51764aSArtem Bityutskiy 3561e51764aSArtem Bityutskiy if (unlikely(sqnum >= SQNUM_WARN_WATERMARK)) { 3571e51764aSArtem Bityutskiy if (sqnum >= SQNUM_WATERMARK) { 358235c362bSSheng Yong ubifs_err(c, "sequence number overflow %llu, end of life", 3591e51764aSArtem Bityutskiy sqnum); 3601e51764aSArtem Bityutskiy ubifs_ro_mode(c, -EINVAL); 3611e51764aSArtem Bityutskiy } 362235c362bSSheng Yong ubifs_warn(c, "running out of sequence numbers, end of life soon"); 3631e51764aSArtem Bityutskiy } 3641e51764aSArtem Bityutskiy 3651e51764aSArtem Bityutskiy return sqnum; 3661e51764aSArtem Bityutskiy } 3671e51764aSArtem Bityutskiy 3681e51764aSArtem Bityutskiy /** 3691e51764aSArtem Bityutskiy * ubifs_prepare_node - prepare node to be written to flash. 3701e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 3711e51764aSArtem Bityutskiy * @node: the node to pad 3721e51764aSArtem Bityutskiy * @len: node length 3731e51764aSArtem Bityutskiy * @pad: if the buffer has to be padded 3741e51764aSArtem Bityutskiy * 3751e51764aSArtem Bityutskiy * This function prepares node at @node to be written to the media - it 3761e51764aSArtem Bityutskiy * calculates node CRC, fills the common header, and adds proper padding up to 3771e51764aSArtem Bityutskiy * the next minimum I/O unit if @pad is not zero. 3781e51764aSArtem Bityutskiy */ 3791e51764aSArtem Bityutskiy void ubifs_prepare_node(struct ubifs_info *c, void *node, int len, int pad) 3801e51764aSArtem Bityutskiy { 3811e51764aSArtem Bityutskiy uint32_t crc; 3821e51764aSArtem Bityutskiy struct ubifs_ch *ch = node; 3831e51764aSArtem Bityutskiy unsigned long long sqnum = next_sqnum(c); 3841e51764aSArtem Bityutskiy 3856eb61d58SRichard Weinberger ubifs_assert(c, len >= UBIFS_CH_SZ); 3861e51764aSArtem Bityutskiy 3871e51764aSArtem Bityutskiy ch->magic = cpu_to_le32(UBIFS_NODE_MAGIC); 3881e51764aSArtem Bityutskiy ch->len = cpu_to_le32(len); 3891e51764aSArtem Bityutskiy ch->group_type = UBIFS_NO_NODE_GROUP; 3901e51764aSArtem Bityutskiy ch->sqnum = cpu_to_le64(sqnum); 3911e51764aSArtem Bityutskiy ch->padding[0] = ch->padding[1] = 0; 3921e51764aSArtem Bityutskiy crc = crc32(UBIFS_CRC32_INIT, node + 8, len - 8); 3931e51764aSArtem Bityutskiy ch->crc = cpu_to_le32(crc); 3941e51764aSArtem Bityutskiy 3951e51764aSArtem Bityutskiy if (pad) { 3961e51764aSArtem Bityutskiy len = ALIGN(len, 8); 3971e51764aSArtem Bityutskiy pad = ALIGN(len, c->min_io_size) - len; 3981e51764aSArtem Bityutskiy ubifs_pad(c, node + len, pad); 3991e51764aSArtem Bityutskiy } 4001e51764aSArtem Bityutskiy } 4011e51764aSArtem Bityutskiy 4021e51764aSArtem Bityutskiy /** 4031e51764aSArtem Bityutskiy * ubifs_prep_grp_node - prepare node of a group to be written to flash. 4041e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 4051e51764aSArtem Bityutskiy * @node: the node to pad 4061e51764aSArtem Bityutskiy * @len: node length 4071e51764aSArtem Bityutskiy * @last: indicates the last node of the group 4081e51764aSArtem Bityutskiy * 4091e51764aSArtem Bityutskiy * This function prepares node at @node to be written to the media - it 4101e51764aSArtem Bityutskiy * calculates node CRC and fills the common header. 4111e51764aSArtem Bityutskiy */ 4121e51764aSArtem Bityutskiy void ubifs_prep_grp_node(struct ubifs_info *c, void *node, int len, int last) 4131e51764aSArtem Bityutskiy { 4141e51764aSArtem Bityutskiy uint32_t crc; 4151e51764aSArtem Bityutskiy struct ubifs_ch *ch = node; 4161e51764aSArtem Bityutskiy unsigned long long sqnum = next_sqnum(c); 4171e51764aSArtem Bityutskiy 4186eb61d58SRichard Weinberger ubifs_assert(c, len >= UBIFS_CH_SZ); 4191e51764aSArtem Bityutskiy 4201e51764aSArtem Bityutskiy ch->magic = cpu_to_le32(UBIFS_NODE_MAGIC); 4211e51764aSArtem Bityutskiy ch->len = cpu_to_le32(len); 4221e51764aSArtem Bityutskiy if (last) 4231e51764aSArtem Bityutskiy ch->group_type = UBIFS_LAST_OF_NODE_GROUP; 4241e51764aSArtem Bityutskiy else 4251e51764aSArtem Bityutskiy ch->group_type = UBIFS_IN_NODE_GROUP; 4261e51764aSArtem Bityutskiy ch->sqnum = cpu_to_le64(sqnum); 4271e51764aSArtem Bityutskiy ch->padding[0] = ch->padding[1] = 0; 4281e51764aSArtem Bityutskiy crc = crc32(UBIFS_CRC32_INIT, node + 8, len - 8); 4291e51764aSArtem Bityutskiy ch->crc = cpu_to_le32(crc); 4301e51764aSArtem Bityutskiy } 4311e51764aSArtem Bityutskiy 4321e51764aSArtem Bityutskiy /** 4331e51764aSArtem Bityutskiy * wbuf_timer_callback - write-buffer timer callback function. 43439274a1eSFabian Frederick * @timer: timer data (write-buffer descriptor) 4351e51764aSArtem Bityutskiy * 4361e51764aSArtem Bityutskiy * This function is called when the write-buffer timer expires. 4371e51764aSArtem Bityutskiy */ 438f2c5dbd7SArtem Bityutskiy static enum hrtimer_restart wbuf_timer_callback_nolock(struct hrtimer *timer) 4391e51764aSArtem Bityutskiy { 440f2c5dbd7SArtem Bityutskiy struct ubifs_wbuf *wbuf = container_of(timer, struct ubifs_wbuf, timer); 4411e51764aSArtem Bityutskiy 44277a7ae58SArtem Bityutskiy dbg_io("jhead %s", dbg_jhead(wbuf->jhead)); 4431e51764aSArtem Bityutskiy wbuf->need_sync = 1; 4441e51764aSArtem Bityutskiy wbuf->c->need_wbuf_sync = 1; 4451e51764aSArtem Bityutskiy ubifs_wake_up_bgt(wbuf->c); 446f2c5dbd7SArtem Bityutskiy return HRTIMER_NORESTART; 4471e51764aSArtem Bityutskiy } 4481e51764aSArtem Bityutskiy 4491e51764aSArtem Bityutskiy /** 4501e51764aSArtem Bityutskiy * new_wbuf_timer - start new write-buffer timer. 4516eb61d58SRichard Weinberger * @c: UBIFS file-system description object 4521e51764aSArtem Bityutskiy * @wbuf: write-buffer descriptor 4531e51764aSArtem Bityutskiy */ 4546eb61d58SRichard Weinberger static void new_wbuf_timer_nolock(struct ubifs_info *c, struct ubifs_wbuf *wbuf) 4551e51764aSArtem Bityutskiy { 4561b7fc2c0SRafał Miłecki ktime_t softlimit = ms_to_ktime(dirty_writeback_interval * 10); 4571b7fc2c0SRafał Miłecki unsigned long long delta = dirty_writeback_interval; 458854826c9SRafał Miłecki 4591b7fc2c0SRafał Miłecki /* centi to milli, milli to nano, then 10% */ 4601b7fc2c0SRafał Miłecki delta *= 10ULL * NSEC_PER_MSEC / 10ULL; 461854826c9SRafał Miłecki 4626eb61d58SRichard Weinberger ubifs_assert(c, !hrtimer_active(&wbuf->timer)); 4636eb61d58SRichard Weinberger ubifs_assert(c, delta <= ULONG_MAX); 4641e51764aSArtem Bityutskiy 4650b335b9dSArtem Bityutskiy if (wbuf->no_timer) 4661e51764aSArtem Bityutskiy return; 46777a7ae58SArtem Bityutskiy dbg_io("set timer for jhead %s, %llu-%llu millisecs", 46877a7ae58SArtem Bityutskiy dbg_jhead(wbuf->jhead), 469854826c9SRafał Miłecki div_u64(ktime_to_ns(softlimit), USEC_PER_SEC), 470854826c9SRafał Miłecki div_u64(ktime_to_ns(softlimit) + delta, USEC_PER_SEC)); 471854826c9SRafał Miłecki hrtimer_start_range_ns(&wbuf->timer, softlimit, delta, 472f2c5dbd7SArtem Bityutskiy HRTIMER_MODE_REL); 4731e51764aSArtem Bityutskiy } 4741e51764aSArtem Bityutskiy 4751e51764aSArtem Bityutskiy /** 4761e51764aSArtem Bityutskiy * cancel_wbuf_timer - cancel write-buffer timer. 4771e51764aSArtem Bityutskiy * @wbuf: write-buffer descriptor 4781e51764aSArtem Bityutskiy */ 4791e51764aSArtem Bityutskiy static void cancel_wbuf_timer_nolock(struct ubifs_wbuf *wbuf) 4801e51764aSArtem Bityutskiy { 4810b335b9dSArtem Bityutskiy if (wbuf->no_timer) 4820b335b9dSArtem Bityutskiy return; 4831e51764aSArtem Bityutskiy wbuf->need_sync = 0; 484f2c5dbd7SArtem Bityutskiy hrtimer_cancel(&wbuf->timer); 4851e51764aSArtem Bityutskiy } 4861e51764aSArtem Bityutskiy 4871e51764aSArtem Bityutskiy /** 4881e51764aSArtem Bityutskiy * ubifs_wbuf_sync_nolock - synchronize write-buffer. 4891e51764aSArtem Bityutskiy * @wbuf: write-buffer to synchronize 4901e51764aSArtem Bityutskiy * 4911e51764aSArtem Bityutskiy * This function synchronizes write-buffer @buf and returns zero in case of 4921e51764aSArtem Bityutskiy * success or a negative error code in case of failure. 4936c7f74f7SArtem Bityutskiy * 4946c7f74f7SArtem Bityutskiy * Note, although write-buffers are of @c->max_write_size, this function does 4956c7f74f7SArtem Bityutskiy * not necessarily writes all @c->max_write_size bytes to the flash. Instead, 4966c7f74f7SArtem Bityutskiy * if the write-buffer is only partially filled with data, only the used part 4976c7f74f7SArtem Bityutskiy * of the write-buffer (aligned on @c->min_io_size boundary) is synchronized. 4986c7f74f7SArtem Bityutskiy * This way we waste less space. 4991e51764aSArtem Bityutskiy */ 5001e51764aSArtem Bityutskiy int ubifs_wbuf_sync_nolock(struct ubifs_wbuf *wbuf) 5011e51764aSArtem Bityutskiy { 5021e51764aSArtem Bityutskiy struct ubifs_info *c = wbuf->c; 5036c7f74f7SArtem Bityutskiy int err, dirt, sync_len; 5041e51764aSArtem Bityutskiy 5051e51764aSArtem Bityutskiy cancel_wbuf_timer_nolock(wbuf); 5061e51764aSArtem Bityutskiy if (!wbuf->used || wbuf->lnum == -1) 5071e51764aSArtem Bityutskiy /* Write-buffer is empty or not seeked */ 5081e51764aSArtem Bityutskiy return 0; 5091e51764aSArtem Bityutskiy 51077a7ae58SArtem Bityutskiy dbg_io("LEB %d:%d, %d bytes, jhead %s", 51177a7ae58SArtem Bityutskiy wbuf->lnum, wbuf->offs, wbuf->used, dbg_jhead(wbuf->jhead)); 5126eb61d58SRichard Weinberger ubifs_assert(c, !(wbuf->avail & 7)); 5136eb61d58SRichard Weinberger ubifs_assert(c, wbuf->offs + wbuf->size <= c->leb_size); 5146eb61d58SRichard Weinberger ubifs_assert(c, wbuf->size >= c->min_io_size); 5156eb61d58SRichard Weinberger ubifs_assert(c, wbuf->size <= c->max_write_size); 5166eb61d58SRichard Weinberger ubifs_assert(c, wbuf->size % c->min_io_size == 0); 5176eb61d58SRichard Weinberger ubifs_assert(c, !c->ro_media && !c->ro_mount); 5186c7f74f7SArtem Bityutskiy if (c->leb_size - wbuf->offs >= c->max_write_size) 5196eb61d58SRichard Weinberger ubifs_assert(c, !((wbuf->offs + wbuf->size) % c->max_write_size)); 5201e51764aSArtem Bityutskiy 5212680d722SArtem Bityutskiy if (c->ro_error) 5221e51764aSArtem Bityutskiy return -EROFS; 5231e51764aSArtem Bityutskiy 5246c7f74f7SArtem Bityutskiy /* 5256c7f74f7SArtem Bityutskiy * Do not write whole write buffer but write only the minimum necessary 5266c7f74f7SArtem Bityutskiy * amount of min. I/O units. 5276c7f74f7SArtem Bityutskiy */ 5286c7f74f7SArtem Bityutskiy sync_len = ALIGN(wbuf->used, c->min_io_size); 5296c7f74f7SArtem Bityutskiy dirt = sync_len - wbuf->used; 5306c7f74f7SArtem Bityutskiy if (dirt) 5316c7f74f7SArtem Bityutskiy ubifs_pad(c, wbuf->buf + wbuf->used, dirt); 532b36a261eSRichard Weinberger err = ubifs_leb_write(c, wbuf->lnum, wbuf->buf, wbuf->offs, sync_len); 533987226a5SArtem Bityutskiy if (err) 5341e51764aSArtem Bityutskiy return err; 5351e51764aSArtem Bityutskiy 5361e51764aSArtem Bityutskiy spin_lock(&wbuf->lock); 5376c7f74f7SArtem Bityutskiy wbuf->offs += sync_len; 5386c7f74f7SArtem Bityutskiy /* 5396c7f74f7SArtem Bityutskiy * Now @wbuf->offs is not necessarily aligned to @c->max_write_size. 5406c7f74f7SArtem Bityutskiy * But our goal is to optimize writes and make sure we write in 5416c7f74f7SArtem Bityutskiy * @c->max_write_size chunks and to @c->max_write_size-aligned offset. 5426c7f74f7SArtem Bityutskiy * Thus, if @wbuf->offs is not aligned to @c->max_write_size now, make 5436c7f74f7SArtem Bityutskiy * sure that @wbuf->offs + @wbuf->size is aligned to 5446c7f74f7SArtem Bityutskiy * @c->max_write_size. This way we make sure that after next 5456c7f74f7SArtem Bityutskiy * write-buffer flush we are again at the optimal offset (aligned to 5466c7f74f7SArtem Bityutskiy * @c->max_write_size). 5476c7f74f7SArtem Bityutskiy */ 5486c7f74f7SArtem Bityutskiy if (c->leb_size - wbuf->offs < c->max_write_size) 5496c7f74f7SArtem Bityutskiy wbuf->size = c->leb_size - wbuf->offs; 5506c7f74f7SArtem Bityutskiy else if (wbuf->offs & (c->max_write_size - 1)) 5516c7f74f7SArtem Bityutskiy wbuf->size = ALIGN(wbuf->offs, c->max_write_size) - wbuf->offs; 5526c7f74f7SArtem Bityutskiy else 5536c7f74f7SArtem Bityutskiy wbuf->size = c->max_write_size; 5546c7f74f7SArtem Bityutskiy wbuf->avail = wbuf->size; 5551e51764aSArtem Bityutskiy wbuf->used = 0; 5561e51764aSArtem Bityutskiy wbuf->next_ino = 0; 5571e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 5581e51764aSArtem Bityutskiy 5591e51764aSArtem Bityutskiy if (wbuf->sync_callback) 5601e51764aSArtem Bityutskiy err = wbuf->sync_callback(c, wbuf->lnum, 5611e51764aSArtem Bityutskiy c->leb_size - wbuf->offs, dirt); 5621e51764aSArtem Bityutskiy return err; 5631e51764aSArtem Bityutskiy } 5641e51764aSArtem Bityutskiy 5651e51764aSArtem Bityutskiy /** 5661e51764aSArtem Bityutskiy * ubifs_wbuf_seek_nolock - seek write-buffer. 5671e51764aSArtem Bityutskiy * @wbuf: write-buffer 5681e51764aSArtem Bityutskiy * @lnum: logical eraseblock number to seek to 5691e51764aSArtem Bityutskiy * @offs: logical eraseblock offset to seek to 5701e51764aSArtem Bityutskiy * 571cb54ef8bSArtem Bityutskiy * This function targets the write-buffer to logical eraseblock @lnum:@offs. 572cb14a184SArtem Bityutskiy * The write-buffer has to be empty. Returns zero in case of success and a 573cb14a184SArtem Bityutskiy * negative error code in case of failure. 5741e51764aSArtem Bityutskiy */ 575b36a261eSRichard Weinberger int ubifs_wbuf_seek_nolock(struct ubifs_wbuf *wbuf, int lnum, int offs) 5761e51764aSArtem Bityutskiy { 5771e51764aSArtem Bityutskiy const struct ubifs_info *c = wbuf->c; 5781e51764aSArtem Bityutskiy 57977a7ae58SArtem Bityutskiy dbg_io("LEB %d:%d, jhead %s", lnum, offs, dbg_jhead(wbuf->jhead)); 5806eb61d58SRichard Weinberger ubifs_assert(c, lnum >= 0 && lnum < c->leb_cnt); 5816eb61d58SRichard Weinberger ubifs_assert(c, offs >= 0 && offs <= c->leb_size); 5826eb61d58SRichard Weinberger ubifs_assert(c, offs % c->min_io_size == 0 && !(offs & 7)); 5836eb61d58SRichard Weinberger ubifs_assert(c, lnum != wbuf->lnum); 5846eb61d58SRichard Weinberger ubifs_assert(c, wbuf->used == 0); 5851e51764aSArtem Bityutskiy 5861e51764aSArtem Bityutskiy spin_lock(&wbuf->lock); 5871e51764aSArtem Bityutskiy wbuf->lnum = lnum; 5881e51764aSArtem Bityutskiy wbuf->offs = offs; 5896c7f74f7SArtem Bityutskiy if (c->leb_size - wbuf->offs < c->max_write_size) 5906c7f74f7SArtem Bityutskiy wbuf->size = c->leb_size - wbuf->offs; 5916c7f74f7SArtem Bityutskiy else if (wbuf->offs & (c->max_write_size - 1)) 5926c7f74f7SArtem Bityutskiy wbuf->size = ALIGN(wbuf->offs, c->max_write_size) - wbuf->offs; 5936c7f74f7SArtem Bityutskiy else 5946c7f74f7SArtem Bityutskiy wbuf->size = c->max_write_size; 5956c7f74f7SArtem Bityutskiy wbuf->avail = wbuf->size; 5961e51764aSArtem Bityutskiy wbuf->used = 0; 5971e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 5981e51764aSArtem Bityutskiy 5991e51764aSArtem Bityutskiy return 0; 6001e51764aSArtem Bityutskiy } 6011e51764aSArtem Bityutskiy 6021e51764aSArtem Bityutskiy /** 6031e51764aSArtem Bityutskiy * ubifs_bg_wbufs_sync - synchronize write-buffers. 6041e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 6051e51764aSArtem Bityutskiy * 6061e51764aSArtem Bityutskiy * This function is called by background thread to synchronize write-buffers. 6071e51764aSArtem Bityutskiy * Returns zero in case of success and a negative error code in case of 6081e51764aSArtem Bityutskiy * failure. 6091e51764aSArtem Bityutskiy */ 6101e51764aSArtem Bityutskiy int ubifs_bg_wbufs_sync(struct ubifs_info *c) 6111e51764aSArtem Bityutskiy { 6121e51764aSArtem Bityutskiy int err, i; 6131e51764aSArtem Bityutskiy 6146eb61d58SRichard Weinberger ubifs_assert(c, !c->ro_media && !c->ro_mount); 6151e51764aSArtem Bityutskiy if (!c->need_wbuf_sync) 6161e51764aSArtem Bityutskiy return 0; 6171e51764aSArtem Bityutskiy c->need_wbuf_sync = 0; 6181e51764aSArtem Bityutskiy 6192680d722SArtem Bityutskiy if (c->ro_error) { 6201e51764aSArtem Bityutskiy err = -EROFS; 6211e51764aSArtem Bityutskiy goto out_timers; 6221e51764aSArtem Bityutskiy } 6231e51764aSArtem Bityutskiy 6241e51764aSArtem Bityutskiy dbg_io("synchronize"); 6251e51764aSArtem Bityutskiy for (i = 0; i < c->jhead_cnt; i++) { 6261e51764aSArtem Bityutskiy struct ubifs_wbuf *wbuf = &c->jheads[i].wbuf; 6271e51764aSArtem Bityutskiy 6281e51764aSArtem Bityutskiy cond_resched(); 6291e51764aSArtem Bityutskiy 6301e51764aSArtem Bityutskiy /* 6311e51764aSArtem Bityutskiy * If the mutex is locked then wbuf is being changed, so 6321e51764aSArtem Bityutskiy * synchronization is not necessary. 6331e51764aSArtem Bityutskiy */ 6341e51764aSArtem Bityutskiy if (mutex_is_locked(&wbuf->io_mutex)) 6351e51764aSArtem Bityutskiy continue; 6361e51764aSArtem Bityutskiy 6371e51764aSArtem Bityutskiy mutex_lock_nested(&wbuf->io_mutex, wbuf->jhead); 6381e51764aSArtem Bityutskiy if (!wbuf->need_sync) { 6391e51764aSArtem Bityutskiy mutex_unlock(&wbuf->io_mutex); 6401e51764aSArtem Bityutskiy continue; 6411e51764aSArtem Bityutskiy } 6421e51764aSArtem Bityutskiy 6431e51764aSArtem Bityutskiy err = ubifs_wbuf_sync_nolock(wbuf); 6441e51764aSArtem Bityutskiy mutex_unlock(&wbuf->io_mutex); 6451e51764aSArtem Bityutskiy if (err) { 646235c362bSSheng Yong ubifs_err(c, "cannot sync write-buffer, error %d", err); 6471e51764aSArtem Bityutskiy ubifs_ro_mode(c, err); 6481e51764aSArtem Bityutskiy goto out_timers; 6491e51764aSArtem Bityutskiy } 6501e51764aSArtem Bityutskiy } 6511e51764aSArtem Bityutskiy 6521e51764aSArtem Bityutskiy return 0; 6531e51764aSArtem Bityutskiy 6541e51764aSArtem Bityutskiy out_timers: 6551e51764aSArtem Bityutskiy /* Cancel all timers to prevent repeated errors */ 6561e51764aSArtem Bityutskiy for (i = 0; i < c->jhead_cnt; i++) { 6571e51764aSArtem Bityutskiy struct ubifs_wbuf *wbuf = &c->jheads[i].wbuf; 6581e51764aSArtem Bityutskiy 6591e51764aSArtem Bityutskiy mutex_lock_nested(&wbuf->io_mutex, wbuf->jhead); 6601e51764aSArtem Bityutskiy cancel_wbuf_timer_nolock(wbuf); 6611e51764aSArtem Bityutskiy mutex_unlock(&wbuf->io_mutex); 6621e51764aSArtem Bityutskiy } 6631e51764aSArtem Bityutskiy return err; 6641e51764aSArtem Bityutskiy } 6651e51764aSArtem Bityutskiy 6661e51764aSArtem Bityutskiy /** 6671e51764aSArtem Bityutskiy * ubifs_wbuf_write_nolock - write data to flash via write-buffer. 6681e51764aSArtem Bityutskiy * @wbuf: write-buffer 6691e51764aSArtem Bityutskiy * @buf: node to write 6701e51764aSArtem Bityutskiy * @len: node length 6711e51764aSArtem Bityutskiy * 6721e51764aSArtem Bityutskiy * This function writes data to flash via write-buffer @wbuf. This means that 6731e51764aSArtem Bityutskiy * the last piece of the node won't reach the flash media immediately if it 6746c7f74f7SArtem Bityutskiy * does not take whole max. write unit (@c->max_write_size). Instead, the node 6756c7f74f7SArtem Bityutskiy * will sit in RAM until the write-buffer is synchronized (e.g., by timer, or 6766c7f74f7SArtem Bityutskiy * because more data are appended to the write-buffer). 6771e51764aSArtem Bityutskiy * 6781e51764aSArtem Bityutskiy * This function returns zero in case of success and a negative error code in 6791e51764aSArtem Bityutskiy * case of failure. If the node cannot be written because there is no more 6801e51764aSArtem Bityutskiy * space in this logical eraseblock, %-ENOSPC is returned. 6811e51764aSArtem Bityutskiy */ 6821e51764aSArtem Bityutskiy int ubifs_wbuf_write_nolock(struct ubifs_wbuf *wbuf, void *buf, int len) 6831e51764aSArtem Bityutskiy { 6841e51764aSArtem Bityutskiy struct ubifs_info *c = wbuf->c; 68512f33891SArtem Bityutskiy int err, written, n, aligned_len = ALIGN(len, 8); 6861e51764aSArtem Bityutskiy 68777a7ae58SArtem Bityutskiy dbg_io("%d bytes (%s) to jhead %s wbuf at LEB %d:%d", len, 68877a7ae58SArtem Bityutskiy dbg_ntype(((struct ubifs_ch *)buf)->node_type), 68977a7ae58SArtem Bityutskiy dbg_jhead(wbuf->jhead), wbuf->lnum, wbuf->offs + wbuf->used); 6906eb61d58SRichard Weinberger ubifs_assert(c, len > 0 && wbuf->lnum >= 0 && wbuf->lnum < c->leb_cnt); 6916eb61d58SRichard Weinberger ubifs_assert(c, wbuf->offs >= 0 && wbuf->offs % c->min_io_size == 0); 6926eb61d58SRichard Weinberger ubifs_assert(c, !(wbuf->offs & 7) && wbuf->offs <= c->leb_size); 6936eb61d58SRichard Weinberger ubifs_assert(c, wbuf->avail > 0 && wbuf->avail <= wbuf->size); 6946eb61d58SRichard Weinberger ubifs_assert(c, wbuf->size >= c->min_io_size); 6956eb61d58SRichard Weinberger ubifs_assert(c, wbuf->size <= c->max_write_size); 6966eb61d58SRichard Weinberger ubifs_assert(c, wbuf->size % c->min_io_size == 0); 6976eb61d58SRichard Weinberger ubifs_assert(c, mutex_is_locked(&wbuf->io_mutex)); 6986eb61d58SRichard Weinberger ubifs_assert(c, !c->ro_media && !c->ro_mount); 6996eb61d58SRichard Weinberger ubifs_assert(c, !c->space_fixup); 7006c7f74f7SArtem Bityutskiy if (c->leb_size - wbuf->offs >= c->max_write_size) 7016eb61d58SRichard Weinberger ubifs_assert(c, !((wbuf->offs + wbuf->size) % c->max_write_size)); 7021e51764aSArtem Bityutskiy 7031e51764aSArtem Bityutskiy if (c->leb_size - wbuf->offs - wbuf->used < aligned_len) { 7041e51764aSArtem Bityutskiy err = -ENOSPC; 7051e51764aSArtem Bityutskiy goto out; 7061e51764aSArtem Bityutskiy } 7071e51764aSArtem Bityutskiy 7081e51764aSArtem Bityutskiy cancel_wbuf_timer_nolock(wbuf); 7091e51764aSArtem Bityutskiy 7102680d722SArtem Bityutskiy if (c->ro_error) 7111e51764aSArtem Bityutskiy return -EROFS; 7121e51764aSArtem Bityutskiy 7131e51764aSArtem Bityutskiy if (aligned_len <= wbuf->avail) { 7141e51764aSArtem Bityutskiy /* 7151e51764aSArtem Bityutskiy * The node is not very large and fits entirely within 7161e51764aSArtem Bityutskiy * write-buffer. 7171e51764aSArtem Bityutskiy */ 7181e51764aSArtem Bityutskiy memcpy(wbuf->buf + wbuf->used, buf, len); 7191e51764aSArtem Bityutskiy 7201e51764aSArtem Bityutskiy if (aligned_len == wbuf->avail) { 72177a7ae58SArtem Bityutskiy dbg_io("flush jhead %s wbuf to LEB %d:%d", 72277a7ae58SArtem Bityutskiy dbg_jhead(wbuf->jhead), wbuf->lnum, wbuf->offs); 723987226a5SArtem Bityutskiy err = ubifs_leb_write(c, wbuf->lnum, wbuf->buf, 724b36a261eSRichard Weinberger wbuf->offs, wbuf->size); 7251e51764aSArtem Bityutskiy if (err) 7261e51764aSArtem Bityutskiy goto out; 7271e51764aSArtem Bityutskiy 7281e51764aSArtem Bityutskiy spin_lock(&wbuf->lock); 7296c7f74f7SArtem Bityutskiy wbuf->offs += wbuf->size; 7306c7f74f7SArtem Bityutskiy if (c->leb_size - wbuf->offs >= c->max_write_size) 7316c7f74f7SArtem Bityutskiy wbuf->size = c->max_write_size; 7326c7f74f7SArtem Bityutskiy else 7336c7f74f7SArtem Bityutskiy wbuf->size = c->leb_size - wbuf->offs; 7346c7f74f7SArtem Bityutskiy wbuf->avail = wbuf->size; 7351e51764aSArtem Bityutskiy wbuf->used = 0; 7361e51764aSArtem Bityutskiy wbuf->next_ino = 0; 7371e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 7381e51764aSArtem Bityutskiy } else { 7391e51764aSArtem Bityutskiy spin_lock(&wbuf->lock); 7401e51764aSArtem Bityutskiy wbuf->avail -= aligned_len; 7411e51764aSArtem Bityutskiy wbuf->used += aligned_len; 7421e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 7431e51764aSArtem Bityutskiy } 7441e51764aSArtem Bityutskiy 7451e51764aSArtem Bityutskiy goto exit; 7461e51764aSArtem Bityutskiy } 7471e51764aSArtem Bityutskiy 7486c7f74f7SArtem Bityutskiy written = 0; 7496c7f74f7SArtem Bityutskiy 7506c7f74f7SArtem Bityutskiy if (wbuf->used) { 7511e51764aSArtem Bityutskiy /* 7526c7f74f7SArtem Bityutskiy * The node is large enough and does not fit entirely within 7536c7f74f7SArtem Bityutskiy * current available space. We have to fill and flush 7546c7f74f7SArtem Bityutskiy * write-buffer and switch to the next max. write unit. 7551e51764aSArtem Bityutskiy */ 75677a7ae58SArtem Bityutskiy dbg_io("flush jhead %s wbuf to LEB %d:%d", 75777a7ae58SArtem Bityutskiy dbg_jhead(wbuf->jhead), wbuf->lnum, wbuf->offs); 7581e51764aSArtem Bityutskiy memcpy(wbuf->buf + wbuf->used, buf, wbuf->avail); 759987226a5SArtem Bityutskiy err = ubifs_leb_write(c, wbuf->lnum, wbuf->buf, wbuf->offs, 760b36a261eSRichard Weinberger wbuf->size); 7611e51764aSArtem Bityutskiy if (err) 7621e51764aSArtem Bityutskiy goto out; 7631e51764aSArtem Bityutskiy 76412f33891SArtem Bityutskiy wbuf->offs += wbuf->size; 7651e51764aSArtem Bityutskiy len -= wbuf->avail; 7661e51764aSArtem Bityutskiy aligned_len -= wbuf->avail; 7676c7f74f7SArtem Bityutskiy written += wbuf->avail; 7686c7f74f7SArtem Bityutskiy } else if (wbuf->offs & (c->max_write_size - 1)) { 7696c7f74f7SArtem Bityutskiy /* 7706c7f74f7SArtem Bityutskiy * The write-buffer offset is not aligned to 7716c7f74f7SArtem Bityutskiy * @c->max_write_size and @wbuf->size is less than 7726c7f74f7SArtem Bityutskiy * @c->max_write_size. Write @wbuf->size bytes to make sure the 7736c7f74f7SArtem Bityutskiy * following writes are done in optimal @c->max_write_size 7746c7f74f7SArtem Bityutskiy * chunks. 7756c7f74f7SArtem Bityutskiy */ 7766c7f74f7SArtem Bityutskiy dbg_io("write %d bytes to LEB %d:%d", 7776c7f74f7SArtem Bityutskiy wbuf->size, wbuf->lnum, wbuf->offs); 778987226a5SArtem Bityutskiy err = ubifs_leb_write(c, wbuf->lnum, buf, wbuf->offs, 779b36a261eSRichard Weinberger wbuf->size); 7806c7f74f7SArtem Bityutskiy if (err) 7816c7f74f7SArtem Bityutskiy goto out; 7826c7f74f7SArtem Bityutskiy 78312f33891SArtem Bityutskiy wbuf->offs += wbuf->size; 7846c7f74f7SArtem Bityutskiy len -= wbuf->size; 7856c7f74f7SArtem Bityutskiy aligned_len -= wbuf->size; 7866c7f74f7SArtem Bityutskiy written += wbuf->size; 7876c7f74f7SArtem Bityutskiy } 7881e51764aSArtem Bityutskiy 7891e51764aSArtem Bityutskiy /* 7906c7f74f7SArtem Bityutskiy * The remaining data may take more whole max. write units, so write the 7916c7f74f7SArtem Bityutskiy * remains multiple to max. write unit size directly to the flash media. 7921e51764aSArtem Bityutskiy * We align node length to 8-byte boundary because we anyway flash wbuf 7931e51764aSArtem Bityutskiy * if the remaining space is less than 8 bytes. 7941e51764aSArtem Bityutskiy */ 7956c7f74f7SArtem Bityutskiy n = aligned_len >> c->max_write_shift; 7961e51764aSArtem Bityutskiy if (n) { 7976c7f74f7SArtem Bityutskiy n <<= c->max_write_shift; 79812f33891SArtem Bityutskiy dbg_io("write %d bytes to LEB %d:%d", n, wbuf->lnum, 79912f33891SArtem Bityutskiy wbuf->offs); 800987226a5SArtem Bityutskiy err = ubifs_leb_write(c, wbuf->lnum, buf + written, 801b36a261eSRichard Weinberger wbuf->offs, n); 8021e51764aSArtem Bityutskiy if (err) 8031e51764aSArtem Bityutskiy goto out; 80412f33891SArtem Bityutskiy wbuf->offs += n; 8051e51764aSArtem Bityutskiy aligned_len -= n; 8061e51764aSArtem Bityutskiy len -= n; 8071e51764aSArtem Bityutskiy written += n; 8081e51764aSArtem Bityutskiy } 8091e51764aSArtem Bityutskiy 8101e51764aSArtem Bityutskiy spin_lock(&wbuf->lock); 8111e51764aSArtem Bityutskiy if (aligned_len) 8121e51764aSArtem Bityutskiy /* 8131e51764aSArtem Bityutskiy * And now we have what's left and what does not take whole 8146c7f74f7SArtem Bityutskiy * max. write unit, so write it to the write-buffer and we are 8151e51764aSArtem Bityutskiy * done. 8161e51764aSArtem Bityutskiy */ 8171e51764aSArtem Bityutskiy memcpy(wbuf->buf, buf + written, len); 8181e51764aSArtem Bityutskiy 8196c7f74f7SArtem Bityutskiy if (c->leb_size - wbuf->offs >= c->max_write_size) 8206c7f74f7SArtem Bityutskiy wbuf->size = c->max_write_size; 8216c7f74f7SArtem Bityutskiy else 8226c7f74f7SArtem Bityutskiy wbuf->size = c->leb_size - wbuf->offs; 8236c7f74f7SArtem Bityutskiy wbuf->avail = wbuf->size - aligned_len; 8241e51764aSArtem Bityutskiy wbuf->used = aligned_len; 8251e51764aSArtem Bityutskiy wbuf->next_ino = 0; 8261e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 8271e51764aSArtem Bityutskiy 8281e51764aSArtem Bityutskiy exit: 8291e51764aSArtem Bityutskiy if (wbuf->sync_callback) { 8301e51764aSArtem Bityutskiy int free = c->leb_size - wbuf->offs - wbuf->used; 8311e51764aSArtem Bityutskiy 8321e51764aSArtem Bityutskiy err = wbuf->sync_callback(c, wbuf->lnum, free, 0); 8331e51764aSArtem Bityutskiy if (err) 8341e51764aSArtem Bityutskiy goto out; 8351e51764aSArtem Bityutskiy } 8361e51764aSArtem Bityutskiy 8371e51764aSArtem Bityutskiy if (wbuf->used) 8386eb61d58SRichard Weinberger new_wbuf_timer_nolock(c, wbuf); 8391e51764aSArtem Bityutskiy 8401e51764aSArtem Bityutskiy return 0; 8411e51764aSArtem Bityutskiy 8421e51764aSArtem Bityutskiy out: 843235c362bSSheng Yong ubifs_err(c, "cannot write %d bytes to LEB %d:%d, error %d", 8441e51764aSArtem Bityutskiy len, wbuf->lnum, wbuf->offs, err); 845edf6be24SArtem Bityutskiy ubifs_dump_node(c, buf); 8467c46d0aeSArtem Bityutskiy dump_stack(); 847edf6be24SArtem Bityutskiy ubifs_dump_leb(c, wbuf->lnum); 8481e51764aSArtem Bityutskiy return err; 8491e51764aSArtem Bityutskiy } 8501e51764aSArtem Bityutskiy 8511e51764aSArtem Bityutskiy /** 8521e51764aSArtem Bityutskiy * ubifs_write_node - write node to the media. 8531e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 8541e51764aSArtem Bityutskiy * @buf: the node to write 8551e51764aSArtem Bityutskiy * @len: node length 8561e51764aSArtem Bityutskiy * @lnum: logical eraseblock number 8571e51764aSArtem Bityutskiy * @offs: offset within the logical eraseblock 8581e51764aSArtem Bityutskiy * 8591e51764aSArtem Bityutskiy * This function automatically fills node magic number, assigns sequence 8601e51764aSArtem Bityutskiy * number, and calculates node CRC checksum. The length of the @buf buffer has 8611e51764aSArtem Bityutskiy * to be aligned to the minimal I/O unit size. This function automatically 8621e51764aSArtem Bityutskiy * appends padding node and padding bytes if needed. Returns zero in case of 8631e51764aSArtem Bityutskiy * success and a negative error code in case of failure. 8641e51764aSArtem Bityutskiy */ 8651e51764aSArtem Bityutskiy int ubifs_write_node(struct ubifs_info *c, void *buf, int len, int lnum, 866b36a261eSRichard Weinberger int offs) 8671e51764aSArtem Bityutskiy { 8681e51764aSArtem Bityutskiy int err, buf_len = ALIGN(len, c->min_io_size); 8691e51764aSArtem Bityutskiy 8701e51764aSArtem Bityutskiy dbg_io("LEB %d:%d, %s, length %d (aligned %d)", 8711e51764aSArtem Bityutskiy lnum, offs, dbg_ntype(((struct ubifs_ch *)buf)->node_type), len, 8721e51764aSArtem Bityutskiy buf_len); 8736eb61d58SRichard Weinberger ubifs_assert(c, lnum >= 0 && lnum < c->leb_cnt && offs >= 0); 8746eb61d58SRichard Weinberger ubifs_assert(c, offs % c->min_io_size == 0 && offs < c->leb_size); 8756eb61d58SRichard Weinberger ubifs_assert(c, !c->ro_media && !c->ro_mount); 8766eb61d58SRichard Weinberger ubifs_assert(c, !c->space_fixup); 8771e51764aSArtem Bityutskiy 8782680d722SArtem Bityutskiy if (c->ro_error) 8791e51764aSArtem Bityutskiy return -EROFS; 8801e51764aSArtem Bityutskiy 8811e51764aSArtem Bityutskiy ubifs_prepare_node(c, buf, len, 1); 882b36a261eSRichard Weinberger err = ubifs_leb_write(c, lnum, buf, offs, buf_len); 883987226a5SArtem Bityutskiy if (err) 884edf6be24SArtem Bityutskiy ubifs_dump_node(c, buf); 8851e51764aSArtem Bityutskiy 8861e51764aSArtem Bityutskiy return err; 8871e51764aSArtem Bityutskiy } 8881e51764aSArtem Bityutskiy 8891e51764aSArtem Bityutskiy /** 8901e51764aSArtem Bityutskiy * ubifs_read_node_wbuf - read node from the media or write-buffer. 8911e51764aSArtem Bityutskiy * @wbuf: wbuf to check for un-written data 8921e51764aSArtem Bityutskiy * @buf: buffer to read to 8931e51764aSArtem Bityutskiy * @type: node type 8941e51764aSArtem Bityutskiy * @len: node length 8951e51764aSArtem Bityutskiy * @lnum: logical eraseblock number 8961e51764aSArtem Bityutskiy * @offs: offset within the logical eraseblock 8971e51764aSArtem Bityutskiy * 8981e51764aSArtem Bityutskiy * This function reads a node of known type and length, checks it and stores 8991e51764aSArtem Bityutskiy * in @buf. If the node partially or fully sits in the write-buffer, this 9001e51764aSArtem Bityutskiy * function takes data from the buffer, otherwise it reads the flash media. 9011e51764aSArtem Bityutskiy * Returns zero in case of success, %-EUCLEAN if CRC mismatched and a negative 9021e51764aSArtem Bityutskiy * error code in case of failure. 9031e51764aSArtem Bityutskiy */ 9041e51764aSArtem Bityutskiy int ubifs_read_node_wbuf(struct ubifs_wbuf *wbuf, void *buf, int type, int len, 9051e51764aSArtem Bityutskiy int lnum, int offs) 9061e51764aSArtem Bityutskiy { 9071e51764aSArtem Bityutskiy const struct ubifs_info *c = wbuf->c; 9081e51764aSArtem Bityutskiy int err, rlen, overlap; 9091e51764aSArtem Bityutskiy struct ubifs_ch *ch = buf; 9101e51764aSArtem Bityutskiy 91177a7ae58SArtem Bityutskiy dbg_io("LEB %d:%d, %s, length %d, jhead %s", lnum, offs, 91277a7ae58SArtem Bityutskiy dbg_ntype(type), len, dbg_jhead(wbuf->jhead)); 9136eb61d58SRichard Weinberger ubifs_assert(c, wbuf && lnum >= 0 && lnum < c->leb_cnt && offs >= 0); 9146eb61d58SRichard Weinberger ubifs_assert(c, !(offs & 7) && offs < c->leb_size); 9156eb61d58SRichard Weinberger ubifs_assert(c, type >= 0 && type < UBIFS_NODE_TYPES_CNT); 9161e51764aSArtem Bityutskiy 9171e51764aSArtem Bityutskiy spin_lock(&wbuf->lock); 9181e51764aSArtem Bityutskiy overlap = (lnum == wbuf->lnum && offs + len > wbuf->offs); 9191e51764aSArtem Bityutskiy if (!overlap) { 9201e51764aSArtem Bityutskiy /* We may safely unlock the write-buffer and read the data */ 9211e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 9221e51764aSArtem Bityutskiy return ubifs_read_node(c, buf, type, len, lnum, offs); 9231e51764aSArtem Bityutskiy } 9241e51764aSArtem Bityutskiy 9251e51764aSArtem Bityutskiy /* Don't read under wbuf */ 9261e51764aSArtem Bityutskiy rlen = wbuf->offs - offs; 9271e51764aSArtem Bityutskiy if (rlen < 0) 9281e51764aSArtem Bityutskiy rlen = 0; 9291e51764aSArtem Bityutskiy 9301e51764aSArtem Bityutskiy /* Copy the rest from the write-buffer */ 9311e51764aSArtem Bityutskiy memcpy(buf + rlen, wbuf->buf + offs + rlen - wbuf->offs, len - rlen); 9321e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 9331e51764aSArtem Bityutskiy 9341e51764aSArtem Bityutskiy if (rlen > 0) { 9351e51764aSArtem Bityutskiy /* Read everything that goes before write-buffer */ 936d304820aSArtem Bityutskiy err = ubifs_leb_read(c, lnum, buf, offs, rlen, 0); 937d304820aSArtem Bityutskiy if (err && err != -EBADMSG) 9381e51764aSArtem Bityutskiy return err; 9391e51764aSArtem Bityutskiy } 9401e51764aSArtem Bityutskiy 9411e51764aSArtem Bityutskiy if (type != ch->node_type) { 942235c362bSSheng Yong ubifs_err(c, "bad node type (%d but expected %d)", 9431e51764aSArtem Bityutskiy ch->node_type, type); 9441e51764aSArtem Bityutskiy goto out; 9451e51764aSArtem Bityutskiy } 9461e51764aSArtem Bityutskiy 9472953e73fSAdrian Hunter err = ubifs_check_node(c, buf, lnum, offs, 0, 0); 9481e51764aSArtem Bityutskiy if (err) { 949235c362bSSheng Yong ubifs_err(c, "expected node type %d", type); 9501e51764aSArtem Bityutskiy return err; 9511e51764aSArtem Bityutskiy } 9521e51764aSArtem Bityutskiy 9531e51764aSArtem Bityutskiy rlen = le32_to_cpu(ch->len); 9541e51764aSArtem Bityutskiy if (rlen != len) { 955235c362bSSheng Yong ubifs_err(c, "bad node length %d, expected %d", rlen, len); 9561e51764aSArtem Bityutskiy goto out; 9571e51764aSArtem Bityutskiy } 9581e51764aSArtem Bityutskiy 9591e51764aSArtem Bityutskiy return 0; 9601e51764aSArtem Bityutskiy 9611e51764aSArtem Bityutskiy out: 962235c362bSSheng Yong ubifs_err(c, "bad node at LEB %d:%d", lnum, offs); 963edf6be24SArtem Bityutskiy ubifs_dump_node(c, buf); 9647c46d0aeSArtem Bityutskiy dump_stack(); 9651e51764aSArtem Bityutskiy return -EINVAL; 9661e51764aSArtem Bityutskiy } 9671e51764aSArtem Bityutskiy 9681e51764aSArtem Bityutskiy /** 9691e51764aSArtem Bityutskiy * ubifs_read_node - read node. 9701e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 9711e51764aSArtem Bityutskiy * @buf: buffer to read to 9721e51764aSArtem Bityutskiy * @type: node type 9731e51764aSArtem Bityutskiy * @len: node length (not aligned) 9741e51764aSArtem Bityutskiy * @lnum: logical eraseblock number 9751e51764aSArtem Bityutskiy * @offs: offset within the logical eraseblock 9761e51764aSArtem Bityutskiy * 9771e51764aSArtem Bityutskiy * This function reads a node of known type and and length, checks it and 9781e51764aSArtem Bityutskiy * stores in @buf. Returns zero in case of success, %-EUCLEAN if CRC mismatched 9791e51764aSArtem Bityutskiy * and a negative error code in case of failure. 9801e51764aSArtem Bityutskiy */ 9811e51764aSArtem Bityutskiy int ubifs_read_node(const struct ubifs_info *c, void *buf, int type, int len, 9821e51764aSArtem Bityutskiy int lnum, int offs) 9831e51764aSArtem Bityutskiy { 9841e51764aSArtem Bityutskiy int err, l; 9851e51764aSArtem Bityutskiy struct ubifs_ch *ch = buf; 9861e51764aSArtem Bityutskiy 9871e51764aSArtem Bityutskiy dbg_io("LEB %d:%d, %s, length %d", lnum, offs, dbg_ntype(type), len); 9886eb61d58SRichard Weinberger ubifs_assert(c, lnum >= 0 && lnum < c->leb_cnt && offs >= 0); 9896eb61d58SRichard Weinberger ubifs_assert(c, len >= UBIFS_CH_SZ && offs + len <= c->leb_size); 9906eb61d58SRichard Weinberger ubifs_assert(c, !(offs & 7) && offs < c->leb_size); 9916eb61d58SRichard Weinberger ubifs_assert(c, type >= 0 && type < UBIFS_NODE_TYPES_CNT); 9921e51764aSArtem Bityutskiy 993d304820aSArtem Bityutskiy err = ubifs_leb_read(c, lnum, buf, offs, len, 0); 994d304820aSArtem Bityutskiy if (err && err != -EBADMSG) 9951e51764aSArtem Bityutskiy return err; 9961e51764aSArtem Bityutskiy 9971e51764aSArtem Bityutskiy if (type != ch->node_type) { 99890bea5a3SDaniel Golle ubifs_errc(c, "bad node type (%d but expected %d)", 9991e51764aSArtem Bityutskiy ch->node_type, type); 10001e51764aSArtem Bityutskiy goto out; 10011e51764aSArtem Bityutskiy } 10021e51764aSArtem Bityutskiy 10032953e73fSAdrian Hunter err = ubifs_check_node(c, buf, lnum, offs, 0, 0); 10041e51764aSArtem Bityutskiy if (err) { 100590bea5a3SDaniel Golle ubifs_errc(c, "expected node type %d", type); 10061e51764aSArtem Bityutskiy return err; 10071e51764aSArtem Bityutskiy } 10081e51764aSArtem Bityutskiy 10091e51764aSArtem Bityutskiy l = le32_to_cpu(ch->len); 10101e51764aSArtem Bityutskiy if (l != len) { 101190bea5a3SDaniel Golle ubifs_errc(c, "bad node length %d, expected %d", l, len); 10121e51764aSArtem Bityutskiy goto out; 10131e51764aSArtem Bityutskiy } 10141e51764aSArtem Bityutskiy 10151e51764aSArtem Bityutskiy return 0; 10161e51764aSArtem Bityutskiy 10171e51764aSArtem Bityutskiy out: 101890bea5a3SDaniel Golle ubifs_errc(c, "bad node at LEB %d:%d, LEB mapping status %d", lnum, 101990bea5a3SDaniel Golle offs, ubi_is_mapped(c->ubi, lnum)); 102090bea5a3SDaniel Golle if (!c->probing) { 1021edf6be24SArtem Bityutskiy ubifs_dump_node(c, buf); 10227c46d0aeSArtem Bityutskiy dump_stack(); 102390bea5a3SDaniel Golle } 10241e51764aSArtem Bityutskiy return -EINVAL; 10251e51764aSArtem Bityutskiy } 10261e51764aSArtem Bityutskiy 10271e51764aSArtem Bityutskiy /** 10281e51764aSArtem Bityutskiy * ubifs_wbuf_init - initialize write-buffer. 10291e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 10301e51764aSArtem Bityutskiy * @wbuf: write-buffer to initialize 10311e51764aSArtem Bityutskiy * 1032cb54ef8bSArtem Bityutskiy * This function initializes write-buffer. Returns zero in case of success 10331e51764aSArtem Bityutskiy * %-ENOMEM in case of failure. 10341e51764aSArtem Bityutskiy */ 10351e51764aSArtem Bityutskiy int ubifs_wbuf_init(struct ubifs_info *c, struct ubifs_wbuf *wbuf) 10361e51764aSArtem Bityutskiy { 10371e51764aSArtem Bityutskiy size_t size; 10381e51764aSArtem Bityutskiy 10396c7f74f7SArtem Bityutskiy wbuf->buf = kmalloc(c->max_write_size, GFP_KERNEL); 10401e51764aSArtem Bityutskiy if (!wbuf->buf) 10411e51764aSArtem Bityutskiy return -ENOMEM; 10421e51764aSArtem Bityutskiy 10436c7f74f7SArtem Bityutskiy size = (c->max_write_size / UBIFS_CH_SZ + 1) * sizeof(ino_t); 10441e51764aSArtem Bityutskiy wbuf->inodes = kmalloc(size, GFP_KERNEL); 10451e51764aSArtem Bityutskiy if (!wbuf->inodes) { 10461e51764aSArtem Bityutskiy kfree(wbuf->buf); 10471e51764aSArtem Bityutskiy wbuf->buf = NULL; 10481e51764aSArtem Bityutskiy return -ENOMEM; 10491e51764aSArtem Bityutskiy } 10501e51764aSArtem Bityutskiy 10511e51764aSArtem Bityutskiy wbuf->used = 0; 10521e51764aSArtem Bityutskiy wbuf->lnum = wbuf->offs = -1; 10536c7f74f7SArtem Bityutskiy /* 10546c7f74f7SArtem Bityutskiy * If the LEB starts at the max. write size aligned address, then 10556c7f74f7SArtem Bityutskiy * write-buffer size has to be set to @c->max_write_size. Otherwise, 10566c7f74f7SArtem Bityutskiy * set it to something smaller so that it ends at the closest max. 10576c7f74f7SArtem Bityutskiy * write size boundary. 10586c7f74f7SArtem Bityutskiy */ 10596c7f74f7SArtem Bityutskiy size = c->max_write_size - (c->leb_start % c->max_write_size); 10606c7f74f7SArtem Bityutskiy wbuf->avail = wbuf->size = size; 10611e51764aSArtem Bityutskiy wbuf->sync_callback = NULL; 10621e51764aSArtem Bityutskiy mutex_init(&wbuf->io_mutex); 10631e51764aSArtem Bityutskiy spin_lock_init(&wbuf->lock); 10641e51764aSArtem Bityutskiy wbuf->c = c; 10651e51764aSArtem Bityutskiy wbuf->next_ino = 0; 10661e51764aSArtem Bityutskiy 1067f2c5dbd7SArtem Bityutskiy hrtimer_init(&wbuf->timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL); 1068f2c5dbd7SArtem Bityutskiy wbuf->timer.function = wbuf_timer_callback_nolock; 10691e51764aSArtem Bityutskiy return 0; 10701e51764aSArtem Bityutskiy } 10711e51764aSArtem Bityutskiy 10721e51764aSArtem Bityutskiy /** 10731e51764aSArtem Bityutskiy * ubifs_wbuf_add_ino_nolock - add an inode number into the wbuf inode array. 10741e51764aSArtem Bityutskiy * @wbuf: the write-buffer where to add 10751e51764aSArtem Bityutskiy * @inum: the inode number 10761e51764aSArtem Bityutskiy * 10771e51764aSArtem Bityutskiy * This function adds an inode number to the inode array of the write-buffer. 10781e51764aSArtem Bityutskiy */ 10791e51764aSArtem Bityutskiy void ubifs_wbuf_add_ino_nolock(struct ubifs_wbuf *wbuf, ino_t inum) 10801e51764aSArtem Bityutskiy { 10811e51764aSArtem Bityutskiy if (!wbuf->buf) 10821e51764aSArtem Bityutskiy /* NOR flash or something similar */ 10831e51764aSArtem Bityutskiy return; 10841e51764aSArtem Bityutskiy 10851e51764aSArtem Bityutskiy spin_lock(&wbuf->lock); 10861e51764aSArtem Bityutskiy if (wbuf->used) 10871e51764aSArtem Bityutskiy wbuf->inodes[wbuf->next_ino++] = inum; 10881e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 10891e51764aSArtem Bityutskiy } 10901e51764aSArtem Bityutskiy 10911e51764aSArtem Bityutskiy /** 10921e51764aSArtem Bityutskiy * wbuf_has_ino - returns if the wbuf contains data from the inode. 10931e51764aSArtem Bityutskiy * @wbuf: the write-buffer 10941e51764aSArtem Bityutskiy * @inum: the inode number 10951e51764aSArtem Bityutskiy * 10961e51764aSArtem Bityutskiy * This function returns with %1 if the write-buffer contains some data from the 10971e51764aSArtem Bityutskiy * given inode otherwise it returns with %0. 10981e51764aSArtem Bityutskiy */ 10991e51764aSArtem Bityutskiy static int wbuf_has_ino(struct ubifs_wbuf *wbuf, ino_t inum) 11001e51764aSArtem Bityutskiy { 11011e51764aSArtem Bityutskiy int i, ret = 0; 11021e51764aSArtem Bityutskiy 11031e51764aSArtem Bityutskiy spin_lock(&wbuf->lock); 11041e51764aSArtem Bityutskiy for (i = 0; i < wbuf->next_ino; i++) 11051e51764aSArtem Bityutskiy if (inum == wbuf->inodes[i]) { 11061e51764aSArtem Bityutskiy ret = 1; 11071e51764aSArtem Bityutskiy break; 11081e51764aSArtem Bityutskiy } 11091e51764aSArtem Bityutskiy spin_unlock(&wbuf->lock); 11101e51764aSArtem Bityutskiy 11111e51764aSArtem Bityutskiy return ret; 11121e51764aSArtem Bityutskiy } 11131e51764aSArtem Bityutskiy 11141e51764aSArtem Bityutskiy /** 11151e51764aSArtem Bityutskiy * ubifs_sync_wbufs_by_inode - synchronize write-buffers for an inode. 11161e51764aSArtem Bityutskiy * @c: UBIFS file-system description object 11171e51764aSArtem Bityutskiy * @inode: inode to synchronize 11181e51764aSArtem Bityutskiy * 11191e51764aSArtem Bityutskiy * This function synchronizes write-buffers which contain nodes belonging to 11201e51764aSArtem Bityutskiy * @inode. Returns zero in case of success and a negative error code in case of 11211e51764aSArtem Bityutskiy * failure. 11221e51764aSArtem Bityutskiy */ 11231e51764aSArtem Bityutskiy int ubifs_sync_wbufs_by_inode(struct ubifs_info *c, struct inode *inode) 11241e51764aSArtem Bityutskiy { 11251e51764aSArtem Bityutskiy int i, err = 0; 11261e51764aSArtem Bityutskiy 11271e51764aSArtem Bityutskiy for (i = 0; i < c->jhead_cnt; i++) { 11281e51764aSArtem Bityutskiy struct ubifs_wbuf *wbuf = &c->jheads[i].wbuf; 11291e51764aSArtem Bityutskiy 11301e51764aSArtem Bityutskiy if (i == GCHD) 11311e51764aSArtem Bityutskiy /* 11321e51764aSArtem Bityutskiy * GC head is special, do not look at it. Even if the 11331e51764aSArtem Bityutskiy * head contains something related to this inode, it is 11341e51764aSArtem Bityutskiy * a _copy_ of corresponding on-flash node which sits 11351e51764aSArtem Bityutskiy * somewhere else. 11361e51764aSArtem Bityutskiy */ 11371e51764aSArtem Bityutskiy continue; 11381e51764aSArtem Bityutskiy 11391e51764aSArtem Bityutskiy if (!wbuf_has_ino(wbuf, inode->i_ino)) 11401e51764aSArtem Bityutskiy continue; 11411e51764aSArtem Bityutskiy 11421e51764aSArtem Bityutskiy mutex_lock_nested(&wbuf->io_mutex, wbuf->jhead); 11431e51764aSArtem Bityutskiy if (wbuf_has_ino(wbuf, inode->i_ino)) 11441e51764aSArtem Bityutskiy err = ubifs_wbuf_sync_nolock(wbuf); 11451e51764aSArtem Bityutskiy mutex_unlock(&wbuf->io_mutex); 11461e51764aSArtem Bityutskiy 11471e51764aSArtem Bityutskiy if (err) { 11481e51764aSArtem Bityutskiy ubifs_ro_mode(c, err); 11491e51764aSArtem Bityutskiy return err; 11501e51764aSArtem Bityutskiy } 11511e51764aSArtem Bityutskiy } 11521e51764aSArtem Bityutskiy return 0; 11531e51764aSArtem Bityutskiy } 1154