2 * Copyright (c) 2007-2008 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * $DragonFly: src/sys/vfs/hammer/hammer_object.c,v 1.97 2008/09/23 22:28:56 dillon Exp $
39 static int hammer_mem_lookup(hammer_cursor_t cursor);
40 static void hammer_mem_first(hammer_cursor_t cursor);
41 static int hammer_frontend_trunc_callback(hammer_record_t record,
43 static int hammer_bulk_scan_callback(hammer_record_t record, void *data);
44 static int hammer_record_needs_overwrite_delete(hammer_record_t record);
45 static int hammer_delete_general(hammer_cursor_t cursor, hammer_inode_t ip,
46 hammer_btree_leaf_elm_t leaf);
47 static int hammer_cursor_localize_data(hammer_data_ondisk_t data,
48 hammer_btree_leaf_elm_t leaf);
50 struct rec_trunc_info {
55 struct hammer_bulk_info {
56 hammer_record_t record;
57 struct hammer_btree_leaf_elm leaf;
61 * Red-black tree support. Comparison code for insertion.
64 hammer_rec_rb_compare(hammer_record_t rec1, hammer_record_t rec2)
66 if (rec1->leaf.base.rec_type < rec2->leaf.base.rec_type)
68 if (rec1->leaf.base.rec_type > rec2->leaf.base.rec_type)
71 if (rec1->leaf.base.key < rec2->leaf.base.key)
73 if (rec1->leaf.base.key > rec2->leaf.base.key)
77 * For search & insertion purposes records deleted by the
78 * frontend or deleted/committed by the backend are silently
79 * ignored. Otherwise pipelined insertions will get messed
82 * rec1 is greater then rec2 if rec1 is marked deleted.
83 * rec1 is less then rec2 if rec2 is marked deleted.
85 * Multiple deleted records may be present, do not return 0
86 * if both are marked deleted.
88 if (rec1->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
89 HAMMER_RECF_COMMITTED)) {
92 if (rec2->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
93 HAMMER_RECF_COMMITTED)) {
101 * Basic record comparison code similar to hammer_btree_cmp().
103 * obj_id is not compared and may not yet be assigned in the record.
106 hammer_rec_cmp(hammer_base_elm_t elm, hammer_record_t rec)
108 if (elm->rec_type < rec->leaf.base.rec_type)
110 if (elm->rec_type > rec->leaf.base.rec_type)
113 if (elm->key < rec->leaf.base.key)
115 if (elm->key > rec->leaf.base.key)
119 * Never match against an item deleted by the frontend
120 * or backend, or committed by the backend.
122 * elm is less then rec if rec is marked deleted.
124 if (rec->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
125 HAMMER_RECF_COMMITTED)) {
132 * Ranged scan to locate overlapping record(s). This is used by
133 * hammer_ip_get_bulk() to locate an overlapping record. We have
134 * to use a ranged scan because the keys for data records with the
135 * same file base offset can be different due to differing data_len's.
137 * NOTE: The base file offset of a data record is (key - data_len), not (key).
140 hammer_rec_overlap_cmp(hammer_record_t rec, void *data)
142 struct hammer_bulk_info *info = data;
143 hammer_btree_leaf_elm_t leaf = &info->leaf;
145 if (rec->leaf.base.rec_type < leaf->base.rec_type)
147 if (rec->leaf.base.rec_type > leaf->base.rec_type)
153 if (leaf->base.rec_type == HAMMER_RECTYPE_DATA) {
154 /* rec_beg >= leaf_end */
155 if (rec->leaf.base.key - rec->leaf.data_len >= leaf->base.key)
157 /* rec_end <= leaf_beg */
158 if (rec->leaf.base.key <= leaf->base.key - leaf->data_len)
161 if (rec->leaf.base.key < leaf->base.key)
163 if (rec->leaf.base.key > leaf->base.key)
168 * We have to return 0 at this point, even if DELETED_FE is set,
169 * because returning anything else will cause the scan to ignore
170 * one of the branches when we really want it to check both.
176 * RB_SCAN comparison code for hammer_mem_first(). The argument order
177 * is reversed so the comparison result has to be negated. key_beg and
178 * key_end are both range-inclusive.
180 * Localized deletions are not cached in-memory.
184 hammer_rec_scan_cmp(hammer_record_t rec, void *data)
186 hammer_cursor_t cursor = data;
189 r = hammer_rec_cmp(&cursor->key_beg, rec);
192 r = hammer_rec_cmp(&cursor->key_end, rec);
199 * This compare function is used when simply looking up key_beg.
203 hammer_rec_find_cmp(hammer_record_t rec, void *data)
205 hammer_cursor_t cursor = data;
208 r = hammer_rec_cmp(&cursor->key_beg, rec);
217 * Locate blocks within the truncation range. Partial blocks do not count.
221 hammer_rec_trunc_cmp(hammer_record_t rec, void *data)
223 struct rec_trunc_info *info = data;
225 if (rec->leaf.base.rec_type < info->rec_type)
227 if (rec->leaf.base.rec_type > info->rec_type)
230 switch(rec->leaf.base.rec_type) {
231 case HAMMER_RECTYPE_DB:
233 * DB record key is not beyond the truncation point, retain.
235 if (rec->leaf.base.key < info->trunc_off)
238 case HAMMER_RECTYPE_DATA:
240 * DATA record offset start is not beyond the truncation point,
243 if (rec->leaf.base.key - rec->leaf.data_len < info->trunc_off)
247 panic("hammer_rec_trunc_cmp: unexpected record type");
251 * The record start is >= the truncation point, return match,
252 * the record should be destroyed.
257 RB_GENERATE(hammer_rec_rb_tree, hammer_record, rb_node, hammer_rec_rb_compare);
260 * Allocate a record for the caller to finish filling in. The record is
261 * returned referenced.
264 hammer_alloc_mem_record(hammer_inode_t ip, int data_len)
266 hammer_record_t record;
270 ++hammer_count_records;
271 record = kmalloc(sizeof(*record), hmp->m_misc,
272 M_WAITOK | M_ZERO | M_USE_RESERVE);
273 record->flush_state = HAMMER_FST_IDLE;
275 record->leaf.base.btype = HAMMER_BTREE_TYPE_RECORD;
276 record->leaf.data_len = data_len;
277 hammer_ref(&record->lock);
280 record->data = kmalloc(data_len, hmp->m_misc, M_WAITOK | M_ZERO);
281 record->flags |= HAMMER_RECF_ALLOCDATA;
282 ++hammer_count_record_datas;
289 hammer_wait_mem_record_ident(hammer_record_t record, const char *ident)
291 while (record->flush_state == HAMMER_FST_FLUSH) {
292 record->flags |= HAMMER_RECF_WANTED;
293 tsleep(record, 0, ident, 0);
298 * Called from the backend, hammer_inode.c, after a record has been
299 * flushed to disk. The record has been exclusively locked by the
300 * caller and interlocked with BE.
302 * We clean up the state, unlock, and release the record (the record
303 * was referenced by the fact that it was in the HAMMER_FST_FLUSH state).
306 hammer_flush_record_done(hammer_record_t record, int error)
308 hammer_inode_t target_ip;
310 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
311 KKASSERT(record->flags & HAMMER_RECF_INTERLOCK_BE);
314 * If an error occured, the backend was unable to sync the
315 * record to its media. Leave the record intact.
318 hammer_critical_error(record->ip->hmp, record->ip, error,
319 "while flushing record");
322 --record->flush_group->refs;
323 record->flush_group = NULL;
326 * Adjust the flush state and dependancy based on success or
329 if (record->flags & (HAMMER_RECF_DELETED_BE | HAMMER_RECF_COMMITTED)) {
330 if ((target_ip = record->target_ip) != NULL) {
331 TAILQ_REMOVE(&target_ip->target_list, record,
333 record->target_ip = NULL;
334 hammer_test_inode(target_ip);
336 record->flush_state = HAMMER_FST_IDLE;
338 if (record->target_ip) {
339 record->flush_state = HAMMER_FST_SETUP;
340 hammer_test_inode(record->ip);
341 hammer_test_inode(record->target_ip);
343 record->flush_state = HAMMER_FST_IDLE;
346 record->flags &= ~HAMMER_RECF_INTERLOCK_BE;
351 if (record->flags & HAMMER_RECF_WANTED) {
352 record->flags &= ~HAMMER_RECF_WANTED;
355 hammer_rel_mem_record(record);
359 * Release a memory record. Records marked for deletion are immediately
360 * removed from the RB-Tree but otherwise left intact until the last ref
364 hammer_rel_mem_record(struct hammer_record *record)
367 hammer_reserve_t resv;
369 hammer_inode_t target_ip;
372 hammer_unref(&record->lock);
374 if (record->lock.refs == 0) {
376 * Upon release of the last reference wakeup any waiters.
377 * The record structure may get destroyed so callers will
378 * loop up and do a relookup.
380 * WARNING! Record must be removed from RB-TREE before we
381 * might possibly block. hammer_test_inode() can block!
387 * Upon release of the last reference a record marked deleted
388 * by the front or backend, or committed by the backend,
391 if (record->flags & (HAMMER_RECF_DELETED_FE |
392 HAMMER_RECF_DELETED_BE |
393 HAMMER_RECF_COMMITTED)) {
394 KKASSERT(ip->lock.refs > 0);
395 KKASSERT(record->flush_state != HAMMER_FST_FLUSH);
398 * target_ip may have zero refs, we have to ref it
399 * to prevent it from being ripped out from under
402 if ((target_ip = record->target_ip) != NULL) {
403 TAILQ_REMOVE(&target_ip->target_list,
404 record, target_entry);
405 record->target_ip = NULL;
406 hammer_ref(&target_ip->lock);
410 * Remove the record from the B-Tree
412 if (record->flags & HAMMER_RECF_ONRBTREE) {
413 RB_REMOVE(hammer_rec_rb_tree,
414 &record->ip->rec_tree,
416 record->flags &= ~HAMMER_RECF_ONRBTREE;
417 KKASSERT(ip->rsv_recs > 0);
424 * We must wait for any direct-IO to complete before
425 * we can destroy the record because the bio may
426 * have a reference to it.
429 (HAMMER_RECF_DIRECT_IO | HAMMER_RECF_DIRECT_INVAL)) {
430 hammer_io_direct_wait(record);
434 * Account for the completion after the direct IO
440 hmp->rsv_databytes -= record->leaf.data_len;
442 if (RB_EMPTY(&record->ip->rec_tree)) {
443 record->ip->flags &= ~HAMMER_INODE_XDIRTY;
444 record->ip->sync_flags &= ~HAMMER_INODE_XDIRTY;
445 hammer_test_inode(record->ip);
447 if (ip->rsv_recs == hammer_limit_inode_recs - 1)
448 wakeup(&ip->rsv_recs);
452 * Do this test after removing record from the B-Tree.
455 hammer_test_inode(target_ip);
456 hammer_rel_inode(target_ip, 0);
459 if (record->flags & HAMMER_RECF_ALLOCDATA) {
460 --hammer_count_record_datas;
461 kfree(record->data, hmp->m_misc);
462 record->flags &= ~HAMMER_RECF_ALLOCDATA;
466 * Release the reservation.
468 * If the record was not committed we can theoretically
469 * undo the reservation. However, doing so might
470 * create weird edge cases with the ordering of
471 * direct writes because the related buffer cache
472 * elements are per-vnode. So we don't try.
474 if ((resv = record->resv) != NULL) {
475 /* XXX undo leaf.data_offset,leaf.data_len */
476 hammer_blockmap_reserve_complete(hmp, resv);
480 --hammer_count_records;
481 kfree(record, hmp->m_misc);
487 * Record visibility depends on whether the record is being accessed by
488 * the backend or the frontend. Backend tests ignore the frontend delete
489 * flag. Frontend tests do NOT ignore the backend delete/commit flags and
490 * must also check for commit races.
492 * Return non-zero if the record is visible, zero if it isn't or if it is
493 * deleted. Returns 0 if the record has been comitted (unless the special
494 * delete-visibility flag is set). A committed record must be located
495 * via the media B-Tree. Returns non-zero if the record is good.
497 * If HAMMER_CURSOR_DELETE_VISIBILITY is set we allow deleted memory
498 * records to be returned. This is so pending deletions are detected
499 * when using an iterator to locate an unused hash key, or when we need
500 * to locate historical records on-disk to destroy.
504 hammer_ip_iterate_mem_good(hammer_cursor_t cursor, hammer_record_t record)
506 if (cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY)
508 if (cursor->flags & HAMMER_CURSOR_BACKEND) {
509 if (record->flags & (HAMMER_RECF_DELETED_BE |
510 HAMMER_RECF_COMMITTED)) {
514 if (record->flags & (HAMMER_RECF_DELETED_FE |
515 HAMMER_RECF_DELETED_BE |
516 HAMMER_RECF_COMMITTED)) {
524 * This callback is used as part of the RB_SCAN function for in-memory
525 * records. We terminate it (return -1) as soon as we get a match.
527 * This routine is used by frontend code.
529 * The primary compare code does not account for ASOF lookups. This
530 * code handles that case as well as a few others.
534 hammer_rec_scan_callback(hammer_record_t rec, void *data)
536 hammer_cursor_t cursor = data;
539 * We terminate on success, so this should be NULL on entry.
541 KKASSERT(cursor->iprec == NULL);
544 * Skip if the record was marked deleted or committed.
546 if (hammer_ip_iterate_mem_good(cursor, rec) == 0)
550 * Skip if not visible due to our as-of TID
552 if (cursor->flags & HAMMER_CURSOR_ASOF) {
553 if (cursor->asof < rec->leaf.base.create_tid)
555 if (rec->leaf.base.delete_tid &&
556 cursor->asof >= rec->leaf.base.delete_tid) {
562 * ref the record. The record is protected from backend B-Tree
563 * interactions by virtue of the cursor's IP lock.
565 hammer_ref(&rec->lock);
568 * The record may have been deleted or committed while we
569 * were blocked. XXX remove?
571 if (hammer_ip_iterate_mem_good(cursor, rec) == 0) {
572 hammer_rel_mem_record(rec);
577 * Set the matching record and stop the scan.
585 * Lookup an in-memory record given the key specified in the cursor. Works
586 * just like hammer_btree_lookup() but operates on an inode's in-memory
589 * The lookup must fail if the record is marked for deferred deletion.
591 * The API for mem/btree_lookup() does not mess with the ATE/EOF bits.
595 hammer_mem_lookup(hammer_cursor_t cursor)
597 KKASSERT(cursor->ip);
599 hammer_rel_mem_record(cursor->iprec);
600 cursor->iprec = NULL;
602 hammer_rec_rb_tree_RB_SCAN(&cursor->ip->rec_tree, hammer_rec_find_cmp,
603 hammer_rec_scan_callback, cursor);
605 return (cursor->iprec ? 0 : ENOENT);
609 * hammer_mem_first() - locate the first in-memory record matching the
610 * cursor within the bounds of the key range.
612 * WARNING! API is slightly different from btree_first(). hammer_mem_first()
613 * will set ATEMEM the same as MEMEOF, and does not return any error.
617 hammer_mem_first(hammer_cursor_t cursor)
622 KKASSERT(ip != NULL);
625 hammer_rel_mem_record(cursor->iprec);
626 cursor->iprec = NULL;
628 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_scan_cmp,
629 hammer_rec_scan_callback, cursor);
632 cursor->flags &= ~(HAMMER_CURSOR_MEMEOF | HAMMER_CURSOR_ATEMEM);
634 cursor->flags |= HAMMER_CURSOR_MEMEOF | HAMMER_CURSOR_ATEMEM;
637 /************************************************************************
638 * HAMMER IN-MEMORY RECORD FUNCTIONS *
639 ************************************************************************
641 * These functions manipulate in-memory records. Such records typically
642 * exist prior to being committed to disk or indexed via the on-disk B-Tree.
646 * Add a directory entry (dip,ncp) which references inode (ip).
648 * Note that the low 32 bits of the namekey are set temporarily to create
649 * a unique in-memory record, and may be modified a second time when the
650 * record is synchronized to disk. In particular, the low 32 bits cannot be
651 * all 0's when synching to disk, which is not handled here.
653 * NOTE: bytes does not include any terminating \0 on name, and name might
657 hammer_ip_add_directory(struct hammer_transaction *trans,
658 struct hammer_inode *dip, const char *name, int bytes,
659 struct hammer_inode *ip)
661 struct hammer_cursor cursor;
662 hammer_record_t record;
664 u_int32_t max_iterations;
666 record = hammer_alloc_mem_record(dip, HAMMER_ENTRY_SIZE(bytes));
668 record->type = HAMMER_MEM_RECORD_ADD;
669 record->leaf.base.localization = dip->obj_localization +
670 hammer_dir_localization(dip);
671 record->leaf.base.obj_id = dip->obj_id;
672 record->leaf.base.key = hammer_directory_namekey(dip, name, bytes,
674 record->leaf.base.rec_type = HAMMER_RECTYPE_DIRENTRY;
675 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
676 record->data->entry.obj_id = ip->obj_id;
677 record->data->entry.localization = ip->obj_localization;
678 bcopy(name, record->data->entry.name, bytes);
680 ++ip->ino_data.nlinks;
681 ip->ino_data.ctime = trans->time;
682 hammer_modify_inode(ip, HAMMER_INODE_DDIRTY);
685 * Find an unused namekey. Both the in-memory record tree and
686 * the B-Tree are checked. We do not want historically deleted
687 * names to create a collision as our iteration space may be limited,
688 * and since create_tid wouldn't match anyway an ASOF search
689 * must be used to locate collisions.
691 * delete-visibility is set so pending deletions do not give us
692 * a false-negative on our ability to use an iterator.
694 * The iterator must not rollover the key. Directory keys only
695 * use the positive key space.
697 hammer_init_cursor(trans, &cursor, &dip->cache[1], dip);
698 cursor.key_beg = record->leaf.base;
699 cursor.flags |= HAMMER_CURSOR_ASOF;
700 cursor.flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
701 cursor.asof = ip->obj_asof;
703 while (hammer_ip_lookup(&cursor) == 0) {
704 ++record->leaf.base.key;
705 KKASSERT(record->leaf.base.key > 0);
706 cursor.key_beg.key = record->leaf.base.key;
707 if (--max_iterations == 0) {
708 hammer_rel_mem_record(record);
715 * The target inode and the directory entry are bound together.
717 record->target_ip = ip;
718 record->flush_state = HAMMER_FST_SETUP;
719 TAILQ_INSERT_TAIL(&ip->target_list, record, target_entry);
722 * The inode now has a dependancy and must be taken out of the idle
723 * state. An inode not in an idle state is given an extra reference.
725 * When transitioning to a SETUP state flag for an automatic reflush
726 * when the dependancies are disposed of if someone is waiting on
729 if (ip->flush_state == HAMMER_FST_IDLE) {
730 hammer_ref(&ip->lock);
731 ip->flush_state = HAMMER_FST_SETUP;
732 if (ip->flags & HAMMER_INODE_FLUSHW)
733 ip->flags |= HAMMER_INODE_REFLUSH;
735 error = hammer_mem_add(record);
737 dip->ino_data.mtime = trans->time;
738 hammer_modify_inode(dip, HAMMER_INODE_MTIME);
741 hammer_done_cursor(&cursor);
746 * Delete the directory entry and update the inode link count. The
747 * cursor must be seeked to the directory entry record being deleted.
749 * The related inode should be share-locked by the caller. The caller is
750 * on the frontend. It could also be NULL indicating that the directory
751 * entry being removed has no related inode.
753 * This function can return EDEADLK requiring the caller to terminate
754 * the cursor, any locks, wait on the returned record, and retry.
757 hammer_ip_del_directory(struct hammer_transaction *trans,
758 hammer_cursor_t cursor, struct hammer_inode *dip,
759 struct hammer_inode *ip)
761 hammer_record_t record;
764 if (hammer_cursor_inmem(cursor)) {
766 * In-memory (unsynchronized) records can simply be freed.
768 * Even though the HAMMER_RECF_DELETED_FE flag is ignored
769 * by the backend, we must still avoid races against the
770 * backend potentially syncing the record to the media.
772 * We cannot call hammer_ip_delete_record(), that routine may
773 * only be called from the backend.
775 record = cursor->iprec;
776 if (record->flags & (HAMMER_RECF_INTERLOCK_BE |
777 HAMMER_RECF_DELETED_BE |
778 HAMMER_RECF_COMMITTED)) {
779 KKASSERT(cursor->deadlk_rec == NULL);
780 hammer_ref(&record->lock);
781 cursor->deadlk_rec = record;
784 KKASSERT(record->type == HAMMER_MEM_RECORD_ADD);
785 record->flags |= HAMMER_RECF_DELETED_FE;
790 * If the record is on-disk we have to queue the deletion by
791 * the record's key. This also causes lookups to skip the
792 * record (lookups for the purposes of finding an unused
793 * directory key do not skip the record).
795 KKASSERT(dip->flags &
796 (HAMMER_INODE_ONDISK | HAMMER_INODE_DONDISK));
797 record = hammer_alloc_mem_record(dip, 0);
798 record->type = HAMMER_MEM_RECORD_DEL;
799 record->leaf.base = cursor->leaf->base;
800 KKASSERT(dip->obj_id == record->leaf.base.obj_id);
803 * ip may be NULL, indicating the deletion of a directory
804 * entry which has no related inode.
806 record->target_ip = ip;
808 record->flush_state = HAMMER_FST_SETUP;
809 TAILQ_INSERT_TAIL(&ip->target_list, record,
812 record->flush_state = HAMMER_FST_IDLE;
816 * The inode now has a dependancy and must be taken out of
817 * the idle state. An inode not in an idle state is given
818 * an extra reference.
820 * When transitioning to a SETUP state flag for an automatic
821 * reflush when the dependancies are disposed of if someone
822 * is waiting on the inode.
824 if (ip && ip->flush_state == HAMMER_FST_IDLE) {
825 hammer_ref(&ip->lock);
826 ip->flush_state = HAMMER_FST_SETUP;
827 if (ip->flags & HAMMER_INODE_FLUSHW)
828 ip->flags |= HAMMER_INODE_REFLUSH;
831 error = hammer_mem_add(record);
835 * One less link. The file may still be open in the OS even after
836 * all links have gone away.
838 * We have to terminate the cursor before syncing the inode to
839 * avoid deadlocking against ourselves. XXX this may no longer
842 * If nlinks drops to zero and the vnode is inactive (or there is
843 * no vnode), call hammer_inode_unloadable_check() to zonk the
844 * inode. If we don't do this here the inode will not be destroyed
845 * on-media until we unmount.
849 --ip->ino_data.nlinks; /* do before we might block */
850 ip->ino_data.ctime = trans->time;
852 dip->ino_data.mtime = trans->time;
853 hammer_modify_inode(dip, HAMMER_INODE_MTIME);
855 hammer_modify_inode(ip, HAMMER_INODE_DDIRTY);
856 if (ip->ino_data.nlinks == 0 &&
857 (ip->vp == NULL || (ip->vp->v_flag & VINACTIVE))) {
858 hammer_done_cursor(cursor);
859 hammer_inode_unloadable_check(ip, 1);
860 hammer_flush_inode(ip, 0);
869 * Add a record to an inode.
871 * The caller must allocate the record with hammer_alloc_mem_record(ip) and
872 * initialize the following additional fields:
874 * The related inode should be share-locked by the caller. The caller is
877 * record->rec.entry.base.base.key
878 * record->rec.entry.base.base.rec_type
879 * record->rec.entry.base.base.data_len
880 * record->data (a copy will be kmalloc'd if it cannot be embedded)
883 hammer_ip_add_record(struct hammer_transaction *trans, hammer_record_t record)
885 hammer_inode_t ip = record->ip;
888 KKASSERT(record->leaf.base.localization != 0);
889 record->leaf.base.obj_id = ip->obj_id;
890 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
891 error = hammer_mem_add(record);
896 * Locate a bulk record in-memory. Bulk records allow disk space to be
897 * reserved so the front-end can flush large data writes without having
898 * to queue the BIO to the flusher. Only the related record gets queued
902 static hammer_record_t
903 hammer_ip_get_bulk(hammer_inode_t ip, off_t file_offset, int bytes)
905 struct hammer_bulk_info info;
907 bzero(&info, sizeof(info));
908 info.leaf.base.obj_id = ip->obj_id;
909 info.leaf.base.key = file_offset + bytes;
910 info.leaf.base.create_tid = 0;
911 info.leaf.base.delete_tid = 0;
912 info.leaf.base.rec_type = HAMMER_RECTYPE_DATA;
913 info.leaf.base.obj_type = 0; /* unused */
914 info.leaf.base.btype = HAMMER_BTREE_TYPE_RECORD; /* unused */
915 info.leaf.base.localization = ip->obj_localization + /* unused */
916 HAMMER_LOCALIZE_MISC;
917 info.leaf.data_len = bytes;
919 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_overlap_cmp,
920 hammer_bulk_scan_callback, &info);
922 return(info.record); /* may be NULL */
926 * Take records vetted by overlap_cmp. The first non-deleted record
927 * (if any) stops the scan.
930 hammer_bulk_scan_callback(hammer_record_t record, void *data)
932 struct hammer_bulk_info *info = data;
934 if (record->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
935 HAMMER_RECF_COMMITTED)) {
938 hammer_ref(&record->lock);
939 info->record = record;
940 return(-1); /* stop scan */
944 * Reserve blockmap space placemarked with an in-memory record.
946 * This routine is called by the frontend in order to be able to directly
947 * flush a buffer cache buffer. The frontend has locked the related buffer
948 * cache buffers and we should be able to manipulate any overlapping
951 * The caller is responsible for adding the returned record.
954 hammer_ip_add_bulk(hammer_inode_t ip, off_t file_offset, void *data, int bytes,
957 hammer_record_t record;
958 hammer_record_t conflict;
962 * Deal with conflicting in-memory records. We cannot have multiple
963 * in-memory records for the same base offset without seriously
964 * confusing the backend, including but not limited to the backend
965 * issuing delete-create-delete or create-delete-create sequences
966 * and asserting on the delete_tid being the same as the create_tid.
968 * If we encounter a record with the backend interlock set we cannot
969 * immediately delete it without confusing the backend.
971 while ((conflict = hammer_ip_get_bulk(ip, file_offset, bytes)) !=NULL) {
972 if (conflict->flags & HAMMER_RECF_INTERLOCK_BE) {
973 conflict->flags |= HAMMER_RECF_WANTED;
974 tsleep(conflict, 0, "hmrrc3", 0);
976 conflict->flags |= HAMMER_RECF_DELETED_FE;
978 hammer_rel_mem_record(conflict);
982 * Create a record to cover the direct write. This is called with
983 * the related BIO locked so there should be no possible conflict.
985 * The backend is responsible for finalizing the space reserved in
988 * XXX bytes not aligned, depend on the reservation code to
989 * align the reservation.
991 record = hammer_alloc_mem_record(ip, 0);
992 zone = (bytes >= HAMMER_BUFSIZE) ? HAMMER_ZONE_LARGE_DATA_INDEX :
993 HAMMER_ZONE_SMALL_DATA_INDEX;
994 record->resv = hammer_blockmap_reserve(ip->hmp, zone, bytes,
995 &record->leaf.data_offset,
997 if (record->resv == NULL) {
998 kprintf("hammer_ip_add_bulk: reservation failed\n");
999 hammer_rel_mem_record(record);
1002 record->type = HAMMER_MEM_RECORD_DATA;
1003 record->leaf.base.rec_type = HAMMER_RECTYPE_DATA;
1004 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
1005 record->leaf.base.obj_id = ip->obj_id;
1006 record->leaf.base.key = file_offset + bytes;
1007 record->leaf.base.localization = ip->obj_localization +
1008 HAMMER_LOCALIZE_MISC;
1009 record->leaf.data_len = bytes;
1010 hammer_crc_set_leaf(data, &record->leaf);
1011 KKASSERT(*errorp == 0);
1016 * Frontend truncation code. Scan in-memory records only. On-disk records
1017 * and records in a flushing state are handled by the backend. The vnops
1018 * setattr code will handle the block containing the truncation point.
1020 * Partial blocks are not deleted.
1023 hammer_ip_frontend_trunc(struct hammer_inode *ip, off_t file_size)
1025 struct rec_trunc_info info;
1027 switch(ip->ino_data.obj_type) {
1028 case HAMMER_OBJTYPE_REGFILE:
1029 info.rec_type = HAMMER_RECTYPE_DATA;
1031 case HAMMER_OBJTYPE_DBFILE:
1032 info.rec_type = HAMMER_RECTYPE_DB;
1037 info.trunc_off = file_size;
1038 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_trunc_cmp,
1039 hammer_frontend_trunc_callback, &info);
1044 hammer_frontend_trunc_callback(hammer_record_t record, void *data __unused)
1046 if (record->flags & HAMMER_RECF_DELETED_FE)
1048 if (record->flush_state == HAMMER_FST_FLUSH)
1050 KKASSERT((record->flags & HAMMER_RECF_INTERLOCK_BE) == 0);
1051 hammer_ref(&record->lock);
1052 record->flags |= HAMMER_RECF_DELETED_FE;
1053 hammer_rel_mem_record(record);
1058 * Return 1 if the caller must check for and delete existing records
1059 * before writing out a new data record.
1061 * Return 0 if the caller can just insert the record into the B-Tree without
1065 hammer_record_needs_overwrite_delete(hammer_record_t record)
1067 hammer_inode_t ip = record->ip;
1068 int64_t file_offset;
1071 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE)
1072 file_offset = record->leaf.base.key;
1074 file_offset = record->leaf.base.key - record->leaf.data_len;
1075 r = (file_offset < ip->save_trunc_off);
1076 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1077 if (ip->save_trunc_off <= record->leaf.base.key)
1078 ip->save_trunc_off = record->leaf.base.key + 1;
1080 if (ip->save_trunc_off < record->leaf.base.key)
1081 ip->save_trunc_off = record->leaf.base.key;
1087 * Backend code. Sync a record to the media.
1090 hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t record)
1092 hammer_transaction_t trans = cursor->trans;
1093 int64_t file_offset;
1099 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
1100 KKASSERT(record->flags & HAMMER_RECF_INTERLOCK_BE);
1101 KKASSERT(record->leaf.base.localization != 0);
1104 * Any direct-write related to the record must complete before we
1105 * can sync the record to the on-disk media.
1107 if (record->flags & (HAMMER_RECF_DIRECT_IO | HAMMER_RECF_DIRECT_INVAL))
1108 hammer_io_direct_wait(record);
1111 * If this is a bulk-data record placemarker there may be an existing
1112 * record on-disk, indicating a data overwrite. If there is the
1113 * on-disk record must be deleted before we can insert our new record.
1115 * We've synthesized this record and do not know what the create_tid
1116 * on-disk is, nor how much data it represents.
1118 * Keep in mind that (key) for data records is (base_offset + len),
1119 * not (base_offset). Also, we only want to get rid of on-disk
1120 * records since we are trying to sync our in-memory record, call
1121 * hammer_ip_delete_range() with truncating set to 1 to make sure
1122 * it skips in-memory records.
1124 * It is ok for the lookup to return ENOENT.
1126 * NOTE OPTIMIZATION: sync_trunc_off is used to determine if we have
1127 * to call hammer_ip_delete_range() or not. This also means we must
1128 * update sync_trunc_off() as we write.
1130 if (record->type == HAMMER_MEM_RECORD_DATA &&
1131 hammer_record_needs_overwrite_delete(record)) {
1132 file_offset = record->leaf.base.key - record->leaf.data_len;
1133 bytes = (record->leaf.data_len + HAMMER_BUFMASK) &
1135 KKASSERT((file_offset & HAMMER_BUFMASK) == 0);
1136 error = hammer_ip_delete_range(
1138 file_offset, file_offset + bytes - 1,
1140 if (error && error != ENOENT)
1145 * If this is a general record there may be an on-disk version
1146 * that must be deleted before we can insert the new record.
1148 if (record->type == HAMMER_MEM_RECORD_GENERAL) {
1149 error = hammer_delete_general(cursor, record->ip,
1151 if (error && error != ENOENT)
1158 hammer_normalize_cursor(cursor);
1159 cursor->key_beg = record->leaf.base;
1160 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
1161 cursor->flags |= HAMMER_CURSOR_BACKEND;
1162 cursor->flags &= ~HAMMER_CURSOR_INSERT;
1165 * Records can wind up on-media before the inode itself is on-media.
1168 record->ip->flags |= HAMMER_INODE_DONDISK;
1171 * If we are deleting a directory entry an exact match must be
1174 if (record->type == HAMMER_MEM_RECORD_DEL) {
1175 error = hammer_btree_lookup(cursor);
1177 KKASSERT(cursor->iprec == NULL);
1178 error = hammer_ip_delete_record(cursor, record->ip,
1181 record->flags |= HAMMER_RECF_DELETED_BE |
1182 HAMMER_RECF_COMMITTED;
1183 ++record->ip->rec_generation;
1192 * Issue a lookup to position the cursor and locate the insertion
1193 * point. The target key should not exist. If we are creating a
1194 * directory entry we may have to iterate the low 32 bits of the
1195 * key to find an unused key.
1197 hammer_sync_lock_sh(trans);
1198 cursor->flags |= HAMMER_CURSOR_INSERT;
1199 error = hammer_btree_lookup(cursor);
1200 if (hammer_debug_inode)
1201 kprintf("DOINSERT LOOKUP %d\n", error);
1203 kprintf("hammer_ip_sync_record: duplicate rec "
1204 "at (%016llx)\n", (long long)record->leaf.base.key);
1205 Debugger("duplicate record1");
1209 if (record->type == HAMMER_MEM_RECORD_DATA)
1210 kprintf("sync_record %016llx ---------------- %016llx %d\n",
1211 record->leaf.base.key - record->leaf.data_len,
1212 record->leaf.data_offset, error);
1215 if (error != ENOENT)
1219 * Allocate the record and data. The result buffers will be
1220 * marked as being modified and further calls to
1221 * hammer_modify_buffer() will result in unneeded UNDO records.
1223 * Support zero-fill records (data == NULL and data_len != 0)
1225 if (record->type == HAMMER_MEM_RECORD_DATA) {
1227 * The data portion of a bulk-data record has already been
1228 * committed to disk, we need only adjust the layer2
1229 * statistics in the same transaction as our B-Tree insert.
1231 KKASSERT(record->leaf.data_offset != 0);
1232 error = hammer_blockmap_finalize(trans,
1234 record->leaf.data_offset,
1235 record->leaf.data_len);
1236 } else if (record->data && record->leaf.data_len) {
1238 * Wholely cached record, with data. Allocate the data.
1240 bdata = hammer_alloc_data(trans, record->leaf.data_len,
1241 record->leaf.base.rec_type,
1242 &record->leaf.data_offset,
1243 &cursor->data_buffer,
1247 hammer_crc_set_leaf(record->data, &record->leaf);
1248 hammer_modify_buffer(trans, cursor->data_buffer, NULL, 0);
1249 bcopy(record->data, bdata, record->leaf.data_len);
1250 hammer_modify_buffer_done(cursor->data_buffer);
1253 * Wholely cached record, without data.
1255 record->leaf.data_offset = 0;
1256 record->leaf.data_crc = 0;
1259 error = hammer_btree_insert(cursor, &record->leaf, &doprop);
1260 if (hammer_debug_inode && error) {
1261 kprintf("BTREE INSERT error %d @ %016llx:%d key %016llx\n",
1263 (long long)cursor->node->node_offset,
1265 (long long)record->leaf.base.key);
1269 * Our record is on-disk and we normally mark the in-memory version
1270 * as having been committed (and not BE-deleted).
1272 * If the record represented a directory deletion but we had to
1273 * sync a valid directory entry to disk due to dependancies,
1274 * we must convert the record to a covering delete so the
1275 * frontend does not have visibility on the synced entry.
1277 * WARNING: cursor's leaf pointer may have changed after do_propagation
1282 hammer_btree_do_propagation(cursor,
1286 if (record->flags & HAMMER_RECF_CONVERT_DELETE) {
1288 * Must convert deleted directory entry add
1289 * to a directory entry delete.
1291 KKASSERT(record->type == HAMMER_MEM_RECORD_ADD);
1292 record->flags &= ~HAMMER_RECF_DELETED_FE;
1293 record->type = HAMMER_MEM_RECORD_DEL;
1294 KKASSERT(record->ip->obj_id == record->leaf.base.obj_id);
1295 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
1296 record->flags &= ~HAMMER_RECF_CONVERT_DELETE;
1297 KKASSERT((record->flags & (HAMMER_RECF_COMMITTED |
1298 HAMMER_RECF_DELETED_BE)) == 0);
1299 /* converted record is not yet committed */
1300 /* hammer_flush_record_done takes care of the rest */
1303 * Everything went fine and we are now done with
1306 record->flags |= HAMMER_RECF_COMMITTED;
1307 ++record->ip->rec_generation;
1310 if (record->leaf.data_offset) {
1311 hammer_blockmap_free(trans, record->leaf.data_offset,
1312 record->leaf.data_len);
1316 hammer_sync_unlock(trans);
1322 * Add the record to the inode's rec_tree. The low 32 bits of a directory
1323 * entry's key is used to deal with hash collisions in the upper 32 bits.
1324 * A unique 64 bit key is generated in-memory and may be regenerated a
1325 * second time when the directory record is flushed to the on-disk B-Tree.
1327 * A referenced record is passed to this function. This function
1328 * eats the reference. If an error occurs the record will be deleted.
1330 * A copy of the temporary record->data pointer provided by the caller
1334 hammer_mem_add(hammer_record_t record)
1336 hammer_mount_t hmp = record->ip->hmp;
1339 * Make a private copy of record->data
1342 KKASSERT(record->flags & HAMMER_RECF_ALLOCDATA);
1345 * Insert into the RB tree. A unique key should have already
1346 * been selected if this is a directory entry.
1348 if (RB_INSERT(hammer_rec_rb_tree, &record->ip->rec_tree, record)) {
1349 record->flags |= HAMMER_RECF_DELETED_FE;
1350 hammer_rel_mem_record(record);
1353 ++hmp->count_newrecords;
1355 ++record->ip->rsv_recs;
1356 record->ip->hmp->rsv_databytes += record->leaf.data_len;
1357 record->flags |= HAMMER_RECF_ONRBTREE;
1358 hammer_modify_inode(record->ip, HAMMER_INODE_XDIRTY);
1359 hammer_rel_mem_record(record);
1363 /************************************************************************
1364 * HAMMER INODE MERGED-RECORD FUNCTIONS *
1365 ************************************************************************
1367 * These functions augment the B-Tree scanning functions in hammer_btree.c
1368 * by merging in-memory records with on-disk records.
1372 * Locate a particular record either in-memory or on-disk.
1374 * NOTE: This is basically a standalone routine, hammer_ip_next() may
1375 * NOT be called to iterate results.
1378 hammer_ip_lookup(hammer_cursor_t cursor)
1383 * If the element is in-memory return it without searching the
1386 KKASSERT(cursor->ip);
1387 error = hammer_mem_lookup(cursor);
1389 cursor->leaf = &cursor->iprec->leaf;
1392 if (error != ENOENT)
1396 * If the inode has on-disk components search the on-disk B-Tree.
1398 if ((cursor->ip->flags & (HAMMER_INODE_ONDISK|HAMMER_INODE_DONDISK)) == 0)
1400 error = hammer_btree_lookup(cursor);
1402 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
1407 * Helper for hammer_ip_first()/hammer_ip_next()
1409 * NOTE: Both ATEDISK and DISKEOF will be set the same. This sets up
1410 * hammer_ip_first() for calling hammer_ip_next(), and sets up the re-seek
1411 * state if hammer_ip_next() needs to re-seek.
1415 _hammer_ip_seek_btree(hammer_cursor_t cursor)
1417 hammer_inode_t ip = cursor->ip;
1420 if (ip->flags & (HAMMER_INODE_ONDISK|HAMMER_INODE_DONDISK)) {
1421 error = hammer_btree_lookup(cursor);
1422 if (error == ENOENT || error == EDEADLK) {
1423 if (hammer_debug_general & 0x2000) {
1424 kprintf("error %d node %p %016llx index %d\n",
1425 error, cursor->node,
1426 (long long)cursor->node->node_offset,
1429 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
1430 error = hammer_btree_iterate(cursor);
1433 cursor->flags &= ~(HAMMER_CURSOR_DISKEOF |
1434 HAMMER_CURSOR_ATEDISK);
1436 cursor->flags |= HAMMER_CURSOR_DISKEOF |
1437 HAMMER_CURSOR_ATEDISK;
1438 if (error == ENOENT)
1442 cursor->flags |= HAMMER_CURSOR_DISKEOF | HAMMER_CURSOR_ATEDISK;
1449 * Helper for hammer_ip_next()
1451 * The caller has determined that the media cursor is further along than the
1452 * memory cursor and must be reseeked after a generation number change.
1456 _hammer_ip_reseek(hammer_cursor_t cursor)
1458 struct hammer_base_elm save;
1459 hammer_btree_elm_t elm;
1467 kprintf("HAMMER: Debug: re-seeked during scan @ino=%016llx\n",
1468 (long long)cursor->ip->obj_id);
1469 save = cursor->key_beg;
1470 cursor->key_beg = cursor->iprec->leaf.base;
1471 error = _hammer_ip_seek_btree(cursor);
1472 KKASSERT(error == 0);
1473 cursor->key_beg = save;
1476 * If the memory record was previous returned to
1477 * the caller and the media record matches
1478 * (-1/+1: only create_tid differs), then iterate
1479 * the media record to avoid a double result.
1481 if ((cursor->flags & HAMMER_CURSOR_ATEDISK) == 0 &&
1482 (cursor->flags & HAMMER_CURSOR_LASTWASMEM)) {
1483 elm = &cursor->node->ondisk->elms[cursor->index];
1484 r = hammer_btree_cmp(&elm->base,
1485 &cursor->iprec->leaf.base);
1486 if (cursor->flags & HAMMER_CURSOR_ASOF) {
1487 if (r >= -1 && r <= 1) {
1488 kprintf("HAMMER: Debug: iterated after "
1489 "re-seek (asof r=%d)\n", r);
1490 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1495 kprintf("HAMMER: Debug: iterated after "
1497 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1506 * Locate the first record within the cursor's key_beg/key_end range,
1507 * restricted to a particular inode. 0 is returned on success, ENOENT
1508 * if no records matched the requested range, or some other error.
1510 * When 0 is returned hammer_ip_next() may be used to iterate additional
1511 * records within the requested range.
1513 * This function can return EDEADLK, requiring the caller to terminate
1514 * the cursor and try again.
1518 hammer_ip_first(hammer_cursor_t cursor)
1520 hammer_inode_t ip = cursor->ip;
1523 KKASSERT(ip != NULL);
1526 * Clean up fields and setup for merged scan
1528 cursor->flags &= ~HAMMER_CURSOR_RETEST;
1531 * Search the in-memory record list (Red-Black tree). Unlike the
1532 * B-Tree search, mem_first checks for records in the range.
1534 * This function will setup both ATEMEM and MEMEOF properly for
1535 * the ip iteration. ATEMEM will be set if MEMEOF is set.
1537 hammer_mem_first(cursor);
1540 * Detect generation changes during blockages, including
1541 * blockages which occur on the initial btree search.
1543 cursor->rec_generation = cursor->ip->rec_generation;
1546 * Initial search and result
1548 error = _hammer_ip_seek_btree(cursor);
1550 error = hammer_ip_next(cursor);
1556 * Retrieve the next record in a merged iteration within the bounds of the
1557 * cursor. This call may be made multiple times after the cursor has been
1558 * initially searched with hammer_ip_first().
1560 * There are numerous special cases in this code to deal with races between
1561 * in-memory records and on-media records.
1563 * 0 is returned on success, ENOENT if no further records match the
1564 * requested range, or some other error code is returned.
1567 hammer_ip_next(hammer_cursor_t cursor)
1569 hammer_btree_elm_t elm;
1570 hammer_record_t rec;
1571 hammer_record_t tmprec;
1577 * Get the next on-disk record
1579 * NOTE: If we deleted the last on-disk record we had scanned
1580 * ATEDISK will be clear and RETEST will be set, forcing
1581 * a call to iterate. The fact that ATEDISK is clear causes
1582 * iterate to re-test the 'current' element. If ATEDISK is
1583 * set, iterate will skip the 'current' element.
1586 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
1587 if (cursor->flags & (HAMMER_CURSOR_ATEDISK |
1588 HAMMER_CURSOR_RETEST)) {
1589 error = hammer_btree_iterate(cursor);
1590 cursor->flags &= ~HAMMER_CURSOR_RETEST;
1592 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
1593 hammer_cache_node(&cursor->ip->cache[1],
1595 } else if (error == ENOENT) {
1596 cursor->flags |= HAMMER_CURSOR_DISKEOF |
1597 HAMMER_CURSOR_ATEDISK;
1604 * If the generation changed the backend has deleted or committed
1605 * one or more memory records since our last check.
1607 * When this case occurs if the disk cursor is > current memory record
1608 * or the disk cursor is at EOF, we must re-seek the disk-cursor.
1609 * Since the cursor is ahead it must have not yet been eaten (if
1610 * not at eof anyway). (XXX data offset case?)
1612 * NOTE: we are not doing a full check here. That will be handled
1615 * If we have exhausted all memory records we do not have to do any
1618 while (cursor->rec_generation != cursor->ip->rec_generation &&
1621 kprintf("HAMMER: Debug: generation changed during scan @ino=%016llx\n", (long long)cursor->ip->obj_id);
1622 cursor->rec_generation = cursor->ip->rec_generation;
1623 if (cursor->flags & HAMMER_CURSOR_MEMEOF)
1625 if (cursor->flags & HAMMER_CURSOR_DISKEOF) {
1628 KKASSERT((cursor->flags & HAMMER_CURSOR_ATEDISK) == 0);
1629 elm = &cursor->node->ondisk->elms[cursor->index];
1630 r = hammer_btree_cmp(&elm->base,
1631 &cursor->iprec->leaf.base);
1635 * Do we re-seek the media cursor?
1638 if (_hammer_ip_reseek(cursor))
1644 * We can now safely get the next in-memory record. We cannot
1647 * hammer_rec_scan_cmp: Is the record still in our general range,
1648 * (non-inclusive of snapshot exclusions)?
1649 * hammer_rec_scan_callback: Is the record in our snapshot?
1652 if ((cursor->flags & HAMMER_CURSOR_MEMEOF) == 0) {
1654 * If the current memory record was eaten then get the next
1655 * one. Stale records are skipped.
1657 if (cursor->flags & HAMMER_CURSOR_ATEMEM) {
1658 tmprec = cursor->iprec;
1659 cursor->iprec = NULL;
1660 rec = hammer_rec_rb_tree_RB_NEXT(tmprec);
1662 if (hammer_rec_scan_cmp(rec, cursor) != 0)
1664 if (hammer_rec_scan_callback(rec, cursor) != 0)
1666 rec = hammer_rec_rb_tree_RB_NEXT(rec);
1668 if (cursor->iprec) {
1669 KKASSERT(cursor->iprec == rec);
1670 cursor->flags &= ~HAMMER_CURSOR_ATEMEM;
1672 cursor->flags |= HAMMER_CURSOR_MEMEOF;
1674 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1679 * MEMORY RECORD VALIDITY TEST
1681 * (We still can't block, which is why tmprec is being held so
1684 * If the memory record is no longer valid we skip it. It may
1685 * have been deleted by the frontend. If it was deleted or
1686 * committed by the backend the generation change re-seeked the
1687 * disk cursor and the record will be present there.
1689 if (error == 0 && (cursor->flags & HAMMER_CURSOR_MEMEOF) == 0) {
1690 KKASSERT(cursor->iprec);
1691 KKASSERT((cursor->flags & HAMMER_CURSOR_ATEMEM) == 0);
1692 if (!hammer_ip_iterate_mem_good(cursor, cursor->iprec)) {
1693 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1695 hammer_rel_mem_record(tmprec);
1700 hammer_rel_mem_record(tmprec);
1703 * Extract either the disk or memory record depending on their
1704 * relative position.
1707 switch(cursor->flags & (HAMMER_CURSOR_ATEDISK | HAMMER_CURSOR_ATEMEM)) {
1710 * Both entries valid. Compare the entries and nominally
1711 * return the first one in the sort order. Numerous cases
1712 * require special attention, however.
1714 elm = &cursor->node->ondisk->elms[cursor->index];
1715 r = hammer_btree_cmp(&elm->base, &cursor->iprec->leaf.base);
1718 * If the two entries differ only by their key (-2/2) or
1719 * create_tid (-1/1), and are DATA records, we may have a
1720 * nominal match. We have to calculate the base file
1721 * offset of the data.
1723 if (r <= 2 && r >= -2 && r != 0 &&
1724 cursor->ip->ino_data.obj_type == HAMMER_OBJTYPE_REGFILE &&
1725 cursor->iprec->type == HAMMER_MEM_RECORD_DATA) {
1726 int64_t base1 = elm->leaf.base.key - elm->leaf.data_len;
1727 int64_t base2 = cursor->iprec->leaf.base.key -
1728 cursor->iprec->leaf.data_len;
1734 error = hammer_btree_extract(cursor,
1735 HAMMER_CURSOR_GET_LEAF);
1736 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1737 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1742 * If the entries match exactly the memory entry is either
1743 * an on-disk directory entry deletion or a bulk data
1744 * overwrite. If it is a directory entry deletion we eat
1747 * For the bulk-data overwrite case it is possible to have
1748 * visibility into both, which simply means the syncer
1749 * hasn't gotten around to doing the delete+insert sequence
1750 * on the B-Tree. Use the memory entry and throw away the
1753 * If the in-memory record is not either of these we
1754 * probably caught the syncer while it was syncing it to
1755 * the media. Since we hold a shared lock on the cursor,
1756 * the in-memory record had better be marked deleted at
1760 if (cursor->iprec->type == HAMMER_MEM_RECORD_DEL) {
1761 if ((cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1762 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1763 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1766 } else if (cursor->iprec->type == HAMMER_MEM_RECORD_DATA) {
1767 if ((cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1768 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1770 /* fall through to memory entry */
1772 panic("hammer_ip_next: duplicate mem/b-tree entry %p %d %08x", cursor->iprec, cursor->iprec->type, cursor->iprec->flags);
1773 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1777 /* fall through to the memory entry */
1778 case HAMMER_CURSOR_ATEDISK:
1780 * Only the memory entry is valid.
1782 cursor->leaf = &cursor->iprec->leaf;
1783 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1784 cursor->flags |= HAMMER_CURSOR_LASTWASMEM;
1787 * If the memory entry is an on-disk deletion we should have
1788 * also had found a B-Tree record. If the backend beat us
1789 * to it it would have interlocked the cursor and we should
1790 * have seen the in-memory record marked DELETED_FE.
1792 if (cursor->iprec->type == HAMMER_MEM_RECORD_DEL &&
1793 (cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1794 panic("hammer_ip_next: del-on-disk with no b-tree entry iprec %p flags %08x", cursor->iprec, cursor->iprec->flags);
1797 case HAMMER_CURSOR_ATEMEM:
1799 * Only the disk entry is valid
1801 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
1802 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1803 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1807 * Neither entry is valid
1809 * XXX error not set properly
1811 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1812 cursor->leaf = NULL;
1820 * Resolve the cursor->data pointer for the current cursor position in
1821 * a merged iteration.
1824 hammer_ip_resolve_data(hammer_cursor_t cursor)
1826 hammer_record_t record;
1829 if (hammer_cursor_inmem(cursor)) {
1831 * The data associated with an in-memory record is usually
1832 * kmalloced, but reserve-ahead data records will have an
1833 * on-disk reference.
1835 * NOTE: Reserve-ahead data records must be handled in the
1836 * context of the related high level buffer cache buffer
1837 * to interlock against async writes.
1839 record = cursor->iprec;
1840 cursor->data = record->data;
1842 if (cursor->data == NULL) {
1843 KKASSERT(record->leaf.base.rec_type ==
1844 HAMMER_RECTYPE_DATA);
1845 cursor->data = hammer_bread_ext(cursor->trans->hmp,
1846 record->leaf.data_offset,
1847 record->leaf.data_len,
1849 &cursor->data_buffer);
1852 cursor->leaf = &cursor->node->ondisk->elms[cursor->index].leaf;
1853 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_DATA);
1859 * Backend truncation / record replacement - delete records in range.
1861 * Delete all records within the specified range for inode ip. In-memory
1862 * records still associated with the frontend are ignored.
1864 * If truncating is non-zero in-memory records associated with the back-end
1865 * are ignored. If truncating is > 1 we can return EWOULDBLOCK.
1869 * * An unaligned range will cause new records to be added to cover
1870 * the edge cases. (XXX not implemented yet).
1872 * * Replacement via reservations (see hammer_ip_sync_record_cursor())
1873 * also do not deal with unaligned ranges.
1875 * * ran_end is inclusive (e.g. 0,1023 instead of 0,1024).
1877 * * Record keys for regular file data have to be special-cased since
1878 * they indicate the end of the range (key = base + bytes).
1880 * * This function may be asked to delete ridiculously huge ranges, for
1881 * example if someone truncates or removes a 1TB regular file. We
1882 * must be very careful on restarts and we may have to stop w/
1883 * EWOULDBLOCK to avoid blowing out the buffer cache.
1886 hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip,
1887 int64_t ran_beg, int64_t ran_end, int truncating)
1889 hammer_transaction_t trans = cursor->trans;
1890 hammer_btree_leaf_elm_t leaf;
1896 kprintf("delete_range %p %016llx-%016llx\n", ip, ran_beg, ran_end);
1899 KKASSERT(trans->type == HAMMER_TRANS_FLS);
1901 hammer_normalize_cursor(cursor);
1902 cursor->key_beg.localization = ip->obj_localization +
1903 HAMMER_LOCALIZE_MISC;
1904 cursor->key_beg.obj_id = ip->obj_id;
1905 cursor->key_beg.create_tid = 0;
1906 cursor->key_beg.delete_tid = 0;
1907 cursor->key_beg.obj_type = 0;
1909 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1910 cursor->key_beg.key = ran_beg;
1911 cursor->key_beg.rec_type = HAMMER_RECTYPE_DB;
1914 * The key in the B-Tree is (base+bytes), so the first possible
1915 * matching key is ran_beg + 1.
1917 cursor->key_beg.key = ran_beg + 1;
1918 cursor->key_beg.rec_type = HAMMER_RECTYPE_DATA;
1921 cursor->key_end = cursor->key_beg;
1922 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1923 cursor->key_end.key = ran_end;
1925 tmp64 = ran_end + MAXPHYS + 1; /* work around GCC-4 bug */
1926 if (tmp64 < ran_end)
1927 cursor->key_end.key = 0x7FFFFFFFFFFFFFFFLL;
1929 cursor->key_end.key = ran_end + MAXPHYS + 1;
1932 cursor->asof = ip->obj_asof;
1933 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
1934 cursor->flags |= HAMMER_CURSOR_ASOF;
1935 cursor->flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
1936 cursor->flags |= HAMMER_CURSOR_BACKEND;
1937 cursor->flags |= HAMMER_CURSOR_END_INCLUSIVE;
1939 error = hammer_ip_first(cursor);
1942 * Iterate through matching records and mark them as deleted.
1944 while (error == 0) {
1945 leaf = cursor->leaf;
1947 KKASSERT(leaf->base.delete_tid == 0);
1948 KKASSERT(leaf->base.obj_id == ip->obj_id);
1951 * There may be overlap cases for regular file data. Also
1952 * remember the key for a regular file record is (base + len),
1955 * Note that do to duplicates (mem & media) allowed by
1956 * DELETE_VISIBILITY, off can wind up less then ran_beg.
1958 if (leaf->base.rec_type == HAMMER_RECTYPE_DATA) {
1959 off = leaf->base.key - leaf->data_len;
1961 * Check the left edge case. We currently do not
1962 * split existing records.
1964 if (off < ran_beg && leaf->base.key > ran_beg) {
1965 panic("hammer left edge case %016llx %d\n",
1966 (long long)leaf->base.key,
1971 * Check the right edge case. Note that the
1972 * record can be completely out of bounds, which
1973 * terminates the search.
1975 * base->key is exclusive of the right edge while
1976 * ran_end is inclusive of the right edge. The
1977 * (key - data_len) left boundary is inclusive.
1979 * XXX theory-check this test at some point, are
1980 * we missing a + 1 somewhere? Note that ran_end
1983 if (leaf->base.key - 1 > ran_end) {
1984 if (leaf->base.key - leaf->data_len > ran_end)
1986 panic("hammer right edge case\n");
1989 off = leaf->base.key;
1993 * Delete the record. When truncating we do not delete
1994 * in-memory (data) records because they represent data
1995 * written after the truncation.
1997 * This will also physically destroy the B-Tree entry and
1998 * data if the retention policy dictates. The function
1999 * will set HAMMER_CURSOR_RETEST to cause hammer_ip_next()
2000 * to retest the new 'current' element.
2002 if (truncating == 0 || hammer_cursor_ondisk(cursor)) {
2003 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2005 * If we have built up too many meta-buffers we risk
2006 * deadlocking the kernel and must stop. This can
2007 * occur when deleting ridiculously huge files.
2008 * sync_trunc_off is updated so the next cycle does
2009 * not re-iterate records we have already deleted.
2011 * This is only done with formal truncations.
2013 if (truncating > 1 && error == 0 &&
2014 hammer_flusher_meta_limit(ip->hmp)) {
2015 ip->sync_trunc_off = off;
2016 error = EWOULDBLOCK;
2021 ran_beg = off; /* for restart */
2022 error = hammer_ip_next(cursor);
2025 hammer_cache_node(&ip->cache[1], cursor->node);
2027 if (error == EDEADLK) {
2028 hammer_done_cursor(cursor);
2029 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2033 if (error == ENOENT)
2039 * This backend function deletes the specified record on-disk, similar to
2040 * delete_range but for a specific record. Unlike the exact deletions
2041 * used when deleting a directory entry this function uses an ASOF search
2042 * like delete_range.
2044 * This function may be called with ip->obj_asof set for a slave snapshot,
2045 * so don't use it. We always delete non-historical records only.
2048 hammer_delete_general(hammer_cursor_t cursor, hammer_inode_t ip,
2049 hammer_btree_leaf_elm_t leaf)
2051 hammer_transaction_t trans = cursor->trans;
2054 KKASSERT(trans->type == HAMMER_TRANS_FLS);
2056 hammer_normalize_cursor(cursor);
2057 cursor->key_beg = leaf->base;
2058 cursor->asof = HAMMER_MAX_TID;
2059 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
2060 cursor->flags |= HAMMER_CURSOR_ASOF;
2061 cursor->flags |= HAMMER_CURSOR_BACKEND;
2062 cursor->flags &= ~HAMMER_CURSOR_INSERT;
2064 error = hammer_btree_lookup(cursor);
2066 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2068 if (error == EDEADLK) {
2069 hammer_done_cursor(cursor);
2070 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2078 * This function deletes remaining auxillary records when an inode is
2079 * being deleted. This function explicitly does not delete the
2080 * inode record, directory entry, data, or db records. Those must be
2081 * properly disposed of prior to this call.
2084 hammer_ip_delete_clean(hammer_cursor_t cursor, hammer_inode_t ip, int *countp)
2086 hammer_transaction_t trans = cursor->trans;
2087 hammer_btree_leaf_elm_t leaf;
2090 KKASSERT(trans->type == HAMMER_TRANS_FLS);
2092 hammer_normalize_cursor(cursor);
2093 cursor->key_beg.localization = ip->obj_localization +
2094 HAMMER_LOCALIZE_MISC;
2095 cursor->key_beg.obj_id = ip->obj_id;
2096 cursor->key_beg.create_tid = 0;
2097 cursor->key_beg.delete_tid = 0;
2098 cursor->key_beg.obj_type = 0;
2099 cursor->key_beg.rec_type = HAMMER_RECTYPE_CLEAN_START;
2100 cursor->key_beg.key = HAMMER_MIN_KEY;
2102 cursor->key_end = cursor->key_beg;
2103 cursor->key_end.rec_type = HAMMER_RECTYPE_MAX;
2104 cursor->key_end.key = HAMMER_MAX_KEY;
2106 cursor->asof = ip->obj_asof;
2107 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
2108 cursor->flags |= HAMMER_CURSOR_END_INCLUSIVE | HAMMER_CURSOR_ASOF;
2109 cursor->flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
2110 cursor->flags |= HAMMER_CURSOR_BACKEND;
2112 error = hammer_ip_first(cursor);
2115 * Iterate through matching records and mark them as deleted.
2117 while (error == 0) {
2118 leaf = cursor->leaf;
2120 KKASSERT(leaf->base.delete_tid == 0);
2123 * Mark the record and B-Tree entry as deleted. This will
2124 * also physically delete the B-Tree entry, record, and
2125 * data if the retention policy dictates. The function
2126 * will set HAMMER_CURSOR_RETEST to cause hammer_ip_next()
2127 * to retest the new 'current' element.
2129 * Directory entries (and delete-on-disk directory entries)
2130 * must be synced and cannot be deleted.
2132 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2136 error = hammer_ip_next(cursor);
2139 hammer_cache_node(&ip->cache[1], cursor->node);
2140 if (error == EDEADLK) {
2141 hammer_done_cursor(cursor);
2142 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2146 if (error == ENOENT)
2152 * Delete the record at the current cursor. On success the cursor will
2153 * be positioned appropriately for an iteration but may no longer be at
2156 * This routine is only called from the backend.
2158 * NOTE: This can return EDEADLK, requiring the caller to terminate the
2162 hammer_ip_delete_record(hammer_cursor_t cursor, hammer_inode_t ip,
2165 hammer_record_t iprec;
2169 KKASSERT(cursor->flags & HAMMER_CURSOR_BACKEND);
2171 hmp = cursor->node->hmp;
2174 * In-memory (unsynchronized) records can simply be freed. This
2175 * only occurs in range iterations since all other records are
2176 * individually synchronized. Thus there should be no confusion with
2179 * An in-memory record may be deleted before being committed to disk,
2180 * but could have been accessed in the mean time. The reservation
2181 * code will deal with the case.
2183 if (hammer_cursor_inmem(cursor)) {
2184 iprec = cursor->iprec;
2185 KKASSERT((iprec->flags & HAMMER_RECF_INTERLOCK_BE) ==0);
2186 iprec->flags |= HAMMER_RECF_DELETED_FE;
2187 iprec->flags |= HAMMER_RECF_DELETED_BE;
2188 KKASSERT(iprec->ip == ip);
2189 ++ip->rec_generation;
2194 * On-disk records are marked as deleted by updating their delete_tid.
2195 * This does not effect their position in the B-Tree (which is based
2196 * on their create_tid).
2198 * Frontend B-Tree operations track inodes so we tell
2199 * hammer_delete_at_cursor() not to.
2201 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
2204 error = hammer_delete_at_cursor(
2206 HAMMER_DELETE_ADJUST | hammer_nohistory(ip),
2208 cursor->trans->time32,
2215 * Used to write a generic record w/optional data to the media b-tree
2216 * when no inode context is available. Used by the mirroring and
2219 * Caller must set cursor->key_beg to leaf->base. The cursor must be
2220 * flagged for backend operation and not flagged ASOF (since we are
2221 * doing an insertion).
2223 * This function will acquire the appropriate sync lock and will set
2224 * the cursor insertion flag for the operation, do the btree lookup,
2225 * and the insertion, and clear the insertion flag and sync lock before
2226 * returning. The cursor state will be such that the caller can continue
2227 * scanning (used by the mirroring code).
2229 * mode: HAMMER_CREATE_MODE_UMIRROR copyin data, check crc
2230 * HAMMER_CREATE_MODE_SYS bcopy data, generate crc
2232 * NOTE: EDEADLK can be returned. The caller must do deadlock handling and
2235 * EALREADY can be returned if the record already exists (WARNING,
2236 * because ASOF cannot be used no check is made for illegal
2239 * NOTE: Do not use the function for normal inode-related records as this
2240 * functions goes directly to the media and is not integrated with
2241 * in-memory records.
2244 hammer_create_at_cursor(hammer_cursor_t cursor, hammer_btree_leaf_elm_t leaf,
2245 void *udata, int mode)
2247 hammer_transaction_t trans;
2248 hammer_buffer_t data_buffer;
2249 hammer_off_t ndata_offset;
2250 hammer_tid_t high_tid;
2255 trans = cursor->trans;
2260 KKASSERT((cursor->flags &
2261 (HAMMER_CURSOR_BACKEND | HAMMER_CURSOR_ASOF)) ==
2262 (HAMMER_CURSOR_BACKEND));
2264 hammer_sync_lock_sh(trans);
2266 if (leaf->data_len) {
2267 ndata = hammer_alloc_data(trans, leaf->data_len,
2268 leaf->base.rec_type,
2269 &ndata_offset, &data_buffer,
2271 if (ndata == NULL) {
2272 hammer_sync_unlock(trans);
2275 leaf->data_offset = ndata_offset;
2276 hammer_modify_buffer(trans, data_buffer, NULL, 0);
2279 case HAMMER_CREATE_MODE_UMIRROR:
2280 error = copyin(udata, ndata, leaf->data_len);
2282 if (hammer_crc_test_leaf(ndata, leaf) == 0) {
2283 kprintf("data crc mismatch on pipe\n");
2286 error = hammer_cursor_localize_data(
2291 case HAMMER_CREATE_MODE_SYS:
2292 bcopy(udata, ndata, leaf->data_len);
2294 hammer_crc_set_leaf(ndata, leaf);
2297 panic("hammer: hammer_create_at_cursor: bad mode %d",
2299 break; /* NOT REACHED */
2301 hammer_modify_buffer_done(data_buffer);
2303 leaf->data_offset = 0;
2311 * Do the insertion. This can fail with a EDEADLK or EALREADY
2313 cursor->flags |= HAMMER_CURSOR_INSERT;
2314 error = hammer_btree_lookup(cursor);
2315 if (error != ENOENT) {
2320 error = hammer_btree_insert(cursor, leaf, &doprop);
2323 * Cursor is left on current element, we want to skip it now.
2324 * (in case the caller is scanning)
2326 cursor->flags |= HAMMER_CURSOR_ATEDISK;
2327 cursor->flags &= ~HAMMER_CURSOR_INSERT;
2330 * If the insertion happens to be creating (and not just replacing)
2331 * an inode we have to track it.
2334 leaf->base.rec_type == HAMMER_RECTYPE_INODE &&
2335 leaf->base.delete_tid == 0) {
2336 hammer_modify_volume_field(trans, trans->rootvol,
2338 ++trans->hmp->rootvol->ondisk->vol0_stat_inodes;
2339 hammer_modify_volume_done(trans->rootvol);
2343 * vol0_next_tid must track the highest TID stored in the filesystem.
2344 * We do not need to generate undo for this update.
2346 high_tid = leaf->base.create_tid;
2347 if (high_tid < leaf->base.delete_tid)
2348 high_tid = leaf->base.delete_tid;
2349 if (trans->rootvol->ondisk->vol0_next_tid < high_tid) {
2350 hammer_modify_volume(trans, trans->rootvol, NULL, 0);
2351 trans->rootvol->ondisk->vol0_next_tid = high_tid;
2352 hammer_modify_volume_done(trans->rootvol);
2356 * WARNING! cursor's leaf pointer may have changed after
2357 * do_propagation returns.
2359 if (error == 0 && doprop)
2360 hammer_btree_do_propagation(cursor, NULL, leaf);
2366 if (error && leaf->data_offset) {
2367 hammer_blockmap_free(trans, leaf->data_offset, leaf->data_len);
2370 hammer_sync_unlock(trans);
2372 hammer_rel_buffer(data_buffer, 0);
2377 * Delete the B-Tree element at the current cursor and do any necessary
2378 * mirror propagation.
2380 * The cursor must be properly positioned for an iteration on return but
2381 * may be pointing at an internal element.
2383 * An element can be un-deleted by passing a delete_tid of 0 with
2384 * HAMMER_DELETE_ADJUST.
2387 hammer_delete_at_cursor(hammer_cursor_t cursor, int delete_flags,
2388 hammer_tid_t delete_tid, u_int32_t delete_ts,
2389 int track, int64_t *stat_bytes)
2391 struct hammer_btree_leaf_elm save_leaf;
2392 hammer_transaction_t trans;
2393 hammer_btree_leaf_elm_t leaf;
2395 hammer_btree_elm_t elm;
2396 hammer_off_t data_offset;
2403 error = hammer_cursor_upgrade(cursor);
2407 trans = cursor->trans;
2408 node = cursor->node;
2409 elm = &node->ondisk->elms[cursor->index];
2411 KKASSERT(elm->base.btype == HAMMER_BTREE_TYPE_RECORD);
2413 hammer_sync_lock_sh(trans);
2418 * Adjust the delete_tid. Update the mirror_tid propagation field
2419 * as well. delete_tid can be 0 (undelete -- used by mirroring).
2421 if (delete_flags & HAMMER_DELETE_ADJUST) {
2422 if (elm->base.rec_type == HAMMER_RECTYPE_INODE) {
2423 if (elm->leaf.base.delete_tid == 0 && delete_tid)
2425 if (elm->leaf.base.delete_tid && delete_tid == 0)
2429 hammer_modify_node(trans, node, elm, sizeof(*elm));
2430 elm->leaf.base.delete_tid = delete_tid;
2431 elm->leaf.delete_ts = delete_ts;
2432 hammer_modify_node_done(node);
2434 if (elm->leaf.base.delete_tid > node->ondisk->mirror_tid) {
2435 hammer_modify_node_field(trans, node, mirror_tid);
2436 node->ondisk->mirror_tid = elm->leaf.base.delete_tid;
2437 hammer_modify_node_done(node);
2439 if (hammer_debug_general & 0x0002) {
2440 kprintf("delete_at_cursor: propagate %016llx"
2442 (long long)elm->leaf.base.delete_tid,
2443 (long long)node->node_offset);
2448 * Adjust for the iteration. We have deleted the current
2449 * element and want to clear ATEDISK so the iteration does
2450 * not skip the element after, which now becomes the current
2451 * element. This element must be re-tested if doing an
2452 * iteration, which is handled by the RETEST flag.
2454 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
2455 cursor->flags |= HAMMER_CURSOR_RETEST;
2456 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
2460 * An on-disk record cannot have the same delete_tid
2461 * as its create_tid. In a chain of record updates
2462 * this could result in a duplicate record.
2464 KKASSERT(elm->leaf.base.delete_tid !=
2465 elm->leaf.base.create_tid);
2469 * Destroy the B-Tree element if asked (typically if a nohistory
2470 * file or mount, or when called by the pruning code).
2472 * Adjust the ATEDISK flag to properly support iterations.
2474 if (delete_flags & HAMMER_DELETE_DESTROY) {
2475 data_offset = elm->leaf.data_offset;
2476 data_len = elm->leaf.data_len;
2477 rec_type = elm->leaf.base.rec_type;
2479 save_leaf = elm->leaf;
2482 if (elm->base.rec_type == HAMMER_RECTYPE_INODE &&
2483 elm->leaf.base.delete_tid == 0) {
2487 error = hammer_btree_delete(cursor);
2490 * The deletion moves the next element (if any) to
2491 * the current element position. We must clear
2492 * ATEDISK so this element is not skipped and we
2493 * must set RETEST to force any iteration to re-test
2496 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
2497 cursor->flags |= HAMMER_CURSOR_RETEST;
2498 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
2502 switch(data_offset & HAMMER_OFF_ZONE_MASK) {
2503 case HAMMER_ZONE_LARGE_DATA:
2504 case HAMMER_ZONE_SMALL_DATA:
2505 case HAMMER_ZONE_META:
2506 hammer_blockmap_free(trans,
2507 data_offset, data_len);
2516 * Track inode count and next_tid. This is used by the mirroring
2517 * and PFS code. icount can be negative, zero, or positive.
2519 if (error == 0 && track) {
2521 hammer_modify_volume_field(trans, trans->rootvol,
2523 trans->rootvol->ondisk->vol0_stat_inodes += icount;
2524 hammer_modify_volume_done(trans->rootvol);
2526 if (trans->rootvol->ondisk->vol0_next_tid < delete_tid) {
2527 hammer_modify_volume(trans, trans->rootvol, NULL, 0);
2528 trans->rootvol->ondisk->vol0_next_tid = delete_tid;
2529 hammer_modify_volume_done(trans->rootvol);
2534 * mirror_tid propagation occurs if the node's mirror_tid had to be
2535 * updated while adjusting the delete_tid.
2537 * This occurs when deleting even in nohistory mode, but does not
2538 * occur when pruning an already-deleted node.
2540 * cursor->ip is NULL when called from the pruning, mirroring,
2541 * and pfs code. If non-NULL propagation will be conditionalized
2542 * on whether the PFS is in no-history mode or not.
2544 * WARNING: cursor's leaf pointer may have changed after do_propagation
2549 hammer_btree_do_propagation(cursor, cursor->ip->pfsm, leaf);
2551 hammer_btree_do_propagation(cursor, NULL, leaf);
2553 hammer_sync_unlock(trans);
2558 * Determine whether we can remove a directory. This routine checks whether
2559 * a directory is empty or not and enforces flush connectivity.
2561 * Flush connectivity requires that we block if the target directory is
2562 * currently flushing, otherwise it may not end up in the same flush group.
2564 * Returns 0 on success, ENOTEMPTY or EDEADLK (or other errors) on failure.
2567 hammer_ip_check_directory_empty(hammer_transaction_t trans, hammer_inode_t ip)
2569 struct hammer_cursor cursor;
2573 * Check directory empty
2575 hammer_init_cursor(trans, &cursor, &ip->cache[1], ip);
2577 cursor.key_beg.localization = ip->obj_localization +
2578 hammer_dir_localization(ip);
2579 cursor.key_beg.obj_id = ip->obj_id;
2580 cursor.key_beg.create_tid = 0;
2581 cursor.key_beg.delete_tid = 0;
2582 cursor.key_beg.obj_type = 0;
2583 cursor.key_beg.rec_type = HAMMER_RECTYPE_INODE + 1;
2584 cursor.key_beg.key = HAMMER_MIN_KEY;
2586 cursor.key_end = cursor.key_beg;
2587 cursor.key_end.rec_type = 0xFFFF;
2588 cursor.key_end.key = HAMMER_MAX_KEY;
2590 cursor.asof = ip->obj_asof;
2591 cursor.flags |= HAMMER_CURSOR_END_INCLUSIVE | HAMMER_CURSOR_ASOF;
2593 error = hammer_ip_first(&cursor);
2594 if (error == ENOENT)
2596 else if (error == 0)
2598 hammer_done_cursor(&cursor);
2603 * Localize the data payload. Directory entries may need their
2604 * localization adjusted.
2608 hammer_cursor_localize_data(hammer_data_ondisk_t data,
2609 hammer_btree_leaf_elm_t leaf)
2611 u_int32_t localization;
2613 if (leaf->base.rec_type == HAMMER_RECTYPE_DIRENTRY) {
2614 localization = leaf->base.localization &
2615 HAMMER_LOCALIZE_PSEUDOFS_MASK;
2616 if (data->entry.localization != localization) {
2617 data->entry.localization = localization;
2618 hammer_crc_set_leaf(data, leaf);