[J-u-boot.git] / fs / ubifs / master.c

// SPDX-License-Identifier: GPL-2.0+
/*
 * This file is part of UBIFS.
 *
 * Copyright (C) 2006-2008 Nokia Corporation.
 *
 * Authors: Artem Bityutskiy (Битюцкий Артём)
 *          Adrian Hunter
 */

/* This file implements reading and writing the master node */

#include "ubifs.h"
#ifdef __UBOOT__
#include <log.h>
#include <dm/devres.h>
#include <linux/compat.h>
#include <linux/err.h>
#include <ubi_uboot.h>
#endif

/**
 * scan_for_master - search the valid master node.
 * @c: UBIFS file-system description object
 *
 * This function scans the master node LEBs and search for the latest master
 * node. Returns zero in case of success, %-EUCLEAN if there master area is
 * corrupted and requires recovery, and a negative error code in case of
 * failure.
 */
static int scan_for_master(struct ubifs_info *c)
{
	struct ubifs_scan_leb *sleb;
	struct ubifs_scan_node *snod;
	int lnum, offs = 0, nodes_cnt;

	lnum = UBIFS_MST_LNUM;

	sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
	if (IS_ERR(sleb))
		return PTR_ERR(sleb);
	nodes_cnt = sleb->nodes_cnt;
	if (nodes_cnt > 0) {
		snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node,
				  list);
		if (snod->type != UBIFS_MST_NODE)
			goto out_dump;
		memcpy(c->mst_node, snod->node, snod->len);
		offs = snod->offs;
	}
	ubifs_scan_destroy(sleb);

	lnum += 1;

	sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
	if (IS_ERR(sleb))
		return PTR_ERR(sleb);
	if (sleb->nodes_cnt != nodes_cnt)
		goto out;
	if (!sleb->nodes_cnt)
		goto out;
	snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list);
	if (snod->type != UBIFS_MST_NODE)
		goto out_dump;
	if (snod->offs != offs)
		goto out;
	if (memcmp((void *)c->mst_node + UBIFS_CH_SZ,
		   (void *)snod->node + UBIFS_CH_SZ,
		   UBIFS_MST_NODE_SZ - UBIFS_CH_SZ))
		goto out;
	c->mst_offs = offs;
	ubifs_scan_destroy(sleb);
	return 0;

out:
	ubifs_scan_destroy(sleb);
	return -EUCLEAN;

out_dump:
	ubifs_err(c, "unexpected node type %d master LEB %d:%d",
		  snod->type, lnum, snod->offs);
	ubifs_scan_destroy(sleb);
	return -EINVAL;
}

/**
 * validate_master - validate master node.
 * @c: UBIFS file-system description object
 *
 * This function validates data which was read from master node. Returns zero
 * if the data is all right and %-EINVAL if not.
 */
