2 * Copyright (c) 2011-2014 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>
49 hammer2_dev_exlock(hammer2_dev_t *hmp)
51 hammer2_mtx_ex(&hmp->vchain.lock);
55 hammer2_dev_shlock(hammer2_dev_t *hmp)
57 hammer2_mtx_sh(&hmp->vchain.lock);
61 hammer2_dev_unlock(hammer2_dev_t *hmp)
63 hammer2_mtx_unlock(&hmp->vchain.lock);
67 * Return the directory entry type for an inode.
69 * ip must be locked sh/ex.
72 hammer2_get_dtype(uint8_t type)
75 case HAMMER2_OBJTYPE_UNKNOWN:
77 case HAMMER2_OBJTYPE_DIRECTORY:
79 case HAMMER2_OBJTYPE_REGFILE:
81 case HAMMER2_OBJTYPE_FIFO:
83 case HAMMER2_OBJTYPE_CDEV: /* not supported */
85 case HAMMER2_OBJTYPE_BDEV: /* not supported */
87 case HAMMER2_OBJTYPE_SOFTLINK:
89 case HAMMER2_OBJTYPE_SOCKET:
91 case HAMMER2_OBJTYPE_WHITEOUT: /* not supported */
100 * Return the directory entry type for an inode
103 hammer2_get_vtype(uint8_t type)
106 case HAMMER2_OBJTYPE_UNKNOWN:
108 case HAMMER2_OBJTYPE_DIRECTORY:
110 case HAMMER2_OBJTYPE_REGFILE:
112 case HAMMER2_OBJTYPE_FIFO:
114 case HAMMER2_OBJTYPE_CDEV: /* not supported */
116 case HAMMER2_OBJTYPE_BDEV: /* not supported */
118 case HAMMER2_OBJTYPE_SOFTLINK:
120 case HAMMER2_OBJTYPE_SOCKET:
122 case HAMMER2_OBJTYPE_WHITEOUT: /* not supported */
131 hammer2_get_obj_type(enum vtype vtype)
135 return(HAMMER2_OBJTYPE_DIRECTORY);
137 return(HAMMER2_OBJTYPE_REGFILE);
139 return(HAMMER2_OBJTYPE_FIFO);
141 return(HAMMER2_OBJTYPE_SOCKET);
143 return(HAMMER2_OBJTYPE_CDEV);
145 return(HAMMER2_OBJTYPE_BDEV);
147 return(HAMMER2_OBJTYPE_SOFTLINK);
149 return(HAMMER2_OBJTYPE_UNKNOWN);
155 * Convert a hammer2 64-bit time to a timespec.
158 hammer2_time_to_timespec(uint64_t xtime, struct timespec *ts)
160 ts->tv_sec = (unsigned long)(xtime / 1000000);
161 ts->tv_nsec = (unsigned int)(xtime % 1000000) * 1000L;
165 hammer2_timespec_to_time(const struct timespec *ts)
169 xtime = (unsigned)(ts->tv_nsec / 1000) +
170 (unsigned long)ts->tv_sec * 1000000ULL;
175 * Convert a uuid to a unix uid or gid
178 hammer2_to_unix_xid(const uuid_t *uuid)
180 return(*(const uint32_t *)&uuid->node[2]);
184 hammer2_guid_to_uuid(uuid_t *uuid, uint32_t guid)
186 bzero(uuid, sizeof(*uuid));
187 *(uint32_t *)&uuid->node[2] = guid;
191 * Borrow HAMMER1's directory hash algorithm #1 with a few modifications.
192 * The filename is split into fields which are hashed separately and then
195 * Differences include: bit 63 must be set to 1 for HAMMER2 (HAMMER1 sets
196 * it to 0), this is because bit63=0 is used for hidden hardlinked inodes.
197 * (This means we do not need to do a 0-check/or-with-0x100000000 either).
199 * Also, the iscsi crc code is used instead of the old crc32 code.
202 hammer2_dirhash(const unsigned char *name, size_t len)
204 const unsigned char *aname = name;
216 for (i = j = 0; i < len; ++i) {
217 if (aname[i] == '.' ||
222 crcx += hammer2_icrc32(aname + j, i - j);
227 crcx += hammer2_icrc32(aname + j, i - j);
230 * The directory hash utilizes the top 32 bits of the 64-bit key.
231 * Bit 63 must be set to 1.
234 key |= (uint64_t)crcx << 32;
237 * l16 - crc of entire filename
239 * This crc reduces degenerate hash collision conditions
241 crcx = hammer2_icrc32(aname, len);
242 crcx = crcx ^ (crcx << 16);
243 key |= crcx & 0xFFFF0000U;
246 * Set bit 15. This allows readdir to strip bit 63 so a positive
247 * 64-bit cookie/offset can always be returned, and still guarantee
248 * that the values 0x0000-0x7FFF are available for artificial entries.
258 * Return the power-of-2 radix greater or equal to
259 * the specified number of bytes.
261 * Always returns at least the minimum media allocation
262 * size radix, HAMMER2_RADIX_MIN (10), which is 1KB.
265 hammer2_allocsize(size_t bytes)
269 if (bytes < HAMMER2_ALLOC_MIN)
270 bytes = HAMMER2_ALLOC_MIN;
271 if (bytes == HAMMER2_PBUFSIZE)
272 radix = HAMMER2_PBUFRADIX;
273 else if (bytes >= 16384)
275 else if (bytes >= 1024)
278 radix = HAMMER2_RADIX_MIN;
280 while (((size_t)1 << radix) < bytes)
288 * Convert bytes to radix with no limitations.
290 * 0 bytes is special-cased to a radix of zero (which would normally
291 * translate to (1 << 0) == 1).
294 hammer2_getradix(size_t bytes)
299 * Optimize the iteration by pre-checking commonly used radii.
301 if (bytes == HAMMER2_PBUFSIZE)
302 radix = HAMMER2_PBUFRADIX;
303 else if (bytes >= HAMMER2_LBUFSIZE)
304 radix = HAMMER2_LBUFRADIX;
305 else if (bytes >= HAMMER2_ALLOC_MIN) /* clamp */
306 radix = HAMMER2_RADIX_MIN;
311 * Iterate as needed. Note that bytes == 0 is expected to return
312 * a radix of 0 as a special case.
314 while (((size_t)1 << radix) < bytes)
320 * The logical block size is currently always PBUFSIZE.
323 hammer2_calc_logical(hammer2_inode_t *ip, hammer2_off_t uoff,
324 hammer2_key_t *lbasep, hammer2_key_t *leofp)
326 KKASSERT(ip->flags & HAMMER2_INODE_METAGOOD);
328 *lbasep = uoff & ~HAMMER2_PBUFMASK64;
330 *leofp = (ip->meta.size + HAMMER2_PBUFMASK64) &
333 return (HAMMER2_PBUFSIZE);
337 * Calculate the physical block size. pblksize <= lblksize. Primarily
338 * used to calculate a smaller physical block for the logical block
339 * containing the file EOF.
341 * Returns 0 if the requested base offset is beyond the file EOF.
344 hammer2_calc_physical(hammer2_inode_t *ip, hammer2_key_t lbase)
350 KKASSERT(ip->flags & HAMMER2_INODE_METAGOOD);
351 lblksize = hammer2_calc_logical(ip, lbase, NULL, NULL);
352 if (lbase + lblksize <= ip->meta.size)
354 if (lbase >= ip->meta.size)
356 eofbytes = (int)(ip->meta.size - lbase);
358 while (pblksize >= eofbytes && pblksize >= HAMMER2_ALLOC_MIN)
366 hammer2_update_time(uint64_t *timep)
371 *timep = (unsigned long)tv.tv_sec * 1000000 + tv.tv_usec;
375 hammer2_adjreadcounter(hammer2_blockref_t *bref, size_t bytes)
380 case HAMMER2_BREF_TYPE_DATA:
381 counterp = &hammer2_iod_file_read;
383 case HAMMER2_BREF_TYPE_DIRENT:
384 case HAMMER2_BREF_TYPE_INODE:
385 counterp = &hammer2_iod_meta_read;
387 case HAMMER2_BREF_TYPE_INDIRECT:
388 counterp = &hammer2_iod_indr_read;
390 case HAMMER2_BREF_TYPE_FREEMAP_NODE:
391 case HAMMER2_BREF_TYPE_FREEMAP_LEAF:
392 counterp = &hammer2_iod_fmap_read;
395 counterp = &hammer2_iod_volu_read;
402 * Check for pending signal to allow interruption. This function will
403 * return immediately if the calling thread is a kernel thread and not
407 hammer2_signal_check(time_t *timep)
409 thread_t td = curthread;
414 if (*timep != time_second) {
415 *timep = time_second;
416 if (CURSIG_NOBLOCK(curthread->td_lwp) != 0)
417 error = HAMMER2_ERROR_ABORTED;
426 hammer2_error_str(int error)
428 if (error & HAMMER2_ERROR_EIO)
430 if (error & HAMMER2_ERROR_CHECK)
431 return("Check Error");
432 if (error & HAMMER2_ERROR_INCOMPLETE)
433 return("Cluster Quorum Error");
434 if (error & HAMMER2_ERROR_DEPTH)
435 return("Chain Depth Error");
436 if (error & HAMMER2_ERROR_BADBREF)
437 return("Bad Blockref Error");
438 if (error & HAMMER2_ERROR_ENOSPC)
439 return("No Space on Device");
440 if (error & HAMMER2_ERROR_ENOENT)
441 return("Entry Not Found");
442 if (error & HAMMER2_ERROR_ENOTEMPTY)
443 return("Directory Not Empty");
444 if (error & HAMMER2_ERROR_EAGAIN)
446 if (error & HAMMER2_ERROR_ENOTDIR)
447 return("Not a Directory");
448 if (error & HAMMER2_ERROR_EISDIR)
449 return("Is a Directory");
450 if (error & HAMMER2_ERROR_EINPROGRESS)
451 return("Operation in Progress");
452 if (error & HAMMER2_ERROR_ABORTED)
453 return("Operation Aborted");
454 if (error & HAMMER2_ERROR_EOF)
455 return("Operation Complete");
456 if (error & HAMMER2_ERROR_EINVAL)
457 return("Invalid Operation");
458 if (error & HAMMER2_ERROR_EEXIST)
459 return("Object Exists");
460 if (error & HAMMER2_ERROR_EDEADLK)
461 return("Deadlock Detected");
462 if (error & HAMMER2_ERROR_ESRCH)
463 return("Object Not Found");
464 if (error & HAMMER2_ERROR_ETIMEDOUT)
466 return("Unknown Error");