xfs: remove the alloc_done argument to xfs_dialloc
[deliverable/linux.git] / fs / xfs / xfs_ialloc.c
1 /*
2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
8 *
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
17 */
18 #include "xfs.h"
19 #include "xfs_fs.h"
20 #include "xfs_types.h"
21 #include "xfs_bit.h"
22 #include "xfs_log.h"
23 #include "xfs_inum.h"
24 #include "xfs_trans.h"
25 #include "xfs_sb.h"
26 #include "xfs_ag.h"
27 #include "xfs_mount.h"
28 #include "xfs_bmap_btree.h"
29 #include "xfs_alloc_btree.h"
30 #include "xfs_ialloc_btree.h"
31 #include "xfs_dinode.h"
32 #include "xfs_inode.h"
33 #include "xfs_btree.h"
34 #include "xfs_ialloc.h"
35 #include "xfs_alloc.h"
36 #include "xfs_rtalloc.h"
37 #include "xfs_error.h"
38 #include "xfs_bmap.h"
39
40
41 /*
42 * Allocation group level functions.
43 */
44 static inline int
45 xfs_ialloc_cluster_alignment(
46 xfs_alloc_arg_t *args)
47 {
48 if (xfs_sb_version_hasalign(&args->mp->m_sb) &&
49 args->mp->m_sb.sb_inoalignmt >=
50 XFS_B_TO_FSBT(args->mp, XFS_INODE_CLUSTER_SIZE(args->mp)))
51 return args->mp->m_sb.sb_inoalignmt;
52 return 1;
53 }
54
55 /*
56 * Lookup a record by ino in the btree given by cur.
57 */
58 int /* error */
59 xfs_inobt_lookup(
60 struct xfs_btree_cur *cur, /* btree cursor */
61 xfs_agino_t ino, /* starting inode of chunk */
62 xfs_lookup_t dir, /* <=, >=, == */
63 int *stat) /* success/failure */
64 {
65 cur->bc_rec.i.ir_startino = ino;
66 cur->bc_rec.i.ir_freecount = 0;
67 cur->bc_rec.i.ir_free = 0;
68 return xfs_btree_lookup(cur, dir, stat);
69 }
70
71 /*
72 * Update the record referred to by cur to the value given.
73 * This either works (return 0) or gets an EFSCORRUPTED error.
74 */
75 STATIC int /* error */
76 xfs_inobt_update(
77 struct xfs_btree_cur *cur, /* btree cursor */
78 xfs_inobt_rec_incore_t *irec) /* btree record */
79 {
80 union xfs_btree_rec rec;
81
82 rec.inobt.ir_startino = cpu_to_be32(irec->ir_startino);
83 rec.inobt.ir_freecount = cpu_to_be32(irec->ir_freecount);
84 rec.inobt.ir_free = cpu_to_be64(irec->ir_free);
85 return xfs_btree_update(cur, &rec);
86 }
87
88 /*
89 * Get the data from the pointed-to record.
90 */
91 int /* error */
92 xfs_inobt_get_rec(
93 struct xfs_btree_cur *cur, /* btree cursor */
94 xfs_inobt_rec_incore_t *irec, /* btree record */
95 int *stat) /* output: success/failure */
96 {
97 union xfs_btree_rec *rec;
98 int error;
99
100 error = xfs_btree_get_rec(cur, &rec, stat);
101 if (!error && *stat == 1) {
102 irec->ir_startino = be32_to_cpu(rec->inobt.ir_startino);
103 irec->ir_freecount = be32_to_cpu(rec->inobt.ir_freecount);
104 irec->ir_free = be64_to_cpu(rec->inobt.ir_free);
105 }
106 return error;
107 }
108
109 /*
110 * Verify that the number of free inodes in the AGI is correct.
111 */
112 #ifdef DEBUG
113 STATIC int
114 xfs_check_agi_freecount(
115 struct xfs_btree_cur *cur,
116 struct xfs_agi *agi)
117 {
118 if (cur->bc_nlevels == 1) {
119 xfs_inobt_rec_incore_t rec;
120 int freecount = 0;
121 int error;
122 int i;
123
124 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &i);
125 if (error)
126 return error;
127
128 do {
129 error = xfs_inobt_get_rec(cur, &rec, &i);
130 if (error)
131 return error;
132
133 if (i) {
134 freecount += rec.ir_freecount;
135 error = xfs_btree_increment(cur, 0, &i);
136 if (error)
137 return error;
138 }
139 } while (i == 1);
140
141 if (!XFS_FORCED_SHUTDOWN(cur->bc_mp))
142 ASSERT(freecount == be32_to_cpu(agi->agi_freecount));
143 }
144 return 0;
145 }
146 #else
147 #define xfs_check_agi_freecount(cur, agi) 0
148 #endif
149
150 /*
151 * Initialise a new set of inodes.
152 */
153 STATIC int
154 xfs_ialloc_inode_init(
155 struct xfs_mount *mp,
156 struct xfs_trans *tp,
157 xfs_agnumber_t agno,
158 xfs_agblock_t agbno,
159 xfs_agblock_t length,
160 unsigned int gen)
161 {
162 struct xfs_buf *fbuf;
163 struct xfs_dinode *free;
164 int blks_per_cluster, nbufs, ninodes;
165 int version;
166 int i, j;
167 xfs_daddr_t d;
168
169 /*
170 * Loop over the new block(s), filling in the inodes.
171 * For small block sizes, manipulate the inodes in buffers
172 * which are multiples of the blocks size.
173 */
174 if (mp->m_sb.sb_blocksize >= XFS_INODE_CLUSTER_SIZE(mp)) {
175 blks_per_cluster = 1;
176 nbufs = length;
177 ninodes = mp->m_sb.sb_inopblock;
178 } else {
179 blks_per_cluster = XFS_INODE_CLUSTER_SIZE(mp) /
180 mp->m_sb.sb_blocksize;
181 nbufs = length / blks_per_cluster;
182 ninodes = blks_per_cluster * mp->m_sb.sb_inopblock;
183 }
184
185 /*
186 * Figure out what version number to use in the inodes we create.
187 * If the superblock version has caught up to the one that supports
188 * the new inode format, then use the new inode version. Otherwise
189 * use the old version so that old kernels will continue to be
190 * able to use the file system.
191 */
192 if (xfs_sb_version_hasnlink(&mp->m_sb))
193 version = 2;
194 else
195 version = 1;
196
197 for (j = 0; j < nbufs; j++) {
198 /*
199 * Get the block.
200 */
201 d = XFS_AGB_TO_DADDR(mp, agno, agbno + (j * blks_per_cluster));
202 fbuf = xfs_trans_get_buf(tp, mp->m_ddev_targp, d,
203 mp->m_bsize * blks_per_cluster, 0);
204 if (!fbuf)
205 return ENOMEM;
206 /*
207 * Initialize all inodes in this buffer and then log them.
208 *
209 * XXX: It would be much better if we had just one transaction
210 * to log a whole cluster of inodes instead of all the
211 * individual transactions causing a lot of log traffic.
212 */
213 xfs_buf_zero(fbuf, 0, ninodes << mp->m_sb.sb_inodelog);
214 for (i = 0; i < ninodes; i++) {
215 int ioffset = i << mp->m_sb.sb_inodelog;
216 uint isize = sizeof(struct xfs_dinode);
217
218 free = xfs_make_iptr(mp, fbuf, i);
219 free->di_magic = cpu_to_be16(XFS_DINODE_MAGIC);
220 free->di_version = version;
221 free->di_gen = cpu_to_be32(gen);
222 free->di_next_unlinked = cpu_to_be32(NULLAGINO);
223 xfs_trans_log_buf(tp, fbuf, ioffset, ioffset + isize - 1);
224 }
225 xfs_trans_inode_alloc_buf(tp, fbuf);
226 }
227 return 0;
228 }
229
230 /*
231 * Allocate new inodes in the allocation group specified by agbp.
232 * Return 0 for success, else error code.
233 */
234 STATIC int /* error code or 0 */
235 xfs_ialloc_ag_alloc(
236 xfs_trans_t *tp, /* transaction pointer */
237 xfs_buf_t *agbp, /* alloc group buffer */
238 int *alloc)
239 {
240 xfs_agi_t *agi; /* allocation group header */
241 xfs_alloc_arg_t args; /* allocation argument structure */
242 xfs_btree_cur_t *cur; /* inode btree cursor */
243 xfs_agnumber_t agno;
244 int error;
245 int i;
246 xfs_agino_t newino; /* new first inode's number */
247 xfs_agino_t newlen; /* new number of inodes */
248 xfs_agino_t thisino; /* current inode number, for loop */
249 int isaligned = 0; /* inode allocation at stripe unit */
250 /* boundary */
251 struct xfs_perag *pag;
252
253 args.tp = tp;
254 args.mp = tp->t_mountp;
255
256 /*
257 * Locking will ensure that we don't have two callers in here
258 * at one time.
259 */
260 newlen = XFS_IALLOC_INODES(args.mp);
261 if (args.mp->m_maxicount &&
262 args.mp->m_sb.sb_icount + newlen > args.mp->m_maxicount)
263 return XFS_ERROR(ENOSPC);
264 args.minlen = args.maxlen = XFS_IALLOC_BLOCKS(args.mp);
265 /*
266 * First try to allocate inodes contiguous with the last-allocated
267 * chunk of inodes. If the filesystem is striped, this will fill
268 * an entire stripe unit with inodes.
269 */
270 agi = XFS_BUF_TO_AGI(agbp);
271 newino = be32_to_cpu(agi->agi_newino);
272 agno = be32_to_cpu(agi->agi_seqno);
273 args.agbno = XFS_AGINO_TO_AGBNO(args.mp, newino) +
274 XFS_IALLOC_BLOCKS(args.mp);
275 if (likely(newino != NULLAGINO &&
276 (args.agbno < be32_to_cpu(agi->agi_length)))) {
277 args.fsbno = XFS_AGB_TO_FSB(args.mp, agno, args.agbno);
278 args.type = XFS_ALLOCTYPE_THIS_BNO;
279 args.mod = args.total = args.wasdel = args.isfl =
280 args.userdata = args.minalignslop = 0;
281 args.prod = 1;
282
283 /*
284 * We need to take into account alignment here to ensure that
285 * we don't modify the free list if we fail to have an exact
286 * block. If we don't have an exact match, and every oher
287 * attempt allocation attempt fails, we'll end up cancelling
288 * a dirty transaction and shutting down.
289 *
290 * For an exact allocation, alignment must be 1,
291 * however we need to take cluster alignment into account when
292 * fixing up the freelist. Use the minalignslop field to
293 * indicate that extra blocks might be required for alignment,
294 * but not to use them in the actual exact allocation.
295 */
296 args.alignment = 1;
297 args.minalignslop = xfs_ialloc_cluster_alignment(&args) - 1;
298
299 /* Allow space for the inode btree to split. */
300 args.minleft = args.mp->m_in_maxlevels - 1;
301 if ((error = xfs_alloc_vextent(&args)))
302 return error;
303 } else
304 args.fsbno = NULLFSBLOCK;
305
306 if (unlikely(args.fsbno == NULLFSBLOCK)) {
307 /*
308 * Set the alignment for the allocation.
309 * If stripe alignment is turned on then align at stripe unit
310 * boundary.
311 * If the cluster size is smaller than a filesystem block
312 * then we're doing I/O for inodes in filesystem block size
313 * pieces, so don't need alignment anyway.
314 */
315 isaligned = 0;
316 if (args.mp->m_sinoalign) {
317 ASSERT(!(args.mp->m_flags & XFS_MOUNT_NOALIGN));
318 args.alignment = args.mp->m_dalign;
319 isaligned = 1;
320 } else
321 args.alignment = xfs_ialloc_cluster_alignment(&args);
322 /*
323 * Need to figure out where to allocate the inode blocks.
324 * Ideally they should be spaced out through the a.g.
325 * For now, just allocate blocks up front.
326 */
327 args.agbno = be32_to_cpu(agi->agi_root);
328 args.fsbno = XFS_AGB_TO_FSB(args.mp, agno, args.agbno);
329 /*
330 * Allocate a fixed-size extent of inodes.
331 */
332 args.type = XFS_ALLOCTYPE_NEAR_BNO;
333 args.mod = args.total = args.wasdel = args.isfl =
334 args.userdata = args.minalignslop = 0;
335 args.prod = 1;
336 /*
337 * Allow space for the inode btree to split.
338 */
339 args.minleft = args.mp->m_in_maxlevels - 1;
340 if ((error = xfs_alloc_vextent(&args)))
341 return error;
342 }
343
344 /*
345 * If stripe alignment is turned on, then try again with cluster
346 * alignment.
347 */
348 if (isaligned && args.fsbno == NULLFSBLOCK) {
349 args.type = XFS_ALLOCTYPE_NEAR_BNO;
350 args.agbno = be32_to_cpu(agi->agi_root);
351 args.fsbno = XFS_AGB_TO_FSB(args.mp, agno, args.agbno);
352 args.alignment = xfs_ialloc_cluster_alignment(&args);
353 if ((error = xfs_alloc_vextent(&args)))
354 return error;
355 }
356
357 if (args.fsbno == NULLFSBLOCK) {
358 *alloc = 0;
359 return 0;
360 }
361 ASSERT(args.len == args.minlen);
362
363 /*
364 * Stamp and write the inode buffers.
365 *
366 * Seed the new inode cluster with a random generation number. This
367 * prevents short-term reuse of generation numbers if a chunk is
368 * freed and then immediately reallocated. We use random numbers
369 * rather than a linear progression to prevent the next generation
370 * number from being easily guessable.
371 */
372 error = xfs_ialloc_inode_init(args.mp, tp, agno, args.agbno,
373 args.len, random32());
374
375 if (error)
376 return error;
377 /*
378 * Convert the results.
379 */
380 newino = XFS_OFFBNO_TO_AGINO(args.mp, args.agbno, 0);
381 be32_add_cpu(&agi->agi_count, newlen);
382 be32_add_cpu(&agi->agi_freecount, newlen);
383 pag = xfs_perag_get(args.mp, agno);
384 pag->pagi_freecount += newlen;
385 xfs_perag_put(pag);
386 agi->agi_newino = cpu_to_be32(newino);
387
388 /*
389 * Insert records describing the new inode chunk into the btree.
390 */
391 cur = xfs_inobt_init_cursor(args.mp, tp, agbp, agno);
392 for (thisino = newino;
393 thisino < newino + newlen;
394 thisino += XFS_INODES_PER_CHUNK) {
395 cur->bc_rec.i.ir_startino = thisino;
396 cur->bc_rec.i.ir_freecount = XFS_INODES_PER_CHUNK;
397 cur->bc_rec.i.ir_free = XFS_INOBT_ALL_FREE;
398 error = xfs_btree_lookup(cur, XFS_LOOKUP_EQ, &i);
399 if (error) {
400 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
401 return error;
402 }
403 ASSERT(i == 0);
404 error = xfs_btree_insert(cur, &i);
405 if (error) {
406 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
407 return error;
408 }
409 ASSERT(i == 1);
410 }
411 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
412 /*
413 * Log allocation group header fields
414 */
415 xfs_ialloc_log_agi(tp, agbp,
416 XFS_AGI_COUNT | XFS_AGI_FREECOUNT | XFS_AGI_NEWINO);
417 /*
418 * Modify/log superblock values for inode count and inode free count.
419 */
420 xfs_trans_mod_sb(tp, XFS_TRANS_SB_ICOUNT, (long)newlen);
421 xfs_trans_mod_sb(tp, XFS_TRANS_SB_IFREE, (long)newlen);
422 *alloc = 1;
423 return 0;
424 }
425
426 STATIC xfs_agnumber_t
427 xfs_ialloc_next_ag(
428 xfs_mount_t *mp)
429 {
430 xfs_agnumber_t agno;
431
432 spin_lock(&mp->m_agirotor_lock);
433 agno = mp->m_agirotor;
434 if (++mp->m_agirotor == mp->m_maxagi)
435 mp->m_agirotor = 0;
436 spin_unlock(&mp->m_agirotor_lock);
437
438 return agno;
439 }
440
441 /*
442 * Select an allocation group to look for a free inode in, based on the parent
443 * inode and then mode. Return the allocation group buffer.
444 */
445 STATIC xfs_buf_t * /* allocation group buffer */
446 xfs_ialloc_ag_select(
447 xfs_trans_t *tp, /* transaction pointer */
448 xfs_ino_t parent, /* parent directory inode number */
449 umode_t mode, /* bits set to indicate file type */
450 int okalloc) /* ok to allocate more space */
451 {
452 xfs_buf_t *agbp; /* allocation group header buffer */
453 xfs_agnumber_t agcount; /* number of ag's in the filesystem */
454 xfs_agnumber_t agno; /* current ag number */
455 int flags; /* alloc buffer locking flags */
456 xfs_extlen_t ineed; /* blocks needed for inode allocation */
457 xfs_extlen_t longest = 0; /* longest extent available */
458 xfs_mount_t *mp; /* mount point structure */
459 int needspace; /* file mode implies space allocated */
460 xfs_perag_t *pag; /* per allocation group data */
461 xfs_agnumber_t pagno; /* parent (starting) ag number */
462
463 /*
464 * Files of these types need at least one block if length > 0
465 * (and they won't fit in the inode, but that's hard to figure out).
466 */
467 needspace = S_ISDIR(mode) || S_ISREG(mode) || S_ISLNK(mode);
468 mp = tp->t_mountp;
469 agcount = mp->m_maxagi;
470 if (S_ISDIR(mode))
471 pagno = xfs_ialloc_next_ag(mp);
472 else {
473 pagno = XFS_INO_TO_AGNO(mp, parent);
474 if (pagno >= agcount)
475 pagno = 0;
476 }
477 ASSERT(pagno < agcount);
478 /*
479 * Loop through allocation groups, looking for one with a little
480 * free space in it. Note we don't look for free inodes, exactly.
481 * Instead, we include whether there is a need to allocate inodes
482 * to mean that blocks must be allocated for them,
483 * if none are currently free.
484 */
485 agno = pagno;
486 flags = XFS_ALLOC_FLAG_TRYLOCK;
487 for (;;) {
488 pag = xfs_perag_get(mp, agno);
489 if (!pag->pagi_init) {
490 if (xfs_ialloc_read_agi(mp, tp, agno, &agbp)) {
491 agbp = NULL;
492 goto nextag;
493 }
494 } else
495 agbp = NULL;
496
497 if (!pag->pagi_inodeok) {
498 xfs_ialloc_next_ag(mp);
499 goto unlock_nextag;
500 }
501
502 /*
503 * Is there enough free space for the file plus a block
504 * of inodes (if we need to allocate some)?
505 */
506 ineed = pag->pagi_freecount ? 0 : XFS_IALLOC_BLOCKS(mp);
507 if (ineed && !pag->pagf_init) {
508 if (agbp == NULL &&
509 xfs_ialloc_read_agi(mp, tp, agno, &agbp)) {
510 agbp = NULL;
511 goto nextag;
512 }
513 (void)xfs_alloc_pagf_init(mp, tp, agno, flags);
514 }
515 if (!ineed || pag->pagf_init) {
516 if (ineed && !(longest = pag->pagf_longest))
517 longest = pag->pagf_flcount > 0;
518 if (!ineed ||
519 (pag->pagf_freeblks >= needspace + ineed &&
520 longest >= ineed &&
521 okalloc)) {
522 if (agbp == NULL &&
523 xfs_ialloc_read_agi(mp, tp, agno, &agbp)) {
524 agbp = NULL;
525 goto nextag;
526 }
527 xfs_perag_put(pag);
528 return agbp;
529 }
530 }
531 unlock_nextag:
532 if (agbp)
533 xfs_trans_brelse(tp, agbp);
534 nextag:
535 xfs_perag_put(pag);
536 /*
537 * No point in iterating over the rest, if we're shutting
538 * down.
539 */
540 if (XFS_FORCED_SHUTDOWN(mp))
541 return NULL;
542 agno++;
543 if (agno >= agcount)
544 agno = 0;
545 if (agno == pagno) {
546 if (flags == 0)
547 return NULL;
548 flags = 0;
549 }
550 }
551 }
552
553 /*
554 * Try to retrieve the next record to the left/right from the current one.
555 */
556 STATIC int
557 xfs_ialloc_next_rec(
558 struct xfs_btree_cur *cur,
559 xfs_inobt_rec_incore_t *rec,
560 int *done,
561 int left)
562 {
563 int error;
564 int i;
565
566 if (left)
567 error = xfs_btree_decrement(cur, 0, &i);
568 else
569 error = xfs_btree_increment(cur, 0, &i);
570
571 if (error)
572 return error;
573 *done = !i;
574 if (i) {
575 error = xfs_inobt_get_rec(cur, rec, &i);
576 if (error)
577 return error;
578 XFS_WANT_CORRUPTED_RETURN(i == 1);
579 }
580
581 return 0;
582 }
583
584 STATIC int
585 xfs_ialloc_get_rec(
586 struct xfs_btree_cur *cur,
587 xfs_agino_t agino,
588 xfs_inobt_rec_incore_t *rec,
589 int *done,
590 int left)
591 {
592 int error;
593 int i;
594
595 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_EQ, &i);
596 if (error)
597 return error;
598 *done = !i;
599 if (i) {
600 error = xfs_inobt_get_rec(cur, rec, &i);
601 if (error)
602 return error;
603 XFS_WANT_CORRUPTED_RETURN(i == 1);
604 }
605
606 return 0;
607 }
608
609 /*
610 * Allocate an inode.
611 *
612 * The caller selected an AG for us, and made sure that free inodes are
613 * available.
614 */
615 STATIC int
616 xfs_dialloc_ag(
617 struct xfs_trans *tp,
618 struct xfs_buf *agbp,
619 xfs_ino_t parent,
620 xfs_ino_t *inop)
621 {
622 struct xfs_mount *mp = tp->t_mountp;
623 struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
624 xfs_agnumber_t agno = be32_to_cpu(agi->agi_seqno);
625 xfs_agnumber_t pagno = XFS_INO_TO_AGNO(mp, parent);
626 xfs_agino_t pagino = XFS_INO_TO_AGINO(mp, parent);
627 struct xfs_perag *pag;
628 struct xfs_btree_cur *cur, *tcur;
629 struct xfs_inobt_rec_incore rec, trec;
630 xfs_ino_t ino;
631 int error;
632 int offset;
633 int i, j;
634
635 pag = xfs_perag_get(mp, agno);
636
637 restart_pagno:
638 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno);
639 /*
640 * If pagino is 0 (this is the root inode allocation) use newino.
641 * This must work because we've just allocated some.
642 */
643 if (!pagino)
644 pagino = be32_to_cpu(agi->agi_newino);
645
646 error = xfs_check_agi_freecount(cur, agi);
647 if (error)
648 goto error0;
649
650 /*
651 * If in the same AG as the parent, try to get near the parent.
652 */
653 if (pagno == agno) {
654 int doneleft; /* done, to the left */
655 int doneright; /* done, to the right */
656 int searchdistance = 10;
657
658 error = xfs_inobt_lookup(cur, pagino, XFS_LOOKUP_LE, &i);
659 if (error)
660 goto error0;
661 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
662
663 error = xfs_inobt_get_rec(cur, &rec, &j);
664 if (error)
665 goto error0;
666 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
667
668 if (rec.ir_freecount > 0) {
669 /*
670 * Found a free inode in the same chunk
671 * as the parent, done.
672 */
673 goto alloc_inode;
674 }
675
676
677 /*
678 * In the same AG as parent, but parent's chunk is full.
679 */
680
681 /* duplicate the cursor, search left & right simultaneously */
682 error = xfs_btree_dup_cursor(cur, &tcur);
683 if (error)
684 goto error0;
685
686 /*
687 * Skip to last blocks looked up if same parent inode.
688 */
689 if (pagino != NULLAGINO &&
690 pag->pagl_pagino == pagino &&
691 pag->pagl_leftrec != NULLAGINO &&
692 pag->pagl_rightrec != NULLAGINO) {
693 error = xfs_ialloc_get_rec(tcur, pag->pagl_leftrec,
694 &trec, &doneleft, 1);
695 if (error)
696 goto error1;
697
698 error = xfs_ialloc_get_rec(cur, pag->pagl_rightrec,
699 &rec, &doneright, 0);
700 if (error)
701 goto error1;
702 } else {
703 /* search left with tcur, back up 1 record */
704 error = xfs_ialloc_next_rec(tcur, &trec, &doneleft, 1);
705 if (error)
706 goto error1;
707
708 /* search right with cur, go forward 1 record. */
709 error = xfs_ialloc_next_rec(cur, &rec, &doneright, 0);
710 if (error)
711 goto error1;
712 }
713
714 /*
715 * Loop until we find an inode chunk with a free inode.
716 */
717 while (!doneleft || !doneright) {
718 int useleft; /* using left inode chunk this time */
719
720 if (!--searchdistance) {
721 /*
722 * Not in range - save last search
723 * location and allocate a new inode
724 */
725 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
726 pag->pagl_leftrec = trec.ir_startino;
727 pag->pagl_rightrec = rec.ir_startino;
728 pag->pagl_pagino = pagino;
729 goto newino;
730 }
731
732 /* figure out the closer block if both are valid. */
733 if (!doneleft && !doneright) {
734 useleft = pagino -
735 (trec.ir_startino + XFS_INODES_PER_CHUNK - 1) <
736 rec.ir_startino - pagino;
737 } else {
738 useleft = !doneleft;
739 }
740
741 /* free inodes to the left? */
742 if (useleft && trec.ir_freecount) {
743 rec = trec;
744 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
745 cur = tcur;
746
747 pag->pagl_leftrec = trec.ir_startino;
748 pag->pagl_rightrec = rec.ir_startino;
749 pag->pagl_pagino = pagino;
750 goto alloc_inode;
751 }
752
753 /* free inodes to the right? */
754 if (!useleft && rec.ir_freecount) {
755 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
756
757 pag->pagl_leftrec = trec.ir_startino;
758 pag->pagl_rightrec = rec.ir_startino;
759 pag->pagl_pagino = pagino;
760 goto alloc_inode;
761 }
762
763 /* get next record to check */
764 if (useleft) {
765 error = xfs_ialloc_next_rec(tcur, &trec,
766 &doneleft, 1);
767 } else {
768 error = xfs_ialloc_next_rec(cur, &rec,
769 &doneright, 0);
770 }
771 if (error)
772 goto error1;
773 }
774
775 /*
776 * We've reached the end of the btree. because
777 * we are only searching a small chunk of the
778 * btree each search, there is obviously free
779 * inodes closer to the parent inode than we
780 * are now. restart the search again.
781 */
782 pag->pagl_pagino = NULLAGINO;
783 pag->pagl_leftrec = NULLAGINO;
784 pag->pagl_rightrec = NULLAGINO;
785 xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
786 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
787 goto restart_pagno;
788 }
789
790 /*
791 * In a different AG from the parent.
792 * See if the most recently allocated block has any free.
793 */
794 newino:
795 if (agi->agi_newino != cpu_to_be32(NULLAGINO)) {
796 error = xfs_inobt_lookup(cur, be32_to_cpu(agi->agi_newino),
797 XFS_LOOKUP_EQ, &i);
798 if (error)
799 goto error0;
800
801 if (i == 1) {
802 error = xfs_inobt_get_rec(cur, &rec, &j);
803 if (error)
804 goto error0;
805
806 if (j == 1 && rec.ir_freecount > 0) {
807 /*
808 * The last chunk allocated in the group
809 * still has a free inode.
810 */
811 goto alloc_inode;
812 }
813 }
814 }
815
816 /*
817 * None left in the last group, search the whole AG
818 */
819 error = xfs_inobt_lookup(cur, 0, XFS_LOOKUP_GE, &i);
820 if (error)
821 goto error0;
822 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
823
824 for (;;) {
825 error = xfs_inobt_get_rec(cur, &rec, &i);
826 if (error)
827 goto error0;
828 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
829 if (rec.ir_freecount > 0)
830 break;
831 error = xfs_btree_increment(cur, 0, &i);
832 if (error)
833 goto error0;
834 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
835 }
836
837 alloc_inode:
838 offset = xfs_lowbit64(rec.ir_free);
839 ASSERT(offset >= 0);
840 ASSERT(offset < XFS_INODES_PER_CHUNK);
841 ASSERT((XFS_AGINO_TO_OFFSET(mp, rec.ir_startino) %
842 XFS_INODES_PER_CHUNK) == 0);
843 ino = XFS_AGINO_TO_INO(mp, agno, rec.ir_startino + offset);
844 rec.ir_free &= ~XFS_INOBT_MASK(offset);
845 rec.ir_freecount--;
846 error = xfs_inobt_update(cur, &rec);
847 if (error)
848 goto error0;
849 be32_add_cpu(&agi->agi_freecount, -1);
850 xfs_ialloc_log_agi(tp, agbp, XFS_AGI_FREECOUNT);
851 pag->pagi_freecount--;
852
853 error = xfs_check_agi_freecount(cur, agi);
854 if (error)
855 goto error0;
856
857 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
858 xfs_trans_mod_sb(tp, XFS_TRANS_SB_IFREE, -1);
859 xfs_perag_put(pag);
860 *inop = ino;
861 return 0;
862 error1:
863 xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR);
864 error0:
865 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
866 xfs_perag_put(pag);
867 return error;
868 }
869
870 /*
871 * Allocate an inode on disk.
872 *
873 * Mode is used to tell whether the new inode will need space, and whether it
874 * is a directory.
875 *
876 * This function is designed to be called twice if it has to do an allocation
877 * to make more free inodes. On the first call, *IO_agbp should be set to NULL.
878 * If an inode is available without having to performn an allocation, an inode
879 * number is returned. In this case, *IO_agbp would be NULL. If an allocation
880 * needes to be done, xfs_dialloc would return the current AGI buffer in
881 * *IO_agbp. The caller should then commit the current transaction, allocate a
882 * new transaction, and call xfs_dialloc() again, passing in the previous value
883 * of *IO_agbp. IO_agbp should be held across the transactions. Since the AGI
884 * buffer is locked across the two calls, the second call is guaranteed to have
885 * a free inode available.
886 *
887 * Once we successfully pick an inode its number is returned and the on-disk
888 * data structures are updated. The inode itself is not read in, since doing so
889 * would break ordering constraints with xfs_reclaim.
890 */
891 int
892 xfs_dialloc(
893 struct xfs_trans *tp,
894 xfs_ino_t parent,
895 umode_t mode,
896 int okalloc,
897 struct xfs_buf **IO_agbp,
898 xfs_ino_t *inop)
899 {
900 struct xfs_buf *agbp;
901 xfs_agnumber_t agno;
902 struct xfs_agi *agi;
903 int error;
904 int ialloced;
905 int noroom = 0;
906 struct xfs_mount *mp;
907 xfs_agnumber_t tagno;
908 struct xfs_perag *pag;
909
910 if (*IO_agbp == NULL) {
911 /*
912 * We do not have an agbp, so select an initial allocation
913 * group for inode allocation.
914 */
915 agbp = xfs_ialloc_ag_select(tp, parent, mode, okalloc);
916 /*
917 * Couldn't find an allocation group satisfying the
918 * criteria, give up.
919 */
920 if (!agbp) {
921 *inop = NULLFSINO;
922 return 0;
923 }
924 agi = XFS_BUF_TO_AGI(agbp);
925 ASSERT(agi->agi_magicnum == cpu_to_be32(XFS_AGI_MAGIC));
926 } else {
927 /*
928 * Continue where we left off before. In this case, we
929 * know that the allocation group has free inodes.
930 */
931 agbp = *IO_agbp;
932 agi = XFS_BUF_TO_AGI(agbp);
933 ASSERT(agi->agi_magicnum == cpu_to_be32(XFS_AGI_MAGIC));
934 ASSERT(be32_to_cpu(agi->agi_freecount) > 0);
935 }
936 mp = tp->t_mountp;
937 agno = be32_to_cpu(agi->agi_seqno);
938 tagno = agno;
939
940 /*
941 * If we have already hit the ceiling of inode blocks then clear
942 * okalloc so we scan all available agi structures for a free
943 * inode.
944 */
945
946 if (mp->m_maxicount &&
947 mp->m_sb.sb_icount + XFS_IALLOC_INODES(mp) > mp->m_maxicount) {
948 noroom = 1;
949 okalloc = 0;
950 }
951
952 /*
953 * Loop until we find an allocation group that either has free inodes
954 * or in which we can allocate some inodes. Iterate through the
955 * allocation groups upward, wrapping at the end.
956 */
957 while (!agi->agi_freecount) {
958 /*
959 * Don't do anything if we're not supposed to allocate
960 * any blocks, just go on to the next ag.
961 */
962 if (okalloc) {
963 /*
964 * Try to allocate some new inodes in the allocation
965 * group.
966 */
967 if ((error = xfs_ialloc_ag_alloc(tp, agbp, &ialloced))) {
968 xfs_trans_brelse(tp, agbp);
969 if (error == ENOSPC) {
970 *inop = NULLFSINO;
971 return 0;
972 } else
973 return error;
974 }
975 if (ialloced) {
976 /*
977 * We successfully allocated some inodes, return
978 * the current context to the caller so that it
979 * can commit the current transaction and call
980 * us again where we left off.
981 */
982 ASSERT(be32_to_cpu(agi->agi_freecount) > 0);
983 *IO_agbp = agbp;
984 *inop = NULLFSINO;
985 return 0;
986 }
987 }
988 /*
989 * If it failed, give up on this ag.
990 */
991 xfs_trans_brelse(tp, agbp);
992 /*
993 * Go on to the next ag: get its ag header.
994 */
995 nextag:
996 if (++tagno == mp->m_sb.sb_agcount)
997 tagno = 0;
998 if (tagno == agno) {
999 *inop = NULLFSINO;
1000 return noroom ? ENOSPC : 0;
1001 }
1002 pag = xfs_perag_get(mp, tagno);
1003 if (pag->pagi_inodeok == 0) {
1004 xfs_perag_put(pag);
1005 goto nextag;
1006 }
1007 error = xfs_ialloc_read_agi(mp, tp, tagno, &agbp);
1008 xfs_perag_put(pag);
1009 if (error)
1010 goto nextag;
1011 agi = XFS_BUF_TO_AGI(agbp);
1012 ASSERT(agi->agi_magicnum == cpu_to_be32(XFS_AGI_MAGIC));
1013 }
1014
1015 *IO_agbp = NULL;
1016 return xfs_dialloc_ag(tp, agbp, parent, inop);
1017 }
1018
1019 /*
1020 * Free disk inode. Carefully avoids touching the incore inode, all
1021 * manipulations incore are the caller's responsibility.
1022 * The on-disk inode is not changed by this operation, only the
1023 * btree (free inode mask) is changed.
1024 */
1025 int
1026 xfs_difree(
1027 xfs_trans_t *tp, /* transaction pointer */
1028 xfs_ino_t inode, /* inode to be freed */
1029 xfs_bmap_free_t *flist, /* extents to free */
1030 int *delete, /* set if inode cluster was deleted */
1031 xfs_ino_t *first_ino) /* first inode in deleted cluster */
1032 {
1033 /* REFERENCED */
1034 xfs_agblock_t agbno; /* block number containing inode */
1035 xfs_buf_t *agbp; /* buffer containing allocation group header */
1036 xfs_agino_t agino; /* inode number relative to allocation group */
1037 xfs_agnumber_t agno; /* allocation group number */
1038 xfs_agi_t *agi; /* allocation group header */
1039 xfs_btree_cur_t *cur; /* inode btree cursor */
1040 int error; /* error return value */
1041 int i; /* result code */
1042 int ilen; /* inodes in an inode cluster */
1043 xfs_mount_t *mp; /* mount structure for filesystem */
1044 int off; /* offset of inode in inode chunk */
1045 xfs_inobt_rec_incore_t rec; /* btree record */
1046 struct xfs_perag *pag;
1047
1048 mp = tp->t_mountp;
1049
1050 /*
1051 * Break up inode number into its components.
1052 */
1053 agno = XFS_INO_TO_AGNO(mp, inode);
1054 if (agno >= mp->m_sb.sb_agcount) {
1055 xfs_warn(mp, "%s: agno >= mp->m_sb.sb_agcount (%d >= %d).",
1056 __func__, agno, mp->m_sb.sb_agcount);
1057 ASSERT(0);
1058 return XFS_ERROR(EINVAL);
1059 }
1060 agino = XFS_INO_TO_AGINO(mp, inode);
1061 if (inode != XFS_AGINO_TO_INO(mp, agno, agino)) {
1062 xfs_warn(mp, "%s: inode != XFS_AGINO_TO_INO() (%llu != %llu).",
1063 __func__, (unsigned long long)inode,
1064 (unsigned long long)XFS_AGINO_TO_INO(mp, agno, agino));
1065 ASSERT(0);
1066 return XFS_ERROR(EINVAL);
1067 }
1068 agbno = XFS_AGINO_TO_AGBNO(mp, agino);
1069 if (agbno >= mp->m_sb.sb_agblocks) {
1070 xfs_warn(mp, "%s: agbno >= mp->m_sb.sb_agblocks (%d >= %d).",
1071 __func__, agbno, mp->m_sb.sb_agblocks);
1072 ASSERT(0);
1073 return XFS_ERROR(EINVAL);
1074 }
1075 /*
1076 * Get the allocation group header.
1077 */
1078 error = xfs_ialloc_read_agi(mp, tp, agno, &agbp);
1079 if (error) {
1080 xfs_warn(mp, "%s: xfs_ialloc_read_agi() returned error %d.",
1081 __func__, error);
1082 return error;
1083 }
1084 agi = XFS_BUF_TO_AGI(agbp);
1085 ASSERT(agi->agi_magicnum == cpu_to_be32(XFS_AGI_MAGIC));
1086 ASSERT(agbno < be32_to_cpu(agi->agi_length));
1087 /*
1088 * Initialize the cursor.
1089 */
1090 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno);
1091
1092 error = xfs_check_agi_freecount(cur, agi);
1093 if (error)
1094 goto error0;
1095
1096 /*
1097 * Look for the entry describing this inode.
1098 */
1099 if ((error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &i))) {
1100 xfs_warn(mp, "%s: xfs_inobt_lookup() returned error %d.",
1101 __func__, error);
1102 goto error0;
1103 }
1104 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
1105 error = xfs_inobt_get_rec(cur, &rec, &i);
1106 if (error) {
1107 xfs_warn(mp, "%s: xfs_inobt_get_rec() returned error %d.",
1108 __func__, error);
1109 goto error0;
1110 }
1111 XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
1112 /*
1113 * Get the offset in the inode chunk.
1114 */
1115 off = agino - rec.ir_startino;
1116 ASSERT(off >= 0 && off < XFS_INODES_PER_CHUNK);
1117 ASSERT(!(rec.ir_free & XFS_INOBT_MASK(off)));
1118 /*
1119 * Mark the inode free & increment the count.
1120 */
1121 rec.ir_free |= XFS_INOBT_MASK(off);
1122 rec.ir_freecount++;
1123
1124 /*
1125 * When an inode cluster is free, it becomes eligible for removal
1126 */
1127 if (!(mp->m_flags & XFS_MOUNT_IKEEP) &&
1128 (rec.ir_freecount == XFS_IALLOC_INODES(mp))) {
1129
1130 *delete = 1;
1131 *first_ino = XFS_AGINO_TO_INO(mp, agno, rec.ir_startino);
1132
1133 /*
1134 * Remove the inode cluster from the AGI B+Tree, adjust the
1135 * AGI and Superblock inode counts, and mark the disk space
1136 * to be freed when the transaction is committed.
1137 */
1138 ilen = XFS_IALLOC_INODES(mp);
1139 be32_add_cpu(&agi->agi_count, -ilen);
1140 be32_add_cpu(&agi->agi_freecount, -(ilen - 1));
1141 xfs_ialloc_log_agi(tp, agbp, XFS_AGI_COUNT | XFS_AGI_FREECOUNT);
1142 pag = xfs_perag_get(mp, agno);
1143 pag->pagi_freecount -= ilen - 1;
1144 xfs_perag_put(pag);
1145 xfs_trans_mod_sb(tp, XFS_TRANS_SB_ICOUNT, -ilen);
1146 xfs_trans_mod_sb(tp, XFS_TRANS_SB_IFREE, -(ilen - 1));
1147
1148 if ((error = xfs_btree_delete(cur, &i))) {
1149 xfs_warn(mp, "%s: xfs_btree_delete returned error %d.",
1150 __func__, error);
1151 goto error0;
1152 }
1153
1154 xfs_bmap_add_free(XFS_AGB_TO_FSB(mp,
1155 agno, XFS_INO_TO_AGBNO(mp,rec.ir_startino)),
1156 XFS_IALLOC_BLOCKS(mp), flist, mp);
1157 } else {
1158 *delete = 0;
1159
1160 error = xfs_inobt_update(cur, &rec);
1161 if (error) {
1162 xfs_warn(mp, "%s: xfs_inobt_update returned error %d.",
1163 __func__, error);
1164 goto error0;
1165 }
1166
1167 /*
1168 * Change the inode free counts and log the ag/sb changes.
1169 */
1170 be32_add_cpu(&agi->agi_freecount, 1);
1171 xfs_ialloc_log_agi(tp, agbp, XFS_AGI_FREECOUNT);
1172 pag = xfs_perag_get(mp, agno);
1173 pag->pagi_freecount++;
1174 xfs_perag_put(pag);
1175 xfs_trans_mod_sb(tp, XFS_TRANS_SB_IFREE, 1);
1176 }
1177
1178 error = xfs_check_agi_freecount(cur, agi);
1179 if (error)
1180 goto error0;
1181
1182 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1183 return 0;
1184
1185 error0:
1186 xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
1187 return error;
1188 }
1189
1190 STATIC int
1191 xfs_imap_lookup(
1192 struct xfs_mount *mp,
1193 struct xfs_trans *tp,
1194 xfs_agnumber_t agno,
1195 xfs_agino_t agino,
1196 xfs_agblock_t agbno,
1197 xfs_agblock_t *chunk_agbno,
1198 xfs_agblock_t *offset_agbno,
1199 int flags)
1200 {
1201 struct xfs_inobt_rec_incore rec;
1202 struct xfs_btree_cur *cur;
1203 struct xfs_buf *agbp;
1204 int error;
1205 int i;
1206
1207 error = xfs_ialloc_read_agi(mp, tp, agno, &agbp);
1208 if (error) {
1209 xfs_alert(mp,
1210 "%s: xfs_ialloc_read_agi() returned error %d, agno %d",
1211 __func__, error, agno);
1212 return error;
1213 }
1214
1215 /*
1216 * Lookup the inode record for the given agino. If the record cannot be
1217 * found, then it's an invalid inode number and we should abort. Once
1218 * we have a record, we need to ensure it contains the inode number
1219 * we are looking up.
1220 */
1221 cur = xfs_inobt_init_cursor(mp, tp, agbp, agno);
1222 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &i);
1223 if (!error) {
1224 if (i)
1225 error = xfs_inobt_get_rec(cur, &rec, &i);
1226 if (!error && i == 0)
1227 error = EINVAL;
1228 }
1229
1230 xfs_trans_brelse(tp, agbp);
1231 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
1232 if (error)
1233 return error;
1234
1235 /* check that the returned record contains the required inode */
1236 if (rec.ir_startino > agino ||
1237 rec.ir_startino + XFS_IALLOC_INODES(mp) <= agino)
1238 return EINVAL;
1239
1240 /* for untrusted inodes check it is allocated first */
1241 if ((flags & XFS_IGET_UNTRUSTED) &&
1242 (rec.ir_free & XFS_INOBT_MASK(agino - rec.ir_startino)))
1243 return EINVAL;
1244
1245 *chunk_agbno = XFS_AGINO_TO_AGBNO(mp, rec.ir_startino);
1246 *offset_agbno = agbno - *chunk_agbno;
1247 return 0;
1248 }
1249
1250 /*
1251 * Return the location of the inode in imap, for mapping it into a buffer.
1252 */
1253 int
1254 xfs_imap(
1255 xfs_mount_t *mp, /* file system mount structure */
1256 xfs_trans_t *tp, /* transaction pointer */
1257 xfs_ino_t ino, /* inode to locate */
1258 struct xfs_imap *imap, /* location map structure */
1259 uint flags) /* flags for inode btree lookup */
1260 {
1261 xfs_agblock_t agbno; /* block number of inode in the alloc group */
1262 xfs_agino_t agino; /* inode number within alloc group */
1263 xfs_agnumber_t agno; /* allocation group number */
1264 int blks_per_cluster; /* num blocks per inode cluster */
1265 xfs_agblock_t chunk_agbno; /* first block in inode chunk */
1266 xfs_agblock_t cluster_agbno; /* first block in inode cluster */
1267 int error; /* error code */
1268 int offset; /* index of inode in its buffer */
1269 int offset_agbno; /* blks from chunk start to inode */
1270
1271 ASSERT(ino != NULLFSINO);
1272
1273 /*
1274 * Split up the inode number into its parts.
1275 */
1276 agno = XFS_INO_TO_AGNO(mp, ino);
1277 agino = XFS_INO_TO_AGINO(mp, ino);
1278 agbno = XFS_AGINO_TO_AGBNO(mp, agino);
1279 if (agno >= mp->m_sb.sb_agcount || agbno >= mp->m_sb.sb_agblocks ||
1280 ino != XFS_AGINO_TO_INO(mp, agno, agino)) {
1281 #ifdef DEBUG
1282 /*
1283 * Don't output diagnostic information for untrusted inodes
1284 * as they can be invalid without implying corruption.
1285 */
1286 if (flags & XFS_IGET_UNTRUSTED)
1287 return XFS_ERROR(EINVAL);
1288 if (agno >= mp->m_sb.sb_agcount) {
1289 xfs_alert(mp,
1290 "%s: agno (%d) >= mp->m_sb.sb_agcount (%d)",
1291 __func__, agno, mp->m_sb.sb_agcount);
1292 }
1293 if (agbno >= mp->m_sb.sb_agblocks) {
1294 xfs_alert(mp,
1295 "%s: agbno (0x%llx) >= mp->m_sb.sb_agblocks (0x%lx)",
1296 __func__, (unsigned long long)agbno,
1297 (unsigned long)mp->m_sb.sb_agblocks);
1298 }
1299 if (ino != XFS_AGINO_TO_INO(mp, agno, agino)) {
1300 xfs_alert(mp,
1301 "%s: ino (0x%llx) != XFS_AGINO_TO_INO() (0x%llx)",
1302 __func__, ino,
1303 XFS_AGINO_TO_INO(mp, agno, agino));
1304 }
1305 xfs_stack_trace();
1306 #endif /* DEBUG */
1307 return XFS_ERROR(EINVAL);
1308 }
1309
1310 blks_per_cluster = XFS_INODE_CLUSTER_SIZE(mp) >> mp->m_sb.sb_blocklog;
1311
1312 /*
1313 * For bulkstat and handle lookups, we have an untrusted inode number
1314 * that we have to verify is valid. We cannot do this just by reading
1315 * the inode buffer as it may have been unlinked and removed leaving
1316 * inodes in stale state on disk. Hence we have to do a btree lookup
1317 * in all cases where an untrusted inode number is passed.
1318 */
1319 if (flags & XFS_IGET_UNTRUSTED) {
1320 error = xfs_imap_lookup(mp, tp, agno, agino, agbno,
1321 &chunk_agbno, &offset_agbno, flags);
1322 if (error)
1323 return error;
1324 goto out_map;
1325 }
1326
1327 /*
1328 * If the inode cluster size is the same as the blocksize or
1329 * smaller we get to the buffer by simple arithmetics.
1330 */
1331 if (XFS_INODE_CLUSTER_SIZE(mp) <= mp->m_sb.sb_blocksize) {
1332 offset = XFS_INO_TO_OFFSET(mp, ino);
1333 ASSERT(offset < mp->m_sb.sb_inopblock);
1334
1335 imap->im_blkno = XFS_AGB_TO_DADDR(mp, agno, agbno);
1336 imap->im_len = XFS_FSB_TO_BB(mp, 1);
1337 imap->im_boffset = (ushort)(offset << mp->m_sb.sb_inodelog);
1338 return 0;
1339 }
1340
1341 /*
1342 * If the inode chunks are aligned then use simple maths to
1343 * find the location. Otherwise we have to do a btree
1344 * lookup to find the location.
1345 */
1346 if (mp->m_inoalign_mask) {
1347 offset_agbno = agbno & mp->m_inoalign_mask;
1348 chunk_agbno = agbno - offset_agbno;
1349 } else {
1350 error = xfs_imap_lookup(mp, tp, agno, agino, agbno,
1351 &chunk_agbno, &offset_agbno, flags);
1352 if (error)
1353 return error;
1354 }
1355
1356 out_map:
1357 ASSERT(agbno >= chunk_agbno);
1358 cluster_agbno = chunk_agbno +
1359 ((offset_agbno / blks_per_cluster) * blks_per_cluster);
1360 offset = ((agbno - cluster_agbno) * mp->m_sb.sb_inopblock) +
1361 XFS_INO_TO_OFFSET(mp, ino);
1362
1363 imap->im_blkno = XFS_AGB_TO_DADDR(mp, agno, cluster_agbno);
1364 imap->im_len = XFS_FSB_TO_BB(mp, blks_per_cluster);
1365 imap->im_boffset = (ushort)(offset << mp->m_sb.sb_inodelog);
1366
1367 /*
1368 * If the inode number maps to a block outside the bounds
1369 * of the file system then return NULL rather than calling
1370 * read_buf and panicing when we get an error from the
1371 * driver.
1372 */
1373 if ((imap->im_blkno + imap->im_len) >
1374 XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks)) {
1375 xfs_alert(mp,
1376 "%s: (im_blkno (0x%llx) + im_len (0x%llx)) > sb_dblocks (0x%llx)",
1377 __func__, (unsigned long long) imap->im_blkno,
1378 (unsigned long long) imap->im_len,
1379 XFS_FSB_TO_BB(mp, mp->m_sb.sb_dblocks));
1380 return XFS_ERROR(EINVAL);
1381 }
1382 return 0;
1383 }
1384
1385 /*
1386 * Compute and fill in value of m_in_maxlevels.
1387 */
1388 void
1389 xfs_ialloc_compute_maxlevels(
1390 xfs_mount_t *mp) /* file system mount structure */
1391 {
1392 int level;
1393 uint maxblocks;
1394 uint maxleafents;
1395 int minleafrecs;
1396 int minnoderecs;
1397
1398 maxleafents = (1LL << XFS_INO_AGINO_BITS(mp)) >>
1399 XFS_INODES_PER_CHUNK_LOG;
1400 minleafrecs = mp->m_alloc_mnr[0];
1401 minnoderecs = mp->m_alloc_mnr[1];
1402 maxblocks = (maxleafents + minleafrecs - 1) / minleafrecs;
1403 for (level = 1; maxblocks > 1; level++)
1404 maxblocks = (maxblocks + minnoderecs - 1) / minnoderecs;
1405 mp->m_in_maxlevels = level;
1406 }
1407
1408 /*
1409 * Log specified fields for the ag hdr (inode section)
1410 */
1411 void
1412 xfs_ialloc_log_agi(
1413 xfs_trans_t *tp, /* transaction pointer */
1414 xfs_buf_t *bp, /* allocation group header buffer */
1415 int fields) /* bitmask of fields to log */
1416 {
1417 int first; /* first byte number */
1418 int last; /* last byte number */
1419 static const short offsets[] = { /* field starting offsets */
1420 /* keep in sync with bit definitions */
1421 offsetof(xfs_agi_t, agi_magicnum),
1422 offsetof(xfs_agi_t, agi_versionnum),
1423 offsetof(xfs_agi_t, agi_seqno),
1424 offsetof(xfs_agi_t, agi_length),
1425 offsetof(xfs_agi_t, agi_count),
1426 offsetof(xfs_agi_t, agi_root),
1427 offsetof(xfs_agi_t, agi_level),
1428 offsetof(xfs_agi_t, agi_freecount),
1429 offsetof(xfs_agi_t, agi_newino),
1430 offsetof(xfs_agi_t, agi_dirino),
1431 offsetof(xfs_agi_t, agi_unlinked),
1432 sizeof(xfs_agi_t)
1433 };
1434 #ifdef DEBUG
1435 xfs_agi_t *agi; /* allocation group header */
1436
1437 agi = XFS_BUF_TO_AGI(bp);
1438 ASSERT(agi->agi_magicnum == cpu_to_be32(XFS_AGI_MAGIC));
1439 #endif
1440 /*
1441 * Compute byte offsets for the first and last fields.
1442 */
1443 xfs_btree_offsets(fields, offsets, XFS_AGI_NUM_BITS, &first, &last);
1444 /*
1445 * Log the allocation group inode header buffer.
1446 */
1447 xfs_trans_log_buf(tp, bp, first, last);
1448 }
1449
1450 #ifdef DEBUG
1451 STATIC void
1452 xfs_check_agi_unlinked(
1453 struct xfs_agi *agi)
1454 {
1455 int i;
1456
1457 for (i = 0; i < XFS_AGI_UNLINKED_BUCKETS; i++)
1458 ASSERT(agi->agi_unlinked[i]);
1459 }
1460 #else
1461 #define xfs_check_agi_unlinked(agi)
1462 #endif
1463
1464 /*
1465 * Read in the allocation group header (inode allocation section)
1466 */
1467 int
1468 xfs_read_agi(
1469 struct xfs_mount *mp, /* file system mount structure */
1470 struct xfs_trans *tp, /* transaction pointer */
1471 xfs_agnumber_t agno, /* allocation group number */
1472 struct xfs_buf **bpp) /* allocation group hdr buf */
1473 {
1474 struct xfs_agi *agi; /* allocation group header */
1475 int agi_ok; /* agi is consistent */
1476 int error;
1477
1478 ASSERT(agno != NULLAGNUMBER);
1479
1480 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp,
1481 XFS_AG_DADDR(mp, agno, XFS_AGI_DADDR(mp)),
1482 XFS_FSS_TO_BB(mp, 1), 0, bpp);
1483 if (error)
1484 return error;
1485
1486 ASSERT(!xfs_buf_geterror(*bpp));
1487 agi = XFS_BUF_TO_AGI(*bpp);
1488
1489 /*
1490 * Validate the magic number of the agi block.
1491 */
1492 agi_ok = agi->agi_magicnum == cpu_to_be32(XFS_AGI_MAGIC) &&
1493 XFS_AGI_GOOD_VERSION(be32_to_cpu(agi->agi_versionnum)) &&
1494 be32_to_cpu(agi->agi_seqno) == agno;
1495 if (unlikely(XFS_TEST_ERROR(!agi_ok, mp, XFS_ERRTAG_IALLOC_READ_AGI,
1496 XFS_RANDOM_IALLOC_READ_AGI))) {
1497 XFS_CORRUPTION_ERROR("xfs_read_agi", XFS_ERRLEVEL_LOW,
1498 mp, agi);
1499 xfs_trans_brelse(tp, *bpp);
1500 return XFS_ERROR(EFSCORRUPTED);
1501 }
1502
1503 xfs_buf_set_ref(*bpp, XFS_AGI_REF);
1504
1505 xfs_check_agi_unlinked(agi);
1506 return 0;
1507 }
1508
1509 int
1510 xfs_ialloc_read_agi(
1511 struct xfs_mount *mp, /* file system mount structure */
1512 struct xfs_trans *tp, /* transaction pointer */
1513 xfs_agnumber_t agno, /* allocation group number */
1514 struct xfs_buf **bpp) /* allocation group hdr buf */
1515 {
1516 struct xfs_agi *agi; /* allocation group header */
1517 struct xfs_perag *pag; /* per allocation group data */
1518 int error;
1519
1520 error = xfs_read_agi(mp, tp, agno, bpp);
1521 if (error)
1522 return error;
1523
1524 agi = XFS_BUF_TO_AGI(*bpp);
1525 pag = xfs_perag_get(mp, agno);
1526 if (!pag->pagi_init) {
1527 pag->pagi_freecount = be32_to_cpu(agi->agi_freecount);
1528 pag->pagi_count = be32_to_cpu(agi->agi_count);
1529 pag->pagi_init = 1;
1530 }
1531
1532 /*
1533 * It's possible for these to be out of sync if
1534 * we are in the middle of a forced shutdown.
1535 */
1536 ASSERT(pag->pagi_freecount == be32_to_cpu(agi->agi_freecount) ||
1537 XFS_FORCED_SHUTDOWN(mp));
1538 xfs_perag_put(pag);
1539 return 0;
1540 }
1541
1542 /*
1543 * Read in the agi to initialise the per-ag data in the mount structure
1544 */
1545 int
1546 xfs_ialloc_pagi_init(
1547 xfs_mount_t *mp, /* file system mount structure */
1548 xfs_trans_t *tp, /* transaction pointer */
1549 xfs_agnumber_t agno) /* allocation group number */
1550 {
1551 xfs_buf_t *bp = NULL;
1552 int error;
1553
1554 error = xfs_ialloc_read_agi(mp, tp, agno, &bp);
1555 if (error)
1556 return error;
1557 if (bp)
1558 xfs_trans_brelse(tp, bp);
1559 return 0;
1560 }
This page took 0.073577 seconds and 6 git commands to generate.