static int validate_master(const struct ubifs_info *c)
{
	long long main_sz;
	int err;

	if (c->max_sqnum >= SQNUM_WATERMARK) {
		err = 1;
		goto out;
	}

	if (c->cmt_no >= c->max_sqnum) {
		err = 2;
		goto out;
	}

	if (c->highest_inum >= INUM_WATERMARK) {
		err = 3;
		goto out;
	}

	if (c->lhead_lnum < UBIFS_LOG_LNUM ||
	    c->lhead_lnum >= UBIFS_LOG_LNUM + c->log_lebs ||
	    c->lhead_offs < 0 || c->lhead_offs >= c->leb_size ||
	    c->lhead_offs & (c->min_io_size - 1)) {
		err = 4;
		goto out;
	}

	if (c->zroot.lnum >= c->leb_cnt || c->zroot.lnum < c->main_first ||
	    c->zroot.offs >= c->leb_size || c->zroot.offs & 7) {
		err = 5;
		goto out;
	}

	if (c->zroot.len < c->ranges[UBIFS_IDX_NODE].min_len ||
	    c->zroot.len > c->ranges[UBIFS_IDX_NODE].max_len) {
		err = 6;
		goto out;
	}

	if (c->gc_lnum >= c->leb_cnt || c->gc_lnum < c->main_first) {
		err = 7;
		goto out;
	}

	if (c->ihead_lnum >= c->leb_cnt || c->ihead_lnum < c->main_first ||
	    c->ihead_offs % c->min_io_size || c->ihead_offs < 0 ||
	    c->ihead_offs > c->leb_size || c->ihead_offs & 7) {
		err = 8;
		goto out;
	}

	main_sz = (long long)c->main_lebs * c->leb_size;
	if (c->bi.old_idx_sz & 7 || c->bi.old_idx_sz >= main_sz) {
		err = 9;
		goto out;
	}

	if (c->lpt_lnum < c->lpt_first || c->lpt_lnum > c->lpt_last ||
	    c->lpt_offs < 0 || c->lpt_offs + c->nnode_sz > c->leb_size) {
		err = 10;
		goto out;
	}

	if (c->nhead_lnum < c->lpt_first || c->nhead_lnum > c->lpt_last ||
	    c->nhead_offs < 0 || c->nhead_offs % c->min_io_size ||
	    c->nhead_offs > c->leb_size) {
		err = 11;
		goto out;
	}

	if (c->ltab_lnum < c->lpt_first || c->ltab_lnum > c->lpt_last ||
	    c->ltab_offs < 0 ||
	    c->ltab_offs + c->ltab_sz > c->leb_size) {
		err = 12;
		goto out;
	}

	if (c->big_lpt && (c->lsave_lnum < c->lpt_first ||
	    c->lsave_lnum > c->lpt_last || c->lsave_offs < 0 ||
	    c->lsave_offs + c->lsave_sz > c->leb_size)) {
		err = 13;
		goto out;
	}

	if (c->lscan_lnum < c->main_first || c->lscan_lnum >= c->leb_cnt) {
		err = 14;
		goto out;
	}

	if (c->lst.empty_lebs < 0 || c->lst.empty_lebs > c->main_lebs - 2) {
		err = 15;
		goto out;
	}

	if (c->lst.idx_lebs < 0 || c->lst.idx_lebs > c->main_lebs - 1) {
		err = 16;
		goto out;
	}

	if (c->lst.total_free < 0 || c->lst.total_free > main_sz ||
	    c->lst.total_free & 7) {
		err = 17;
		goto out;
	}

	if (c->lst.total_dirty < 0 || (c->lst.total_dirty & 7)) {
		err = 18;
		goto out;
	}

	if (c->lst.total_used < 0 || (c->lst.total_used & 7)) {
		err = 19;
		goto out;
	}

	if (c->lst.total_free + c->lst.total_dirty +
	    c->lst.total_used > main_sz) {
		err = 20;
		goto out;
	}

	if (c->lst.total_dead + c->lst.total_dark +
	    c->lst.total_used + c->bi.old_idx_sz > main_sz) {
		err = 21;
		goto out;
	}

	if (c->lst.total_dead < 0 ||
	    c->lst.total_dead > c->lst.total_free + c->lst.total_dirty ||
	    c->lst.total_dead & 7) {
		err = 22;
		goto out;
	}

	if (c->lst.total_dark < 0 ||
	    c->lst.total_dark > c->lst.total_free + c->lst.total_dirty ||
	    c->lst.total_dark & 7) {
		err = 23;
		goto out;
	}

	return 0;

out:
	ubifs_err(c, "bad master node at offset %d error %d", c->mst_offs, err);
	ubifs_dump_node(c, c->mst_node);
	return -EINVAL;
}

/**
 * ubifs_read_master - read master node.
 * @c: UBIFS file-system description object
 *
 * This function finds and reads the master node during file-system mount. If
 * the flash is empty, it creates default master node as well. Returns zero in
 * case of success and a negative error code in case of failure.
 */
