1 /* 2 * Copyright (C) 2016 Oracle. All Rights Reserved. 3 * 4 * Author: Darrick J. Wong <darrick.wong@oracle.com> 5 * 6 * This program is free software; you can redistribute it and/or 7 * modify it under the terms of the GNU General Public License 8 * as published by the Free Software Foundation; either version 2 9 * of the License, or (at your option) any later version. 10 * 11 * This program is distributed in the hope that it would be useful, 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 * GNU General Public License for more details. 15 * 16 * You should have received a copy of the GNU General Public License 17 * along with this program; if not, write the Free Software Foundation, 18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. 19 */ 20 #include "xfs.h" 21 #include "xfs_fs.h" 22 #include "xfs_shared.h" 23 #include "xfs_format.h" 24 #include "xfs_log_format.h" 25 #include "xfs_trans_resv.h" 26 #include "xfs_sb.h" 27 #include "xfs_mount.h" 28 #include "xfs_defer.h" 29 #include "xfs_alloc.h" 30 #include "xfs_error.h" 31 #include "xfs_trace.h" 32 #include "xfs_cksum.h" 33 #include "xfs_trans.h" 34 #include "xfs_bit.h" 35 #include "xfs_bmap.h" 36 #include "xfs_bmap_btree.h" 37 #include "xfs_ag_resv.h" 38 #include "xfs_trans_space.h" 39 #include "xfs_rmap_btree.h" 40 #include "xfs_btree.h" 41 #include "xfs_refcount_btree.h" 42 #include "xfs_ialloc_btree.h" 43 44 /* 45 * Per-AG Block Reservations 46 * 47 * For some kinds of allocation group metadata structures, it is advantageous 48 * to reserve a small number of blocks in each AG so that future expansions of 49 * that data structure do not encounter ENOSPC because errors during a btree 50 * split cause the filesystem to go offline. 51 * 52 * Prior to the introduction of reflink, this wasn't an issue because the free 53 * space btrees maintain a reserve of space (the AGFL) to handle any expansion 54 * that may be necessary; and allocations of other metadata (inodes, BMBT, 55 * dir/attr) aren't restricted to a single AG. However, with reflink it is 56 * possible to allocate all the space in an AG, have subsequent reflink/CoW 57 * activity expand the refcount btree, and discover that there's no space left 58 * to handle that expansion. Since we can calculate the maximum size of the 59 * refcount btree, we can reserve space for it and avoid ENOSPC. 60 * 61 * Handling per-AG reservations consists of three changes to the allocator's 62 * behavior: First, because these reservations are always needed, we decrease 63 * the ag_max_usable counter to reflect the size of the AG after the reserved 64 * blocks are taken. Second, the reservations must be reflected in the 65 * fdblocks count to maintain proper accounting. Third, each AG must maintain 66 * its own reserved block counter so that we can calculate the amount of space 67 * that must remain free to maintain the reservations. Fourth, the "remaining 68 * reserved blocks" count must be used when calculating the length of the 69 * longest free extent in an AG and to clamp maxlen in the per-AG allocation 70 * functions. In other words, we maintain a virtual allocation via in-core 71 * accounting tricks so that we don't have to clean up after a crash. :) 72 * 73 * Reserved blocks can be managed by passing one of the enum xfs_ag_resv_type 74 * values via struct xfs_alloc_arg or directly to the xfs_free_extent 75 * function. It might seem a little funny to maintain a reservoir of blocks 76 * to feed another reservoir, but the AGFL only holds enough blocks to get 77 * through the next transaction. The per-AG reservation is to ensure (we 78 * hope) that each AG never runs out of blocks. Each data structure wanting 79 * to use the reservation system should update ask/used in xfs_ag_resv_init. 80 */ 81 82 /* 83 * Are we critically low on blocks? For now we'll define that as the number 84 * of blocks we can get our hands on being less than 10% of what we reserved 85 * or less than some arbitrary number (maximum btree height). 86 */ 87 bool 88 xfs_ag_resv_critical( 89 struct xfs_perag *pag, 90 enum xfs_ag_resv_type type) 91 { 92 xfs_extlen_t avail; 93 xfs_extlen_t orig; 94 95 switch (type) { 96 case XFS_AG_RESV_METADATA: 97 avail = pag->pagf_freeblks - pag->pag_agfl_resv.ar_reserved; 98 orig = pag->pag_meta_resv.ar_asked; 99 break; 100 case XFS_AG_RESV_AGFL: 101 avail = pag->pagf_freeblks + pag->pagf_flcount - 102 pag->pag_meta_resv.ar_reserved; 103 orig = pag->pag_agfl_resv.ar_asked; 104 break; 105 default: 106 ASSERT(0); 107 return false; 108 } 109 110 trace_xfs_ag_resv_critical(pag, type, avail); 111 112 /* Critically low if less than 10% or max btree height remains. */ 113 return XFS_TEST_ERROR(avail < orig / 10 || avail < XFS_BTREE_MAXLEVELS, 114 pag->pag_mount, XFS_ERRTAG_AG_RESV_CRITICAL, 115 XFS_RANDOM_AG_RESV_CRITICAL); 116 } 117 118 /* 119 * How many blocks are reserved but not used, and therefore must not be 120 * allocated away? 121 */ 122 xfs_extlen_t 123 xfs_ag_resv_needed( 124 struct xfs_perag *pag, 125 enum xfs_ag_resv_type type) 126 { 127 xfs_extlen_t len; 128 129 len = pag->pag_meta_resv.ar_reserved + pag->pag_agfl_resv.ar_reserved; 130 switch (type) { 131 case XFS_AG_RESV_METADATA: 132 case XFS_AG_RESV_AGFL: 133 len -= xfs_perag_resv(pag, type)->ar_reserved; 134 break; 135 case XFS_AG_RESV_NONE: 136 /* empty */ 137 break; 138 default: 139 ASSERT(0); 140 } 141 142 trace_xfs_ag_resv_needed(pag, type, len); 143 144 return len; 145 } 146 147 /* Clean out a reservation */ 148 static int 149 __xfs_ag_resv_free( 150 struct xfs_perag *pag, 151 enum xfs_ag_resv_type type) 152 { 153 struct xfs_ag_resv *resv; 154 xfs_extlen_t oldresv; 155 int error; 156 157 trace_xfs_ag_resv_free(pag, type, 0); 158 159 resv = xfs_perag_resv(pag, type); 160 pag->pag_mount->m_ag_max_usable += resv->ar_asked; 161 /* 162 * AGFL blocks are always considered "free", so whatever 163 * was reserved at mount time must be given back at umount. 164 */ 165 if (type == XFS_AG_RESV_AGFL) 166 oldresv = resv->ar_orig_reserved; 167 else 168 oldresv = resv->ar_reserved; 169 error = xfs_mod_fdblocks(pag->pag_mount, oldresv, true); 170 resv->ar_reserved = 0; 171 resv->ar_asked = 0; 172 173 if (error) 174 trace_xfs_ag_resv_free_error(pag->pag_mount, pag->pag_agno, 175 error, _RET_IP_); 176 return error; 177 } 178 179 /* Free a per-AG reservation. */ 180 int 181 xfs_ag_resv_free( 182 struct xfs_perag *pag) 183 { 184 int error; 185 int err2; 186 187 error = __xfs_ag_resv_free(pag, XFS_AG_RESV_AGFL); 188 err2 = __xfs_ag_resv_free(pag, XFS_AG_RESV_METADATA); 189 if (err2 && !error) 190 error = err2; 191 return error; 192 } 193 194 static int 195 __xfs_ag_resv_init( 196 struct xfs_perag *pag, 197 enum xfs_ag_resv_type type, 198 xfs_extlen_t ask, 199 xfs_extlen_t used) 200 { 201 struct xfs_mount *mp = pag->pag_mount; 202 struct xfs_ag_resv *resv; 203 int error; 204 xfs_extlen_t reserved; 205 206 if (used > ask) 207 ask = used; 208 reserved = ask - used; 209 210 error = xfs_mod_fdblocks(mp, -(int64_t)reserved, true); 211 if (error) { 212 trace_xfs_ag_resv_init_error(pag->pag_mount, pag->pag_agno, 213 error, _RET_IP_); 214 xfs_warn(mp, 215 "Per-AG reservation for AG %u failed. Filesystem may run out of space.", 216 pag->pag_agno); 217 return error; 218 } 219 220 mp->m_ag_max_usable -= ask; 221 222 resv = xfs_perag_resv(pag, type); 223 resv->ar_asked = ask; 224 resv->ar_reserved = resv->ar_orig_reserved = reserved; 225 226 trace_xfs_ag_resv_init(pag, type, ask); 227 return 0; 228 } 229 230 /* Create a per-AG block reservation. */ 231 int 232 xfs_ag_resv_init( 233 struct xfs_perag *pag) 234 { 235 struct xfs_mount *mp = pag->pag_mount; 236 xfs_agnumber_t agno = pag->pag_agno; 237 xfs_extlen_t ask; 238 xfs_extlen_t used; 239 int error = 0; 240 241 /* Create the metadata reservation. */ 242 if (pag->pag_meta_resv.ar_asked == 0) { 243 ask = used = 0; 244 245 error = xfs_refcountbt_calc_reserves(mp, agno, &ask, &used); 246 if (error) 247 goto out; 248 249 error = xfs_finobt_calc_reserves(mp, agno, &ask, &used); 250 if (error) 251 goto out; 252 253 error = __xfs_ag_resv_init(pag, XFS_AG_RESV_METADATA, 254 ask, used); 255 if (error) { 256 /* 257 * Because we didn't have per-AG reservations when the 258 * finobt feature was added we might not be able to 259 * reserve all needed blocks. Warn and fall back to the 260 * old and potentially buggy code in that case, but 261 * ensure we do have the reservation for the refcountbt. 262 */ 263 ask = used = 0; 264 265 mp->m_inotbt_nores = true; 266 267 error = xfs_refcountbt_calc_reserves(mp, agno, &ask, 268 &used); 269 if (error) 270 goto out; 271 272 error = __xfs_ag_resv_init(pag, XFS_AG_RESV_METADATA, 273 ask, used); 274 if (error) 275 goto out; 276 } 277 } 278 279 /* Create the AGFL metadata reservation */ 280 if (pag->pag_agfl_resv.ar_asked == 0) { 281 ask = used = 0; 282 283 error = xfs_rmapbt_calc_reserves(mp, agno, &ask, &used); 284 if (error) 285 goto out; 286 287 error = __xfs_ag_resv_init(pag, XFS_AG_RESV_AGFL, ask, used); 288 if (error) 289 goto out; 290 } 291 292 #ifdef DEBUG 293 /* need to read in the AGF for the ASSERT below to work */ 294 error = xfs_alloc_pagf_init(pag->pag_mount, NULL, pag->pag_agno, 0); 295 if (error) 296 return error; 297 298 ASSERT(xfs_perag_resv(pag, XFS_AG_RESV_METADATA)->ar_reserved + 299 xfs_perag_resv(pag, XFS_AG_RESV_AGFL)->ar_reserved <= 300 pag->pagf_freeblks + pag->pagf_flcount); 301 #endif 302 out: 303 return error; 304 } 305 306 /* Allocate a block from the reservation. */ 307 void 308 xfs_ag_resv_alloc_extent( 309 struct xfs_perag *pag, 310 enum xfs_ag_resv_type type, 311 struct xfs_alloc_arg *args) 312 { 313 struct xfs_ag_resv *resv; 314 xfs_extlen_t len; 315 uint field; 316 317 trace_xfs_ag_resv_alloc_extent(pag, type, args->len); 318 319 switch (type) { 320 case XFS_AG_RESV_METADATA: 321 case XFS_AG_RESV_AGFL: 322 resv = xfs_perag_resv(pag, type); 323 break; 324 default: 325 ASSERT(0); 326 /* fall through */ 327 case XFS_AG_RESV_NONE: 328 field = args->wasdel ? XFS_TRANS_SB_RES_FDBLOCKS : 329 XFS_TRANS_SB_FDBLOCKS; 330 xfs_trans_mod_sb(args->tp, field, -(int64_t)args->len); 331 return; 332 } 333 334 len = min_t(xfs_extlen_t, args->len, resv->ar_reserved); 335 resv->ar_reserved -= len; 336 if (type == XFS_AG_RESV_AGFL) 337 return; 338 /* Allocations of reserved blocks only need on-disk sb updates... */ 339 xfs_trans_mod_sb(args->tp, XFS_TRANS_SB_RES_FDBLOCKS, -(int64_t)len); 340 /* ...but non-reserved blocks need in-core and on-disk updates. */ 341 if (args->len > len) 342 xfs_trans_mod_sb(args->tp, XFS_TRANS_SB_FDBLOCKS, 343 -((int64_t)args->len - len)); 344 } 345 346 /* Free a block to the reservation. */ 347 void 348 xfs_ag_resv_free_extent( 349 struct xfs_perag *pag, 350 enum xfs_ag_resv_type type, 351 struct xfs_trans *tp, 352 xfs_extlen_t len) 353 { 354 xfs_extlen_t leftover; 355 struct xfs_ag_resv *resv; 356 357 trace_xfs_ag_resv_free_extent(pag, type, len); 358 359 switch (type) { 360 case XFS_AG_RESV_METADATA: 361 case XFS_AG_RESV_AGFL: 362 resv = xfs_perag_resv(pag, type); 363 break; 364 default: 365 ASSERT(0); 366 /* fall through */ 367 case XFS_AG_RESV_NONE: 368 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FDBLOCKS, (int64_t)len); 369 return; 370 } 371 372 leftover = min_t(xfs_extlen_t, len, resv->ar_asked - resv->ar_reserved); 373 resv->ar_reserved += leftover; 374 if (type == XFS_AG_RESV_AGFL) 375 return; 376 /* Freeing into the reserved pool only requires on-disk update... */ 377 xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FDBLOCKS, len); 378 /* ...but freeing beyond that requires in-core and on-disk update. */ 379 if (len > leftover) 380 xfs_trans_mod_sb(tp, XFS_TRANS_SB_FDBLOCKS, len - leftover); 381 } 382