^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) // SPDX-License-Identifier: GPL-2.0-only
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) * This file is part of UBIFS.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) * Copyright (C) 2006-2008 Nokia Corporation.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) * Authors: Adrian Hunter
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) * Artem Bityutskiy (Битюцкий Артём)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) * This file implements the LEB properties tree (LPT) area. The LPT area
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) * contains the LEB properties tree, a table of LPT area eraseblocks (ltab), and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) * (for the "big" model) a table of saved LEB numbers (lsave). The LPT area sits
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) * between the log and the orphan area.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) * The LPT area is like a miniature self-contained file system. It is required
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) * that it never runs out of space, is fast to access and update, and scales
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19) * logarithmically. The LEB properties tree is implemented as a wandering tree
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) * much like the TNC, and the LPT area has its own garbage collection.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) * The LPT has two slightly different forms called the "small model" and the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) * "big model". The small model is used when the entire LEB properties table
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) * can be written into a single eraseblock. In that case, garbage collection
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) * consists of just writing the whole table, which therefore makes all other
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) * eraseblocks reusable. In the case of the big model, dirty eraseblocks are
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) * selected for garbage collection, which consists of marking the clean nodes in
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) * that LEB as dirty, and then only the dirty nodes are written out. Also, in
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) * the case of the big model, a table of LEB numbers is saved so that the entire
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) * LPT does not to be scanned looking for empty eraseblocks when UBIFS is first
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) * mounted.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) #include "ubifs.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) #include <linux/crc16.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) #include <linux/math64.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) #include <linux/slab.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) * do_calc_lpt_geom - calculate sizes for the LPT area.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) * @c: the UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) * Calculate the sizes of LPT bit fields, nodes, and tree, based on the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) * properties of the flash and whether LPT is "big" (c->big_lpt).
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) static void do_calc_lpt_geom(struct ubifs_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) int i, n, bits, per_leb_wastage, max_pnode_cnt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) long long sz, tot_wastage;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) n = c->main_lebs + c->max_leb_cnt - c->leb_cnt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) max_pnode_cnt = DIV_ROUND_UP(n, UBIFS_LPT_FANOUT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) c->lpt_hght = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) n = UBIFS_LPT_FANOUT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) while (n < max_pnode_cnt) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) c->lpt_hght += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) n <<= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) c->pnode_cnt = DIV_ROUND_UP(c->main_lebs, UBIFS_LPT_FANOUT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) n = DIV_ROUND_UP(c->pnode_cnt, UBIFS_LPT_FANOUT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) c->nnode_cnt = n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) for (i = 1; i < c->lpt_hght; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) n = DIV_ROUND_UP(n, UBIFS_LPT_FANOUT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) c->nnode_cnt += n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) c->space_bits = fls(c->leb_size) - 3;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) c->lpt_lnum_bits = fls(c->lpt_lebs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) c->lpt_offs_bits = fls(c->leb_size - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) c->lpt_spc_bits = fls(c->leb_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) n = DIV_ROUND_UP(c->max_leb_cnt, UBIFS_LPT_FANOUT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) c->pcnt_bits = fls(n - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) c->lnum_bits = fls(c->max_leb_cnt - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80) bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) (c->big_lpt ? c->pcnt_bits : 0) +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82) (c->space_bits * 2 + 1) * UBIFS_LPT_FANOUT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) c->pnode_sz = (bits + 7) / 8;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) (c->big_lpt ? c->pcnt_bits : 0) +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) (c->lpt_lnum_bits + c->lpt_offs_bits) * UBIFS_LPT_FANOUT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) c->nnode_sz = (bits + 7) / 8;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) c->lpt_lebs * c->lpt_spc_bits * 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) c->ltab_sz = (bits + 7) / 8;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) c->lnum_bits * c->lsave_cnt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) c->lsave_sz = (bits + 7) / 8;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) /* Calculate the minimum LPT size */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) c->lpt_sz = (long long)c->pnode_cnt * c->pnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) c->lpt_sz += (long long)c->nnode_cnt * c->nnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) c->lpt_sz += c->ltab_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) c->lpt_sz += c->lsave_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) /* Add wastage */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) sz = c->lpt_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) per_leb_wastage = max_t(int, c->pnode_sz, c->nnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) sz += per_leb_wastage;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) tot_wastage = per_leb_wastage;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) while (sz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) sz += per_leb_wastage;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) sz -= c->leb_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) tot_wastage += per_leb_wastage;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) tot_wastage += ALIGN(sz, c->min_io_size) - sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) c->lpt_sz += tot_wastage;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) * ubifs_calc_lpt_geom - calculate and check sizes for the LPT area.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) * @c: the UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) int ubifs_calc_lpt_geom(struct ubifs_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) int lebs_needed;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) long long sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) do_calc_lpt_geom(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) /* Verify that lpt_lebs is big enough */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) sz = c->lpt_sz * 2; /* Must have at least 2 times the size */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) lebs_needed = div_u64(sz + c->leb_size - 1, c->leb_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) if (lebs_needed > c->lpt_lebs) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) ubifs_err(c, "too few LPT LEBs");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) /* Verify that ltab fits in a single LEB (since ltab is a single node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) if (c->ltab_sz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) ubifs_err(c, "LPT ltab too big");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) c->check_lpt_free = c->big_lpt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) * calc_dflt_lpt_geom - calculate default LPT geometry.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) * @c: the UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) * @main_lebs: number of main area LEBs is passed and returned here
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) * @big_lpt: whether the LPT area is "big" is returned here
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) * The size of the LPT area depends on parameters that themselves are dependent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) * on the size of the LPT area. This function, successively recalculates the LPT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) * area geometry until the parameters and resultant geometry are consistent.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) static int calc_dflt_lpt_geom(struct ubifs_info *c, int *main_lebs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) int *big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) int i, lebs_needed;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) long long sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) /* Start by assuming the minimum number of LPT LEBs */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) c->lpt_lebs = UBIFS_MIN_LPT_LEBS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) c->main_lebs = *main_lebs - c->lpt_lebs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) if (c->main_lebs <= 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) /* And assume we will use the small LPT model */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) c->big_lpt = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) * Calculate the geometry based on assumptions above and then see if it
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) * makes sense
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) do_calc_lpt_geom(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) /* Small LPT model must have lpt_sz < leb_size */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) if (c->lpt_sz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) /* Nope, so try again using big LPT model */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) c->big_lpt = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) do_calc_lpt_geom(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) /* Now check there are enough LPT LEBs */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) for (i = 0; i < 64 ; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) sz = c->lpt_sz * 4; /* Allow 4 times the size */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) lebs_needed = div_u64(sz + c->leb_size - 1, c->leb_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) if (lebs_needed > c->lpt_lebs) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) /* Not enough LPT LEBs so try again with more */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) c->lpt_lebs = lebs_needed;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) c->main_lebs = *main_lebs - c->lpt_lebs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) if (c->main_lebs <= 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) do_calc_lpt_geom(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) if (c->ltab_sz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) ubifs_err(c, "LPT ltab too big");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) *main_lebs = c->main_lebs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) *big_lpt = c->big_lpt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) * pack_bits - pack bit fields end-to-end.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) * @addr: address at which to pack (passed and next address returned)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) * @pos: bit position at which to pack (passed and next position returned)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) * @val: value to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) * @nrbits: number of bits of value to pack (1-32)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) static void pack_bits(const struct ubifs_info *c, uint8_t **addr, int *pos, uint32_t val, int nrbits)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) uint8_t *p = *addr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) int b = *pos;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) ubifs_assert(c, nrbits > 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) ubifs_assert(c, nrbits <= 32);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) ubifs_assert(c, *pos >= 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) ubifs_assert(c, *pos < 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) ubifs_assert(c, (val >> nrbits) == 0 || nrbits == 32);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) if (b) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) *p |= ((uint8_t)val) << b;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) nrbits += b;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) if (nrbits > 8) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) *++p = (uint8_t)(val >>= (8 - b));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) if (nrbits > 16) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) *++p = (uint8_t)(val >>= 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) if (nrbits > 24) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) *++p = (uint8_t)(val >>= 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) if (nrbits > 32)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) *++p = (uint8_t)(val >>= 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) *p = (uint8_t)val;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) if (nrbits > 8) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) *++p = (uint8_t)(val >>= 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) if (nrbits > 16) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) *++p = (uint8_t)(val >>= 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) if (nrbits > 24)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) *++p = (uint8_t)(val >>= 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) b = nrbits & 7;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) if (b == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) p++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) *addr = p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) *pos = b;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) * ubifs_unpack_bits - unpack bit fields.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) * @addr: address at which to unpack (passed and next address returned)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268) * @pos: bit position at which to unpack (passed and next position returned)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) * @nrbits: number of bits of value to unpack (1-32)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) * This functions returns the value unpacked.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) uint32_t ubifs_unpack_bits(const struct ubifs_info *c, uint8_t **addr, int *pos, int nrbits)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) const int k = 32 - nrbits;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) uint8_t *p = *addr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) int b = *pos;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) uint32_t val;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279) const int bytes = (nrbits + b + 7) >> 3;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) ubifs_assert(c, nrbits > 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282) ubifs_assert(c, nrbits <= 32);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) ubifs_assert(c, *pos >= 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) ubifs_assert(c, *pos < 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) if (b) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286) switch (bytes) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) case 2:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) val = p[1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290) case 3:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) val = p[1] | ((uint32_t)p[2] << 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) case 4:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) val = p[1] | ((uint32_t)p[2] << 8) |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295) ((uint32_t)p[3] << 16);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) case 5:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) val = p[1] | ((uint32_t)p[2] << 8) |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) ((uint32_t)p[3] << 16) |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300) ((uint32_t)p[4] << 24);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) val <<= (8 - b);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) val |= *p >> b;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) nrbits += b;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306) switch (bytes) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) case 1:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308) val = p[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) case 2:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) val = p[0] | ((uint32_t)p[1] << 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) case 3:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) val = p[0] | ((uint32_t)p[1] << 8) |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) ((uint32_t)p[2] << 16);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317) case 4:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) val = p[0] | ((uint32_t)p[1] << 8) |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) ((uint32_t)p[2] << 16) |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320) ((uint32_t)p[3] << 24);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) val <<= k;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325) val >>= k;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) b = nrbits & 7;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) p += nrbits >> 3;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328) *addr = p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) *pos = b;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) ubifs_assert(c, (val >> nrbits) == 0 || nrbits - b == 32);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331) return val;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) * ubifs_pack_pnode - pack all the bit fields of a pnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) * @buf: buffer into which to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) * @pnode: pnode to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340) void ubifs_pack_pnode(struct ubifs_info *c, void *buf,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) struct ubifs_pnode *pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343) uint8_t *addr = buf + UBIFS_LPT_CRC_BYTES;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344) int i, pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) uint16_t crc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) pack_bits(c, &addr, &pos, UBIFS_LPT_PNODE, UBIFS_LPT_TYPE_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349) pack_bits(c, &addr, &pos, pnode->num, c->pcnt_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) pack_bits(c, &addr, &pos, pnode->lprops[i].free >> 3,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352) c->space_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) pack_bits(c, &addr, &pos, pnode->lprops[i].dirty >> 3,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) c->space_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355) if (pnode->lprops[i].flags & LPROPS_INDEX)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) pack_bits(c, &addr, &pos, 1, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358) pack_bits(c, &addr, &pos, 0, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) c->pnode_sz - UBIFS_LPT_CRC_BYTES);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362) addr = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) pack_bits(c, &addr, &pos, crc, UBIFS_LPT_CRC_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) * ubifs_pack_nnode - pack all the bit fields of a nnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370) * @buf: buffer into which to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) * @nnode: nnode to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373) void ubifs_pack_nnode(struct ubifs_info *c, void *buf,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) struct ubifs_nnode *nnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) uint8_t *addr = buf + UBIFS_LPT_CRC_BYTES;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377) int i, pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) uint16_t crc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) pack_bits(c, &addr, &pos, UBIFS_LPT_NNODE, UBIFS_LPT_TYPE_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) pack_bits(c, &addr, &pos, nnode->num, c->pcnt_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) int lnum = nnode->nbranch[i].lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) if (lnum == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387) lnum = c->lpt_last + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) pack_bits(c, &addr, &pos, lnum - c->lpt_first, c->lpt_lnum_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) pack_bits(c, &addr, &pos, nnode->nbranch[i].offs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390) c->lpt_offs_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392) crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) c->nnode_sz - UBIFS_LPT_CRC_BYTES);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394) addr = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395) pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) pack_bits(c, &addr, &pos, crc, UBIFS_LPT_CRC_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) * ubifs_pack_ltab - pack the LPT's own lprops table.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) * @buf: buffer into which to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) * @ltab: LPT's own lprops table to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) void ubifs_pack_ltab(struct ubifs_info *c, void *buf,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406) struct ubifs_lpt_lprops *ltab)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) uint8_t *addr = buf + UBIFS_LPT_CRC_BYTES;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) int i, pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) uint16_t crc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412) pack_bits(c, &addr, &pos, UBIFS_LPT_LTAB, UBIFS_LPT_TYPE_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413) for (i = 0; i < c->lpt_lebs; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) pack_bits(c, &addr, &pos, ltab[i].free, c->lpt_spc_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415) pack_bits(c, &addr, &pos, ltab[i].dirty, c->lpt_spc_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) c->ltab_sz - UBIFS_LPT_CRC_BYTES);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) addr = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421) pack_bits(c, &addr, &pos, crc, UBIFS_LPT_CRC_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) * ubifs_pack_lsave - pack the LPT's save table.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) * @buf: buffer into which to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) * @lsave: LPT's save table to pack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430) void ubifs_pack_lsave(struct ubifs_info *c, void *buf, int *lsave)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432) uint8_t *addr = buf + UBIFS_LPT_CRC_BYTES;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) int i, pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) uint16_t crc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) pack_bits(c, &addr, &pos, UBIFS_LPT_LSAVE, UBIFS_LPT_TYPE_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) for (i = 0; i < c->lsave_cnt; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438) pack_bits(c, &addr, &pos, lsave[i], c->lnum_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) c->lsave_sz - UBIFS_LPT_CRC_BYTES);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441) addr = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) pack_bits(c, &addr, &pos, crc, UBIFS_LPT_CRC_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447) * ubifs_add_lpt_dirt - add dirty space to LPT LEB properties.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) * @lnum: LEB number to which to add dirty space
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) * @dirty: amount of dirty space to add
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454) if (!dirty || !lnum)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) dbg_lp("LEB %d add %d to %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457) lnum, dirty, c->ltab[lnum - c->lpt_first].dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458) ubifs_assert(c, lnum >= c->lpt_first && lnum <= c->lpt_last);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) c->ltab[lnum - c->lpt_first].dirty += dirty;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) * set_ltab - set LPT LEB properties.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) * @lnum: LEB number
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) * @free: amount of free space
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) * @dirty: amount of dirty space
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) static void set_ltab(struct ubifs_info *c, int lnum, int free, int dirty)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) dbg_lp("LEB %d free %d dirty %d to %d %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) lnum, c->ltab[lnum - c->lpt_first].free,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) c->ltab[lnum - c->lpt_first].dirty, free, dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) ubifs_assert(c, lnum >= c->lpt_first && lnum <= c->lpt_last);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475) c->ltab[lnum - c->lpt_first].free = free;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) c->ltab[lnum - c->lpt_first].dirty = dirty;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) * ubifs_add_nnode_dirt - add dirty space to LPT LEB properties.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482) * @nnode: nnode for which to add dirt
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) void ubifs_add_nnode_dirt(struct ubifs_info *c, struct ubifs_nnode *nnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) struct ubifs_nnode *np = nnode->parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) if (np)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489) ubifs_add_lpt_dirt(c, np->nbranch[nnode->iip].lnum,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) c->nnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492) ubifs_add_lpt_dirt(c, c->lpt_lnum, c->nnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) if (!(c->lpt_drty_flgs & LTAB_DIRTY)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494) c->lpt_drty_flgs |= LTAB_DIRTY;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495) ubifs_add_lpt_dirt(c, c->ltab_lnum, c->ltab_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 497) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 498) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 499)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 500) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 501) * add_pnode_dirt - add dirty space to LPT LEB properties.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 502) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 503) * @pnode: pnode for which to add dirt
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 504) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 505) static void add_pnode_dirt(struct ubifs_info *c, struct ubifs_pnode *pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 506) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 507) ubifs_add_lpt_dirt(c, pnode->parent->nbranch[pnode->iip].lnum,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 508) c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 509) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 510)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 511) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 512) * calc_nnode_num - calculate nnode number.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 513) * @row: the row in the tree (root is zero)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 514) * @col: the column in the row (leftmost is zero)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 515) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 516) * The nnode number is a number that uniquely identifies a nnode and can be used
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 517) * easily to traverse the tree from the root to that nnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 518) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 519) * This function calculates and returns the nnode number for the nnode at @row
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 520) * and @col.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 521) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 522) static int calc_nnode_num(int row, int col)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 523) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 524) int num, bits;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 525)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 526) num = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 527) while (row--) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 528) bits = (col & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 529) col >>= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 530) num <<= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 531) num |= bits;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 532) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 533) return num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 534) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 535)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 536) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 537) * calc_nnode_num_from_parent - calculate nnode number.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 538) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 539) * @parent: parent nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 540) * @iip: index in parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 541) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 542) * The nnode number is a number that uniquely identifies a nnode and can be used
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 543) * easily to traverse the tree from the root to that nnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 544) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 545) * This function calculates and returns the nnode number based on the parent's
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 546) * nnode number and the index in parent.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 547) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 548) static int calc_nnode_num_from_parent(const struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 549) struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 550) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 551) int num, shft;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 552)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 553) if (!parent)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 554) return 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 555) shft = (c->lpt_hght - parent->level) * UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 556) num = parent->num ^ (1 << shft);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 557) num |= (UBIFS_LPT_FANOUT + iip) << shft;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 558) return num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 559) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 560)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 561) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 562) * calc_pnode_num_from_parent - calculate pnode number.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 563) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 564) * @parent: parent nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 565) * @iip: index in parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 566) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 567) * The pnode number is a number that uniquely identifies a pnode and can be used
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 568) * easily to traverse the tree from the root to that pnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 569) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 570) * This function calculates and returns the pnode number based on the parent's
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 571) * nnode number and the index in parent.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 572) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 573) static int calc_pnode_num_from_parent(const struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 574) struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 575) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 576) int i, n = c->lpt_hght - 1, pnum = parent->num, num = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 577)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 578) for (i = 0; i < n; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 579) num <<= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 580) num |= pnum & (UBIFS_LPT_FANOUT - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 581) pnum >>= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 582) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 583) num <<= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 584) num |= iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 585) return num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 586) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 587)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 588) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 589) * ubifs_create_dflt_lpt - create default LPT.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 590) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 591) * @main_lebs: number of main area LEBs is passed and returned here
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 592) * @lpt_first: LEB number of first LPT LEB
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 593) * @lpt_lebs: number of LEBs for LPT is passed and returned here
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 594) * @big_lpt: use big LPT model is passed and returned here
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 595) * @hash: hash of the LPT is returned here
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 596) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 597) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 598) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 599) int ubifs_create_dflt_lpt(struct ubifs_info *c, int *main_lebs, int lpt_first,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 600) int *lpt_lebs, int *big_lpt, u8 *hash)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 601) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 602) int lnum, err = 0, node_sz, iopos, i, j, cnt, len, alen, row;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 603) int blnum, boffs, bsz, bcnt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 604) struct ubifs_pnode *pnode = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 605) struct ubifs_nnode *nnode = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 606) void *buf = NULL, *p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 607) struct ubifs_lpt_lprops *ltab = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 608) int *lsave = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 609) struct shash_desc *desc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 610)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 611) err = calc_dflt_lpt_geom(c, main_lebs, big_lpt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 612) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 613) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 614) *lpt_lebs = c->lpt_lebs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 615)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 616) /* Needed by 'ubifs_pack_nnode()' and 'set_ltab()' */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 617) c->lpt_first = lpt_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 618) /* Needed by 'set_ltab()' */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 619) c->lpt_last = lpt_first + c->lpt_lebs - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 620) /* Needed by 'ubifs_pack_lsave()' */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 621) c->main_first = c->leb_cnt - *main_lebs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 622)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 623) desc = ubifs_hash_get_desc(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 624) if (IS_ERR(desc))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 625) return PTR_ERR(desc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 626)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 627) lsave = kmalloc_array(c->lsave_cnt, sizeof(int), GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 628) pnode = kzalloc(sizeof(struct ubifs_pnode), GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 629) nnode = kzalloc(sizeof(struct ubifs_nnode), GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 630) buf = vmalloc(c->leb_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 631) ltab = vmalloc(array_size(sizeof(struct ubifs_lpt_lprops),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 632) c->lpt_lebs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 633) if (!pnode || !nnode || !buf || !ltab || !lsave) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 634) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 635) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 636) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 637)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 638) ubifs_assert(c, !c->ltab);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 639) c->ltab = ltab; /* Needed by set_ltab */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 640)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 641) /* Initialize LPT's own lprops */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 642) for (i = 0; i < c->lpt_lebs; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 643) ltab[i].free = c->leb_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 644) ltab[i].dirty = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 645) ltab[i].tgc = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 646) ltab[i].cmt = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 647) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 648)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 649) lnum = lpt_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 650) p = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 651) /* Number of leaf nodes (pnodes) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 652) cnt = c->pnode_cnt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 653)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 654) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 655) * The first pnode contains the LEB properties for the LEBs that contain
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 656) * the root inode node and the root index node of the index tree.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 657) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 658) node_sz = ALIGN(ubifs_idx_node_sz(c, 1), 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 659) iopos = ALIGN(node_sz, c->min_io_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 660) pnode->lprops[0].free = c->leb_size - iopos;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 661) pnode->lprops[0].dirty = iopos - node_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 662) pnode->lprops[0].flags = LPROPS_INDEX;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 663)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 664) node_sz = UBIFS_INO_NODE_SZ;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 665) iopos = ALIGN(node_sz, c->min_io_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 666) pnode->lprops[1].free = c->leb_size - iopos;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 667) pnode->lprops[1].dirty = iopos - node_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 668)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 669) for (i = 2; i < UBIFS_LPT_FANOUT; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 670) pnode->lprops[i].free = c->leb_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 671)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 672) /* Add first pnode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 673) ubifs_pack_pnode(c, p, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 674) err = ubifs_shash_update(c, desc, p, c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 675) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 676) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 677)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 678) p += c->pnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 679) len = c->pnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 680) pnode->num += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 681)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 682) /* Reset pnode values for remaining pnodes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 683) pnode->lprops[0].free = c->leb_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 684) pnode->lprops[0].dirty = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 685) pnode->lprops[0].flags = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 686)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 687) pnode->lprops[1].free = c->leb_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 688) pnode->lprops[1].dirty = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 689)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 690) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 691) * To calculate the internal node branches, we keep information about
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 692) * the level below.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 693) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 694) blnum = lnum; /* LEB number of level below */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 695) boffs = 0; /* Offset of level below */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 696) bcnt = cnt; /* Number of nodes in level below */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 697) bsz = c->pnode_sz; /* Size of nodes in level below */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 698)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 699) /* Add all remaining pnodes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 700) for (i = 1; i < cnt; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 701) if (len + c->pnode_sz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 702) alen = ALIGN(len, c->min_io_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 703) set_ltab(c, lnum, c->leb_size - alen, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 704) memset(p, 0xff, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 705) err = ubifs_leb_change(c, lnum++, buf, alen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 706) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 707) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 708) p = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 709) len = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 710) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 711) ubifs_pack_pnode(c, p, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 712) err = ubifs_shash_update(c, desc, p, c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 713) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 714) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 715)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 716) p += c->pnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 717) len += c->pnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 718) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 719) * pnodes are simply numbered left to right starting at zero,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 720) * which means the pnode number can be used easily to traverse
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 721) * down the tree to the corresponding pnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 722) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 723) pnode->num += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 724) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 725)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 726) row = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 727) for (i = UBIFS_LPT_FANOUT; cnt > i; i <<= UBIFS_LPT_FANOUT_SHIFT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 728) row += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 729) /* Add all nnodes, one level at a time */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 730) while (1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 731) /* Number of internal nodes (nnodes) at next level */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 732) cnt = DIV_ROUND_UP(cnt, UBIFS_LPT_FANOUT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 733) for (i = 0; i < cnt; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 734) if (len + c->nnode_sz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 735) alen = ALIGN(len, c->min_io_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 736) set_ltab(c, lnum, c->leb_size - alen,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 737) alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 738) memset(p, 0xff, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 739) err = ubifs_leb_change(c, lnum++, buf, alen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 740) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 741) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 742) p = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 743) len = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 744) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 745) /* Only 1 nnode at this level, so it is the root */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 746) if (cnt == 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 747) c->lpt_lnum = lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 748) c->lpt_offs = len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 749) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 750) /* Set branches to the level below */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 751) for (j = 0; j < UBIFS_LPT_FANOUT; j++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 752) if (bcnt) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 753) if (boffs + bsz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 754) blnum += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 755) boffs = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 756) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 757) nnode->nbranch[j].lnum = blnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 758) nnode->nbranch[j].offs = boffs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 759) boffs += bsz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 760) bcnt--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 761) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 762) nnode->nbranch[j].lnum = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 763) nnode->nbranch[j].offs = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 764) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 765) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 766) nnode->num = calc_nnode_num(row, i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 767) ubifs_pack_nnode(c, p, nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 768) p += c->nnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 769) len += c->nnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 770) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 771) /* Only 1 nnode at this level, so it is the root */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 772) if (cnt == 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 773) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 774) /* Update the information about the level below */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 775) bcnt = cnt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 776) bsz = c->nnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 777) row -= 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 778) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 779)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 780) if (*big_lpt) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 781) /* Need to add LPT's save table */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 782) if (len + c->lsave_sz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 783) alen = ALIGN(len, c->min_io_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 784) set_ltab(c, lnum, c->leb_size - alen, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 785) memset(p, 0xff, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 786) err = ubifs_leb_change(c, lnum++, buf, alen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 787) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 788) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 789) p = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 790) len = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 791) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 792)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 793) c->lsave_lnum = lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 794) c->lsave_offs = len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 795)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 796) for (i = 0; i < c->lsave_cnt && i < *main_lebs; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 797) lsave[i] = c->main_first + i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 798) for (; i < c->lsave_cnt; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 799) lsave[i] = c->main_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 800)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 801) ubifs_pack_lsave(c, p, lsave);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 802) p += c->lsave_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 803) len += c->lsave_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 804) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 805)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 806) /* Need to add LPT's own LEB properties table */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 807) if (len + c->ltab_sz > c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 808) alen = ALIGN(len, c->min_io_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 809) set_ltab(c, lnum, c->leb_size - alen, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 810) memset(p, 0xff, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 811) err = ubifs_leb_change(c, lnum++, buf, alen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 812) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 813) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 814) p = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 815) len = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 816) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 817)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 818) c->ltab_lnum = lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 819) c->ltab_offs = len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 820)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 821) /* Update ltab before packing it */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 822) len += c->ltab_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 823) alen = ALIGN(len, c->min_io_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 824) set_ltab(c, lnum, c->leb_size - alen, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 825)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 826) ubifs_pack_ltab(c, p, ltab);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 827) p += c->ltab_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 828)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 829) /* Write remaining buffer */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 830) memset(p, 0xff, alen - len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 831) err = ubifs_leb_change(c, lnum, buf, alen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 832) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 833) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 834)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 835) err = ubifs_shash_final(c, desc, hash);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 836) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 837) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 838)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 839) c->nhead_lnum = lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 840) c->nhead_offs = ALIGN(len, c->min_io_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 841)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 842) dbg_lp("space_bits %d", c->space_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 843) dbg_lp("lpt_lnum_bits %d", c->lpt_lnum_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 844) dbg_lp("lpt_offs_bits %d", c->lpt_offs_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 845) dbg_lp("lpt_spc_bits %d", c->lpt_spc_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 846) dbg_lp("pcnt_bits %d", c->pcnt_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 847) dbg_lp("lnum_bits %d", c->lnum_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 848) dbg_lp("pnode_sz %d", c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 849) dbg_lp("nnode_sz %d", c->nnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 850) dbg_lp("ltab_sz %d", c->ltab_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 851) dbg_lp("lsave_sz %d", c->lsave_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 852) dbg_lp("lsave_cnt %d", c->lsave_cnt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 853) dbg_lp("lpt_hght %d", c->lpt_hght);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 854) dbg_lp("big_lpt %d", c->big_lpt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 855) dbg_lp("LPT root is at %d:%d", c->lpt_lnum, c->lpt_offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 856) dbg_lp("LPT head is at %d:%d", c->nhead_lnum, c->nhead_offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 857) dbg_lp("LPT ltab is at %d:%d", c->ltab_lnum, c->ltab_offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 858) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 859) dbg_lp("LPT lsave is at %d:%d", c->lsave_lnum, c->lsave_offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 860) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 861) c->ltab = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 862) kfree(desc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 863) kfree(lsave);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 864) vfree(ltab);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 865) vfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 866) kfree(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 867) kfree(pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 868) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 869) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 870)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 871) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 872) * update_cats - add LEB properties of a pnode to LEB category lists and heaps.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 873) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 874) * @pnode: pnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 875) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 876) * When a pnode is loaded into memory, the LEB properties it contains are added,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 877) * by this function, to the LEB category lists and heaps.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 878) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 879) static void update_cats(struct ubifs_info *c, struct ubifs_pnode *pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 880) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 881) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 882)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 883) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 884) int cat = pnode->lprops[i].flags & LPROPS_CAT_MASK;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 885) int lnum = pnode->lprops[i].lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 886)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 887) if (!lnum)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 888) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 889) ubifs_add_to_cat(c, &pnode->lprops[i], cat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 890) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 891) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 892)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 893) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 894) * replace_cats - add LEB properties of a pnode to LEB category lists and heaps.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 895) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 896) * @old_pnode: pnode copied
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 897) * @new_pnode: pnode copy
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 898) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 899) * During commit it is sometimes necessary to copy a pnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 900) * (see dirty_cow_pnode). When that happens, references in
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 901) * category lists and heaps must be replaced. This function does that.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 902) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 903) static void replace_cats(struct ubifs_info *c, struct ubifs_pnode *old_pnode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 904) struct ubifs_pnode *new_pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 905) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 906) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 907)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 908) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 909) if (!new_pnode->lprops[i].lnum)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 910) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 911) ubifs_replace_cat(c, &old_pnode->lprops[i],
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 912) &new_pnode->lprops[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 913) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 914) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 915)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 916) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 917) * check_lpt_crc - check LPT node crc is correct.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 918) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 919) * @buf: buffer containing node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 920) * @len: length of node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 921) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 922) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 923) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 924) static int check_lpt_crc(const struct ubifs_info *c, void *buf, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 925) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 926) int pos = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 927) uint8_t *addr = buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 928) uint16_t crc, calc_crc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 929)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 930) crc = ubifs_unpack_bits(c, &addr, &pos, UBIFS_LPT_CRC_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 931) calc_crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 932) len - UBIFS_LPT_CRC_BYTES);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 933) if (crc != calc_crc) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 934) ubifs_err(c, "invalid crc in LPT node: crc %hx calc %hx",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 935) crc, calc_crc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 936) dump_stack();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 937) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 938) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 939) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 940) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 941)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 942) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 943) * check_lpt_type - check LPT node type is correct.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 944) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 945) * @addr: address of type bit field is passed and returned updated here
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 946) * @pos: position of type bit field is passed and returned updated here
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 947) * @type: expected type
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 948) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 949) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 950) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 951) static int check_lpt_type(const struct ubifs_info *c, uint8_t **addr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 952) int *pos, int type)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 953) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 954) int node_type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 955)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 956) node_type = ubifs_unpack_bits(c, addr, pos, UBIFS_LPT_TYPE_BITS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 957) if (node_type != type) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 958) ubifs_err(c, "invalid type (%d) in LPT node type %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 959) node_type, type);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 960) dump_stack();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 961) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 962) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 963) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 964) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 965)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 966) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 967) * unpack_pnode - unpack a pnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 968) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 969) * @buf: buffer containing packed pnode to unpack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 970) * @pnode: pnode structure to fill
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 971) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 972) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 973) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 974) static int unpack_pnode(const struct ubifs_info *c, void *buf,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 975) struct ubifs_pnode *pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 976) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 977) uint8_t *addr = buf + UBIFS_LPT_CRC_BYTES;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 978) int i, pos = 0, err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 979)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 980) err = check_lpt_type(c, &addr, &pos, UBIFS_LPT_PNODE);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 981) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 982) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 983) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 984) pnode->num = ubifs_unpack_bits(c, &addr, &pos, c->pcnt_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 985) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 986) struct ubifs_lprops * const lprops = &pnode->lprops[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 987)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 988) lprops->free = ubifs_unpack_bits(c, &addr, &pos, c->space_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 989) lprops->free <<= 3;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 990) lprops->dirty = ubifs_unpack_bits(c, &addr, &pos, c->space_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 991) lprops->dirty <<= 3;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 992)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 993) if (ubifs_unpack_bits(c, &addr, &pos, 1))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 994) lprops->flags = LPROPS_INDEX;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 995) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 996) lprops->flags = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 997) lprops->flags |= ubifs_categorize_lprops(c, lprops);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 998) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 999) err = check_lpt_crc(c, buf, c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1000) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1001) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1002)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1003) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1004) * ubifs_unpack_nnode - unpack a nnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1005) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1006) * @buf: buffer containing packed nnode to unpack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1007) * @nnode: nnode structure to fill
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1008) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1009) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1010) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1011) int ubifs_unpack_nnode(const struct ubifs_info *c, void *buf,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1012) struct ubifs_nnode *nnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1013) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1014) uint8_t *addr = buf + UBIFS_LPT_CRC_BYTES;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1015) int i, pos = 0, err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1016)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1017) err = check_lpt_type(c, &addr, &pos, UBIFS_LPT_NNODE);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1018) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1019) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1020) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1021) nnode->num = ubifs_unpack_bits(c, &addr, &pos, c->pcnt_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1022) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1023) int lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1024)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1025) lnum = ubifs_unpack_bits(c, &addr, &pos, c->lpt_lnum_bits) +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1026) c->lpt_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1027) if (lnum == c->lpt_last + 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1028) lnum = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1029) nnode->nbranch[i].lnum = lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1030) nnode->nbranch[i].offs = ubifs_unpack_bits(c, &addr, &pos,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1031) c->lpt_offs_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1032) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1033) err = check_lpt_crc(c, buf, c->nnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1034) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1035) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1036)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1037) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1038) * unpack_ltab - unpack the LPT's own lprops table.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1039) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1040) * @buf: buffer from which to unpack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1041) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1042) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1043) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1044) static int unpack_ltab(const struct ubifs_info *c, void *buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1045) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1046) uint8_t *addr = buf + UBIFS_LPT_CRC_BYTES;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1047) int i, pos = 0, err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1048)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1049) err = check_lpt_type(c, &addr, &pos, UBIFS_LPT_LTAB);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1050) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1051) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1052) for (i = 0; i < c->lpt_lebs; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1053) int free = ubifs_unpack_bits(c, &addr, &pos, c->lpt_spc_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1054) int dirty = ubifs_unpack_bits(c, &addr, &pos, c->lpt_spc_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1055)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1056) if (free < 0 || free > c->leb_size || dirty < 0 ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1057) dirty > c->leb_size || free + dirty > c->leb_size)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1058) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1059)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1060) c->ltab[i].free = free;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1061) c->ltab[i].dirty = dirty;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1062) c->ltab[i].tgc = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1063) c->ltab[i].cmt = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1064) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1065) err = check_lpt_crc(c, buf, c->ltab_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1066) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1067) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1068)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1069) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1070) * unpack_lsave - unpack the LPT's save table.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1071) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1072) * @buf: buffer from which to unpack
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1073) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1074) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1075) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1076) static int unpack_lsave(const struct ubifs_info *c, void *buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1077) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1078) uint8_t *addr = buf + UBIFS_LPT_CRC_BYTES;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1079) int i, pos = 0, err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1080)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1081) err = check_lpt_type(c, &addr, &pos, UBIFS_LPT_LSAVE);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1082) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1083) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1084) for (i = 0; i < c->lsave_cnt; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1085) int lnum = ubifs_unpack_bits(c, &addr, &pos, c->lnum_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1086)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1087) if (lnum < c->main_first || lnum >= c->leb_cnt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1088) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1089) c->lsave[i] = lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1090) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1091) err = check_lpt_crc(c, buf, c->lsave_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1092) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1093) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1094)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1095) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1096) * validate_nnode - validate a nnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1097) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1098) * @nnode: nnode to validate
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1099) * @parent: parent nnode (or NULL for the root nnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1100) * @iip: index in parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1101) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1102) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1103) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1104) static int validate_nnode(const struct ubifs_info *c, struct ubifs_nnode *nnode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1105) struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1106) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1107) int i, lvl, max_offs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1108)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1109) if (c->big_lpt) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1110) int num = calc_nnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1111)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1112) if (nnode->num != num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1113) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1114) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1115) lvl = parent ? parent->level - 1 : c->lpt_hght;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1116) if (lvl < 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1117) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1118) if (lvl == 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1119) max_offs = c->leb_size - c->pnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1120) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1121) max_offs = c->leb_size - c->nnode_sz;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1122) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1123) int lnum = nnode->nbranch[i].lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1124) int offs = nnode->nbranch[i].offs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1125)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1126) if (lnum == 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1127) if (offs != 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1128) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1129) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1130) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1131) if (lnum < c->lpt_first || lnum > c->lpt_last)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1132) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1133) if (offs < 0 || offs > max_offs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1134) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1135) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1136) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1137) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1138)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1139) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1140) * validate_pnode - validate a pnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1141) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1142) * @pnode: pnode to validate
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1143) * @parent: parent nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1144) * @iip: index in parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1145) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1146) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1147) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1148) static int validate_pnode(const struct ubifs_info *c, struct ubifs_pnode *pnode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1149) struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1150) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1151) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1152)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1153) if (c->big_lpt) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1154) int num = calc_pnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1155)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1156) if (pnode->num != num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1157) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1158) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1159) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1160) int free = pnode->lprops[i].free;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1161) int dirty = pnode->lprops[i].dirty;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1162)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1163) if (free < 0 || free > c->leb_size || free % c->min_io_size ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1164) (free & 7))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1165) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1166) if (dirty < 0 || dirty > c->leb_size || (dirty & 7))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1167) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1168) if (dirty + free > c->leb_size)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1169) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1170) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1171) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1172) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1173)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1174) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1175) * set_pnode_lnum - set LEB numbers on a pnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1176) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1177) * @pnode: pnode to update
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1178) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1179) * This function calculates the LEB numbers for the LEB properties it contains
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1180) * based on the pnode number.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1181) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1182) static void set_pnode_lnum(const struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1183) struct ubifs_pnode *pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1184) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1185) int i, lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1186)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1187) lnum = (pnode->num << UBIFS_LPT_FANOUT_SHIFT) + c->main_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1188) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1189) if (lnum >= c->leb_cnt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1190) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1191) pnode->lprops[i].lnum = lnum++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1192) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1193) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1194)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1195) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1196) * ubifs_read_nnode - read a nnode from flash and link it to the tree in memory.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1197) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1198) * @parent: parent nnode (or NULL for the root)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1199) * @iip: index in parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1200) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1201) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1202) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1203) int ubifs_read_nnode(struct ubifs_info *c, struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1204) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1205) struct ubifs_nbranch *branch = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1206) struct ubifs_nnode *nnode = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1207) void *buf = c->lpt_nod_buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1208) int err, lnum, offs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1209)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1210) if (parent) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1211) branch = &parent->nbranch[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1212) lnum = branch->lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1213) offs = branch->offs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1214) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1215) lnum = c->lpt_lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1216) offs = c->lpt_offs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1217) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1218) nnode = kzalloc(sizeof(struct ubifs_nnode), GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1219) if (!nnode) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1220) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1221) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1222) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1223) if (lnum == 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1224) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1225) * This nnode was not written which just means that the LEB
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1226) * properties in the subtree below it describe empty LEBs. We
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1227) * make the nnode as though we had read it, which in fact means
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1228) * doing almost nothing.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1229) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1230) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1231) nnode->num = calc_nnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1232) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1233) err = ubifs_leb_read(c, lnum, buf, offs, c->nnode_sz, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1234) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1235) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1236) err = ubifs_unpack_nnode(c, buf, nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1237) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1238) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1239) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1240) err = validate_nnode(c, nnode, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1241) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1242) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1243) if (!c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1244) nnode->num = calc_nnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1245) if (parent) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1246) branch->nnode = nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1247) nnode->level = parent->level - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1248) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1249) c->nroot = nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1250) nnode->level = c->lpt_hght;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1251) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1252) nnode->parent = parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1253) nnode->iip = iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1254) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1255)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1256) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1257) ubifs_err(c, "error %d reading nnode at %d:%d", err, lnum, offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1258) dump_stack();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1259) kfree(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1260) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1261) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1262)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1263) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1264) * read_pnode - read a pnode from flash and link it to the tree in memory.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1265) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1266) * @parent: parent nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1267) * @iip: index in parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1268) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1269) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1270) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1271) static int read_pnode(struct ubifs_info *c, struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1272) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1273) struct ubifs_nbranch *branch;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1274) struct ubifs_pnode *pnode = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1275) void *buf = c->lpt_nod_buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1276) int err, lnum, offs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1277)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1278) branch = &parent->nbranch[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1279) lnum = branch->lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1280) offs = branch->offs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1281) pnode = kzalloc(sizeof(struct ubifs_pnode), GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1282) if (!pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1283) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1284)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1285) if (lnum == 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1286) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1287) * This pnode was not written which just means that the LEB
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1288) * properties in it describe empty LEBs. We make the pnode as
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1289) * though we had read it.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1290) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1291) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1292)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1293) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1294) pnode->num = calc_pnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1295) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1296) struct ubifs_lprops * const lprops = &pnode->lprops[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1297)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1298) lprops->free = c->leb_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1299) lprops->flags = ubifs_categorize_lprops(c, lprops);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1300) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1301) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1302) err = ubifs_leb_read(c, lnum, buf, offs, c->pnode_sz, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1303) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1304) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1305) err = unpack_pnode(c, buf, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1306) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1307) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1308) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1309) err = validate_pnode(c, pnode, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1310) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1311) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1312) if (!c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1313) pnode->num = calc_pnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1314) branch->pnode = pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1315) pnode->parent = parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1316) pnode->iip = iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1317) set_pnode_lnum(c, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1318) c->pnodes_have += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1319) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1320)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1321) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1322) ubifs_err(c, "error %d reading pnode at %d:%d", err, lnum, offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1323) ubifs_dump_pnode(c, pnode, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1324) dump_stack();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1325) ubifs_err(c, "calc num: %d", calc_pnode_num_from_parent(c, parent, iip));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1326) kfree(pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1327) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1328) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1329)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1330) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1331) * read_ltab - read LPT's own lprops table.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1332) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1333) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1334) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1335) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1336) static int read_ltab(struct ubifs_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1337) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1338) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1339) void *buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1340)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1341) buf = vmalloc(c->ltab_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1342) if (!buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1343) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1344) err = ubifs_leb_read(c, c->ltab_lnum, buf, c->ltab_offs, c->ltab_sz, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1345) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1346) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1347) err = unpack_ltab(c, buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1348) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1349) vfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1350) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1351) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1352)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1353) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1354) * read_lsave - read LPT's save table.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1355) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1356) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1357) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1358) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1359) static int read_lsave(struct ubifs_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1360) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1361) int err, i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1362) void *buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1363)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1364) buf = vmalloc(c->lsave_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1365) if (!buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1366) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1367) err = ubifs_leb_read(c, c->lsave_lnum, buf, c->lsave_offs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1368) c->lsave_sz, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1369) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1370) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1371) err = unpack_lsave(c, buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1372) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1373) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1374) for (i = 0; i < c->lsave_cnt; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1375) int lnum = c->lsave[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1376) struct ubifs_lprops *lprops;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1377)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1378) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1379) * Due to automatic resizing, the values in the lsave table
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1380) * could be beyond the volume size - just ignore them.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1381) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1382) if (lnum >= c->leb_cnt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1383) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1384) lprops = ubifs_lpt_lookup(c, lnum);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1385) if (IS_ERR(lprops)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1386) err = PTR_ERR(lprops);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1387) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1388) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1389) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1390) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1391) vfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1392) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1393) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1394)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1395) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1396) * ubifs_get_nnode - get a nnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1397) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1398) * @parent: parent nnode (or NULL for the root)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1399) * @iip: index in parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1400) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1401) * This function returns a pointer to the nnode on success or a negative error
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1402) * code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1403) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1404) struct ubifs_nnode *ubifs_get_nnode(struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1405) struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1406) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1407) struct ubifs_nbranch *branch;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1408) struct ubifs_nnode *nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1409) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1410)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1411) branch = &parent->nbranch[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1412) nnode = branch->nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1413) if (nnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1414) return nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1415) err = ubifs_read_nnode(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1416) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1417) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1418) return branch->nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1419) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1420)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1421) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1422) * ubifs_get_pnode - get a pnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1423) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1424) * @parent: parent nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1425) * @iip: index in parent
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1426) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1427) * This function returns a pointer to the pnode on success or a negative error
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1428) * code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1429) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1430) struct ubifs_pnode *ubifs_get_pnode(struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1431) struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1432) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1433) struct ubifs_nbranch *branch;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1434) struct ubifs_pnode *pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1435) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1436)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1437) branch = &parent->nbranch[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1438) pnode = branch->pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1439) if (pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1440) return pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1441) err = read_pnode(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1442) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1443) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1444) update_cats(c, branch->pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1445) return branch->pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1446) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1447)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1448) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1449) * ubifs_pnode_lookup - lookup a pnode in the LPT.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1450) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1451) * @i: pnode number (0 to (main_lebs - 1) / UBIFS_LPT_FANOUT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1452) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1453) * This function returns a pointer to the pnode on success or a negative
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1454) * error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1455) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1456) struct ubifs_pnode *ubifs_pnode_lookup(struct ubifs_info *c, int i)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1457) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1458) int err, h, iip, shft;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1459) struct ubifs_nnode *nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1460)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1461) if (!c->nroot) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1462) err = ubifs_read_nnode(c, NULL, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1463) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1464) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1465) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1466) i <<= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1467) nnode = c->nroot;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1468) shft = c->lpt_hght * UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1469) for (h = 1; h < c->lpt_hght; h++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1470) iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1471) shft -= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1472) nnode = ubifs_get_nnode(c, nnode, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1473) if (IS_ERR(nnode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1474) return ERR_CAST(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1475) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1476) iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1477) return ubifs_get_pnode(c, nnode, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1478) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1479)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1480) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1481) * ubifs_lpt_lookup - lookup LEB properties in the LPT.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1482) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1483) * @lnum: LEB number to lookup
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1484) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1485) * This function returns a pointer to the LEB properties on success or a
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1486) * negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1487) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1488) struct ubifs_lprops *ubifs_lpt_lookup(struct ubifs_info *c, int lnum)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1489) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1490) int i, iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1491) struct ubifs_pnode *pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1492)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1493) i = lnum - c->main_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1494) pnode = ubifs_pnode_lookup(c, i >> UBIFS_LPT_FANOUT_SHIFT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1495) if (IS_ERR(pnode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1496) return ERR_CAST(pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1497) iip = (i & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1498) dbg_lp("LEB %d, free %d, dirty %d, flags %d", lnum,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1499) pnode->lprops[iip].free, pnode->lprops[iip].dirty,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1500) pnode->lprops[iip].flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1501) return &pnode->lprops[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1502) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1503)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1504) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1505) * dirty_cow_nnode - ensure a nnode is not being committed.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1506) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1507) * @nnode: nnode to check
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1508) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1509) * Returns dirtied nnode on success or negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1510) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1511) static struct ubifs_nnode *dirty_cow_nnode(struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1512) struct ubifs_nnode *nnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1513) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1514) struct ubifs_nnode *n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1515) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1516)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1517) if (!test_bit(COW_CNODE, &nnode->flags)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1518) /* nnode is not being committed */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1519) if (!test_and_set_bit(DIRTY_CNODE, &nnode->flags)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1520) c->dirty_nn_cnt += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1521) ubifs_add_nnode_dirt(c, nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1522) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1523) return nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1524) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1525)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1526) /* nnode is being committed, so copy it */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1527) n = kmemdup(nnode, sizeof(struct ubifs_nnode), GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1528) if (unlikely(!n))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1529) return ERR_PTR(-ENOMEM);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1530)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1531) n->cnext = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1532) __set_bit(DIRTY_CNODE, &n->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1533) __clear_bit(COW_CNODE, &n->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1534)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1535) /* The children now have new parent */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1536) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1537) struct ubifs_nbranch *branch = &n->nbranch[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1538)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1539) if (branch->cnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1540) branch->cnode->parent = n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1541) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1542)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1543) ubifs_assert(c, !test_bit(OBSOLETE_CNODE, &nnode->flags));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1544) __set_bit(OBSOLETE_CNODE, &nnode->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1545)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1546) c->dirty_nn_cnt += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1547) ubifs_add_nnode_dirt(c, nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1548) if (nnode->parent)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1549) nnode->parent->nbranch[n->iip].nnode = n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1550) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1551) c->nroot = n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1552) return n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1553) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1554)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1555) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1556) * dirty_cow_pnode - ensure a pnode is not being committed.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1557) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1558) * @pnode: pnode to check
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1559) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1560) * Returns dirtied pnode on success or negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1561) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1562) static struct ubifs_pnode *dirty_cow_pnode(struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1563) struct ubifs_pnode *pnode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1564) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1565) struct ubifs_pnode *p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1566)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1567) if (!test_bit(COW_CNODE, &pnode->flags)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1568) /* pnode is not being committed */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1569) if (!test_and_set_bit(DIRTY_CNODE, &pnode->flags)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1570) c->dirty_pn_cnt += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1571) add_pnode_dirt(c, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1572) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1573) return pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1574) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1575)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1576) /* pnode is being committed, so copy it */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1577) p = kmemdup(pnode, sizeof(struct ubifs_pnode), GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1578) if (unlikely(!p))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1579) return ERR_PTR(-ENOMEM);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1580)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1581) p->cnext = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1582) __set_bit(DIRTY_CNODE, &p->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1583) __clear_bit(COW_CNODE, &p->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1584) replace_cats(c, pnode, p);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1585)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1586) ubifs_assert(c, !test_bit(OBSOLETE_CNODE, &pnode->flags));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1587) __set_bit(OBSOLETE_CNODE, &pnode->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1588)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1589) c->dirty_pn_cnt += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1590) add_pnode_dirt(c, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1591) pnode->parent->nbranch[p->iip].pnode = p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1592) return p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1593) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1594)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1595) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1596) * ubifs_lpt_lookup_dirty - lookup LEB properties in the LPT.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1597) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1598) * @lnum: LEB number to lookup
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1599) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1600) * This function returns a pointer to the LEB properties on success or a
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1601) * negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1602) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1603) struct ubifs_lprops *ubifs_lpt_lookup_dirty(struct ubifs_info *c, int lnum)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1604) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1605) int err, i, h, iip, shft;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1606) struct ubifs_nnode *nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1607) struct ubifs_pnode *pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1608)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1609) if (!c->nroot) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1610) err = ubifs_read_nnode(c, NULL, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1611) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1612) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1613) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1614) nnode = c->nroot;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1615) nnode = dirty_cow_nnode(c, nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1616) if (IS_ERR(nnode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1617) return ERR_CAST(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1618) i = lnum - c->main_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1619) shft = c->lpt_hght * UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1620) for (h = 1; h < c->lpt_hght; h++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1621) iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1622) shft -= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1623) nnode = ubifs_get_nnode(c, nnode, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1624) if (IS_ERR(nnode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1625) return ERR_CAST(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1626) nnode = dirty_cow_nnode(c, nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1627) if (IS_ERR(nnode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1628) return ERR_CAST(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1629) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1630) iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1631) pnode = ubifs_get_pnode(c, nnode, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1632) if (IS_ERR(pnode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1633) return ERR_CAST(pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1634) pnode = dirty_cow_pnode(c, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1635) if (IS_ERR(pnode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1636) return ERR_CAST(pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1637) iip = (i & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1638) dbg_lp("LEB %d, free %d, dirty %d, flags %d", lnum,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1639) pnode->lprops[iip].free, pnode->lprops[iip].dirty,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1640) pnode->lprops[iip].flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1641) ubifs_assert(c, test_bit(DIRTY_CNODE, &pnode->flags));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1642) return &pnode->lprops[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1643) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1644)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1645) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1646) * ubifs_lpt_calc_hash - Calculate hash of the LPT pnodes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1647) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1648) * @hash: the returned hash of the LPT pnodes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1649) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1650) * This function iterates over the LPT pnodes and creates a hash over them.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1651) * Returns 0 for success or a negative error code otherwise.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1652) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1653) int ubifs_lpt_calc_hash(struct ubifs_info *c, u8 *hash)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1654) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1655) struct ubifs_nnode *nnode, *nn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1656) struct ubifs_cnode *cnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1657) struct shash_desc *desc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1658) int iip = 0, i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1659) int bufsiz = max_t(int, c->nnode_sz, c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1660) void *buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1661) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1662)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1663) if (!ubifs_authenticated(c))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1664) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1665)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1666) if (!c->nroot) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1667) err = ubifs_read_nnode(c, NULL, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1668) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1669) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1670) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1671)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1672) desc = ubifs_hash_get_desc(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1673) if (IS_ERR(desc))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1674) return PTR_ERR(desc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1675)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1676) buf = kmalloc(bufsiz, GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1677) if (!buf) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1678) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1679) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1680) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1681)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1682) cnode = (struct ubifs_cnode *)c->nroot;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1683)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1684) while (cnode) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1685) nnode = cnode->parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1686) nn = (struct ubifs_nnode *)cnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1687) if (cnode->level > 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1688) while (iip < UBIFS_LPT_FANOUT) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1689) if (nn->nbranch[iip].lnum == 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1690) /* Go right */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1691) iip++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1692) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1693) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1694)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1695) nnode = ubifs_get_nnode(c, nn, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1696) if (IS_ERR(nnode)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1697) err = PTR_ERR(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1698) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1699) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1700)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1701) /* Go down */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1702) iip = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1703) cnode = (struct ubifs_cnode *)nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1704) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1705) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1706) if (iip < UBIFS_LPT_FANOUT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1707) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1708) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1709) struct ubifs_pnode *pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1710)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1711) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1712) if (nn->nbranch[i].lnum == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1713) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1714) pnode = ubifs_get_pnode(c, nn, i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1715) if (IS_ERR(pnode)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1716) err = PTR_ERR(pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1717) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1718) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1719)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1720) ubifs_pack_pnode(c, buf, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1721) err = ubifs_shash_update(c, desc, buf,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1722) c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1723) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1724) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1725) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1726) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1727) /* Go up and to the right */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1728) iip = cnode->iip + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1729) cnode = (struct ubifs_cnode *)nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1730) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1731)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1732) err = ubifs_shash_final(c, desc, hash);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1733) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1734) kfree(desc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1735) kfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1736)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1737) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1738) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1739)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1740) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1741) * lpt_check_hash - check the hash of the LPT.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1742) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1743) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1744) * This function calculates a hash over all pnodes in the LPT and compares it with
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1745) * the hash stored in the master node. Returns %0 on success and a negative error
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1746) * code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1747) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1748) static int lpt_check_hash(struct ubifs_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1749) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1750) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1751) u8 hash[UBIFS_HASH_ARR_SZ];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1752)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1753) if (!ubifs_authenticated(c))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1754) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1755)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1756) err = ubifs_lpt_calc_hash(c, hash);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1757) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1758) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1759)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1760) if (ubifs_check_hash(c, c->mst_node->hash_lpt, hash)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1761) err = -EPERM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1762) ubifs_err(c, "Failed to authenticate LPT");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1763) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1764) err = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1765) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1766)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1767) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1768) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1769)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1770) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1771) * lpt_init_rd - initialize the LPT for reading.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1772) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1773) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1774) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1775) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1776) static int lpt_init_rd(struct ubifs_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1777) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1778) int err, i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1779)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1780) c->ltab = vmalloc(array_size(sizeof(struct ubifs_lpt_lprops),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1781) c->lpt_lebs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1782) if (!c->ltab)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1783) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1784)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1785) i = max_t(int, c->nnode_sz, c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1786) c->lpt_nod_buf = kmalloc(i, GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1787) if (!c->lpt_nod_buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1788) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1789)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1790) for (i = 0; i < LPROPS_HEAP_CNT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1791) c->lpt_heap[i].arr = kmalloc_array(LPT_HEAP_SZ,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1792) sizeof(void *),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1793) GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1794) if (!c->lpt_heap[i].arr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1795) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1796) c->lpt_heap[i].cnt = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1797) c->lpt_heap[i].max_cnt = LPT_HEAP_SZ;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1798) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1799)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1800) c->dirty_idx.arr = kmalloc_array(LPT_HEAP_SZ, sizeof(void *),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1801) GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1802) if (!c->dirty_idx.arr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1803) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1804) c->dirty_idx.cnt = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1805) c->dirty_idx.max_cnt = LPT_HEAP_SZ;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1806)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1807) err = read_ltab(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1808) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1809) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1810)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1811) err = lpt_check_hash(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1812) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1813) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1814)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1815) dbg_lp("space_bits %d", c->space_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1816) dbg_lp("lpt_lnum_bits %d", c->lpt_lnum_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1817) dbg_lp("lpt_offs_bits %d", c->lpt_offs_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1818) dbg_lp("lpt_spc_bits %d", c->lpt_spc_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1819) dbg_lp("pcnt_bits %d", c->pcnt_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1820) dbg_lp("lnum_bits %d", c->lnum_bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1821) dbg_lp("pnode_sz %d", c->pnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1822) dbg_lp("nnode_sz %d", c->nnode_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1823) dbg_lp("ltab_sz %d", c->ltab_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1824) dbg_lp("lsave_sz %d", c->lsave_sz);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1825) dbg_lp("lsave_cnt %d", c->lsave_cnt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1826) dbg_lp("lpt_hght %d", c->lpt_hght);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1827) dbg_lp("big_lpt %d", c->big_lpt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1828) dbg_lp("LPT root is at %d:%d", c->lpt_lnum, c->lpt_offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1829) dbg_lp("LPT head is at %d:%d", c->nhead_lnum, c->nhead_offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1830) dbg_lp("LPT ltab is at %d:%d", c->ltab_lnum, c->ltab_offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1831) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1832) dbg_lp("LPT lsave is at %d:%d", c->lsave_lnum, c->lsave_offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1833)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1834) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1835) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1836)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1837) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1838) * lpt_init_wr - initialize the LPT for writing.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1839) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1840) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1841) * 'lpt_init_rd()' must have been called already.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1842) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1843) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1844) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1845) static int lpt_init_wr(struct ubifs_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1846) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1847) int err, i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1848)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1849) c->ltab_cmt = vmalloc(array_size(sizeof(struct ubifs_lpt_lprops),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1850) c->lpt_lebs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1851) if (!c->ltab_cmt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1852) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1853)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1854) c->lpt_buf = vmalloc(c->leb_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1855) if (!c->lpt_buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1856) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1857)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1858) if (c->big_lpt) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1859) c->lsave = kmalloc_array(c->lsave_cnt, sizeof(int), GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1860) if (!c->lsave)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1861) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1862) err = read_lsave(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1863) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1864) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1865) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1866)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1867) for (i = 0; i < c->lpt_lebs; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1868) if (c->ltab[i].free == c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1869) err = ubifs_leb_unmap(c, i + c->lpt_first);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1870) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1871) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1872) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1873)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1874) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1875) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1876)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1877) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1878) * ubifs_lpt_init - initialize the LPT.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1879) * @c: UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1880) * @rd: whether to initialize lpt for reading
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1881) * @wr: whether to initialize lpt for writing
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1882) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1883) * For mounting 'rw', @rd and @wr are both true. For mounting 'ro', @rd is true
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1884) * and @wr is false. For mounting from 'ro' to 'rw', @rd is false and @wr is
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1885) * true.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1886) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1887) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1888) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1889) int ubifs_lpt_init(struct ubifs_info *c, int rd, int wr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1890) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1891) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1892)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1893) if (rd) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1894) err = lpt_init_rd(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1895) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1896) goto out_err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1897) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1898)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1899) if (wr) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1900) err = lpt_init_wr(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1901) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1902) goto out_err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1903) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1904)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1905) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1906)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1907) out_err:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1908) if (wr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1909) ubifs_lpt_free(c, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1910) if (rd)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1911) ubifs_lpt_free(c, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1912) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1913) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1914)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1915) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1916) * struct lpt_scan_node - somewhere to put nodes while we scan LPT.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1917) * @nnode: where to keep a nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1918) * @pnode: where to keep a pnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1919) * @cnode: where to keep a cnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1920) * @in_tree: is the node in the tree in memory
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1921) * @ptr.nnode: pointer to the nnode (if it is an nnode) which may be here or in
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1922) * the tree
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1923) * @ptr.pnode: ditto for pnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1924) * @ptr.cnode: ditto for cnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1925) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1926) struct lpt_scan_node {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1927) union {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1928) struct ubifs_nnode nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1929) struct ubifs_pnode pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1930) struct ubifs_cnode cnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1931) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1932) int in_tree;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1933) union {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1934) struct ubifs_nnode *nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1935) struct ubifs_pnode *pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1936) struct ubifs_cnode *cnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1937) } ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1938) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1939)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1940) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1941) * scan_get_nnode - for the scan, get a nnode from either the tree or flash.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1942) * @c: the UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1943) * @path: where to put the nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1944) * @parent: parent of the nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1945) * @iip: index in parent of the nnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1946) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1947) * This function returns a pointer to the nnode on success or a negative error
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1948) * code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1949) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1950) static struct ubifs_nnode *scan_get_nnode(struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1951) struct lpt_scan_node *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1952) struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1953) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1954) struct ubifs_nbranch *branch;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1955) struct ubifs_nnode *nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1956) void *buf = c->lpt_nod_buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1957) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1958)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1959) branch = &parent->nbranch[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1960) nnode = branch->nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1961) if (nnode) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1962) path->in_tree = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1963) path->ptr.nnode = nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1964) return nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1965) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1966) nnode = &path->nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1967) path->in_tree = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1968) path->ptr.nnode = nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1969) memset(nnode, 0, sizeof(struct ubifs_nnode));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1970) if (branch->lnum == 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1971) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1972) * This nnode was not written which just means that the LEB
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1973) * properties in the subtree below it describe empty LEBs. We
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1974) * make the nnode as though we had read it, which in fact means
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1975) * doing almost nothing.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1976) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1977) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1978) nnode->num = calc_nnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1979) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1980) err = ubifs_leb_read(c, branch->lnum, buf, branch->offs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1981) c->nnode_sz, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1982) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1983) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1984) err = ubifs_unpack_nnode(c, buf, nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1985) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1986) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1987) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1988) err = validate_nnode(c, nnode, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1989) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1990) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1991) if (!c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1992) nnode->num = calc_nnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1993) nnode->level = parent->level - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1994) nnode->parent = parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1995) nnode->iip = iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1996) return nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1997) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1998)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1999) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2000) * scan_get_pnode - for the scan, get a pnode from either the tree or flash.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2001) * @c: the UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2002) * @path: where to put the pnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2003) * @parent: parent of the pnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2004) * @iip: index in parent of the pnode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2005) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2006) * This function returns a pointer to the pnode on success or a negative error
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2007) * code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2008) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2009) static struct ubifs_pnode *scan_get_pnode(struct ubifs_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2010) struct lpt_scan_node *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2011) struct ubifs_nnode *parent, int iip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2012) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2013) struct ubifs_nbranch *branch;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2014) struct ubifs_pnode *pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2015) void *buf = c->lpt_nod_buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2016) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2017)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2018) branch = &parent->nbranch[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2019) pnode = branch->pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2020) if (pnode) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2021) path->in_tree = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2022) path->ptr.pnode = pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2023) return pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2024) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2025) pnode = &path->pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2026) path->in_tree = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2027) path->ptr.pnode = pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2028) memset(pnode, 0, sizeof(struct ubifs_pnode));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2029) if (branch->lnum == 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2030) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2031) * This pnode was not written which just means that the LEB
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2032) * properties in it describe empty LEBs. We make the pnode as
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2033) * though we had read it.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2034) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2035) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2036)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2037) if (c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2038) pnode->num = calc_pnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2039) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2040) struct ubifs_lprops * const lprops = &pnode->lprops[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2041)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2042) lprops->free = c->leb_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2043) lprops->flags = ubifs_categorize_lprops(c, lprops);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2044) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2045) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2046) ubifs_assert(c, branch->lnum >= c->lpt_first &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2047) branch->lnum <= c->lpt_last);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2048) ubifs_assert(c, branch->offs >= 0 && branch->offs < c->leb_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2049) err = ubifs_leb_read(c, branch->lnum, buf, branch->offs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2050) c->pnode_sz, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2051) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2052) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2053) err = unpack_pnode(c, buf, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2054) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2055) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2056) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2057) err = validate_pnode(c, pnode, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2058) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2059) return ERR_PTR(err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2060) if (!c->big_lpt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2061) pnode->num = calc_pnode_num_from_parent(c, parent, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2062) pnode->parent = parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2063) pnode->iip = iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2064) set_pnode_lnum(c, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2065) return pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2066) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2067)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2068) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2069) * ubifs_lpt_scan_nolock - scan the LPT.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2070) * @c: the UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2071) * @start_lnum: LEB number from which to start scanning
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2072) * @end_lnum: LEB number at which to stop scanning
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2073) * @scan_cb: callback function called for each lprops
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2074) * @data: data to be passed to the callback function
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2075) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2076) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2077) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2078) int ubifs_lpt_scan_nolock(struct ubifs_info *c, int start_lnum, int end_lnum,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2079) ubifs_lpt_scan_callback scan_cb, void *data)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2080) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2081) int err = 0, i, h, iip, shft;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2082) struct ubifs_nnode *nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2083) struct ubifs_pnode *pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2084) struct lpt_scan_node *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2085)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2086) if (start_lnum == -1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2087) start_lnum = end_lnum + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2088) if (start_lnum >= c->leb_cnt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2089) start_lnum = c->main_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2090) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2091)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2092) ubifs_assert(c, start_lnum >= c->main_first && start_lnum < c->leb_cnt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2093) ubifs_assert(c, end_lnum >= c->main_first && end_lnum < c->leb_cnt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2094)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2095) if (!c->nroot) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2096) err = ubifs_read_nnode(c, NULL, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2097) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2098) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2099) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2100)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2101) path = kmalloc_array(c->lpt_hght + 1, sizeof(struct lpt_scan_node),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2102) GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2103) if (!path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2104) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2105)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2106) path[0].ptr.nnode = c->nroot;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2107) path[0].in_tree = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2108) again:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2109) /* Descend to the pnode containing start_lnum */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2110) nnode = c->nroot;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2111) i = start_lnum - c->main_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2112) shft = c->lpt_hght * UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2113) for (h = 1; h < c->lpt_hght; h++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2114) iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2115) shft -= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2116) nnode = scan_get_nnode(c, path + h, nnode, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2117) if (IS_ERR(nnode)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2118) err = PTR_ERR(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2119) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2120) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2121) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2122) iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2123) pnode = scan_get_pnode(c, path + h, nnode, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2124) if (IS_ERR(pnode)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2125) err = PTR_ERR(pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2126) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2127) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2128) iip = (i & (UBIFS_LPT_FANOUT - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2129)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2130) /* Loop for each lprops */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2131) while (1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2132) struct ubifs_lprops *lprops = &pnode->lprops[iip];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2133) int ret, lnum = lprops->lnum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2134)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2135) ret = scan_cb(c, lprops, path[h].in_tree, data);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2136) if (ret < 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2137) err = ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2138) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2139) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2140) if (ret & LPT_SCAN_ADD) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2141) /* Add all the nodes in path to the tree in memory */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2142) for (h = 1; h < c->lpt_hght; h++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2143) const size_t sz = sizeof(struct ubifs_nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2144) struct ubifs_nnode *parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2145)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2146) if (path[h].in_tree)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2147) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2148) nnode = kmemdup(&path[h].nnode, sz, GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2149) if (!nnode) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2150) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2151) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2152) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2153) parent = nnode->parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2154) parent->nbranch[nnode->iip].nnode = nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2155) path[h].ptr.nnode = nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2156) path[h].in_tree = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2157) path[h + 1].cnode.parent = nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2158) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2159) if (path[h].in_tree)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2160) ubifs_ensure_cat(c, lprops);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2161) else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2162) const size_t sz = sizeof(struct ubifs_pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2163) struct ubifs_nnode *parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2164)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2165) pnode = kmemdup(&path[h].pnode, sz, GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2166) if (!pnode) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2167) err = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2168) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2169) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2170) parent = pnode->parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2171) parent->nbranch[pnode->iip].pnode = pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2172) path[h].ptr.pnode = pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2173) path[h].in_tree = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2174) update_cats(c, pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2175) c->pnodes_have += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2176) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2177) err = dbg_check_lpt_nodes(c, (struct ubifs_cnode *)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2178) c->nroot, 0, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2179) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2180) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2181) err = dbg_check_cats(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2182) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2183) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2184) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2185) if (ret & LPT_SCAN_STOP) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2186) err = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2187) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2188) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2189) /* Get the next lprops */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2190) if (lnum == end_lnum) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2191) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2192) * We got to the end without finding what we were
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2193) * looking for
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2194) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2195) err = -ENOSPC;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2196) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2197) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2198) if (lnum + 1 >= c->leb_cnt) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2199) /* Wrap-around to the beginning */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2200) start_lnum = c->main_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2201) goto again;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2202) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2203) if (iip + 1 < UBIFS_LPT_FANOUT) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2204) /* Next lprops is in the same pnode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2205) iip += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2206) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2207) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2208) /* We need to get the next pnode. Go up until we can go right */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2209) iip = pnode->iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2210) while (1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2211) h -= 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2212) ubifs_assert(c, h >= 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2213) nnode = path[h].ptr.nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2214) if (iip + 1 < UBIFS_LPT_FANOUT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2215) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2216) iip = nnode->iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2217) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2218) /* Go right */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2219) iip += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2220) /* Descend to the pnode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2221) h += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2222) for (; h < c->lpt_hght; h++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2223) nnode = scan_get_nnode(c, path + h, nnode, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2224) if (IS_ERR(nnode)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2225) err = PTR_ERR(nnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2226) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2227) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2228) iip = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2229) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2230) pnode = scan_get_pnode(c, path + h, nnode, iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2231) if (IS_ERR(pnode)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2232) err = PTR_ERR(pnode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2233) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2234) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2235) iip = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2236) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2237) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2238) kfree(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2239) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2240) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2241)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2242) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2243) * dbg_chk_pnode - check a pnode.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2244) * @c: the UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2245) * @pnode: pnode to check
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2246) * @col: pnode column
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2247) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2248) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2249) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2250) static int dbg_chk_pnode(struct ubifs_info *c, struct ubifs_pnode *pnode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2251) int col)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2252) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2253) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2254)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2255) if (pnode->num != col) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2256) ubifs_err(c, "pnode num %d expected %d parent num %d iip %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2257) pnode->num, col, pnode->parent->num, pnode->iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2258) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2259) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2260) for (i = 0; i < UBIFS_LPT_FANOUT; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2261) struct ubifs_lprops *lp, *lprops = &pnode->lprops[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2262) int lnum = (pnode->num << UBIFS_LPT_FANOUT_SHIFT) + i +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2263) c->main_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2264) int found, cat = lprops->flags & LPROPS_CAT_MASK;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2265) struct ubifs_lpt_heap *heap;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2266) struct list_head *list = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2267)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2268) if (lnum >= c->leb_cnt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2269) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2270) if (lprops->lnum != lnum) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2271) ubifs_err(c, "bad LEB number %d expected %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2272) lprops->lnum, lnum);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2273) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2274) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2275) if (lprops->flags & LPROPS_TAKEN) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2276) if (cat != LPROPS_UNCAT) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2277) ubifs_err(c, "LEB %d taken but not uncat %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2278) lprops->lnum, cat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2279) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2280) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2281) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2282) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2283) if (lprops->flags & LPROPS_INDEX) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2284) switch (cat) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2285) case LPROPS_UNCAT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2286) case LPROPS_DIRTY_IDX:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2287) case LPROPS_FRDI_IDX:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2288) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2289) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2290) ubifs_err(c, "LEB %d index but cat %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2291) lprops->lnum, cat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2292) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2293) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2294) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2295) switch (cat) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2296) case LPROPS_UNCAT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2297) case LPROPS_DIRTY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2298) case LPROPS_FREE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2299) case LPROPS_EMPTY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2300) case LPROPS_FREEABLE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2301) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2302) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2303) ubifs_err(c, "LEB %d not index but cat %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2304) lprops->lnum, cat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2305) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2306) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2307) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2308) switch (cat) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2309) case LPROPS_UNCAT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2310) list = &c->uncat_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2311) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2312) case LPROPS_EMPTY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2313) list = &c->empty_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2314) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2315) case LPROPS_FREEABLE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2316) list = &c->freeable_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2317) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2318) case LPROPS_FRDI_IDX:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2319) list = &c->frdi_idx_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2320) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2321) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2322) found = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2323) switch (cat) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2324) case LPROPS_DIRTY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2325) case LPROPS_DIRTY_IDX:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2326) case LPROPS_FREE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2327) heap = &c->lpt_heap[cat - 1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2328) if (lprops->hpos < heap->cnt &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2329) heap->arr[lprops->hpos] == lprops)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2330) found = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2331) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2332) case LPROPS_UNCAT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2333) case LPROPS_EMPTY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2334) case LPROPS_FREEABLE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2335) case LPROPS_FRDI_IDX:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2336) list_for_each_entry(lp, list, list)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2337) if (lprops == lp) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2338) found = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2339) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2340) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2341) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2342) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2343) if (!found) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2344) ubifs_err(c, "LEB %d cat %d not found in cat heap/list",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2345) lprops->lnum, cat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2346) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2347) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2348) switch (cat) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2349) case LPROPS_EMPTY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2350) if (lprops->free != c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2351) ubifs_err(c, "LEB %d cat %d free %d dirty %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2352) lprops->lnum, cat, lprops->free,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2353) lprops->dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2354) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2355) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2356) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2357) case LPROPS_FREEABLE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2358) case LPROPS_FRDI_IDX:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2359) if (lprops->free + lprops->dirty != c->leb_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2360) ubifs_err(c, "LEB %d cat %d free %d dirty %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2361) lprops->lnum, cat, lprops->free,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2362) lprops->dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2363) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2364) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2365) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2366) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2367) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2368) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2369) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2370)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2371) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2372) * dbg_check_lpt_nodes - check nnodes and pnodes.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2373) * @c: the UBIFS file-system description object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2374) * @cnode: next cnode (nnode or pnode) to check
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2375) * @row: row of cnode (root is zero)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2376) * @col: column of cnode (leftmost is zero)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2377) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2378) * This function returns %0 on success and a negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2379) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2380) int dbg_check_lpt_nodes(struct ubifs_info *c, struct ubifs_cnode *cnode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2381) int row, int col)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2382) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2383) struct ubifs_nnode *nnode, *nn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2384) struct ubifs_cnode *cn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2385) int num, iip = 0, err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2386)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2387) if (!dbg_is_chk_lprops(c))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2388) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2389)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2390) while (cnode) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2391) ubifs_assert(c, row >= 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2392) nnode = cnode->parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2393) if (cnode->level) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2394) /* cnode is a nnode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2395) num = calc_nnode_num(row, col);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2396) if (cnode->num != num) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2397) ubifs_err(c, "nnode num %d expected %d parent num %d iip %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2398) cnode->num, num,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2399) (nnode ? nnode->num : 0), cnode->iip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2400) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2401) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2402) nn = (struct ubifs_nnode *)cnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2403) while (iip < UBIFS_LPT_FANOUT) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2404) cn = nn->nbranch[iip].cnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2405) if (cn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2406) /* Go down */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2407) row += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2408) col <<= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2409) col += iip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2410) iip = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2411) cnode = cn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2412) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2413) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2414) /* Go right */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2415) iip += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2416) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2417) if (iip < UBIFS_LPT_FANOUT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2418) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2419) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2420) struct ubifs_pnode *pnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2421)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2422) /* cnode is a pnode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2423) pnode = (struct ubifs_pnode *)cnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2424) err = dbg_chk_pnode(c, pnode, col);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2425) if (err)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2426) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2427) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2428) /* Go up and to the right */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2429) row -= 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2430) col >>= UBIFS_LPT_FANOUT_SHIFT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2431) iip = cnode->iip + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2432) cnode = (struct ubifs_cnode *)nnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2433) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2434) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2435) }
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags