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 and exclusive locks on inodes.
50 * An inode's ip->chain pointer is resolved and stable while an inode is
51 * locked, and can be cleaned out at any time (become NULL) when an inode
54 * The underlying chain is also locked.
56 * NOTE: We don't combine the inode/chain lock because putting away an
57 * inode would otherwise confuse multiple lock holders of the inode.
60 hammer2_inode_lock_ex(hammer2_inode_t *ip)
62 hammer2_inode_ref(ip);
63 ccms_thread_lock(&ip->topo_cst, CCMS_STATE_EXCLUSIVE);
64 KKASSERT(ip->chain != NULL); /* for now */
65 hammer2_chain_lock(ip->hmp, ip->chain, HAMMER2_RESOLVE_ALWAYS);
69 hammer2_inode_unlock_ex(hammer2_inode_t *ip)
72 hammer2_chain_unlock(ip->hmp, ip->chain);
73 ccms_thread_unlock(&ip->topo_cst);
74 hammer2_inode_drop(ip);
78 hammer2_inode_lock_sh(hammer2_inode_t *ip)
80 hammer2_inode_ref(ip);
81 ccms_thread_lock(&ip->topo_cst, CCMS_STATE_SHARED);
82 KKASSERT(ip->chain != NULL); /* for now */
83 hammer2_chain_lock(ip->hmp, ip->chain, HAMMER2_RESOLVE_ALWAYS |
84 HAMMER2_RESOLVE_SHARED);
88 hammer2_inode_unlock_sh(hammer2_inode_t *ip)
91 hammer2_chain_unlock(ip->hmp, ip->chain);
92 ccms_thread_unlock(&ip->topo_cst);
93 hammer2_inode_drop(ip);
97 hammer2_inode_lock_temp_release(hammer2_inode_t *ip)
99 return(ccms_thread_lock_temp_release(&ip->topo_cst));
103 hammer2_inode_lock_upgrade(hammer2_inode_t *ip)
105 return(ccms_thread_lock_upgrade(&ip->topo_cst));
109 hammer2_inode_lock_restore(hammer2_inode_t *ip, ccms_state_t ostate)
111 ccms_thread_lock_restore(&ip->topo_cst, ostate);
119 hammer2_mount_exlock(hammer2_mount_t *hmp)
121 ccms_thread_lock(&hmp->vchain.cst, CCMS_STATE_EXCLUSIVE);
125 hammer2_mount_shlock(hammer2_mount_t *hmp)
127 ccms_thread_lock(&hmp->vchain.cst, CCMS_STATE_SHARED);
131 hammer2_mount_unlock(hammer2_mount_t *hmp)
133 ccms_thread_unlock(&hmp->vchain.cst);
137 hammer2_voldata_lock(hammer2_mount_t *hmp)
139 lockmgr(&hmp->voldatalk, LK_EXCLUSIVE);
143 hammer2_voldata_unlock(hammer2_mount_t *hmp)
145 lockmgr(&hmp->voldatalk, LK_RELEASE);
149 * Return the directory entry type for an inode.
151 * ip must be locked sh/ex.
154 hammer2_get_dtype(hammer2_chain_t *chain)
158 KKASSERT(chain->bref.type == HAMMER2_BREF_TYPE_INODE);
160 if ((type = chain->data->ipdata.type) == HAMMER2_OBJTYPE_HARDLINK)
161 type = chain->data->ipdata.target_type;
164 case HAMMER2_OBJTYPE_UNKNOWN:
166 case HAMMER2_OBJTYPE_DIRECTORY:
168 case HAMMER2_OBJTYPE_REGFILE:
170 case HAMMER2_OBJTYPE_FIFO:
172 case HAMMER2_OBJTYPE_CDEV: /* not supported */
174 case HAMMER2_OBJTYPE_BDEV: /* not supported */
176 case HAMMER2_OBJTYPE_SOFTLINK:
178 case HAMMER2_OBJTYPE_HARDLINK: /* (never directly associated w/vp) */
180 case HAMMER2_OBJTYPE_SOCKET:
182 case HAMMER2_OBJTYPE_WHITEOUT: /* not supported */
191 * Return the directory entry type for an inode
194 hammer2_get_vtype(hammer2_chain_t *chain)
196 KKASSERT(chain->bref.type == HAMMER2_BREF_TYPE_INODE);
198 switch(chain->data->ipdata.type) {
199 case HAMMER2_OBJTYPE_UNKNOWN:
201 case HAMMER2_OBJTYPE_DIRECTORY:
203 case HAMMER2_OBJTYPE_REGFILE:
205 case HAMMER2_OBJTYPE_FIFO:
207 case HAMMER2_OBJTYPE_CDEV: /* not supported */
209 case HAMMER2_OBJTYPE_BDEV: /* not supported */
211 case HAMMER2_OBJTYPE_SOFTLINK:
213 case HAMMER2_OBJTYPE_HARDLINK: /* XXX */
215 case HAMMER2_OBJTYPE_SOCKET:
217 case HAMMER2_OBJTYPE_WHITEOUT: /* not supported */
226 hammer2_get_obj_type(enum vtype vtype)
230 return(HAMMER2_OBJTYPE_DIRECTORY);
232 return(HAMMER2_OBJTYPE_REGFILE);
234 return(HAMMER2_OBJTYPE_FIFO);
236 return(HAMMER2_OBJTYPE_SOCKET);
238 return(HAMMER2_OBJTYPE_CDEV);
240 return(HAMMER2_OBJTYPE_BDEV);
242 return(HAMMER2_OBJTYPE_SOFTLINK);
244 return(HAMMER2_OBJTYPE_UNKNOWN);
250 * Convert a hammer2 64-bit time to a timespec.
253 hammer2_time_to_timespec(u_int64_t xtime, struct timespec *ts)
255 ts->tv_sec = (unsigned long)(xtime / 1000000);
256 ts->tv_nsec = (unsigned int)(xtime % 1000000) * 1000L;
260 hammer2_timespec_to_time(struct timespec *ts)
264 xtime = (unsigned)(ts->tv_nsec / 1000) +
265 (unsigned long)ts->tv_sec * 1000000ULL;
270 * Convert a uuid to a unix uid or gid
273 hammer2_to_unix_xid(uuid_t *uuid)
275 return(*(u_int32_t *)&uuid->node[2]);
279 hammer2_guid_to_uuid(uuid_t *uuid, u_int32_t guid)
281 bzero(uuid, sizeof(*uuid));
282 *(u_int32_t *)&uuid->node[2] = guid;
286 * Borrow HAMMER1's directory hash algorithm #1 with a few modifications.
287 * The filename is split into fields which are hashed separately and then
290 * Differences include: bit 63 must be set to 1 for HAMMER2 (HAMMER1 sets
291 * it to 0), this is because bit63=0 is used for hidden hardlinked inodes.
292 * (This means we do not need to do a 0-check/or-with-0x100000000 either).
294 * Also, the iscsi crc code is used instead of the old crc32 code.
297 hammer2_dirhash(const unsigned char *name, size_t len)
299 const unsigned char *aname = name;
311 for (i = j = 0; i < len; ++i) {
312 if (aname[i] == '.' ||
317 crcx += hammer2_icrc32(aname + j, i - j);
322 crcx += hammer2_icrc32(aname + j, i - j);
325 * The directory hash utilizes the top 32 bits of the 64-bit key.
326 * Bit 63 must be set to 1.
329 key |= (uint64_t)crcx << 32;
332 * l16 - crc of entire filename
334 * This crc reduces degenerate hash collision conditions
336 crcx = hammer2_icrc32(aname, len);
337 crcx = crcx ^ (crcx << 16);
338 key |= crcx & 0xFFFF0000U;
341 * Set bit 15. This allows readdir to strip bit 63 so a positive
342 * 64-bit cookie/offset can always be returned, and still guarantee
343 * that the values 0x0000-0x7FFF are available for artificial entries.
352 * Return the power-of-2 radix greater or equal to
353 * the specified number of bytes.
355 * Always returns at least the minimum media allocation
356 * size radix, HAMMER2_MIN_RADIX (10), which is 1KB.
359 hammer2_allocsize(size_t bytes)
363 if (bytes < HAMMER2_MIN_ALLOC)
364 bytes = HAMMER2_MIN_ALLOC;
365 if (bytes == HAMMER2_PBUFSIZE)
366 radix = HAMMER2_PBUFRADIX;
367 else if (bytes >= 16384)
369 else if (bytes >= 1024)
372 radix = HAMMER2_MIN_RADIX;
374 while (((size_t)1 << radix) < bytes)
380 * ip must be locked sh/ex
383 hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
384 hammer2_key_t *lbasep, hammer2_key_t *leofp)
386 hammer2_inode_data_t *ipdata = &ip->chain->data->ipdata;
389 *lbasep = uoff & ~HAMMER2_PBUFMASK64;
390 *leofp = ipdata->size & ~HAMMER2_PBUFMASK64;
391 KKASSERT(*lbasep <= *leofp);
392 if (*lbasep == *leofp /*&& *leofp < 1024 * 1024*/) {
393 radix = hammer2_allocsize((size_t)(ipdata->size - *leofp));
394 if (radix < HAMMER2_MINALLOCRADIX)
395 radix = HAMMER2_MINALLOCRADIX;
396 *leofp += 1U << radix;
397 return (1U << radix);
399 return (HAMMER2_PBUFSIZE);
404 hammer2_update_time(uint64_t *timep)
409 *timep = (unsigned long)tv.tv_sec * 1000000 + tv.tv_usec;