int ubifs_read_master(struct ubifs_info *c)
{
	int err, old_leb_cnt;

	c->mst_node = kzalloc(c->mst_node_alsz, GFP_KERNEL);
	if (!c->mst_node)
		return -ENOMEM;

	err = scan_for_master(c);
	if (err) {
		if (err == -EUCLEAN)
			err = ubifs_recover_master_node(c);
		if (err)
			/*
			 * Note, we do not free 'c->mst_node' here because the
			 * unmount routine will take care of this.
			 */
			return err;
	}

	/* Make sure that the recovery flag is clear */
	c->mst_node->flags &= cpu_to_le32(~UBIFS_MST_RCVRY);

	c->max_sqnum       = le64_to_cpu(c->mst_node->ch.sqnum);
	c->highest_inum    = le64_to_cpu(c->mst_node->highest_inum);
	c->cmt_no          = le64_to_cpu(c->mst_node->cmt_no);
	c->zroot.lnum      = le32_to_cpu(c->mst_node->root_lnum);
	c->zroot.offs      = le32_to_cpu(c->mst_node->root_offs);
	c->zroot.len       = le32_to_cpu(c->mst_node->root_len);
	c->lhead_lnum      = le32_to_cpu(c->mst_node->log_lnum);
	c->gc_lnum         = le32_to_cpu(c->mst_node->gc_lnum);
	c->ihead_lnum      = le32_to_cpu(c->mst_node->ihead_lnum);
	c->ihead_offs      = le32_to_cpu(c->mst_node->ihead_offs);
	c->bi.old_idx_sz   = le64_to_cpu(c->mst_node->index_size);
	c->lpt_lnum        = le32_to_cpu(c->mst_node->lpt_lnum);
	c->lpt_offs        = le32_to_cpu(c->mst_node->lpt_offs);
	c->nhead_lnum      = le32_to_cpu(c->mst_node->nhead_lnum);
	c->nhead_offs      = le32_to_cpu(c->mst_node->nhead_offs);
	c->ltab_lnum       = le32_to_cpu(c->mst_node->ltab_lnum);
	c->ltab_offs       = le32_to_cpu(c->mst_node->ltab_offs);
	c->lsave_lnum      = le32_to_cpu(c->mst_node->lsave_lnum);
	c->lsave_offs      = le32_to_cpu(c->mst_node->lsave_offs);
	c->lscan_lnum      = le32_to_cpu(c->mst_node->lscan_lnum);
	c->lst.empty_lebs  = le32_to_cpu(c->mst_node->empty_lebs);
	c->lst.idx_lebs    = le32_to_cpu(c->mst_node->idx_lebs);
	old_leb_cnt        = le32_to_cpu(c->mst_node->leb_cnt);
	c->lst.total_free  = le64_to_cpu(c->mst_node->total_free);
	c->lst.total_dirty = le64_to_cpu(c->mst_node->total_dirty);
	c->lst.total_used  = le64_to_cpu(c->mst_node->total_used);
	c->lst.total_dead  = le64_to_cpu(c->mst_node->total_dead);
	c->lst.total_dark  = le64_to_cpu(c->mst_node->total_dark);

	c->calc_idx_sz = c->bi.old_idx_sz;

	if (c->mst_node->flags & cpu_to_le32(UBIFS_MST_NO_ORPHS))
		c->no_orphs = 1;

	if (old_leb_cnt != c->leb_cnt) {
		/* The file system has been resized */
		int growth = c->leb_cnt - old_leb_cnt;

		if (c->leb_cnt < old_leb_cnt ||
		    c->leb_cnt < UBIFS_MIN_LEB_CNT) {
			ubifs_err(c, "bad leb_cnt on master node");
			ubifs_dump_node(c, c->mst_node);
			return -EINVAL;
		}

		dbg_mnt("Auto resizing (master) from %d LEBs to %d LEBs",
			old_leb_cnt, c->leb_cnt);
		c->lst.empty_lebs += growth;
		c->lst.total_free += growth * (long long)c->leb_size;
		c->lst.total_dark += growth * (long long)c->dark_wm;

		/*
		 * Reflect changes back onto the master node. N.B. the master
		 * node gets written immediately whenever mounting (or
		 * remounting) in read-write mode, so we do not need to write it
		 * here.
		 */
		c->mst_node->leb_cnt = cpu_to_le32(c->leb_cnt);
		c->mst_node->empty_lebs = cpu_to_le32(c->lst.empty_lebs);
		c->mst_node->total_free = cpu_to_le64(c->lst.total_free);
		c->mst_node->total_dark = cpu_to_le64(c->lst.total_dark);
	}

	err = validate_master(c);
	if (err)
		return err;

#ifndef __UBOOT__
	err = dbg_old_index_check_init(c, &c->zroot);
#endif

	return err;
}

