fs/ubifs/master.c

11 /* This file implements reading and writing the master node */
18  * @m1: the first node
19  * @m2: the second node
31 	 * Do not compare the common node header since the sequence number and
41 	 * due to the different common node header.
51 /* mst_node_check_hash - Check hash of a master node
53  * @mst: The master node
54  * @expected: The expected hash of the master node
56  * This checks the hash of a master node against a given expected hash.
59  * both master nodes we exclude the common node header containing the sequence
69 	const void *node = mst;
71 	crypto_shash_tfm_digest(c->hash_tfm, node + sizeof(struct ubifs_ch),
82  * scan_for_master - search the valid master node.
85  * This function scans the master node LEBs and search for the latest master
86  * node. Returns zero in case of success, %-EUCLEAN if there master area is
107 		memcpy(c->mst_node, snod->node, snod->len);
126 	if (ubifs_compare_master_node(c, c->mst_node, snod->node))
139 			ubifs_err(c, "Failed to verify master node hash");
145 			ubifs_err(c, "Failed to verify master node HMAC");
158 	ubifs_err(c, "unexpected node type %d master LEB %d:%d",
165  * validate_master - validate master node.
168  * This function validates data which was read from master node. Returns zero
316 	ubifs_err(c, "bad master node at offset %d error %d", c->mst_offs, err);
322  * ubifs_read_master - read master node.
325  * This function finds and reads the master node during file-system mount. If
326  * the flash is empty, it creates default master node as well. Returns zero in
394 			ubifs_err(c, "bad leb_cnt on master node");
406 		 * Reflect changes back onto the master node. N.B. the master
407 		 * node gets written immediately whenever mounting (or
427  * ubifs_write_master - write master node.
430  * This function writes the master node. Returns zero in case of success and a
431  * negative error code in case of failure. The master node is written twice to