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/cdefs.h>
36 #include <sys/param.h>
37 #include <sys/systm.h>
38 #include <sys/types.h>
41 #include <sys/dirent.h>
50 hammer2_mount_exlock(hammer2_mount_t *hmp)
52 ccms_thread_lock(&hmp->vchain.core->cst, CCMS_STATE_EXCLUSIVE);
56 hammer2_mount_shlock(hammer2_mount_t *hmp)
58 ccms_thread_lock(&hmp->vchain.core->cst, CCMS_STATE_SHARED);
62 hammer2_mount_unlock(hammer2_mount_t *hmp)
64 ccms_thread_unlock(&hmp->vchain.core->cst);
68 hammer2_voldata_lock(hammer2_mount_t *hmp)
70 lockmgr(&hmp->voldatalk, LK_EXCLUSIVE);
74 hammer2_voldata_unlock(hammer2_mount_t *hmp, int modify)
77 (hmp->vchain.flags & HAMMER2_CHAIN_MODIFIED) == 0) {
78 atomic_set_int(&hmp->vchain.flags, HAMMER2_CHAIN_MODIFIED);
79 hammer2_chain_ref(&hmp->vchain);
81 lockmgr(&hmp->voldatalk, LK_RELEASE);
85 * Return the directory entry type for an inode.
87 * ip must be locked sh/ex.
90 hammer2_get_dtype(hammer2_chain_t *chain)
94 KKASSERT(chain->bref.type == HAMMER2_BREF_TYPE_INODE);
96 if ((type = chain->data->ipdata.type) == HAMMER2_OBJTYPE_HARDLINK)
97 type = chain->data->ipdata.target_type;
100 case HAMMER2_OBJTYPE_UNKNOWN:
102 case HAMMER2_OBJTYPE_DIRECTORY:
104 case HAMMER2_OBJTYPE_REGFILE:
106 case HAMMER2_OBJTYPE_FIFO:
108 case HAMMER2_OBJTYPE_CDEV: /* not supported */
110 case HAMMER2_OBJTYPE_BDEV: /* not supported */
112 case HAMMER2_OBJTYPE_SOFTLINK:
114 case HAMMER2_OBJTYPE_HARDLINK: /* (never directly associated w/vp) */
116 case HAMMER2_OBJTYPE_SOCKET:
118 case HAMMER2_OBJTYPE_WHITEOUT: /* not supported */
127 * Return the directory entry type for an inode
130 hammer2_get_vtype(hammer2_chain_t *chain)
132 KKASSERT(chain->bref.type == HAMMER2_BREF_TYPE_INODE);
134 switch(chain->data->ipdata.type) {
135 case HAMMER2_OBJTYPE_UNKNOWN:
137 case HAMMER2_OBJTYPE_DIRECTORY:
139 case HAMMER2_OBJTYPE_REGFILE:
141 case HAMMER2_OBJTYPE_FIFO:
143 case HAMMER2_OBJTYPE_CDEV: /* not supported */
145 case HAMMER2_OBJTYPE_BDEV: /* not supported */
147 case HAMMER2_OBJTYPE_SOFTLINK:
149 case HAMMER2_OBJTYPE_HARDLINK: /* XXX */
151 case HAMMER2_OBJTYPE_SOCKET:
153 case HAMMER2_OBJTYPE_WHITEOUT: /* not supported */
162 hammer2_get_obj_type(enum vtype vtype)
166 return(HAMMER2_OBJTYPE_DIRECTORY);
168 return(HAMMER2_OBJTYPE_REGFILE);
170 return(HAMMER2_OBJTYPE_FIFO);
172 return(HAMMER2_OBJTYPE_SOCKET);
174 return(HAMMER2_OBJTYPE_CDEV);
176 return(HAMMER2_OBJTYPE_BDEV);
178 return(HAMMER2_OBJTYPE_SOFTLINK);
180 return(HAMMER2_OBJTYPE_UNKNOWN);
186 * Convert a hammer2 64-bit time to a timespec.
189 hammer2_time_to_timespec(u_int64_t xtime, struct timespec *ts)
191 ts->tv_sec = (unsigned long)(xtime / 1000000);
192 ts->tv_nsec = (unsigned int)(xtime % 1000000) * 1000L;
196 hammer2_timespec_to_time(struct timespec *ts)
200 xtime = (unsigned)(ts->tv_nsec / 1000) +
201 (unsigned long)ts->tv_sec * 1000000ULL;
206 * Convert a uuid to a unix uid or gid
209 hammer2_to_unix_xid(uuid_t *uuid)
211 return(*(u_int32_t *)&uuid->node[2]);
215 hammer2_guid_to_uuid(uuid_t *uuid, u_int32_t guid)
217 bzero(uuid, sizeof(*uuid));
218 *(u_int32_t *)&uuid->node[2] = guid;
222 * Borrow HAMMER1's directory hash algorithm #1 with a few modifications.
223 * The filename is split into fields which are hashed separately and then
226 * Differences include: bit 63 must be set to 1 for HAMMER2 (HAMMER1 sets
227 * it to 0), this is because bit63=0 is used for hidden hardlinked inodes.
228 * (This means we do not need to do a 0-check/or-with-0x100000000 either).
230 * Also, the iscsi crc code is used instead of the old crc32 code.
233 hammer2_dirhash(const unsigned char *name, size_t len)
235 const unsigned char *aname = name;
247 for (i = j = 0; i < len; ++i) {
248 if (aname[i] == '.' ||
253 crcx += hammer2_icrc32(aname + j, i - j);
258 crcx += hammer2_icrc32(aname + j, i - j);
261 * The directory hash utilizes the top 32 bits of the 64-bit key.
262 * Bit 63 must be set to 1.
265 key |= (uint64_t)crcx << 32;
268 * l16 - crc of entire filename
270 * This crc reduces degenerate hash collision conditions
272 crcx = hammer2_icrc32(aname, len);
273 crcx = crcx ^ (crcx << 16);
274 key |= crcx & 0xFFFF0000U;
277 * Set bit 15. This allows readdir to strip bit 63 so a positive
278 * 64-bit cookie/offset can always be returned, and still guarantee
279 * that the values 0x0000-0x7FFF are available for artificial entries.
289 * Return the power-of-2 radix greater or equal to
290 * the specified number of bytes.
292 * Always returns at least the minimum media allocation
293 * size radix, HAMMER2_MIN_RADIX (10), which is 1KB.
296 hammer2_allocsize(size_t bytes)
300 if (bytes < HAMMER2_MIN_ALLOC)
301 bytes = HAMMER2_MIN_ALLOC;
302 if (bytes == HAMMER2_PBUFSIZE)
303 radix = HAMMER2_PBUFRADIX;
304 else if (bytes >= 16384)
306 else if (bytes >= 1024)
309 radix = HAMMER2_MIN_RADIX;
311 while (((size_t)1 << radix) < bytes)
319 * Convert bytes to radix with no limitations
322 hammer2_getradix(size_t bytes)
326 if (bytes == HAMMER2_PBUFSIZE)
327 radix = HAMMER2_PBUFRADIX;
328 else if (bytes >= 16384)
330 else if (bytes >= 1024)
335 while (((size_t)1 << radix) < bytes)
341 * ip must be locked sh/ex
344 hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
345 hammer2_key_t *lbasep, hammer2_key_t *leofp)
347 hammer2_inode_data_t *ipdata = &ip->chain->data->ipdata;
350 *lbasep = uoff & ~HAMMER2_PBUFMASK64;
351 *leofp = ipdata->size & ~HAMMER2_PBUFMASK64;
352 KKASSERT(*lbasep <= *leofp);
353 if (*lbasep == *leofp /*&& *leofp < 1024 * 1024*/) {
354 radix = hammer2_getradix((size_t)(ipdata->size - *leofp));
355 if (radix < HAMMER2_MINIORADIX)
356 radix = HAMMER2_MINIORADIX;
357 *leofp += 1U << radix;
358 return (1U << radix);
360 return (HAMMER2_PBUFSIZE);
365 hammer2_update_time(uint64_t *timep)
370 *timep = (unsigned long)tv.tv_sec * 1000000 + tv.tv_usec;