#ifndef __UBOOT__
/**
 * ubifs_write_master - write master node.
 * @c: UBIFS file-system description object
 *
 * This function writes the master node. Returns zero in case of success and a
 * negative error code in case of failure. The master node is written twice to
 * enable recovery.
 */
int ubifs_write_master(struct ubifs_info *c)
{
	int err, lnum, offs, len;

	ubifs_assert(!c->ro_media && !c->ro_mount);
	if (c->ro_error)
		return -EROFS;

	lnum = UBIFS_MST_LNUM;
	offs = c->mst_offs + c->mst_node_alsz;
	len = UBIFS_MST_NODE_SZ;

	if (offs + UBIFS_MST_NODE_SZ > c->leb_size) {
		err = ubifs_leb_unmap(c, lnum);
		if (err)
			return err;
		offs = 0;
	}

	c->mst_offs = offs;
	c->mst_node->highest_inum = cpu_to_le64(c->highest_inum);

	err = ubifs_write_node(c, c->mst_node, len, lnum, offs);
	if (err)
		return err;

	lnum += 1;

	if (offs == 0) {
		err = ubifs_leb_unmap(c, lnum);
		if (err)
			return err;
	}
	err = ubifs_write_node(c, c->mst_node, len, lnum, offs);

	return err;
}
#endif
Commit	Line	Data
83d290c5	1	// SPDX-License-Identifier: GPL-2.0+
9eefe2a2 SR	2	/*
	3	* This file is part of UBIFS.
	4	*
	5	* Copyright (C) 2006-2008 Nokia Corporation.
	6	*
9eefe2a2 SR	7	* Authors: Artem Bityutskiy (Битюцкий Артём)
	8	* Adrian Hunter
	9	*/
	10
	11	/* This file implements reading and writing the master node */
	12
	13	#include "ubifs.h"
ff94bc40	14	#ifdef __UBOOT__
f7ae49fc	15	#include <log.h>
61b29b82	16	#include <dm/devres.h>
ff94bc40 HS	17	#include <linux/compat.h>
	18	#include <linux/err.h>
	19	#include <ubi_uboot.h>
	20	#endif
9eefe2a2 SR	21
	22	/**
	23	* scan_for_master - search the valid master node.
	24	* @c: UBIFS file-system description object
	25	*
	26	* This function scans the master node LEBs and search for the latest master
ff94bc40 HS	27	* node. Returns zero in case of success, %-EUCLEAN if there master area is
ff94bc40 HS	28	* corrupted and requires recovery, and a negative error code in case of
9eefe2a2 SR	29	* failure.
	30	*/
	31	static int scan_for_master(struct ubifs_info *c)
	32	{
	33	struct ubifs_scan_leb *sleb;
	34	struct ubifs_scan_node *snod;
	35	int lnum, offs = 0, nodes_cnt;
	36
	37	lnum = UBIFS_MST_LNUM;
	38
ff94bc40	39	sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
9eefe2a2 SR	40	if (IS_ERR(sleb))
	41	return PTR_ERR(sleb);
	42	nodes_cnt = sleb->nodes_cnt;
	43	if (nodes_cnt > 0) {
	44	snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node,
	45	list);
	46	if (snod->type != UBIFS_MST_NODE)
ff94bc40	47	goto out_dump;
9eefe2a2 SR	48	memcpy(c->mst_node, snod->node, snod->len);
	49	offs = snod->offs;
	50	}
	51	ubifs_scan_destroy(sleb);
	52
	53	lnum += 1;
	54
