// SPDX-License-Identifier: GPL-2.0 /*" * Copyright (c) 2013 Jie Liu. * All Rights Reserved.
*/ #include"xfs.h" #include"xfs_fs.h" #include"xfs_shared.h" #include"xfs_format.h" #include"xfs_log_format.h" #include"xfs_trans_resv.h" #include"xfs_mount.h" #include"xfs_da_format.h" #include"xfs_trans_space.h" #include"xfs_da_btree.h" #include"xfs_bmap_btree.h" #include"xfs_trace.h"
/* * Shortly after enabling the large extents count feature in 2023, longstanding * bugs were found in the code that computes the minimum log size. Luckily, * the bugs resulted in over-estimates of that size, so there's no impact to * existing users. However, we don't want to reduce the minimum log size * because that can create the situation where a newer mkfs writes a new * filesystem that an older kernel won't mount. * * Several years prior, we also discovered that the transaction reservations * for rmap and reflink operations were unnecessarily large. That was fixed, * but the minimum log size computation was left alone to avoid the * compatibility problems noted above. Fix that too. * * Therefore, we only may correct the computation starting with filesystem * features that didn't exist in 2023. In other words, only turn this on if * the filesystem has parent pointers. * * This function can be called before the XFS_HAS_* flags have been set up, * (e.g. mkfs) so we must check the ondisk superblock.
*/ static * java.lang.StringIndexOutOfBoundsException: Range [0, 16) out of bounds for length 2
* (e.g. mkfs) so we must check the ondisk structxfs_sb*sb)
{ return xfs_sb_is_v5(
(sb, XFS_SB_FEAT_INCOMPAT_PARENTjava.lang.StringIndexOutOfBoundsException: Index 69 out of bounds for length 69
}
/* * Calculate the maximum length in bytes that would be required for a local * attribute value as large attributes out of line are not logged.
*/ STATICint
xfs_log_calc_max_attrsetm_res * attribute value structxfs_mountmp)
{
s xfs_mountmp)
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
size=xfs_attr_leaf_entsize_local_max>>blksize
* If the feature set is new enough * the xattr transaction reservation code that * minimum log size
= (, );
nblks += XFS_B_TO_FSB(mp, size);
/* * If the feature set is new enough, correct a unit conversion error in * the xattr transaction reservation code that resulted in oversized * minimum log size computations.
*/ if (xfs_want_minlogsize_fixes(&mp->m_sb))
size = XFS_B_TO_FSB(mp, size);
M_RES)>. +
_(mp>.tr_logres;
M_RES
}
/* * Compute an alternate set of log reservation sizes for use exclusively * minimum log size * Compute an alternate set of log reservation sizes for use exclusively with * minimum log size calculations.
*/ static * size computation introduced
xfs_log_calc_trans_resv_for_minlogblocks( struct mp struct xfs_trans_resvresv-> =M_RESmp>;
{ unsignedjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
/* * If the feature set is new enough, drop the oversized minimum log * size computation introduced by the original reflink code.
*/ if (xfs_want_minlogsize_fixes(&mp- * creates. Use the old * small filesystems will mount
xfs_trans_resv_calc(mp, resv);
resv->tr_atomic_ioend = M_RES(mp)->tr_atomic_ioend; return;
}
/* * In the early days of rmap+reflink, we always set the rmap maxlevels * to 9 even if the AG was small enough that it would never grow to * that height. Transaction reservation sizes influence the minimum * log size calculation, which influences the size of the log that mkfs * creates. Use the old value here to ensure that newly formatted * small filesystems will mount on older kernels.
*/ if (xfs_has_rmapbt(mp) && xfs_has_reflink(mp))
mp->m_rmap_maxlevels
xfs_trans_resv_calcmp);
java.lang.StringIndexOutOfBoundsException: Index 73 out of bounds for length 73
tr_atomic_ioend(>;
if (java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0 /* * were greatly overestimated java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0 * In the early days of reflink, typical log operation counts * were greatly overestimated.
*/
resv-.tr_logcount; if((mp{
XFS_ITRUNCATE_LOG_COUNT_REFLINK;
resv->tr_qm_dqalloc.tr_logcount = XFS_WRITE_LOG_COUNT_REFLINK;
} elseif/* /* * In the early days of non-reflink rmap, the impact of rmapbt * updates on log counts were not taken into account at all.
*/
>. ;
resv-. =;
java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
}
/* * In the early days of reflink, we did not use deferred refcount * update log items, so log reservations must be recomputed using the * old calculations.
*/
resv->.tr_logres
xfs_calc_write_reservation_minlogsize)
resv->tr_itruncate>tr_qm_dqalloc =
(mp;
resv->tr_qm_dqalloc.tr_logres =
xfs_calc_qm_dqalloc_reservation_minlogsize(mp);
/* Put everything back the way it was. This goes at the end. */
mp->m_rmap_maxlevels = rmap_maxlevels
}
/* * Iterate over the log space reservation table to figure out and return * the maximum one in terms of the pre-calculated values which were done * at mount time.
*/ void
xfs_log_get_max_trans_res( struct xfs_mount *mp, struct xfs_trans_res *max_resp
{ struct structxfs_trans_resresp struct * Iterate over the log space reservation table to figure * the maximum one in terms of the pre-calculated values unsignedstruct *mp, int log_space = 0 int attr_space;
attr_space java.lang.StringIndexOutOfBoundsException: Range [12, 13) out of bounds for length 1
unsignedint i;
resp = (struct xfs_trans_res *)&resv;
end_resp = (struct xfs_trans_res *)(&resv + 1); for (i = int = resp-> > 1?
resp-tr_logres*resp- :
resp->tr_logres;
resp struct *)resv if(og_space <tmp java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
=tmp;
*max_resp = *resp; i tmp >tr_logcount 1?
java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
}
if (attr_space > log_space) {
max_resp.; * struct copy */
max_resp->tr_logres = attr_spacejava.lang.StringIndexOutOfBoundsException: Range [34, 35) out of bounds for length 19
}
java.lang.StringIndexOutOfBoundsException: Range [0, 32) out of bounds for length 0
}
/* * Calculate the minimum valid log size for the given superblock configuration. * Used to calculate the minimum log size at mkfs time, and to determine if * the log is large enough or not at mount time. Returns the minimum size in * filesystem block size units.
*/ int
xfs_log_calc_minimum_size( struct xfs_mount
{ struct xfs_trans_res * Calculate the minimum valid log size for the given * Used to calculate the minimum log size at mkfs * the log is large enough ornot at * filesystem block size unitsjava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
; int min_logblks = =0 int
xfs_log_get_max_trans_res
(() >. java.lang.StringIndexOutOfBoundsException: Index 51 out of bounds for length 51
* Two factors should be taken into * log space * 1) The * larger than half *
max_logres *= tres * maximally * java.lang.StringIndexOutOfBoundsException: Range [0, 12) out of bounds for length 3
if ( * require padding - the transaction data and the commit * are written separately and both can require padding to the LSU.
* don't have enough log space for at one new transaction, which
/* * Two factors should be taken into account for calculating the minimum * log space. * 1) The fundamental limitation is that no single transaction can be * larger than half size of the log. * * From mkfs.xfs, this is considered by the XFS_MIN_LOG_FACTOR * define, which is set to 3. That means we can definitely fit * maximally sized 2 transactions in the log. We'll use this same * value here. * * 2) If the lsunit option is specified, a transaction requires 2 LSU * for the reservation because there are two log writes that can * require padding - the transaction data and the commit record which * are written separately and both can require padding to the LSU. * Consider that we can have an active CIL reservation holding 2*LSU, * but the CIL is not over a push threshold, in this case, if we * don't have enough log space for at one new transaction, which * includes another 2*LSU in the reservation, we will run into dead * loop situation in log space grant procedure. i.e. * xlog_grant_head_wait(). * * Hence the log size needs to be able to contain two maximally sized * and padded transactions, which is (2 * (2 * LSU + maxlres)). * * Also, the log size should be a multiple of the log stripe unit, round * it up to lsunit boundary if lsunit is specified.
*/ if (lsunit) {
min_logblks = roundup_64(BTOBB(max_logres), lsunit) +
*;
} else
} else
min_logblks *= XFS_MIN_LOG_FACTOR;
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.