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);
48 struct rec_trunc_info {
53 struct hammer_bulk_info {
54 hammer_record_t record;
55 struct hammer_btree_leaf_elm leaf;
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().
102 hammer_rec_cmp(hammer_base_elm_t elm, hammer_record_t rec)
104 if (elm->rec_type < rec->leaf.base.rec_type)
106 if (elm->rec_type > rec->leaf.base.rec_type)
109 if (elm->key < rec->leaf.base.key)
111 if (elm->key > rec->leaf.base.key)
115 * Never match against an item deleted by the frontend
116 * or backend, or committed by the backend.
118 * elm is less then rec if rec is marked deleted.
120 if (rec->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
121 HAMMER_RECF_COMMITTED)) {
128 * Ranged scan to locate overlapping record(s). This is used by
129 * hammer_ip_get_bulk() to locate an overlapping record. We have
130 * to use a ranged scan because the keys for data records with the
131 * same file base offset can be different due to differing data_len's.
133 * NOTE: The base file offset of a data record is (key - data_len), not (key).
136 hammer_rec_overlap_cmp(hammer_record_t rec, void *data)
138 struct hammer_bulk_info *info = data;
139 hammer_btree_leaf_elm_t leaf = &info->leaf;
141 if (rec->leaf.base.rec_type < leaf->base.rec_type)
143 if (rec->leaf.base.rec_type > leaf->base.rec_type)
149 if (leaf->base.rec_type == HAMMER_RECTYPE_DATA) {
150 /* rec_beg >= leaf_end */
151 if (rec->leaf.base.key - rec->leaf.data_len >= leaf->base.key)
153 /* rec_end <= leaf_beg */
154 if (rec->leaf.base.key <= leaf->base.key - leaf->data_len)
157 if (rec->leaf.base.key < leaf->base.key)
159 if (rec->leaf.base.key > leaf->base.key)
164 * We have to return 0 at this point, even if DELETED_FE is set,
165 * because returning anything else will cause the scan to ignore
166 * one of the branches when we really want it to check both.
172 * RB_SCAN comparison code for hammer_mem_first(). The argument order
173 * is reversed so the comparison result has to be negated. key_beg and
174 * key_end are both range-inclusive.
176 * Localized deletions are not cached in-memory.
180 hammer_rec_scan_cmp(hammer_record_t rec, void *data)
182 hammer_cursor_t cursor = data;
185 r = hammer_rec_cmp(&cursor->key_beg, rec);
188 r = hammer_rec_cmp(&cursor->key_end, rec);
195 * This compare function is used when simply looking up key_beg.
199 hammer_rec_find_cmp(hammer_record_t rec, void *data)
201 hammer_cursor_t cursor = data;
204 r = hammer_rec_cmp(&cursor->key_beg, rec);
213 * Locate blocks within the truncation range. Partial blocks do not count.
217 hammer_rec_trunc_cmp(hammer_record_t rec, void *data)
219 struct rec_trunc_info *info = data;
221 if (rec->leaf.base.rec_type < info->rec_type)
223 if (rec->leaf.base.rec_type > info->rec_type)
226 switch(rec->leaf.base.rec_type) {
227 case HAMMER_RECTYPE_DB:
229 * DB record key is not beyond the truncation point, retain.
231 if (rec->leaf.base.key < info->trunc_off)
234 case HAMMER_RECTYPE_DATA:
236 * DATA record offset start is not beyond the truncation point,
239 if (rec->leaf.base.key - rec->leaf.data_len < info->trunc_off)
243 panic("hammer_rec_trunc_cmp: unexpected record type");
247 * The record start is >= the truncation point, return match,
248 * the record should be destroyed.
253 RB_GENERATE(hammer_rec_rb_tree, hammer_record, rb_node, hammer_rec_rb_compare);
256 * Allocate a record for the caller to finish filling in. The record is
257 * returned referenced.
260 hammer_alloc_mem_record(hammer_inode_t ip, int data_len)
262 hammer_record_t record;
266 ++hammer_count_records;
267 record = kmalloc(sizeof(*record), hmp->m_misc,
268 M_WAITOK | M_ZERO | M_USE_RESERVE);
269 record->flush_state = HAMMER_FST_IDLE;
271 record->leaf.base.btype = HAMMER_BTREE_TYPE_RECORD;
272 record->leaf.data_len = data_len;
273 hammer_ref(&record->lock);
276 record->data = kmalloc(data_len, hmp->m_misc, M_WAITOK | M_ZERO);
277 record->flags |= HAMMER_RECF_ALLOCDATA;
278 ++hammer_count_record_datas;
285 hammer_wait_mem_record_ident(hammer_record_t record, const char *ident)
287 while (record->flush_state == HAMMER_FST_FLUSH) {
288 record->flags |= HAMMER_RECF_WANTED;
289 tsleep(record, 0, ident, 0);
294 * Called from the backend, hammer_inode.c, after a record has been
295 * flushed to disk. The record has been exclusively locked by the
296 * caller and interlocked with BE.
298 * We clean up the state, unlock, and release the record (the record
299 * was referenced by the fact that it was in the HAMMER_FST_FLUSH state).
302 hammer_flush_record_done(hammer_record_t record, int error)
304 hammer_inode_t target_ip;
306 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
307 KKASSERT(record->flags & HAMMER_RECF_INTERLOCK_BE);
310 * If an error occured, the backend was unable to sync the
311 * record to its media. Leave the record intact.
314 hammer_critical_error(record->ip->hmp, record->ip, error,
315 "while flushing record");
318 --record->flush_group->refs;
319 record->flush_group = NULL;
322 * Adjust the flush state and dependancy based on success or
325 if (record->flags & (HAMMER_RECF_DELETED_BE | HAMMER_RECF_COMMITTED)) {
326 if ((target_ip = record->target_ip) != NULL) {
327 TAILQ_REMOVE(&target_ip->target_list, record,
329 record->target_ip = NULL;
330 hammer_test_inode(target_ip);
332 record->flush_state = HAMMER_FST_IDLE;
334 if (record->target_ip) {
335 record->flush_state = HAMMER_FST_SETUP;
336 hammer_test_inode(record->ip);
337 hammer_test_inode(record->target_ip);
339 record->flush_state = HAMMER_FST_IDLE;
342 record->flags &= ~HAMMER_RECF_INTERLOCK_BE;
347 if (record->flags & HAMMER_RECF_WANTED) {
348 record->flags &= ~HAMMER_RECF_WANTED;
351 hammer_rel_mem_record(record);
355 * Release a memory record. Records marked for deletion are immediately
356 * removed from the RB-Tree but otherwise left intact until the last ref
360 hammer_rel_mem_record(struct hammer_record *record)
363 hammer_reserve_t resv;
365 hammer_inode_t target_ip;
367 hammer_unref(&record->lock);
369 if (record->lock.refs == 0) {
371 * Upon release of the last reference wakeup any waiters.
372 * The record structure may get destroyed so callers will
373 * loop up and do a relookup.
375 * WARNING! Record must be removed from RB-TREE before we
376 * might possibly block. hammer_test_inode() can block!
382 * Upon release of the last reference a record marked deleted
383 * by the front or backend, or committed by the backend,
386 if (record->flags & (HAMMER_RECF_DELETED_FE |
387 HAMMER_RECF_DELETED_BE |
388 HAMMER_RECF_COMMITTED)) {
389 KKASSERT(ip->lock.refs > 0);
390 KKASSERT(record->flush_state != HAMMER_FST_FLUSH);
393 * target_ip may have zero refs, we have to ref it
394 * to prevent it from being ripped out from under
397 if ((target_ip = record->target_ip) != NULL) {
398 TAILQ_REMOVE(&target_ip->target_list,
399 record, target_entry);
400 record->target_ip = NULL;
401 hammer_ref(&target_ip->lock);
404 if (record->flags & HAMMER_RECF_ONRBTREE) {
405 RB_REMOVE(hammer_rec_rb_tree,
406 &record->ip->rec_tree,
408 KKASSERT(ip->rsv_recs > 0);
411 hmp->rsv_databytes -= record->leaf.data_len;
412 record->flags &= ~HAMMER_RECF_ONRBTREE;
414 if (RB_EMPTY(&record->ip->rec_tree)) {
415 record->ip->flags &= ~HAMMER_INODE_XDIRTY;
416 record->ip->sync_flags &= ~HAMMER_INODE_XDIRTY;
417 hammer_test_inode(record->ip);
422 * We must wait for any direct-IO to complete before
423 * we can destroy the record because the bio may
424 * have a reference to it.
427 (HAMMER_RECF_DIRECT_IO | HAMMER_RECF_DIRECT_INVAL)) {
428 hammer_io_direct_wait(record);
433 * Do this test after removing record from the B-Tree.
436 hammer_test_inode(target_ip);
437 hammer_rel_inode(target_ip, 0);
440 if (record->flags & HAMMER_RECF_ALLOCDATA) {
441 --hammer_count_record_datas;
442 kfree(record->data, hmp->m_misc);
443 record->flags &= ~HAMMER_RECF_ALLOCDATA;
447 * Release the reservation.
449 * If the record was not committed we can theoretically
450 * undo the reservation. However, doing so might
451 * create weird edge cases with the ordering of
452 * direct writes because the related buffer cache
453 * elements are per-vnode. So we don't try.
455 if ((resv = record->resv) != NULL) {
456 /* XXX undo leaf.data_offset,leaf.data_len */
457 hammer_blockmap_reserve_complete(hmp, resv);
461 --hammer_count_records;
462 kfree(record, hmp->m_misc);
468 * Record visibility depends on whether the record is being accessed by
469 * the backend or the frontend. Backend tests ignore the frontend delete
470 * flag. Frontend tests do NOT ignore the backend delete/commit flags and
471 * must also check for commit races.
473 * Return non-zero if the record is visible, zero if it isn't or if it is
474 * deleted. Returns 0 if the record has been comitted (unless the special
475 * delete-visibility flag is set). A committed record must be located
476 * via the media B-Tree. Returns non-zero if the record is good.
478 * If HAMMER_CURSOR_DELETE_VISIBILITY is set we allow deleted memory
479 * records to be returned. This is so pending deletions are detected
480 * when using an iterator to locate an unused hash key, or when we need
481 * to locate historical records on-disk to destroy.
485 hammer_ip_iterate_mem_good(hammer_cursor_t cursor, hammer_record_t record)
487 if (cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY)
489 if (cursor->flags & HAMMER_CURSOR_BACKEND) {
490 if (record->flags & (HAMMER_RECF_DELETED_BE |
491 HAMMER_RECF_COMMITTED)) {
495 if (record->flags & (HAMMER_RECF_DELETED_FE |
496 HAMMER_RECF_DELETED_BE |
497 HAMMER_RECF_COMMITTED)) {
505 * This callback is used as part of the RB_SCAN function for in-memory
506 * records. We terminate it (return -1) as soon as we get a match.
508 * This routine is used by frontend code.
510 * The primary compare code does not account for ASOF lookups. This
511 * code handles that case as well as a few others.
515 hammer_rec_scan_callback(hammer_record_t rec, void *data)
517 hammer_cursor_t cursor = data;
520 * We terminate on success, so this should be NULL on entry.
522 KKASSERT(cursor->iprec == NULL);
525 * Skip if the record was marked deleted or committed.
527 if (hammer_ip_iterate_mem_good(cursor, rec) == 0)
531 * Skip if not visible due to our as-of TID
533 if (cursor->flags & HAMMER_CURSOR_ASOF) {
534 if (cursor->asof < rec->leaf.base.create_tid)
536 if (rec->leaf.base.delete_tid &&
537 cursor->asof >= rec->leaf.base.delete_tid) {
543 * ref the record. The record is protected from backend B-Tree
544 * interactions by virtue of the cursor's IP lock.
546 hammer_ref(&rec->lock);
549 * The record may have been deleted or committed while we
550 * were blocked. XXX remove?
552 if (hammer_ip_iterate_mem_good(cursor, rec) == 0) {
553 hammer_rel_mem_record(rec);
558 * Set the matching record and stop the scan.
566 * Lookup an in-memory record given the key specified in the cursor. Works
567 * just like hammer_btree_lookup() but operates on an inode's in-memory
570 * The lookup must fail if the record is marked for deferred deletion.
572 * The API for mem/btree_lookup() does not mess with the ATE/EOF bits.
576 hammer_mem_lookup(hammer_cursor_t cursor)
578 KKASSERT(cursor->ip);
580 hammer_rel_mem_record(cursor->iprec);
581 cursor->iprec = NULL;
583 hammer_rec_rb_tree_RB_SCAN(&cursor->ip->rec_tree, hammer_rec_find_cmp,
584 hammer_rec_scan_callback, cursor);
586 return (cursor->iprec ? 0 : ENOENT);
590 * hammer_mem_first() - locate the first in-memory record matching the
591 * cursor within the bounds of the key range.
593 * WARNING! API is slightly different from btree_first(). hammer_mem_first()
594 * will set ATEMEM the same as MEMEOF, and does not return any error.
598 hammer_mem_first(hammer_cursor_t cursor)
603 KKASSERT(ip != NULL);
606 hammer_rel_mem_record(cursor->iprec);
607 cursor->iprec = NULL;
609 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_scan_cmp,
610 hammer_rec_scan_callback, cursor);
613 cursor->flags &= ~(HAMMER_CURSOR_MEMEOF | HAMMER_CURSOR_ATEMEM);
615 cursor->flags |= HAMMER_CURSOR_MEMEOF | HAMMER_CURSOR_ATEMEM;
618 /************************************************************************
619 * HAMMER IN-MEMORY RECORD FUNCTIONS *
620 ************************************************************************
622 * These functions manipulate in-memory records. Such records typically
623 * exist prior to being committed to disk or indexed via the on-disk B-Tree.
627 * Add a directory entry (dip,ncp) which references inode (ip).
629 * Note that the low 32 bits of the namekey are set temporarily to create
630 * a unique in-memory record, and may be modified a second time when the
631 * record is synchronized to disk. In particular, the low 32 bits cannot be
632 * all 0's when synching to disk, which is not handled here.
634 * NOTE: bytes does not include any terminating \0 on name, and name might
638 hammer_ip_add_directory(struct hammer_transaction *trans,
639 struct hammer_inode *dip, const char *name, int bytes,
640 struct hammer_inode *ip)
642 struct hammer_cursor cursor;
643 hammer_record_t record;
645 u_int32_t max_iterations;
647 record = hammer_alloc_mem_record(dip, HAMMER_ENTRY_SIZE(bytes));
649 record->type = HAMMER_MEM_RECORD_ADD;
650 record->leaf.base.localization = dip->obj_localization +
651 HAMMER_LOCALIZE_MISC;
652 record->leaf.base.obj_id = dip->obj_id;
653 record->leaf.base.key = hammer_directory_namekey(dip, name, bytes,
655 record->leaf.base.rec_type = HAMMER_RECTYPE_DIRENTRY;
656 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
657 record->data->entry.obj_id = ip->obj_id;
658 record->data->entry.localization = ip->obj_localization;
659 bcopy(name, record->data->entry.name, bytes);
661 ++ip->ino_data.nlinks;
662 hammer_modify_inode(ip, HAMMER_INODE_DDIRTY);
665 * Find an unused namekey. Both the in-memory record tree and
666 * the B-Tree are checked. We do not want historically deleted
667 * names to create a collision as our iteration space may be limited,
668 * and since create_tid wouldn't match anyway an ASOF search
669 * must be used to locate collisions.
671 * delete-visibility is set so pending deletions do not give us
672 * a false-negative on our ability to use an iterator.
674 * The iterator must not rollover the key. Directory keys only
675 * use the positive key space.
677 hammer_init_cursor(trans, &cursor, &dip->cache[1], dip);
678 cursor.key_beg = record->leaf.base;
679 cursor.flags |= HAMMER_CURSOR_ASOF;
680 cursor.flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
681 cursor.asof = ip->obj_asof;
683 while (hammer_ip_lookup(&cursor) == 0) {
684 ++record->leaf.base.key;
685 KKASSERT(record->leaf.base.key > 0);
686 cursor.key_beg.key = record->leaf.base.key;
687 if (--max_iterations == 0) {
688 hammer_rel_mem_record(record);
695 * The target inode and the directory entry are bound together.
697 record->target_ip = ip;
698 record->flush_state = HAMMER_FST_SETUP;
699 TAILQ_INSERT_TAIL(&ip->target_list, record, target_entry);
702 * The inode now has a dependancy and must be taken out of the idle
703 * state. An inode not in an idle state is given an extra reference.
705 * When transitioning to a SETUP state flag for an automatic reflush
706 * when the dependancies are disposed of if someone is waiting on
709 if (ip->flush_state == HAMMER_FST_IDLE) {
710 hammer_ref(&ip->lock);
711 ip->flush_state = HAMMER_FST_SETUP;
712 if (ip->flags & HAMMER_INODE_FLUSHW)
713 ip->flags |= HAMMER_INODE_REFLUSH;
715 error = hammer_mem_add(record);
717 dip->ino_data.mtime = trans->time;
718 hammer_modify_inode(dip, HAMMER_INODE_MTIME);
721 hammer_done_cursor(&cursor);
726 * Delete the directory entry and update the inode link count. The
727 * cursor must be seeked to the directory entry record being deleted.
729 * The related inode should be share-locked by the caller. The caller is
730 * on the frontend. It could also be NULL indicating that the directory
731 * entry being removed has no related inode.
733 * This function can return EDEADLK requiring the caller to terminate
734 * the cursor, any locks, wait on the returned record, and retry.
737 hammer_ip_del_directory(struct hammer_transaction *trans,
738 hammer_cursor_t cursor, struct hammer_inode *dip,
739 struct hammer_inode *ip)
741 hammer_record_t record;
744 if (hammer_cursor_inmem(cursor)) {
746 * In-memory (unsynchronized) records can simply be freed.
748 * Even though the HAMMER_RECF_DELETED_FE flag is ignored
749 * by the backend, we must still avoid races against the
750 * backend potentially syncing the record to the media.
752 * We cannot call hammer_ip_delete_record(), that routine may
753 * only be called from the backend.
755 record = cursor->iprec;
756 if (record->flags & (HAMMER_RECF_INTERLOCK_BE |
757 HAMMER_RECF_DELETED_BE |
758 HAMMER_RECF_COMMITTED)) {
759 KKASSERT(cursor->deadlk_rec == NULL);
760 hammer_ref(&record->lock);
761 cursor->deadlk_rec = record;
764 KKASSERT(record->type == HAMMER_MEM_RECORD_ADD);
765 record->flags |= HAMMER_RECF_DELETED_FE;
770 * If the record is on-disk we have to queue the deletion by
771 * the record's key. This also causes lookups to skip the
774 KKASSERT(dip->flags &
775 (HAMMER_INODE_ONDISK | HAMMER_INODE_DONDISK));
776 record = hammer_alloc_mem_record(dip, 0);
777 record->type = HAMMER_MEM_RECORD_DEL;
778 record->leaf.base = cursor->leaf->base;
781 * ip may be NULL, indicating the deletion of a directory
782 * entry which has no related inode.
784 record->target_ip = ip;
786 record->flush_state = HAMMER_FST_SETUP;
787 TAILQ_INSERT_TAIL(&ip->target_list, record,
790 record->flush_state = HAMMER_FST_IDLE;
794 * The inode now has a dependancy and must be taken out of
795 * the idle state. An inode not in an idle state is given
796 * an extra reference.
798 * When transitioning to a SETUP state flag for an automatic
799 * reflush when the dependancies are disposed of if someone
800 * is waiting on the inode.
802 if (ip && ip->flush_state == HAMMER_FST_IDLE) {
803 hammer_ref(&ip->lock);
804 ip->flush_state = HAMMER_FST_SETUP;
805 if (ip->flags & HAMMER_INODE_FLUSHW)
806 ip->flags |= HAMMER_INODE_REFLUSH;
809 error = hammer_mem_add(record);
813 * One less link. The file may still be open in the OS even after
814 * all links have gone away.
816 * We have to terminate the cursor before syncing the inode to
817 * avoid deadlocking against ourselves. XXX this may no longer
820 * If nlinks drops to zero and the vnode is inactive (or there is
821 * no vnode), call hammer_inode_unloadable_check() to zonk the
822 * inode. If we don't do this here the inode will not be destroyed
823 * on-media until we unmount.
827 --ip->ino_data.nlinks; /* do before we might block */
828 dip->ino_data.mtime = trans->time;
829 hammer_modify_inode(dip, HAMMER_INODE_MTIME);
831 hammer_modify_inode(ip, HAMMER_INODE_DDIRTY);
832 if (ip->ino_data.nlinks == 0 &&
833 (ip->vp == NULL || (ip->vp->v_flag & VINACTIVE))) {
834 hammer_done_cursor(cursor);
835 hammer_inode_unloadable_check(ip, 1);
836 hammer_flush_inode(ip, 0);
845 * Add a record to an inode.
847 * The caller must allocate the record with hammer_alloc_mem_record(ip) and
848 * initialize the following additional fields:
850 * The related inode should be share-locked by the caller. The caller is
853 * record->rec.entry.base.base.key
854 * record->rec.entry.base.base.rec_type
855 * record->rec.entry.base.base.data_len
856 * record->data (a copy will be kmalloc'd if it cannot be embedded)
859 hammer_ip_add_record(struct hammer_transaction *trans, hammer_record_t record)
861 hammer_inode_t ip = record->ip;
864 KKASSERT(record->leaf.base.localization != 0);
865 record->leaf.base.obj_id = ip->obj_id;
866 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
867 error = hammer_mem_add(record);
872 * Locate a bulk record in-memory. Bulk records allow disk space to be
873 * reserved so the front-end can flush large data writes without having
874 * to queue the BIO to the flusher. Only the related record gets queued
878 static hammer_record_t
879 hammer_ip_get_bulk(hammer_inode_t ip, off_t file_offset, int bytes)
881 struct hammer_bulk_info info;
883 bzero(&info, sizeof(info));
884 info.leaf.base.obj_id = ip->obj_id;
885 info.leaf.base.key = file_offset + bytes;
886 info.leaf.base.create_tid = 0;
887 info.leaf.base.delete_tid = 0;
888 info.leaf.base.rec_type = HAMMER_RECTYPE_DATA;
889 info.leaf.base.obj_type = 0; /* unused */
890 info.leaf.base.btype = HAMMER_BTREE_TYPE_RECORD; /* unused */
891 info.leaf.base.localization = ip->obj_localization + /* unused */
892 HAMMER_LOCALIZE_MISC;
893 info.leaf.data_len = bytes;
895 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_overlap_cmp,
896 hammer_bulk_scan_callback, &info);
898 return(info.record); /* may be NULL */
902 * Take records vetted by overlap_cmp. The first non-deleted record
903 * (if any) stops the scan.
906 hammer_bulk_scan_callback(hammer_record_t record, void *data)
908 struct hammer_bulk_info *info = data;
910 if (record->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
911 HAMMER_RECF_COMMITTED)) {
914 hammer_ref(&record->lock);
915 info->record = record;
916 return(-1); /* stop scan */
920 * Reserve blockmap space placemarked with an in-memory record.
922 * This routine is called by the frontend in order to be able to directly
923 * flush a buffer cache buffer. The frontend has locked the related buffer
924 * cache buffers and we should be able to manipulate any overlapping
927 * The caller is responsible for adding the returned record.
930 hammer_ip_add_bulk(hammer_inode_t ip, off_t file_offset, void *data, int bytes,
933 hammer_record_t record;
934 hammer_record_t conflict;
938 * Deal with conflicting in-memory records. We cannot have multiple
939 * in-memory records for the same base offset without seriously
940 * confusing the backend, including but not limited to the backend
941 * issuing delete-create-delete or create-delete-create sequences
942 * and asserting on the delete_tid being the same as the create_tid.
944 * If we encounter a record with the backend interlock set we cannot
945 * immediately delete it without confusing the backend.
947 while ((conflict = hammer_ip_get_bulk(ip, file_offset, bytes)) !=NULL) {
948 if (conflict->flags & HAMMER_RECF_INTERLOCK_BE) {
949 conflict->flags |= HAMMER_RECF_WANTED;
950 tsleep(conflict, 0, "hmrrc3", 0);
952 conflict->flags |= HAMMER_RECF_DELETED_FE;
954 hammer_rel_mem_record(conflict);
958 * Create a record to cover the direct write. This is called with
959 * the related BIO locked so there should be no possible conflict.
961 * The backend is responsible for finalizing the space reserved in
964 * XXX bytes not aligned, depend on the reservation code to
965 * align the reservation.
967 record = hammer_alloc_mem_record(ip, 0);
968 zone = (bytes >= HAMMER_BUFSIZE) ? HAMMER_ZONE_LARGE_DATA_INDEX :
969 HAMMER_ZONE_SMALL_DATA_INDEX;
970 record->resv = hammer_blockmap_reserve(ip->hmp, zone, bytes,
971 &record->leaf.data_offset,
973 if (record->resv == NULL) {
974 kprintf("hammer_ip_add_bulk: reservation failed\n");
975 hammer_rel_mem_record(record);
978 record->type = HAMMER_MEM_RECORD_DATA;
979 record->leaf.base.rec_type = HAMMER_RECTYPE_DATA;
980 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
981 record->leaf.base.obj_id = ip->obj_id;
982 record->leaf.base.key = file_offset + bytes;
983 record->leaf.base.localization = ip->obj_localization +
984 HAMMER_LOCALIZE_MISC;
985 record->leaf.data_len = bytes;
986 hammer_crc_set_leaf(data, &record->leaf);
987 KKASSERT(*errorp == 0);
992 * Frontend truncation code. Scan in-memory records only. On-disk records
993 * and records in a flushing state are handled by the backend. The vnops
994 * setattr code will handle the block containing the truncation point.
996 * Partial blocks are not deleted.
999 hammer_ip_frontend_trunc(struct hammer_inode *ip, off_t file_size)
1001 struct rec_trunc_info info;
1003 switch(ip->ino_data.obj_type) {
1004 case HAMMER_OBJTYPE_REGFILE:
1005 info.rec_type = HAMMER_RECTYPE_DATA;
1007 case HAMMER_OBJTYPE_DBFILE:
1008 info.rec_type = HAMMER_RECTYPE_DB;
1013 info.trunc_off = file_size;
1014 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_trunc_cmp,
1015 hammer_frontend_trunc_callback, &info);
1020 hammer_frontend_trunc_callback(hammer_record_t record, void *data __unused)
1022 if (record->flags & HAMMER_RECF_DELETED_FE)
1024 if (record->flush_state == HAMMER_FST_FLUSH)
1026 KKASSERT((record->flags & HAMMER_RECF_INTERLOCK_BE) == 0);
1027 hammer_ref(&record->lock);
1028 record->flags |= HAMMER_RECF_DELETED_FE;
1029 hammer_rel_mem_record(record);
1034 * Return 1 if the caller must check for and delete existing records
1035 * before writing out a new data record.
1037 * Return 0 if the caller can just insert the record into the B-Tree without
1041 hammer_record_needs_overwrite_delete(hammer_record_t record)
1043 hammer_inode_t ip = record->ip;
1044 int64_t file_offset;
1047 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE)
1048 file_offset = record->leaf.base.key;
1050 file_offset = record->leaf.base.key - record->leaf.data_len;
1051 r = (file_offset < ip->save_trunc_off);
1052 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1053 if (ip->save_trunc_off <= record->leaf.base.key)
1054 ip->save_trunc_off = record->leaf.base.key + 1;
1056 if (ip->save_trunc_off < record->leaf.base.key)
1057 ip->save_trunc_off = record->leaf.base.key;
1063 * Backend code. Sync a record to the media.
1066 hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t record)
1068 hammer_transaction_t trans = cursor->trans;
1069 int64_t file_offset;
1075 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
1076 KKASSERT(record->flags & HAMMER_RECF_INTERLOCK_BE);
1077 KKASSERT(record->leaf.base.localization != 0);
1080 * Any direct-write related to the record must complete before we
1081 * can sync the record to the on-disk media.
1083 if (record->flags & (HAMMER_RECF_DIRECT_IO | HAMMER_RECF_DIRECT_INVAL))
1084 hammer_io_direct_wait(record);
1087 * If this is a bulk-data record placemarker there may be an existing
1088 * record on-disk, indicating a data overwrite. If there is the
1089 * on-disk record must be deleted before we can insert our new record.
1091 * We've synthesized this record and do not know what the create_tid
1092 * on-disk is, nor how much data it represents.
1094 * Keep in mind that (key) for data records is (base_offset + len),
1095 * not (base_offset). Also, we only want to get rid of on-disk
1096 * records since we are trying to sync our in-memory record, call
1097 * hammer_ip_delete_range() with truncating set to 1 to make sure
1098 * it skips in-memory records.
1100 * It is ok for the lookup to return ENOENT.
1102 * NOTE OPTIMIZATION: sync_trunc_off is used to determine if we have
1103 * to call hammer_ip_delete_range() or not. This also means we must
1104 * update sync_trunc_off() as we write.
1106 if (record->type == HAMMER_MEM_RECORD_DATA &&
1107 hammer_record_needs_overwrite_delete(record)) {
1108 file_offset = record->leaf.base.key - record->leaf.data_len;
1109 bytes = (record->leaf.data_len + HAMMER_BUFMASK) &
1111 KKASSERT((file_offset & HAMMER_BUFMASK) == 0);
1112 error = hammer_ip_delete_range(
1114 file_offset, file_offset + bytes - 1,
1116 if (error && error != ENOENT)
1121 * If this is a general record there may be an on-disk version
1122 * that must be deleted before we can insert the new record.
1124 if (record->type == HAMMER_MEM_RECORD_GENERAL) {
1125 error = hammer_delete_general(cursor, record->ip,
1127 if (error && error != ENOENT)
1134 hammer_normalize_cursor(cursor);
1135 cursor->key_beg = record->leaf.base;
1136 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
1137 cursor->flags |= HAMMER_CURSOR_BACKEND;
1138 cursor->flags &= ~HAMMER_CURSOR_INSERT;
1141 * Records can wind up on-media before the inode itself is on-media.
1144 record->ip->flags |= HAMMER_INODE_DONDISK;
1147 * If we are deleting a directory entry an exact match must be
1150 if (record->type == HAMMER_MEM_RECORD_DEL) {
1151 error = hammer_btree_lookup(cursor);
1153 KKASSERT(cursor->iprec == NULL);
1154 error = hammer_ip_delete_record(cursor, record->ip,
1157 record->flags |= HAMMER_RECF_DELETED_BE |
1158 HAMMER_RECF_COMMITTED;
1159 ++record->ip->rec_generation;
1168 * Issue a lookup to position the cursor and locate the cluster. The
1169 * target key should not exist. If we are creating a directory entry
1170 * we may have to iterate the low 32 bits of the key to find an unused
1173 hammer_sync_lock_sh(trans);
1174 cursor->flags |= HAMMER_CURSOR_INSERT;
1175 error = hammer_btree_lookup(cursor);
1176 if (hammer_debug_inode)
1177 kprintf("DOINSERT LOOKUP %d\n", error);
1179 kprintf("hammer_ip_sync_record: duplicate rec "
1180 "at (%016llx)\n", record->leaf.base.key);
1181 Debugger("duplicate record1");
1185 if (record->type == HAMMER_MEM_RECORD_DATA)
1186 kprintf("sync_record %016llx ---------------- %016llx %d\n",
1187 record->leaf.base.key - record->leaf.data_len,
1188 record->leaf.data_offset, error);
1191 if (error != ENOENT)
1195 * Allocate the record and data. The result buffers will be
1196 * marked as being modified and further calls to
1197 * hammer_modify_buffer() will result in unneeded UNDO records.
1199 * Support zero-fill records (data == NULL and data_len != 0)
1201 if (record->type == HAMMER_MEM_RECORD_DATA) {
1203 * The data portion of a bulk-data record has already been
1204 * committed to disk, we need only adjust the layer2
1205 * statistics in the same transaction as our B-Tree insert.
1207 KKASSERT(record->leaf.data_offset != 0);
1208 error = hammer_blockmap_finalize(trans,
1210 record->leaf.data_offset,
1211 record->leaf.data_len);
1212 } else if (record->data && record->leaf.data_len) {
1214 * Wholely cached record, with data. Allocate the data.
1216 bdata = hammer_alloc_data(trans, record->leaf.data_len,
1217 record->leaf.base.rec_type,
1218 &record->leaf.data_offset,
1219 &cursor->data_buffer, &error);
1222 hammer_crc_set_leaf(record->data, &record->leaf);
1223 hammer_modify_buffer(trans, cursor->data_buffer, NULL, 0);
1224 bcopy(record->data, bdata, record->leaf.data_len);
1225 hammer_modify_buffer_done(cursor->data_buffer);
1228 * Wholely cached record, without data.
1230 record->leaf.data_offset = 0;
1231 record->leaf.data_crc = 0;
1234 error = hammer_btree_insert(cursor, &record->leaf, &doprop);
1235 if (hammer_debug_inode && error)
1236 kprintf("BTREE INSERT error %d @ %016llx:%d key %016llx\n", error, cursor->node->node_offset, cursor->index, record->leaf.base.key);
1239 * Our record is on-disk and we normally mark the in-memory version
1240 * as having been committed (and not BE-deleted).
1242 * If the record represented a directory deletion but we had to
1243 * sync a valid directory entry to disk due to dependancies,
1244 * we must convert the record to a covering delete so the
1245 * frontend does not have visibility on the synced entry.
1249 hammer_btree_do_propagation(cursor,
1253 if (record->flags & HAMMER_RECF_CONVERT_DELETE) {
1255 * Must convert deleted directory entry add
1256 * to a directory entry delete.
1258 KKASSERT(record->type == HAMMER_MEM_RECORD_ADD);
1259 record->flags &= ~HAMMER_RECF_DELETED_FE;
1260 record->type = HAMMER_MEM_RECORD_DEL;
1261 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
1262 record->flags &= ~HAMMER_RECF_CONVERT_DELETE;
1263 KKASSERT((record->flags & (HAMMER_RECF_COMMITTED |
1264 HAMMER_RECF_DELETED_BE)) == 0);
1265 /* converted record is not yet committed */
1266 /* hammer_flush_record_done takes care of the rest */
1269 * Everything went fine and we are now done with
1272 record->flags |= HAMMER_RECF_COMMITTED;
1273 ++record->ip->rec_generation;
1276 if (record->leaf.data_offset) {
1277 hammer_blockmap_free(trans, record->leaf.data_offset,
1278 record->leaf.data_len);
1282 hammer_sync_unlock(trans);
1288 * Add the record to the inode's rec_tree. The low 32 bits of a directory
1289 * entry's key is used to deal with hash collisions in the upper 32 bits.
1290 * A unique 64 bit key is generated in-memory and may be regenerated a
1291 * second time when the directory record is flushed to the on-disk B-Tree.
1293 * A referenced record is passed to this function. This function
1294 * eats the reference. If an error occurs the record will be deleted.
1296 * A copy of the temporary record->data pointer provided by the caller
1300 hammer_mem_add(hammer_record_t record)
1302 hammer_mount_t hmp = record->ip->hmp;
1305 * Make a private copy of record->data
1308 KKASSERT(record->flags & HAMMER_RECF_ALLOCDATA);
1311 * Insert into the RB tree. A unique key should have already
1312 * been selected if this is a directory entry.
1314 if (RB_INSERT(hammer_rec_rb_tree, &record->ip->rec_tree, record)) {
1315 record->flags |= HAMMER_RECF_DELETED_FE;
1316 hammer_rel_mem_record(record);
1319 ++hmp->count_newrecords;
1321 ++record->ip->rsv_recs;
1322 record->ip->hmp->rsv_databytes += record->leaf.data_len;
1323 record->flags |= HAMMER_RECF_ONRBTREE;
1324 hammer_modify_inode(record->ip, HAMMER_INODE_XDIRTY);
1325 hammer_rel_mem_record(record);
1329 /************************************************************************
1330 * HAMMER INODE MERGED-RECORD FUNCTIONS *
1331 ************************************************************************
1333 * These functions augment the B-Tree scanning functions in hammer_btree.c
1334 * by merging in-memory records with on-disk records.
1338 * Locate a particular record either in-memory or on-disk.
1340 * NOTE: This is basically a standalone routine, hammer_ip_next() may
1341 * NOT be called to iterate results.
1344 hammer_ip_lookup(hammer_cursor_t cursor)
1349 * If the element is in-memory return it without searching the
1352 KKASSERT(cursor->ip);
1353 error = hammer_mem_lookup(cursor);
1355 cursor->leaf = &cursor->iprec->leaf;
1358 if (error != ENOENT)
1362 * If the inode has on-disk components search the on-disk B-Tree.
1364 if ((cursor->ip->flags & (HAMMER_INODE_ONDISK|HAMMER_INODE_DONDISK)) == 0)
1366 error = hammer_btree_lookup(cursor);
1368 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
1373 * Helper for hammer_ip_first()/hammer_ip_next()
1375 * NOTE: Both ATEDISK and DISKEOF will be set the same. This sets up
1376 * hammer_ip_first() for calling hammer_ip_next(), and sets up the re-seek
1377 * state if hammer_ip_next() needs to re-seek.
1381 _hammer_ip_seek_btree(hammer_cursor_t cursor)
1383 hammer_inode_t ip = cursor->ip;
1386 if (ip->flags & (HAMMER_INODE_ONDISK|HAMMER_INODE_DONDISK)) {
1387 error = hammer_btree_lookup(cursor);
1388 if (error == ENOENT || error == EDEADLK) {
1389 if (hammer_debug_general & 0x2000)
1390 kprintf("error %d node %p %016llx index %d\n", error, cursor->node, cursor->node->node_offset, cursor->index);
1391 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
1392 error = hammer_btree_iterate(cursor);
1395 cursor->flags &= ~(HAMMER_CURSOR_DISKEOF |
1396 HAMMER_CURSOR_ATEDISK);
1398 cursor->flags |= HAMMER_CURSOR_DISKEOF |
1399 HAMMER_CURSOR_ATEDISK;
1400 if (error == ENOENT)
1404 cursor->flags |= HAMMER_CURSOR_DISKEOF | HAMMER_CURSOR_ATEDISK;
1411 * Helper for hammer_ip_next()
1413 * The caller has determined that the media cursor is further along than the
1414 * memory cursor and must be reseeked after a generation number change.
1418 _hammer_ip_reseek(hammer_cursor_t cursor)
1420 struct hammer_base_elm save;
1421 hammer_btree_elm_t elm;
1429 kprintf("HAMMER: Debug: re-seeked during scan @ino=%016llx\n",
1430 (long long)cursor->ip->obj_id);
1431 save = cursor->key_beg;
1432 cursor->key_beg = cursor->iprec->leaf.base;
1433 error = _hammer_ip_seek_btree(cursor);
1434 KKASSERT(error == 0);
1435 cursor->key_beg = save;
1438 * If the memory record was previous returned to
1439 * the caller and the media record matches
1440 * (-1/+1: only create_tid differs), then iterate
1441 * the media record to avoid a double result.
1443 if ((cursor->flags & HAMMER_CURSOR_ATEDISK) == 0 &&
1444 (cursor->flags & HAMMER_CURSOR_LASTWASMEM)) {
1445 elm = &cursor->node->ondisk->elms[cursor->index];
1446 r = hammer_btree_cmp(&elm->base,
1447 &cursor->iprec->leaf.base);
1448 if (cursor->flags & HAMMER_CURSOR_ASOF) {
1449 if (r >= -1 && r <= 1) {
1450 kprintf("HAMMER: Debug: iterated after "
1451 "re-seek (asof r=%d)\n", r);
1452 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1457 kprintf("HAMMER: Debug: iterated after "
1459 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1468 * Locate the first record within the cursor's key_beg/key_end range,
1469 * restricted to a particular inode. 0 is returned on success, ENOENT
1470 * if no records matched the requested range, or some other error.
1472 * When 0 is returned hammer_ip_next() may be used to iterate additional
1473 * records within the requested range.
1475 * This function can return EDEADLK, requiring the caller to terminate
1476 * the cursor and try again.
1480 hammer_ip_first(hammer_cursor_t cursor)
1482 hammer_inode_t ip = cursor->ip;
1485 KKASSERT(ip != NULL);
1488 * Clean up fields and setup for merged scan
1490 cursor->flags &= ~HAMMER_CURSOR_RETEST;
1493 * Search the in-memory record list (Red-Black tree). Unlike the
1494 * B-Tree search, mem_first checks for records in the range.
1496 * This function will setup both ATEMEM and MEMEOF properly for
1497 * the ip iteration. ATEMEM will be set if MEMEOF is set.
1499 hammer_mem_first(cursor);
1502 * Detect generation changes during blockages, including
1503 * blockages which occur on the initial btree search.
1505 cursor->rec_generation = cursor->ip->rec_generation;
1508 * Initial search and result
1510 error = _hammer_ip_seek_btree(cursor);
1512 error = hammer_ip_next(cursor);
1518 * Retrieve the next record in a merged iteration within the bounds of the
1519 * cursor. This call may be made multiple times after the cursor has been
1520 * initially searched with hammer_ip_first().
1522 * There are numerous special cases in this code to deal with races between
1523 * in-memory records and on-media records.
1525 * 0 is returned on success, ENOENT if no further records match the
1526 * requested range, or some other error code is returned.
1529 hammer_ip_next(hammer_cursor_t cursor)
1531 hammer_btree_elm_t elm;
1532 hammer_record_t rec;
1533 hammer_record_t tmprec;
1539 * Get the next on-disk record
1541 * NOTE: If we deleted the last on-disk record we had scanned
1542 * ATEDISK will be clear and RETEST will be set, forcing
1543 * a call to iterate. The fact that ATEDISK is clear causes
1544 * iterate to re-test the 'current' element. If ATEDISK is
1545 * set, iterate will skip the 'current' element.
1548 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
1549 if (cursor->flags & (HAMMER_CURSOR_ATEDISK |
1550 HAMMER_CURSOR_RETEST)) {
1551 error = hammer_btree_iterate(cursor);
1552 cursor->flags &= ~HAMMER_CURSOR_RETEST;
1554 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
1555 hammer_cache_node(&cursor->ip->cache[1],
1557 } else if (error == ENOENT) {
1558 cursor->flags |= HAMMER_CURSOR_DISKEOF |
1559 HAMMER_CURSOR_ATEDISK;
1566 * If the generation changed the backend has deleted or committed
1567 * one or more memory records since our last check.
1569 * When this case occurs if the disk cursor is > current memory record
1570 * or the disk cursor is at EOF, we must re-seek the disk-cursor.
1571 * Since the cursor is ahead it must have not yet been eaten (if
1572 * not at eof anyway). (XXX data offset case?)
1574 * NOTE: we are not doing a full check here. That will be handled
1577 * If we have exhausted all memory records we do not have to do any
1580 while (cursor->rec_generation != cursor->ip->rec_generation &&
1583 kprintf("HAMMER: Debug: generation changed during scan @ino=%016llx\n", (long long)cursor->ip->obj_id);
1584 cursor->rec_generation = cursor->ip->rec_generation;
1585 if (cursor->flags & HAMMER_CURSOR_MEMEOF)
1587 if (cursor->flags & HAMMER_CURSOR_DISKEOF) {
1590 KKASSERT((cursor->flags & HAMMER_CURSOR_ATEDISK) == 0);
1591 elm = &cursor->node->ondisk->elms[cursor->index];
1592 r = hammer_btree_cmp(&elm->base,
1593 &cursor->iprec->leaf.base);
1597 * Do we re-seek the media cursor?
1600 if (_hammer_ip_reseek(cursor))
1606 * We can now safely get the next in-memory record. We cannot
1609 * hammer_rec_scan_cmp: Is the record still in our general range,
1610 * (non-inclusive of snapshot exclusions)?
1611 * hammer_rec_scan_callback: Is the record in our snapshot?
1614 if ((cursor->flags & HAMMER_CURSOR_MEMEOF) == 0) {
1616 * If the current memory record was eaten then get the next
1617 * one. Stale records are skipped.
1619 if (cursor->flags & HAMMER_CURSOR_ATEMEM) {
1620 tmprec = cursor->iprec;
1621 cursor->iprec = NULL;
1622 rec = hammer_rec_rb_tree_RB_NEXT(tmprec);
1624 if (hammer_rec_scan_cmp(rec, cursor) != 0)
1626 if (hammer_rec_scan_callback(rec, cursor) != 0)
1628 rec = hammer_rec_rb_tree_RB_NEXT(rec);
1630 if (cursor->iprec) {
1631 KKASSERT(cursor->iprec == rec);
1632 cursor->flags &= ~HAMMER_CURSOR_ATEMEM;
1634 cursor->flags |= HAMMER_CURSOR_MEMEOF;
1636 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1641 * MEMORY RECORD VALIDITY TEST
1643 * (We still can't block, which is why tmprec is being held so
1646 * If the memory record is no longer valid we skip it. It may
1647 * have been deleted by the frontend. If it was deleted or
1648 * committed by the backend the generation change re-seeked the
1649 * disk cursor and the record will be present there.
1651 if (error == 0 && (cursor->flags & HAMMER_CURSOR_MEMEOF) == 0) {
1652 KKASSERT(cursor->iprec);
1653 KKASSERT((cursor->flags & HAMMER_CURSOR_ATEMEM) == 0);
1654 if (!hammer_ip_iterate_mem_good(cursor, cursor->iprec)) {
1655 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1657 hammer_rel_mem_record(tmprec);
1662 hammer_rel_mem_record(tmprec);
1665 * Extract either the disk or memory record depending on their
1666 * relative position.
1669 switch(cursor->flags & (HAMMER_CURSOR_ATEDISK | HAMMER_CURSOR_ATEMEM)) {
1672 * Both entries valid. Compare the entries and nominally
1673 * return the first one in the sort order. Numerous cases
1674 * require special attention, however.
1676 elm = &cursor->node->ondisk->elms[cursor->index];
1677 r = hammer_btree_cmp(&elm->base, &cursor->iprec->leaf.base);
1680 * If the two entries differ only by their key (-2/2) or
1681 * create_tid (-1/1), and are DATA records, we may have a
1682 * nominal match. We have to calculate the base file
1683 * offset of the data.
1685 if (r <= 2 && r >= -2 && r != 0 &&
1686 cursor->ip->ino_data.obj_type == HAMMER_OBJTYPE_REGFILE &&
1687 cursor->iprec->type == HAMMER_MEM_RECORD_DATA) {
1688 int64_t base1 = elm->leaf.base.key - elm->leaf.data_len;
1689 int64_t base2 = cursor->iprec->leaf.base.key -
1690 cursor->iprec->leaf.data_len;
1696 error = hammer_btree_extract(cursor,
1697 HAMMER_CURSOR_GET_LEAF);
1698 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1699 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1704 * If the entries match exactly the memory entry is either
1705 * an on-disk directory entry deletion or a bulk data
1706 * overwrite. If it is a directory entry deletion we eat
1709 * For the bulk-data overwrite case it is possible to have
1710 * visibility into both, which simply means the syncer
1711 * hasn't gotten around to doing the delete+insert sequence
1712 * on the B-Tree. Use the memory entry and throw away the
1715 * If the in-memory record is not either of these we
1716 * probably caught the syncer while it was syncing it to
1717 * the media. Since we hold a shared lock on the cursor,
1718 * the in-memory record had better be marked deleted at
1722 if (cursor->iprec->type == HAMMER_MEM_RECORD_DEL) {
1723 if ((cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1724 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1725 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1728 } else if (cursor->iprec->type == HAMMER_MEM_RECORD_DATA) {
1729 if ((cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1730 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1732 /* fall through to memory entry */
1734 panic("hammer_ip_next: duplicate mem/b-tree entry %p %d %08x", cursor->iprec, cursor->iprec->type, cursor->iprec->flags);
1735 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1739 /* fall through to the memory entry */
1740 case HAMMER_CURSOR_ATEDISK:
1742 * Only the memory entry is valid.
1744 cursor->leaf = &cursor->iprec->leaf;
1745 cursor->flags |= HAMMER_CURSOR_ATEMEM;
1746 cursor->flags |= HAMMER_CURSOR_LASTWASMEM;
1749 * If the memory entry is an on-disk deletion we should have
1750 * also had found a B-Tree record. If the backend beat us
1751 * to it it would have interlocked the cursor and we should
1752 * have seen the in-memory record marked DELETED_FE.
1754 if (cursor->iprec->type == HAMMER_MEM_RECORD_DEL &&
1755 (cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
1756 panic("hammer_ip_next: del-on-disk with no b-tree entry iprec %p flags %08x", cursor->iprec, cursor->iprec->flags);
1759 case HAMMER_CURSOR_ATEMEM:
1761 * Only the disk entry is valid
1763 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
1764 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1765 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1769 * Neither entry is valid
1771 * XXX error not set properly
1773 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
1774 cursor->leaf = NULL;
1782 * Resolve the cursor->data pointer for the current cursor position in
1783 * a merged iteration.
1786 hammer_ip_resolve_data(hammer_cursor_t cursor)
1788 hammer_record_t record;
1791 if (hammer_cursor_inmem(cursor)) {
1793 * The data associated with an in-memory record is usually
1794 * kmalloced, but reserve-ahead data records will have an
1795 * on-disk reference.
1797 * NOTE: Reserve-ahead data records must be handled in the
1798 * context of the related high level buffer cache buffer
1799 * to interlock against async writes.
1801 record = cursor->iprec;
1802 cursor->data = record->data;
1804 if (cursor->data == NULL) {
1805 KKASSERT(record->leaf.base.rec_type ==
1806 HAMMER_RECTYPE_DATA);
1807 cursor->data = hammer_bread_ext(cursor->trans->hmp,
1808 record->leaf.data_offset,
1809 record->leaf.data_len,
1811 &cursor->data_buffer);
1814 cursor->leaf = &cursor->node->ondisk->elms[cursor->index].leaf;
1815 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_DATA);
1821 * Backend truncation / record replacement - delete records in range.
1823 * Delete all records within the specified range for inode ip. In-memory
1824 * records still associated with the frontend are ignored.
1826 * If truncating is non-zero in-memory records associated with the back-end
1827 * are ignored. If truncating is > 1 we can return EWOULDBLOCK.
1831 * * An unaligned range will cause new records to be added to cover
1832 * the edge cases. (XXX not implemented yet).
1834 * * Replacement via reservations (see hammer_ip_sync_record_cursor())
1835 * also do not deal with unaligned ranges.
1837 * * ran_end is inclusive (e.g. 0,1023 instead of 0,1024).
1839 * * Record keys for regular file data have to be special-cased since
1840 * they indicate the end of the range (key = base + bytes).
1842 * * This function may be asked to delete ridiculously huge ranges, for
1843 * example if someone truncates or removes a 1TB regular file. We
1844 * must be very careful on restarts and we may have to stop w/
1845 * EWOULDBLOCK to avoid blowing out the buffer cache.
1848 hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip,
1849 int64_t ran_beg, int64_t ran_end, int truncating)
1851 hammer_transaction_t trans = cursor->trans;
1852 hammer_btree_leaf_elm_t leaf;
1858 kprintf("delete_range %p %016llx-%016llx\n", ip, ran_beg, ran_end);
1861 KKASSERT(trans->type == HAMMER_TRANS_FLS);
1863 hammer_normalize_cursor(cursor);
1864 cursor->key_beg.localization = ip->obj_localization +
1865 HAMMER_LOCALIZE_MISC;
1866 cursor->key_beg.obj_id = ip->obj_id;
1867 cursor->key_beg.create_tid = 0;
1868 cursor->key_beg.delete_tid = 0;
1869 cursor->key_beg.obj_type = 0;
1871 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1872 cursor->key_beg.key = ran_beg;
1873 cursor->key_beg.rec_type = HAMMER_RECTYPE_DB;
1876 * The key in the B-Tree is (base+bytes), so the first possible
1877 * matching key is ran_beg + 1.
1879 cursor->key_beg.key = ran_beg + 1;
1880 cursor->key_beg.rec_type = HAMMER_RECTYPE_DATA;
1883 cursor->key_end = cursor->key_beg;
1884 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1885 cursor->key_end.key = ran_end;
1887 tmp64 = ran_end + MAXPHYS + 1; /* work around GCC-4 bug */
1888 if (tmp64 < ran_end)
1889 cursor->key_end.key = 0x7FFFFFFFFFFFFFFFLL;
1891 cursor->key_end.key = ran_end + MAXPHYS + 1;
1894 cursor->asof = ip->obj_asof;
1895 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
1896 cursor->flags |= HAMMER_CURSOR_ASOF;
1897 cursor->flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
1898 cursor->flags |= HAMMER_CURSOR_BACKEND;
1899 cursor->flags |= HAMMER_CURSOR_END_INCLUSIVE;
1901 error = hammer_ip_first(cursor);
1904 * Iterate through matching records and mark them as deleted.
1906 while (error == 0) {
1907 leaf = cursor->leaf;
1909 KKASSERT(leaf->base.delete_tid == 0);
1910 KKASSERT(leaf->base.obj_id == ip->obj_id);
1913 * There may be overlap cases for regular file data. Also
1914 * remember the key for a regular file record is (base + len),
1917 * Note that do to duplicates (mem & media) allowed by
1918 * DELETE_VISIBILITY, off can wind up less then ran_beg.
1920 if (leaf->base.rec_type == HAMMER_RECTYPE_DATA) {
1921 off = leaf->base.key - leaf->data_len;
1923 * Check the left edge case. We currently do not
1924 * split existing records.
1926 if (off < ran_beg && leaf->base.key > ran_beg) {
1927 panic("hammer left edge case %016llx %d\n",
1928 leaf->base.key, leaf->data_len);
1932 * Check the right edge case. Note that the
1933 * record can be completely out of bounds, which
1934 * terminates the search.
1936 * base->key is exclusive of the right edge while
1937 * ran_end is inclusive of the right edge. The
1938 * (key - data_len) left boundary is inclusive.
1940 * XXX theory-check this test at some point, are
1941 * we missing a + 1 somewhere? Note that ran_end
1944 if (leaf->base.key - 1 > ran_end) {
1945 if (leaf->base.key - leaf->data_len > ran_end)
1947 panic("hammer right edge case\n");
1950 off = leaf->base.key;
1954 * Delete the record. When truncating we do not delete
1955 * in-memory (data) records because they represent data
1956 * written after the truncation.
1958 * This will also physically destroy the B-Tree entry and
1959 * data if the retention policy dictates. The function
1960 * will set HAMMER_CURSOR_RETEST to cause hammer_ip_next()
1961 * to retest the new 'current' element.
1963 if (truncating == 0 || hammer_cursor_ondisk(cursor)) {
1964 error = hammer_ip_delete_record(cursor, ip, trans->tid);
1966 * If we have built up too many meta-buffers we risk
1967 * deadlocking the kernel and must stop. This can
1968 * occur when deleting ridiculously huge files.
1969 * sync_trunc_off is updated so the next cycle does
1970 * not re-iterate records we have already deleted.
1972 * This is only done with formal truncations.
1974 if (truncating > 1 && error == 0 &&
1975 hammer_flusher_meta_limit(ip->hmp)) {
1976 ip->sync_trunc_off = off;
1977 error = EWOULDBLOCK;
1982 ran_beg = off; /* for restart */
1983 error = hammer_ip_next(cursor);
1986 hammer_cache_node(&ip->cache[1], cursor->node);
1988 if (error == EDEADLK) {
1989 hammer_done_cursor(cursor);
1990 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
1994 if (error == ENOENT)
2000 * This backend function deletes the specified record on-disk, similar to
2001 * delete_range but for a specific record. Unlike the exact deletions
2002 * used when deleting a directory entry this function uses an ASOF search
2003 * like delete_range.
2005 * This function may be called with ip->obj_asof set for a slave snapshot,
2006 * so don't use it. We always delete non-historical records only.
2009 hammer_delete_general(hammer_cursor_t cursor, hammer_inode_t ip,
2010 hammer_btree_leaf_elm_t leaf)
2012 hammer_transaction_t trans = cursor->trans;
2015 KKASSERT(trans->type == HAMMER_TRANS_FLS);
2017 hammer_normalize_cursor(cursor);
2018 cursor->key_beg = leaf->base;
2019 cursor->asof = HAMMER_MAX_TID;
2020 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
2021 cursor->flags |= HAMMER_CURSOR_ASOF;
2022 cursor->flags |= HAMMER_CURSOR_BACKEND;
2023 cursor->flags &= ~HAMMER_CURSOR_INSERT;
2025 error = hammer_btree_lookup(cursor);
2027 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2029 if (error == EDEADLK) {
2030 hammer_done_cursor(cursor);
2031 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2039 * This function deletes remaining auxillary records when an inode is
2040 * being deleted. This function explicitly does not delete the
2041 * inode record, directory entry, data, or db records. Those must be
2042 * properly disposed of prior to this call.
2045 hammer_ip_delete_clean(hammer_cursor_t cursor, hammer_inode_t ip, int *countp)
2047 hammer_transaction_t trans = cursor->trans;
2048 hammer_btree_leaf_elm_t leaf;
2051 KKASSERT(trans->type == HAMMER_TRANS_FLS);
2053 hammer_normalize_cursor(cursor);
2054 cursor->key_beg.localization = ip->obj_localization +
2055 HAMMER_LOCALIZE_MISC;
2056 cursor->key_beg.obj_id = ip->obj_id;
2057 cursor->key_beg.create_tid = 0;
2058 cursor->key_beg.delete_tid = 0;
2059 cursor->key_beg.obj_type = 0;
2060 cursor->key_beg.rec_type = HAMMER_RECTYPE_CLEAN_START;
2061 cursor->key_beg.key = HAMMER_MIN_KEY;
2063 cursor->key_end = cursor->key_beg;
2064 cursor->key_end.rec_type = HAMMER_RECTYPE_MAX;
2065 cursor->key_end.key = HAMMER_MAX_KEY;
2067 cursor->asof = ip->obj_asof;
2068 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
2069 cursor->flags |= HAMMER_CURSOR_END_INCLUSIVE | HAMMER_CURSOR_ASOF;
2070 cursor->flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
2071 cursor->flags |= HAMMER_CURSOR_BACKEND;
2073 error = hammer_ip_first(cursor);
2076 * Iterate through matching records and mark them as deleted.
2078 while (error == 0) {
2079 leaf = cursor->leaf;
2081 KKASSERT(leaf->base.delete_tid == 0);
2084 * Mark the record and B-Tree entry as deleted. This will
2085 * also physically delete the B-Tree entry, record, and
2086 * data if the retention policy dictates. The function
2087 * will set HAMMER_CURSOR_RETEST to cause hammer_ip_next()
2088 * to retest the new 'current' element.
2090 * Directory entries (and delete-on-disk directory entries)
2091 * must be synced and cannot be deleted.
2093 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2097 error = hammer_ip_next(cursor);
2100 hammer_cache_node(&ip->cache[1], cursor->node);
2101 if (error == EDEADLK) {
2102 hammer_done_cursor(cursor);
2103 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2107 if (error == ENOENT)
2113 * Delete the record at the current cursor. On success the cursor will
2114 * be positioned appropriately for an iteration but may no longer be at
2117 * This routine is only called from the backend.
2119 * NOTE: This can return EDEADLK, requiring the caller to terminate the
2123 hammer_ip_delete_record(hammer_cursor_t cursor, hammer_inode_t ip,
2126 hammer_record_t iprec;
2130 KKASSERT(cursor->flags & HAMMER_CURSOR_BACKEND);
2132 hmp = cursor->node->hmp;
2135 * In-memory (unsynchronized) records can simply be freed. This
2136 * only occurs in range iterations since all other records are
2137 * individually synchronized. Thus there should be no confusion with
2140 * An in-memory record may be deleted before being committed to disk,
2141 * but could have been accessed in the mean time. The reservation
2142 * code will deal with the case.
2144 if (hammer_cursor_inmem(cursor)) {
2145 iprec = cursor->iprec;
2146 KKASSERT((iprec->flags & HAMMER_RECF_INTERLOCK_BE) ==0);
2147 iprec->flags |= HAMMER_RECF_DELETED_FE;
2148 iprec->flags |= HAMMER_RECF_DELETED_BE;
2149 KKASSERT(iprec->ip == ip);
2150 ++ip->rec_generation;
2155 * On-disk records are marked as deleted by updating their delete_tid.
2156 * This does not effect their position in the B-Tree (which is based
2157 * on their create_tid).
2159 * Frontend B-Tree operations track inodes so we tell
2160 * hammer_delete_at_cursor() not to.
2162 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
2165 error = hammer_delete_at_cursor(
2167 HAMMER_DELETE_ADJUST | hammer_nohistory(ip),
2169 cursor->trans->time32,
2176 * Delete the B-Tree element at the current cursor and do any necessary
2177 * mirror propagation.
2179 * The cursor must be properly positioned for an iteration on return but
2180 * may be pointing at an internal element.
2182 * An element can be un-deleted by passing a delete_tid of 0 with
2183 * HAMMER_DELETE_ADJUST.
2186 hammer_delete_at_cursor(hammer_cursor_t cursor, int delete_flags,
2187 hammer_tid_t delete_tid, u_int32_t delete_ts,
2188 int track, int64_t *stat_bytes)
2190 struct hammer_btree_leaf_elm save_leaf;
2191 hammer_transaction_t trans;
2192 hammer_btree_leaf_elm_t leaf;
2194 hammer_btree_elm_t elm;
2195 hammer_off_t data_offset;
2202 error = hammer_cursor_upgrade(cursor);
2206 trans = cursor->trans;
2207 node = cursor->node;
2208 elm = &node->ondisk->elms[cursor->index];
2210 KKASSERT(elm->base.btype == HAMMER_BTREE_TYPE_RECORD);
2212 hammer_sync_lock_sh(trans);
2217 * Adjust the delete_tid. Update the mirror_tid propagation field
2218 * as well. delete_tid can be 0 (undelete -- used by mirroring).
2220 if (delete_flags & HAMMER_DELETE_ADJUST) {
2221 if (elm->base.rec_type == HAMMER_RECTYPE_INODE) {
2222 if (elm->leaf.base.delete_tid == 0 && delete_tid)
2224 if (elm->leaf.base.delete_tid && delete_tid == 0)
2228 hammer_modify_node(trans, node, elm, sizeof(*elm));
2229 elm->leaf.base.delete_tid = delete_tid;
2230 elm->leaf.delete_ts = delete_ts;
2231 hammer_modify_node_done(node);
2233 if (elm->leaf.base.delete_tid > node->ondisk->mirror_tid) {
2234 hammer_modify_node_field(trans, node, mirror_tid);
2235 node->ondisk->mirror_tid = elm->leaf.base.delete_tid;
2236 hammer_modify_node_done(node);
2238 if (hammer_debug_general & 0x0002) {
2239 kprintf("delete_at_cursor: propagate %016llx"
2241 elm->leaf.base.delete_tid,
2247 * Adjust for the iteration. We have deleted the current
2248 * element and want to clear ATEDISK so the iteration does
2249 * not skip the element after, which now becomes the current
2250 * element. This element must be re-tested if doing an
2251 * iteration, which is handled by the RETEST flag.
2253 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
2254 cursor->flags |= HAMMER_CURSOR_RETEST;
2255 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
2259 * An on-disk record cannot have the same delete_tid
2260 * as its create_tid. In a chain of record updates
2261 * this could result in a duplicate record.
2263 KKASSERT(elm->leaf.base.delete_tid !=
2264 elm->leaf.base.create_tid);
2268 * Destroy the B-Tree element if asked (typically if a nohistory
2269 * file or mount, or when called by the pruning code).
2271 * Adjust the ATEDISK flag to properly support iterations.
2273 if (delete_flags & HAMMER_DELETE_DESTROY) {
2274 data_offset = elm->leaf.data_offset;
2275 data_len = elm->leaf.data_len;
2276 rec_type = elm->leaf.base.rec_type;
2278 save_leaf = elm->leaf;
2281 if (elm->base.rec_type == HAMMER_RECTYPE_INODE &&
2282 elm->leaf.base.delete_tid == 0) {
2286 error = hammer_btree_delete(cursor);
2289 * The deletion moves the next element (if any) to
2290 * the current element position. We must clear
2291 * ATEDISK so this element is not skipped and we
2292 * must set RETEST to force any iteration to re-test
2295 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
2296 cursor->flags |= HAMMER_CURSOR_RETEST;
2297 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
2301 switch(data_offset & HAMMER_OFF_ZONE_MASK) {
2302 case HAMMER_ZONE_LARGE_DATA:
2303 case HAMMER_ZONE_SMALL_DATA:
2304 case HAMMER_ZONE_META:
2305 hammer_blockmap_free(trans,
2306 data_offset, data_len);
2315 * Track inode count and next_tid. This is used by the mirroring
2316 * and PFS code. icount can be negative, zero, or positive.
2318 if (error == 0 && track) {
2320 hammer_modify_volume_field(trans, trans->rootvol,
2322 trans->rootvol->ondisk->vol0_stat_inodes += icount;
2323 hammer_modify_volume_done(trans->rootvol);
2325 if (trans->rootvol->ondisk->vol0_next_tid < delete_tid) {
2326 hammer_modify_volume(trans, trans->rootvol, NULL, 0);
2327 trans->rootvol->ondisk->vol0_next_tid = delete_tid;
2328 hammer_modify_volume_done(trans->rootvol);
2333 * mirror_tid propagation occurs if the node's mirror_tid had to be
2334 * updated while adjusting the delete_tid.
2336 * This occurs when deleting even in nohistory mode, but does not
2337 * occur when pruning an already-deleted node.
2339 * cursor->ip is NULL when called from the pruning, mirroring,
2340 * and pfs code. If non-NULL propagation will be conditionalized
2341 * on whether the PFS is in no-history mode or not.
2345 hammer_btree_do_propagation(cursor, cursor->ip->pfsm, leaf);
2347 hammer_btree_do_propagation(cursor, NULL, leaf);
2349 hammer_sync_unlock(trans);
2354 * Determine whether we can remove a directory. This routine checks whether
2355 * a directory is empty or not and enforces flush connectivity.
2357 * Flush connectivity requires that we block if the target directory is
2358 * currently flushing, otherwise it may not end up in the same flush group.
2360 * Returns 0 on success, ENOTEMPTY or EDEADLK (or other errors) on failure.
2363 hammer_ip_check_directory_empty(hammer_transaction_t trans, hammer_inode_t ip)
2365 struct hammer_cursor cursor;
2369 * Check directory empty
2371 hammer_init_cursor(trans, &cursor, &ip->cache[1], ip);
2373 cursor.key_beg.localization = ip->obj_localization +
2374 HAMMER_LOCALIZE_MISC;
2375 cursor.key_beg.obj_id = ip->obj_id;
2376 cursor.key_beg.create_tid = 0;
2377 cursor.key_beg.delete_tid = 0;
2378 cursor.key_beg.obj_type = 0;
2379 cursor.key_beg.rec_type = HAMMER_RECTYPE_INODE + 1;
2380 cursor.key_beg.key = HAMMER_MIN_KEY;
2382 cursor.key_end = cursor.key_beg;
2383 cursor.key_end.rec_type = 0xFFFF;
2384 cursor.key_end.key = HAMMER_MAX_KEY;
2386 cursor.asof = ip->obj_asof;
2387 cursor.flags |= HAMMER_CURSOR_END_INCLUSIVE | HAMMER_CURSOR_ASOF;
2389 error = hammer_ip_first(&cursor);
2390 if (error == ENOENT)
2392 else if (error == 0)
2394 hammer_done_cursor(&cursor);