ff94bc40	55	sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
9eefe2a2 SR	56	if (IS_ERR(sleb))
	57	return PTR_ERR(sleb);
	58	if (sleb->nodes_cnt != nodes_cnt)
	59	goto out;
	60	if (!sleb->nodes_cnt)
	61	goto out;
	62	snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list);
	63	if (snod->type != UBIFS_MST_NODE)
ff94bc40	64	goto out_dump;
9eefe2a2 SR	65	if (snod->offs != offs)
	66	goto out;
	67	if (memcmp((void *)c->mst_node + UBIFS_CH_SZ,
	68	(void *)snod->node + UBIFS_CH_SZ,
	69	UBIFS_MST_NODE_SZ - UBIFS_CH_SZ))
	70	goto out;
	71	c->mst_offs = offs;
	72	ubifs_scan_destroy(sleb);
	73	return 0;
	74
	75	out:
	76	ubifs_scan_destroy(sleb);
ff94bc40 HS	77	return -EUCLEAN;
	78
	79	out_dump:
0195a7bb	80	ubifs_err(c, "unexpected node type %d master LEB %d:%d",
ff94bc40 HS	81	snod->type, lnum, snod->offs);
ff94bc40 HS	82	ubifs_scan_destroy(sleb);
9eefe2a2 SR	83	return -EINVAL;
	84	}
	85
	86	/**
	87	* validate_master - validate master node.
	88	* @c: UBIFS file-system description object
	89	*
	90	* This function validates data which was read from master node. Returns zero
	91	* if the data is all right and %-EINVAL if not.
	92	*/
	93	static int validate_master(const struct ubifs_info *c)
	94	{
	95	long long main_sz;
	96	int err;
	97
	98	if (c->max_sqnum >= SQNUM_WATERMARK) {
	99	err = 1;
	100	goto out;
	101	}
	102
	103	if (c->cmt_no >= c->max_sqnum) {
	104	err = 2;
	105	goto out;
	106	}
	107
	108	if (c->highest_inum >= INUM_WATERMARK) {
	109	err = 3;
	110	goto out;
	111	}
	112
	113	if (c->lhead_lnum < UBIFS_LOG_LNUM \|\|
	114	c->lhead_lnum >= UBIFS_LOG_LNUM + c->log_lebs \|\|
	115	c->lhead_offs < 0 \|\| c->lhead_offs >= c->leb_size \|\|
	116	c->lhead_offs & (c->min_io_size - 1)) {
	117	err = 4;
	118	goto out;
	119	}
	120
	121	if (c->zroot.lnum >= c->leb_cnt \|\| c->zroot.lnum < c->main_first \|\|
	122	c->zroot.offs >= c->leb_size \|\| c->zroot.offs & 7) {
	123	err = 5;
	124	goto out;
	125	}
	126
	127	if (c->zroot.len < c->ranges[UBIFS_IDX_NODE].min_len \|\|
	128	c->zroot.len > c->ranges[UBIFS_IDX_NODE].max_len) {
	129	err = 6;
	130	goto out;
	131	}
	132
	133	if (c->gc_lnum >= c->leb_cnt \|\| c->gc_lnum < c->main_first) {
	134	err = 7;
	135	goto out;
	136	}
	137
	138	if (c->ihead_lnum >= c->leb_cnt \|\| c->ihead_lnum < c->main_first \|\|
	139	c->ihead_offs % c->min_io_size \|\| c->ihead_offs < 0 \|\|
	140	c->ihead_offs > c->leb_size \|\| c->ihead_offs & 7) {
	141	err = 8;
	142	goto out;
	143	}
	144
	145	main_sz = (long long)c->main_lebs * c->leb_size;
ff94bc40	146	if (c->bi.old_idx_sz & 7 \|\| c->bi.old_idx_sz >= main_sz) {
9eefe2a2 SR	147	err = 9;
	148	goto out;
	149	}
	150
	151	if (c->lpt_lnum < c->lpt_first \|\| c->lpt_lnum > c->lpt_last \|\|
	152	c->lpt_offs < 0 \|\| c->lpt_offs + c->nnode_sz > c->leb_size) {
	153	err = 10;
	154	goto out;
	155	}
	156
	157	if (c->nhead_lnum < c->lpt_first \|\| c->nhead_lnum > c->lpt_last \|\|
	158	c->nhead_offs < 0 \|\| c->nhead_offs % c->min_io_size \|\|
	159	c->nhead_offs > c->leb_size) {
	160	err = 11;
	161	goto out;
	162	}
	163
	164	if (c->ltab_lnum < c->lpt_first \|\| c->ltab_lnum > c->lpt_last \|\|
	165	c->ltab_offs < 0 \|\|
	166	c->ltab_offs + c->ltab_sz > c->leb_size) {
	167	err = 12;
	168	goto out;
	169	}
	170
	171	if (c->big_lpt && (c->lsave_lnum < c->lpt_first \|\|
	172	c->lsave_lnum > c->lpt_last \|\| c->lsave_offs < 0 \|\|
	173	c->lsave_offs + c->lsave_sz > c->leb_size)) {
	174	err = 13;
	175	goto out;
	176	}
	177
	178	if (c->lscan_lnum < c->main_first \|\| c->lscan_lnum >= c->leb_cnt) {
	179	err = 14;
	180	goto out;
	181	}
	182
	183	if (c->lst.empty_lebs < 0 \|\| c->lst.empty_lebs > c->main_lebs - 2) {
	184	err = 15;
	185	goto out;
	186	}
	187
	188	if (c->lst.idx_lebs < 0 \|\| c->lst.idx_lebs > c->main_lebs - 1) {
	189	err = 16;
	190	goto out;
	191	}
	192
	193	if (c->lst.total_free < 0 \|\| c->lst.total_free > main_sz \|\|
	194	c->lst.total_free & 7) {
	195	err = 17;
	196	goto out;
	197	}
	198
	199	if (c->lst.total_dirty < 0 \|\| (c->lst.total_dirty & 7)) {
	200	err = 18;
	201	goto out;
	202	}
	203
	204	if (c->lst.total_used < 0 \|\| (c->lst.total_used & 7)) {
	205	err = 19;
	206	goto out;
	207	}
	208
	209	if (c->lst.total_free + c->lst.total_dirty +
	210	c->lst.total_used > main_sz) {
211	err = 20;
212	goto out;
213	}
214
215	if (c->lst.total_dead + c->lst.total_dark +
ff94bc40	216	c->lst.total_used + c->bi.old_idx_sz > main_sz) {
9eefe2a2 SR	217	err = 21;
	218	goto out;
	219	}
	220
	221	if (c->lst.total_dead < 0 \|\|
	222	c->lst.total_dead > c->lst.total_free + c->lst.total_dirty \|\|
	223	c->lst.total_dead & 7) {
	224	err = 22;
	225	goto out;
	226	}
	227
	228	if (c->lst.total_dark < 0 \|\|
	229	c->lst.total_dark > c->lst.total_free + c->lst.total_dirty \|\|
	230	c->lst.total_dark & 7) {
	231	err = 23;
	232	goto out;
	233	}
	234
	235	return 0;
	236
	237	out:
0195a7bb	238	ubifs_err(c, "bad master node at offset %d error %d", c->mst_offs, err);
ff94bc40	239	ubifs_dump_node(c, c->mst_node);
9eefe2a2 SR	240	return -EINVAL;
	241	}
	242
	243	/**
	244	* ubifs_read_master - read master node.
	245	* @c: UBIFS file-system description object
	246	*
	247	* This function finds and reads the master node during file-system mount. If
	248	* the flash is empty, it creates default master node as well. Returns zero in
	249	* case of success and a negative error code in case of failure.
	250	*/
	251	int ubifs_read_master(struct ubifs_info *c)
	252	{
	253	int err, old_leb_cnt;
	254
	255	c->mst_node = kzalloc(c->mst_node_alsz, GFP_KERNEL);
	256	if (!c->mst_node)
	257	return -ENOMEM;
	258
	259	err = scan_for_master(c);
	260	if (err) {
ff94bc40 HS	261	if (err == -EUCLEAN)
ff94bc40 HS	262	err = ubifs_recover_master_node(c);
9eefe2a2 SR	263	if (err)
	264	/*
	265	* Note, we do not free 'c->mst_node' here because the
	266	* unmount routine will take care of this.
	267	*/
	268	return err;
	269	}
	270
	271	/* Make sure that the recovery flag is clear */
	272	c->mst_node->flags &= cpu_to_le32(~UBIFS_MST_RCVRY);
	273
	274	c->max_sqnum = le64_to_cpu(c->mst_node->ch.sqnum);
	275	c->highest_inum = le64_to_cpu(c->mst_node->highest_inum);
	276	c->cmt_no = le64_to_cpu(c->mst_node->cmt_no);
	277	c->zroot.lnum = le32_to_cpu(c->mst_node->root_lnum);
	278	c->zroot.offs = le32_to_cpu(c->mst_node->root_offs);
	279	c->zroot.len = le32_to_cpu(c->mst_node->root_len);
	280	c->lhead_lnum = le32_to_cpu(c->mst_node->log_lnum);
	281	c->gc_lnum = le32_to_cpu(c->mst_node->gc_lnum);
	282	c->ihead_lnum = le32_to_cpu(c->mst_node->ihead_lnum);
	283	c->ihead_offs = le32_to_cpu(c->mst_node->ihead_offs);
ff94bc40	284	c->bi.old_idx_sz = le64_to_cpu(c->mst_node->index_size);
9eefe2a2 SR	285	c->lpt_lnum = le32_to_cpu(c->mst_node->lpt_lnum);
	286	c->lpt_offs = le32_to_cpu(c->mst_node->lpt_offs);
	287	c->nhead_lnum = le32_to_cpu(c->mst_node->nhead_lnum);
	288	c->nhead_offs = le32_to_cpu(c->mst_node->nhead_offs);
	289	c->ltab_lnum = le32_to_cpu(c->mst_node->ltab_lnum);
	290	c->ltab_offs = le32_to_cpu(c->mst_node->ltab_offs);
	291	c->lsave_lnum = le32_to_cpu(c->mst_node->lsave_lnum);
	292	c->lsave_offs = le32_to_cpu(c->mst_node->lsave_offs);
	293	c->lscan_lnum = le32_to_cpu(c->mst_node->lscan_lnum);
	294	c->lst.empty_lebs = le32_to_cpu(c->mst_node->empty_lebs);
	295	c->lst.idx_lebs = le32_to_cpu(c->mst_node->idx_lebs);
	296	old_leb_cnt = le32_to_cpu(c->mst_node->leb_cnt);
	297	c->lst.total_free = le64_to_cpu(c->mst_node->total_free);
	298	c->lst.total_dirty = le64_to_cpu(c->mst_node->total_dirty);
	299	c->lst.total_used = le64_to_cpu(c->mst_node->total_used);
	300	c->lst.total_dead = le64_to_cpu(c->mst_node->total_dead);
	301	c->lst.total_dark = le64_to_cpu(c->mst_node->total_dark);
	302
ff94bc40	303	c->calc_idx_sz = c->bi.old_idx_sz;
9eefe2a2 SR	304
	305	if (c->mst_node->flags & cpu_to_le32(UBIFS_MST_NO_ORPHS))
	306	c->no_orphs = 1;
	307
	308	if (old_leb_cnt != c->leb_cnt) {
	309	/* The file system has been resized */
	310	int growth = c->leb_cnt - old_leb_cnt;
	311
	312	if (c->leb_cnt < old_leb_cnt \|\|
	313	c->leb_cnt < UBIFS_MIN_LEB_CNT) {
0195a7bb	314	ubifs_err(c, "bad leb_cnt on master node");
ff94bc40	315	ubifs_dump_node(c, c->mst_node);
9eefe2a2 SR	316	return -EINVAL;
	317	}
	318
	319	dbg_mnt("Auto resizing (master) from %d LEBs to %d LEBs",
	320	old_leb_cnt, c->leb_cnt);
	321	c->lst.empty_lebs += growth;
	322	c->lst.total_free += growth * (long long)c->leb_size;
	323	c->lst.total_dark += growth * (long long)c->dark_wm;
	324
	325	/*
	326	* Reflect changes back onto the master node. N.B. the master
	327	* node gets written immediately whenever mounting (or
	328	* remounting) in read-write mode, so we do not need to write it
	329	* here.
	330	*/
	331	c->mst_node->leb_cnt = cpu_to_le32(c->leb_cnt);
	332	c->mst_node->empty_lebs = cpu_to_le32(c->lst.empty_lebs);
	333	c->mst_node->total_free = cpu_to_le64(c->lst.total_free);
	334	c->mst_node->total_dark = cpu_to_le64(c->lst.total_dark);
	335	}
	336
	337	err = validate_master(c);
	338	if (err)
	339	return err;
	340
ff94bc40	341	#ifndef __UBOOT__
9eefe2a2	342	err = dbg_old_index_check_init(c, &c->zroot);
ff94bc40 HS	343	#endif
	344
	345	return err;
	346	}
	347
	348	#ifndef __UBOOT__
	349	/**
	350	* ubifs_write_master - write master node.
	351	* @c: UBIFS file-system description object
	352	*
0195a7bb HS	353	* This function writes the master node. Returns zero in case of success and a
	354	* negative error code in case of failure. The master node is written twice to
	355	* enable recovery.
ff94bc40 HS	356	*/
	357	int ubifs_write_master(struct ubifs_info *c)
	358	{
	359	int err, lnum, offs, len;
	360
	361	ubifs_assert(!c->ro_media && !c->ro_mount);
	362	if (c->ro_error)
	363	return -EROFS;
	364
	365	lnum = UBIFS_MST_LNUM;
	366	offs = c->mst_offs + c->mst_node_alsz;
	367	len = UBIFS_MST_NODE_SZ;
	368
	369	if (offs + UBIFS_MST_NODE_SZ > c->leb_size) {
	370	err = ubifs_leb_unmap(c, lnum);
	371	if (err)
	372	return err;
	373	offs = 0;
	374	}
	375
	376	c->mst_offs = offs;
	377	c->mst_node->highest_inum = cpu_to_le64(c->highest_inum);
	378
	379	err = ubifs_write_node(c, c->mst_node, len, lnum, offs);
	380	if (err)
	381	return err;
	382
	383	lnum += 1;
	384
	385	if (offs == 0) {
	386	err = ubifs_leb_unmap(c, lnum);
	387	if (err)
	388	return err;
	389	}
	390	err = ubifs_write_node(c, c->mst_node, len, lnum, offs);
9eefe2a2 SR	391
	392	return err;
	393	}
ff94bc40	394	#endif