2 * Copyright (c) 2011-2013 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@dragonflybsd.org>
6 * by Venkatesh Srinivas <vsrinivas@dragonflybsd.org>
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
18 * 3. Neither the name of The DragonFly Project nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific, prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
30 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
31 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
32 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #include <sys/param.h>
36 #include <sys/systm.h>
37 #include <sys/kernel.h>
38 #include <sys/fcntl.h>
41 #include <sys/namei.h>
42 #include <sys/mount.h>
43 #include <sys/vnode.h>
44 #include <sys/mountctl.h>
49 * Allocate media space, returning a combined data offset and radix.
51 * XXX when diving a new full block create a clean empty buffer and bqrelse()
52 * it, so small data structures do not have to issue read-IO when they
53 * do the read-modify-write on the backing store.
56 hammer2_freemap_alloc(hammer2_mount_t *hmp, int type, size_t bytes)
58 hammer2_off_t data_off;
59 hammer2_off_t data_next;
60 hammer2_freecache_t *fc;
66 case HAMMER2_BREF_TYPE_INODE:
67 fctype = HAMMER2_FREECACHE_INODE;
69 case HAMMER2_BREF_TYPE_INDIRECT:
70 fctype = HAMMER2_FREECACHE_INODE;
72 case HAMMER2_BREF_TYPE_DATA:
73 fctype = HAMMER2_FREECACHE_DATA;
76 fctype = HAMMER2_FREECACHE_DATA;
81 * Figure out the base 2 radix of the allocation (rounded up)
83 radix = hammer2_allocsize(bytes);
86 if (radix <= HAMMER2_MAX_RADIX)
87 fc = &hmp->freecache[fctype][radix];
91 lockmgr(&hmp->alloclk, LK_EXCLUSIVE);
92 if (fc && fc->single) {
94 * Allocate from our single-block cache.
96 data_off = fc->single;
98 } else if (fc && fc->bulk) {
100 * Allocate from our packing cache.
104 if ((fc->bulk & HAMMER2_SEGMASK) == 0)
108 * Allocate from the allocation iterator using a SEGSIZE
109 * aligned block and reload the packing cache if possible.
111 * Skip reserved areas at the beginning of each zone.
113 hammer2_voldata_lock(hmp);
114 data_off = hmp->voldata.allocator_beg;
115 data_off = (data_off + HAMMER2_SEGMASK64) & ~HAMMER2_SEGMASK64;
116 if ((data_off & HAMMER2_ZONE_MASK64) < HAMMER2_ZONE_SEG) {
117 KKASSERT((data_off & HAMMER2_ZONE_MASK64) == 0);
118 data_off += HAMMER2_ZONE_SEG64;
120 data_next = data_off + bytes;
122 if ((data_next & HAMMER2_SEGMASK) == 0) {
123 hmp->voldata.allocator_beg = data_next;
125 KKASSERT(radix <= HAMMER2_MAX_RADIX);
126 hmp->voldata.allocator_beg =
127 (data_next + HAMMER2_SEGMASK64) &
129 fc->bulk = data_next;
131 hammer2_voldata_unlock(hmp, 1);
133 lockmgr(&hmp->alloclk, LK_RELEASE);
137 * Allocations on-media are always in multiples of 64K but
138 * partial-block allocations can be tracked in-memory.
140 * We can reduce the need for read-modify-write IOs by
141 * telling the kernel that the contents of a new 64K block is
142 * initially good (before we use any of it).
144 * Worst case is the kernel evicts the buffer and causes HAMMER2's
145 * bread later on to actually issue a read I/O.
147 * XXX Maybe do this in SEGSIZE increments? Needs a lot of work.
148 * Also watch out for buffer size mismatches.
150 if (bytes < HAMMER2_MINIOSIZE &&
151 (data_off & (HAMMER2_MINIOSIZE - 1)) == 0) {
152 bp = getblk(hmp->devvp, data_off, HAMMER2_MINIOSIZE, 0, 0);
153 bp->b_flags |= B_CACHE;
159 if (hammer2_debug & 0x0001) {
160 kprintf("hammer2: allocate %d %016jx: %zd\n",
161 type, (intmax_t)data_off, bytes);
163 return (data_off | radix);
167 hammer2_freemap_free(hammer2_mount_t *hmp, hammer2_off_t data_off, int type)
169 hammer2_freecache_t *fc;
174 case HAMMER2_BREF_TYPE_INODE:
175 fctype = HAMMER2_FREECACHE_INODE;
177 case HAMMER2_BREF_TYPE_INDIRECT:
178 fctype = HAMMER2_FREECACHE_INODE;
180 case HAMMER2_BREF_TYPE_DATA:
181 fctype = HAMMER2_FREECACHE_DATA;
184 fctype = HAMMER2_FREECACHE_DATA;
187 radix = (int)data_off & HAMMER2_OFF_MASK_RADIX;
188 data_off &= ~HAMMER2_OFF_MASK_RADIX;
189 if (radix >= HAMMER2_MAX_RADIX)
192 fc = &hmp->freecache[fctype][radix];
193 if (fc->single == 0) {
194 lockmgr(&hmp->alloclk, LK_EXCLUSIVE);
195 fc->single = data_off;
196 lockmgr(&hmp->alloclk, LK_RELEASE);
202 * Allocate media space, returning a combined data offset and radix.
203 * Also return the related (device) buffer cache buffer.
206 hammer2_freemap_alloc_bp(hammer2_mount_t *hmp, size_t bytes, struct buf **bpp)