HAMMER VFS - Implement swapcache for HAMMER data in double_buffer mode
[dragonfly.git] / sys / vfs / hammer / hammer_object.c
CommitLineData
66325755 1/*
b84de5af 2 * Copyright (c) 2007-2008 The DragonFly Project. All rights reserved.
66325755
MD
3 *
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
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
16 * distribution.
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.
20 *
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
32 * SUCH DAMAGE.
33 *
35a49944 34 * $DragonFly: src/sys/vfs/hammer/hammer_object.c,v 1.97 2008/09/23 22:28:56 dillon Exp $
66325755
MD
35 */
36
37#include "hammer.h"
38
45a014dc 39static int hammer_mem_lookup(hammer_cursor_t cursor);
3214ade6 40static void hammer_mem_first(hammer_cursor_t cursor);
312de84d 41static int hammer_frontend_trunc_callback(hammer_record_t record,
0832c9bb 42 void *data __unused);
d7e278bb 43static int hammer_bulk_scan_callback(hammer_record_t record, void *data);
cb51be26 44static int hammer_record_needs_overwrite_delete(hammer_record_t record);
5fa5c92f 45static int hammer_delete_general(hammer_cursor_t cursor, hammer_inode_t ip,
83f2a3aa
MD
46 hammer_btree_leaf_elm_t leaf);
47static int hammer_cursor_localize_data(hammer_data_ondisk_t data,
48 hammer_btree_leaf_elm_t leaf);
8cd0a023 49
47637bff
MD
50struct rec_trunc_info {
51 u_int16_t rec_type;
52 int64_t trunc_off;
53};
54
d7e278bb
MD
55struct hammer_bulk_info {
56 hammer_record_t record;
6362a262 57 hammer_record_t conflict;
d7e278bb
MD
58};
59
66325755 60/*
0832c9bb 61 * Red-black tree support. Comparison code for insertion.
66325755 62 */
8cd0a023 63static int
a89aec1b 64hammer_rec_rb_compare(hammer_record_t rec1, hammer_record_t rec2)
8cd0a023 65{
11ad5ade 66 if (rec1->leaf.base.rec_type < rec2->leaf.base.rec_type)
8cd0a023 67 return(-1);
11ad5ade 68 if (rec1->leaf.base.rec_type > rec2->leaf.base.rec_type)
8cd0a023
MD
69 return(1);
70
11ad5ade 71 if (rec1->leaf.base.key < rec2->leaf.base.key)
8cd0a023 72 return(-1);
11ad5ade 73 if (rec1->leaf.base.key > rec2->leaf.base.key)
8cd0a023
MD
74 return(1);
75
ec4e8497 76 /*
3214ade6
MD
77 * For search & insertion purposes records deleted by the
78 * frontend or deleted/committed by the backend are silently
79 * ignored. Otherwise pipelined insertions will get messed
80 * up.
bf3b416b
MD
81 *
82 * rec1 is greater then rec2 if rec1 is marked deleted.
83 * rec1 is less then rec2 if rec2 is marked deleted.
84 *
85 * Multiple deleted records may be present, do not return 0
86 * if both are marked deleted.
ec4e8497 87 */
3214ade6
MD
88 if (rec1->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
89 HAMMER_RECF_COMMITTED)) {
ec4e8497 90 return(1);
3214ade6
MD
91 }
92 if (rec2->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
93 HAMMER_RECF_COMMITTED)) {
ec4e8497 94 return(-1);
3214ade6 95 }
ec4e8497 96
8cd0a023
MD
97 return(0);
98}
99
0832c9bb
MD
100/*
101 * Basic record comparison code similar to hammer_btree_cmp().
c9ce54d6
MD
102 *
103 * obj_id is not compared and may not yet be assigned in the record.
0832c9bb 104 */
8cd0a023 105static int
0832c9bb 106hammer_rec_cmp(hammer_base_elm_t elm, hammer_record_t rec)
66325755 107{
0832c9bb 108 if (elm->rec_type < rec->leaf.base.rec_type)
d26d0ae9 109 return(-3);
0832c9bb 110 if (elm->rec_type > rec->leaf.base.rec_type)
d26d0ae9 111 return(3);
8cd0a023 112
0832c9bb 113 if (elm->key < rec->leaf.base.key)
8cd0a023 114 return(-2);
0832c9bb 115 if (elm->key > rec->leaf.base.key)
8cd0a023
MD
116 return(2);
117
cebe9493 118 /*
3214ade6
MD
119 * Never match against an item deleted by the frontend
120 * or backend, or committed by the backend.
121 *
bf3b416b 122 * elm is less then rec if rec is marked deleted.
cebe9493 123 */
3214ade6
MD
124 if (rec->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
125 HAMMER_RECF_COMMITTED)) {
bf3b416b 126 return(-1);
3214ade6 127 }
0832c9bb
MD
128 return(0);
129}
130
131/*
d7e278bb
MD
132 * Ranged scan to locate overlapping record(s). This is used by
133 * hammer_ip_get_bulk() to locate an overlapping record. We have
134 * to use a ranged scan because the keys for data records with the
135 * same file base offset can be different due to differing data_len's.
0832c9bb
MD
136 *
137 * NOTE: The base file offset of a data record is (key - data_len), not (key).
138 */
139static int
d7e278bb 140hammer_rec_overlap_cmp(hammer_record_t rec, void *data)
0832c9bb 141{
d7e278bb 142 struct hammer_bulk_info *info = data;
6362a262 143 hammer_btree_leaf_elm_t leaf = &info->record->leaf;
d7e278bb
MD
144
145 if (rec->leaf.base.rec_type < leaf->base.rec_type)
0832c9bb 146 return(-3);
d7e278bb 147 if (rec->leaf.base.rec_type > leaf->base.rec_type)
0832c9bb
MD
148 return(3);
149
4a2796f3
MD
150 /*
151 * Overlap compare
152 */
0832c9bb 153 if (leaf->base.rec_type == HAMMER_RECTYPE_DATA) {
d7e278bb
MD
154 /* rec_beg >= leaf_end */
155 if (rec->leaf.base.key - rec->leaf.data_len >= leaf->base.key)
0832c9bb 156 return(2);
d7e278bb
MD
157 /* rec_end <= leaf_beg */
158 if (rec->leaf.base.key <= leaf->base.key - leaf->data_len)
159 return(-2);
0832c9bb 160 } else {
d7e278bb 161 if (rec->leaf.base.key < leaf->base.key)
0832c9bb 162 return(-2);
d7e278bb 163 if (rec->leaf.base.key > leaf->base.key)
0832c9bb
MD
164 return(2);
165 }
166
cebe9493 167 /*
d7e278bb
MD
168 * We have to return 0 at this point, even if DELETED_FE is set,
169 * because returning anything else will cause the scan to ignore
170 * one of the branches when we really want it to check both.
cebe9493 171 */
8cd0a023 172 return(0);
66325755
MD
173}
174
6b4f890b 175/*
7f7c1f84 176 * RB_SCAN comparison code for hammer_mem_first(). The argument order
6b4f890b 177 * is reversed so the comparison result has to be negated. key_beg and
7f7c1f84
MD
178 * key_end are both range-inclusive.
179 *
7f7c1f84 180 * Localized deletions are not cached in-memory.
6b4f890b
MD
181 */
182static
183int
184hammer_rec_scan_cmp(hammer_record_t rec, void *data)
185{
186 hammer_cursor_t cursor = data;
187 int r;
188
0832c9bb 189 r = hammer_rec_cmp(&cursor->key_beg, rec);
7f7c1f84 190 if (r > 1)
6b4f890b 191 return(-1);
0832c9bb 192 r = hammer_rec_cmp(&cursor->key_end, rec);
7f7c1f84 193 if (r < -1)
6b4f890b
MD
194 return(1);
195 return(0);
196}
197
2ae23e2e
MD
198/*
199 * This compare function is used when simply looking up key_beg.
200 */
201static
202int
203hammer_rec_find_cmp(hammer_record_t rec, void *data)
204{
205 hammer_cursor_t cursor = data;
206 int r;
207
0832c9bb 208 r = hammer_rec_cmp(&cursor->key_beg, rec);
2ae23e2e
MD
209 if (r > 1)
210 return(-1);
211 if (r < -1)
212 return(1);
213 return(0);
214}
215
47637bff
MD
216/*
217 * Locate blocks within the truncation range. Partial blocks do not count.
218 */
219static
220int
221hammer_rec_trunc_cmp(hammer_record_t rec, void *data)
222{
223 struct rec_trunc_info *info = data;
224
225 if (rec->leaf.base.rec_type < info->rec_type)
226 return(-1);
227 if (rec->leaf.base.rec_type > info->rec_type)
228 return(1);
229
230 switch(rec->leaf.base.rec_type) {
231 case HAMMER_RECTYPE_DB:
232 /*
233 * DB record key is not beyond the truncation point, retain.
234 */
235 if (rec->leaf.base.key < info->trunc_off)
236 return(-1);
237 break;
238 case HAMMER_RECTYPE_DATA:
239 /*
240 * DATA record offset start is not beyond the truncation point,
241 * retain.
242 */
243 if (rec->leaf.base.key - rec->leaf.data_len < info->trunc_off)
244 return(-1);
245 break;
246 default:
247 panic("hammer_rec_trunc_cmp: unexpected record type");
248 }
249
250 /*
251 * The record start is >= the truncation point, return match,
252 * the record should be destroyed.
253 */
254 return(0);
255}
256
8cd0a023 257RB_GENERATE(hammer_rec_rb_tree, hammer_record, rb_node, hammer_rec_rb_compare);
8cd0a023 258
a89aec1b 259/*
d26d0ae9 260 * Allocate a record for the caller to finish filling in. The record is
b3deaf57 261 * returned referenced.
a89aec1b
MD
262 */
263hammer_record_t
11ad5ade 264hammer_alloc_mem_record(hammer_inode_t ip, int data_len)
a89aec1b
MD
265{
266 hammer_record_t record;
bac808fe 267 hammer_mount_t hmp;
a89aec1b 268
bac808fe 269 hmp = ip->hmp;
b3deaf57 270 ++hammer_count_records;
bac808fe 271 record = kmalloc(sizeof(*record), hmp->m_misc,
df301614 272 M_WAITOK | M_ZERO | M_USE_RESERVE);
1f07f686 273 record->flush_state = HAMMER_FST_IDLE;
a89aec1b 274 record->ip = ip;
11ad5ade
MD
275 record->leaf.base.btype = HAMMER_BTREE_TYPE_RECORD;
276 record->leaf.data_len = data_len;
d26d0ae9 277 hammer_ref(&record->lock);
11ad5ade
MD
278
279 if (data_len) {
bac808fe 280 record->data = kmalloc(data_len, hmp->m_misc, M_WAITOK | M_ZERO);
11ad5ade
MD
281 record->flags |= HAMMER_RECF_ALLOCDATA;
282 ++hammer_count_record_datas;
283 }
284
a89aec1b
MD
285 return (record);
286}
287
b84de5af 288void
af209b0f 289hammer_wait_mem_record_ident(hammer_record_t record, const char *ident)
b84de5af 290{
1f07f686 291 while (record->flush_state == HAMMER_FST_FLUSH) {
b84de5af 292 record->flags |= HAMMER_RECF_WANTED;
af209b0f 293 tsleep(record, 0, ident, 0);
b84de5af
MD
294 }
295}
296
297/*
d36ec43b
MD
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.
b84de5af 301 *
d36ec43b
MD
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).
b84de5af
MD
304 */
305void
d36ec43b 306hammer_flush_record_done(hammer_record_t record, int error)
b84de5af 307{
1f07f686 308 hammer_inode_t target_ip;
1f07f686
MD
309
310 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
d36ec43b
MD
311 KKASSERT(record->flags & HAMMER_RECF_INTERLOCK_BE);
312
3214ade6
MD
313 /*
314 * If an error occured, the backend was unable to sync the
315 * record to its media. Leave the record intact.
316 */
d36ec43b 317 if (error) {
cdb6e4e6
MD
318 hammer_critical_error(record->ip->hmp, record->ip, error,
319 "while flushing record");
d36ec43b 320 }
4e17f465 321
7a61b85d
MD
322 --record->flush_group->refs;
323 record->flush_group = NULL;
324
3214ade6
MD
325 /*
326 * Adjust the flush state and dependancy based on success or
327 * failure.
328 */
329 if (record->flags & (HAMMER_RECF_DELETED_BE | HAMMER_RECF_COMMITTED)) {
1f07f686
MD
330 if ((target_ip = record->target_ip) != NULL) {
331 TAILQ_REMOVE(&target_ip->target_list, record,
332 target_entry);
333 record->target_ip = NULL;
334 hammer_test_inode(target_ip);
335 }
336 record->flush_state = HAMMER_FST_IDLE;
337 } else {
c4bae5fd 338 if (record->target_ip) {
1f07f686 339 record->flush_state = HAMMER_FST_SETUP;
c4bae5fd
MD
340 hammer_test_inode(record->ip);
341 hammer_test_inode(record->target_ip);
342 } else {
1f07f686 343 record->flush_state = HAMMER_FST_IDLE;
c4bae5fd 344 }
1f07f686 345 }
d36ec43b 346 record->flags &= ~HAMMER_RECF_INTERLOCK_BE;
3214ade6
MD
347
348 /*
349 * Cleanup
350 */
b84de5af
MD
351 if (record->flags & HAMMER_RECF_WANTED) {
352 record->flags &= ~HAMMER_RECF_WANTED;
353 wakeup(record);
354 }
355 hammer_rel_mem_record(record);
356}
357
a89aec1b 358/*
b3deaf57
MD
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
361 * goes away.
a89aec1b
MD
362 */
363void
b3deaf57 364hammer_rel_mem_record(struct hammer_record *record)
a89aec1b 365{
1b0ab2c3
MD
366 hammer_mount_t hmp;
367 hammer_reserve_t resv;
368 hammer_inode_t ip;
369 hammer_inode_t target_ip;
de996e86 370 int diddrop;
1f07f686 371
250aec18 372 hammer_rel(&record->lock);
b33e2cc0 373
250aec18 374 if (hammer_norefs(&record->lock)) {
0832c9bb
MD
375 /*
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.
bf3b416b
MD
379 *
380 * WARNING! Record must be removed from RB-TREE before we
381 * might possibly block. hammer_test_inode() can block!
0832c9bb
MD
382 */
383 ip = record->ip;
1b0ab2c3 384 hmp = ip->hmp;
0832c9bb
MD
385
386 /*
387 * Upon release of the last reference a record marked deleted
3214ade6 388 * by the front or backend, or committed by the backend,
0832c9bb
MD
389 * is destroyed.
390 */
3214ade6
MD
391 if (record->flags & (HAMMER_RECF_DELETED_FE |
392 HAMMER_RECF_DELETED_BE |
393 HAMMER_RECF_COMMITTED)) {
250aec18 394 KKASSERT(hammer_isactive(&ip->lock) > 0);
1f07f686
MD
395 KKASSERT(record->flush_state != HAMMER_FST_FLUSH);
396
bf3b416b
MD
397 /*
398 * target_ip may have zero refs, we have to ref it
399 * to prevent it from being ripped out from under
400 * us.
401 */
1f07f686
MD
402 if ((target_ip = record->target_ip) != NULL) {
403 TAILQ_REMOVE(&target_ip->target_list,
404 record, target_entry);
405 record->target_ip = NULL;
bf3b416b 406 hammer_ref(&target_ip->lock);
1f07f686 407 }
d36ec43b 408
de996e86
MD
409 /*
410 * Remove the record from the B-Tree
411 */
b84de5af
MD
412 if (record->flags & HAMMER_RECF_ONRBTREE) {
413 RB_REMOVE(hammer_rec_rb_tree,
414 &record->ip->rec_tree,
415 record);
416 record->flags &= ~HAMMER_RECF_ONRBTREE;
de996e86 417 KKASSERT(ip->rsv_recs > 0);
2010e32f
MD
418 if (RB_EMPTY(&record->ip->rec_tree)) {
419 record->ip->flags &=
420 ~HAMMER_INODE_XDIRTY;
421 record->ip->sync_flags &=
422 ~HAMMER_INODE_XDIRTY;
423 }
de996e86
MD
424 diddrop = 1;
425 } else {
426 diddrop = 0;
b84de5af 427 }
bf3b416b 428
1b0ab2c3
MD
429 /*
430 * We must wait for any direct-IO to complete before
e469566b
MD
431 * we can destroy the record because the bio may
432 * have a reference to it.
1b0ab2c3 433 */
77912481
MD
434 if (record->gflags &
435 (HAMMER_RECG_DIRECT_IO | HAMMER_RECG_DIRECT_INVAL)) {
1b0ab2c3 436 hammer_io_direct_wait(record);
e469566b 437 }
1b0ab2c3 438
de996e86
MD
439 /*
440 * Account for the completion after the direct IO
441 * has completed.
442 */
443 if (diddrop) {
444 --hmp->rsv_recs;
445 --ip->rsv_recs;
446 hmp->rsv_databytes -= record->leaf.data_len;
447
2010e32f 448 if (RB_EMPTY(&record->ip->rec_tree))
de996e86 449 hammer_test_inode(record->ip);
a117fbeb
MD
450 if ((ip->flags & HAMMER_INODE_RECSW) &&
451 ip->rsv_recs <= hammer_limit_inode_recs/2) {
452 ip->flags &= ~HAMMER_INODE_RECSW;
de996e86 453 wakeup(&ip->rsv_recs);
a117fbeb 454 }
de996e86 455 }
1b0ab2c3 456
bf3b416b
MD
457 /*
458 * Do this test after removing record from the B-Tree.
459 */
460 if (target_ip) {
461 hammer_test_inode(target_ip);
462 hammer_rel_inode(target_ip, 0);
463 }
464
b3deaf57
MD
465 if (record->flags & HAMMER_RECF_ALLOCDATA) {
466 --hammer_count_record_datas;
bac808fe 467 kfree(record->data, hmp->m_misc);
b3deaf57
MD
468 record->flags &= ~HAMMER_RECF_ALLOCDATA;
469 }
1b0ab2c3
MD
470
471 /*
3214ade6
MD
472 * Release the reservation.
473 *
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.
1b0ab2c3
MD
479 */
480 if ((resv = record->resv) != NULL) {
3214ade6 481 /* XXX undo leaf.data_offset,leaf.data_len */
1b0ab2c3 482 hammer_blockmap_reserve_complete(hmp, resv);
0832c9bb
MD
483 record->resv = NULL;
484 }
b3deaf57
MD
485 record->data = NULL;
486 --hammer_count_records;
bac808fe 487 kfree(record, hmp->m_misc);
a89aec1b 488 }
a89aec1b 489 }
a89aec1b
MD
490}
491
b84de5af 492/*
a5fddc16 493 * Record visibility depends on whether the record is being accessed by
3214ade6
MD
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.
a5fddc16
MD
497 *
498 * Return non-zero if the record is visible, zero if it isn't or if it is
3214ade6
MD
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.
5e435c92
MD
502 *
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.
b84de5af
MD
507 */
508static __inline
509int
a5fddc16 510hammer_ip_iterate_mem_good(hammer_cursor_t cursor, hammer_record_t record)
b84de5af 511{
5e435c92
MD
512 if (cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY)
513 return(1);
b84de5af 514 if (cursor->flags & HAMMER_CURSOR_BACKEND) {
3214ade6
MD
515 if (record->flags & (HAMMER_RECF_DELETED_BE |
516 HAMMER_RECF_COMMITTED)) {
a5fddc16 517 return(0);
3214ade6 518 }
b84de5af 519 } else {
3214ade6
MD
520 if (record->flags & (HAMMER_RECF_DELETED_FE |
521 HAMMER_RECF_DELETED_BE |
522 HAMMER_RECF_COMMITTED)) {
b84de5af 523 return(0);
3214ade6 524 }
b84de5af
MD
525 }
526 return(1);
527}
528
a89aec1b 529/*
2ae23e2e
MD
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.
6b4f890b 532 *
b84de5af
MD
533 * This routine is used by frontend code.
534 *
2ae23e2e
MD
535 * The primary compare code does not account for ASOF lookups. This
536 * code handles that case as well as a few others.
6b4f890b
MD
537 */
538static
539int
540hammer_rec_scan_callback(hammer_record_t rec, void *data)
541{
542 hammer_cursor_t cursor = data;
543
b33e2cc0
MD
544 /*
545 * We terminate on success, so this should be NULL on entry.
546 */
547 KKASSERT(cursor->iprec == NULL);
548
549 /*
3214ade6 550 * Skip if the record was marked deleted or committed.
b33e2cc0 551 */
b84de5af 552 if (hammer_ip_iterate_mem_good(cursor, rec) == 0)
b33e2cc0
MD
553 return(0);
554
7f7c1f84
MD
555 /*
556 * Skip if not visible due to our as-of TID
557 */
d5530d22 558 if (cursor->flags & HAMMER_CURSOR_ASOF) {
11ad5ade 559 if (cursor->asof < rec->leaf.base.create_tid)
7f7c1f84 560 return(0);
11ad5ade
MD
561 if (rec->leaf.base.delete_tid &&
562 cursor->asof >= rec->leaf.base.delete_tid) {
7f7c1f84
MD
563 return(0);
564 }
565 }
566
567 /*
3f43fb33
MD
568 * ref the record. The record is protected from backend B-Tree
569 * interactions by virtue of the cursor's IP lock.
7f7c1f84 570 */
b33e2cc0 571 hammer_ref(&rec->lock);
b84de5af 572
b33e2cc0 573 /*
3214ade6
MD
574 * The record may have been deleted or committed while we
575 * were blocked. XXX remove?
b33e2cc0 576 */
b84de5af
MD
577 if (hammer_ip_iterate_mem_good(cursor, rec) == 0) {
578 hammer_rel_mem_record(rec);
b33e2cc0
MD
579 return(0);
580 }
581
582 /*
583 * Set the matching record and stop the scan.
584 */
585 cursor->iprec = rec;
586 return(-1);
6b4f890b
MD
587}
588
2ae23e2e
MD
589
590/*
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
593 * record list.
594 *
595 * The lookup must fail if the record is marked for deferred deletion.
3214ade6
MD
596 *
597 * The API for mem/btree_lookup() does not mess with the ATE/EOF bits.
2ae23e2e
MD
598 */
599static
600int
45a014dc 601hammer_mem_lookup(hammer_cursor_t cursor)
2ae23e2e 602{
45a014dc 603 KKASSERT(cursor->ip);
2ae23e2e
MD
604 if (cursor->iprec) {
605 hammer_rel_mem_record(cursor->iprec);
606 cursor->iprec = NULL;
607 }
45a014dc 608 hammer_rec_rb_tree_RB_SCAN(&cursor->ip->rec_tree, hammer_rec_find_cmp,
2ae23e2e
MD
609 hammer_rec_scan_callback, cursor);
610
3214ade6 611 return (cursor->iprec ? 0 : ENOENT);
2ae23e2e
MD
612}
613
614/*
615 * hammer_mem_first() - locate the first in-memory record matching the
616 * cursor within the bounds of the key range.
3214ade6
MD
617 *
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.
2ae23e2e 620 */
6b4f890b 621static
3214ade6 622void
4e17f465 623hammer_mem_first(hammer_cursor_t cursor)
6b4f890b 624{
4e17f465
MD
625 hammer_inode_t ip;
626
627 ip = cursor->ip;
628 KKASSERT(ip != NULL);
629
b3deaf57
MD
630 if (cursor->iprec) {
631 hammer_rel_mem_record(cursor->iprec);
632 cursor->iprec = NULL;
633 }
6b4f890b
MD
634 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_scan_cmp,
635 hammer_rec_scan_callback, cursor);
7f7c1f84 636
4e17f465 637 if (cursor->iprec)
3214ade6
MD
638 cursor->flags &= ~(HAMMER_CURSOR_MEMEOF | HAMMER_CURSOR_ATEMEM);
639 else
640 cursor->flags |= HAMMER_CURSOR_MEMEOF | HAMMER_CURSOR_ATEMEM;
6b4f890b
MD
641}
642
a89aec1b
MD
643/************************************************************************
644 * HAMMER IN-MEMORY RECORD FUNCTIONS *
645 ************************************************************************
646 *
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.
649 */
650
8cd0a023
MD
651/*
652 * Add a directory entry (dip,ncp) which references inode (ip).
653 *
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.
5a930e66
MD
658 *
659 * NOTE: bytes does not include any terminating \0 on name, and name might
660 * not be terminated.
8cd0a023 661 */
66325755 662int
a89aec1b 663hammer_ip_add_directory(struct hammer_transaction *trans,
5a930e66 664 struct hammer_inode *dip, const char *name, int bytes,
66325755
MD
665 struct hammer_inode *ip)
666{
c82af904 667 struct hammer_cursor cursor;
a89aec1b 668 hammer_record_t record;
8cd0a023 669 int error;
5e435c92 670 u_int32_t max_iterations;
8cd0a023 671
18bee4a2
MD
672 KKASSERT(dip->ino_data.obj_type == HAMMER_OBJTYPE_DIRECTORY);
673
11ad5ade 674 record = hammer_alloc_mem_record(dip, HAMMER_ENTRY_SIZE(bytes));
8cd0a023 675
1f07f686 676 record->type = HAMMER_MEM_RECORD_ADD;
5a930e66 677 record->leaf.base.localization = dip->obj_localization +
beec5dc4 678 hammer_dir_localization(dip);
11ad5ade 679 record->leaf.base.obj_id = dip->obj_id;
5e435c92
MD
680 record->leaf.base.key = hammer_directory_namekey(dip, name, bytes,
681 &max_iterations);
11ad5ade
MD
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;
43c665ae 685 record->data->entry.localization = ip->obj_localization;
5a930e66 686 bcopy(name, record->data->entry.name, bytes);
11ad5ade
MD
687
688 ++ip->ino_data.nlinks;
cc0758d0 689 ip->ino_data.ctime = trans->time;
e98f1b96 690 hammer_modify_inode(trans, ip, HAMMER_INODE_DDIRTY);
ec4e8497 691
c82af904
MD
692 /*
693 * Find an unused namekey. Both the in-memory record tree and
5e435c92
MD
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.
06ad81ff
MD
698 *
699 * delete-visibility is set so pending deletions do not give us
700 * a false-negative on our ability to use an iterator.
5e435c92
MD
701 *
702 * The iterator must not rollover the key. Directory keys only
703 * use the positive key space.
c82af904
MD
704 */
705 hammer_init_cursor(trans, &cursor, &dip->cache[1], dip);
706 cursor.key_beg = record->leaf.base;
707 cursor.flags |= HAMMER_CURSOR_ASOF;
06ad81ff 708 cursor.flags |= HAMMER_CURSOR_DELETE_VISIBILITY;
c82af904
MD
709 cursor.asof = ip->obj_asof;
710
c82af904 711 while (hammer_ip_lookup(&cursor) == 0) {
5e435c92
MD
712 ++record->leaf.base.key;
713 KKASSERT(record->leaf.base.key > 0);
c82af904 714 cursor.key_beg.key = record->leaf.base.key;
5e435c92 715 if (--max_iterations == 0) {
c82af904
MD
716 hammer_rel_mem_record(record);
717 error = ENOSPC;
718 goto failed;
719 }
720 }
721
ec4e8497 722 /*
1f07f686
MD
723 * The target inode and the directory entry are bound together.
724 */
725 record->target_ip = ip;
726 record->flush_state = HAMMER_FST_SETUP;
727 TAILQ_INSERT_TAIL(&ip->target_list, record, target_entry);
728
729 /*
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.
f153644d
MD
732 *
733 * When transitioning to a SETUP state flag for an automatic reflush
734 * when the dependancies are disposed of if someone is waiting on
735 * the inode.
ec4e8497 736 */
1f07f686
MD
737 if (ip->flush_state == HAMMER_FST_IDLE) {
738 hammer_ref(&ip->lock);
739 ip->flush_state = HAMMER_FST_SETUP;
f153644d
MD
740 if (ip->flags & HAMMER_INODE_FLUSHW)
741 ip->flags |= HAMMER_INODE_REFLUSH;
1f07f686 742 }
47637bff 743 error = hammer_mem_add(record);
f437a2ab
MD
744 if (error == 0) {
745 dip->ino_data.mtime = trans->time;
e98f1b96 746 hammer_modify_inode(trans, dip, HAMMER_INODE_MTIME);
f437a2ab 747 }
c82af904
MD
748failed:
749 hammer_done_cursor(&cursor);
8cd0a023
MD
750 return(error);
751}
752
753/*
a89aec1b
MD
754 * Delete the directory entry and update the inode link count. The
755 * cursor must be seeked to the directory entry record being deleted.
756 *
b84de5af 757 * The related inode should be share-locked by the caller. The caller is
4c286c36
MD
758 * on the frontend. It could also be NULL indicating that the directory
759 * entry being removed has no related inode.
6a37e7e4
MD
760 *
761 * This function can return EDEADLK requiring the caller to terminate
b84de5af 762 * the cursor, any locks, wait on the returned record, and retry.
8cd0a023 763 */
a89aec1b
MD
764int
765hammer_ip_del_directory(struct hammer_transaction *trans,
766 hammer_cursor_t cursor, struct hammer_inode *dip,
767 struct hammer_inode *ip)
8cd0a023 768{
b84de5af 769 hammer_record_t record;
a89aec1b 770 int error;
8cd0a023 771
47637bff 772 if (hammer_cursor_inmem(cursor)) {
b84de5af
MD
773 /*
774 * In-memory (unsynchronized) records can simply be freed.
3214ade6 775 *
b84de5af
MD
776 * Even though the HAMMER_RECF_DELETED_FE flag is ignored
777 * by the backend, we must still avoid races against the
3214ade6 778 * backend potentially syncing the record to the media.
b84de5af
MD
779 *
780 * We cannot call hammer_ip_delete_record(), that routine may
781 * only be called from the backend.
782 */
783 record = cursor->iprec;
3214ade6
MD
784 if (record->flags & (HAMMER_RECF_INTERLOCK_BE |
785 HAMMER_RECF_DELETED_BE |
786 HAMMER_RECF_COMMITTED)) {
b84de5af
MD
787 KKASSERT(cursor->deadlk_rec == NULL);
788 hammer_ref(&record->lock);
789 cursor->deadlk_rec = record;
790 error = EDEADLK;
791 } else {
1f07f686 792 KKASSERT(record->type == HAMMER_MEM_RECORD_ADD);
d36ec43b 793 record->flags |= HAMMER_RECF_DELETED_FE;
b84de5af
MD
794 error = 0;
795 }
796 } else {
797 /*
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
c9ce54d6
MD
800 * record (lookups for the purposes of finding an unused
801 * directory key do not skip the record).
b84de5af 802 */
98f7132d
MD
803 KKASSERT(dip->flags &
804 (HAMMER_INODE_ONDISK | HAMMER_INODE_DONDISK));
11ad5ade 805 record = hammer_alloc_mem_record(dip, 0);
1f07f686 806 record->type = HAMMER_MEM_RECORD_DEL;
11ad5ade 807 record->leaf.base = cursor->leaf->base;
c9ce54d6 808 KKASSERT(dip->obj_id == record->leaf.base.obj_id);
1f07f686 809
4c286c36
MD
810 /*
811 * ip may be NULL, indicating the deletion of a directory
812 * entry which has no related inode.
813 */
1f07f686 814 record->target_ip = ip;
4c286c36
MD
815 if (ip) {
816 record->flush_state = HAMMER_FST_SETUP;
817 TAILQ_INSERT_TAIL(&ip->target_list, record,
818 target_entry);
819 } else {
820 record->flush_state = HAMMER_FST_IDLE;
821 }
b84de5af 822
ec4e8497 823 /*
1f07f686
MD
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.
f153644d
MD
827 *
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.
ec4e8497 831 */
4c286c36 832 if (ip && ip->flush_state == HAMMER_FST_IDLE) {
1f07f686
MD
833 hammer_ref(&ip->lock);
834 ip->flush_state = HAMMER_FST_SETUP;
f153644d
MD
835 if (ip->flags & HAMMER_INODE_FLUSHW)
836 ip->flags |= HAMMER_INODE_REFLUSH;
1f07f686 837 }
ec4e8497 838
47637bff 839 error = hammer_mem_add(record);
b84de5af 840 }
a89aec1b
MD
841
842 /*
c0ade690 843 * One less link. The file may still be open in the OS even after
3bf2d80a 844 * all links have gone away.
6a37e7e4
MD
845 *
846 * We have to terminate the cursor before syncing the inode to
3bf2d80a
MD
847 * avoid deadlocking against ourselves. XXX this may no longer
848 * be true.
855942b6 849 *
3bf2d80a
MD
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.
a89aec1b
MD
854 */
855 if (error == 0) {
cc0758d0 856 if (ip) {
4c286c36 857 --ip->ino_data.nlinks; /* do before we might block */
cc0758d0
MD
858 ip->ino_data.ctime = trans->time;
859 }
35a49944 860 dip->ino_data.mtime = trans->time;
e98f1b96 861 hammer_modify_inode(trans, dip, HAMMER_INODE_MTIME);
4c286c36 862 if (ip) {
e98f1b96 863 hammer_modify_inode(trans, ip, HAMMER_INODE_DDIRTY);
4c286c36
MD
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);
869 }
d113fda1 870 }
76376933 871
a89aec1b
MD
872 }
873 return(error);
66325755
MD
874}
875
7a04d74f
MD
876/*
877 * Add a record to an inode.
878 *
879 * The caller must allocate the record with hammer_alloc_mem_record(ip) and
880 * initialize the following additional fields:
881 *
b84de5af
MD
882 * The related inode should be share-locked by the caller. The caller is
883 * on the frontend.
884 *
7a04d74f
MD
885 * record->rec.entry.base.base.key
886 * record->rec.entry.base.base.rec_type
887 * record->rec.entry.base.base.data_len
47197d71 888 * record->data (a copy will be kmalloc'd if it cannot be embedded)
7a04d74f
MD
889 */
890int
891hammer_ip_add_record(struct hammer_transaction *trans, hammer_record_t record)
892{
893 hammer_inode_t ip = record->ip;
894 int error;
7a04d74f 895
2f85fa4d 896 KKASSERT(record->leaf.base.localization != 0);
11ad5ade
MD
897 record->leaf.base.obj_id = ip->obj_id;
898 record->leaf.base.obj_type = ip->ino_leaf.base.obj_type;
47637bff 899 error = hammer_mem_add(record);
7a04d74f
MD
900 return(error);
901}
902
8cd0a023 903/*
6362a262
MD
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.
47637bff
MD
908 */
909static hammer_record_t
6362a262 910hammer_ip_get_bulk(hammer_record_t record)
47637bff 911{
d7e278bb 912 struct hammer_bulk_info info;
6362a262 913 hammer_inode_t ip = record->ip;
d7e278bb 914
6362a262
MD
915 info.record = record;
916 info.conflict = NULL;
d7e278bb
MD
917 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_overlap_cmp,
918 hammer_bulk_scan_callback, &info);
919
6362a262 920 return(info.conflict); /* may be NULL */
d7e278bb
MD
921}
922
923/*
924 * Take records vetted by overlap_cmp. The first non-deleted record
925 * (if any) stops the scan.
926 */
927static int
928hammer_bulk_scan_callback(hammer_record_t record, void *data)
929{
930 struct hammer_bulk_info *info = data;
0832c9bb 931
3214ade6
MD
932 if (record->flags & (HAMMER_RECF_DELETED_FE | HAMMER_RECF_DELETED_BE |
933 HAMMER_RECF_COMMITTED)) {
d7e278bb 934 return(0);
3214ade6 935 }
d7e278bb 936 hammer_ref(&record->lock);
6362a262 937 info->conflict = record;
d7e278bb 938 return(-1); /* stop scan */
47637bff
MD
939}
940
941/*
942 * Reserve blockmap space placemarked with an in-memory record.
943 *
bcac4bbb
MD
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
947 * in-memory records.
e469566b 948 *
6362a262
MD
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()).
47637bff
MD
952 */
953hammer_record_t
0832c9bb
MD
954hammer_ip_add_bulk(hammer_inode_t ip, off_t file_offset, void *data, int bytes,
955 int *errorp)
47637bff
MD
956{
957 hammer_record_t record;
507df98a
ID
958 hammer_dedup_cache_t dcp;
959 hammer_crc_t crc;
0832c9bb 960 int zone;
47637bff
MD
961
962 /*
6362a262
MD
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().
0832c9bb
MD
966 *
967 * The backend is responsible for finalizing the space reserved in
968 * this record.
969 *
970 * XXX bytes not aligned, depend on the reservation code to
971 * align the reservation.
47637bff
MD
972 */
973 record = hammer_alloc_mem_record(ip, 0);
0832c9bb
MD
974 zone = (bytes >= HAMMER_BUFSIZE) ? HAMMER_ZONE_LARGE_DATA_INDEX :
975 HAMMER_ZONE_SMALL_DATA_INDEX;
507df98a
ID
976 if (bytes == 0)
977 crc = 0;
978 else
979 crc = crc32(data, bytes);
980
981 if (hammer_live_dedup == 0)
982 goto nodedup;
983 if ((dcp = hammer_dedup_cache_lookup(ip->hmp, crc)) != NULL) {
984 struct hammer_dedup_cache tmp = *dcp;
985
986 record->resv = hammer_blockmap_reserve_dedup(ip->hmp, zone,
987 bytes, tmp.data_offset, errorp);
988 if (record->resv == NULL)
989 goto nodedup;
990
991 if (!hammer_dedup_validate(&tmp, zone, bytes, data)) {
992 hammer_blockmap_reserve_complete(ip->hmp, record->resv);
993 goto nodedup;
994 }
995
996 record->leaf.data_offset = tmp.data_offset;
997 record->flags |= HAMMER_RECF_DEDUPED;
998 } else {
999nodedup:
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);
1005 return(NULL);
1006 }
47637bff 1007 }
507df98a 1008
47637bff
MD
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;
5a930e66
MD
1014 record->leaf.base.localization = ip->obj_localization +
1015 HAMMER_LOCALIZE_MISC;
47637bff 1016 record->leaf.data_len = bytes;
507df98a 1017 record->leaf.data_crc = crc;
cebe9493 1018 KKASSERT(*errorp == 0);
6362a262 1019
e469566b 1020 return(record);
47637bff
MD
1021}
1022
6362a262
MD
1023/*
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.
1027 *
1028 * Setting the FE deleted flag on the old record (if any) avoids any RB
1029 * tree insertion conflict, amoung other things.
1030 *
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.
1036 */
1037void
1038hammer_ip_replace_bulk(hammer_mount_t hmp, hammer_record_t record)
1039{
1040 hammer_record_t conflict;
1041 int error;
1042
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;
1046 break;
1047 }
1048 conflict->flags |= HAMMER_RECF_WANTED;
1049 tsleep(conflict, 0, "hmrrc3", 0);
1050 hammer_rel_mem_record(conflict);
1051 }
1052 error = hammer_mem_add(record);
1053 if (conflict)
1054 hammer_rel_mem_record(conflict);
1055 KKASSERT(error == 0);
1056}
1057
47637bff
MD
1058/*
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.
1062 *
1063 * Partial blocks are not deleted.
6362a262
MD
1064 *
1065 * This code is only called on regular files.
47637bff 1066 */
47637bff
MD
1067int
1068hammer_ip_frontend_trunc(struct hammer_inode *ip, off_t file_size)
1069{
1070 struct rec_trunc_info info;
1071
1072 switch(ip->ino_data.obj_type) {
1073 case HAMMER_OBJTYPE_REGFILE:
1074 info.rec_type = HAMMER_RECTYPE_DATA;
1075 break;
1076 case HAMMER_OBJTYPE_DBFILE:
1077 info.rec_type = HAMMER_RECTYPE_DB;
1078 break;
1079 default:
1080 return(EINVAL);
1081 }
1082 info.trunc_off = file_size;
1083 hammer_rec_rb_tree_RB_SCAN(&ip->rec_tree, hammer_rec_trunc_cmp,
312de84d 1084 hammer_frontend_trunc_callback, &info);
47637bff
MD
1085 return(0);
1086}
1087
6362a262
MD
1088/*
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.
1092 *
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.
1095 *
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.
1099 */
0832c9bb 1100static int
312de84d 1101hammer_frontend_trunc_callback(hammer_record_t record, void *data __unused)
0832c9bb
MD
1102{
1103 if (record->flags & HAMMER_RECF_DELETED_FE)
1104 return(0);
6362a262 1105#if 0
0832c9bb
MD
1106 if (record->flush_state == HAMMER_FST_FLUSH)
1107 return(0);
6362a262 1108#endif
0832c9bb 1109 hammer_ref(&record->lock);
6362a262
MD
1110 while (record->flags & HAMMER_RECF_INTERLOCK_BE)
1111 hammer_wait_mem_record_ident(record, "hmmtrr");
0832c9bb
MD
1112 record->flags |= HAMMER_RECF_DELETED_FE;
1113 hammer_rel_mem_record(record);
1114 return(0);
1115}
1116
cb51be26
MD
1117/*
1118 * Return 1 if the caller must check for and delete existing records
1119 * before writing out a new data record.
1120 *
1121 * Return 0 if the caller can just insert the record into the B-Tree without
1122 * checking.
1123 */
1124static int
1125hammer_record_needs_overwrite_delete(hammer_record_t record)
1126{
1127 hammer_inode_t ip = record->ip;
1128 int64_t file_offset;
1129 int r;
1130
1131 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE)
1132 file_offset = record->leaf.base.key;
1133 else
1134 file_offset = record->leaf.base.key - record->leaf.data_len;
a9d52b76 1135 r = (file_offset < ip->save_trunc_off);
cb51be26 1136 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
a9d52b76
MD
1137 if (ip->save_trunc_off <= record->leaf.base.key)
1138 ip->save_trunc_off = record->leaf.base.key + 1;
cb51be26 1139 } else {
a9d52b76
MD
1140 if (ip->save_trunc_off < record->leaf.base.key)
1141 ip->save_trunc_off = record->leaf.base.key;
cb51be26
MD
1142 }
1143 return(r);
1144}
1145
47637bff
MD
1146/*
1147 * Backend code. Sync a record to the media.
1148 */
4e17f465
MD
1149int
1150hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t record)
1151{
1152 hammer_transaction_t trans = cursor->trans;
cebe9493 1153 int64_t file_offset;
4a2796f3 1154 int bytes;
40043e7f 1155 void *bdata;
c0ade690 1156 int error;
602c6cb8 1157 int doprop;
c0ade690 1158
1f07f686 1159 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
d36ec43b 1160 KKASSERT(record->flags & HAMMER_RECF_INTERLOCK_BE);
2f85fa4d 1161 KKASSERT(record->leaf.base.localization != 0);
b33e2cc0 1162
e469566b
MD
1163 /*
1164 * Any direct-write related to the record must complete before we
1165 * can sync the record to the on-disk media.
1166 */
77912481 1167 if (record->gflags & (HAMMER_RECG_DIRECT_IO | HAMMER_RECG_DIRECT_INVAL))
e469566b
MD
1168 hammer_io_direct_wait(record);
1169
47637bff
MD
1170 /*
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.
1174 *
1175 * We've synthesized this record and do not know what the create_tid
1176 * on-disk is, nor how much data it represents.
1177 *
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.
1183 *
1184 * It is ok for the lookup to return ENOENT.
cb51be26
MD
1185 *
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.
47637bff 1189 */
cb51be26
MD
1190 if (record->type == HAMMER_MEM_RECORD_DATA &&
1191 hammer_record_needs_overwrite_delete(record)) {
cebe9493 1192 file_offset = record->leaf.base.key - record->leaf.data_len;
4a2796f3
MD
1193 bytes = (record->leaf.data_len + HAMMER_BUFMASK) &
1194 ~HAMMER_BUFMASK;
cebe9493 1195 KKASSERT((file_offset & HAMMER_BUFMASK) == 0);
47637bff
MD
1196 error = hammer_ip_delete_range(
1197 cursor, record->ip,
4a2796f3 1198 file_offset, file_offset + bytes - 1,
cebe9493 1199 1);
47637bff
MD
1200 if (error && error != ENOENT)
1201 goto done;
1202 }
1203
5fa5c92f
MD
1204 /*
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.
1207 */
1208 if (record->type == HAMMER_MEM_RECORD_GENERAL) {
1209 error = hammer_delete_general(cursor, record->ip,
1210 &record->leaf);
1211 if (error && error != ENOENT)
1212 goto done;
1213 }
1214
47637bff
MD
1215 /*
1216 * Setup the cursor.
1217 */
4e17f465 1218 hammer_normalize_cursor(cursor);
11ad5ade 1219 cursor->key_beg = record->leaf.base;
4e17f465
MD
1220 cursor->flags &= ~HAMMER_CURSOR_INITMASK;
1221 cursor->flags |= HAMMER_CURSOR_BACKEND;
1222 cursor->flags &= ~HAMMER_CURSOR_INSERT;
c0ade690 1223
98f7132d
MD
1224 /*
1225 * Records can wind up on-media before the inode itself is on-media.
1226 * Flag the case.
1227 */
1228 record->ip->flags |= HAMMER_INODE_DONDISK;
1229
c0ade690 1230 /*
47637bff
MD
1231 * If we are deleting a directory entry an exact match must be
1232 * found on-disk.
b84de5af 1233 */
1f07f686 1234 if (record->type == HAMMER_MEM_RECORD_DEL) {
4e17f465
MD
1235 error = hammer_btree_lookup(cursor);
1236 if (error == 0) {
5c8d05e2 1237 KKASSERT(cursor->iprec == NULL);
e63644f0
MD
1238 error = hammer_ip_delete_record(cursor, record->ip,
1239 trans->tid);
4e17f465 1240 if (error == 0) {
3214ade6
MD
1241 record->flags |= HAMMER_RECF_DELETED_BE |
1242 HAMMER_RECF_COMMITTED;
1243 ++record->ip->rec_generation;
4e17f465
MD
1244 }
1245 }
b84de5af
MD
1246 goto done;
1247 }
1248
1249 /*
1250 * We are inserting.
1251 *
df2ccbac
MD
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.
c0ade690 1256 */
98da6d8c 1257 hammer_sync_lock_sh(trans);
4e17f465 1258 cursor->flags |= HAMMER_CURSOR_INSERT;
c82af904
MD
1259 error = hammer_btree_lookup(cursor);
1260 if (hammer_debug_inode)
1261 kprintf("DOINSERT LOOKUP %d\n", error);
1262 if (error == 0) {
1263 kprintf("hammer_ip_sync_record: duplicate rec "
973c11b9 1264 "at (%016llx)\n", (long long)record->leaf.base.key);
fc73edd8
MD
1265 if (hammer_debug_critical)
1266 Debugger("duplicate record1");
c82af904 1267 error = EIO;
c0ade690 1268 }
47637bff
MD
1269#if 0
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);
1274#endif
47637bff 1275
c0ade690 1276 if (error != ENOENT)
98da6d8c 1277 goto done_unlock;
c0ade690
MD
1278
1279 /*
47197d71
MD
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.
1283 *
40043e7f 1284 * Support zero-fill records (data == NULL and data_len != 0)
c0ade690 1285 */
47637bff
MD
1286 if (record->type == HAMMER_MEM_RECORD_DATA) {
1287 /*
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.
1291 */
1292 KKASSERT(record->leaf.data_offset != 0);
cdb6e4e6 1293 error = hammer_blockmap_finalize(trans,
5e435c92 1294 record->resv,
cdb6e4e6
MD
1295 record->leaf.data_offset,
1296 record->leaf.data_len);
507df98a
ID
1297
1298 if (hammer_live_dedup == 2 &&
1299 (record->flags & HAMMER_RECF_DEDUPED) == 0) {
1300 hammer_dedup_cache_add(record->ip, &record->leaf);
1301 }
47637bff
MD
1302 } else if (record->data && record->leaf.data_len) {
1303 /*
1304 * Wholely cached record, with data. Allocate the data.
1305 */
11ad5ade 1306 bdata = hammer_alloc_data(trans, record->leaf.data_len,
bf3b416b 1307 record->leaf.base.rec_type,
11ad5ade 1308 &record->leaf.data_offset,
df2ccbac
MD
1309 &cursor->data_buffer,
1310 0, &error);
11ad5ade 1311 if (bdata == NULL)
98da6d8c 1312 goto done_unlock;
ddfdf542 1313 hammer_crc_set_leaf(record->data, &record->leaf);
4e17f465 1314 hammer_modify_buffer(trans, cursor->data_buffer, NULL, 0);
11ad5ade 1315 bcopy(record->data, bdata, record->leaf.data_len);
4e17f465 1316 hammer_modify_buffer_done(cursor->data_buffer);
47197d71 1317 } else {
47637bff
MD
1318 /*
1319 * Wholely cached record, without data.
1320 */
11ad5ade
MD
1321 record->leaf.data_offset = 0;
1322 record->leaf.data_crc = 0;
c0ade690 1323 }
c0ade690 1324
602c6cb8 1325 error = hammer_btree_insert(cursor, &record->leaf, &doprop);
973c11b9
MD
1326 if (hammer_debug_inode && error) {
1327 kprintf("BTREE INSERT error %d @ %016llx:%d key %016llx\n",
1328 error,
1329 (long long)cursor->node->node_offset,
1330 cursor->index,
1331 (long long)record->leaf.base.key);
1332 }
b3deaf57
MD
1333
1334 /*
3214ade6
MD
1335 * Our record is on-disk and we normally mark the in-memory version
1336 * as having been committed (and not BE-deleted).
1337 *
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.
c9ce54d6
MD
1342 *
1343 * WARNING: cursor's leaf pointer may have changed after do_propagation
1344 * returns!
b3deaf57 1345 */
4e17f465 1346 if (error == 0) {
602c6cb8 1347 if (doprop) {
4c038e17
MD
1348 hammer_btree_do_propagation(cursor,
1349 record->ip->pfsm,
602c6cb8
MD
1350 &record->leaf);
1351 }
4e17f465 1352 if (record->flags & HAMMER_RECF_CONVERT_DELETE) {
3214ade6
MD
1353 /*
1354 * Must convert deleted directory entry add
1355 * to a directory entry delete.
1356 */
4e17f465
MD
1357 KKASSERT(record->type == HAMMER_MEM_RECORD_ADD);
1358 record->flags &= ~HAMMER_RECF_DELETED_FE;
1359 record->type = HAMMER_MEM_RECORD_DEL;
c9ce54d6 1360 KKASSERT(record->ip->obj_id == record->leaf.base.obj_id);
c4bae5fd 1361 KKASSERT(record->flush_state == HAMMER_FST_FLUSH);
4e17f465 1362 record->flags &= ~HAMMER_RECF_CONVERT_DELETE;
3214ade6
MD
1363 KKASSERT((record->flags & (HAMMER_RECF_COMMITTED |
1364 HAMMER_RECF_DELETED_BE)) == 0);
1365 /* converted record is not yet committed */
c4bae5fd 1366 /* hammer_flush_record_done takes care of the rest */
4e17f465 1367 } else {
3214ade6
MD
1368 /*
1369 * Everything went fine and we are now done with
1370 * this record.
1371 */
1372 record->flags |= HAMMER_RECF_COMMITTED;
1373 ++record->ip->rec_generation;
1f07f686 1374 }
4e17f465 1375 } else {
11ad5ade
MD
1376 if (record->leaf.data_offset) {
1377 hammer_blockmap_free(trans, record->leaf.data_offset,
1378 record->leaf.data_len);
19619882 1379 }
4e17f465 1380 }
98da6d8c
MD
1381done_unlock:
1382 hammer_sync_unlock(trans);
47197d71 1383done:
c0ade690 1384 return(error);
8cd0a023 1385}
66325755
MD
1386
1387/*
a89aec1b
MD
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.
d26d0ae9 1392 *
b3deaf57
MD
1393 * A referenced record is passed to this function. This function
1394 * eats the reference. If an error occurs the record will be deleted.
47197d71
MD
1395 *
1396 * A copy of the temporary record->data pointer provided by the caller
1397 * will be made.
66325755
MD
1398 */
1399int
47637bff 1400hammer_mem_add(hammer_record_t record)
66325755 1401{
47637bff
MD
1402 hammer_mount_t hmp = record->ip->hmp;
1403
47197d71
MD
1404 /*
1405 * Make a private copy of record->data
1406 */
11ad5ade
MD
1407 if (record->data)
1408 KKASSERT(record->flags & HAMMER_RECF_ALLOCDATA);
47197d71
MD
1409
1410 /*
c82af904
MD
1411 * Insert into the RB tree. A unique key should have already
1412 * been selected if this is a directory entry.
47197d71 1413 */
c82af904
MD
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);
1417 return (EEXIST);
8cd0a023 1418 }
4a2796f3 1419 ++hmp->count_newrecords;
47637bff
MD
1420 ++hmp->rsv_recs;
1421 ++record->ip->rsv_recs;
e63644f0 1422 record->ip->hmp->rsv_databytes += record->leaf.data_len;
8cd0a023 1423 record->flags |= HAMMER_RECF_ONRBTREE;
e98f1b96 1424 hammer_modify_inode(NULL, record->ip, HAMMER_INODE_XDIRTY);
b3deaf57 1425 hammer_rel_mem_record(record);
8cd0a023 1426 return(0);
66325755
MD
1427}
1428
a89aec1b
MD
1429/************************************************************************
1430 * HAMMER INODE MERGED-RECORD FUNCTIONS *
1431 ************************************************************************
1432 *
1433 * These functions augment the B-Tree scanning functions in hammer_btree.c
1434 * by merging in-memory records with on-disk records.
1435 */
1436
1437/*
1438 * Locate a particular record either in-memory or on-disk.
1439 *
1440 * NOTE: This is basically a standalone routine, hammer_ip_next() may
1441 * NOT be called to iterate results.
1442 */
1443int
45a014dc 1444hammer_ip_lookup(hammer_cursor_t cursor)
a89aec1b
MD
1445{
1446 int error;
1447
1448 /*
1449 * If the element is in-memory return it without searching the
1450 * on-disk B-Tree
1451 */
45a014dc
MD
1452 KKASSERT(cursor->ip);
1453 error = hammer_mem_lookup(cursor);
a89aec1b 1454 if (error == 0) {
11ad5ade 1455 cursor->leaf = &cursor->iprec->leaf;
a89aec1b
MD
1456 return(error);
1457 }
1458 if (error != ENOENT)
1459 return(error);
1460
1461 /*
1462 * If the inode has on-disk components search the on-disk B-Tree.
1463 */
45a014dc 1464 if ((cursor->ip->flags & (HAMMER_INODE_ONDISK|HAMMER_INODE_DONDISK)) == 0)
a89aec1b
MD
1465 return(error);
1466 error = hammer_btree_lookup(cursor);
1467 if (error == 0)
11ad5ade 1468 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
a89aec1b
MD
1469 return(error);
1470}
1471
3214ade6
MD
1472/*
1473 * Helper for hammer_ip_first()/hammer_ip_next()
1474 *
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.
1478 */
1479static __inline
1480int
1481_hammer_ip_seek_btree(hammer_cursor_t cursor)
1482{
1483 hammer_inode_t ip = cursor->ip;
1484 int error;
1485
1486 if (ip->flags & (HAMMER_INODE_ONDISK|HAMMER_INODE_DONDISK)) {
1487 error = hammer_btree_lookup(cursor);
1488 if (error == ENOENT || error == EDEADLK) {
973c11b9
MD
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,
1493 cursor->index);
1494 }
3214ade6
MD
1495 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
1496 error = hammer_btree_iterate(cursor);
1497 }
1498 if (error == 0) {
1499 cursor->flags &= ~(HAMMER_CURSOR_DISKEOF |
1500 HAMMER_CURSOR_ATEDISK);
1501 } else {
1502 cursor->flags |= HAMMER_CURSOR_DISKEOF |
1503 HAMMER_CURSOR_ATEDISK;
1504 if (error == ENOENT)
1505 error = 0;
1506 }
1507 } else {
1508 cursor->flags |= HAMMER_CURSOR_DISKEOF | HAMMER_CURSOR_ATEDISK;
1509 error = 0;
1510 }
1511 return(error);
1512}
1513
1514/*
1515 * Helper for hammer_ip_next()
1516 *
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.
1519 */
1520static
1521int
1522_hammer_ip_reseek(hammer_cursor_t cursor)
1523{
1524 struct hammer_base_elm save;
1525 hammer_btree_elm_t elm;
1526 int error;
1527 int r;
1528 int again = 0;
1529
1530 /*
1531 * Do the re-seek.
1532 */
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;
1540
1541 /*
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.
1546 */
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;
1557 again = 1;
1558 }
1559 } else {
1560 if (r == 0) {
1561 kprintf("HAMMER: Debug: iterated after "
1562 "re-seek\n");
1563 cursor->flags |= HAMMER_CURSOR_ATEDISK;
1564 again = 1;
1565 }
1566 }
1567 }
1568 return(again);
1569}
1570
a89aec1b
MD
1571/*
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.
1575 *
1576 * When 0 is returned hammer_ip_next() may be used to iterate additional
1577 * records within the requested range.
6a37e7e4
MD
1578 *
1579 * This function can return EDEADLK, requiring the caller to terminate
1580 * the cursor and try again.
a89aec1b 1581 */
3214ade6 1582
a89aec1b 1583int
4e17f465 1584hammer_ip_first(hammer_cursor_t cursor)
a89aec1b 1585{
f64b567c 1586 hammer_inode_t ip __debugvar = cursor->ip;
a89aec1b
MD
1587 int error;
1588
4e17f465
MD
1589 KKASSERT(ip != NULL);
1590
a89aec1b
MD
1591 /*
1592 * Clean up fields and setup for merged scan
1593 */
5c8d05e2 1594 cursor->flags &= ~HAMMER_CURSOR_RETEST;
a89aec1b
MD
1595
1596 /*
3214ade6
MD
1597 * Search the in-memory record list (Red-Black tree). Unlike the
1598 * B-Tree search, mem_first checks for records in the range.
6a37e7e4 1599 *
3214ade6
MD
1600 * This function will setup both ATEMEM and MEMEOF properly for
1601 * the ip iteration. ATEMEM will be set if MEMEOF is set.
a89aec1b 1602 */
3214ade6 1603 hammer_mem_first(cursor);
a89aec1b
MD
1604
1605 /*
3214ade6
MD
1606 * Detect generation changes during blockages, including
1607 * blockages which occur on the initial btree search.
a89aec1b 1608 */
3214ade6 1609 cursor->rec_generation = cursor->ip->rec_generation;
a89aec1b
MD
1610
1611 /*
3214ade6 1612 * Initial search and result
a89aec1b 1613 */
3214ade6
MD
1614 error = _hammer_ip_seek_btree(cursor);
1615 if (error == 0)
1616 error = hammer_ip_next(cursor);
1617
1618 return (error);
a89aec1b
MD
1619}
1620
1621/*
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().
1625 *
3214ade6
MD
1626 * There are numerous special cases in this code to deal with races between
1627 * in-memory records and on-media records.
1628 *
a89aec1b
MD
1629 * 0 is returned on success, ENOENT if no further records match the
1630 * requested range, or some other error code is returned.
1631 */
1632int
1633hammer_ip_next(hammer_cursor_t cursor)
1634{
1635 hammer_btree_elm_t elm;
3214ade6
MD
1636 hammer_record_t rec;
1637 hammer_record_t tmprec;
a89aec1b
MD
1638 int error;
1639 int r;
1640
3214ade6 1641again:
a89aec1b 1642 /*
a89aec1b 1643 * Get the next on-disk record
3214ade6
MD
1644 *
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.
a89aec1b 1650 */
3214ade6
MD
1651 error = 0;
1652 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
1653 if (cursor->flags & (HAMMER_CURSOR_ATEDISK |
1654 HAMMER_CURSOR_RETEST)) {
a89aec1b 1655 error = hammer_btree_iterate(cursor);
5c8d05e2 1656 cursor->flags &= ~HAMMER_CURSOR_RETEST;
cb51be26 1657 if (error == 0) {
a89aec1b 1658 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
bcac4bbb
MD
1659 hammer_cache_node(&cursor->ip->cache[1],
1660 cursor->node);
3214ade6 1661 } else if (error == ENOENT) {
195c19a1
MD
1662 cursor->flags |= HAMMER_CURSOR_DISKEOF |
1663 HAMMER_CURSOR_ATEDISK;
3214ade6 1664 error = 0;
cb51be26 1665 }
a89aec1b
MD
1666 }
1667 }
1668
1669 /*
3214ade6
MD
1670 * If the generation changed the backend has deleted or committed
1671 * one or more memory records since our last check.
1672 *
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?)
1677 *
1678 * NOTE: we are not doing a full check here. That will be handled
1679 * later on.
1680 *
1681 * If we have exhausted all memory records we do not have to do any
1682 * further seeks.
1683 */
1684 while (cursor->rec_generation != cursor->ip->rec_generation &&
1685 error == 0
1686 ) {
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)
1690 break;
1691 if (cursor->flags & HAMMER_CURSOR_DISKEOF) {
1692 r = 1;
1693 } else {
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);
1698 }
1699
1700 /*
1701 * Do we re-seek the media cursor?
1702 */
1703 if (r > 0) {
1704 if (_hammer_ip_reseek(cursor))
1705 goto again;
1706 }
1707 }
1708
1709 /*
1710 * We can now safely get the next in-memory record. We cannot
1711 * block here.
7f7c1f84
MD
1712 *
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?
a89aec1b 1716 */
3214ade6
MD
1717 tmprec = NULL;
1718 if ((cursor->flags & HAMMER_CURSOR_MEMEOF) == 0) {
1719 /*
1720 * If the current memory record was eaten then get the next
1721 * one. Stale records are skipped.
1722 */
1723 if (cursor->flags & HAMMER_CURSOR_ATEMEM) {
1724 tmprec = cursor->iprec;
b84de5af 1725 cursor->iprec = NULL;
3214ade6 1726 rec = hammer_rec_rb_tree_RB_NEXT(tmprec);
7f7c1f84 1727 while (rec) {
ec4e8497
MD
1728 if (hammer_rec_scan_cmp(rec, cursor) != 0)
1729 break;
1730 if (hammer_rec_scan_callback(rec, cursor) != 0)
1731 break;
7f7c1f84
MD
1732 rec = hammer_rec_rb_tree_RB_NEXT(rec);
1733 }
1734 if (cursor->iprec) {
b3deaf57 1735 KKASSERT(cursor->iprec == rec);
a89aec1b 1736 cursor->flags &= ~HAMMER_CURSOR_ATEMEM;
a89aec1b
MD
1737 } else {
1738 cursor->flags |= HAMMER_CURSOR_MEMEOF;
1739 }
3214ade6 1740 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
a89aec1b
MD
1741 }
1742 }
1743
4e17f465 1744 /*
3214ade6
MD
1745 * MEMORY RECORD VALIDITY TEST
1746 *
1747 * (We still can't block, which is why tmprec is being held so
1748 * long).
1749 *
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.
4e17f465 1754 */
3214ade6
MD
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)) {
4e17f465 1759 cursor->flags |= HAMMER_CURSOR_ATEMEM;
3214ade6
MD
1760 if (tmprec)
1761 hammer_rel_mem_record(tmprec);
1762 goto again;
4e17f465
MD
1763 }
1764 }
3214ade6
MD
1765 if (tmprec)
1766 hammer_rel_mem_record(tmprec);
4e17f465 1767
a89aec1b
MD
1768 /*
1769 * Extract either the disk or memory record depending on their
1770 * relative position.
1771 */
1772 error = 0;
6b4f890b 1773 switch(cursor->flags & (HAMMER_CURSOR_ATEDISK | HAMMER_CURSOR_ATEMEM)) {
a89aec1b
MD
1774 case 0:
1775 /*
9f5097dc
MD
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.
a89aec1b
MD
1779 */
1780 elm = &cursor->node->ondisk->elms[cursor->index];
11ad5ade 1781 r = hammer_btree_cmp(&elm->base, &cursor->iprec->leaf.base);
47637bff
MD
1782
1783 /*
9f5097dc
MD
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.
47637bff 1788 */
9f5097dc
MD
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;
bf3b416b 1795 if (base1 == base2)
9f5097dc 1796 r = 0;
9f5097dc
MD
1797 }
1798
a89aec1b
MD
1799 if (r < 0) {
1800 error = hammer_btree_extract(cursor,
11ad5ade 1801 HAMMER_CURSOR_GET_LEAF);
a89aec1b 1802 cursor->flags |= HAMMER_CURSOR_ATEDISK;
3214ade6 1803 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
a89aec1b
MD
1804 break;
1805 }
b84de5af
MD
1806
1807 /*
47637bff
MD
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
1811 * both entries.
1812 *
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
1817 * on-disk entry.
1f07f686 1818 *
47637bff 1819 * If the in-memory record is not either of these we
1f07f686
MD
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
1823 * this point.
b84de5af
MD
1824 */
1825 if (r == 0) {
1f07f686
MD
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;
3214ade6 1830 goto again;
1f07f686 1831 }
47637bff
MD
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;
1835 }
1836 /* fall through to memory entry */
1f07f686 1837 } else {
3f43fb33 1838 panic("hammer_ip_next: duplicate mem/b-tree entry %p %d %08x", cursor->iprec, cursor->iprec->type, cursor->iprec->flags);
b84de5af 1839 cursor->flags |= HAMMER_CURSOR_ATEMEM;
3214ade6 1840 goto again;
b84de5af
MD
1841 }
1842 }
a89aec1b 1843 /* fall through to the memory entry */
6b4f890b 1844 case HAMMER_CURSOR_ATEDISK:
a89aec1b 1845 /*
4e17f465 1846 * Only the memory entry is valid.
a89aec1b 1847 */
11ad5ade 1848 cursor->leaf = &cursor->iprec->leaf;
a89aec1b 1849 cursor->flags |= HAMMER_CURSOR_ATEMEM;
3214ade6 1850 cursor->flags |= HAMMER_CURSOR_LASTWASMEM;
4e17f465
MD
1851
1852 /*
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.
1857 */
98f7132d
MD
1858 if (cursor->iprec->type == HAMMER_MEM_RECORD_DEL &&
1859 (cursor->flags & HAMMER_CURSOR_DELETE_VISIBILITY) == 0) {
3f43fb33 1860 panic("hammer_ip_next: del-on-disk with no b-tree entry iprec %p flags %08x", cursor->iprec, cursor->iprec->flags);
b84de5af 1861 }
a89aec1b 1862 break;
6b4f890b 1863 case HAMMER_CURSOR_ATEMEM:
a89aec1b
MD
1864 /*
1865 * Only the disk entry is valid
1866 */
11ad5ade 1867 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
a89aec1b 1868 cursor->flags |= HAMMER_CURSOR_ATEDISK;
3214ade6 1869 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
a89aec1b
MD
1870 break;
1871 default:
1872 /*
1873 * Neither entry is valid
1874 *
1875 * XXX error not set properly
1876 */
3214ade6 1877 cursor->flags &= ~HAMMER_CURSOR_LASTWASMEM;
11ad5ade 1878 cursor->leaf = NULL;
a89aec1b
MD
1879 error = ENOENT;
1880 break;
1881 }
1882 return(error);
1883}
1884
1885/*
40043e7f 1886 * Resolve the cursor->data pointer for the current cursor position in
a89aec1b
MD
1887 * a merged iteration.
1888 */
1889int
1890hammer_ip_resolve_data(hammer_cursor_t cursor)
1891{
47637bff 1892 hammer_record_t record;
a89aec1b
MD
1893 int error;
1894
47637bff
MD
1895 if (hammer_cursor_inmem(cursor)) {
1896 /*
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.
1900 *
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.
1904 */
1905 record = cursor->iprec;
1906 cursor->data = record->data;
a89aec1b 1907 error = 0;
47637bff
MD
1908 if (cursor->data == NULL) {
1909 KKASSERT(record->leaf.base.rec_type ==
1910 HAMMER_RECTYPE_DATA);
4a2796f3 1911 cursor->data = hammer_bread_ext(cursor->trans->hmp,
47637bff 1912 record->leaf.data_offset,
4a2796f3 1913 record->leaf.data_len,
47637bff
MD
1914 &error,
1915 &cursor->data_buffer);
1916 }
a89aec1b 1917 } else {
11ad5ade 1918 cursor->leaf = &cursor->node->ondisk->elms[cursor->index].leaf;
a89aec1b
MD
1919 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_DATA);
1920 }
1921 return(error);
1922}
1923
66325755 1924/*
47637bff
MD
1925 * Backend truncation / record replacement - delete records in range.
1926 *
1927 * Delete all records within the specified range for inode ip. In-memory
06ad81ff
MD
1928 * records still associated with the frontend are ignored.
1929 *
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.
a89aec1b 1932 *
a9d52b76 1933 * NOTES:
a89aec1b 1934 *
a9d52b76
MD
1935 * * An unaligned range will cause new records to be added to cover
1936 * the edge cases. (XXX not implemented yet).
47637bff 1937 *
a9d52b76
MD
1938 * * Replacement via reservations (see hammer_ip_sync_record_cursor())
1939 * also do not deal with unaligned ranges.
76376933 1940 *
a9d52b76
MD
1941 * * ran_end is inclusive (e.g. 0,1023 instead of 0,1024).
1942 *
1943 * * Record keys for regular file data have to be special-cased since
1944 * they indicate the end of the range (key = base + bytes).
1945 *
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.
66325755
MD
1950 */
1951int
4e17f465 1952hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip,
47637bff 1953 int64_t ran_beg, int64_t ran_end, int truncating)
66325755 1954{
4e17f465 1955 hammer_transaction_t trans = cursor->trans;
11ad5ade 1956 hammer_btree_leaf_elm_t leaf;
a89aec1b
MD
1957 int error;
1958 int64_t off;
a9d52b76 1959 int64_t tmp64;
a89aec1b 1960
b84de5af
MD
1961#if 0
1962 kprintf("delete_range %p %016llx-%016llx\n", ip, ran_beg, ran_end);
1963#endif
1964
1965 KKASSERT(trans->type == HAMMER_TRANS_FLS);
6a37e7e4 1966retry:
4e17f465 1967 hammer_normalize_cursor(cursor);
5a930e66
MD
1968 cursor->key_beg.localization = ip->obj_localization +
1969 HAMMER_LOCALIZE_MISC;
4e17f465
MD
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;
4e17f465 1974
11ad5ade 1975 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
4e17f465
MD
1976 cursor->key_beg.key = ran_beg;
1977 cursor->key_beg.rec_type = HAMMER_RECTYPE_DB;
a89aec1b 1978 } else {
195c19a1
MD
1979 /*
1980 * The key in the B-Tree is (base+bytes), so the first possible
1981 * matching key is ran_beg + 1.
1982 */
4e17f465
MD
1983 cursor->key_beg.key = ran_beg + 1;
1984 cursor->key_beg.rec_type = HAMMER_RECTYPE_DATA;
a9d52b76 1985 }
195c19a1 1986
a9d52b76
MD
1987 cursor->key_end = cursor->key_beg;
1988 if (ip->ino_data.obj_type == HAMMER_OBJTYPE_DBFILE) {
1989 cursor->key_end.key = ran_end;
1990 } else {
195c19a1
MD
1991 tmp64 = ran_end + MAXPHYS + 1; /* work around GCC-4 bug */
1992 if (tmp64 < ran_end)
4e17f465 1993 cursor->key_end.key = 0x7FFFFFFFFFFFFFFFLL;
a89aec1b 1994 else
4e17f465 1995 cursor->key_end.key = ran_end + MAXPHYS + 1;
a89aec1b 1996 }
a9d52b76
MD
1997
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;
4e17f465 2003 cursor->flags |= HAMMER_CURSOR_END_INCLUSIVE;
a89aec1b 2004
4e17f465 2005 error = hammer_ip_first(cursor);
a89aec1b
MD
2006
2007 /*
2008 * Iterate through matching records and mark them as deleted.
2009 */
2010 while (error == 0) {
11ad5ade 2011 leaf = cursor->leaf;
a89aec1b 2012
11ad5ade 2013 KKASSERT(leaf->base.delete_tid == 0);
e4a5ff06 2014 KKASSERT(leaf->base.obj_id == ip->obj_id);
a89aec1b
MD
2015
2016 /*
2017 * There may be overlap cases for regular file data. Also
47637bff
MD
2018 * remember the key for a regular file record is (base + len),
2019 * NOT (base).
e4a5ff06 2020 *
ef11b6e1 2021 * Note that due to duplicates (mem & media) allowed by
e4a5ff06 2022 * DELETE_VISIBILITY, off can wind up less then ran_beg.
a89aec1b 2023 */
11ad5ade 2024 if (leaf->base.rec_type == HAMMER_RECTYPE_DATA) {
11ad5ade 2025 off = leaf->base.key - leaf->data_len;
a89aec1b 2026 /*
76376933
MD
2027 * Check the left edge case. We currently do not
2028 * split existing records.
a89aec1b 2029 */
e4a5ff06 2030 if (off < ran_beg && leaf->base.key > ran_beg) {
76376933 2031 panic("hammer left edge case %016llx %d\n",
973c11b9
MD
2032 (long long)leaf->base.key,
2033 leaf->data_len);
a89aec1b
MD
2034 }
2035
2036 /*
2037 * Check the right edge case. Note that the
2038 * record can be completely out of bounds, which
2039 * terminates the search.
2040 *
76376933
MD
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.
195c19a1
MD
2044 *
2045 * XXX theory-check this test at some point, are
2046 * we missing a + 1 somewhere? Note that ran_end
2047 * could overflow.
a89aec1b 2048 */
11ad5ade
MD
2049 if (leaf->base.key - 1 > ran_end) {
2050 if (leaf->base.key - leaf->data_len > ran_end)
a89aec1b 2051 break;
a89aec1b
MD
2052 panic("hammer right edge case\n");
2053 }
a9d52b76
MD
2054 } else {
2055 off = leaf->base.key;
a89aec1b
MD
2056 }
2057
2058 /*
47637bff
MD
2059 * Delete the record. When truncating we do not delete
2060 * in-memory (data) records because they represent data
2061 * written after the truncation.
2062 *
2063 * This will also physically destroy the B-Tree entry and
195c19a1 2064 * data if the retention policy dictates. The function
5c8d05e2
MD
2065 * will set HAMMER_CURSOR_RETEST to cause hammer_ip_next()
2066 * to retest the new 'current' element.
a89aec1b 2067 */
06ad81ff 2068 if (truncating == 0 || hammer_cursor_ondisk(cursor)) {
47637bff 2069 error = hammer_ip_delete_record(cursor, ip, trans->tid);
a9d52b76
MD
2070 /*
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.
2076 *
2077 * This is only done with formal truncations.
2078 */
06ad81ff
MD
2079 if (truncating > 1 && error == 0 &&
2080 hammer_flusher_meta_limit(ip->hmp)) {
a9d52b76 2081 ip->sync_trunc_off = off;
06ad81ff
MD
2082 error = EWOULDBLOCK;
2083 }
2084 }
195c19a1
MD
2085 if (error)
2086 break;
a9d52b76 2087 ran_beg = off; /* for restart */
4e17f465
MD
2088 error = hammer_ip_next(cursor);
2089 }
cb51be26 2090 if (cursor->node)
bcac4bbb 2091 hammer_cache_node(&ip->cache[1], cursor->node);
cb51be26 2092
4e17f465
MD
2093 if (error == EDEADLK) {
2094 hammer_done_cursor(cursor);
bcac4bbb 2095 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
4e17f465
MD
2096 if (error == 0)
2097 goto retry;
a89aec1b 2098 }
a89aec1b
MD
2099 if (error == ENOENT)
2100 error = 0;
2101 return(error);
66325755
MD
2102}
2103
5fa5c92f
MD
2104/*
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.
2109 *
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.
2112 */
2113static int
2114hammer_delete_general(hammer_cursor_t cursor, hammer_inode_t ip,
2115 hammer_btree_leaf_elm_t leaf)
2116{
2117 hammer_transaction_t trans = cursor->trans;
2118 int error;
2119
2120 KKASSERT(trans->type == HAMMER_TRANS_FLS);
2121retry:
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;
2129
2130 error = hammer_btree_lookup(cursor);
2131 if (error == 0) {
2132 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2133 }
2134 if (error == EDEADLK) {
2135 hammer_done_cursor(cursor);
2136 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
2137 if (error == 0)
2138 goto retry;
2139 }
2140 return(error);
2141}
2142
b3deaf57 2143/*
a9d52b76
MD
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.
b3deaf57 2148 */
7a04d74f 2149int
a9d52b76 2150hammer_ip_delete_clean(hammer_cursor_t cursor, hammer_inode_t ip, int *countp)
7a04d74f 2151{
4e17f465 2152 hammer_transaction_t trans = cursor->trans;
11ad5ade 2153 hammer_btree_leaf_elm_t leaf;
7a04d74f
MD
2154 int error;
2155
b84de5af 2156 KKASSERT(trans->type == HAMMER_TRANS_FLS);
6a37e7e4 2157retry:
4e17f465 2158 hammer_normalize_cursor(cursor);
5a930e66
MD
2159 cursor->key_beg.localization = ip->obj_localization +
2160 HAMMER_LOCALIZE_MISC;
4e17f465
MD
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;
a9d52b76 2165 cursor->key_beg.rec_type = HAMMER_RECTYPE_CLEAN_START;
4e17f465
MD
2166 cursor->key_beg.key = HAMMER_MIN_KEY;
2167
2168 cursor->key_end = cursor->key_beg;
a9d52b76 2169 cursor->key_end.rec_type = HAMMER_RECTYPE_MAX;
4e17f465
MD
2170 cursor->key_end.key = HAMMER_MAX_KEY;
2171
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;
2177
2178 error = hammer_ip_first(cursor);
7a04d74f
MD
2179
2180 /*
2181 * Iterate through matching records and mark them as deleted.
2182 */
2183 while (error == 0) {
11ad5ade 2184 leaf = cursor->leaf;
7a04d74f 2185
11ad5ade 2186 KKASSERT(leaf->base.delete_tid == 0);
7a04d74f
MD
2187
2188 /*
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
5c8d05e2
MD
2192 * will set HAMMER_CURSOR_RETEST to cause hammer_ip_next()
2193 * to retest the new 'current' element.
1f07f686
MD
2194 *
2195 * Directory entries (and delete-on-disk directory entries)
2196 * must be synced and cannot be deleted.
7a04d74f 2197 */
a9d52b76
MD
2198 error = hammer_ip_delete_record(cursor, ip, trans->tid);
2199 ++*countp;
7a04d74f
MD
2200 if (error)
2201 break;
4e17f465
MD
2202 error = hammer_ip_next(cursor);
2203 }
cb51be26 2204 if (cursor->node)
bcac4bbb 2205 hammer_cache_node(&ip->cache[1], cursor->node);
4e17f465
MD
2206 if (error == EDEADLK) {
2207 hammer_done_cursor(cursor);
bcac4bbb 2208 error = hammer_init_cursor(trans, cursor, &ip->cache[1], ip);
4e17f465
MD
2209 if (error == 0)
2210 goto retry;
7a04d74f 2211 }
7a04d74f
MD
2212 if (error == ENOENT)
2213 error = 0;
2214 return(error);
2215}
2216
195c19a1 2217/*
46fe7ae1
MD
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
2220 * a leaf node.
6a37e7e4 2221 *
b84de5af
MD
2222 * This routine is only called from the backend.
2223 *
6a37e7e4
MD
2224 * NOTE: This can return EDEADLK, requiring the caller to terminate the
2225 * cursor and retry.
195c19a1
MD
2226 */
2227int
e63644f0
MD
2228hammer_ip_delete_record(hammer_cursor_t cursor, hammer_inode_t ip,
2229 hammer_tid_t tid)
195c19a1 2230{
4a2796f3 2231 hammer_record_t iprec;
195c19a1
MD
2232 hammer_mount_t hmp;
2233 int error;
2234
d36ec43b 2235 KKASSERT(cursor->flags & HAMMER_CURSOR_BACKEND);
cebe9493 2236 KKASSERT(tid != 0);
4a2796f3 2237 hmp = cursor->node->hmp;
d36ec43b 2238
195c19a1 2239 /*
d36ec43b
MD
2240 * In-memory (unsynchronized) records can simply be freed. This
2241 * only occurs in range iterations since all other records are
2242 * individually synchronized. Thus there should be no confusion with
2243 * the interlock.
4a2796f3
MD
2244 *
2245 * An in-memory record may be deleted before being committed to disk,
1b0ab2c3
MD
2246 * but could have been accessed in the mean time. The reservation
2247 * code will deal with the case.
195c19a1 2248 */
47637bff 2249 if (hammer_cursor_inmem(cursor)) {
4a2796f3
MD
2250 iprec = cursor->iprec;
2251 KKASSERT((iprec->flags & HAMMER_RECF_INTERLOCK_BE) ==0);
2252 iprec->flags |= HAMMER_RECF_DELETED_FE;
2253 iprec->flags |= HAMMER_RECF_DELETED_BE;
3214ade6
MD
2254 KKASSERT(iprec->ip == ip);
2255 ++ip->rec_generation;
195c19a1
MD
2256 return(0);
2257 }
2258
2259 /*
2260 * On-disk records are marked as deleted by updating their delete_tid.
9582c7da
MD
2261 * This does not effect their position in the B-Tree (which is based
2262 * on their create_tid).
842e7a70
MD
2263 *
2264 * Frontend B-Tree operations track inodes so we tell
2265 * hammer_delete_at_cursor() not to.
195c19a1 2266 */
11ad5ade 2267 error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_LEAF);
195c19a1
MD
2268
2269 if (error == 0) {
602c6cb8
MD
2270 error = hammer_delete_at_cursor(
2271 cursor,
2272 HAMMER_DELETE_ADJUST | hammer_nohistory(ip),
842e7a70
MD
2273 cursor->trans->tid,
2274 cursor->trans->time32,
2275 0, NULL);
195c19a1
MD
2276 }
2277 return(error);
2278}
2279
83f2a3aa
MD
2280/*
2281 * Used to write a generic record w/optional data to the media b-tree
2282 * when no inode context is available. Used by the mirroring and
2283 * snapshot code.
2284 *
2285 * Caller must set cursor->key_beg to leaf->base. The cursor must be
2286 * flagged for backend operation and not flagged ASOF (since we are
2287 * doing an insertion).
2288 *
2289 * This function will acquire the appropriate sync lock and will set
2290 * the cursor insertion flag for the operation, do the btree lookup,
2291 * and the insertion, and clear the insertion flag and sync lock before
2292 * returning. The cursor state will be such that the caller can continue
2293 * scanning (used by the mirroring code).
2294 *
2295 * mode: HAMMER_CREATE_MODE_UMIRROR copyin data, check crc
2296 * HAMMER_CREATE_MODE_SYS bcopy data, generate crc
2297 *
2298 * NOTE: EDEADLK can be returned. The caller must do deadlock handling and
2299 * retry.
2300 *
2301 * EALREADY can be returned if the record already exists (WARNING,
2302 * because ASOF cannot be used no check is made for illegal
2303 * duplicates).
2304 *
2305 * NOTE: Do not use the function for normal inode-related records as this
2306 * functions goes directly to the media and is not integrated with
2307 * in-memory records.
2308 */
2309int
2310hammer_create_at_cursor(hammer_cursor_t cursor, hammer_btree_leaf_elm_t leaf,
2311 void *udata, int mode)
2312{
2313 hammer_transaction_t trans;
2314 hammer_buffer_t data_buffer;
2315 hammer_off_t ndata_offset;
2316 hammer_tid_t high_tid;
2317 void *ndata;
2318 int error;
2319 int doprop;
2320
2321 trans = cursor->trans;
2322 data_buffer = NULL;
2323 ndata_offset = 0;
2324 doprop = 0;
2325
2326 KKASSERT((cursor->flags &
2327 (HAMMER_CURSOR_BACKEND | HAMMER_CURSOR_ASOF)) ==
2328 (HAMMER_CURSOR_BACKEND));
2329
2330 hammer_sync_lock_sh(trans);
2331
2332 if (leaf->data_len) {
2333 ndata = hammer_alloc_data(trans, leaf->data_len,
2334 leaf->base.rec_type,
2335 &ndata_offset, &data_buffer,
2336 0, &error);
2337 if (ndata == NULL) {
2338 hammer_sync_unlock(trans);
2339 return (error);
2340 }
2341 leaf->data_offset = ndata_offset;
2342 hammer_modify_buffer(trans, data_buffer, NULL, 0);
2343
2344 switch(mode) {
2345 case HAMMER_CREATE_MODE_UMIRROR:
2346 error = copyin(udata, ndata, leaf->data_len);
2347 if (error == 0) {
2348 if (hammer_crc_test_leaf(ndata, leaf) == 0) {
2349 kprintf("data crc mismatch on pipe\n");
2350 error = EINVAL;
2351 } else {
2352 error = hammer_cursor_localize_data(
2353 ndata, leaf);
2354 }
2355 }
2356 break;
2357 case HAMMER_CREATE_MODE_SYS:
2358 bcopy(udata, ndata, leaf->data_len);
2359 error = 0;
2360 hammer_crc_set_leaf(ndata, leaf);
2361 break;
2362 default:
2363 panic("hammer: hammer_create_at_cursor: bad mode %d",
2364 mode);
2365 break; /* NOT REACHED */
2366 }
2367 hammer_modify_buffer_done(data_buffer);
2368 } else {
2369 leaf->data_offset = 0;
2370 error = 0;
2371 ndata = NULL;
2372 }
2373 if (error)
2374 goto failed;
2375
2376 /*
2377 * Do the insertion. This can fail with a EDEADLK or EALREADY
2378 */
2379 cursor->flags |= HAMMER_CURSOR_INSERT;
2380 error = hammer_btree_lookup(cursor);
2381 if (error != ENOENT) {
2382 if (error == 0)
2383 error = EALREADY;
2384 goto failed;
2385 }
2386 error = hammer_btree_insert(cursor, leaf, &doprop);
2387
2388 /*
2389 * Cursor is left on current element, we want to skip it now.
2390 * (in case the caller is scanning)
2391 */
2392 cursor->flags |= HAMMER_CURSOR_ATEDISK;
2393 cursor->flags &= ~HAMMER_CURSOR_INSERT;
2394
2395 /*
2396 * If the insertion happens to be creating (and not just replacing)
2397 * an inode we have to track it.
2398 */
2399 if (error == 0 &&
2400 leaf->base.rec_type == HAMMER_RECTYPE_INODE &&
2401 leaf->base.delete_tid == 0) {
2402 hammer_modify_volume_field(trans, trans->rootvol,
2403 vol0_stat_inodes);
2404 ++trans->hmp->rootvol->ondisk->vol0_stat_inodes;
2405 hammer_modify_volume_done(trans->rootvol);
2406 }
2407
2408 /*
2409 * vol0_next_tid must track the highest TID stored in the filesystem.
2410 * We do not need to generate undo for this update.
2411 */
2412 high_tid = leaf->base.create_tid;
2413 if (high_tid < leaf->base.delete_tid)
2414 high_tid = leaf->base.delete_tid;
2415 if (trans->rootvol->ondisk->vol0_next_tid < high_tid) {
2416 hammer_modify_volume(trans, trans->rootvol, NULL, 0);
2417 trans->rootvol->ondisk->vol0_next_tid = high_tid;
2418 hammer_modify_volume_done(trans->rootvol);
2419 }
2420
2421 /*
2422 * WARNING! cursor's leaf pointer may have changed after
2423 * do_propagation returns.
2424 */
2425 if (error == 0 && doprop)
2426 hammer_btree_do_propagation(cursor, NULL, leaf);
2427
2428failed:
2429 /*
2430 * Cleanup
2431 */
2432 if (error && leaf->data_offset) {
2433 hammer_blockmap_free(trans, leaf->data_offset, leaf->data_len);
2434
2435 }
2436 hammer_sync_unlock(trans);
2437 if (data_buffer)
2438 hammer_rel_buffer(data_buffer, 0);
2439 return (error);
2440}
2441
602c6cb8
MD
2442/*
2443 * Delete the B-Tree element at the current cursor and do any necessary
2444 * mirror propagation.
2445 *
2446 * The cursor must be properly positioned for an iteration on return but
2447 * may be pointing at an internal element.
842e7a70
MD
2448 *
2449 * An element can be un-deleted by passing a delete_tid of 0 with
2450 * HAMMER_DELETE_ADJUST.
602c6cb8 2451 */
7dc57964 2452int
602c6cb8 2453hammer_delete_at_cursor(hammer_cursor_t cursor, int delete_flags,
842e7a70
MD
2454 hammer_tid_t delete_tid, u_int32_t delete_ts,
2455 int track, int64_t *stat_bytes)
7dc57964 2456{
602c6cb8 2457 struct hammer_btree_leaf_elm save_leaf;
842e7a70 2458 hammer_transaction_t trans;
602c6cb8
MD
2459 hammer_btree_leaf_elm_t leaf;
2460 hammer_node_t node;
7dc57964 2461 hammer_btree_elm_t elm;
47197d71 2462 hammer_off_t data_offset;
7dc57964 2463 int32_t data_len;
bf686dbe 2464 u_int16_t rec_type;
7dc57964 2465 int error;
842e7a70 2466 int icount;
602c6cb8 2467 int doprop;
7dc57964 2468
602c6cb8
MD
2469 error = hammer_cursor_upgrade(cursor);
2470 if (error)
2471 return(error);
2472
842e7a70 2473 trans = cursor->trans;
602c6cb8
MD
2474 node = cursor->node;
2475 elm = &node->ondisk->elms[cursor->index];
2476 leaf = &elm->leaf;
7dc57964
MD
2477 KKASSERT(elm->base.btype == HAMMER_BTREE_TYPE_RECORD);
2478
842e7a70
MD
2479 hammer_sync_lock_sh(trans);
2480 doprop = 0;
2481 icount = 0;
2482
602c6cb8
MD
2483 /*
2484 * Adjust the delete_tid. Update the mirror_tid propagation field
02325004 2485 * as well. delete_tid can be 0 (undelete -- used by mirroring).
602c6cb8 2486 */
602c6cb8 2487 if (delete_flags & HAMMER_DELETE_ADJUST) {
842e7a70
MD
2488 if (elm->base.rec_type == HAMMER_RECTYPE_INODE) {
2489 if (elm->leaf.base.delete_tid == 0 && delete_tid)
2490 icount = -1;
2491 if (elm->leaf.base.delete_tid && delete_tid == 0)
2492 icount = 1;
2493 }
2494
2495 hammer_modify_node(trans, node, elm, sizeof(*elm));
2496 elm->leaf.base.delete_tid = delete_tid;
2497 elm->leaf.delete_ts = delete_ts;
602c6cb8
MD
2498 hammer_modify_node_done(node);
2499
2500 if (elm->leaf.base.delete_tid > node->ondisk->mirror_tid) {
842e7a70 2501 hammer_modify_node_field(trans, node, mirror_tid);
602c6cb8
MD
2502 node->ondisk->mirror_tid = elm->leaf.base.delete_tid;
2503 hammer_modify_node_done(node);
2504 doprop = 1;
02325004
MD
2505 if (hammer_debug_general & 0x0002) {
2506 kprintf("delete_at_cursor: propagate %016llx"
2507 " @%016llx\n",
973c11b9
MD
2508 (long long)elm->leaf.base.delete_tid,
2509 (long long)node->node_offset);
02325004 2510 }
602c6cb8 2511 }
7dc57964 2512
7dc57964 2513 /*
602c6cb8
MD
2514 * Adjust for the iteration. We have deleted the current
2515 * element and want to clear ATEDISK so the iteration does
2516 * not skip the element after, which now becomes the current
5c8d05e2
MD
2517 * element. This element must be re-tested if doing an
2518 * iteration, which is handled by the RETEST flag.
7dc57964
MD
2519 */
2520 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
5c8d05e2 2521 cursor->flags |= HAMMER_CURSOR_RETEST;
7dc57964
MD
2522 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
2523 }
602c6cb8
MD
2524
2525 /*
2526 * An on-disk record cannot have the same delete_tid
2527 * as its create_tid. In a chain of record updates
2528 * this could result in a duplicate record.
2529 */
2530 KKASSERT(elm->leaf.base.delete_tid !=
2531 elm->leaf.base.create_tid);
40043e7f 2532 }
602c6cb8
MD
2533
2534 /*
2535 * Destroy the B-Tree element if asked (typically if a nohistory
2536 * file or mount, or when called by the pruning code).
2537 *
2538 * Adjust the ATEDISK flag to properly support iterations.
2539 */
2540 if (delete_flags & HAMMER_DELETE_DESTROY) {
2541 data_offset = elm->leaf.data_offset;
2542 data_len = elm->leaf.data_len;
2543 rec_type = elm->leaf.base.rec_type;
2544 if (doprop) {
2545 save_leaf = elm->leaf;
2546 leaf = &save_leaf;
eb3f8f1f 2547 }
842e7a70
MD
2548 if (elm->base.rec_type == HAMMER_RECTYPE_INODE &&
2549 elm->leaf.base.delete_tid == 0) {
2550 icount = -1;
2551 }
602c6cb8
MD
2552
2553 error = hammer_btree_delete(cursor);
2554 if (error == 0) {
2555 /*
5c8d05e2
MD
2556 * The deletion moves the next element (if any) to
2557 * the current element position. We must clear
2558 * ATEDISK so this element is not skipped and we
2559 * must set RETEST to force any iteration to re-test
2560 * the element.
602c6cb8
MD
2561 */
2562 if ((cursor->flags & HAMMER_CURSOR_DISKEOF) == 0) {
5c8d05e2 2563 cursor->flags |= HAMMER_CURSOR_RETEST;
602c6cb8
MD
2564 cursor->flags &= ~HAMMER_CURSOR_ATEDISK;
2565 }
2566 }
2567 if (error == 0) {
2568 switch(data_offset & HAMMER_OFF_ZONE_MASK) {
2569 case HAMMER_ZONE_LARGE_DATA:
2570 case HAMMER_ZONE_SMALL_DATA:
2571 case HAMMER_ZONE_META:
842e7a70 2572 hammer_blockmap_free(trans,
602c6cb8
MD
2573 data_offset, data_len);
2574 break;
2575 default:
2576 break;
2577 }
2578 }
2579 }
2580
842e7a70
MD
2581 /*
2582 * Track inode count and next_tid. This is used by the mirroring
2583 * and PFS code. icount can be negative, zero, or positive.
2584 */
2585 if (error == 0 && track) {
2586 if (icount) {
2587 hammer_modify_volume_field(trans, trans->rootvol,
2588 vol0_stat_inodes);
2589 trans->rootvol->ondisk->vol0_stat_inodes += icount;
2590 hammer_modify_volume_done(trans->rootvol);
2591 }
2592 if (trans->rootvol->ondisk->vol0_next_tid < delete_tid) {
2593 hammer_modify_volume(trans, trans->rootvol, NULL, 0);
2594 trans->rootvol->ondisk->vol0_next_tid = delete_tid;
2595 hammer_modify_volume_done(trans->rootvol);
2596 }
2597 }
2598
602c6cb8
MD
2599 /*
2600 * mirror_tid propagation occurs if the node's mirror_tid had to be
2601 * updated while adjusting the delete_tid.
2602 *
2603 * This occurs when deleting even in nohistory mode, but does not
2604 * occur when pruning an already-deleted node.
842e7a70
MD
2605 *
2606 * cursor->ip is NULL when called from the pruning, mirroring,
2607 * and pfs code. If non-NULL propagation will be conditionalized
2608 * on whether the PFS is in no-history mode or not.
c9ce54d6
MD
2609 *
2610 * WARNING: cursor's leaf pointer may have changed after do_propagation
2611 * returns!
602c6cb8
MD
2612 */
2613 if (doprop) {
842e7a70
MD
2614 if (cursor->ip)
2615 hammer_btree_do_propagation(cursor, cursor->ip->pfsm, leaf);
2616 else
2617 hammer_btree_do_propagation(cursor, NULL, leaf);
7dc57964 2618 }
842e7a70 2619 hammer_sync_unlock(trans);
7dc57964
MD
2620 return (error);
2621}
2622
b3deaf57 2623/*
1f07f686
MD
2624 * Determine whether we can remove a directory. This routine checks whether
2625 * a directory is empty or not and enforces flush connectivity.
2626 *
2627 * Flush connectivity requires that we block if the target directory is
2628 * currently flushing, otherwise it may not end up in the same flush group.
2629 *
2630 * Returns 0 on success, ENOTEMPTY or EDEADLK (or other errors) on failure.
b3deaf57
MD
2631 */
2632int
98f7132d 2633hammer_ip_check_directory_empty(hammer_transaction_t trans, hammer_inode_t ip)
b3deaf57
MD
2634{
2635 struct hammer_cursor cursor;
2636 int error;
2637
1f07f686
MD
2638 /*
2639 * Check directory empty
2640 */
bcac4bbb 2641 hammer_init_cursor(trans, &cursor, &ip->cache[1], ip);
b3deaf57 2642
5a930e66 2643 cursor.key_beg.localization = ip->obj_localization +
beec5dc4 2644 hammer_dir_localization(ip);
b3deaf57 2645 cursor.key_beg.obj_id = ip->obj_id;
d5530d22 2646 cursor.key_beg.create_tid = 0;
b3deaf57
MD
2647 cursor.key_beg.delete_tid = 0;
2648 cursor.key_beg.obj_type = 0;
2649 cursor.key_beg.rec_type = HAMMER_RECTYPE_INODE + 1;
2650 cursor.key_beg.key = HAMMER_MIN_KEY;
2651
2652 cursor.key_end = cursor.key_beg;
2653 cursor.key_end.rec_type = 0xFFFF;
2654 cursor.key_end.key = HAMMER_MAX_KEY;
2655
d5530d22
MD
2656 cursor.asof = ip->obj_asof;
2657 cursor.flags |= HAMMER_CURSOR_END_INCLUSIVE | HAMMER_CURSOR_ASOF;
b3deaf57 2658
4e17f465 2659 error = hammer_ip_first(&cursor);
b3deaf57
MD
2660 if (error == ENOENT)
2661 error = 0;
2662 else if (error == 0)
2663 error = ENOTEMPTY;
2664 hammer_done_cursor(&cursor);
2665 return(error);
2666}
2667
83f2a3aa
MD
2668/*
2669 * Localize the data payload. Directory entries may need their
2670 * localization adjusted.
2671 */
2672static
2673int
2674hammer_cursor_localize_data(hammer_data_ondisk_t data,
2675 hammer_btree_leaf_elm_t leaf)
2676{
2677 u_int32_t localization;
2678
2679 if (leaf->base.rec_type == HAMMER_RECTYPE_DIRENTRY) {
2680 localization = leaf->base.localization &
2681 HAMMER_LOCALIZE_PSEUDOFS_MASK;
2682 if (data->entry.localization != localization) {
2683 data->entry.localization = localization;
2684 hammer_crc_set_leaf(data, leaf);
2685 }
2686 }
2687 return(0);
2688}