2 * Copyright (c) 2011-2018 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>
7 * by Daniel Flores (GSOC 2013 - mentored by Matthew Dillon, compression)
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
19 * 3. Neither the name of The DragonFly Project nor the names of its
20 * contributors may be used to endorse or promote products derived
21 * from this software without specific, prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
26 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
27 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
28 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
29 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
30 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
31 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
32 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
33 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * This module handles low level logical file I/O (strategy) which backs
38 * the logical buffer cache.
40 * [De]compression, zero-block, check codes, and buffer cache operations
41 * for file data is handled here.
43 * Live dedup makes its home here as well.
46 #include <sys/param.h>
47 #include <sys/systm.h>
48 #include <sys/kernel.h>
49 #include <sys/fcntl.h>
52 #include <sys/namei.h>
53 #include <sys/mount.h>
54 #include <sys/vnode.h>
55 #include <sys/mountctl.h>
56 #include <sys/dirent.h>
58 #include <sys/objcache.h>
59 #include <sys/event.h>
61 #include <vfs/fifofs/fifo.h>
64 #include "hammer2_lz4.h"
66 #include "zlib/hammer2_zlib.h"
68 struct objcache *cache_buffer_read;
69 struct objcache *cache_buffer_write;
72 * Strategy code (async logical file buffer I/O from system)
74 * Except for the transaction init (which should normally not block),
75 * we essentially run the strategy operation asynchronously via a XOP.
77 * WARNING! The XOP deals with buffer synchronization. It is not synchronized
80 * XXX This isn't supposed to be able to deadlock against vfs_sync vfsync()
81 * calls but it has in the past when multiple flushes are queued.
83 * XXX We currently terminate the transaction once we get a quorum, otherwise
84 * the frontend can stall, but this can leave the remaining nodes with
85 * a potential flush conflict. We need to delay flushes on those nodes
86 * until running transactions complete separately from the normal
87 * transaction sequencing. FIXME TODO.
89 static int hammer2_strategy_read(struct vop_strategy_args *ap);
90 static int hammer2_strategy_write(struct vop_strategy_args *ap);
91 static void hammer2_strategy_read_completion(hammer2_chain_t *focus,
92 const char *data, struct bio *bio);
94 static hammer2_off_t hammer2_dedup_lookup(hammer2_dev_t *hmp,
95 char **datap, int pblksize);
98 hammer2_vop_strategy(struct vop_strategy_args *ap)
109 error = hammer2_strategy_read(ap);
110 ++hammer2_iod_file_read;
113 error = hammer2_strategy_write(ap);
114 ++hammer2_iod_file_write;
117 bp->b_error = error = EINVAL;
118 bp->b_flags |= B_ERROR;
126 * Return the largest contiguous physical disk range for the logical
129 * (struct vnode *vp, off_t loffset, off_t *doffsetp, int *runp, int *runb)
131 * Basically disabled, the logical buffer write thread has to deal with
132 * buffers one-at-a-time. Note that this should not prevent cluster_read()
133 * from reading-ahead, it simply prevents it from trying form a single
134 * cluster buffer for the logical request. H2 already uses 64KB buffers!
137 hammer2_vop_bmap(struct vop_bmap_args *ap)
139 *ap->a_doffsetp = NOOFFSET;
147 /****************************************************************************
149 ****************************************************************************/
151 * Callback used in read path in case that a block is compressed with LZ4.
155 hammer2_decompress_LZ4_callback(const char *data, u_int bytes, struct bio *bio)
158 char *compressed_buffer;
165 if bio->bio_caller_info2.index &&
166 bio->bio_caller_info1.uvalue32 !=
167 crc32(bp->b_data, bp->b_bufsize) --- return error
170 KKASSERT(bp->b_bufsize <= HAMMER2_PBUFSIZE);
171 compressed_size = *(const int *)data;
172 KKASSERT((uint32_t)compressed_size <= bytes - sizeof(int));
174 compressed_buffer = objcache_get(cache_buffer_read, M_INTWAIT);
175 result = LZ4_decompress_safe(__DECONST(char *, &data[sizeof(int)]),
180 kprintf("READ PATH: Error during decompression."
182 (intmax_t)bio->bio_offset, bytes);
183 /* make sure it isn't random garbage */
184 bzero(compressed_buffer, bp->b_bufsize);
186 KKASSERT(result <= bp->b_bufsize);
187 bcopy(compressed_buffer, bp->b_data, bp->b_bufsize);
188 if (result < bp->b_bufsize)
189 bzero(bp->b_data + result, bp->b_bufsize - result);
190 objcache_put(cache_buffer_read, compressed_buffer);
192 bp->b_flags |= B_AGE;
196 * Callback used in read path in case that a block is compressed with ZLIB.
197 * It is almost identical to LZ4 callback, so in theory they can be unified,
198 * but we didn't want to make changes in bio structure for that.
202 hammer2_decompress_ZLIB_callback(const char *data, u_int bytes, struct bio *bio)
205 char *compressed_buffer;
206 z_stream strm_decompress;
212 KKASSERT(bp->b_bufsize <= HAMMER2_PBUFSIZE);
213 strm_decompress.avail_in = 0;
214 strm_decompress.next_in = Z_NULL;
216 ret = inflateInit(&strm_decompress);
219 kprintf("HAMMER2 ZLIB: Fatal error in inflateInit.\n");
221 compressed_buffer = objcache_get(cache_buffer_read, M_INTWAIT);
222 strm_decompress.next_in = __DECONST(char *, data);
224 /* XXX supply proper size, subset of device bp */
225 strm_decompress.avail_in = bytes;
226 strm_decompress.next_out = compressed_buffer;
227 strm_decompress.avail_out = bp->b_bufsize;
229 ret = inflate(&strm_decompress, Z_FINISH);
230 if (ret != Z_STREAM_END) {
231 kprintf("HAMMER2 ZLIB: Fatar error during decompression.\n");
232 bzero(compressed_buffer, bp->b_bufsize);
234 bcopy(compressed_buffer, bp->b_data, bp->b_bufsize);
235 result = bp->b_bufsize - strm_decompress.avail_out;
236 if (result < bp->b_bufsize)
237 bzero(bp->b_data + result, strm_decompress.avail_out);
238 objcache_put(cache_buffer_read, compressed_buffer);
239 ret = inflateEnd(&strm_decompress);
242 bp->b_flags |= B_AGE;
246 * Logical buffer I/O, async read.
250 hammer2_strategy_read(struct vop_strategy_args *ap)
252 hammer2_xop_strategy_t *xop;
260 lbase = bio->bio_offset;
261 KKASSERT(((int)lbase & HAMMER2_PBUFMASK) == 0);
263 xop = hammer2_xop_alloc(ip, HAMMER2_XOP_STRATEGY);
267 hammer2_mtx_init(&xop->lock, "h2bior");
268 hammer2_xop_start(&xop->head, &hammer2_strategy_read_desc);
269 /* asynchronous completion */
275 * Per-node XOP (threaded), do a synchronous lookup of the chain and
276 * its data. The frontend is asynchronous, so we are also responsible
277 * for racing to terminate the frontend.
280 hammer2_xop_strategy_read(hammer2_xop_t *arg, void *scratch, int clindex)
282 hammer2_xop_strategy_t *xop = &arg->xop_strategy;
283 hammer2_chain_t *parent;
284 hammer2_chain_t *chain;
285 hammer2_chain_t *focus;
286 hammer2_key_t key_dummy;
294 * Note that we can race completion of the bio supplied by
295 * the front-end so we cannot access it until we determine
296 * that we are the ones finishing it up.
301 * This is difficult to optimize. The logical buffer might be
302 * partially dirty (contain dummy zero-fill pages), which would
303 * mess up our crc calculation if we were to try a direct read.
304 * So for now we always double-buffer through the underlying
307 * If not for the above problem we could conditionalize on
308 * (1) 64KB buffer, (2) one chain (not multi-master) and
309 * (3) !hammer2_double_buffer, and issue a direct read into the
312 parent = hammer2_inode_chain(xop->head.ip1, clindex,
313 HAMMER2_RESOLVE_ALWAYS |
314 HAMMER2_RESOLVE_SHARED);
316 chain = hammer2_chain_lookup(&parent, &key_dummy,
319 HAMMER2_LOOKUP_ALWAYS |
320 HAMMER2_LOOKUP_SHARED);
322 error = chain->error;
324 error = HAMMER2_ERROR_EIO;
327 error = hammer2_xop_feed(&xop->head, chain, clindex, error);
329 hammer2_chain_unlock(chain);
330 hammer2_chain_drop(chain);
333 hammer2_chain_unlock(parent);
334 hammer2_chain_drop(parent);
336 chain = NULL; /* safety */
337 parent = NULL; /* safety */
340 * Race to finish the frontend. First-to-complete. bio is only
341 * valid if we are determined to be the ones able to complete
346 hammer2_mtx_ex(&xop->lock);
348 hammer2_mtx_unlock(&xop->lock);
356 * Async operation has not completed and we now own the lock.
357 * Determine if we can complete the operation by issuing the
358 * frontend collection non-blocking.
360 * H2 double-buffers the data, setting B_NOTMETA on the logical
361 * buffer hints to the OS that the logical buffer should not be
362 * swapcached (since the device buffer can be).
364 * Also note that even for compressed data we would rather the
365 * kernel cache/swapcache device buffers more and (decompressed)
366 * logical buffers less, since that will significantly improve
367 * the amount of end-user data that can be cached.
369 * NOTE: The chain->data for xop->head.cluster.focus will be
370 * synchronized to the current cpu by xop_collect(),
371 * but other chains in the cluster might not be.
373 error = hammer2_xop_collect(&xop->head, HAMMER2_XOP_COLLECT_NOWAIT);
378 hammer2_mtx_unlock(&xop->lock);
379 bp->b_flags |= B_NOTMETA;
380 focus = xop->head.cluster.focus;
381 data = hammer2_xop_gdata(&xop->head)->buf;
382 hammer2_strategy_read_completion(focus, data, xop->bio);
383 hammer2_xop_pdata(&xop->head);
385 hammer2_xop_retire(&xop->head, HAMMER2_XOPMASK_VOP);
387 case HAMMER2_ERROR_ENOENT:
389 hammer2_mtx_unlock(&xop->lock);
390 bp->b_flags |= B_NOTMETA;
393 bzero(bp->b_data, bp->b_bcount);
395 hammer2_xop_retire(&xop->head, HAMMER2_XOPMASK_VOP);
397 case HAMMER2_ERROR_EINPROGRESS:
398 hammer2_mtx_unlock(&xop->lock);
401 kprintf("xop_strategy_read: error %08x loff=%016jx\n",
402 error, bp->b_loffset);
404 hammer2_mtx_unlock(&xop->lock);
405 bp->b_flags |= B_ERROR;
408 hammer2_xop_retire(&xop->head, HAMMER2_XOPMASK_VOP);
415 hammer2_strategy_read_completion(hammer2_chain_t *focus, const char *data,
418 struct buf *bp = bio->bio_buf;
420 if (focus->bref.type == HAMMER2_BREF_TYPE_INODE) {
422 * Copy from in-memory inode structure.
424 bcopy(((const hammer2_inode_data_t *)data)->u.data,
425 bp->b_data, HAMMER2_EMBEDDED_BYTES);
426 bzero(bp->b_data + HAMMER2_EMBEDDED_BYTES,
427 bp->b_bcount - HAMMER2_EMBEDDED_BYTES);
430 } else if (focus->bref.type == HAMMER2_BREF_TYPE_DATA) {
432 * Data is on-media, record for live dedup. Release the
433 * chain (try to free it) when done. The data is still
434 * cached by both the buffer cache in front and the
435 * block device behind us. This leaves more room in the
436 * LRU chain cache for meta-data chains which we really
439 * NOTE: Deduplication cannot be safely recorded for
440 * records without a check code.
442 hammer2_dedup_record(focus, NULL, data);
443 atomic_set_int(&focus->flags, HAMMER2_CHAIN_RELEASE);
446 * Decompression and copy.
448 switch (HAMMER2_DEC_COMP(focus->bref.methods)) {
449 case HAMMER2_COMP_LZ4:
450 hammer2_decompress_LZ4_callback(data, focus->bytes,
452 /* b_resid set by call */
454 case HAMMER2_COMP_ZLIB:
455 hammer2_decompress_ZLIB_callback(data, focus->bytes,
457 /* b_resid set by call */
459 case HAMMER2_COMP_NONE:
460 KKASSERT(focus->bytes <= bp->b_bcount);
461 bcopy(data, bp->b_data, focus->bytes);
462 if (focus->bytes < bp->b_bcount) {
463 bzero(bp->b_data + focus->bytes,
464 bp->b_bcount - focus->bytes);
470 panic("hammer2_strategy_read_completion: "
471 "unknown compression type");
474 panic("hammer2_strategy_read_completion: unknown bref type");
478 /****************************************************************************
480 ****************************************************************************/
483 * Functions for compression in threads,
484 * from hammer2_vnops.c
486 static void hammer2_write_file_core(char *data, hammer2_inode_t *ip,
487 hammer2_chain_t **parentp,
488 hammer2_key_t lbase, int ioflag, int pblksize,
489 hammer2_tid_t mtid, int *errorp);
490 static void hammer2_compress_and_write(char *data, hammer2_inode_t *ip,
491 hammer2_chain_t **parentp,
492 hammer2_key_t lbase, int ioflag, int pblksize,
493 hammer2_tid_t mtid, int *errorp,
494 int comp_algo, int check_algo);
495 static void hammer2_zero_check_and_write(char *data, hammer2_inode_t *ip,
496 hammer2_chain_t **parentp,
497 hammer2_key_t lbase, int ioflag, int pblksize,
498 hammer2_tid_t mtid, int *errorp,
500 static int test_block_zeros(const char *buf, size_t bytes);
501 static void zero_write(char *data, hammer2_inode_t *ip,
502 hammer2_chain_t **parentp,
504 hammer2_tid_t mtid, int *errorp);
505 static void hammer2_write_bp(hammer2_chain_t *chain, char *data,
506 int ioflag, int pblksize,
507 hammer2_tid_t mtid, int *errorp,
511 hammer2_strategy_write(struct vop_strategy_args *ap)
513 hammer2_xop_strategy_t *xop;
522 atomic_set_int(&ip->flags, HAMMER2_INODE_DIRTYDATA);
523 hammer2_lwinprog_ref(pmp);
524 hammer2_trans_assert_strategy(pmp);
525 hammer2_trans_init(pmp, HAMMER2_TRANS_BUFCACHE);
527 xop = hammer2_xop_alloc(ip, HAMMER2_XOP_MODIFYING |
528 HAMMER2_XOP_STRATEGY);
531 xop->lbase = bio->bio_offset;
532 hammer2_mtx_init(&xop->lock, "h2biow");
533 hammer2_xop_start(&xop->head, &hammer2_strategy_write_desc);
534 /* asynchronous completion */
536 hammer2_lwinprog_wait(pmp, hammer2_flush_pipe);
542 * Per-node XOP (threaded). Write the logical buffer to the media.
544 * This is a bit problematic because there may be multiple target and
545 * any of them may be able to release the bp. In addition, if our
546 * particulr target is offline we don't want to block the bp (and thus
547 * the frontend). To accomplish this we copy the data to the per-thr
551 hammer2_xop_strategy_write(hammer2_xop_t *arg, void *scratch, int clindex)
553 hammer2_xop_strategy_t *xop = &arg->xop_strategy;
554 hammer2_chain_t *parent;
562 hammer2_off_t bio_offset;
566 * We can only access the bp/bio if the frontend has not yet
571 hammer2_mtx_sh(&xop->lock);
573 hammer2_mtx_unlock(&xop->lock);
578 bio = xop->bio; /* ephermal */
579 bp = bio->bio_buf; /* ephermal */
580 ip = xop->head.ip1; /* retained by ref */
581 bio_offset = bio->bio_offset;
584 /* hammer2_trans_init(parent->hmp->spmp, HAMMER2_TRANS_BUFCACHE); */
586 lblksize = hammer2_calc_logical(ip, bio->bio_offset, &lbase, NULL);
587 pblksize = hammer2_calc_physical(ip, lbase);
589 KKASSERT(lblksize <= MAXPHYS);
590 bcopy(bp->b_data, bio_data, lblksize);
592 hammer2_mtx_unlock(&xop->lock);
593 bp = NULL; /* safety, illegal to access after unlock */
594 bio = NULL; /* safety, illegal to access after unlock */
599 parent = hammer2_inode_chain(ip, clindex, HAMMER2_RESOLVE_ALWAYS);
600 hammer2_write_file_core(bio_data, ip, &parent,
601 lbase, IO_ASYNC, pblksize,
602 xop->head.mtid, &error);
604 hammer2_chain_unlock(parent);
605 hammer2_chain_drop(parent);
606 parent = NULL; /* safety */
608 hammer2_xop_feed(&xop->head, NULL, clindex, error);
611 * Try to complete the operation on behalf of the front-end.
615 hammer2_mtx_ex(&xop->lock);
617 hammer2_mtx_unlock(&xop->lock);
622 * Async operation has not completed and we now own the lock.
623 * Determine if we can complete the operation by issuing the
624 * frontend collection non-blocking.
626 * H2 double-buffers the data, setting B_NOTMETA on the logical
627 * buffer hints to the OS that the logical buffer should not be
628 * swapcached (since the device buffer can be).
630 error = hammer2_xop_collect(&xop->head, HAMMER2_XOP_COLLECT_NOWAIT);
632 if (error == HAMMER2_ERROR_EINPROGRESS) {
633 hammer2_mtx_unlock(&xop->lock);
638 * Async operation has completed.
641 hammer2_mtx_unlock(&xop->lock);
643 bio = xop->bio; /* now owned by us */
644 bp = bio->bio_buf; /* now owned by us */
646 if (error == HAMMER2_ERROR_ENOENT || error == 0) {
647 bp->b_flags |= B_NOTMETA;
652 kprintf("xop_strategy_write: error %d loff=%016jx\n",
653 error, bp->b_loffset);
654 bp->b_flags |= B_ERROR;
658 hammer2_xop_retire(&xop->head, HAMMER2_XOPMASK_VOP);
659 hammer2_trans_assert_strategy(ip->pmp);
660 hammer2_lwinprog_drop(ip->pmp);
661 hammer2_trans_done(ip->pmp, HAMMER2_TRANS_BUFCACHE);
665 * Wait for pending I/O to complete
668 hammer2_bioq_sync(hammer2_pfs_t *pmp)
670 hammer2_lwinprog_wait(pmp, 0);
674 * Assign physical storage at (cparent, lbase), returning a suitable chain
675 * and setting *errorp appropriately.
677 * If no error occurs, the returned chain will be in a modified state.
679 * If an error occurs, the returned chain may or may not be NULL. If
680 * not-null any chain->error (if not 0) will also be rolled up into *errorp.
681 * So the caller only needs to test *errorp.
683 * cparent can wind up being anything.
685 * If datap is not NULL, *datap points to the real data we intend to write.
686 * If we can dedup the storage location we set *datap to NULL to indicate
687 * to the caller that a dedup occurred.
689 * NOTE: Special case for data embedded in inode.
693 hammer2_assign_physical(hammer2_inode_t *ip, hammer2_chain_t **parentp,
694 hammer2_key_t lbase, int pblksize,
695 hammer2_tid_t mtid, char **datap, int *errorp)
697 hammer2_chain_t *chain;
698 hammer2_key_t key_dummy;
699 hammer2_off_t dedup_off;
700 int pradix = hammer2_getradix(pblksize);
703 * Locate the chain associated with lbase, return a locked chain.
704 * However, do not instantiate any data reference (which utilizes a
705 * device buffer) because we will be using direct IO via the
706 * logical buffer cache buffer.
708 KKASSERT(pblksize >= HAMMER2_ALLOC_MIN);
710 chain = hammer2_chain_lookup(parentp, &key_dummy,
713 HAMMER2_LOOKUP_NODATA);
716 * The lookup code should not return a DELETED chain to us, unless
717 * its a short-file embedded in the inode. Then it is possible for
718 * the lookup to return a deleted inode.
720 if (chain && (chain->flags & HAMMER2_CHAIN_DELETED) &&
721 chain->bref.type != HAMMER2_BREF_TYPE_INODE) {
722 kprintf("assign physical deleted chain @ "
723 "%016jx (%016jx.%02x) ip %016jx\n",
724 lbase, chain->bref.data_off, chain->bref.type,
731 * We found a hole, create a new chain entry.
733 * NOTE: DATA chains are created without device backing
734 * store (nor do we want any).
736 dedup_off = hammer2_dedup_lookup((*parentp)->hmp, datap,
738 *errorp |= hammer2_chain_create(parentp, &chain, NULL, ip->pmp,
739 HAMMER2_ENC_CHECK(ip->meta.check_algo) |
740 HAMMER2_ENC_COMP(HAMMER2_COMP_NONE),
741 lbase, HAMMER2_PBUFRADIX,
742 HAMMER2_BREF_TYPE_DATA,
747 /*ip->delta_dcount += pblksize;*/
748 } else if (chain->error == 0) {
749 switch (chain->bref.type) {
750 case HAMMER2_BREF_TYPE_INODE:
752 * The data is embedded in the inode, which requires
755 *errorp |= hammer2_chain_modify_ip(ip, chain, mtid, 0);
757 case HAMMER2_BREF_TYPE_DATA:
758 dedup_off = hammer2_dedup_lookup(chain->hmp, datap,
760 if (chain->bytes != pblksize) {
761 *errorp |= hammer2_chain_resize(chain,
764 HAMMER2_MODIFY_OPTDATA);
770 * DATA buffers must be marked modified whether the
771 * data is in a logical buffer or not. We also have
772 * to make this call to fixup the chain data pointers
773 * after resizing in case this is an encrypted or
776 *errorp |= hammer2_chain_modify(chain, mtid, dedup_off,
777 HAMMER2_MODIFY_OPTDATA);
780 panic("hammer2_assign_physical: bad type");
785 *errorp = chain->error;
787 atomic_set_int(&ip->flags, HAMMER2_INODE_DIRTYDATA);
793 * hammer2_write_file_core() - hammer2_write_thread() helper
795 * The core write function which determines which path to take
796 * depending on compression settings. We also have to locate the
797 * related chains so we can calculate and set the check data for
802 hammer2_write_file_core(char *data, hammer2_inode_t *ip,
803 hammer2_chain_t **parentp,
804 hammer2_key_t lbase, int ioflag, int pblksize,
805 hammer2_tid_t mtid, int *errorp)
807 hammer2_chain_t *chain;
812 switch(HAMMER2_DEC_ALGO(ip->meta.comp_algo)) {
813 case HAMMER2_COMP_NONE:
815 * We have to assign physical storage to the buffer
816 * we intend to dirty or write now to avoid deadlocks
817 * in the strategy code later.
819 * This can return NOOFFSET for inode-embedded data.
820 * The strategy code will take care of it in that case.
823 chain = hammer2_assign_physical(ip, parentp, lbase, pblksize,
824 mtid, &bdata, errorp);
826 /* skip modifications */
827 } else if (chain->bref.type == HAMMER2_BREF_TYPE_INODE) {
828 hammer2_inode_data_t *wipdata;
830 wipdata = &chain->data->ipdata;
831 KKASSERT(wipdata->meta.op_flags &
832 HAMMER2_OPFLAG_DIRECTDATA);
833 bcopy(data, wipdata->u.data, HAMMER2_EMBEDDED_BYTES);
834 ++hammer2_iod_file_wembed;
835 } else if (bdata == NULL) {
837 * Copy of data already present on-media.
839 chain->bref.methods =
840 HAMMER2_ENC_COMP(HAMMER2_COMP_NONE) +
841 HAMMER2_ENC_CHECK(ip->meta.check_algo);
842 hammer2_chain_setcheck(chain, data);
844 hammer2_write_bp(chain, data, ioflag, pblksize,
845 mtid, errorp, ip->meta.check_algo);
848 hammer2_chain_unlock(chain);
849 hammer2_chain_drop(chain);
852 case HAMMER2_COMP_AUTOZERO:
854 * Check for zero-fill only
856 hammer2_zero_check_and_write(data, ip, parentp,
857 lbase, ioflag, pblksize,
859 ip->meta.check_algo);
861 case HAMMER2_COMP_LZ4:
862 case HAMMER2_COMP_ZLIB:
865 * Check for zero-fill and attempt compression.
867 hammer2_compress_and_write(data, ip, parentp,
868 lbase, ioflag, pblksize,
871 ip->meta.check_algo);
879 * Generic function that will perform the compression in compression
880 * write path. The compression algorithm is determined by the settings
881 * obtained from inode.
885 hammer2_compress_and_write(char *data, hammer2_inode_t *ip,
886 hammer2_chain_t **parentp,
887 hammer2_key_t lbase, int ioflag, int pblksize,
888 hammer2_tid_t mtid, int *errorp, int comp_algo, int check_algo)
890 hammer2_chain_t *chain;
897 * An all-zeros write creates a hole unless the check code
898 * is disabled. When the check code is disabled all writes
899 * are done in-place, including any all-zeros writes.
901 * NOTE: A snapshot will still force a copy-on-write
902 * (see the HAMMER2_CHECK_NONE in hammer2_chain.c).
904 if (check_algo != HAMMER2_CHECK_NONE &&
905 test_block_zeros(data, pblksize)) {
906 zero_write(data, ip, parentp, lbase, mtid, errorp);
911 * Compression requested. Try to compress the block. We store
912 * the data normally if we cannot sufficiently compress it.
914 * We have a heuristic to detect files which are mostly
915 * uncompressable and avoid the compression attempt in that
916 * case. If the compression heuristic is turned off, we always
922 KKASSERT(pblksize / 2 <= 32768);
924 if (ip->comp_heuristic < 8 || (ip->comp_heuristic & 7) == 0 ||
925 hammer2_always_compress) {
926 z_stream strm_compress;
930 switch(HAMMER2_DEC_ALGO(comp_algo)) {
931 case HAMMER2_COMP_LZ4:
933 * We need to prefix with the size, LZ4
934 * doesn't do it for us. Add the related
937 * NOTE: The LZ4 code seems to assume at least an
938 * 8-byte buffer size granularity and may
939 * overrun the buffer if given a 4-byte
942 comp_buffer = objcache_get(cache_buffer_write,
944 comp_size = LZ4_compress_limitedOutput(
946 &comp_buffer[sizeof(int)],
948 pblksize / 2 - sizeof(int64_t));
949 *(int *)comp_buffer = comp_size;
951 comp_size += sizeof(int);
953 case HAMMER2_COMP_ZLIB:
954 comp_level = HAMMER2_DEC_LEVEL(comp_algo);
956 comp_level = 6; /* default zlib compression */
957 else if (comp_level < 6)
959 else if (comp_level > 9)
961 ret = deflateInit(&strm_compress, comp_level);
963 kprintf("HAMMER2 ZLIB: fatal error "
964 "on deflateInit.\n");
967 comp_buffer = objcache_get(cache_buffer_write,
969 strm_compress.next_in = data;
970 strm_compress.avail_in = pblksize;
971 strm_compress.next_out = comp_buffer;
972 strm_compress.avail_out = pblksize / 2;
973 ret = deflate(&strm_compress, Z_FINISH);
974 if (ret == Z_STREAM_END) {
975 comp_size = pblksize / 2 -
976 strm_compress.avail_out;
980 ret = deflateEnd(&strm_compress);
983 kprintf("Error: Unknown compression method.\n");
984 kprintf("Comp_method = %d.\n", comp_algo);
989 if (comp_size == 0) {
991 * compression failed or turned off
993 comp_block_size = pblksize; /* safety */
994 if (++ip->comp_heuristic > 128)
995 ip->comp_heuristic = 8;
998 * compression succeeded
1000 ip->comp_heuristic = 0;
1001 if (comp_size <= 1024) {
1002 comp_block_size = 1024;
1003 } else if (comp_size <= 2048) {
1004 comp_block_size = 2048;
1005 } else if (comp_size <= 4096) {
1006 comp_block_size = 4096;
1007 } else if (comp_size <= 8192) {
1008 comp_block_size = 8192;
1009 } else if (comp_size <= 16384) {
1010 comp_block_size = 16384;
1011 } else if (comp_size <= 32768) {
1012 comp_block_size = 32768;
1014 panic("hammer2: WRITE PATH: "
1015 "Weird comp_size value.");
1017 comp_block_size = pblksize;
1021 * Must zero the remainder or dedup (which operates on a
1022 * physical block basis) will not find matches.
1024 if (comp_size < comp_block_size) {
1025 bzero(comp_buffer + comp_size,
1026 comp_block_size - comp_size);
1031 * Assign physical storage, data will be set to NULL if a live-dedup
1034 bdata = comp_size ? comp_buffer : data;
1035 chain = hammer2_assign_physical(ip, parentp, lbase, comp_block_size,
1036 mtid, &bdata, errorp);
1042 if (chain->bref.type == HAMMER2_BREF_TYPE_INODE) {
1043 hammer2_inode_data_t *wipdata;
1045 *errorp = hammer2_chain_modify_ip(ip, chain, mtid, 0);
1047 wipdata = &chain->data->ipdata;
1048 KKASSERT(wipdata->meta.op_flags &
1049 HAMMER2_OPFLAG_DIRECTDATA);
1050 bcopy(data, wipdata->u.data, HAMMER2_EMBEDDED_BYTES);
1051 ++hammer2_iod_file_wembed;
1053 } else if (bdata == NULL) {
1055 * Live deduplication, a copy of the data is already present
1059 chain->bref.methods =
1060 HAMMER2_ENC_COMP(comp_algo) +
1061 HAMMER2_ENC_CHECK(check_algo);
1063 chain->bref.methods =
1065 HAMMER2_COMP_NONE) +
1066 HAMMER2_ENC_CHECK(check_algo);
1068 bdata = comp_size ? comp_buffer : data;
1069 hammer2_chain_setcheck(chain, bdata);
1070 atomic_clear_int(&chain->flags, HAMMER2_CHAIN_INITIAL);
1074 KKASSERT(chain->flags & HAMMER2_CHAIN_MODIFIED);
1076 switch(chain->bref.type) {
1077 case HAMMER2_BREF_TYPE_INODE:
1078 panic("hammer2_compress_and_write: unexpected inode\n");
1080 case HAMMER2_BREF_TYPE_DATA:
1082 * Optimize out the read-before-write
1085 *errorp = hammer2_io_newnz(chain->hmp,
1087 chain->bref.data_off,
1091 hammer2_io_brelse(&dio);
1092 kprintf("hammer2: WRITE PATH: "
1093 "dbp bread error\n");
1096 bdata = hammer2_io_data(dio, chain->bref.data_off);
1099 * When loading the block make sure we don't
1100 * leave garbage after the compressed data.
1103 chain->bref.methods =
1104 HAMMER2_ENC_COMP(comp_algo) +
1105 HAMMER2_ENC_CHECK(check_algo);
1106 bcopy(comp_buffer, bdata, comp_size);
1108 chain->bref.methods =
1110 HAMMER2_COMP_NONE) +
1111 HAMMER2_ENC_CHECK(check_algo);
1112 bcopy(data, bdata, pblksize);
1116 * The flush code doesn't calculate check codes for
1117 * file data (doing so can result in excessive I/O),
1120 hammer2_chain_setcheck(chain, bdata);
1123 * Device buffer is now valid, chain is no longer in
1124 * the initial state.
1126 * (No blockref table worries with file data)
1128 atomic_clear_int(&chain->flags, HAMMER2_CHAIN_INITIAL);
1129 hammer2_dedup_record(chain, dio, bdata);
1131 /* Now write the related bdp. */
1132 if (ioflag & IO_SYNC) {
1134 * Synchronous I/O requested.
1136 hammer2_io_bwrite(&dio);
1138 } else if ((ioflag & IO_DIRECT) &&
1139 loff + n == pblksize) {
1140 hammer2_io_bdwrite(&dio);
1142 } else if (ioflag & IO_ASYNC) {
1143 hammer2_io_bawrite(&dio);
1145 hammer2_io_bdwrite(&dio);
1149 panic("hammer2_compress_and_write: bad chain type %d\n",
1157 hammer2_chain_unlock(chain);
1158 hammer2_chain_drop(chain);
1161 objcache_put(cache_buffer_write, comp_buffer);
1167 * Function that performs zero-checking and writing without compression,
1168 * it corresponds to default zero-checking path.
1172 hammer2_zero_check_and_write(char *data, hammer2_inode_t *ip,
1173 hammer2_chain_t **parentp,
1174 hammer2_key_t lbase, int ioflag, int pblksize,
1175 hammer2_tid_t mtid, int *errorp,
1178 hammer2_chain_t *chain;
1181 if (check_algo != HAMMER2_CHECK_NONE &&
1182 test_block_zeros(data, pblksize)) {
1184 * An all-zeros write creates a hole unless the check code
1185 * is disabled. When the check code is disabled all writes
1186 * are done in-place, including any all-zeros writes.
1188 * NOTE: A snapshot will still force a copy-on-write
1189 * (see the HAMMER2_CHECK_NONE in hammer2_chain.c).
1191 zero_write(data, ip, parentp, lbase, mtid, errorp);
1197 chain = hammer2_assign_physical(ip, parentp, lbase, pblksize,
1198 mtid, &bdata, errorp);
1202 hammer2_write_bp(chain, data, ioflag, pblksize,
1203 mtid, errorp, check_algo);
1205 /* dedup occurred */
1206 chain->bref.methods =
1207 HAMMER2_ENC_COMP(HAMMER2_COMP_NONE) +
1208 HAMMER2_ENC_CHECK(check_algo);
1209 hammer2_chain_setcheck(chain, data);
1212 hammer2_chain_unlock(chain);
1213 hammer2_chain_drop(chain);
1221 * A function to test whether a block of data contains only zeros,
1222 * returns TRUE (non-zero) if the block is all zeros.
1226 test_block_zeros(const char *buf, size_t bytes)
1230 for (i = 0; i < bytes; i += sizeof(long)) {
1231 if (*(const long *)(buf + i) != 0)
1240 * Function to "write" a block that contains only zeros.
1244 zero_write(char *data, hammer2_inode_t *ip,
1245 hammer2_chain_t **parentp,
1246 hammer2_key_t lbase, hammer2_tid_t mtid, int *errorp)
1248 hammer2_chain_t *chain;
1249 hammer2_key_t key_dummy;
1251 chain = hammer2_chain_lookup(parentp, &key_dummy,
1254 HAMMER2_LOOKUP_NODATA);
1256 if (chain->bref.type == HAMMER2_BREF_TYPE_INODE) {
1257 hammer2_inode_data_t *wipdata;
1260 *errorp = hammer2_chain_modify_ip(ip, chain,
1264 wipdata = &chain->data->ipdata;
1265 KKASSERT(wipdata->meta.op_flags &
1266 HAMMER2_OPFLAG_DIRECTDATA);
1267 bzero(wipdata->u.data, HAMMER2_EMBEDDED_BYTES);
1268 ++hammer2_iod_file_wembed;
1271 /* chain->error ok for deletion */
1272 hammer2_chain_delete(*parentp, chain,
1273 mtid, HAMMER2_DELETE_PERMANENT);
1274 ++hammer2_iod_file_wzero;
1276 atomic_set_int(&ip->flags, HAMMER2_INODE_DIRTYDATA);
1277 hammer2_chain_unlock(chain);
1278 hammer2_chain_drop(chain);
1280 ++hammer2_iod_file_wzero;
1287 * Function to write the data as it is, without performing any sort of
1288 * compression. This function is used in path without compression and
1289 * default zero-checking path.
1293 hammer2_write_bp(hammer2_chain_t *chain, char *data, int ioflag,
1295 hammer2_tid_t mtid, int *errorp, int check_algo)
1297 hammer2_inode_data_t *wipdata;
1302 error = 0; /* XXX TODO below */
1304 KKASSERT(chain->flags & HAMMER2_CHAIN_MODIFIED);
1306 switch(chain->bref.type) {
1307 case HAMMER2_BREF_TYPE_INODE:
1308 wipdata = &chain->data->ipdata;
1309 KKASSERT(wipdata->meta.op_flags & HAMMER2_OPFLAG_DIRECTDATA);
1310 bcopy(data, wipdata->u.data, HAMMER2_EMBEDDED_BYTES);
1312 ++hammer2_iod_file_wembed;
1314 case HAMMER2_BREF_TYPE_DATA:
1315 error = hammer2_io_newnz(chain->hmp,
1317 chain->bref.data_off,
1318 chain->bytes, &dio);
1320 hammer2_io_bqrelse(&dio);
1321 kprintf("hammer2: WRITE PATH: "
1322 "dbp bread error\n");
1325 bdata = hammer2_io_data(dio, chain->bref.data_off);
1327 chain->bref.methods = HAMMER2_ENC_COMP(HAMMER2_COMP_NONE) +
1328 HAMMER2_ENC_CHECK(check_algo);
1329 bcopy(data, bdata, chain->bytes);
1332 * The flush code doesn't calculate check codes for
1333 * file data (doing so can result in excessive I/O),
1336 hammer2_chain_setcheck(chain, bdata);
1339 * Device buffer is now valid, chain is no longer in
1340 * the initial state.
1342 * (No blockref table worries with file data)
1344 atomic_clear_int(&chain->flags, HAMMER2_CHAIN_INITIAL);
1345 hammer2_dedup_record(chain, dio, bdata);
1347 if (ioflag & IO_SYNC) {
1349 * Synchronous I/O requested.
1351 hammer2_io_bwrite(&dio);
1353 } else if ((ioflag & IO_DIRECT) &&
1354 loff + n == pblksize) {
1355 hammer2_io_bdwrite(&dio);
1357 } else if (ioflag & IO_ASYNC) {
1358 hammer2_io_bawrite(&dio);
1360 hammer2_io_bdwrite(&dio);
1364 panic("hammer2_write_bp: bad chain type %d\n",
1374 * LIVE DEDUP HEURISTICS
1376 * Record media and crc information for possible dedup operation. Note
1377 * that the dedup mask bits must also be set in the related DIO for a dedup
1378 * to be fully validated (which is handled in the freemap allocation code).
1380 * WARNING! This code is SMP safe but the heuristic allows SMP collisions.
1381 * All fields must be loaded into locals and validated.
1383 * WARNING! Should only be used for file data and directory entries,
1384 * hammer2_chain_modify() only checks for the dedup case on data
1385 * chains. Also, dedup data can only be recorded for committed
1386 * chains (so NOT strategy writes which can undergo further
1387 * modification after the fact!).
1390 hammer2_dedup_record(hammer2_chain_t *chain, hammer2_io_t *dio,
1394 hammer2_dedup_t *dedup;
1402 * We can only record a dedup if we have media data to test against.
1403 * If dedup is not enabled, return early, which allows a chain to
1404 * remain marked MODIFIED (which might have benefits in special
1405 * situations, though typically it does not).
1407 if (hammer2_dedup_enable == 0)
1417 switch(HAMMER2_DEC_CHECK(chain->bref.methods)) {
1418 case HAMMER2_CHECK_ISCSI32:
1420 * XXX use the built-in crc (the dedup lookup sequencing
1421 * needs to be fixed so the check code is already present
1422 * when dedup_lookup is called)
1425 crc = (uint64_t)(uint32_t)chain->bref.check.iscsi32.value;
1427 crc = XXH64(data, chain->bytes, XXH_HAMMER2_SEED);
1429 case HAMMER2_CHECK_XXHASH64:
1430 crc = chain->bref.check.xxhash64.value;
1432 case HAMMER2_CHECK_SHA192:
1434 * XXX use the built-in crc (the dedup lookup sequencing
1435 * needs to be fixed so the check code is already present
1436 * when dedup_lookup is called)
1439 crc = ((uint64_t *)chain->bref.check.sha192.data)[0] ^
1440 ((uint64_t *)chain->bref.check.sha192.data)[1] ^
1441 ((uint64_t *)chain->bref.check.sha192.data)[2];
1443 crc = XXH64(data, chain->bytes, XXH_HAMMER2_SEED);
1447 * Cannot dedup without a check code
1449 * NOTE: In particular, CHECK_NONE allows a sector to be
1450 * overwritten without copy-on-write, recording
1451 * a dedup block for a CHECK_NONE object would be
1457 atomic_set_int(&chain->flags, HAMMER2_CHAIN_DEDUPABLE);
1459 dedup = &hmp->heur_dedup[crc & (HAMMER2_DEDUP_HEUR_MASK & ~3)];
1460 for (i = 0; i < 4; ++i) {
1461 if (dedup[i].data_crc == crc) {
1465 dticks = (int)(dedup[i].ticks - dedup[best].ticks);
1466 if (dticks < 0 || dticks > hz * 60 * 30)
1470 if (hammer2_debug & 0x40000) {
1471 kprintf("REC %04x %016jx %016jx\n",
1472 (int)(dedup - hmp->heur_dedup),
1474 chain->bref.data_off);
1476 dedup->ticks = ticks;
1477 dedup->data_off = chain->bref.data_off;
1478 dedup->data_crc = crc;
1481 * Set the valid bits for the dedup only after we know the data
1482 * buffer has been updated. The alloc bits were set (and the valid
1483 * bits cleared) when the media was allocated.
1485 * This is done in two stages becuase the bulkfree code can race
1486 * the gap between allocation and data population. Both masks must
1487 * be set before a bcmp/dedup operation is able to use the block.
1489 mask = hammer2_dedup_mask(dio, chain->bref.data_off, chain->bytes);
1490 atomic_set_64(&dio->dedup_valid, mask);
1494 * XXX removed. MODIFIED is an integral part of the flush code,
1495 * lets not just clear it
1498 * Once we record the dedup the chain must be marked clean to
1499 * prevent reuse of the underlying block. Remember that this
1500 * write occurs when the buffer cache is flushed (i.e. on sync(),
1501 * fsync(), filesystem periodic sync, or when the kernel needs to
1502 * flush a buffer), and not whenever the user write()s.
1504 if (chain->flags & HAMMER2_CHAIN_MODIFIED) {
1505 atomic_clear_int(&chain->flags, HAMMER2_CHAIN_MODIFIED);
1506 atomic_add_long(&hammer2_count_modified_chains, -1);
1508 hammer2_pfs_memory_wakeup(chain->pmp);
1515 hammer2_dedup_lookup(hammer2_dev_t *hmp, char **datap, int pblksize)
1517 hammer2_dedup_t *dedup;
1526 if (hammer2_dedup_enable == 0)
1533 * XXX use the built-in crc (the dedup lookup sequencing
1534 * needs to be fixed so the check code is already present
1535 * when dedup_lookup is called)
1537 crc = XXH64(data, pblksize, XXH_HAMMER2_SEED);
1538 dedup = &hmp->heur_dedup[crc & (HAMMER2_DEDUP_HEUR_MASK & ~3)];
1540 if (hammer2_debug & 0x40000) {
1541 kprintf("LOC %04x/4 %016jx\n",
1542 (int)(dedup - hmp->heur_dedup),
1546 for (i = 0; i < 4; ++i) {
1547 off = dedup[i].data_off;
1549 if (dedup[i].data_crc != crc)
1551 if ((1 << (int)(off & HAMMER2_OFF_MASK_RADIX)) != pblksize)
1553 dio = hammer2_io_getquick(hmp, off, pblksize);
1555 dtmp = hammer2_io_data(dio, off),
1556 mask = hammer2_dedup_mask(dio, off, pblksize);
1557 if ((dio->dedup_alloc & mask) == mask &&
1558 (dio->dedup_valid & mask) == mask &&
1559 bcmp(data, dtmp, pblksize) == 0) {
1560 if (hammer2_debug & 0x40000) {
1561 kprintf("DEDUP SUCCESS %016jx\n",
1564 hammer2_io_putblk(&dio);
1566 dedup[i].ticks = ticks; /* update use */
1567 atomic_add_long(&hammer2_iod_file_wdedup,
1570 return off; /* RETURN */
1572 hammer2_io_putblk(&dio);
1579 * Poof. Races are ok, if someone gets in and reuses a dedup offset
1580 * before or while we are clearing it they will also recover the freemap
1581 * entry (set it to fully allocated), so a bulkfree race can only set it
1582 * to a possibly-free state.
1584 * XXX ok, well, not really sure races are ok but going to run with it
1588 hammer2_dedup_clear(hammer2_dev_t *hmp)
1592 for (i = 0; i < HAMMER2_DEDUP_HEUR_SIZE; ++i) {
1593 hmp->heur_dedup[i].data_off = 0;
1594 hmp->heur_dedup[i].ticks = ticks - 1;