2 * Copyright (c) 2011-2012 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/cdefs.h>
36 #include <sys/param.h>
37 #include <sys/systm.h>
38 #include <sys/types.h>
41 #include <sys/dirent.h>
48 * HAMMER2 offers shared locks, update locks, and exclusive locks on inodes.
50 * Shared locks allow concurrent access to an inode's fields, but exclude
51 * access by concurrent exclusive locks.
53 * Update locks are interesting -- an update lock will be taken after all
54 * shared locks on an inode are released, but once it is in place, shared
55 * locks may proceed. The update field is signalled by a busy flag in the
56 * inode. Only one update lock may be in place at a given time on an inode.
58 * Exclusive locks prevent concurrent access to the inode.
60 * XXX: What do we use each for? How is visibility to the inode controlled?
65 hammer2_inode_lock_ex(hammer2_inode_t *ip)
67 hammer2_chain_lock(ip->hmp, &ip->chain, HAMMER2_RESOLVE_ALWAYS);
71 hammer2_inode_unlock_ex(hammer2_inode_t *ip)
73 hammer2_chain_unlock(ip->hmp, &ip->chain);
77 hammer2_inode_lock_sh(hammer2_inode_t *ip)
79 KKASSERT(ip->chain.refs > 0);
80 lockmgr(&ip->chain.lk, LK_SHARED);
84 hammer2_inode_unlock_sh(hammer2_inode_t *ip)
86 lockmgr(&ip->chain.lk, LK_RELEASE);
92 * The inode must be exclusively locked while soft-busying or soft-unbusying
93 * an inode. Once busied or unbusied the caller can release the lock.
96 hammer2_inode_busy(hammer2_inode_t *ip)
98 if (ip->chain.busy++ == 0)
99 hammer2_chain_ref(ip->hmp, &ip->chain);
103 hammer2_inode_unbusy(hammer2_inode_t *ip)
105 if (--ip->chain.busy == 0)
106 hammer2_chain_drop(ip->hmp, &ip->chain);
114 hammer2_mount_exlock(hammer2_mount_t *hmp)
116 lockmgr(&hmp->vchain.lk, LK_EXCLUSIVE);
120 hammer2_mount_shlock(hammer2_mount_t *hmp)
122 lockmgr(&hmp->vchain.lk, LK_SHARED);
126 hammer2_mount_unlock(hammer2_mount_t *hmp)
128 lockmgr(&hmp->vchain.lk, LK_RELEASE);
132 hammer2_voldata_lock(hammer2_mount_t *hmp)
134 lockmgr(&hmp->voldatalk, LK_EXCLUSIVE);
138 hammer2_voldata_unlock(hammer2_mount_t *hmp)
140 lockmgr(&hmp->voldatalk, LK_RELEASE);
144 * Return the directory entry type for an inode
147 hammer2_get_dtype(hammer2_inode_t *ip)
149 switch(ip->ip_data.type) {
150 case HAMMER2_OBJTYPE_UNKNOWN:
152 case HAMMER2_OBJTYPE_DIRECTORY:
154 case HAMMER2_OBJTYPE_REGFILE:
156 case HAMMER2_OBJTYPE_FIFO:
158 case HAMMER2_OBJTYPE_CDEV: /* not supported */
160 case HAMMER2_OBJTYPE_BDEV: /* not supported */
162 case HAMMER2_OBJTYPE_SOFTLINK:
164 case HAMMER2_OBJTYPE_HARDLINK: /* (never directly associated w/vp) */
166 case HAMMER2_OBJTYPE_SOCKET:
168 case HAMMER2_OBJTYPE_WHITEOUT: /* not supported */
177 * Return the directory entry type for an inode
180 hammer2_get_vtype(hammer2_inode_t *ip)
182 switch(ip->ip_data.type) {
183 case HAMMER2_OBJTYPE_UNKNOWN:
185 case HAMMER2_OBJTYPE_DIRECTORY:
187 case HAMMER2_OBJTYPE_REGFILE:
189 case HAMMER2_OBJTYPE_FIFO:
191 case HAMMER2_OBJTYPE_CDEV: /* not supported */
193 case HAMMER2_OBJTYPE_BDEV: /* not supported */
195 case HAMMER2_OBJTYPE_SOFTLINK:
197 case HAMMER2_OBJTYPE_HARDLINK: /* XXX */
199 case HAMMER2_OBJTYPE_SOCKET:
201 case HAMMER2_OBJTYPE_WHITEOUT: /* not supported */
210 hammer2_get_obj_type(enum vtype vtype)
214 return(HAMMER2_OBJTYPE_DIRECTORY);
216 return(HAMMER2_OBJTYPE_REGFILE);
218 return(HAMMER2_OBJTYPE_FIFO);
220 return(HAMMER2_OBJTYPE_SOCKET);
222 return(HAMMER2_OBJTYPE_CDEV);
224 return(HAMMER2_OBJTYPE_BDEV);
226 return(HAMMER2_OBJTYPE_SOFTLINK);
228 return(HAMMER2_OBJTYPE_UNKNOWN);
234 * Convert a hammer2 64-bit time to a timespec.
237 hammer2_time_to_timespec(u_int64_t xtime, struct timespec *ts)
239 ts->tv_sec = (unsigned long)(xtime / 1000000);
240 ts->tv_nsec = (unsigned int)(xtime % 1000000) * 1000L;
244 * Convert a uuid to a unix uid or gid
247 hammer2_to_unix_xid(uuid_t *uuid)
249 return(*(u_int32_t *)&uuid->node[2]);
253 * Borrow HAMMER1's directory hash algorithm #1 with a few modifications.
254 * The filename is split into fields which are hashed separately and then
257 * Differences include: bit 63 must be set to 1 for HAMMER2 (HAMMER1 sets
258 * it to 0), this is because bit63=0 is used for hidden hardlinked inodes.
259 * (This means we do not need to do a 0-check/or-with-0x100000000 either).
261 * Also, the iscsi crc code is used instead of the old crc32 code.
264 hammer2_dirhash(const unsigned char *name, size_t len)
266 const unsigned char *aname = name;
278 for (i = j = 0; i < len; ++i) {
279 if (aname[i] == '.' ||
284 crcx += hammer2_icrc32(aname + j, i - j);
289 crcx += hammer2_icrc32(aname + j, i - j);
292 * The directory hash utilizes the top 32 bits of the 64-bit key.
293 * Bit 63 must be set to 1.
296 key |= (uint64_t)crcx << 32;
299 * l16 - crc of entire filename
301 * This crc reduces degenerate hash collision conditions
303 crcx = hammer2_icrc32(aname, len);
304 crcx = crcx ^ (crcx << 16);
305 key |= crcx & 0xFFFF0000U;
308 * Set bit 15. This allows readdir to strip bit 63 so a positive
309 * 64-bit cookie/offset can always be returned, and still guarantee
310 * that the values 0x0000-0x7FFF are available for artificial entries.
319 * Return the power-of-2 radix greater or equal to
320 * the specified number of bytes.
322 * Always returns at least HAMMER2_MIN_RADIX (2^6).
325 hammer2_bytes_to_radix(size_t bytes)
329 if (bytes < HAMMER2_MIN_ALLOC)
330 bytes = HAMMER2_MIN_ALLOC;
331 if (bytes == HAMMER2_PBUFSIZE)
332 radix = HAMMER2_PBUFRADIX;
333 else if (bytes >= 1024)
336 radix = HAMMER2_MIN_RADIX;
338 while (((size_t)1 << radix) < bytes)
344 hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
345 hammer2_key_t *lbasep, hammer2_key_t *leofp)
349 *lbasep = uoff & ~HAMMER2_PBUFMASK64;
350 *leofp = ip->ip_data.size & ~HAMMER2_PBUFMASK;
351 KKASSERT(*lbasep <= *leofp);
352 if (*lbasep == *leofp) {
353 radix = hammer2_bytes_to_radix(
354 (size_t)(ip->ip_data.size - *leofp));
355 if (radix < HAMMER2_MINALLOCRADIX)
356 radix = HAMMER2_MINALLOCRADIX;
357 *leofp += 1U << radix;
358 return (1U << radix);
360 return (HAMMER2_PBUFSIZE);