2 * Copyright (c) 2012 Semihalf
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 #include <sys/cdefs.h>
27 __FBSDID("$FreeBSD$");
29 #include <sys/param.h>
30 #include <sys/systm.h>
31 #include <sys/namei.h>
32 #include <sys/kernel.h>
37 #include <sys/mount.h>
38 #include <sys/vnode.h>
39 #include <sys/signalvar.h>
40 #include <sys/malloc.h>
41 #include <sys/dirent.h>
42 #include <sys/lockf.h>
47 #include <vm/vm_extern.h>
48 #include <vm/vm_object.h>
49 #include <vm/vnode_pager.h>
51 #include <machine/_inttypes.h>
54 #include <vm/vm_extern.h>
55 #include <vm/vm_object.h>
56 #include <vm/vnode_pager.h>
58 #include "nandfs_mount.h"
60 #include "nandfs_subr.h"
63 static int bmap_getlbns(struct nandfs_node *, nandfs_lbn_t,
64 struct nandfs_indir *, int *);
67 bmap_lookup(struct nandfs_node *node, nandfs_lbn_t lblk, nandfs_daddr_t *vblk)
69 struct nandfs_inode *ip;
70 struct nandfs_indir a[NANDFS_NIADDR + 1], *ap;
76 DPRINTF(BMAP, ("%s: node %p lblk %jx enter\n", __func__, node, lblk));
82 error = bmap_getlbns(node, lblk, ap, nump);
87 *vblk = ip->i_db[lblk];
91 DPRINTF(BMAP, ("%s: node %p lblk=%jx trying ip->i_ib[%x]\n", __func__,
92 node, lblk, ap->in_off));
93 daddr = ip->i_ib[ap->in_off];
94 for (bp = NULL, ++ap; --num; ap++) {
96 DPRINTF(BMAP, ("%s: node %p lblk=%jx returning with "
97 "vblk 0\n", __func__, node, lblk));
101 if (ap->in_lbn == lblk) {
102 DPRINTF(BMAP, ("%s: node %p lblk=%jx ap->in_lbn=%jx "
103 "returning address of indirect block (%jx)\n",
104 __func__, node, lblk, ap->in_lbn, daddr));
109 DPRINTF(BMAP, ("%s: node %p lblk=%jx reading block "
110 "ap->in_lbn=%jx\n", __func__, node, lblk, ap->in_lbn));
112 error = nandfs_bread_meta(node, ap->in_lbn, NOCRED, 0, &bp);
118 daddr = ((nandfs_daddr_t *)bp->b_data)[ap->in_off];
122 DPRINTF(BMAP, ("%s: node %p lblk=%jx returning with %jx\n", __func__,
130 bmap_dirty_meta(struct nandfs_node *node, nandfs_lbn_t lblk, int force)
132 struct nandfs_indir a[NANDFS_NIADDR+1], *ap;
134 nandfs_daddr_t daddr;
140 DPRINTF(BMAP, ("%s: node %p lblk=%jx\n", __func__, node, lblk));
145 error = bmap_getlbns(node, lblk, ap, nump);
150 * Direct block, nothing to do
155 DPRINTF(BMAP, ("%s: node %p reading blocks\n", __func__, node));
157 for (bp = NULL, ++ap; --num; ap++) {
158 error = nandfs_bread_meta(node, ap->in_lbn, NOCRED, 0, &bp);
165 daddr = ((nandfs_daddr_t *)bp->b_data)[ap->in_off];
166 MPASS(daddr != 0 || node->nn_ino == 3);
169 error = nandfs_dirty_buf_meta(bp, force);
178 bmap_insert_block(struct nandfs_node *node, nandfs_lbn_t lblk,
181 struct nandfs_inode *ip;
182 struct nandfs_indir a[NANDFS_NIADDR+1], *ap;
184 nandfs_daddr_t daddr;
188 DPRINTF(BMAP, ("%s: node %p lblk=%jx vblk=%jx\n", __func__, node, lblk,
191 ip = &node->nn_inode;
196 error = bmap_getlbns(node, lblk, ap, nump);
200 DPRINTF(BMAP, ("%s: node %p lblk=%jx vblk=%jx got num=%d\n", __func__,
201 node, lblk, vblk, num));
204 DPRINTF(BMAP, ("%s: node %p lblk=%jx direct block\n", __func__,
206 ip->i_db[lblk] = vblk;
210 DPRINTF(BMAP, ("%s: node %p lblk=%jx indirect block level %d\n",
211 __func__, node, lblk, ap->in_off));
214 DPRINTF(BMAP, ("%s: node %p lblk=%jx indirect block: inserting "
215 "%jx as vblk for indirect block %d\n", __func__, node,
216 lblk, vblk, ap->in_off));
217 ip->i_ib[ap->in_off] = vblk;
222 daddr = ip->i_ib[a[0].in_off];
223 for (i = 1; i < num; i++) {
227 DPRINTF(BMAP, ("%s: node %p lblk=%jx vblk=%jx create "
228 "block %jx %d\n", __func__, node, lblk, vblk,
229 a[i].in_lbn, a[i].in_off));
230 error = nandfs_bcreate_meta(node, a[i].in_lbn, NOCRED,
235 DPRINTF(BMAP, ("%s: node %p lblk=%jx vblk=%jx read "
236 "block %jx %d\n", __func__, node, daddr, vblk,
237 a[i].in_lbn, a[i].in_off));
238 error = nandfs_bread_meta(node, a[i].in_lbn, NOCRED, 0, &bp);
244 daddr = ((nandfs_daddr_t *)bp->b_data)[a[i].in_off];
249 ("%s: bmap node %p lblk=%jx vblk=%jx inserting vblk level %d at "
250 "offset %d at %jx\n", __func__, node, lblk, vblk, i, a[i].in_off,
254 nandfs_error("%s: cannot find indirect block\n", __func__);
257 ((nandfs_daddr_t *)bp->b_data)[a[i].in_off] = vblk;
259 error = nandfs_dirty_buf_meta(bp, 0);
261 nandfs_warning("%s: dirty failed buf: %p\n", __func__, bp);
264 DPRINTF(BMAP, ("%s: exiting node %p lblk=%jx vblk=%jx\n", __func__,
270 CTASSERT(NANDFS_NIADDR <= 3);
271 #define SINGLE 0 /* index of single indirect block */
272 #define DOUBLE 1 /* index of double indirect block */
273 #define TRIPLE 2 /* index of triple indirect block */
275 static __inline nandfs_lbn_t
276 lbn_offset(struct nandfs_device *fsdev, int level)
280 for (res = 1; level > 0; level--)
281 res *= MNINDIR(fsdev);
286 blocks_inside(struct nandfs_device *fsdev, int level, struct nandfs_indir *nip)
290 for (blocks = 1; level >= SINGLE; level--, nip++) {
291 MPASS(nip->in_off >= 0 && nip->in_off < MNINDIR(fsdev));
292 blocks += nip->in_off * lbn_offset(fsdev, level);
299 bmap_truncate_indirect(struct nandfs_node *node, int level, nandfs_lbn_t *left,
300 int *cleaned, struct nandfs_indir *ap, struct nandfs_indir *fp,
301 nandfs_daddr_t *copy)
304 nandfs_lbn_t i, lbn, nlbn, factor, tosub;
305 struct nandfs_device *fsdev;
306 int error, lcleaned, modified;
308 DPRINTF(BMAP, ("%s: node %p level %d left %jx\n", __func__,
309 node, level, *left));
311 fsdev = node->nn_nandfsdev;
313 MPASS(ap->in_off >= 0 && ap->in_off < MNINDIR(fsdev));
315 factor = lbn_offset(fsdev, level);
318 error = nandfs_bread_meta(node, lbn, NOCRED, 0, &bp);
325 bcopy(bp->b_data, copy, fsdev->nd_blocksize);
334 for (nlbn = lbn + 1 - i * factor; i >= 0 && *left > 0; i--,
339 ("%s: node %p i=%jx nlbn=%jx left=%jx ap=%p vblk %jx\n",
340 __func__, node, i, nlbn, *left, ap, copy[i]));
343 tosub = blocks_inside(fsdev, level - 1, ap);
349 if (level > SINGLE) {
353 error = bmap_truncate_indirect(node, level - 1,
354 left, &lcleaned, ap, fp,
355 copy + MNINDIR(fsdev));
359 error = nandfs_bdestroy(node, copy[i]);
368 if (level > SINGLE) {
369 error = nandfs_vblock_end(fsdev, copy[i]);
383 error = nandfs_bread_meta(node, lbn, NOCRED, 0, &bp);
389 bcopy(copy, bp->b_data, fsdev->nd_blocksize);
391 /* Force success even if we can't dirty the buffer metadata when freeing space */
392 nandfs_dirty_buf_meta(bp, 1);
398 bmap_truncate_mapping(struct nandfs_node *node, nandfs_lbn_t lastblk,
401 struct nandfs_inode *ip;
402 struct nandfs_indir a[NANDFS_NIADDR + 1], f[NANDFS_NIADDR], *ap;
403 nandfs_daddr_t indir_lbn[NANDFS_NIADDR];
404 nandfs_daddr_t *copy;
406 nandfs_lbn_t left, tosub;
407 struct nandfs_device *fsdev;
411 DPRINTF(BMAP, ("%s: node %p lastblk %jx truncating by %jx\n", __func__,
412 node, lastblk, todo));
414 ip = &node->nn_inode;
415 fsdev = node->nn_nandfsdev;
420 error = bmap_getlbns(node, lastblk, ap, nump);
424 indir_lbn[SINGLE] = -NANDFS_NDADDR;
425 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - MNINDIR(fsdev) - 1;
426 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - MNINDIR(fsdev)
427 * MNINDIR(fsdev) - 1;
429 for (i = 0; i < NANDFS_NIADDR; i++) {
430 f[i].in_off = MNINDIR(fsdev) - 1;
431 f[i].in_lbn = 0xdeadbeef;
446 copy = malloc(MNINDIR(fsdev) * sizeof(nandfs_daddr_t) * (num + 1),
447 M_NANDFSTEMP, M_WAITOK);
449 for (level = num; level >= SINGLE && left > 0; level--) {
452 if (ip->i_ib[level] == 0) {
453 tosub = blocks_inside(fsdev, level, ap);
460 ap->in_lbn = indir_lbn[level];
461 error = bmap_truncate_indirect(node, level, &left,
462 &cleaned, ap, f, copy);
464 free(copy, M_NANDFSTEMP);
465 nandfs_error("%s: error %d when truncate "
466 "at level %d\n", __func__, error, level);
472 nandfs_vblock_end(fsdev, ip->i_ib[level]);
479 free(copy, M_NANDFSTEMP);
485 i = NANDFS_NDADDR - 1;
487 for (; i >= 0 && left > 0; i--) {
488 if (ip->i_db[i] != 0) {
489 error = nandfs_bdestroy(node, ip->i_db[i]);
491 nandfs_error("%s: cannot destroy "
492 "block %jx, error %d\n", __func__,
493 (uintmax_t)ip->i_db[i], error);
503 ("truncated wrong number of blocks (%jd should be 0)", left));
509 get_maxfilesize(struct nandfs_device *fsdev)
511 struct nandfs_indir f[NANDFS_NIADDR];
517 for (i = 0; i < NANDFS_NIADDR; i++) {
518 f[i].in_off = MNINDIR(fsdev) - 1;
519 max += blocks_inside(fsdev, i, f);
522 max *= fsdev->nd_blocksize;
528 * This is ufs_getlbns with minor modifications.
531 * Create an array of logical block number/offset pairs which represent the
532 * path of indirect blocks required to access a data block. The first "pair"
533 * contains the logical block number of the appropriate single, double or
534 * triple indirect block and the offset into the inode indirect block array.
535 * Note, the logical block number of the inode single/double/triple indirect
536 * block appears twice in the array, once with the offset into the i_ib and
537 * once with the offset into the page itself.
540 bmap_getlbns(struct nandfs_node *node, nandfs_lbn_t bn, struct nandfs_indir *ap, int *nump)
542 nandfs_daddr_t blockcnt;
543 nandfs_lbn_t metalbn, realbn;
544 struct nandfs_device *fsdev;
545 int i, numlevels, off;
547 fsdev = node->nn_nandfsdev;
549 DPRINTF(BMAP, ("%s: node %p bn=%jx mnindir=%zd enter\n", __func__,
550 node, bn, MNINDIR(fsdev)));
560 /* The first NANDFS_NDADDR blocks are direct blocks. */
561 if (bn < NANDFS_NDADDR)
565 * Determine the number of levels of indirection. After this loop
566 * is done, blockcnt indicates the number of data blocks possible
567 * at the previous level of indirection, and NANDFS_NIADDR - i is the
568 * number of levels of indirection needed to locate the requested block.
570 for (blockcnt = 1, i = NANDFS_NIADDR, bn -= NANDFS_NDADDR;; i--, bn -= blockcnt) {
571 DPRINTF(BMAP, ("%s: blockcnt=%jd i=%d bn=%jd\n", __func__,
575 blockcnt *= MNINDIR(fsdev);
580 /* Calculate the address of the first meta-block. */
582 metalbn = -(realbn - bn + NANDFS_NIADDR - i);
584 metalbn = -(-realbn - bn + NANDFS_NIADDR - i);
587 * At each iteration, off is the offset into the bap array which is
588 * an array of disk addresses at the current level of indirection.
589 * The logical block number and the offset in that block are stored
590 * into the argument array.
592 ap->in_lbn = metalbn;
593 ap->in_off = off = NANDFS_NIADDR - i;
595 DPRINTF(BMAP, ("%s: initial: ap->in_lbn=%jx ap->in_off=%d\n", __func__,
599 for (++numlevels; i <= NANDFS_NIADDR; i++) {
600 /* If searching for a meta-data block, quit when found. */
601 if (metalbn == realbn)
604 blockcnt /= MNINDIR(fsdev);
605 off = (bn / blockcnt) % MNINDIR(fsdev);
608 ap->in_lbn = metalbn;
611 DPRINTF(BMAP, ("%s: in_lbn=%jx in_off=%d\n", __func__,
612 ap->in_lbn, ap->in_off));
615 metalbn -= -1 + off * blockcnt;
620 DPRINTF(BMAP, ("%s: numlevels=%d\n", __func__, numlevels));