12d60b848STomohiro Kusumi /*
22d60b848STomohiro Kusumi * SPDX-License-Identifier: BSD-3-Clause
32d60b848STomohiro Kusumi *
42d60b848STomohiro Kusumi * Copyright (c) 2022 Tomohiro Kusumi <tkusumi@netbsd.org>
52d60b848STomohiro Kusumi * Copyright (c) 2011-2022 The DragonFly Project. All rights reserved.
62d60b848STomohiro Kusumi *
72d60b848STomohiro Kusumi * This code is derived from software contributed to The DragonFly Project
82d60b848STomohiro Kusumi * by Matthew Dillon <dillon@dragonflybsd.org>
92d60b848STomohiro Kusumi *
102d60b848STomohiro Kusumi * Redistribution and use in source and binary forms, with or without
112d60b848STomohiro Kusumi * modification, are permitted provided that the following conditions
122d60b848STomohiro Kusumi * are met:
132d60b848STomohiro Kusumi *
142d60b848STomohiro Kusumi * 1. Redistributions of source code must retain the above copyright
152d60b848STomohiro Kusumi * notice, this list of conditions and the following disclaimer.
162d60b848STomohiro Kusumi * 2. Redistributions in binary form must reproduce the above copyright
172d60b848STomohiro Kusumi * notice, this list of conditions and the following disclaimer in
182d60b848STomohiro Kusumi * the documentation and/or other materials provided with the
192d60b848STomohiro Kusumi * distribution.
202d60b848STomohiro Kusumi * 3. Neither the name of The DragonFly Project nor the names of its
212d60b848STomohiro Kusumi * contributors may be used to endorse or promote products derived
222d60b848STomohiro Kusumi * from this software without specific, prior written permission.
232d60b848STomohiro Kusumi *
242d60b848STomohiro Kusumi * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
252d60b848STomohiro Kusumi * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
262d60b848STomohiro Kusumi * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
272d60b848STomohiro Kusumi * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
282d60b848STomohiro Kusumi * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
292d60b848STomohiro Kusumi * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
302d60b848STomohiro Kusumi * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
312d60b848STomohiro Kusumi * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
322d60b848STomohiro Kusumi * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
332d60b848STomohiro Kusumi * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
342d60b848STomohiro Kusumi * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
352d60b848STomohiro Kusumi * SUCH DAMAGE.
362d60b848STomohiro Kusumi */
372d60b848STomohiro Kusumi /*
382d60b848STomohiro Kusumi #include <sys/param.h>
392d60b848STomohiro Kusumi #include <sys/systm.h>
402d60b848STomohiro Kusumi #include <sys/kernel.h>
412d60b848STomohiro Kusumi #include <sys/proc.h>
422d60b848STomohiro Kusumi #include <sys/mount.h>
432d60b848STomohiro Kusumi */
442d60b848STomohiro Kusumi
452d60b848STomohiro Kusumi #include "hammer2.h"
462d60b848STomohiro Kusumi
472d60b848STomohiro Kusumi #define FREEMAP_DEBUG 0
482d60b848STomohiro Kusumi
492d60b848STomohiro Kusumi struct hammer2_fiterate {
502d60b848STomohiro Kusumi hammer2_off_t bpref;
512d60b848STomohiro Kusumi hammer2_off_t bnext;
522d60b848STomohiro Kusumi int loops;
532d60b848STomohiro Kusumi int relaxed;
542d60b848STomohiro Kusumi };
552d60b848STomohiro Kusumi
562d60b848STomohiro Kusumi typedef struct hammer2_fiterate hammer2_fiterate_t;
572d60b848STomohiro Kusumi
582d60b848STomohiro Kusumi static int hammer2_freemap_try_alloc(hammer2_chain_t **parentp,
592d60b848STomohiro Kusumi hammer2_blockref_t *bref, int radix,
602d60b848STomohiro Kusumi hammer2_fiterate_t *iter, hammer2_tid_t mtid);
612d60b848STomohiro Kusumi static void hammer2_freemap_init(hammer2_dev_t *hmp,
622d60b848STomohiro Kusumi hammer2_key_t key, hammer2_chain_t *chain);
632d60b848STomohiro Kusumi static int hammer2_bmap_alloc(hammer2_dev_t *hmp,
642d60b848STomohiro Kusumi hammer2_bmap_data_t *bmap, uint16_t class,
652d60b848STomohiro Kusumi int n, int sub_key, int radix, hammer2_key_t *basep);
662d60b848STomohiro Kusumi static int hammer2_freemap_iterate(hammer2_chain_t **parentp,
672d60b848STomohiro Kusumi hammer2_chain_t **chainp,
682d60b848STomohiro Kusumi hammer2_fiterate_t *iter);
692d60b848STomohiro Kusumi
702d60b848STomohiro Kusumi /*
712d60b848STomohiro Kusumi * Calculate the device offset for the specified FREEMAP_NODE or FREEMAP_LEAF
722d60b848STomohiro Kusumi * bref. Return a combined media offset and physical size radix. Freemap
732d60b848STomohiro Kusumi * chains use fixed storage offsets in the 4MB reserved area at the
742d60b848STomohiro Kusumi * beginning of each 1GB zone.
752d60b848STomohiro Kusumi *
762d60b848STomohiro Kusumi * Rotate between eight possibilities. Theoretically this means we have seven
772d60b848STomohiro Kusumi * good freemaps in case of a crash which we can use as a base for the fixup
782d60b848STomohiro Kusumi * scan at mount-time.
792d60b848STomohiro Kusumi */
802d60b848STomohiro Kusumi static
812d60b848STomohiro Kusumi int
hammer2_freemap_reserve(hammer2_chain_t * chain,int radix)822d60b848STomohiro Kusumi hammer2_freemap_reserve(hammer2_chain_t *chain, int radix)
832d60b848STomohiro Kusumi {
842d60b848STomohiro Kusumi hammer2_blockref_t *bref = &chain->bref;
852d60b848STomohiro Kusumi hammer2_off_t off;
862d60b848STomohiro Kusumi int index;
872d60b848STomohiro Kusumi int index_inc;
882d60b848STomohiro Kusumi size_t bytes;
892d60b848STomohiro Kusumi
902d60b848STomohiro Kusumi /*
912d60b848STomohiro Kusumi * Physical allocation size.
922d60b848STomohiro Kusumi */
932d60b848STomohiro Kusumi bytes = (size_t)1 << radix;
942d60b848STomohiro Kusumi
952d60b848STomohiro Kusumi /*
962d60b848STomohiro Kusumi * Calculate block selection index 0..7 of current block. If this
972d60b848STomohiro Kusumi * is the first allocation of the block (verses a modification of an
982d60b848STomohiro Kusumi * existing block), we use index 0, otherwise we use the next rotating
992d60b848STomohiro Kusumi * index.
1002d60b848STomohiro Kusumi */
1012d60b848STomohiro Kusumi if ((bref->data_off & ~HAMMER2_OFF_MASK_RADIX) == 0) {
1022d60b848STomohiro Kusumi index = 0;
1032d60b848STomohiro Kusumi } else {
1042d60b848STomohiro Kusumi off = bref->data_off & ~HAMMER2_OFF_MASK_RADIX &
1052d60b848STomohiro Kusumi HAMMER2_SEGMASK;
1062d60b848STomohiro Kusumi off = off / HAMMER2_PBUFSIZE;
1072d60b848STomohiro Kusumi KKASSERT(off >= HAMMER2_ZONE_FREEMAP_00 &&
1082d60b848STomohiro Kusumi off < HAMMER2_ZONE_FREEMAP_END);
1092d60b848STomohiro Kusumi index = (int)(off - HAMMER2_ZONE_FREEMAP_00) /
1102d60b848STomohiro Kusumi HAMMER2_ZONE_FREEMAP_INC;
1112d60b848STomohiro Kusumi KKASSERT(index >= 0 && index < HAMMER2_NFREEMAPS);
1122d60b848STomohiro Kusumi if (++index == HAMMER2_NFREEMAPS)
1132d60b848STomohiro Kusumi index = 0;
1142d60b848STomohiro Kusumi }
1152d60b848STomohiro Kusumi
1162d60b848STomohiro Kusumi /*
1172d60b848STomohiro Kusumi * Calculate the block offset of the reserved block. This will
1182d60b848STomohiro Kusumi * point into the 4MB reserved area at the base of the appropriate
1192d60b848STomohiro Kusumi * 2GB zone, once added to the FREEMAP_x selection above.
1202d60b848STomohiro Kusumi */
1212d60b848STomohiro Kusumi index_inc = index * HAMMER2_ZONE_FREEMAP_INC;
1222d60b848STomohiro Kusumi
1232d60b848STomohiro Kusumi switch(bref->keybits) {
1242d60b848STomohiro Kusumi /* case HAMMER2_FREEMAP_LEVEL6_RADIX: not applicable */
1252d60b848STomohiro Kusumi case HAMMER2_FREEMAP_LEVEL5_RADIX: /* 4EB */
1262d60b848STomohiro Kusumi KKASSERT(bref->type == HAMMER2_BREF_TYPE_FREEMAP_NODE);
1272d60b848STomohiro Kusumi KKASSERT(bytes == HAMMER2_FREEMAP_LEVELN_PSIZE);
1282d60b848STomohiro Kusumi off = H2FMBASE(bref->key, HAMMER2_FREEMAP_LEVEL5_RADIX) +
1292d60b848STomohiro Kusumi (index_inc + HAMMER2_ZONE_FREEMAP_00 +
1302d60b848STomohiro Kusumi HAMMER2_ZONEFM_LEVEL5) * HAMMER2_PBUFSIZE;
1312d60b848STomohiro Kusumi break;
1322d60b848STomohiro Kusumi case HAMMER2_FREEMAP_LEVEL4_RADIX: /* 16PB */
1332d60b848STomohiro Kusumi KKASSERT(bref->type == HAMMER2_BREF_TYPE_FREEMAP_NODE);
1342d60b848STomohiro Kusumi KKASSERT(bytes == HAMMER2_FREEMAP_LEVELN_PSIZE);
1352d60b848STomohiro Kusumi off = H2FMBASE(bref->key, HAMMER2_FREEMAP_LEVEL4_RADIX) +
1362d60b848STomohiro Kusumi (index_inc + HAMMER2_ZONE_FREEMAP_00 +
1372d60b848STomohiro Kusumi HAMMER2_ZONEFM_LEVEL4) * HAMMER2_PBUFSIZE;
1382d60b848STomohiro Kusumi break;
1392d60b848STomohiro Kusumi case HAMMER2_FREEMAP_LEVEL3_RADIX: /* 64TB */
1402d60b848STomohiro Kusumi KKASSERT(bref->type == HAMMER2_BREF_TYPE_FREEMAP_NODE);
1412d60b848STomohiro Kusumi KKASSERT(bytes == HAMMER2_FREEMAP_LEVELN_PSIZE);
1422d60b848STomohiro Kusumi off = H2FMBASE(bref->key, HAMMER2_FREEMAP_LEVEL3_RADIX) +
1432d60b848STomohiro Kusumi (index_inc + HAMMER2_ZONE_FREEMAP_00 +
1442d60b848STomohiro Kusumi HAMMER2_ZONEFM_LEVEL3) * HAMMER2_PBUFSIZE;
1452d60b848STomohiro Kusumi break;
1462d60b848STomohiro Kusumi case HAMMER2_FREEMAP_LEVEL2_RADIX: /* 256GB */
1472d60b848STomohiro Kusumi KKASSERT(bref->type == HAMMER2_BREF_TYPE_FREEMAP_NODE);
1482d60b848STomohiro Kusumi KKASSERT(bytes == HAMMER2_FREEMAP_LEVELN_PSIZE);
1492d60b848STomohiro Kusumi off = H2FMBASE(bref->key, HAMMER2_FREEMAP_LEVEL2_RADIX) +
1502d60b848STomohiro Kusumi (index_inc + HAMMER2_ZONE_FREEMAP_00 +
1512d60b848STomohiro Kusumi HAMMER2_ZONEFM_LEVEL2) * HAMMER2_PBUFSIZE;
1522d60b848STomohiro Kusumi break;
1532d60b848STomohiro Kusumi case HAMMER2_FREEMAP_LEVEL1_RADIX: /* 1GB */
1542d60b848STomohiro Kusumi KKASSERT(bref->type == HAMMER2_BREF_TYPE_FREEMAP_LEAF);
1552d60b848STomohiro Kusumi KKASSERT(bytes == HAMMER2_FREEMAP_LEVELN_PSIZE);
1562d60b848STomohiro Kusumi off = H2FMBASE(bref->key, HAMMER2_FREEMAP_LEVEL1_RADIX) +
1572d60b848STomohiro Kusumi (index_inc + HAMMER2_ZONE_FREEMAP_00 +
1582d60b848STomohiro Kusumi HAMMER2_ZONEFM_LEVEL1) * HAMMER2_PBUFSIZE;
1592d60b848STomohiro Kusumi break;
1602d60b848STomohiro Kusumi default:
1612d60b848STomohiro Kusumi panic("freemap: bad radix(2) %p %d\n", bref, bref->keybits);
1622d60b848STomohiro Kusumi /* NOT REACHED */
1632d60b848STomohiro Kusumi off = (hammer2_off_t)-1;
1642d60b848STomohiro Kusumi break;
1652d60b848STomohiro Kusumi }
1662d60b848STomohiro Kusumi bref->data_off = off | radix;
1672d60b848STomohiro Kusumi #if FREEMAP_DEBUG
1682d60b848STomohiro Kusumi kprintf("FREEMAP BLOCK TYPE %d %016jx/%d DATA_OFF=%016jx\n",
1692d60b848STomohiro Kusumi bref->type, bref->key, bref->keybits, bref->data_off);
1702d60b848STomohiro Kusumi #endif
1712d60b848STomohiro Kusumi return (0);
1722d60b848STomohiro Kusumi }
1732d60b848STomohiro Kusumi
1742d60b848STomohiro Kusumi /*
1752d60b848STomohiro Kusumi * Normal freemap allocator
1762d60b848STomohiro Kusumi *
1772d60b848STomohiro Kusumi * Use available hints to allocate space using the freemap. Create missing
1782d60b848STomohiro Kusumi * freemap infrastructure on-the-fly as needed (including marking initial
1792d60b848STomohiro Kusumi * allocations using the iterator as allocated, instantiating new 2GB zones,
1802d60b848STomohiro Kusumi * and dealing with the end-of-media edge case).
1812d60b848STomohiro Kusumi *
182*01a24a93STomohiro Kusumi * bpref is only used as a heuristic to determine locality of reference.
1832d60b848STomohiro Kusumi *
1842d60b848STomohiro Kusumi * This function is a NOP if bytes is 0.
1852d60b848STomohiro Kusumi */
1862d60b848STomohiro Kusumi int
hammer2_freemap_alloc(hammer2_chain_t * chain,size_t bytes)1872d60b848STomohiro Kusumi hammer2_freemap_alloc(hammer2_chain_t *chain, size_t bytes)
1882d60b848STomohiro Kusumi {
1892d60b848STomohiro Kusumi hammer2_dev_t *hmp = chain->hmp;
1902d60b848STomohiro Kusumi hammer2_blockref_t *bref = &chain->bref;
1912d60b848STomohiro Kusumi hammer2_chain_t *parent;
1922d60b848STomohiro Kusumi hammer2_tid_t mtid;
1932d60b848STomohiro Kusumi int radix;
1942d60b848STomohiro Kusumi int error;
1952d60b848STomohiro Kusumi unsigned int hindex;
1962d60b848STomohiro Kusumi hammer2_fiterate_t iter;
1972d60b848STomohiro Kusumi
1982d60b848STomohiro Kusumi /*
1992d60b848STomohiro Kusumi * If allocating or downsizing to zero we just get rid of whatever
2002d60b848STomohiro Kusumi * data_off we had.
2012d60b848STomohiro Kusumi */
2022d60b848STomohiro Kusumi if (bytes == 0) {
2032d60b848STomohiro Kusumi chain->bref.data_off = 0;
2042d60b848STomohiro Kusumi return 0;
2052d60b848STomohiro Kusumi }
2062d60b848STomohiro Kusumi
2072d60b848STomohiro Kusumi KKASSERT(hmp->spmp);
2082d60b848STomohiro Kusumi mtid = hammer2_trans_sub(hmp->spmp);
2092d60b848STomohiro Kusumi
2102d60b848STomohiro Kusumi /*
2112d60b848STomohiro Kusumi * Validate the allocation size. It must be a power of 2.
2122d60b848STomohiro Kusumi *
2132d60b848STomohiro Kusumi * For now require that the caller be aware of the minimum
2142d60b848STomohiro Kusumi * allocation (1K).
2152d60b848STomohiro Kusumi */
2162d60b848STomohiro Kusumi radix = hammer2_getradix(bytes);
2172d60b848STomohiro Kusumi KKASSERT((size_t)1 << radix == bytes);
2182d60b848STomohiro Kusumi
2192d60b848STomohiro Kusumi if (bref->type == HAMMER2_BREF_TYPE_FREEMAP_NODE ||
2202d60b848STomohiro Kusumi bref->type == HAMMER2_BREF_TYPE_FREEMAP_LEAF) {
2212d60b848STomohiro Kusumi /*
2222d60b848STomohiro Kusumi * Freemap blocks themselves are assigned from the reserve
2232d60b848STomohiro Kusumi * area, not allocated from the freemap.
2242d60b848STomohiro Kusumi */
2252d60b848STomohiro Kusumi error = hammer2_freemap_reserve(chain, radix);
2262d60b848STomohiro Kusumi
2272d60b848STomohiro Kusumi return error;
2282d60b848STomohiro Kusumi }
2292d60b848STomohiro Kusumi
2302d60b848STomohiro Kusumi KKASSERT(bytes >= HAMMER2_ALLOC_MIN && bytes <= HAMMER2_ALLOC_MAX);
2312d60b848STomohiro Kusumi
2322d60b848STomohiro Kusumi /*
2332d60b848STomohiro Kusumi * Heuristic tracking index. We would like one for each distinct
2342d60b848STomohiro Kusumi * bref type if possible. heur_freemap[] has room for two classes
2352d60b848STomohiro Kusumi * for each type. At a minimum we have to break-up our heuristic
2362d60b848STomohiro Kusumi * by device block sizes.
2372d60b848STomohiro Kusumi */
2382d60b848STomohiro Kusumi hindex = HAMMER2_PBUFRADIX - HAMMER2_LBUFRADIX;
2392d60b848STomohiro Kusumi KKASSERT(hindex < HAMMER2_FREEMAP_HEUR_NRADIX);
2402d60b848STomohiro Kusumi hindex += bref->type * HAMMER2_FREEMAP_HEUR_NRADIX;
2412d60b848STomohiro Kusumi hindex &= HAMMER2_FREEMAP_HEUR_TYPES * HAMMER2_FREEMAP_HEUR_NRADIX - 1;
2422d60b848STomohiro Kusumi KKASSERT(hindex < HAMMER2_FREEMAP_HEUR_SIZE);
2432d60b848STomohiro Kusumi
2442d60b848STomohiro Kusumi iter.bpref = hmp->heur_freemap[hindex];
2452d60b848STomohiro Kusumi iter.relaxed = hmp->freemap_relaxed;
2462d60b848STomohiro Kusumi
2472d60b848STomohiro Kusumi /*
2482d60b848STomohiro Kusumi * Make sure bpref is in-bounds. It's ok if bpref covers a zone's
2492d60b848STomohiro Kusumi * reserved area, the try code will iterate past it.
2502d60b848STomohiro Kusumi */
2512d60b848STomohiro Kusumi if (iter.bpref > hmp->total_size)
2522d60b848STomohiro Kusumi iter.bpref = hmp->total_size - 1;
2532d60b848STomohiro Kusumi
2542d60b848STomohiro Kusumi /*
2552d60b848STomohiro Kusumi * Iterate the freemap looking for free space before and after.
2562d60b848STomohiro Kusumi */
2572d60b848STomohiro Kusumi parent = &hmp->fchain;
2582d60b848STomohiro Kusumi hammer2_chain_ref(parent);
2592d60b848STomohiro Kusumi hammer2_chain_lock(parent, HAMMER2_RESOLVE_ALWAYS);
2602d60b848STomohiro Kusumi error = HAMMER2_ERROR_EAGAIN;
2612d60b848STomohiro Kusumi iter.bnext = iter.bpref;
2622d60b848STomohiro Kusumi iter.loops = 0;
2632d60b848STomohiro Kusumi
2642d60b848STomohiro Kusumi while (error == HAMMER2_ERROR_EAGAIN) {
2652d60b848STomohiro Kusumi error = hammer2_freemap_try_alloc(&parent, bref, radix,
2662d60b848STomohiro Kusumi &iter, mtid);
2672d60b848STomohiro Kusumi }
2682d60b848STomohiro Kusumi hmp->freemap_relaxed |= iter.relaxed; /* heuristical, SMP race ok */
2692d60b848STomohiro Kusumi hmp->heur_freemap[hindex] = iter.bnext;
2702d60b848STomohiro Kusumi hammer2_chain_unlock(parent);
2712d60b848STomohiro Kusumi hammer2_chain_drop(parent);
2722d60b848STomohiro Kusumi
2732d60b848STomohiro Kusumi return (error);
2742d60b848STomohiro Kusumi }
2752d60b848STomohiro Kusumi
2762d60b848STomohiro Kusumi static int
hammer2_freemap_try_alloc(hammer2_chain_t ** parentp,hammer2_blockref_t * bref,int radix,hammer2_fiterate_t * iter,hammer2_tid_t mtid)2772d60b848STomohiro Kusumi hammer2_freemap_try_alloc(hammer2_chain_t **parentp,
2782d60b848STomohiro Kusumi hammer2_blockref_t *bref, int radix,
2792d60b848STomohiro Kusumi hammer2_fiterate_t *iter, hammer2_tid_t mtid)
2802d60b848STomohiro Kusumi {
2812d60b848STomohiro Kusumi hammer2_dev_t *hmp = (*parentp)->hmp;
2822d60b848STomohiro Kusumi hammer2_off_t l0size;
2832d60b848STomohiro Kusumi hammer2_off_t l1size;
2842d60b848STomohiro Kusumi hammer2_off_t l1mask;
2852d60b848STomohiro Kusumi hammer2_key_t key_dummy;
2862d60b848STomohiro Kusumi hammer2_chain_t *chain;
2872d60b848STomohiro Kusumi hammer2_off_t key;
2882d60b848STomohiro Kusumi size_t bytes;
2892d60b848STomohiro Kusumi uint16_t class;
2902d60b848STomohiro Kusumi int error;
2912d60b848STomohiro Kusumi
2922d60b848STomohiro Kusumi /*
293*01a24a93STomohiro Kusumi * Calculate the number of bytes being allocated.
2942d60b848STomohiro Kusumi */
2952d60b848STomohiro Kusumi bytes = (size_t)1 << radix;
2962d60b848STomohiro Kusumi class = (bref->type << 8) | HAMMER2_PBUFRADIX;
2972d60b848STomohiro Kusumi
2982d60b848STomohiro Kusumi /*
2992d60b848STomohiro Kusumi * Lookup the level1 freemap chain, creating and initializing one
3002d60b848STomohiro Kusumi * if necessary. Intermediate levels will be created automatically
3012d60b848STomohiro Kusumi * when necessary by hammer2_chain_create().
3022d60b848STomohiro Kusumi */
3032d60b848STomohiro Kusumi key = H2FMBASE(iter->bnext, HAMMER2_FREEMAP_LEVEL1_RADIX);
3042d60b848STomohiro Kusumi l0size = HAMMER2_FREEMAP_LEVEL0_SIZE;
3052d60b848STomohiro Kusumi l1size = HAMMER2_FREEMAP_LEVEL1_SIZE;
3062d60b848STomohiro Kusumi l1mask = l1size - 1;
3072d60b848STomohiro Kusumi
3082d60b848STomohiro Kusumi chain = hammer2_chain_lookup(parentp, &key_dummy, key, key + l1mask,
3092d60b848STomohiro Kusumi &error,
3102d60b848STomohiro Kusumi HAMMER2_LOOKUP_ALWAYS |
3112d60b848STomohiro Kusumi HAMMER2_LOOKUP_MATCHIND);
3122d60b848STomohiro Kusumi
3132d60b848STomohiro Kusumi if (chain == NULL) {
3142d60b848STomohiro Kusumi /*
3152d60b848STomohiro Kusumi * Create the missing leaf, be sure to initialize
3162d60b848STomohiro Kusumi * the auxillary freemap tracking information in
3172d60b848STomohiro Kusumi * the bref.check.freemap structure.
3182d60b848STomohiro Kusumi */
3192d60b848STomohiro Kusumi #if 0
3202d60b848STomohiro Kusumi kprintf("freemap create L1 @ %016jx bpref %016jx\n",
3212d60b848STomohiro Kusumi key, iter->bpref);
3222d60b848STomohiro Kusumi #endif
3232d60b848STomohiro Kusumi error = hammer2_chain_create(parentp, &chain, NULL, hmp->spmp,
3242d60b848STomohiro Kusumi HAMMER2_METH_DEFAULT,
3252d60b848STomohiro Kusumi key, HAMMER2_FREEMAP_LEVEL1_RADIX,
3262d60b848STomohiro Kusumi HAMMER2_BREF_TYPE_FREEMAP_LEAF,
3272d60b848STomohiro Kusumi HAMMER2_FREEMAP_LEVELN_PSIZE,
3282d60b848STomohiro Kusumi mtid, 0, 0);
3292d60b848STomohiro Kusumi KKASSERT(error == 0);
3302d60b848STomohiro Kusumi if (error == 0) {
3312d60b848STomohiro Kusumi hammer2_chain_modify(chain, mtid, 0, 0);
3322d60b848STomohiro Kusumi bzero(&chain->data->bmdata[0],
3332d60b848STomohiro Kusumi HAMMER2_FREEMAP_LEVELN_PSIZE);
3342d60b848STomohiro Kusumi chain->bref.check.freemap.bigmask = (uint32_t)-1;
3352d60b848STomohiro Kusumi chain->bref.check.freemap.avail = l1size;
3362d60b848STomohiro Kusumi /* bref.methods should already be inherited */
3372d60b848STomohiro Kusumi
3382d60b848STomohiro Kusumi hammer2_freemap_init(hmp, key, chain);
3392d60b848STomohiro Kusumi }
3402d60b848STomohiro Kusumi } else if (chain->error) {
3412d60b848STomohiro Kusumi /*
3422d60b848STomohiro Kusumi * Error during lookup.
3432d60b848STomohiro Kusumi */
3442d60b848STomohiro Kusumi kprintf("hammer2_freemap_try_alloc: %016jx: error %s\n",
3452d60b848STomohiro Kusumi (intmax_t)bref->data_off,
3462d60b848STomohiro Kusumi hammer2_error_str(chain->error));
3472d60b848STomohiro Kusumi error = HAMMER2_ERROR_EIO;
3482d60b848STomohiro Kusumi } else if ((chain->bref.check.freemap.bigmask &
3492d60b848STomohiro Kusumi ((size_t)1 << radix)) == 0) {
3502d60b848STomohiro Kusumi /*
3512d60b848STomohiro Kusumi * Already flagged as not having enough space
3522d60b848STomohiro Kusumi */
3532d60b848STomohiro Kusumi error = HAMMER2_ERROR_ENOSPC;
3542d60b848STomohiro Kusumi } else {
3552d60b848STomohiro Kusumi /*
3562d60b848STomohiro Kusumi * Modify existing chain to setup for adjustment.
3572d60b848STomohiro Kusumi */
3582d60b848STomohiro Kusumi hammer2_chain_modify(chain, mtid, 0, 0);
3592d60b848STomohiro Kusumi }
3602d60b848STomohiro Kusumi
3612d60b848STomohiro Kusumi /*
3622d60b848STomohiro Kusumi * Scan 4MB entries.
3632d60b848STomohiro Kusumi */
3642d60b848STomohiro Kusumi if (error == 0) {
3652d60b848STomohiro Kusumi hammer2_bmap_data_t *bmap;
3662d60b848STomohiro Kusumi hammer2_key_t base_key;
3672d60b848STomohiro Kusumi int count;
3682d60b848STomohiro Kusumi int start;
3692d60b848STomohiro Kusumi int n;
3702d60b848STomohiro Kusumi
3712d60b848STomohiro Kusumi KKASSERT(chain->bref.type == HAMMER2_BREF_TYPE_FREEMAP_LEAF);
3722d60b848STomohiro Kusumi start = (int)((iter->bnext - key) >>
3732d60b848STomohiro Kusumi HAMMER2_FREEMAP_LEVEL0_RADIX);
3742d60b848STomohiro Kusumi KKASSERT(start >= 0 && start < HAMMER2_FREEMAP_COUNT);
3752d60b848STomohiro Kusumi hammer2_chain_modify(chain, mtid, 0, 0);
3762d60b848STomohiro Kusumi
3772d60b848STomohiro Kusumi error = HAMMER2_ERROR_ENOSPC;
3782d60b848STomohiro Kusumi for (count = 0; count < HAMMER2_FREEMAP_COUNT; ++count) {
3792d60b848STomohiro Kusumi int availchk;
3802d60b848STomohiro Kusumi
3812d60b848STomohiro Kusumi if (start + count >= HAMMER2_FREEMAP_COUNT &&
3822d60b848STomohiro Kusumi start - count < 0) {
3832d60b848STomohiro Kusumi break;
3842d60b848STomohiro Kusumi }
3852d60b848STomohiro Kusumi
3862d60b848STomohiro Kusumi /*
3872d60b848STomohiro Kusumi * Calculate bmap pointer from thart starting index
3882d60b848STomohiro Kusumi * forwards.
3892d60b848STomohiro Kusumi *
3902d60b848STomohiro Kusumi * NOTE: bmap pointer is invalid if n >= FREEMAP_COUNT.
3912d60b848STomohiro Kusumi */
3922d60b848STomohiro Kusumi n = start + count;
3932d60b848STomohiro Kusumi bmap = &chain->data->bmdata[n];
3942d60b848STomohiro Kusumi
3952d60b848STomohiro Kusumi if (n >= HAMMER2_FREEMAP_COUNT) {
3962d60b848STomohiro Kusumi availchk = 0;
3972d60b848STomohiro Kusumi } else if (bmap->avail) {
3982d60b848STomohiro Kusumi availchk = 1;
3992d60b848STomohiro Kusumi } else if (radix < HAMMER2_FREEMAP_BLOCK_RADIX &&
4002d60b848STomohiro Kusumi (bmap->linear & HAMMER2_FREEMAP_BLOCK_MASK)) {
4012d60b848STomohiro Kusumi availchk = 1;
4022d60b848STomohiro Kusumi } else {
4032d60b848STomohiro Kusumi availchk = 0;
4042d60b848STomohiro Kusumi }
4052d60b848STomohiro Kusumi
4062d60b848STomohiro Kusumi /*
4072d60b848STomohiro Kusumi * Try to allocate from a matching freemap class
4082d60b848STomohiro Kusumi * superblock. If we are in relaxed mode we allocate
4092d60b848STomohiro Kusumi * from any freemap class superblock.
4102d60b848STomohiro Kusumi */
4112d60b848STomohiro Kusumi if (availchk &&
4122d60b848STomohiro Kusumi (bmap->class == 0 || bmap->class == class ||
4132d60b848STomohiro Kusumi iter->relaxed)) {
4142d60b848STomohiro Kusumi base_key = key + n * l0size;
4152d60b848STomohiro Kusumi error = hammer2_bmap_alloc(hmp, bmap,
4162d60b848STomohiro Kusumi class, n,
4172d60b848STomohiro Kusumi (int)bref->key,
4182d60b848STomohiro Kusumi radix,
4192d60b848STomohiro Kusumi &base_key);
4202d60b848STomohiro Kusumi if (error != HAMMER2_ERROR_ENOSPC) {
4212d60b848STomohiro Kusumi key = base_key;
4222d60b848STomohiro Kusumi break;
4232d60b848STomohiro Kusumi }
4242d60b848STomohiro Kusumi }
4252d60b848STomohiro Kusumi
4262d60b848STomohiro Kusumi /*
4272d60b848STomohiro Kusumi * Calculate bmap pointer from the starting index
4282d60b848STomohiro Kusumi * backwards (locality).
4292d60b848STomohiro Kusumi *
4302d60b848STomohiro Kusumi * Must recalculate after potentially having called
4312d60b848STomohiro Kusumi * hammer2_bmap_alloc() above in case chain was
4322d60b848STomohiro Kusumi * reallocated.
4332d60b848STomohiro Kusumi *
4342d60b848STomohiro Kusumi * NOTE: bmap pointer is invalid if n < 0.
4352d60b848STomohiro Kusumi */
4362d60b848STomohiro Kusumi n = start - count;
4372d60b848STomohiro Kusumi bmap = &chain->data->bmdata[n];
4382d60b848STomohiro Kusumi if (n < 0) {
4392d60b848STomohiro Kusumi availchk = 0;
4402d60b848STomohiro Kusumi } else if (bmap->avail) {
4412d60b848STomohiro Kusumi availchk = 1;
4422d60b848STomohiro Kusumi } else if (radix < HAMMER2_FREEMAP_BLOCK_RADIX &&
4432d60b848STomohiro Kusumi (bmap->linear & HAMMER2_FREEMAP_BLOCK_MASK)) {
4442d60b848STomohiro Kusumi availchk = 1;
4452d60b848STomohiro Kusumi } else {
4462d60b848STomohiro Kusumi availchk = 0;
4472d60b848STomohiro Kusumi }
4482d60b848STomohiro Kusumi
4492d60b848STomohiro Kusumi /*
4502d60b848STomohiro Kusumi * Try to allocate from a matching freemap class
4512d60b848STomohiro Kusumi * superblock. If we are in relaxed mode we allocate
4522d60b848STomohiro Kusumi * from any freemap class superblock.
4532d60b848STomohiro Kusumi */
4542d60b848STomohiro Kusumi if (availchk &&
4552d60b848STomohiro Kusumi (bmap->class == 0 || bmap->class == class ||
4562d60b848STomohiro Kusumi iter->relaxed)) {
4572d60b848STomohiro Kusumi base_key = key + n * l0size;
4582d60b848STomohiro Kusumi error = hammer2_bmap_alloc(hmp, bmap,
4592d60b848STomohiro Kusumi class, n,
4602d60b848STomohiro Kusumi (int)bref->key,
4612d60b848STomohiro Kusumi radix,
4622d60b848STomohiro Kusumi &base_key);
4632d60b848STomohiro Kusumi if (error != HAMMER2_ERROR_ENOSPC) {
4642d60b848STomohiro Kusumi key = base_key;
4652d60b848STomohiro Kusumi break;
4662d60b848STomohiro Kusumi }
4672d60b848STomohiro Kusumi }
4682d60b848STomohiro Kusumi }
4692d60b848STomohiro Kusumi
4702d60b848STomohiro Kusumi /*
4712d60b848STomohiro Kusumi * We only know for sure that we can clear the bitmap bit
4722d60b848STomohiro Kusumi * if we scanned the entire array (start == 0) in relaxed
4732d60b848STomohiro Kusumi * mode.
4742d60b848STomohiro Kusumi */
4752d60b848STomohiro Kusumi if (error == HAMMER2_ERROR_ENOSPC &&
4762d60b848STomohiro Kusumi start == 0 &&
4772d60b848STomohiro Kusumi iter->relaxed)
4782d60b848STomohiro Kusumi {
4792d60b848STomohiro Kusumi chain->bref.check.freemap.bigmask &=
4802d60b848STomohiro Kusumi (uint32_t)~((size_t)1 << radix);
4812d60b848STomohiro Kusumi }
4822d60b848STomohiro Kusumi /* XXX also scan down from original count */
4832d60b848STomohiro Kusumi }
4842d60b848STomohiro Kusumi
4852d60b848STomohiro Kusumi if (error == 0) {
4862d60b848STomohiro Kusumi /*
4872d60b848STomohiro Kusumi * Assert validity. Must be beyond the static allocator used
4882d60b848STomohiro Kusumi * by newfs_hammer2 (and thus also beyond the aux area),
4892d60b848STomohiro Kusumi * not go past the volume size, and must not be in the
4902d60b848STomohiro Kusumi * reserved segment area for a zone.
4912d60b848STomohiro Kusumi */
4922d60b848STomohiro Kusumi KKASSERT(key >= hmp->voldata.allocator_beg &&
4932d60b848STomohiro Kusumi key + bytes <= hmp->total_size);
4942d60b848STomohiro Kusumi KKASSERT((key & HAMMER2_ZONE_MASK64) >= HAMMER2_ZONE_SEG);
4952d60b848STomohiro Kusumi bref->data_off = key | radix;
4962d60b848STomohiro Kusumi
4972d60b848STomohiro Kusumi /*
4982d60b848STomohiro Kusumi * Record dedupability. The dedup bits are cleared
4992d60b848STomohiro Kusumi * when bulkfree transitions the freemap from 11->10,
5002d60b848STomohiro Kusumi * and asserted to be clear on the 10->00 transition.
5012d60b848STomohiro Kusumi *
5022d60b848STomohiro Kusumi * We must record the bitmask with the chain locked
5032d60b848STomohiro Kusumi * at the time we set the allocation bits to avoid
5042d60b848STomohiro Kusumi * racing a bulkfree.
5052d60b848STomohiro Kusumi */
5062d60b848STomohiro Kusumi if (bref->type == HAMMER2_BREF_TYPE_DATA)
5072d60b848STomohiro Kusumi hammer2_io_dedup_set(hmp, bref);
5082d60b848STomohiro Kusumi #if 0
5092d60b848STomohiro Kusumi kprintf("alloc cp=%p %016jx %016jx using %016jx\n",
5102d60b848STomohiro Kusumi chain,
5112d60b848STomohiro Kusumi bref->key, bref->data_off, chain->bref.data_off);
5122d60b848STomohiro Kusumi #endif
5132d60b848STomohiro Kusumi } else if (error == HAMMER2_ERROR_ENOSPC) {
5142d60b848STomohiro Kusumi /*
5152d60b848STomohiro Kusumi * Return EAGAIN with next iteration in iter->bnext, or
5162d60b848STomohiro Kusumi * return ENOSPC if the allocation map has been exhausted.
5172d60b848STomohiro Kusumi */
5182d60b848STomohiro Kusumi error = hammer2_freemap_iterate(parentp, &chain, iter);
5192d60b848STomohiro Kusumi }
5202d60b848STomohiro Kusumi
5212d60b848STomohiro Kusumi /*
5222d60b848STomohiro Kusumi * Cleanup
5232d60b848STomohiro Kusumi */
5242d60b848STomohiro Kusumi if (chain) {
5252d60b848STomohiro Kusumi hammer2_chain_unlock(chain);
5262d60b848STomohiro Kusumi hammer2_chain_drop(chain);
5272d60b848STomohiro Kusumi }
5282d60b848STomohiro Kusumi return (error);
5292d60b848STomohiro Kusumi }
5302d60b848STomohiro Kusumi
5312d60b848STomohiro Kusumi /*
5322d60b848STomohiro Kusumi * Allocate (1<<radix) bytes from the bmap whos base data offset is (*basep).
5332d60b848STomohiro Kusumi *
5342d60b848STomohiro Kusumi * If the linear iterator is mid-block we use it directly (the bitmap should
5352d60b848STomohiro Kusumi * already be marked allocated), otherwise we search for a block in the
5362d60b848STomohiro Kusumi * bitmap that fits the allocation request.
5372d60b848STomohiro Kusumi *
5382d60b848STomohiro Kusumi * A partial bitmap allocation sets the minimum bitmap granularity (16KB)
5392d60b848STomohiro Kusumi * to fully allocated and adjusts the linear allocator to allow the
5402d60b848STomohiro Kusumi * remaining space to be allocated.
5412d60b848STomohiro Kusumi *
5422d60b848STomohiro Kusumi * sub_key is the lower 32 bits of the chain->bref.key for the chain whos
5432d60b848STomohiro Kusumi * bref is being allocated. If the radix represents an allocation >= 16KB
5442d60b848STomohiro Kusumi * (aka HAMMER2_FREEMAP_BLOCK_RADIX) we try to use this key to select the
5452d60b848STomohiro Kusumi * blocks directly out of the bmap.
5462d60b848STomohiro Kusumi */
5472d60b848STomohiro Kusumi static
5482d60b848STomohiro Kusumi int
hammer2_bmap_alloc(hammer2_dev_t * hmp,hammer2_bmap_data_t * bmap,uint16_t class,int n,int sub_key,int radix,hammer2_key_t * basep)5492d60b848STomohiro Kusumi hammer2_bmap_alloc(hammer2_dev_t *hmp, hammer2_bmap_data_t *bmap,
5502d60b848STomohiro Kusumi uint16_t class, int n, int sub_key,
5512d60b848STomohiro Kusumi int radix, hammer2_key_t *basep)
5522d60b848STomohiro Kusumi {
5532d60b848STomohiro Kusumi size_t size;
5542d60b848STomohiro Kusumi size_t bgsize;
5552d60b848STomohiro Kusumi int bmradix;
5562d60b848STomohiro Kusumi hammer2_bitmap_t bmmask;
5572d60b848STomohiro Kusumi int offset;
5582d60b848STomohiro Kusumi int i;
5592d60b848STomohiro Kusumi int j;
5602d60b848STomohiro Kusumi
5612d60b848STomohiro Kusumi /*
5622d60b848STomohiro Kusumi * Take into account 2-bits per block when calculating bmradix.
5632d60b848STomohiro Kusumi */
5642d60b848STomohiro Kusumi size = (size_t)1 << radix;
5652d60b848STomohiro Kusumi
5662d60b848STomohiro Kusumi if (radix <= HAMMER2_FREEMAP_BLOCK_RADIX) {
5672d60b848STomohiro Kusumi bmradix = 2;
5682d60b848STomohiro Kusumi /* (16K) 2 bits per allocation block */
5692d60b848STomohiro Kusumi } else {
5702d60b848STomohiro Kusumi bmradix = (hammer2_bitmap_t)2 <<
5712d60b848STomohiro Kusumi (radix - HAMMER2_FREEMAP_BLOCK_RADIX);
572*01a24a93STomohiro Kusumi /* (32K-64K) 4, 8 bits per allocation block */
5732d60b848STomohiro Kusumi }
5742d60b848STomohiro Kusumi
5752d60b848STomohiro Kusumi /*
5762d60b848STomohiro Kusumi * Use the linear iterator to pack small allocations, otherwise
5772d60b848STomohiro Kusumi * fall-back to finding a free 16KB chunk. The linear iterator
5782d60b848STomohiro Kusumi * is only valid when *NOT* on a freemap chunking boundary (16KB).
5792d60b848STomohiro Kusumi * If it is the bitmap must be scanned. It can become invalid
5802d60b848STomohiro Kusumi * once we pack to the boundary. We adjust it after a bitmap
5812d60b848STomohiro Kusumi * allocation only for sub-16KB allocations (so the perfectly good
5822d60b848STomohiro Kusumi * previous value can still be used for fragments when 16KB+
5832d60b848STomohiro Kusumi * allocations are made inbetween fragmentary allocations).
5842d60b848STomohiro Kusumi *
5852d60b848STomohiro Kusumi * Beware of hardware artifacts when bmradix == 64 (intermediate
5862d60b848STomohiro Kusumi * result can wind up being '1' instead of '0' if hardware masks
5872d60b848STomohiro Kusumi * bit-count & 63).
5882d60b848STomohiro Kusumi *
5892d60b848STomohiro Kusumi * NOTE: j needs to be even in the j= calculation. As an artifact
5902d60b848STomohiro Kusumi * of the /2 division, our bitmask has to clear bit 0.
5912d60b848STomohiro Kusumi *
5922d60b848STomohiro Kusumi * NOTE: TODO this can leave little unallocatable fragments lying
5932d60b848STomohiro Kusumi * around.
5942d60b848STomohiro Kusumi */
5952d60b848STomohiro Kusumi if (((uint32_t)bmap->linear & HAMMER2_FREEMAP_BLOCK_MASK) + size <=
5962d60b848STomohiro Kusumi HAMMER2_FREEMAP_BLOCK_SIZE &&
5972d60b848STomohiro Kusumi (bmap->linear & HAMMER2_FREEMAP_BLOCK_MASK) &&
5982d60b848STomohiro Kusumi bmap->linear < HAMMER2_SEGSIZE) {
5992d60b848STomohiro Kusumi /*
6002d60b848STomohiro Kusumi * Use linear iterator if it is not block-aligned to avoid
6012d60b848STomohiro Kusumi * wasting space.
6022d60b848STomohiro Kusumi *
6032d60b848STomohiro Kusumi * Calculate the bitmapq[] index (i) and calculate the
6042d60b848STomohiro Kusumi * shift count within the 64-bit bitmapq[] entry.
6052d60b848STomohiro Kusumi *
6062d60b848STomohiro Kusumi * The freemap block size is 16KB, but each bitmap
6072d60b848STomohiro Kusumi * entry is two bits so use a little trick to get
6082d60b848STomohiro Kusumi * a (j) shift of 0, 2, 4, ... 62 in 16KB chunks.
6092d60b848STomohiro Kusumi */
6102d60b848STomohiro Kusumi KKASSERT(bmap->linear >= 0 &&
6112d60b848STomohiro Kusumi bmap->linear + size <= HAMMER2_SEGSIZE &&
6122d60b848STomohiro Kusumi (bmap->linear & (HAMMER2_ALLOC_MIN - 1)) == 0);
6132d60b848STomohiro Kusumi offset = bmap->linear;
6142d60b848STomohiro Kusumi i = offset / (HAMMER2_SEGSIZE / HAMMER2_BMAP_ELEMENTS);
6152d60b848STomohiro Kusumi j = (offset / (HAMMER2_FREEMAP_BLOCK_SIZE / 2)) & 62;
6162d60b848STomohiro Kusumi bmmask = (bmradix == HAMMER2_BMAP_BITS_PER_ELEMENT) ?
6172d60b848STomohiro Kusumi HAMMER2_BMAP_ALLONES :
6182d60b848STomohiro Kusumi ((hammer2_bitmap_t)1 << bmradix) - 1;
6192d60b848STomohiro Kusumi bmmask <<= j;
6202d60b848STomohiro Kusumi bmap->linear = offset + size;
6212d60b848STomohiro Kusumi } else {
6222d60b848STomohiro Kusumi /*
6232d60b848STomohiro Kusumi * Try to index a starting point based on sub_key. This
6242d60b848STomohiro Kusumi * attempts to restore sequential block ordering on-disk
6252d60b848STomohiro Kusumi * whenever possible, even if data is committed out of
6262d60b848STomohiro Kusumi * order.
6272d60b848STomohiro Kusumi *
6282d60b848STomohiro Kusumi * i - Index bitmapq[], full data range represented is
6292d60b848STomohiro Kusumi * HAMMER2_BMAP_SIZE.
6302d60b848STomohiro Kusumi *
6312d60b848STomohiro Kusumi * j - Index within bitmapq[i], full data range represented is
6322d60b848STomohiro Kusumi * HAMMER2_BMAP_INDEX_SIZE.
6332d60b848STomohiro Kusumi *
6342d60b848STomohiro Kusumi * WARNING!
6352d60b848STomohiro Kusumi */
6362d60b848STomohiro Kusumi i = -1;
6372d60b848STomohiro Kusumi j = -1;
6382d60b848STomohiro Kusumi
6392d60b848STomohiro Kusumi switch(class >> 8) {
6402d60b848STomohiro Kusumi case HAMMER2_BREF_TYPE_DATA:
6412d60b848STomohiro Kusumi if (radix >= HAMMER2_FREEMAP_BLOCK_RADIX) {
6422d60b848STomohiro Kusumi i = (sub_key & HAMMER2_BMAP_MASK) /
6432d60b848STomohiro Kusumi (HAMMER2_BMAP_SIZE / HAMMER2_BMAP_ELEMENTS);
6442d60b848STomohiro Kusumi j = (sub_key & HAMMER2_BMAP_INDEX_MASK) /
6452d60b848STomohiro Kusumi (HAMMER2_BMAP_INDEX_SIZE /
6462d60b848STomohiro Kusumi HAMMER2_BMAP_BLOCKS_PER_ELEMENT);
6472d60b848STomohiro Kusumi j = j * 2;
6482d60b848STomohiro Kusumi }
6492d60b848STomohiro Kusumi break;
6502d60b848STomohiro Kusumi case HAMMER2_BREF_TYPE_INODE:
6512d60b848STomohiro Kusumi break;
6522d60b848STomohiro Kusumi default:
6532d60b848STomohiro Kusumi break;
6542d60b848STomohiro Kusumi }
6552d60b848STomohiro Kusumi if (i >= 0) {
6562d60b848STomohiro Kusumi KKASSERT(i < HAMMER2_BMAP_ELEMENTS &&
6572d60b848STomohiro Kusumi j < 2 * HAMMER2_BMAP_BLOCKS_PER_ELEMENT);
6582d60b848STomohiro Kusumi KKASSERT(j + bmradix <= HAMMER2_BMAP_BITS_PER_ELEMENT);
6592d60b848STomohiro Kusumi bmmask = (bmradix == HAMMER2_BMAP_BITS_PER_ELEMENT) ?
6602d60b848STomohiro Kusumi HAMMER2_BMAP_ALLONES :
6612d60b848STomohiro Kusumi ((hammer2_bitmap_t)1 << bmradix) - 1;
6622d60b848STomohiro Kusumi bmmask <<= j;
6632d60b848STomohiro Kusumi
6642d60b848STomohiro Kusumi if ((bmap->bitmapq[i] & bmmask) == 0)
6652d60b848STomohiro Kusumi goto success;
6662d60b848STomohiro Kusumi }
6672d60b848STomohiro Kusumi
6682d60b848STomohiro Kusumi /*
6692d60b848STomohiro Kusumi * General element scan.
6702d60b848STomohiro Kusumi *
6712d60b848STomohiro Kusumi * WARNING: (j) is iterating a bit index (by 2's)
6722d60b848STomohiro Kusumi */
6732d60b848STomohiro Kusumi for (i = 0; i < HAMMER2_BMAP_ELEMENTS; ++i) {
6742d60b848STomohiro Kusumi bmmask = (bmradix == HAMMER2_BMAP_BITS_PER_ELEMENT) ?
6752d60b848STomohiro Kusumi HAMMER2_BMAP_ALLONES :
6762d60b848STomohiro Kusumi ((hammer2_bitmap_t)1 << bmradix) - 1;
6772d60b848STomohiro Kusumi for (j = 0;
6782d60b848STomohiro Kusumi j < HAMMER2_BMAP_BITS_PER_ELEMENT;
6792d60b848STomohiro Kusumi j += bmradix) {
6802d60b848STomohiro Kusumi if ((bmap->bitmapq[i] & bmmask) == 0)
6812d60b848STomohiro Kusumi goto success;
6822d60b848STomohiro Kusumi bmmask <<= bmradix;
6832d60b848STomohiro Kusumi }
6842d60b848STomohiro Kusumi }
6852d60b848STomohiro Kusumi /*fragments might remain*/
6862d60b848STomohiro Kusumi /*KKASSERT(bmap->avail == 0);*/
6872d60b848STomohiro Kusumi return (HAMMER2_ERROR_ENOSPC);
6882d60b848STomohiro Kusumi success:
6892d60b848STomohiro Kusumi offset = i * (HAMMER2_SEGSIZE / HAMMER2_BMAP_ELEMENTS) +
6902d60b848STomohiro Kusumi (j * (HAMMER2_FREEMAP_BLOCK_SIZE / 2));
6912d60b848STomohiro Kusumi if (size & HAMMER2_FREEMAP_BLOCK_MASK)
6922d60b848STomohiro Kusumi bmap->linear = offset + size;
6932d60b848STomohiro Kusumi }
6942d60b848STomohiro Kusumi
6952d60b848STomohiro Kusumi /* 8 x (64/2) -> 256 x 16K -> 4MB */
6962d60b848STomohiro Kusumi KKASSERT(i >= 0 && i < HAMMER2_BMAP_ELEMENTS);
6972d60b848STomohiro Kusumi
6982d60b848STomohiro Kusumi /*
6992d60b848STomohiro Kusumi * Optimize the buffer cache to avoid unnecessary read-before-write
7002d60b848STomohiro Kusumi * operations.
7012d60b848STomohiro Kusumi *
7022d60b848STomohiro Kusumi * The device block size could be larger than the allocation size
7032d60b848STomohiro Kusumi * so the actual bitmap test is somewhat more involved. We have
7042d60b848STomohiro Kusumi * to use a compatible buffer size for this operation.
7052d60b848STomohiro Kusumi */
7062d60b848STomohiro Kusumi if ((bmap->bitmapq[i] & bmmask) == 0 &&
7072d60b848STomohiro Kusumi HAMMER2_PBUFSIZE != size) {
7082d60b848STomohiro Kusumi size_t psize = HAMMER2_PBUFSIZE;
7092d60b848STomohiro Kusumi hammer2_off_t pmask = (hammer2_off_t)psize - 1;
7102d60b848STomohiro Kusumi int pbmradix = (hammer2_bitmap_t)2 <<
7112d60b848STomohiro Kusumi (HAMMER2_PBUFRADIX -
7122d60b848STomohiro Kusumi HAMMER2_FREEMAP_BLOCK_RADIX);
7132d60b848STomohiro Kusumi hammer2_bitmap_t pbmmask;
7142d60b848STomohiro Kusumi int pradix = hammer2_getradix(psize);
7152d60b848STomohiro Kusumi
7162d60b848STomohiro Kusumi pbmmask = (pbmradix == HAMMER2_BMAP_BITS_PER_ELEMENT) ?
7172d60b848STomohiro Kusumi HAMMER2_BMAP_ALLONES :
7182d60b848STomohiro Kusumi ((hammer2_bitmap_t)1 << pbmradix) - 1;
7192d60b848STomohiro Kusumi while ((pbmmask & bmmask) == 0)
7202d60b848STomohiro Kusumi pbmmask <<= pbmradix;
7212d60b848STomohiro Kusumi
7222d60b848STomohiro Kusumi #if 0
7232d60b848STomohiro Kusumi kprintf("%016jx mask %016jx %016jx %016jx (%zd/%zd)\n",
7242d60b848STomohiro Kusumi *basep + offset, bmap->bitmapq[i],
7252d60b848STomohiro Kusumi pbmmask, bmmask, size, psize);
7262d60b848STomohiro Kusumi #endif
7272d60b848STomohiro Kusumi
7282d60b848STomohiro Kusumi if ((bmap->bitmapq[i] & pbmmask) == 0) {
7292d60b848STomohiro Kusumi hammer2_io_t *dio;
7302d60b848STomohiro Kusumi
7312d60b848STomohiro Kusumi hammer2_io_newnz(hmp, class >> 8,
7322d60b848STomohiro Kusumi (*basep + (offset & ~pmask)) |
7332d60b848STomohiro Kusumi pradix, psize, &dio);
7342d60b848STomohiro Kusumi hammer2_io_putblk(&dio);
7352d60b848STomohiro Kusumi }
7362d60b848STomohiro Kusumi }
7372d60b848STomohiro Kusumi
7382d60b848STomohiro Kusumi #if 0
7392d60b848STomohiro Kusumi /*
7402d60b848STomohiro Kusumi * When initializing a new inode segment also attempt to initialize
7412d60b848STomohiro Kusumi * an adjacent segment. Be careful not to index beyond the array
7422d60b848STomohiro Kusumi * bounds.
7432d60b848STomohiro Kusumi *
7442d60b848STomohiro Kusumi * We do this to try to localize inode accesses to improve
7452d60b848STomohiro Kusumi * directory scan rates. XXX doesn't improve scan rates.
7462d60b848STomohiro Kusumi */
7472d60b848STomohiro Kusumi if (size == HAMMER2_INODE_BYTES) {
7482d60b848STomohiro Kusumi if (n & 1) {
7492d60b848STomohiro Kusumi if (bmap[-1].radix == 0 && bmap[-1].avail)
7502d60b848STomohiro Kusumi bmap[-1].radix = radix;
7512d60b848STomohiro Kusumi } else {
7522d60b848STomohiro Kusumi if (bmap[1].radix == 0 && bmap[1].avail)
7532d60b848STomohiro Kusumi bmap[1].radix = radix;
7542d60b848STomohiro Kusumi }
7552d60b848STomohiro Kusumi }
7562d60b848STomohiro Kusumi #endif
7572d60b848STomohiro Kusumi /*
7582d60b848STomohiro Kusumi * Calculate the bitmap-granular change in bgsize for the volume
7592d60b848STomohiro Kusumi * header. We cannot use the fine-grained change here because
7602d60b848STomohiro Kusumi * the bulkfree code can't undo it. If the bitmap element is already
7612d60b848STomohiro Kusumi * marked allocated it has already been accounted for.
7622d60b848STomohiro Kusumi */
7632d60b848STomohiro Kusumi if (radix < HAMMER2_FREEMAP_BLOCK_RADIX) {
7642d60b848STomohiro Kusumi if (bmap->bitmapq[i] & bmmask)
7652d60b848STomohiro Kusumi bgsize = 0;
7662d60b848STomohiro Kusumi else
7672d60b848STomohiro Kusumi bgsize = HAMMER2_FREEMAP_BLOCK_SIZE;
7682d60b848STomohiro Kusumi } else {
7692d60b848STomohiro Kusumi bgsize = size;
7702d60b848STomohiro Kusumi }
7712d60b848STomohiro Kusumi
7722d60b848STomohiro Kusumi /*
7732d60b848STomohiro Kusumi * Adjust the bitmap, set the class (it might have been 0),
7742d60b848STomohiro Kusumi * and available bytes, update the allocation offset (*basep)
7752d60b848STomohiro Kusumi * from the L0 base to the actual offset.
7762d60b848STomohiro Kusumi *
7772d60b848STomohiro Kusumi * Do not override the class if doing a relaxed class allocation.
7782d60b848STomohiro Kusumi *
7792d60b848STomohiro Kusumi * avail must reflect the bitmap-granular availability. The allocator
7802d60b848STomohiro Kusumi * tests will also check the linear iterator.
7812d60b848STomohiro Kusumi */
7822d60b848STomohiro Kusumi bmap->bitmapq[i] |= bmmask;
7832d60b848STomohiro Kusumi if (bmap->class == 0)
7842d60b848STomohiro Kusumi bmap->class = class;
7852d60b848STomohiro Kusumi bmap->avail -= bgsize;
7862d60b848STomohiro Kusumi *basep += offset;
7872d60b848STomohiro Kusumi
7882d60b848STomohiro Kusumi /*
7892d60b848STomohiro Kusumi * Adjust the volume header's allocator_free parameter. This
7902d60b848STomohiro Kusumi * parameter has to be fixed up by bulkfree which has no way to
7912d60b848STomohiro Kusumi * figure out sub-16K chunking, so it must be adjusted by the
7922d60b848STomohiro Kusumi * bitmap-granular size.
7932d60b848STomohiro Kusumi */
7942d60b848STomohiro Kusumi if (bgsize) {
7952d60b848STomohiro Kusumi hammer2_voldata_lock(hmp);
7962d60b848STomohiro Kusumi hammer2_voldata_modify(hmp);
7972d60b848STomohiro Kusumi hmp->voldata.allocator_free -= bgsize;
7982d60b848STomohiro Kusumi hammer2_voldata_unlock(hmp);
7992d60b848STomohiro Kusumi }
8002d60b848STomohiro Kusumi
8012d60b848STomohiro Kusumi return(0);
8022d60b848STomohiro Kusumi }
8032d60b848STomohiro Kusumi
8042d60b848STomohiro Kusumi /*
8052d60b848STomohiro Kusumi * Initialize a freemap for the storage area (in bytes) that begins at (key).
8062d60b848STomohiro Kusumi */
8072d60b848STomohiro Kusumi static
8082d60b848STomohiro Kusumi void
hammer2_freemap_init(hammer2_dev_t * hmp,hammer2_key_t key,hammer2_chain_t * chain)8092d60b848STomohiro Kusumi hammer2_freemap_init(hammer2_dev_t *hmp, hammer2_key_t key,
8102d60b848STomohiro Kusumi hammer2_chain_t *chain)
8112d60b848STomohiro Kusumi {
8122d60b848STomohiro Kusumi hammer2_off_t lokey;
8132d60b848STomohiro Kusumi hammer2_off_t hikey;
8142d60b848STomohiro Kusumi hammer2_bmap_data_t *bmap;
8152d60b848STomohiro Kusumi int count;
8162d60b848STomohiro Kusumi
8172d60b848STomohiro Kusumi /*
8182d60b848STomohiro Kusumi * Calculate the portion of the 1GB map that should be initialized
8192d60b848STomohiro Kusumi * as free. Portions below or after will be initialized as allocated.
8202d60b848STomohiro Kusumi * SEGMASK-align the areas so we don't have to worry about sub-scans
8212d60b848STomohiro Kusumi * or endianess when using memset.
8222d60b848STomohiro Kusumi *
8232d60b848STomohiro Kusumi * WARNING! It is possible for lokey to be larger than hikey if the
8242d60b848STomohiro Kusumi * entire 2GB segment is within the static allocation.
8252d60b848STomohiro Kusumi */
8262d60b848STomohiro Kusumi /*
8272d60b848STomohiro Kusumi * (1) Ensure that all statically allocated space from newfs_hammer2
8282d60b848STomohiro Kusumi * is marked allocated, and take it up to the level1 base for
8292d60b848STomohiro Kusumi * this key.
8302d60b848STomohiro Kusumi */
8312d60b848STomohiro Kusumi lokey = (hmp->voldata.allocator_beg + HAMMER2_SEGMASK64) &
8322d60b848STomohiro Kusumi ~HAMMER2_SEGMASK64;
8332d60b848STomohiro Kusumi if (lokey < H2FMBASE(key, HAMMER2_FREEMAP_LEVEL1_RADIX))
8342d60b848STomohiro Kusumi lokey = H2FMBASE(key, HAMMER2_FREEMAP_LEVEL1_RADIX);
8352d60b848STomohiro Kusumi
8362d60b848STomohiro Kusumi /*
8372d60b848STomohiro Kusumi * (2) Ensure that the reserved area is marked allocated (typically
8382d60b848STomohiro Kusumi * the first 4MB of each 2GB area being represented). Since
8392d60b848STomohiro Kusumi * each LEAF represents 1GB of storage and the zone is 2GB, we
8402d60b848STomohiro Kusumi * have to adjust lowkey upward every other LEAF sequentially.
8412d60b848STomohiro Kusumi */
8422d60b848STomohiro Kusumi if (lokey < H2FMZONEBASE(key) + HAMMER2_ZONE_SEG64)
8432d60b848STomohiro Kusumi lokey = H2FMZONEBASE(key) + HAMMER2_ZONE_SEG64;
8442d60b848STomohiro Kusumi
8452d60b848STomohiro Kusumi /*
8462d60b848STomohiro Kusumi * (3) Ensure that any trailing space at the end-of-volume is marked
8472d60b848STomohiro Kusumi * allocated.
8482d60b848STomohiro Kusumi */
8492d60b848STomohiro Kusumi hikey = key + HAMMER2_FREEMAP_LEVEL1_SIZE;
8502d60b848STomohiro Kusumi if (hikey > hmp->total_size) {
8512d60b848STomohiro Kusumi hikey = hmp->total_size & ~HAMMER2_SEGMASK64;
8522d60b848STomohiro Kusumi }
8532d60b848STomohiro Kusumi
8542d60b848STomohiro Kusumi /*
8552d60b848STomohiro Kusumi * Heuristic highest possible value
8562d60b848STomohiro Kusumi */
8572d60b848STomohiro Kusumi chain->bref.check.freemap.avail = HAMMER2_FREEMAP_LEVEL1_SIZE;
8582d60b848STomohiro Kusumi bmap = &chain->data->bmdata[0];
8592d60b848STomohiro Kusumi
8602d60b848STomohiro Kusumi /*
8612d60b848STomohiro Kusumi * Initialize bitmap (bzero'd by caller)
8622d60b848STomohiro Kusumi */
8632d60b848STomohiro Kusumi for (count = 0; count < HAMMER2_FREEMAP_COUNT; ++count) {
8642d60b848STomohiro Kusumi if (key < lokey || key >= hikey) {
8652d60b848STomohiro Kusumi memset(bmap->bitmapq, -1,
8662d60b848STomohiro Kusumi sizeof(bmap->bitmapq));
8672d60b848STomohiro Kusumi bmap->avail = 0;
8682d60b848STomohiro Kusumi bmap->linear = HAMMER2_SEGSIZE;
8692d60b848STomohiro Kusumi chain->bref.check.freemap.avail -=
8702d60b848STomohiro Kusumi HAMMER2_FREEMAP_LEVEL0_SIZE;
8712d60b848STomohiro Kusumi } else {
8722d60b848STomohiro Kusumi bmap->avail = HAMMER2_FREEMAP_LEVEL0_SIZE;
8732d60b848STomohiro Kusumi }
8742d60b848STomohiro Kusumi key += HAMMER2_FREEMAP_LEVEL0_SIZE;
8752d60b848STomohiro Kusumi ++bmap;
8762d60b848STomohiro Kusumi }
8772d60b848STomohiro Kusumi }
8782d60b848STomohiro Kusumi
8792d60b848STomohiro Kusumi /*
8802d60b848STomohiro Kusumi * The current Level 1 freemap has been exhausted, iterate to the next
8812d60b848STomohiro Kusumi * one, return ENOSPC if no freemaps remain.
8822d60b848STomohiro Kusumi *
8832d60b848STomohiro Kusumi * At least two loops are required. If we are not in relaxed mode and
8842d60b848STomohiro Kusumi * we run out of storage we enter relaxed mode and do a third loop.
8852d60b848STomohiro Kusumi * The relaxed mode is recorded back in the hmp so once we enter the mode
8862d60b848STomohiro Kusumi * we remain relaxed until stuff begins to get freed and only do 2 loops.
8872d60b848STomohiro Kusumi *
8882d60b848STomohiro Kusumi * XXX this should rotate back to the beginning to handle freed-up space
8892d60b848STomohiro Kusumi * XXX or use intermediate entries to locate free space. TODO
8902d60b848STomohiro Kusumi */
8912d60b848STomohiro Kusumi static int
hammer2_freemap_iterate(hammer2_chain_t ** parentp,hammer2_chain_t ** chainp,hammer2_fiterate_t * iter)8922d60b848STomohiro Kusumi hammer2_freemap_iterate(hammer2_chain_t **parentp, hammer2_chain_t **chainp,
8932d60b848STomohiro Kusumi hammer2_fiterate_t *iter)
8942d60b848STomohiro Kusumi {
8952d60b848STomohiro Kusumi hammer2_dev_t *hmp = (*parentp)->hmp;
8962d60b848STomohiro Kusumi
8972d60b848STomohiro Kusumi iter->bnext &= ~HAMMER2_FREEMAP_LEVEL1_MASK;
8982d60b848STomohiro Kusumi iter->bnext += HAMMER2_FREEMAP_LEVEL1_SIZE;
8992d60b848STomohiro Kusumi if (iter->bnext >= hmp->total_size) {
9002d60b848STomohiro Kusumi iter->bnext = 0;
9012d60b848STomohiro Kusumi if (++iter->loops >= 2) {
9022d60b848STomohiro Kusumi if (iter->relaxed == 0)
9032d60b848STomohiro Kusumi iter->relaxed = 1;
9042d60b848STomohiro Kusumi else
9052d60b848STomohiro Kusumi return (HAMMER2_ERROR_ENOSPC);
9062d60b848STomohiro Kusumi }
9072d60b848STomohiro Kusumi }
9082d60b848STomohiro Kusumi return(HAMMER2_ERROR_EAGAIN);
9092d60b848STomohiro Kusumi }
9102d60b848STomohiro Kusumi
9112d60b848STomohiro Kusumi /*
9122d60b848STomohiro Kusumi * Adjust the bit-pattern for data in the freemap bitmap according to
9132d60b848STomohiro Kusumi * (how). This code is called from on-mount recovery to fixup (mark
9142d60b848STomohiro Kusumi * as allocated) blocks whos freemap upates might not have been committed
9152d60b848STomohiro Kusumi * in the last crash and is used by the bulk freemap scan to stage frees.
9162d60b848STomohiro Kusumi *
9172d60b848STomohiro Kusumi * WARNING! Cannot be called with a empty-data bref (radix == 0).
9182d60b848STomohiro Kusumi *
9192d60b848STomohiro Kusumi * XXX currently disabled when how == 0 (the normal real-time case). At
9202d60b848STomohiro Kusumi * the moment we depend on the bulk freescan to actually free blocks. It
9212d60b848STomohiro Kusumi * will still call this routine with a non-zero how to stage possible frees
9222d60b848STomohiro Kusumi * and to do the actual free.
9232d60b848STomohiro Kusumi */
9242d60b848STomohiro Kusumi void
hammer2_freemap_adjust(hammer2_dev_t * hmp,hammer2_blockref_t * bref,int how)9252d60b848STomohiro Kusumi hammer2_freemap_adjust(hammer2_dev_t *hmp, hammer2_blockref_t *bref,
9262d60b848STomohiro Kusumi int how)
9272d60b848STomohiro Kusumi {
9282d60b848STomohiro Kusumi hammer2_off_t data_off = bref->data_off;
9292d60b848STomohiro Kusumi hammer2_chain_t *chain;
9302d60b848STomohiro Kusumi hammer2_chain_t *parent;
9312d60b848STomohiro Kusumi hammer2_bmap_data_t *bmap;
9322d60b848STomohiro Kusumi hammer2_key_t key;
9332d60b848STomohiro Kusumi hammer2_key_t key_dummy;
9342d60b848STomohiro Kusumi hammer2_off_t l1size;
9352d60b848STomohiro Kusumi hammer2_off_t l1mask;
9362d60b848STomohiro Kusumi hammer2_tid_t mtid;
9372d60b848STomohiro Kusumi hammer2_bitmap_t *bitmap;
9382d60b848STomohiro Kusumi const hammer2_bitmap_t bmmask00 = 0;
939a0373a75STomohiro Kusumi //hammer2_bitmap_t bmmask01;
940a0373a75STomohiro Kusumi //hammer2_bitmap_t bmmask10;
9412d60b848STomohiro Kusumi hammer2_bitmap_t bmmask11;
9422d60b848STomohiro Kusumi size_t bytes;
9432d60b848STomohiro Kusumi uint16_t class;
9442d60b848STomohiro Kusumi int radix;
9452d60b848STomohiro Kusumi int start;
9462d60b848STomohiro Kusumi int count;
9472d60b848STomohiro Kusumi int modified = 0;
9482d60b848STomohiro Kusumi int error;
9492d60b848STomohiro Kusumi size_t bgsize = 0;
9502d60b848STomohiro Kusumi
9512d60b848STomohiro Kusumi KKASSERT(how == HAMMER2_FREEMAP_DORECOVER);
9522d60b848STomohiro Kusumi
9532d60b848STomohiro Kusumi KKASSERT(hmp->spmp);
9542d60b848STomohiro Kusumi mtid = hammer2_trans_sub(hmp->spmp);
9552d60b848STomohiro Kusumi
9562d60b848STomohiro Kusumi radix = (int)data_off & HAMMER2_OFF_MASK_RADIX;
9572d60b848STomohiro Kusumi KKASSERT(radix != 0);
9582d60b848STomohiro Kusumi data_off &= ~HAMMER2_OFF_MASK_RADIX;
9592d60b848STomohiro Kusumi KKASSERT(radix <= HAMMER2_RADIX_MAX);
9602d60b848STomohiro Kusumi
9612d60b848STomohiro Kusumi if (radix)
9622d60b848STomohiro Kusumi bytes = (size_t)1 << radix;
9632d60b848STomohiro Kusumi else
9642d60b848STomohiro Kusumi bytes = 0;
9652d60b848STomohiro Kusumi class = (bref->type << 8) | HAMMER2_PBUFRADIX;
9662d60b848STomohiro Kusumi
9672d60b848STomohiro Kusumi /*
9682d60b848STomohiro Kusumi * We can't adjust the freemap for data allocations made by
9692d60b848STomohiro Kusumi * newfs_hammer2.
9702d60b848STomohiro Kusumi */
9712d60b848STomohiro Kusumi if (data_off < hmp->voldata.allocator_beg)
9722d60b848STomohiro Kusumi return;
9732d60b848STomohiro Kusumi
9742d60b848STomohiro Kusumi KKASSERT((data_off & HAMMER2_ZONE_MASK64) >= HAMMER2_ZONE_SEG);
9752d60b848STomohiro Kusumi
9762d60b848STomohiro Kusumi /*
9772d60b848STomohiro Kusumi * Lookup the level1 freemap chain. The chain must exist.
9782d60b848STomohiro Kusumi */
9792d60b848STomohiro Kusumi key = H2FMBASE(data_off, HAMMER2_FREEMAP_LEVEL1_RADIX);
9802d60b848STomohiro Kusumi l1size = HAMMER2_FREEMAP_LEVEL1_SIZE;
9812d60b848STomohiro Kusumi l1mask = l1size - 1;
9822d60b848STomohiro Kusumi
9832d60b848STomohiro Kusumi parent = &hmp->fchain;
9842d60b848STomohiro Kusumi hammer2_chain_ref(parent);
9852d60b848STomohiro Kusumi hammer2_chain_lock(parent, HAMMER2_RESOLVE_ALWAYS);
9862d60b848STomohiro Kusumi
9872d60b848STomohiro Kusumi chain = hammer2_chain_lookup(&parent, &key_dummy, key, key + l1mask,
9882d60b848STomohiro Kusumi &error,
9892d60b848STomohiro Kusumi HAMMER2_LOOKUP_ALWAYS |
9902d60b848STomohiro Kusumi HAMMER2_LOOKUP_MATCHIND);
9912d60b848STomohiro Kusumi
9922d60b848STomohiro Kusumi /*
9932d60b848STomohiro Kusumi * Stop early if we are trying to free something but no leaf exists.
9942d60b848STomohiro Kusumi */
9952d60b848STomohiro Kusumi if (chain == NULL && how != HAMMER2_FREEMAP_DORECOVER) {
9962d60b848STomohiro Kusumi kprintf("hammer2_freemap_adjust: %016jx: no chain\n",
9972d60b848STomohiro Kusumi (intmax_t)bref->data_off);
9982d60b848STomohiro Kusumi goto done;
9992d60b848STomohiro Kusumi }
10002d60b848STomohiro Kusumi if (chain->error) {
10012d60b848STomohiro Kusumi kprintf("hammer2_freemap_adjust: %016jx: error %s\n",
10022d60b848STomohiro Kusumi (intmax_t)bref->data_off,
10032d60b848STomohiro Kusumi hammer2_error_str(chain->error));
10042d60b848STomohiro Kusumi hammer2_chain_unlock(chain);
10052d60b848STomohiro Kusumi hammer2_chain_drop(chain);
10062d60b848STomohiro Kusumi chain = NULL;
10072d60b848STomohiro Kusumi goto done;
10082d60b848STomohiro Kusumi }
10092d60b848STomohiro Kusumi
10102d60b848STomohiro Kusumi /*
10112d60b848STomohiro Kusumi * Create any missing leaf(s) if we are doing a recovery (marking
10122d60b848STomohiro Kusumi * the block(s) as being allocated instead of being freed). Be sure
10132d60b848STomohiro Kusumi * to initialize the auxillary freemap tracking info in the
10142d60b848STomohiro Kusumi * bref.check.freemap structure.
10152d60b848STomohiro Kusumi */
10162d60b848STomohiro Kusumi if (chain == NULL && how == HAMMER2_FREEMAP_DORECOVER) {
10172d60b848STomohiro Kusumi error = hammer2_chain_create(&parent, &chain, NULL, hmp->spmp,
10182d60b848STomohiro Kusumi HAMMER2_METH_DEFAULT,
10192d60b848STomohiro Kusumi key, HAMMER2_FREEMAP_LEVEL1_RADIX,
10202d60b848STomohiro Kusumi HAMMER2_BREF_TYPE_FREEMAP_LEAF,
10212d60b848STomohiro Kusumi HAMMER2_FREEMAP_LEVELN_PSIZE,
10222d60b848STomohiro Kusumi mtid, 0, 0);
10232d60b848STomohiro Kusumi
10242d60b848STomohiro Kusumi if (hammer2_debug & 0x0040) {
10252d60b848STomohiro Kusumi kprintf("fixup create chain %p %016jx:%d\n",
10262d60b848STomohiro Kusumi chain, chain->bref.key, chain->bref.keybits);
10272d60b848STomohiro Kusumi }
10282d60b848STomohiro Kusumi
10292d60b848STomohiro Kusumi if (error == 0) {
10302d60b848STomohiro Kusumi error = hammer2_chain_modify(chain, mtid, 0, 0);
10312d60b848STomohiro Kusumi KKASSERT(error == 0);
10322d60b848STomohiro Kusumi bzero(&chain->data->bmdata[0],
10332d60b848STomohiro Kusumi HAMMER2_FREEMAP_LEVELN_PSIZE);
10342d60b848STomohiro Kusumi chain->bref.check.freemap.bigmask = (uint32_t)-1;
10352d60b848STomohiro Kusumi chain->bref.check.freemap.avail = l1size;
10362d60b848STomohiro Kusumi /* bref.methods should already be inherited */
10372d60b848STomohiro Kusumi
10382d60b848STomohiro Kusumi hammer2_freemap_init(hmp, key, chain);
10392d60b848STomohiro Kusumi }
10402d60b848STomohiro Kusumi /* XXX handle error */
10412d60b848STomohiro Kusumi }
10422d60b848STomohiro Kusumi
10432d60b848STomohiro Kusumi #if FREEMAP_DEBUG
10442d60b848STomohiro Kusumi kprintf("FREEMAP ADJUST TYPE %d %016jx/%d DATA_OFF=%016jx\n",
10452d60b848STomohiro Kusumi chain->bref.type, chain->bref.key,
10462d60b848STomohiro Kusumi chain->bref.keybits, chain->bref.data_off);
10472d60b848STomohiro Kusumi #endif
10482d60b848STomohiro Kusumi
10492d60b848STomohiro Kusumi /*
10502d60b848STomohiro Kusumi * Calculate the bitmask (runs in 2-bit pairs).
10512d60b848STomohiro Kusumi */
10522d60b848STomohiro Kusumi start = ((int)(data_off >> HAMMER2_FREEMAP_BLOCK_RADIX) & 15) * 2;
1053a0373a75STomohiro Kusumi //bmmask01 = (hammer2_bitmap_t)1 << start;
1054a0373a75STomohiro Kusumi //bmmask10 = (hammer2_bitmap_t)2 << start;
10552d60b848STomohiro Kusumi bmmask11 = (hammer2_bitmap_t)3 << start;
10562d60b848STomohiro Kusumi
10572d60b848STomohiro Kusumi /*
10582d60b848STomohiro Kusumi * Fixup the bitmap. Partial blocks cannot be fully freed unless
10592d60b848STomohiro Kusumi * a bulk scan is able to roll them up.
10602d60b848STomohiro Kusumi */
10612d60b848STomohiro Kusumi if (radix < HAMMER2_FREEMAP_BLOCK_RADIX) {
10622d60b848STomohiro Kusumi count = 1;
10632d60b848STomohiro Kusumi #if 0
10642d60b848STomohiro Kusumi if (how == HAMMER2_FREEMAP_DOREALFREE)
10652d60b848STomohiro Kusumi how = HAMMER2_FREEMAP_DOMAYFREE;
10662d60b848STomohiro Kusumi #endif
10672d60b848STomohiro Kusumi } else {
10682d60b848STomohiro Kusumi count = 1 << (radix - HAMMER2_FREEMAP_BLOCK_RADIX);
10692d60b848STomohiro Kusumi }
10702d60b848STomohiro Kusumi
10712d60b848STomohiro Kusumi /*
10722d60b848STomohiro Kusumi * [re]load the bmap and bitmap pointers. Each bmap entry covers
10732d60b848STomohiro Kusumi * a 4MB swath. The bmap itself (LEVEL1) covers 2GB.
10742d60b848STomohiro Kusumi *
10752d60b848STomohiro Kusumi * Be sure to reset the linear iterator to ensure that the adjustment
10762d60b848STomohiro Kusumi * is not ignored.
10772d60b848STomohiro Kusumi */
10782d60b848STomohiro Kusumi again:
10792d60b848STomohiro Kusumi bmap = &chain->data->bmdata[(int)(data_off >> HAMMER2_SEGRADIX) &
10802d60b848STomohiro Kusumi (HAMMER2_FREEMAP_COUNT - 1)];
10812d60b848STomohiro Kusumi bitmap = &bmap->bitmapq[(int)(data_off >> (HAMMER2_SEGRADIX - 3)) & 7];
10822d60b848STomohiro Kusumi
10832d60b848STomohiro Kusumi if (modified)
10842d60b848STomohiro Kusumi bmap->linear = 0;
10852d60b848STomohiro Kusumi
10862d60b848STomohiro Kusumi while (count) {
10872d60b848STomohiro Kusumi KKASSERT(bmmask11);
10882d60b848STomohiro Kusumi if (how == HAMMER2_FREEMAP_DORECOVER) {
10892d60b848STomohiro Kusumi /*
10902d60b848STomohiro Kusumi * Recovery request, mark as allocated.
10912d60b848STomohiro Kusumi */
10922d60b848STomohiro Kusumi if ((*bitmap & bmmask11) != bmmask11) {
10932d60b848STomohiro Kusumi if (modified == 0) {
10942d60b848STomohiro Kusumi hammer2_chain_modify(chain, mtid, 0, 0);
10952d60b848STomohiro Kusumi modified = 1;
10962d60b848STomohiro Kusumi goto again;
10972d60b848STomohiro Kusumi }
10982d60b848STomohiro Kusumi if ((*bitmap & bmmask11) == bmmask00) {
10992d60b848STomohiro Kusumi bmap->avail -=
11002d60b848STomohiro Kusumi HAMMER2_FREEMAP_BLOCK_SIZE;
11012d60b848STomohiro Kusumi bgsize += HAMMER2_FREEMAP_BLOCK_SIZE;
11022d60b848STomohiro Kusumi }
11032d60b848STomohiro Kusumi if (bmap->class == 0)
11042d60b848STomohiro Kusumi bmap->class = class;
11052d60b848STomohiro Kusumi *bitmap |= bmmask11;
11062d60b848STomohiro Kusumi if (hammer2_debug & 0x0040) {
11072d60b848STomohiro Kusumi kprintf("hammer2_freemap_adjust: "
11082d60b848STomohiro Kusumi "fixup type=%02x "
11092d60b848STomohiro Kusumi "block=%016jx/%zd\n",
11102d60b848STomohiro Kusumi bref->type, data_off, bytes);
11112d60b848STomohiro Kusumi }
11122d60b848STomohiro Kusumi } else {
11132d60b848STomohiro Kusumi /*
11142d60b848STomohiro Kusumi kprintf("hammer2_freemap_adjust: good "
11152d60b848STomohiro Kusumi "type=%02x block=%016jx/%zd\n",
11162d60b848STomohiro Kusumi bref->type, data_off, bytes);
11172d60b848STomohiro Kusumi */
11182d60b848STomohiro Kusumi }
11192d60b848STomohiro Kusumi }
11202d60b848STomohiro Kusumi #if 0
11212d60b848STomohiro Kusumi /*
11222d60b848STomohiro Kusumi * XXX this stuff doesn't work, avail is miscalculated and
11232d60b848STomohiro Kusumi * code 10 means something else now.
11242d60b848STomohiro Kusumi */
11252d60b848STomohiro Kusumi else if ((*bitmap & bmmask11) == bmmask11) {
11262d60b848STomohiro Kusumi /*
11272d60b848STomohiro Kusumi * Mayfree/Realfree request and bitmap is currently
11282d60b848STomohiro Kusumi * marked as being fully allocated.
11292d60b848STomohiro Kusumi */
11302d60b848STomohiro Kusumi if (!modified) {
11312d60b848STomohiro Kusumi hammer2_chain_modify(chain, 0);
11322d60b848STomohiro Kusumi modified = 1;
11332d60b848STomohiro Kusumi goto again;
11342d60b848STomohiro Kusumi }
11352d60b848STomohiro Kusumi if (how == HAMMER2_FREEMAP_DOREALFREE)
11362d60b848STomohiro Kusumi *bitmap &= ~bmmask11;
11372d60b848STomohiro Kusumi else
11382d60b848STomohiro Kusumi *bitmap = (*bitmap & ~bmmask11) | bmmask10;
11392d60b848STomohiro Kusumi } else if ((*bitmap & bmmask11) == bmmask10) {
11402d60b848STomohiro Kusumi /*
11412d60b848STomohiro Kusumi * Mayfree/Realfree request and bitmap is currently
11422d60b848STomohiro Kusumi * marked as being possibly freeable.
11432d60b848STomohiro Kusumi */
11442d60b848STomohiro Kusumi if (how == HAMMER2_FREEMAP_DOREALFREE) {
11452d60b848STomohiro Kusumi if (!modified) {
11462d60b848STomohiro Kusumi hammer2_chain_modify(chain, 0);
11472d60b848STomohiro Kusumi modified = 1;
11482d60b848STomohiro Kusumi goto again;
11492d60b848STomohiro Kusumi }
11502d60b848STomohiro Kusumi *bitmap &= ~bmmask11;
11512d60b848STomohiro Kusumi }
11522d60b848STomohiro Kusumi } else {
11532d60b848STomohiro Kusumi /*
11542d60b848STomohiro Kusumi * 01 - Not implemented, currently illegal state
11552d60b848STomohiro Kusumi * 00 - Not allocated at all, illegal free.
11562d60b848STomohiro Kusumi */
11572d60b848STomohiro Kusumi panic("hammer2_freemap_adjust: "
11582d60b848STomohiro Kusumi "Illegal state %08x(%08x)",
11592d60b848STomohiro Kusumi *bitmap, *bitmap & bmmask11);
11602d60b848STomohiro Kusumi }
11612d60b848STomohiro Kusumi #endif
11622d60b848STomohiro Kusumi --count;
1163a0373a75STomohiro Kusumi //bmmask01 <<= 2;
1164a0373a75STomohiro Kusumi //bmmask10 <<= 2;
11652d60b848STomohiro Kusumi bmmask11 <<= 2;
11662d60b848STomohiro Kusumi }
11672d60b848STomohiro Kusumi #if 0
11682d60b848STomohiro Kusumi #if HAMMER2_BMAP_ELEMENTS != 8
11692d60b848STomohiro Kusumi #error "hammer2_freemap.c: HAMMER2_BMAP_ELEMENTS expected to be 8"
11702d60b848STomohiro Kusumi #endif
11712d60b848STomohiro Kusumi if (how == HAMMER2_FREEMAP_DOREALFREE && modified) {
11722d60b848STomohiro Kusumi bmap->avail += 1 << radix;
11732d60b848STomohiro Kusumi KKASSERT(bmap->avail <= HAMMER2_SEGSIZE);
11742d60b848STomohiro Kusumi if (bmap->avail == HAMMER2_SEGSIZE &&
11752d60b848STomohiro Kusumi bmap->bitmapq[0] == 0 &&
11762d60b848STomohiro Kusumi bmap->bitmapq[1] == 0 &&
11772d60b848STomohiro Kusumi bmap->bitmapq[2] == 0 &&
11782d60b848STomohiro Kusumi bmap->bitmapq[3] == 0 &&
11792d60b848STomohiro Kusumi bmap->bitmapq[4] == 0 &&
11802d60b848STomohiro Kusumi bmap->bitmapq[5] == 0 &&
11812d60b848STomohiro Kusumi bmap->bitmapq[6] == 0 &&
11822d60b848STomohiro Kusumi bmap->bitmapq[7] == 0) {
11832d60b848STomohiro Kusumi key = H2FMBASE(data_off, HAMMER2_FREEMAP_LEVEL0_RADIX);
11842d60b848STomohiro Kusumi kprintf("Freeseg %016jx\n", (intmax_t)key);
11852d60b848STomohiro Kusumi bmap->class = 0;
11862d60b848STomohiro Kusumi }
11872d60b848STomohiro Kusumi }
11882d60b848STomohiro Kusumi #endif
11892d60b848STomohiro Kusumi
11902d60b848STomohiro Kusumi /*
11912d60b848STomohiro Kusumi * chain->bref.check.freemap.bigmask (XXX)
11922d60b848STomohiro Kusumi *
11932d60b848STomohiro Kusumi * Setting bigmask is a hint to the allocation code that there might
11942d60b848STomohiro Kusumi * be something allocatable. We also set this in recovery... it
11952d60b848STomohiro Kusumi * doesn't hurt and we might want to use the hint for other validation
11962d60b848STomohiro Kusumi * operations later on.
11972d60b848STomohiro Kusumi *
11982d60b848STomohiro Kusumi * We could calculate the largest possible allocation and set the
1199*01a24a93STomohiro Kusumi * radixes that could fit, but its easier just to set bigmask to -1.
12002d60b848STomohiro Kusumi */
12012d60b848STomohiro Kusumi if (modified) {
12022d60b848STomohiro Kusumi chain->bref.check.freemap.bigmask = -1;
12032d60b848STomohiro Kusumi hmp->freemap_relaxed = 0; /* reset heuristic */
12042d60b848STomohiro Kusumi }
12052d60b848STomohiro Kusumi
12062d60b848STomohiro Kusumi hammer2_chain_unlock(chain);
12072d60b848STomohiro Kusumi hammer2_chain_drop(chain);
12082d60b848STomohiro Kusumi done:
12092d60b848STomohiro Kusumi hammer2_chain_unlock(parent);
12102d60b848STomohiro Kusumi hammer2_chain_drop(parent);
12112d60b848STomohiro Kusumi
12122d60b848STomohiro Kusumi if (bgsize) {
12132d60b848STomohiro Kusumi hammer2_voldata_lock(hmp);
12142d60b848STomohiro Kusumi hammer2_voldata_modify(hmp);
12152d60b848STomohiro Kusumi hmp->voldata.allocator_free -= bgsize;
12162d60b848STomohiro Kusumi hammer2_voldata_unlock(hmp);
12172d60b848STomohiro Kusumi }
12182d60b848STomohiro Kusumi }
12192d60b848STomohiro Kusumi
12202d60b848STomohiro Kusumi /*
12212d60b848STomohiro Kusumi * Validate the freemap, in three stages.
12222d60b848STomohiro Kusumi *
12232d60b848STomohiro Kusumi * stage-1 ALLOCATED -> POSSIBLY FREE
12242d60b848STomohiro Kusumi * POSSIBLY FREE -> POSSIBLY FREE (type corrected)
12252d60b848STomohiro Kusumi *
12262d60b848STomohiro Kusumi * This transitions bitmap entries from ALLOCATED to POSSIBLY FREE.
12272d60b848STomohiro Kusumi * The POSSIBLY FREE state does not mean that a block is actually free
12282d60b848STomohiro Kusumi * and may be transitioned back to ALLOCATED in stage-2.
12292d60b848STomohiro Kusumi *
12302d60b848STomohiro Kusumi * This is typically done during normal filesystem operations when
12312d60b848STomohiro Kusumi * something is deleted or a block is replaced.
12322d60b848STomohiro Kusumi *
12332d60b848STomohiro Kusumi * This is done by bulkfree in-bulk after a memory-bounded meta-data
12342d60b848STomohiro Kusumi * scan to try to determine what might be freeable.
12352d60b848STomohiro Kusumi *
12362d60b848STomohiro Kusumi * This can be done unconditionally through a freemap scan when the
12372d60b848STomohiro Kusumi * intention is to brute-force recover the proper state of the freemap.
12382d60b848STomohiro Kusumi *
12392d60b848STomohiro Kusumi * stage-2 POSSIBLY FREE -> ALLOCATED (scan metadata topology)
12402d60b848STomohiro Kusumi *
12412d60b848STomohiro Kusumi * This is done by bulkfree during a meta-data scan to ensure that
12422d60b848STomohiro Kusumi * all blocks still actually allocated by the filesystem are marked
12432d60b848STomohiro Kusumi * as such.
12442d60b848STomohiro Kusumi *
12452d60b848STomohiro Kusumi * NOTE! Live filesystem transitions to POSSIBLY FREE can occur while
12462d60b848STomohiro Kusumi * the bulkfree stage-2 and stage-3 is running. The live filesystem
12472d60b848STomohiro Kusumi * will use the alternative POSSIBLY FREE type (2) to prevent
12482d60b848STomohiro Kusumi * stage-3 from improperly transitioning unvetted possibly-free
12492d60b848STomohiro Kusumi * blocks to FREE.
12502d60b848STomohiro Kusumi *
12512d60b848STomohiro Kusumi * stage-3 POSSIBLY FREE (type 1) -> FREE (scan freemap)
12522d60b848STomohiro Kusumi *
12532d60b848STomohiro Kusumi * This is done by bulkfree to finalize POSSIBLY FREE states.
12542d60b848STomohiro Kusumi *
12552d60b848STomohiro Kusumi */
1256