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
37 static int hammer_mem_lookup(hammer_cursor_t cursor);
38 static void hammer_mem_first(hammer_cursor_t cursor);
39 static int hammer_frontend_trunc_callback(hammer_record_t record,
41 static int hammer_bulk_scan_callback(hammer_record_t record, void *data);
42 static int hammer_record_needs_overwrite_delete(hammer_record_t record);
43 static int hammer_delete_general(hammer_cursor_t cursor, hammer_inode_t ip,
44 hammer_btree_leaf_elm_t leaf);
45 static int hammer_cursor_localize_data(hammer_data_ondisk_t data,
46 hammer_btree_leaf_elm_t leaf);
48 struct rec_trunc_info {
53 struct hammer_bulk_info {
54 hammer_record_t record;
55 hammer_record_t conflict;
59 * Red-black tree support. Comparison code for insertion.
62 hammer_rec_rb_compare(hammer_record_t rec1, hammer_record_t rec2)
64 if (rec1->leaf.base.rec_type < rec2->leaf.base.rec_type)
66 if (rec1->leaf.base.rec_type > rec2->leaf.base.rec_type)
69 if (rec1->leaf.base.key < rec2->leaf.base.key)
71 if (rec1->leaf.base.key > rec2->leaf.base.key)
75 * For search & insertion purposes records deleted by the
76 * frontend or deleted/committed by the backend are silently
77 * ignored. Otherwise pipelined insertions will get messed
80 * rec1 is greater then rec2 if rec1 is marked deleted.
81 * rec1 is less then rec2 if rec2 is marked deleted.
83 * Multiple deleted records may be present, do not return 0
84 * if both are marked deleted.
86 if (rec1->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
87 HAMMER_RECF_COMMITTED)) {
90 if (rec2->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
91 HAMMER_RECF_COMMITTED)) {
99 * Basic record comparison code similar to hammer_btree_cmp().
101 * obj_id is not compared and may not yet be assigned in the record.
104 hammer_rec_cmp(hammer_base_elm_t elm, hammer_record_t rec)
106 if (elm->rec_type < rec->leaf.base.rec_type)
108 if (elm->rec_type > rec->leaf.base.rec_type)
111 if (elm->key < rec->leaf.base.key)
113 if (elm->key > rec->leaf.base.key)
117 * Never match against an item deleted by the frontend
118 * or backend, or committed by the backend.
120 * elm is less then rec if rec is marked deleted.
122 if (rec->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
123 HAMMER_RECF_COMMITTED)) {
130 * Ranged scan to locate overlapping record(s). This is used by
131 * hammer_ip_get_bulk() to locate an overlapping record. We have
132 * to use a ranged scan because the keys for data records with the
133 * same file base offset can be different due to differing data_len's.
135 * NOTE: The base file offset of a data record is (key - data_len), not (key).
138 hammer_rec_overlap_cmp(hammer_record_t rec, void *data)
140 struct hammer_bulk_info *info = data;
141 hammer_btree_leaf_elm_t leaf = &info->record->leaf;
143 if (rec->leaf.base.rec_type < leaf->base.rec_type)
145 if (rec->leaf.base.rec_type > leaf->base.rec_type)
151 if (leaf->base.rec_type == HAMMER_RECTYPE_DATA) {
152 /* rec_beg >= leaf_end */
153 if (rec->leaf.base.key - rec->leaf.data_len >= leaf->base.key)
155 /* rec_end <= leaf_beg */
156 if (rec->leaf.base.key <= leaf->base.key - leaf->data_len)
159 if (rec->leaf.base.key < leaf->base.key)
161 if (rec->leaf.base.key > leaf->base.key)
166 * We have to return 0 at this point, even if DELETED_FE is set,
167 * because returning anything else will cause the scan to ignore
168 * one of the branches when we really want it to check both.
174 * RB_SCAN comparison code for hammer_mem_first(). The argument order
175 * is reversed so the comparison result has to be negated. key_beg and
176 * key_end are both range-inclusive.
178 * Localized deletions are not cached in-memory.
182 hammer_rec_scan_cmp(hammer_record_t rec, void *data)
184 hammer_cursor_t cursor = data;
187 r = hammer_rec_cmp(&cursor->key_beg, rec);
190 r = hammer_rec_cmp(&cursor->key_end, rec);
197 * This compare function is used when simply looking up key_beg.
201 hammer_rec_find_cmp(hammer_record_t rec, void *data)
203 hammer_cursor_t cursor = data;
206 r = hammer_rec_cmp(&cursor->key_beg, rec);
215 * Locate blocks within the truncation range. Partial blocks do not count.
219 hammer_rec_trunc_cmp(hammer_record_t rec, void *data)
221 struct rec_trunc_info *info = data;
223 if (rec->leaf.base.rec_type < info->rec_type)
225 if (rec->leaf.base.rec_type > info->rec_type)
228 switch(rec->leaf.base.rec_type) {
229 case HAMMER_RECTYPE_DB:
231 * DB record key is not beyond the truncation point, retain.
233 if (rec->leaf.base.key < info->trunc_off)
236 case HAMMER_RECTYPE_DATA:
238 * DATA record offset start is not beyond the truncation point,
241 if (rec->leaf.base.key - rec->leaf.data_len < info->trunc_off)
245 panic("hammer_rec_trunc_cmp: unexpected record type");
249 * The record start is >= the truncation point, return match,
250 * the record should be destroyed.
255 RB_GENERATE(hammer_rec_rb_tree, hammer_record, rb_node, hammer_rec_rb_compare);
258 * Allocate a record for the caller to finish filling in. The record is
259 * returned referenced. In order to manually set data call this function
260 * with data_len=0 and then manually set record->leaf.data_len and
261 * record->data later.
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_rel(&record->lock);
374 if (hammer_norefs(&record->lock)) {
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(hammer_isactive(&ip->lock) > 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 RB-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);
418 if (RB_EMPTY(&record->ip->rec_tree)) {
420 ~HAMMER_INODE_XDIRTY;
421 record->ip->sync_flags &=
422 ~HAMMER_INODE_XDIRTY;
430 * We must wait for any direct-IO to complete before
431 * we can destroy the record because the bio may
432 * have a reference to it.
435 (HAMMER_RECG_DIRECT_IO | HAMMER_RECG_DIRECT_INVAL)) {
436 hammer_io_direct_wait(record);
440 * Account for the completion after the direct IO
446 hmp->rsv_databytes -= record->leaf.data_len;
448 if (RB_EMPTY(&record->ip->rec_tree))
449 hammer_test_inode(record->ip);
450 if ((ip->flags & HAMMER_INODE_RECSW) &&
451 ip->rsv_recs <= hammer_limit_inode_recs/2) {
452 ip->flags &= ~HAMMER_INODE_RECSW;
453 wakeup(&ip->rsv_recs);
458 * Do this test after removing record from the RB-Tree.
461 hammer_test_inode(target_ip);
462 hammer_rel_inode(target_ip, 0);
465 if (record->flags & HAMMER_RECF_ALLOCDATA) {
466 --hammer_count_record_datas;
467 kfree(record->data, hmp->m_misc);
468 record->flags &= ~HAMMER_RECF_ALLOCDATA;
472 * Release the reservation.
474 * If the record was not committed we can theoretically
475 * undo the reservation. However, doing so might
476 * create weird edge cases with the ordering of
477 * direct writes because the related buffer cache
478 * elements are per-vnode. So we don't try.
480 if ((resv = record->resv) != NULL) {
481 /* XXX undo leaf.data_offset,leaf.data_len */
482 hammer_blockmap_reserve_complete(hmp, resv);
486 --hammer_count_records;
487 kfree(record, hmp->m_misc);
493 * Record visibility depends on whether the record is being accessed by
494 * the backend or the frontend. Backend tests ignore the frontend delete
495 * flag. Frontend tests do NOT ignore the backend delete/commit flags and
496 * must also check for commit races.
498 * Return non-zero if the record is visible, zero if it isn't or if it is
499 * deleted. Returns 0 if the record has been comitted (unless the special
500 * delete-visibility flag is set). A committed record must be located
501 * via the media B-Tree. Returns non-zero if the record is good.
503 * If HAMMER_CURSOR_DELETE_VISIBILITY is set we allow deleted memory
504 * records to be returned. This is so pending deletions are detected
505 * when using an iterator to locate an unused hash key, or when we need
506 * to locate historical records on-disk to destroy.
510 hammer_ip_iterate_mem_good(hammer_cursor_t cursor, hammer_record_t record)
512 if (cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY)
514 if (cursor->flags & HAMMER_CURSOR_BACKEND) {
515 if (record->flags & (HAMMER_RECF_DELETED_BE |
516 HAMMER_RECF_COMMITTED)) {
520 if (record->flags & (HAMMER_RECF_DELETED_FE |
521 HAMMER_RECF_DELETED_BE |
522 HAMMER_RECF_COMMITTED)) {
530 * This callback is used as part of the RB_SCAN function for in-memory
531 * records. We terminate it (return -1) as soon as we get a match.
533 * This routine is used by frontend code.
535 * The primary compare code does not account for ASOF lookups. This
536 * code handles that case as well as a few others.
540 hammer_rec_scan_callback(hammer_record_t rec, void *data)
542 hammer_cursor_t cursor = data;
545 * We terminate on success, so this should be NULL on entry.
547 KKASSERT(cursor->iprec == NULL);
550 * Skip if the record was marked deleted or committed.
552 if (hammer_ip_iterate_mem_good(cursor, rec) == 0)
556 * Skip if not visible due to our as-of TID
558 if (cursor->flags & HAMMER_CURSOR_ASOF) {
559 if (cursor->asof < rec->leaf.base.create_tid)
561 if (rec->leaf.base.delete_tid &&
562 cursor->asof >= rec->leaf.base.delete_tid) {
568 * ref the record. The record is protected from backend B-Tree
569 * interactions by virtue of the cursor's IP lock.
571 hammer_ref(&rec->lock);
574 * The record may have been deleted or committed while we
575 * were blocked. XXX remove?
577 if (hammer_ip_iterate_mem_good(cursor, rec) == 0) {
578 hammer_rel_mem_record(rec);
583 * Set the matching record and stop the scan.
591 * Lookup an in-memory record given the key specified in the cursor. Works
592 * just like hammer_btree_lookup() but operates on an inode's in-memory
595 * The lookup must fail if the record is marked for deferred deletion.
597 * The API for mem/btree_lookup() does not mess with the ATE/EOF bits.
601 hammer_mem_lookup(hammer_cursor_t cursor)
603 KKASSERT(cursor->ip);
605 hammer_rel_mem_record(cursor->iprec);
606 cursor->iprec = NULL;
608 hammer_rec_rb_tree_RB_SCAN(&cursor->ip->rec_tree, hammer_rec_find_cmp,
609 hammer_rec_scan_callback, cursor);
611 return (cursor->iprec ? 0 : ENOENT);
615 * hammer_mem_first() - locate the first in-memory record matching the
616 * cursor within the bounds of the key range.
618 * WARNING! API is slightly different from btree_first(). hammer_mem_first()
619 * will set ATEMEM the same as MEMEOF, and does not return any error.
623 hammer_mem_first(hammer_cursor_t cursor)
628 KKASSERT(ip != NULL);
631 hammer_rel_mem_record(cursor->iprec);
632 cursor->iprec = NULL;
634 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_scan_cmp,
635 hammer_rec_scan_callback, cursor);
638 cursor->flags &= ~(HAMMER_CURSOR_MEMEOF | HAMMER_CURSOR_ATEMEM);
640 cursor->flags |= HAMMER_CURSOR_MEMEOF | HAMMER_CURSOR_ATEMEM;
643 /************************************************************************
644 * HAMMER IN-MEMORY RECORD FUNCTIONS *
645 ************************************************************************
647 * These functions manipulate in-memory records. Such records typically
648 * exist prior to being committed to disk or indexed via the on-disk B-Tree.
652 * Add a directory entry (dip,ncp) which references inode (ip).
654 * Note that the low 32 bits of the namekey are set temporarily to create
655 * a unique in-memory record, and may be modified a second time when the
656 * record is synchronized to disk. In particular, the low 32 bits cannot be
657 * all 0's when synching to disk, which is not handled here.
659 * NOTE: bytes does not include any terminating \0 on name, and name might
663 hammer_ip_add_directory(struct hammer_transaction *trans,
664 struct hammer_inode *dip, const char *name, int bytes,
665 struct hammer_inode *ip)
667 struct hammer_cursor cursor;
668 hammer_record_t record;
670 u_int32_t max_iterations;
672 KKASSERT(dip->ino_data.obj_type == HAMMER_OBJTYPE_DIRECTORY);
674 record = hammer_alloc_mem_record(dip, HAMMER_ENTRY_SIZE(bytes));
676 record->type = HAMMER_MEM_RECORD_ADD;
677 record->leaf.base.localization = dip->obj_localization +
678 hammer_dir_localization(dip);
679 record->leaf.base.obj_id = dip->obj_id;
680 record->leaf.base.key = hammer_directory_namekey(dip, name, bytes,
682 record->leaf.base.rec_type = HAMMER_RECTYPE_DIRENTRY;
683 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
684 record->data->entry.obj_id = ip->obj_id;
685 record->data->entry.localization = ip->obj_localization;
686 bcopy(name, record->data->entry.name, bytes);
688 ++ip->ino_data.nlinks;
689 ip->ino_data.ctime = trans->time;
690 hammer_modify_inode(trans, ip, HAMMER_INODE_DDIRTY);
693 * Find an unused namekey. Both the in-memory record tree and
694 * the B-Tree are checked. We do not want historically deleted
695 * names to create a collision as our iteration space may be limited,
696 * and since create_tid wouldn't match anyway an ASOF search
697 * must be used to locate collisions.
699 * delete-visibility is set so pending deletions do not give us
700 * a false-negative on our ability to use an iterator.
702 * The iterator must not rollover the key. Directory keys only
703 * use the positive key space.
705 hammer_init_cursor(trans, &cursor, &dip->cache[1], dip);
706 cursor.key_beg = record->leaf.base;
707 cursor.flags |= HAMMER_CURSOR_ASOF;
708 cursor.flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
709 cursor.asof = ip->obj_asof;
711 while (hammer_ip_lookup(&cursor) == 0) {
712 ++record->leaf.base.key;
713 KKASSERT(record->leaf.base.key > 0);
714 cursor.key_beg.key = record->leaf.base.key;
715 if (--max_iterations == 0) {
716 hammer_rel_mem_record(record);
723 * The target inode and the directory entry are bound together.
725 record->target_ip = ip;
726 record->flush_state = HAMMER_FST_SETUP;
727 TAILQ_INSERT_TAIL(&ip->target_list, record, target_entry);
730 * The inode now has a dependancy and must be taken out of the idle
731 * state. An inode not in an idle state is given an extra reference.
733 * When transitioning to a SETUP state flag for an automatic reflush
734 * when the dependancies are disposed of if someone is waiting on
737 if (ip->flush_state == HAMMER_FST_IDLE) {
738 hammer_ref(&ip->lock);
739 ip->flush_state = HAMMER_FST_SETUP;
740 if (ip->flags & HAMMER_INODE_FLUSHW)
741 ip->flags |= HAMMER_INODE_REFLUSH;
743 error = hammer_mem_add(record);
745 dip->ino_data.mtime = trans->time;
746 hammer_modify_inode(trans, dip, HAMMER_INODE_MTIME);
749 hammer_done_cursor(&cursor);
754 * Delete the directory entry and update the inode link count. The
755 * cursor must be seeked to the directory entry record being deleted.
757 * The related inode should be share-locked by the caller. The caller is
758 * on the frontend. It could also be NULL indicating that the directory
759 * entry being removed has no related inode.
761 * This function can return EDEADLK requiring the caller to terminate
762 * the cursor, any locks, wait on the returned record, and retry.
765 hammer_ip_del_directory(struct hammer_transaction *trans,
766 hammer_cursor_t cursor, struct hammer_inode *dip,
767 struct hammer_inode *ip)
769 hammer_record_t record;
772 if (hammer_cursor_inmem(cursor)) {
774 * In-memory (unsynchronized) records can simply be freed.
776 * Even though the HAMMER_RECF_DELETED_FE flag is ignored
777 * by the backend, we must still avoid races against the
778 * backend potentially syncing the record to the media.
780 * We cannot call hammer_ip_delete_record(), that routine may
781 * only be called from the backend.
783 record = cursor->iprec;
784 if (record->flags & (HAMMER_RECF_INTERLOCK_BE |
785 HAMMER_RECF_DELETED_BE |
786 HAMMER_RECF_COMMITTED)) {
787 KKASSERT(cursor->deadlk_rec == NULL);
788 hammer_ref(&record->lock);
789 cursor->deadlk_rec = record;
792 KKASSERT(record->type == HAMMER_MEM_RECORD_ADD);
793 record->flags |= HAMMER_RECF_DELETED_FE;
798 * If the record is on-disk we have to queue the deletion by
799 * the record's key. This also causes lookups to skip the
800 * record (lookups for the purposes of finding an unused
801 * directory key do not skip the record).
803 KKASSERT(dip->flags &
804 (HAMMER_INODE_ONDISK | HAMMER_INODE_DONDISK));
805 record = hammer_alloc_mem_record(dip, 0);
806 record->type = HAMMER_MEM_RECORD_DEL;
807 record->leaf.base = cursor->leaf->base;
808 KKASSERT(dip->obj_id == record->leaf.base.obj_id);
811 * ip may be NULL, indicating the deletion of a directory
812 * entry which has no related inode.
814 record->target_ip = ip;
816 record->flush_state = HAMMER_FST_SETUP;
817 TAILQ_INSERT_TAIL(&ip->target_list, record,
820 record->flush_state = HAMMER_FST_IDLE;
824 * The inode now has a dependancy and must be taken out of
825 * the idle state. An inode not in an idle state is given
826 * an extra reference.
828 * When transitioning to a SETUP state flag for an automatic
829 * reflush when the dependancies are disposed of if someone
830 * is waiting on the inode.
832 if (ip && ip->flush_state == HAMMER_FST_IDLE) {
833 hammer_ref(&ip->lock);
834 ip->flush_state = HAMMER_FST_SETUP;
835 if (ip->flags & HAMMER_INODE_FLUSHW)
836 ip->flags |= HAMMER_INODE_REFLUSH;
839 error = hammer_mem_add(record);
843 * One less link. The file may still be open in the OS even after
844 * all links have gone away.
846 * We have to terminate the cursor before syncing the inode to
847 * avoid deadlocking against ourselves. XXX this may no longer
850 * If nlinks drops to zero and the vnode is inactive (or there is
851 * no vnode), call hammer_inode_unloadable_check() to zonk the
852 * inode. If we don't do this here the inode will not be destroyed
853 * on-media until we unmount.
857 --ip->ino_data.nlinks; /* do before we might block */
858 ip->ino_data.ctime = trans->time;
860 dip->ino_data.mtime = trans->time;
861 hammer_modify_inode(trans, dip, HAMMER_INODE_MTIME);
863 hammer_modify_inode(trans, ip, HAMMER_INODE_DDIRTY);
864 if (ip->ino_data.nlinks == 0 &&
865 (ip->vp == NULL || (ip->vp->v_flag & VINACTIVE))) {
866 hammer_done_cursor(cursor);
867 hammer_inode_unloadable_check(ip, 1);
868 hammer_flush_inode(ip, 0);
877 * Add a record to an inode.
879 * The caller must allocate the record with hammer_alloc_mem_record(ip,len) and
880 * initialize the following additional fields that are not initialized by these
883 * The related inode should be share-locked by the caller. The caller is
886 * record->leaf.base.key
887 * record->leaf.base.rec_type
888 * record->leaf.base.localization
891 hammer_ip_add_record(struct hammer_transaction *trans, hammer_record_t record)
893 hammer_inode_t ip = record->ip;
896 KKASSERT(record->leaf.base.localization != 0);
897 record->leaf.base.obj_id = ip->obj_id;
898 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
899 error = hammer_mem_add(record);
904 * Locate a pre-existing bulk record in memory. The caller wishes to
905 * replace the record with a new one. The existing record may have a
906 * different length (and thus a different key) so we have to use an
907 * overlap check function.
909 static hammer_record_t
910 hammer_ip_get_bulk(hammer_record_t record)
912 struct hammer_bulk_info info;
913 hammer_inode_t ip = record->ip;
915 info.record = record;
916 info.conflict = NULL;
917 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_overlap_cmp,
918 hammer_bulk_scan_callback, &info);
920 return(info.conflict); /* may be NULL */
924 * Take records vetted by overlap_cmp. The first non-deleted record
925 * (if any) stops the scan.
928 hammer_bulk_scan_callback(hammer_record_t record, void *data)
930 struct hammer_bulk_info *info = data;
932 if (record->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
933 HAMMER_RECF_COMMITTED)) {
936 hammer_ref(&record->lock);
937 info->conflict = record;
938 return(-1); /* stop scan */
942 * Reserve blockmap space placemarked with an in-memory record.
944 * This routine is called by the frontend in order to be able to directly
945 * flush a buffer cache buffer. The frontend has locked the related buffer
946 * cache buffers and we should be able to manipulate any overlapping
949 * The caller is responsible for adding the returned record and deleting
950 * the returned conflicting record (if any), typically by calling
951 * hammer_ip_replace_bulk() (via hammer_io_direct_write()).
954 hammer_ip_add_bulk(hammer_inode_t ip, off_t file_offset, void *data, int bytes,
957 hammer_record_t record;
958 hammer_dedup_cache_t dcp;
963 * Create a record to cover the direct write. The record cannot
964 * be added to the in-memory RB tree here as it might conflict
965 * with an existing memory record. See hammer_io_direct_write().
967 * The backend is responsible for finalizing the space reserved in
970 * XXX bytes not aligned, depend on the reservation code to
971 * align the reservation.
973 record = hammer_alloc_mem_record(ip, 0);
974 zone = (bytes >= HAMMER_BUFSIZE) ? HAMMER_ZONE_LARGE_DATA_INDEX :
975 HAMMER_ZONE_SMALL_DATA_INDEX;
979 crc = crc32(data, bytes);
981 if (hammer_live_dedup == 0)
983 if ((dcp = hammer_dedup_cache_lookup(ip->hmp, crc)) != NULL) {
984 struct hammer_dedup_cache tmp = *dcp;
986 record->resv = hammer_blockmap_reserve_dedup(ip->hmp, zone,
987 bytes, tmp.data_offset, errorp);
988 if (record->resv == NULL)
991 if (!hammer_dedup_validate(&tmp, zone, bytes, data)) {
992 hammer_blockmap_reserve_complete(ip->hmp, record->resv);
996 record->leaf.data_offset = tmp.data_offset;
997 record->flags |= HAMMER_RECF_DEDUPED;
1000 record->resv = hammer_blockmap_reserve(ip->hmp, zone, bytes,
1001 &record->leaf.data_offset, errorp);
1002 if (record->resv == NULL) {
1003 kprintf("hammer_ip_add_bulk: reservation failed\n");
1004 hammer_rel_mem_record(record);
1009 record->type = HAMMER_MEM_RECORD_DATA;
1010 record->leaf.base.rec_type = HAMMER_RECTYPE_DATA;
1011 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
1012 record->leaf.base.obj_id = ip->obj_id;
1013 record->leaf.base.key = file_offset + bytes;
1014 record->leaf.base.localization = ip->obj_localization +
1015 HAMMER_LOCALIZE_MISC;
1016 record->leaf.data_len = bytes;
1017 record->leaf.data_crc = crc;
1018 KKASSERT(*errorp == 0);
1024 * Called by hammer_io_direct_write() prior to any possible completion
1025 * of the BIO to emplace the memory record associated with the I/O and
1026 * to replace any prior memory record which might still be active.
1028 * Setting the FE deleted flag on the old record (if any) avoids any RB
1029 * tree insertion conflict, amoung other things.
1031 * This has to be done prior to the caller completing any related buffer
1032 * cache I/O or a reinstantiation of the buffer may load data from the
1033 * old media location instead of the new media location. The holding
1034 * of the locked buffer cache buffer serves to interlock the record
1035 * replacement operation.
1038 hammer_ip_replace_bulk(hammer_mount_t hmp, hammer_record_t record)
1040 hammer_record_t conflict;
1041 int error __debugvar;
1043 while ((conflict = hammer_ip_get_bulk(record)) != NULL) {
1044 if ((conflict->flags & HAMMER_RECF_INTERLOCK_BE) == 0) {
1045 conflict->flags |= HAMMER_RECF_DELETED_FE;
1048 conflict->flags |= HAMMER_RECF_WANTED;
1049 tsleep(conflict, 0, "hmrrc3", 0);
1050 hammer_rel_mem_record(conflict);
1052 error = hammer_mem_add(record);
1054 hammer_rel_mem_record(conflict);
1055 KKASSERT(error == 0);
1059 * Frontend truncation code. Scan in-memory records only. On-disk records
1060 * and records in a flushing state are handled by the backend. The vnops
1061 * setattr code will handle the block containing the truncation point.
1063 * Partial blocks are not deleted.
1065 * This code is only called on regular files.
1068 hammer_ip_frontend_trunc(struct hammer_inode *ip, off_t file_size)
1070 struct rec_trunc_info info;
1072 switch(ip->ino_data.obj_type) {
1073 case HAMMER_OBJTYPE_REGFILE:
1074 info.rec_type = HAMMER_RECTYPE_DATA;
1076 case HAMMER_OBJTYPE_DBFILE:
1077 info.rec_type = HAMMER_RECTYPE_DB;
1082 info.trunc_off = file_size;
1083 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_trunc_cmp,
1084 hammer_frontend_trunc_callback, &info);
1089 * Scan callback for frontend records to destroy during a truncation.
1090 * We must ensure that DELETED_FE is set on the record or the frontend
1091 * will get confused in future read() calls.
1093 * NOTE: DELETED_FE cannot be set while the record interlock (BE) is held.
1094 * In this rare case we must wait for the interlock to be cleared.
1096 * NOTE: This function is only called on regular files. There are further
1097 * restrictions to the setting of DELETED_FE on directory records
1098 * undergoing a flush due to sensitive inode link count calculations.
1101 hammer_frontend_trunc_callback(hammer_record_t record, void *data __unused)
1103 if (record->flags & HAMMER_RECF_DELETED_FE)
1106 if (record->flush_state == HAMMER_FST_FLUSH)
1109 hammer_ref(&record->lock);
1110 while (record->flags & HAMMER_RECF_INTERLOCK_BE)
1111 hammer_wait_mem_record_ident(record, "hmmtrr");
1112 record->flags |= HAMMER_RECF_DELETED_FE;
1113 hammer_rel_mem_record(record);
1118 * Return 1 if the caller must check for and delete existing records
1119 * before writing out a new data record.
1121 * Return 0 if the caller can just insert the record into the B-Tree without
1125 hammer_record_needs_overwrite_delete(hammer_record_t record)
1127 hammer_inode_t ip = record->ip;
1128 int64_t file_offset;
1131 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE)
1132 file_offset = record->leaf.base.key;
1134 file_offset = record->leaf.base.key - record->leaf.data_len;
1135 r = (file_offset < ip->save_trunc_off);
1136 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1137 if (ip->save_trunc_off <= record->leaf.base.key)
1138 ip->save_trunc_off = record->leaf.base.key + 1;
1140 if (ip->save_trunc_off < record->leaf.base.key)
1141 ip->save_trunc_off = record->leaf.base.key;
1147 * Backend code. Sync a record to the media.
1150 hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t record)
1152 hammer_transaction_t trans = cursor->trans;
1153 int64_t file_offset;
1159 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
1160 KKASSERT(record->flags & HAMMER_RECF_INTERLOCK_BE);
1161 KKASSERT(record->leaf.base.localization != 0);
1164 * Any direct-write related to the record must complete before we
1165 * can sync the record to the on-disk media.
1167 if (record->gflags & (HAMMER_RECG_DIRECT_IO | HAMMER_RECG_DIRECT_INVAL))
1168 hammer_io_direct_wait(record);
1171 * If this is a bulk-data record placemarker there may be an existing
1172 * record on-disk, indicating a data overwrite. If there is the
1173 * on-disk record must be deleted before we can insert our new record.
1175 * We've synthesized this record and do not know what the create_tid
1176 * on-disk is, nor how much data it represents.
1178 * Keep in mind that (key) for data records is (base_offset + len),
1179 * not (base_offset). Also, we only want to get rid of on-disk
1180 * records since we are trying to sync our in-memory record, call
1181 * hammer_ip_delete_range() with truncating set to 1 to make sure
1182 * it skips in-memory records.
1184 * It is ok for the lookup to return ENOENT.
1186 * NOTE OPTIMIZATION: sync_trunc_off is used to determine if we have
1187 * to call hammer_ip_delete_range() or not. This also means we must
1188 * update sync_trunc_off() as we write.
1190 if (record->type == HAMMER_MEM_RECORD_DATA &&
1191 hammer_record_needs_overwrite_delete(record)) {
1192 file_offset = record->leaf.base.key - record->leaf.data_len;
1193 bytes = (record->leaf.data_len + HAMMER_BUFMASK) &
1195 KKASSERT((file_offset & HAMMER_BUFMASK) == 0);
1196 error = hammer_ip_delete_range(
1198 file_offset, file_offset + bytes - 1,
1200 if (error && error != ENOENT)
1205 * If this is a general record there may be an on-disk version
1206 * that must be deleted before we can insert the new record.
1208 if (record->type == HAMMER_MEM_RECORD_GENERAL) {
1209 error = hammer_delete_general(cursor, record->ip,
1211 if (error && error != ENOENT)
1218 hammer_normalize_cursor(cursor);
1219 cursor->key_beg = record->leaf.base;
1220 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
1221 cursor->flags |= HAMMER_CURSOR_BACKEND;
1222 cursor->flags &= ~HAMMER_CURSOR_INSERT;
1225 * Records can wind up on-media before the inode itself is on-media.
1228 record->ip->flags |= HAMMER_INODE_DONDISK;
1231 * If we are deleting a directory entry an exact match must be
1234 if (record->type == HAMMER_MEM_RECORD_DEL) {
1235 error = hammer_btree_lookup(cursor);
1237 KKASSERT(cursor->iprec == NULL);
1238 error = hammer_ip_delete_record(cursor, record->ip,
1241 record->flags |= HAMMER_RECF_DELETED_BE |
1242 HAMMER_RECF_COMMITTED;
1243 ++record->ip->rec_generation;
1252 * Issue a lookup to position the cursor and locate the insertion
1253 * point. The target key should not exist. If we are creating a
1254 * directory entry we may have to iterate the low 32 bits of the
1255 * key to find an unused key.
1257 hammer_sync_lock_sh(trans);
1258 cursor->flags |= HAMMER_CURSOR_INSERT;
1259 error = hammer_btree_lookup(cursor);
1260 if (hammer_debug_inode)
1261 kprintf("DOINSERT LOOKUP %d\n", error);
1263 kprintf("hammer_ip_sync_record: duplicate rec "
1264 "at (%016llx)\n", (long long)record->leaf.base.key);
1265 if (hammer_debug_critical)
1266 Debugger("duplicate record1");
1270 if (record->type == HAMMER_MEM_RECORD_DATA)
1271 kprintf("sync_record %016llx ---------------- %016llx %d\n",
1272 record->leaf.base.key - record->leaf.data_len,
1273 record->leaf.data_offset, error);
1276 if (error != ENOENT)
1280 * Allocate the record and data. The result buffers will be
1281 * marked as being modified and further calls to
1282 * hammer_modify_buffer() will result in unneeded UNDO records.
1284 * Support zero-fill records (data == NULL and data_len != 0)
1286 if (record->type == HAMMER_MEM_RECORD_DATA) {
1288 * The data portion of a bulk-data record has already been
1289 * committed to disk, we need only adjust the layer2
1290 * statistics in the same transaction as our B-Tree insert.
1292 KKASSERT(record->leaf.data_offset != 0);
1293 error = hammer_blockmap_finalize(trans,
1295 record->leaf.data_offset,
1296 record->leaf.data_len);
1298 if (hammer_live_dedup == 2 &&
1299 (record->flags & HAMMER_RECF_DEDUPED) == 0) {
1300 hammer_dedup_cache_add(record->ip, &record->leaf);
1302 } else if (record->data && record->leaf.data_len) {
1304 * Wholely cached record, with data. Allocate the data.
1306 bdata = hammer_alloc_data(trans, record->leaf.data_len,
1307 record->leaf.base.rec_type,
1308 &record->leaf.data_offset,
1309 &cursor->data_buffer,
1313 hammer_crc_set_leaf(record->data, &record->leaf);
1314 hammer_modify_buffer(trans, cursor->data_buffer, NULL, 0);
1315 bcopy(record->data, bdata, record->leaf.data_len);
1316 hammer_modify_buffer_done(cursor->data_buffer);
1319 * Wholely cached record, without data.
1321 record->leaf.data_offset = 0;
1322 record->leaf.data_crc = 0;
1325 error = hammer_btree_insert(cursor, &record->leaf, &doprop);
1326 if (hammer_debug_inode && error) {
1327 kprintf("BTREE INSERT error %d @ %016llx:%d key %016llx\n",
1329 (long long)cursor->node->node_offset,
1331 (long long)record->leaf.base.key);
1335 * Our record is on-disk and we normally mark the in-memory version
1336 * as having been committed (and not BE-deleted).
1338 * If the record represented a directory deletion but we had to
1339 * sync a valid directory entry to disk due to dependancies,
1340 * we must convert the record to a covering delete so the
1341 * frontend does not have visibility on the synced entry.
1343 * WARNING: cursor's leaf pointer may have changed after do_propagation
1348 hammer_btree_do_propagation(cursor,
1352 if (record->flags & HAMMER_RECF_CONVERT_DELETE) {
1354 * Must convert deleted directory entry add
1355 * to a directory entry delete.
1357 KKASSERT(record->type == HAMMER_MEM_RECORD_ADD);
1358 record->flags &= ~HAMMER_RECF_DELETED_FE;
1359 record->type = HAMMER_MEM_RECORD_DEL;
1360 KKASSERT(record->ip->obj_id == record->leaf.base.obj_id);
1361 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
1362 record->flags &= ~HAMMER_RECF_CONVERT_DELETE;
1363 KKASSERT((record->flags & (HAMMER_RECF_COMMITTED |
1364 HAMMER_RECF_DELETED_BE)) == 0);
1365 /* converted record is not yet committed */
1366 /* hammer_flush_record_done takes care of the rest */
1369 * Everything went fine and we are now done with
1372 record->flags |= HAMMER_RECF_COMMITTED;
1373 ++record->ip->rec_generation;
1376 if (record->leaf.data_offset) {
1377 hammer_blockmap_free(trans, record->leaf.data_offset,
1378 record->leaf.data_len);
1382 hammer_sync_unlock(trans);
1388 * Add the record to the inode's rec_tree. The low 32 bits of a directory
1389 * entry's key is used to deal with hash collisions in the upper 32 bits.
1390 * A unique 64 bit key is generated in-memory and may be regenerated a
1391 * second time when the directory record is flushed to the on-disk B-Tree.
1393 * A referenced record is passed to this function. This function
1394 * eats the reference. If an error occurs the record will be deleted.
1396 * A copy of the temporary record->data pointer provided by the caller
1400 hammer_mem_add(hammer_record_t record)
1402 hammer_mount_t hmp = record->ip->hmp;
1405 * Make a private copy of record->data
1408 KKASSERT(record->flags & HAMMER_RECF_ALLOCDATA);
1411 * Insert into the RB tree. A unique key should have already
1412 * been selected if this is a directory entry.
1414 if (RB_INSERT(hammer_rec_rb_tree, &record->ip->rec_tree, record)) {
1415 record->flags |= HAMMER_RECF_DELETED_FE;
1416 hammer_rel_mem_record(record);
1419 ++hmp->count_newrecords;
1421 ++record->ip->rsv_recs;
1422 record->ip->hmp->rsv_databytes += record->leaf.data_len;
1423 record->flags |= HAMMER_RECF_ONRBTREE;
1424 hammer_modify_inode(NULL, record->ip, HAMMER_INODE_XDIRTY);
1425 hammer_rel_mem_record(record);
1429 /************************************************************************
1430 * HAMMER INODE MERGED-RECORD FUNCTIONS *
1431 ************************************************************************
1433 * These functions augment the B-Tree scanning functions in hammer_btree.c
1434 * by merging in-memory records with on-disk records.
1438 * Locate a particular record either in-memory or on-disk.
1440 * NOTE: This is basically a standalone routine, hammer_ip_next() may
1441 * NOT be called to iterate results.
1444 hammer_ip_lookup(hammer_cursor_t cursor)
1449 * If the element is in-memory return it without searching the
1452 KKASSERT(cursor->ip);
1453 error = hammer_mem_lookup(cursor);
1455 cursor->leaf = &cursor->iprec->leaf;
1458 if (error != ENOENT)
1462 * If the inode has on-disk components search the on-disk B-Tree.
1464 if ((cursor->ip->flags & (HAMMER_INODE_ONDISK|HAMMER_INODE_DONDISK)) == 0)
1466 error = hammer_btree_lookup(cursor);
1468 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
1473 * Helper for hammer_ip_first()/hammer_ip_next()
1475 * NOTE: Both ATEDISK and DISKEOF will be set the same. This sets up
1476 * hammer_ip_first() for calling hammer_ip_next(), and sets up the re-seek
1477 * state if hammer_ip_next() needs to re-seek.
1481 _hammer_ip_seek_btree(hammer_cursor_t cursor)
1483 hammer_inode_t ip = cursor->ip;
1486 if (ip->flags & (HAMMER_INODE_ONDISK|HAMMER_INODE_DONDISK)) {
1487 error = hammer_btree_lookup(cursor);
1488 if (error == ENOENT || error == EDEADLK) {
1489 if (hammer_debug_general & 0x2000) {
1490 kprintf("error %d node %p %016llx index %d\n",
1491 error, cursor->node,
1492 (long long)cursor->node->node_offset,
1495 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
1496 error = hammer_btree_iterate(cursor);
1499 cursor->flags &= ~(HAMMER_CURSOR_DISKEOF |
1500 HAMMER_CURSOR_ATEDISK);
1502 cursor->flags |= HAMMER_CURSOR_DISKEOF |
1503 HAMMER_CURSOR_ATEDISK;
1504 if (error == ENOENT)
1508 cursor->flags |= HAMMER_CURSOR_DISKEOF | HAMMER_CURSOR_ATEDISK;
1515 * Helper for hammer_ip_next()
1517 * The caller has determined that the media cursor is further along than the
1518 * memory cursor and must be reseeked after a generation number change.
1522 _hammer_ip_reseek(hammer_cursor_t cursor)
1524 struct hammer_base_elm save;
1525 hammer_btree_elm_t elm;
1526 int error __debugvar;
1533 kprintf("HAMMER: Debug: re-seeked during scan @ino=%016llx\n",
1534 (long long)cursor->ip->obj_id);
1535 save = cursor->key_beg;
1536 cursor->key_beg = cursor->iprec->leaf.base;
1537 error = _hammer_ip_seek_btree(cursor);
1538 KKASSERT(error == 0);
1539 cursor->key_beg = save;
1542 * If the memory record was previous returned to
1543 * the caller and the media record matches
1544 * (-1/+1: only create_tid differs), then iterate
1545 * the media record to avoid a double result.
1547 if ((cursor->flags & HAMMER_CURSOR_ATEDISK) == 0 &&
1548 (cursor->flags & HAMMER_CURSOR_LASTWASMEM)) {
1549 elm = &cursor->node->ondisk->elms[cursor->index];
1550 r = hammer_btree_cmp(&elm->base,
1551 &cursor->iprec->leaf.base);
1552 if (cursor->flags & HAMMER_CURSOR_ASOF) {
1553 if (r >= -1 && r <= 1) {
1554 kprintf("HAMMER: Debug: iterated after "
1555 "re-seek (asof r=%d)\n", r);
1556 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1561 kprintf("HAMMER: Debug: iterated after "
1563 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1572 * Locate the first record within the cursor's key_beg/key_end range,
1573 * restricted to a particular inode. 0 is returned on success, ENOENT
1574 * if no records matched the requested range, or some other error.
1576 * When 0 is returned hammer_ip_next() may be used to iterate additional
1577 * records within the requested range.
1579 * This function can return EDEADLK, requiring the caller to terminate
1580 * the cursor and try again.
1584 hammer_ip_first(hammer_cursor_t cursor)
1586 hammer_inode_t ip __debugvar = cursor->ip;
1589 KKASSERT(ip != NULL);
1592 * Clean up fields and setup for merged scan
1594 cursor->flags &= ~HAMMER_CURSOR_RETEST;
1597 * Search the in-memory record list (Red-Black tree). Unlike the
1598 * B-Tree search, mem_first checks for records in the range.
1600 * This function will setup both ATEMEM and MEMEOF properly for
1601 * the ip iteration. ATEMEM will be set if MEMEOF is set.
1603 hammer_mem_first(cursor);
1606 * Detect generation changes during blockages, including
1607 * blockages which occur on the initial btree search.
1609 cursor->rec_generation = cursor->ip->rec_generation;
1612 * Initial search and result
1614 error = _hammer_ip_seek_btree(cursor);
1616 error = hammer_ip_next(cursor);
1622 * Retrieve the next record in a merged iteration within the bounds of the
1623 * cursor. This call may be made multiple times after the cursor has been
1624 * initially searched with hammer_ip_first().
1626 * There are numerous special cases in this code to deal with races between
1627 * in-memory records and on-media records.
1629 * 0 is returned on success, ENOENT if no further records match the
1630 * requested range, or some other error code is returned.
1633 hammer_ip_next(hammer_cursor_t cursor)
1635 hammer_btree_elm_t elm;
1636 hammer_record_t rec;
1637 hammer_record_t tmprec;
1643 * Get the next on-disk record
1645 * NOTE: If we deleted the last on-disk record we had scanned
1646 * ATEDISK will be clear and RETEST will be set, forcing
1647 * a call to iterate. The fact that ATEDISK is clear causes
1648 * iterate to re-test the 'current' element. If ATEDISK is
1649 * set, iterate will skip the 'current' element.
1652 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
1653 if (cursor->flags & (HAMMER_CURSOR_ATEDISK |
1654 HAMMER_CURSOR_RETEST)) {
1655 error = hammer_btree_iterate(cursor);
1656 cursor->flags &= ~HAMMER_CURSOR_RETEST;
1658 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
1659 hammer_cache_node(&cursor->ip->cache[1],
1661 } else if (error == ENOENT) {
1662 cursor->flags |= HAMMER_CURSOR_DISKEOF |
1663 HAMMER_CURSOR_ATEDISK;
1670 * If the generation changed the backend has deleted or committed
1671 * one or more memory records since our last check.
1673 * When this case occurs if the disk cursor is > current memory record
1674 * or the disk cursor is at EOF, we must re-seek the disk-cursor.
1675 * Since the cursor is ahead it must have not yet been eaten (if
1676 * not at eof anyway). (XXX data offset case?)
1678 * NOTE: we are not doing a full check here. That will be handled
1681 * If we have exhausted all memory records we do not have to do any
1684 while (cursor->rec_generation != cursor->ip->rec_generation &&
1687 kprintf("HAMMER: Debug: generation changed during scan @ino=%016llx\n", (long long)cursor->ip->obj_id);
1688 cursor->rec_generation = cursor->ip->rec_generation;
1689 if (cursor->flags & HAMMER_CURSOR_MEMEOF)
1691 if (cursor->flags & HAMMER_CURSOR_DISKEOF) {
1694 KKASSERT((cursor->flags & HAMMER_CURSOR_ATEDISK) == 0);
1695 elm = &cursor->node->ondisk->elms[cursor->index];
1696 r = hammer_btree_cmp(&elm->base,
1697 &cursor->iprec->leaf.base);
1701 * Do we re-seek the media cursor?
1704 if (_hammer_ip_reseek(cursor))
1710 * We can now safely get the next in-memory record. We cannot
1713 * hammer_rec_scan_cmp: Is the record still in our general range,
1714 * (non-inclusive of snapshot exclusions)?
1715 * hammer_rec_scan_callback: Is the record in our snapshot?
1718 if ((cursor->flags & HAMMER_CURSOR_MEMEOF) == 0) {
1720 * If the current memory record was eaten then get the next
1721 * one. Stale records are skipped.
1723 if (cursor->flags & HAMMER_CURSOR_ATEMEM) {
1724 tmprec = cursor->iprec;
1725 cursor->iprec = NULL;
1726 rec = hammer_rec_rb_tree_RB_NEXT(tmprec);
1728 if (hammer_rec_scan_cmp(rec, cursor) != 0)
1730 if (hammer_rec_scan_callback(rec, cursor) != 0)
1732 rec = hammer_rec_rb_tree_RB_NEXT(rec);
1734 if (cursor->iprec) {
1735 KKASSERT(cursor->iprec == rec);
1736 cursor->flags &= ~HAMMER_CURSOR_ATEMEM;
1738 cursor->flags |= HAMMER_CURSOR_MEMEOF;
1740 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1745 * MEMORY RECORD VALIDITY TEST
1747 * (We still can't block, which is why tmprec is being held so
1750 * If the memory record is no longer valid we skip it. It may
1751 * have been deleted by the frontend. If it was deleted or
1752 * committed by the backend the generation change re-seeked the
1753 * disk cursor and the record will be present there.
1755 if (error == 0 && (cursor->flags & HAMMER_CURSOR_MEMEOF) == 0) {
1756 KKASSERT(cursor->iprec);
1757 KKASSERT((cursor->flags & HAMMER_CURSOR_ATEMEM) == 0);
1758 if (!hammer_ip_iterate_mem_good(cursor, cursor->iprec)) {
1759 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1761 hammer_rel_mem_record(tmprec);
1766 hammer_rel_mem_record(tmprec);
1769 * Extract either the disk or memory record depending on their
1770 * relative position.
1773 switch(cursor->flags & (HAMMER_CURSOR_ATEDISK | HAMMER_CURSOR_ATEMEM)) {
1776 * Both entries valid. Compare the entries and nominally
1777 * return the first one in the sort order. Numerous cases
1778 * require special attention, however.
1780 elm = &cursor->node->ondisk->elms[cursor->index];
1781 r = hammer_btree_cmp(&elm->base, &cursor->iprec->leaf.base);
1784 * If the two entries differ only by their key (-2/2) or
1785 * create_tid (-1/1), and are DATA records, we may have a
1786 * nominal match. We have to calculate the base file
1787 * offset of the data.
1789 if (r <= 2 && r >= -2 && r != 0 &&
1790 cursor->ip->ino_data.obj_type == HAMMER_OBJTYPE_REGFILE &&
1791 cursor->iprec->type == HAMMER_MEM_RECORD_DATA) {
1792 int64_t base1 = elm->leaf.base.key - elm->leaf.data_len;
1793 int64_t base2 = cursor->iprec->leaf.base.key -
1794 cursor->iprec->leaf.data_len;
1800 error = hammer_btree_extract(cursor,
1801 HAMMER_CURSOR_GET_LEAF);
1802 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1803 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1808 * If the entries match exactly the memory entry is either
1809 * an on-disk directory entry deletion or a bulk data
1810 * overwrite. If it is a directory entry deletion we eat
1813 * For the bulk-data overwrite case it is possible to have
1814 * visibility into both, which simply means the syncer
1815 * hasn't gotten around to doing the delete+insert sequence
1816 * on the B-Tree. Use the memory entry and throw away the
1819 * If the in-memory record is not either of these we
1820 * probably caught the syncer while it was syncing it to
1821 * the media. Since we hold a shared lock on the cursor,
1822 * the in-memory record had better be marked deleted at
1826 if (cursor->iprec->type == HAMMER_MEM_RECORD_DEL) {
1827 if ((cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1828 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1829 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1832 } else if (cursor->iprec->type == HAMMER_MEM_RECORD_DATA) {
1833 if ((cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1834 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1836 /* fall through to memory entry */
1838 panic("hammer_ip_next: duplicate mem/b-tree entry %p %d %08x", cursor->iprec, cursor->iprec->type, cursor->iprec->flags);
1839 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1843 /* fall through to the memory entry */
1844 case HAMMER_CURSOR_ATEDISK:
1846 * Only the memory entry is valid.
1848 cursor->leaf = &cursor->iprec->leaf;
1849 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1850 cursor->flags |= HAMMER_CURSOR_LASTWASMEM;
1853 * If the memory entry is an on-disk deletion we should have
1854 * also had found a B-Tree record. If the backend beat us
1855 * to it it would have interlocked the cursor and we should
1856 * have seen the in-memory record marked DELETED_FE.
1858 if (cursor->iprec->type == HAMMER_MEM_RECORD_DEL &&
1859 (cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1860 panic("hammer_ip_next: del-on-disk with no b-tree entry iprec %p flags %08x", cursor->iprec, cursor->iprec->flags);
1863 case HAMMER_CURSOR_ATEMEM:
1865 * Only the disk entry is valid
1867 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
1868 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1869 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1873 * Neither entry is valid
1875 * XXX error not set properly
1877 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1878 cursor->leaf = NULL;
1886 * Resolve the cursor->data pointer for the current cursor position in
1887 * a merged iteration.
1890 hammer_ip_resolve_data(hammer_cursor_t cursor)
1892 hammer_record_t record;
1895 if (hammer_cursor_inmem(cursor)) {
1897 * The data associated with an in-memory record is usually
1898 * kmalloced, but reserve-ahead data records will have an
1899 * on-disk reference.
1901 * NOTE: Reserve-ahead data records must be handled in the
1902 * context of the related high level buffer cache buffer
1903 * to interlock against async writes.
1905 record = cursor->iprec;
1906 cursor->data = record->data;
1908 if (cursor->data == NULL) {
1909 KKASSERT(record->leaf.base.rec_type ==
1910 HAMMER_RECTYPE_DATA);
1911 cursor->data = hammer_bread_ext(cursor->trans->hmp,
1912 record->leaf.data_offset,
1913 record->leaf.data_len,
1915 &cursor->data_buffer);
1918 cursor->leaf = &cursor->node->ondisk->elms[cursor->index].leaf;
1919 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_DATA);
1925 * Backend truncation / record replacement - delete records in range.
1927 * Delete all records within the specified range for inode ip. In-memory
1928 * records still associated with the frontend are ignored.
1930 * If truncating is non-zero in-memory records associated with the back-end
1931 * are ignored. If truncating is > 1 we can return EWOULDBLOCK.
1935 * * An unaligned range will cause new records to be added to cover
1936 * the edge cases. (XXX not implemented yet).
1938 * * Replacement via reservations (see hammer_ip_sync_record_cursor())
1939 * also do not deal with unaligned ranges.
1941 * * ran_end is inclusive (e.g. 0,1023 instead of 0,1024).
1943 * * Record keys for regular file data have to be special-cased since
1944 * they indicate the end of the range (key = base + bytes).
1946 * * This function may be asked to delete ridiculously huge ranges, for
1947 * example if someone truncates or removes a 1TB regular file. We
1948 * must be very careful on restarts and we may have to stop w/
1949 * EWOULDBLOCK to avoid blowing out the buffer cache.
1952 hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip,
1953 int64_t ran_beg, int64_t ran_end, int truncating)
1955 hammer_transaction_t trans = cursor->trans;
1956 hammer_btree_leaf_elm_t leaf;
1962 kprintf("delete_range %p %016llx-%016llx\n", ip, ran_beg, ran_end);
1965 KKASSERT(trans->type == HAMMER_TRANS_FLS);
1967 hammer_normalize_cursor(cursor);
1968 cursor->key_beg.localization = ip->obj_localization +
1969 HAMMER_LOCALIZE_MISC;
1970 cursor->key_beg.obj_id = ip->obj_id;
1971 cursor->key_beg.create_tid = 0;
1972 cursor->key_beg.delete_tid = 0;
1973 cursor->key_beg.obj_type = 0;
1975 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1976 cursor->key_beg.key = ran_beg;
1977 cursor->key_beg.rec_type = HAMMER_RECTYPE_DB;
1980 * The key in the B-Tree is (base+bytes), so the first possible
1981 * matching key is ran_beg + 1.
1983 cursor->key_beg.key = ran_beg + 1;
1984 cursor->key_beg.rec_type = HAMMER_RECTYPE_DATA;
1987 cursor->key_end = cursor->key_beg;
1988 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1989 cursor->key_end.key = ran_end;
1991 tmp64 = ran_end + MAXPHYS + 1; /* work around GCC-4 bug */
1992 if (tmp64 < ran_end)
1993 cursor->key_end.key = 0x7FFFFFFFFFFFFFFFLL;
1995 cursor->key_end.key = ran_end + MAXPHYS + 1;
1998 cursor->asof = ip->obj_asof;
1999 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
2000 cursor->flags |= HAMMER_CURSOR_ASOF;
2001 cursor->flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
2002 cursor->flags |= HAMMER_CURSOR_BACKEND;
2003 cursor->flags |= HAMMER_CURSOR_END_INCLUSIVE;
2005 error = hammer_ip_first(cursor);
2008 * Iterate through matching records and mark them as deleted.
2010 while (error == 0) {
2011 leaf = cursor->leaf;
2013 KKASSERT(leaf->base.delete_tid == 0);
2014 KKASSERT(leaf->base.obj_id == ip->obj_id);
2017 * There may be overlap cases for regular file data. Also
2018 * remember the key for a regular file record is (base + len),
2021 * Note that due to duplicates (mem & media) allowed by
2022 * DELETE_VISIBILITY, off can wind up less then ran_beg.
2024 if (leaf->base.rec_type == HAMMER_RECTYPE_DATA) {
2025 off = leaf->base.key - leaf->data_len;
2027 * Check the left edge case. We currently do not
2028 * split existing records.
2030 if (off < ran_beg && leaf->base.key > ran_beg) {
2031 panic("hammer left edge case %016llx %d",
2032 (long long)leaf->base.key,
2037 * Check the right edge case. Note that the
2038 * record can be completely out of bounds, which
2039 * terminates the search.
2041 * base->key is exclusive of the right edge while
2042 * ran_end is inclusive of the right edge. The
2043 * (key - data_len) left boundary is inclusive.
2045 * XXX theory-check this test at some point, are
2046 * we missing a + 1 somewhere? Note that ran_end
2049 if (leaf->base.key - 1 > ran_end) {
2050 if (leaf->base.key - leaf->data_len > ran_end)
2052 panic("hammer right edge case");
2055 off = leaf->base.key;
2059 * Delete the record. When truncating we do not delete
2060 * in-memory (data) records because they represent data
2061 * written after the truncation.
2063 * This will also physically destroy the B-Tree entry and
2064 * data if the retention policy dictates. The function
2065 * will set HAMMER_CURSOR_RETEST to cause hammer_ip_next()
2066 * to retest the new 'current' element.
2068 if (truncating == 0 || hammer_cursor_ondisk(cursor)) {
2069 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2071 * If we have built up too many meta-buffers we risk
2072 * deadlocking the kernel and must stop. This can
2073 * occur when deleting ridiculously huge files.
2074 * sync_trunc_off is updated so the next cycle does
2075 * not re-iterate records we have already deleted.
2077 * This is only done with formal truncations.
2079 if (truncating > 1 && error == 0 &&
2080 hammer_flusher_meta_limit(ip->hmp)) {
2081 ip->sync_trunc_off = off;
2082 error = EWOULDBLOCK;
2087 ran_beg = off; /* for restart */
2088 error = hammer_ip_next(cursor);
2091 hammer_cache_node(&ip->cache[1], cursor->node);
2093 if (error == EDEADLK) {
2094 hammer_done_cursor(cursor);
2095 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2099 if (error == ENOENT)
2105 * This backend function deletes the specified record on-disk, similar to
2106 * delete_range but for a specific record. Unlike the exact deletions
2107 * used when deleting a directory entry this function uses an ASOF search
2108 * like delete_range.
2110 * This function may be called with ip->obj_asof set for a slave snapshot,
2111 * so don't use it. We always delete non-historical records only.
2114 hammer_delete_general(hammer_cursor_t cursor, hammer_inode_t ip,
2115 hammer_btree_leaf_elm_t leaf)
2117 hammer_transaction_t trans = cursor->trans;
2120 KKASSERT(trans->type == HAMMER_TRANS_FLS);
2122 hammer_normalize_cursor(cursor);
2123 cursor->key_beg = leaf->base;
2124 cursor->asof = HAMMER_MAX_TID;
2125 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
2126 cursor->flags |= HAMMER_CURSOR_ASOF;
2127 cursor->flags |= HAMMER_CURSOR_BACKEND;
2128 cursor->flags &= ~HAMMER_CURSOR_INSERT;
2130 error = hammer_btree_lookup(cursor);
2132 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2134 if (error == EDEADLK) {
2135 hammer_done_cursor(cursor);
2136 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2144 * This function deletes remaining auxillary records when an inode is
2145 * being deleted. This function explicitly does not delete the
2146 * inode record, directory entry, data, or db records. Those must be
2147 * properly disposed of prior to this call.
2150 hammer_ip_delete_clean(hammer_cursor_t cursor, hammer_inode_t ip, int *countp)
2152 hammer_transaction_t trans = cursor->trans;
2153 hammer_btree_leaf_elm_t leaf __debugvar;
2156 KKASSERT(trans->type == HAMMER_TRANS_FLS);
2158 hammer_normalize_cursor(cursor);
2159 cursor->key_beg.localization = ip->obj_localization +
2160 HAMMER_LOCALIZE_MISC;
2161 cursor->key_beg.obj_id = ip->obj_id;
2162 cursor->key_beg.create_tid = 0;
2163 cursor->key_beg.delete_tid = 0;
2164 cursor->key_beg.obj_type = 0;
2165 cursor->key_beg.rec_type = HAMMER_RECTYPE_CLEAN_START;
2166 cursor->key_beg.key = HAMMER_MIN_KEY;
2168 cursor->key_end = cursor->key_beg;
2169 cursor->key_end.rec_type = HAMMER_RECTYPE_MAX;
2170 cursor->key_end.key = HAMMER_MAX_KEY;
2172 cursor->asof = ip->obj_asof;
2173 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
2174 cursor->flags |= HAMMER_CURSOR_END_INCLUSIVE | HAMMER_CURSOR_ASOF;
2175 cursor->flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
2176 cursor->flags |= HAMMER_CURSOR_BACKEND;
2178 error = hammer_ip_first(cursor);
2181 * Iterate through matching records and mark them as deleted.
2183 while (error == 0) {
2184 leaf = cursor->leaf;
2186 KKASSERT(leaf->base.delete_tid == 0);
2189 * Mark the record and B-Tree entry as deleted. This will
2190 * also physically delete the B-Tree entry, record, and
2191 * data if the retention policy dictates. The function
2192 * will set HAMMER_CURSOR_RETEST to cause hammer_ip_next()
2193 * to retest the new 'current' element.
2195 * Directory entries (and delete-on-disk directory entries)
2196 * must be synced and cannot be deleted.
2198 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2202 error = hammer_ip_next(cursor);
2205 hammer_cache_node(&ip->cache[1], cursor->node);
2206 if (error == EDEADLK) {
2207 hammer_done_cursor(cursor);
2208 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2212 if (error == ENOENT)
2218 * Delete the record at the current cursor. On success the cursor will
2219 * be positioned appropriately for an iteration but may no longer be at
2222 * This routine is only called from the backend.
2224 * NOTE: This can return EDEADLK, requiring the caller to terminate the
2228 hammer_ip_delete_record(hammer_cursor_t cursor, hammer_inode_t ip,
2231 hammer_record_t iprec;
2234 KKASSERT(cursor->flags & HAMMER_CURSOR_BACKEND);
2238 * In-memory (unsynchronized) records can simply be freed. This
2239 * only occurs in range iterations since all other records are
2240 * individually synchronized. Thus there should be no confusion with
2243 * An in-memory record may be deleted before being committed to disk,
2244 * but could have been accessed in the mean time. The reservation
2245 * code will deal with the case.
2247 if (hammer_cursor_inmem(cursor)) {
2248 iprec = cursor->iprec;
2249 KKASSERT((iprec->flags & HAMMER_RECF_INTERLOCK_BE) ==0);
2250 iprec->flags |= HAMMER_RECF_DELETED_FE;
2251 iprec->flags |= HAMMER_RECF_DELETED_BE;
2252 KKASSERT(iprec->ip == ip);
2253 ++ip->rec_generation;
2258 * On-disk records are marked as deleted by updating their delete_tid.
2259 * This does not effect their position in the B-Tree (which is based
2260 * on their create_tid).
2262 * Frontend B-Tree operations track inodes so we tell
2263 * hammer_delete_at_cursor() not to.
2265 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
2268 error = hammer_delete_at_cursor(
2270 HAMMER_DELETE_ADJUST | hammer_nohistory(ip),
2272 cursor->trans->time32,
2279 * Used to write a generic record w/optional data to the media b-tree
2280 * when no inode context is available. Used by the mirroring and
2283 * Caller must set cursor->key_beg to leaf->base. The cursor must be
2284 * flagged for backend operation and not flagged ASOF (since we are
2285 * doing an insertion).
2287 * This function will acquire the appropriate sync lock and will set
2288 * the cursor insertion flag for the operation, do the btree lookup,
2289 * and the insertion, and clear the insertion flag and sync lock before
2290 * returning. The cursor state will be such that the caller can continue
2291 * scanning (used by the mirroring code).
2293 * mode: HAMMER_CREATE_MODE_UMIRROR copyin data, check crc
2294 * HAMMER_CREATE_MODE_SYS bcopy data, generate crc
2296 * NOTE: EDEADLK can be returned. The caller must do deadlock handling and
2299 * EALREADY can be returned if the record already exists (WARNING,
2300 * because ASOF cannot be used no check is made for illegal
2303 * NOTE: Do not use the function for normal inode-related records as this
2304 * functions goes directly to the media and is not integrated with
2305 * in-memory records.
2308 hammer_create_at_cursor(hammer_cursor_t cursor, hammer_btree_leaf_elm_t leaf,
2309 void *udata, int mode)
2311 hammer_transaction_t trans;
2312 hammer_buffer_t data_buffer;
2313 hammer_off_t ndata_offset;
2314 hammer_tid_t high_tid;
2319 trans = cursor->trans;
2324 KKASSERT((cursor->flags &
2325 (HAMMER_CURSOR_BACKEND | HAMMER_CURSOR_ASOF)) ==
2326 (HAMMER_CURSOR_BACKEND));
2328 hammer_sync_lock_sh(trans);
2330 if (leaf->data_len) {
2331 ndata = hammer_alloc_data(trans, leaf->data_len,
2332 leaf->base.rec_type,
2333 &ndata_offset, &data_buffer,
2335 if (ndata == NULL) {
2336 hammer_sync_unlock(trans);
2339 leaf->data_offset = ndata_offset;
2340 hammer_modify_buffer(trans, data_buffer, NULL, 0);
2343 case HAMMER_CREATE_MODE_UMIRROR:
2344 error = copyin(udata, ndata, leaf->data_len);
2346 if (hammer_crc_test_leaf(ndata, leaf) == 0) {
2347 kprintf("data crc mismatch on pipe\n");
2350 error = hammer_cursor_localize_data(
2355 case HAMMER_CREATE_MODE_SYS:
2356 bcopy(udata, ndata, leaf->data_len);
2358 hammer_crc_set_leaf(ndata, leaf);
2361 panic("hammer: hammer_create_at_cursor: bad mode %d",
2363 break; /* NOT REACHED */
2365 hammer_modify_buffer_done(data_buffer);
2367 leaf->data_offset = 0;
2375 * Do the insertion. This can fail with a EDEADLK or EALREADY
2377 cursor->flags |= HAMMER_CURSOR_INSERT;
2378 error = hammer_btree_lookup(cursor);
2379 if (error != ENOENT) {
2384 error = hammer_btree_insert(cursor, leaf, &doprop);
2387 * Cursor is left on current element, we want to skip it now.
2388 * (in case the caller is scanning)
2390 cursor->flags |= HAMMER_CURSOR_ATEDISK;
2391 cursor->flags &= ~HAMMER_CURSOR_INSERT;
2394 * If the insertion happens to be creating (and not just replacing)
2395 * an inode we have to track it.
2398 leaf->base.rec_type == HAMMER_RECTYPE_INODE &&
2399 leaf->base.delete_tid == 0) {
2400 hammer_modify_volume_field(trans, trans->rootvol,
2402 ++trans->hmp->rootvol->ondisk->vol0_stat_inodes;
2403 hammer_modify_volume_done(trans->rootvol);
2407 * vol0_next_tid must track the highest TID stored in the filesystem.
2408 * We do not need to generate undo for this update.
2410 high_tid = leaf->base.create_tid;
2411 if (high_tid < leaf->base.delete_tid)
2412 high_tid = leaf->base.delete_tid;
2413 if (trans->rootvol->ondisk->vol0_next_tid < high_tid) {
2414 hammer_modify_volume(trans, trans->rootvol, NULL, 0);
2415 trans->rootvol->ondisk->vol0_next_tid = high_tid;
2416 hammer_modify_volume_done(trans->rootvol);
2420 * WARNING! cursor's leaf pointer may have changed after
2421 * do_propagation returns.
2423 if (error == 0 && doprop)
2424 hammer_btree_do_propagation(cursor, NULL, leaf);
2430 if (error && leaf->data_offset) {
2431 hammer_blockmap_free(trans, leaf->data_offset, leaf->data_len);
2434 hammer_sync_unlock(trans);
2436 hammer_rel_buffer(data_buffer, 0);
2441 * Delete the B-Tree element at the current cursor and do any necessary
2442 * mirror propagation.
2444 * The cursor must be properly positioned for an iteration on return but
2445 * may be pointing at an internal element.
2447 * An element can be un-deleted by passing a delete_tid of 0 with
2448 * HAMMER_DELETE_ADJUST.
2450 * This function will store the number of bytes deleted in *stat_bytes
2451 * if stat_bytes is not NULL.
2454 hammer_delete_at_cursor(hammer_cursor_t cursor, int delete_flags,
2455 hammer_tid_t delete_tid, u_int32_t delete_ts,
2456 int track, int64_t *stat_bytes)
2458 struct hammer_btree_leaf_elm save_leaf;
2459 hammer_transaction_t trans;
2460 hammer_btree_leaf_elm_t leaf;
2462 hammer_btree_elm_t elm;
2463 hammer_off_t data_offset;
2471 error = hammer_cursor_upgrade(cursor);
2475 trans = cursor->trans;
2476 node = cursor->node;
2477 elm = &node->ondisk->elms[cursor->index];
2479 KKASSERT(elm->base.btype == HAMMER_BTREE_TYPE_RECORD);
2481 hammer_sync_lock_sh(trans);
2487 * Adjust the delete_tid. Update the mirror_tid propagation field
2488 * as well. delete_tid can be 0 (undelete -- used by mirroring).
2490 if (delete_flags & HAMMER_DELETE_ADJUST) {
2491 if (elm->base.rec_type == HAMMER_RECTYPE_INODE) {
2492 if (elm->leaf.base.delete_tid == 0 && delete_tid)
2494 if (elm->leaf.base.delete_tid && delete_tid == 0)
2498 hammer_modify_node(trans, node, elm, sizeof(*elm));
2499 elm->leaf.base.delete_tid = delete_tid;
2500 elm->leaf.delete_ts = delete_ts;
2501 hammer_modify_node_done(node);
2503 if (elm->leaf.base.delete_tid > node->ondisk->mirror_tid) {
2504 hammer_modify_node_field(trans, node, mirror_tid);
2505 node->ondisk->mirror_tid = elm->leaf.base.delete_tid;
2506 hammer_modify_node_done(node);
2508 if (hammer_debug_general & 0x0002) {
2509 kprintf("delete_at_cursor: propagate %016llx"
2511 (long long)elm->leaf.base.delete_tid,
2512 (long long)node->node_offset);
2517 * Adjust for the iteration. We have deleted the current
2518 * element and want to clear ATEDISK so the iteration does
2519 * not skip the element after, which now becomes the current
2520 * element. This element must be re-tested if doing an
2521 * iteration, which is handled by the RETEST flag.
2523 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
2524 cursor->flags |= HAMMER_CURSOR_RETEST;
2525 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
2529 * An on-disk record cannot have the same delete_tid
2530 * as its create_tid. In a chain of record updates
2531 * this could result in a duplicate record.
2533 KKASSERT(elm->leaf.base.delete_tid !=
2534 elm->leaf.base.create_tid);
2538 * Destroy the B-Tree element if asked (typically if a nohistory
2539 * file or mount, or when called by the pruning code).
2541 * Adjust the ATEDISK flag to properly support iterations.
2543 if (delete_flags & HAMMER_DELETE_DESTROY) {
2544 data_offset = elm->leaf.data_offset;
2545 data_len = elm->leaf.data_len;
2547 save_leaf = elm->leaf;
2550 if (elm->base.rec_type == HAMMER_RECTYPE_INODE &&
2551 elm->leaf.base.delete_tid == 0) {
2555 error = hammer_btree_delete(cursor, &ndelete);
2558 * The deletion moves the next element (if any) to
2559 * the current element position. We must clear
2560 * ATEDISK so this element is not skipped and we
2561 * must set RETEST to force any iteration to re-test
2564 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
2565 cursor->flags |= HAMMER_CURSOR_RETEST;
2566 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
2568 bytes += (ndelete * sizeof(struct hammer_node_ondisk));
2570 switch(data_offset & HAMMER_OFF_ZONE_MASK) {
2571 case HAMMER_ZONE_LARGE_DATA:
2572 case HAMMER_ZONE_SMALL_DATA:
2573 case HAMMER_ZONE_META:
2574 hammer_blockmap_free(trans,
2575 data_offset, data_len);
2585 * Track inode count and next_tid. This is used by the mirroring
2586 * and PFS code. icount can be negative, zero, or positive.
2588 if (error == 0 && track) {
2590 hammer_modify_volume_field(trans, trans->rootvol,
2592 trans->rootvol->ondisk->vol0_stat_inodes += icount;
2593 hammer_modify_volume_done(trans->rootvol);
2595 if (trans->rootvol->ondisk->vol0_next_tid < delete_tid) {
2596 hammer_modify_volume(trans, trans->rootvol, NULL, 0);
2597 trans->rootvol->ondisk->vol0_next_tid = delete_tid;
2598 hammer_modify_volume_done(trans->rootvol);
2603 * mirror_tid propagation occurs if the node's mirror_tid had to be
2604 * updated while adjusting the delete_tid.
2606 * This occurs when deleting even in nohistory mode, but does not
2607 * occur when pruning an already-deleted node.
2609 * cursor->ip is NULL when called from the pruning, mirroring,
2610 * and pfs code. If non-NULL propagation will be conditionalized
2611 * on whether the PFS is in no-history mode or not.
2613 * WARNING: cursor's leaf pointer may have changed after do_propagation
2618 hammer_btree_do_propagation(cursor, cursor->ip->pfsm, leaf);
2620 hammer_btree_do_propagation(cursor, NULL, leaf);
2623 *stat_bytes = bytes;
2624 hammer_sync_unlock(trans);
2629 * Determine whether we can remove a directory. This routine checks whether
2630 * a directory is empty or not and enforces flush connectivity.
2632 * Flush connectivity requires that we block if the target directory is
2633 * currently flushing, otherwise it may not end up in the same flush group.
2635 * Returns 0 on success, ENOTEMPTY or EDEADLK (or other errors) on failure.
2638 hammer_ip_check_directory_empty(hammer_transaction_t trans, hammer_inode_t ip)
2640 struct hammer_cursor cursor;
2644 * Check directory empty
2646 hammer_init_cursor(trans, &cursor, &ip->cache[1], ip);
2648 cursor.key_beg.localization = ip->obj_localization +
2649 hammer_dir_localization(ip);
2650 cursor.key_beg.obj_id = ip->obj_id;
2651 cursor.key_beg.create_tid = 0;
2652 cursor.key_beg.delete_tid = 0;
2653 cursor.key_beg.obj_type = 0;
2654 cursor.key_beg.rec_type = HAMMER_RECTYPE_ENTRY_START;
2655 cursor.key_beg.key = HAMMER_MIN_KEY;
2657 cursor.key_end = cursor.key_beg;
2658 cursor.key_end.rec_type = HAMMER_RECTYPE_MAX;
2659 cursor.key_end.key = HAMMER_MAX_KEY;
2661 cursor.asof = ip->obj_asof;
2662 cursor.flags |= HAMMER_CURSOR_END_INCLUSIVE | HAMMER_CURSOR_ASOF;
2664 error = hammer_ip_first(&cursor);
2665 if (error == ENOENT)
2667 else if (error == 0)
2669 hammer_done_cursor(&cursor);
2674 * Localize the data payload. Directory entries may need their
2675 * localization adjusted.
2679 hammer_cursor_localize_data(hammer_data_ondisk_t data,
2680 hammer_btree_leaf_elm_t leaf)
2682 u_int32_t localization;
2684 if (leaf->base.rec_type == HAMMER_RECTYPE_DIRENTRY) {
2685 localization = leaf->base.localization &
2686 HAMMER_LOCALIZE_PSEUDOFS_MASK;
2687 if (data->entry.localization != localization) {
2688 data->entry.localization = localization;
2689 hammer_crc_set_leaf(data, leaf);