1 /* 2 * Copyright (c) 2007-2008 The DragonFly Project. All rights reserved. 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 * 34 * $DragonFly: src/sys/vfs/hammer/hammer.h,v 1.130 2008/11/13 02:18:43 dillon Exp $ 35 */ 36 /* 37 * This header file contains structures used internally by the HAMMERFS 38 * implementation. See hammer_disk.h for on-disk structures. 39 */ 40 41 #include <sys/param.h> 42 #include <sys/types.h> 43 #include <sys/kernel.h> 44 #include <sys/conf.h> 45 #include <sys/systm.h> 46 #include <sys/tree.h> 47 #include <sys/malloc.h> 48 #include <sys/mount.h> 49 #include <sys/mountctl.h> 50 #include <sys/vnode.h> 51 #include <sys/proc.h> 52 #include <sys/priv.h> 53 #include <sys/stat.h> 54 #include <sys/globaldata.h> 55 #include <sys/lockf.h> 56 #include <sys/buf.h> 57 #include <sys/queue.h> 58 #include <sys/ktr.h> 59 #include <sys/globaldata.h> 60 #include <sys/limits.h> 61 #include <vm/vm_extern.h> 62 63 #include <sys/buf2.h> 64 #include <sys/signal2.h> 65 #include <sys/mplock2.h> 66 #include "hammer_disk.h" 67 #include "hammer_mount.h" 68 #include "hammer_ioctl.h" 69 70 #if defined(_KERNEL) || defined(_KERNEL_STRUCTURES) 71 72 MALLOC_DECLARE(M_HAMMER); 73 74 /* 75 * Kernel trace 76 */ 77 #if !defined(KTR_HAMMER) 78 #define KTR_HAMMER KTR_ALL 79 #endif 80 KTR_INFO_MASTER_EXTERN(hammer); 81 82 /* 83 * Misc structures 84 */ 85 struct hammer_mount; 86 87 /* 88 * Key structure used for custom RB tree inode lookups. This prototypes 89 * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info). 90 */ 91 typedef struct hammer_inode_info { 92 int64_t obj_id; /* (key) object identifier */ 93 hammer_tid_t obj_asof; /* (key) snapshot transid or 0 */ 94 u_int32_t obj_localization; /* (key) pseudo-fs */ 95 union { 96 struct hammer_btree_leaf_elm *leaf; 97 } u; 98 } *hammer_inode_info_t; 99 100 typedef enum hammer_transaction_type { 101 HAMMER_TRANS_RO, 102 HAMMER_TRANS_STD, 103 HAMMER_TRANS_FLS 104 } hammer_transaction_type_t; 105 106 /* 107 * HAMMER Transaction tracking 108 */ 109 struct hammer_transaction { 110 hammer_transaction_type_t type; 111 struct hammer_mount *hmp; 112 hammer_tid_t tid; 113 u_int64_t time; 114 u_int32_t time32; 115 int sync_lock_refs; 116 int flags; 117 struct hammer_volume *rootvol; 118 }; 119 120 typedef struct hammer_transaction *hammer_transaction_t; 121 122 #define HAMMER_TRANSF_NEWINODE 0x0001 123 #define HAMMER_TRANSF_DIDIO 0x0002 124 #define HAMMER_TRANSF_CRCDOM 0x0004 /* EDOM on CRC error, less critical */ 125 126 /* 127 * HAMMER locks 128 */ 129 struct hammer_lock { 130 volatile u_int refs; /* active references */ 131 volatile u_int lockval; /* lock count and control bits */ 132 struct thread *lowner; /* owner if exclusively held */ 133 struct thread *rowner; /* owner if exclusively held */ 134 }; 135 136 #define HAMMER_REFS_LOCKED 0x40000000 /* transition check */ 137 #define HAMMER_REFS_WANTED 0x20000000 /* transition check */ 138 #define HAMMER_REFS_CHECK 0x10000000 /* transition check */ 139 140 #define HAMMER_REFS_FLAGS (HAMMER_REFS_LOCKED | \ 141 HAMMER_REFS_WANTED | \ 142 HAMMER_REFS_CHECK) 143 144 #define HAMMER_LOCKF_EXCLUSIVE 0x40000000 145 #define HAMMER_LOCKF_WANTED 0x20000000 146 147 static __inline int 148 hammer_notlocked(struct hammer_lock *lock) 149 { 150 return(lock->lockval == 0); 151 } 152 153 static __inline int 154 hammer_islocked(struct hammer_lock *lock) 155 { 156 return(lock->lockval != 0); 157 } 158 159 /* 160 * Returns the number of refs on the object. 161 */ 162 static __inline int 163 hammer_isactive(struct hammer_lock *lock) 164 { 165 return(lock->refs & ~HAMMER_REFS_FLAGS); 166 } 167 168 static __inline int 169 hammer_oneref(struct hammer_lock *lock) 170 { 171 return((lock->refs & ~HAMMER_REFS_FLAGS) == 1); 172 } 173 174 static __inline int 175 hammer_norefs(struct hammer_lock *lock) 176 { 177 return((lock->refs & ~HAMMER_REFS_FLAGS) == 0); 178 } 179 180 static __inline int 181 hammer_norefsorlock(struct hammer_lock *lock) 182 { 183 return(lock->refs == 0); 184 } 185 186 static __inline int 187 hammer_refsorlock(struct hammer_lock *lock) 188 { 189 return(lock->refs != 0); 190 } 191 192 /* 193 * Return if we specifically own the lock exclusively. 194 */ 195 static __inline int 196 hammer_lock_excl_owned(struct hammer_lock *lock, thread_t td) 197 { 198 if ((lock->lockval & HAMMER_LOCKF_EXCLUSIVE) && 199 lock->lowner == td) { 200 return(1); 201 } 202 return(0); 203 } 204 205 /* 206 * Flush state, used by various structures 207 */ 208 typedef enum hammer_inode_state { 209 HAMMER_FST_IDLE, 210 HAMMER_FST_SETUP, 211 HAMMER_FST_FLUSH 212 } hammer_inode_state_t; 213 214 TAILQ_HEAD(hammer_record_list, hammer_record); 215 216 /* 217 * Pseudo-filesystem extended data tracking 218 */ 219 struct hammer_pfs_rb_tree; 220 struct hammer_pseudofs_inmem; 221 RB_HEAD(hammer_pfs_rb_tree, hammer_pseudofs_inmem); 222 RB_PROTOTYPE2(hammer_pfs_rb_tree, hammer_pseudofs_inmem, rb_node, 223 hammer_pfs_rb_compare, u_int32_t); 224 225 struct hammer_pseudofs_inmem { 226 RB_ENTRY(hammer_pseudofs_inmem) rb_node; 227 struct hammer_lock lock; 228 u_int32_t localization; 229 hammer_tid_t create_tid; 230 int flags; 231 udev_t fsid_udev; 232 struct hammer_pseudofs_data pfsd; 233 }; 234 235 typedef struct hammer_pseudofs_inmem *hammer_pseudofs_inmem_t; 236 237 #define HAMMER_PFSM_DELETED 0x0001 238 239 /* 240 * Cache object ids. A fixed number of objid cache structures are 241 * created to reserve object id's for newly created files in multiples 242 * of 100,000, localized to a particular directory, and recycled as 243 * needed. This allows parallel create operations in different 244 * directories to retain fairly localized object ids which in turn 245 * improves reblocking performance and layout. 246 */ 247 #define OBJID_CACHE_SIZE 1024 248 #define OBJID_CACHE_BULK_BITS 10 /* 10 bits (1024) */ 249 #define OBJID_CACHE_BULK (32 * 32) /* two level (1024) */ 250 #define OBJID_CACHE_BULK_MASK (OBJID_CACHE_BULK - 1) 251 #define OBJID_CACHE_BULK_MASK64 ((u_int64_t)(OBJID_CACHE_BULK - 1)) 252 253 typedef struct hammer_objid_cache { 254 TAILQ_ENTRY(hammer_objid_cache) entry; 255 struct hammer_inode *dip; 256 hammer_tid_t base_tid; 257 int count; 258 u_int32_t bm0; 259 u_int32_t bm1[32]; 260 } *hammer_objid_cache_t; 261 262 /* 263 * Associate an inode with a B-Tree node to cache search start positions 264 */ 265 typedef struct hammer_node_cache { 266 TAILQ_ENTRY(hammer_node_cache) entry; 267 struct hammer_node *node; 268 struct hammer_inode *ip; 269 } *hammer_node_cache_t; 270 271 TAILQ_HEAD(hammer_node_cache_list, hammer_node_cache); 272 273 /* 274 * Structure used to organize flush groups. Flush groups must be 275 * organized into chunks in order to avoid blowing out the UNDO FIFO. 276 * Without this a 'sync' could end up flushing 50,000 inodes in a single 277 * transaction. 278 */ 279 struct hammer_fls_rb_tree; 280 RB_HEAD(hammer_fls_rb_tree, hammer_inode); 281 RB_PROTOTYPE(hammer_fls_rb_tree, hammer_inode, rb_flsnode, 282 hammer_ino_rb_compare); 283 284 struct hammer_flush_group { 285 TAILQ_ENTRY(hammer_flush_group) flush_entry; 286 struct hammer_fls_rb_tree flush_tree; 287 int unused01; 288 int total_count; /* record load */ 289 int running; /* group is running */ 290 int closed; 291 int refs; 292 }; 293 294 typedef struct hammer_flush_group *hammer_flush_group_t; 295 296 TAILQ_HEAD(hammer_flush_group_list, hammer_flush_group); 297 298 /* 299 * Structure used to represent an inode in-memory. 300 * 301 * The record and data associated with an inode may be out of sync with 302 * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag 303 * clear). 304 * 305 * An inode may also hold a cache of unsynchronized records, used for 306 * database and directories only. Unsynchronized regular file data is 307 * stored in the buffer cache. 308 * 309 * NOTE: A file which is created and destroyed within the initial 310 * synchronization period can wind up not doing any disk I/O at all. 311 * 312 * Finally, an inode may cache numerous disk-referencing B-Tree cursors. 313 */ 314 struct hammer_ino_rb_tree; 315 struct hammer_inode; 316 RB_HEAD(hammer_ino_rb_tree, hammer_inode); 317 RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node, 318 hammer_ino_rb_compare, hammer_inode_info_t); 319 320 struct hammer_redo_rb_tree; 321 RB_HEAD(hammer_redo_rb_tree, hammer_inode); 322 RB_PROTOTYPE2(hammer_redo_rb_tree, hammer_inode, rb_redonode, 323 hammer_redo_rb_compare, hammer_off_t); 324 325 struct hammer_rec_rb_tree; 326 struct hammer_record; 327 RB_HEAD(hammer_rec_rb_tree, hammer_record); 328 RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node, 329 hammer_rec_rb_compare, hammer_btree_leaf_elm_t); 330 331 TAILQ_HEAD(hammer_node_list, hammer_node); 332 333 struct hammer_inode { 334 RB_ENTRY(hammer_inode) rb_node; 335 hammer_inode_state_t flush_state; 336 hammer_flush_group_t flush_group; 337 RB_ENTRY(hammer_inode) rb_flsnode; /* when on flush list */ 338 RB_ENTRY(hammer_inode) rb_redonode; /* when INODE_RDIRTY is set */ 339 struct hammer_record_list target_list; /* target of dependant recs */ 340 int64_t obj_id; /* (key) object identifier */ 341 hammer_tid_t obj_asof; /* (key) snapshot or 0 */ 342 u_int32_t obj_localization; /* (key) pseudo-fs */ 343 struct hammer_mount *hmp; 344 hammer_objid_cache_t objid_cache; 345 int flags; 346 int error; /* flush error */ 347 int cursor_ip_refs; /* sanity */ 348 int rsv_recs; 349 struct vnode *vp; 350 hammer_pseudofs_inmem_t pfsm; 351 struct lockf advlock; 352 struct hammer_lock lock; /* sync copy interlock */ 353 off_t trunc_off; 354 struct hammer_btree_leaf_elm ino_leaf; /* in-memory cache */ 355 struct hammer_inode_data ino_data; /* in-memory cache */ 356 struct hammer_rec_rb_tree rec_tree; /* in-memory cache */ 357 int rec_generation; 358 struct hammer_node_cache cache[4]; /* search initiate cache */ 359 360 /* 361 * When a demark is created to synchronize an inode to 362 * disk, certain fields are copied so the front-end VOPs 363 * can continue to run in parallel with the synchronization 364 * occuring in the background. 365 */ 366 int sync_flags; /* to-sync flags cache */ 367 off_t sync_trunc_off; /* to-sync truncation */ 368 off_t save_trunc_off; /* write optimization */ 369 struct hammer_btree_leaf_elm sync_ino_leaf; /* to-sync cache */ 370 struct hammer_inode_data sync_ino_data; /* to-sync cache */ 371 size_t redo_count; 372 373 /* 374 * Track the earliest offset in the UNDO/REDO FIFO containing 375 * REDO records. This is staged to the backend during flush 376 * sequences. While the inode is staged redo_fifo_next is used 377 * to track the earliest offset for rotation into redo_fifo_start 378 * on completion of the flush. 379 */ 380 hammer_off_t redo_fifo_start; 381 hammer_off_t redo_fifo_next; 382 }; 383 384 typedef struct hammer_inode *hammer_inode_t; 385 386 #define VTOI(vp) ((struct hammer_inode *)(vp)->v_data) 387 388 /* 389 * NOTE: DDIRTY does not include atime or mtime and does not include 390 * write-append size changes. SDIRTY handles write-append size 391 * changes. 392 * 393 * REDO indicates that REDO logging is active, creating a definitive 394 * stream of REDO records in the UNDO/REDO log for writes and 395 * truncations, including boundary records when/if REDO is turned off. 396 * REDO is typically enabled by fsync() and turned off if excessive 397 * writes without an fsync() occurs. 398 * 399 * RDIRTY indicates that REDO records were laid down in the UNDO/REDO 400 * FIFO (even if REDO is turned off some might still be active) and 401 * still being tracked for this inode. See hammer_redo.c 402 */ 403 /* (not including atime/mtime) */ 404 #define HAMMER_INODE_DDIRTY 0x0001 /* in-memory ino_data is dirty */ 405 #define HAMMER_INODE_RSV_INODES 0x0002 /* hmp->rsv_inodes bumped */ 406 #define HAMMER_INODE_CONN_DOWN 0x0004 /* include in downward recursion */ 407 #define HAMMER_INODE_XDIRTY 0x0008 /* in-memory records */ 408 #define HAMMER_INODE_ONDISK 0x0010 /* inode is on-disk (else not yet) */ 409 #define HAMMER_INODE_FLUSH 0x0020 /* flush on last ref */ 410 #define HAMMER_INODE_DELETED 0x0080 /* inode delete (backend) */ 411 #define HAMMER_INODE_DELONDISK 0x0100 /* delete synchronized to disk */ 412 #define HAMMER_INODE_RO 0x0200 /* read-only (because of as-of) */ 413 #define HAMMER_INODE_UNUSED0400 0x0400 414 #define HAMMER_INODE_DONDISK 0x0800 /* data records may be on disk */ 415 #define HAMMER_INODE_BUFS 0x1000 /* dirty high level bps present */ 416 #define HAMMER_INODE_REFLUSH 0x2000 /* flush on dependancy / reflush */ 417 #define HAMMER_INODE_RECLAIM 0x4000 /* trying to reclaim */ 418 #define HAMMER_INODE_FLUSHW 0x8000 /* Someone waiting for flush */ 419 420 #define HAMMER_INODE_TRUNCATED 0x00010000 421 #define HAMMER_INODE_DELETING 0x00020000 /* inode delete request (frontend)*/ 422 #define HAMMER_INODE_RESIGNAL 0x00040000 /* re-signal on re-flush */ 423 #define HAMMER_INODE_ATIME 0x00100000 /* in-memory atime modified */ 424 #define HAMMER_INODE_MTIME 0x00200000 /* in-memory mtime modified */ 425 #define HAMMER_INODE_WOULDBLOCK 0x00400000 /* re-issue to new flush group */ 426 #define HAMMER_INODE_DUMMY 0x00800000 /* dummy inode covering bad file */ 427 #define HAMMER_INODE_SDIRTY 0x01000000 /* in-memory ino_data.size is dirty*/ 428 #define HAMMER_INODE_REDO 0x02000000 /* REDO logging active */ 429 #define HAMMER_INODE_RDIRTY 0x04000000 /* REDO records active in fifo */ 430 431 #define HAMMER_INODE_MODMASK (HAMMER_INODE_DDIRTY|HAMMER_INODE_SDIRTY| \ 432 HAMMER_INODE_XDIRTY|HAMMER_INODE_BUFS| \ 433 HAMMER_INODE_ATIME|HAMMER_INODE_MTIME| \ 434 HAMMER_INODE_TRUNCATED|HAMMER_INODE_DELETING) 435 436 #define HAMMER_INODE_MODMASK_NOXDIRTY \ 437 (HAMMER_INODE_MODMASK & ~HAMMER_INODE_XDIRTY) 438 439 #define HAMMER_INODE_MODMASK_NOREDO \ 440 (HAMMER_INODE_DDIRTY| \ 441 HAMMER_INODE_XDIRTY| \ 442 HAMMER_INODE_TRUNCATED|HAMMER_INODE_DELETING) 443 444 #define HAMMER_FLUSH_SIGNAL 0x0001 445 #define HAMMER_FLUSH_RECURSION 0x0002 446 447 /* 448 * Used by the inode reclaim code to pipeline reclaims and avoid 449 * blowing out kernel memory or letting the flusher get too far 450 * behind. The reclaim wakes up when count reaches 0 or the 451 * timer expires. 452 */ 453 struct hammer_reclaim { 454 TAILQ_ENTRY(hammer_reclaim) entry; 455 int count; 456 }; 457 458 #define HAMMER_RECLAIM_WAIT 4000 /* default vfs.hammer.limit_reclaim */ 459 460 /* 461 * Track who is creating the greatest burden on the 462 * inode cache. 463 */ 464 struct hammer_inostats { 465 pid_t pid; /* track user process */ 466 int ltick; /* last tick */ 467 int count; /* count (degenerates) */ 468 }; 469 470 #define HAMMER_INOSTATS_HSIZE 32 471 #define HAMMER_INOSTATS_HMASK (HAMMER_INOSTATS_HSIZE - 1) 472 473 /* 474 * Structure used to represent an unsynchronized record in-memory. These 475 * records typically represent directory entries. Only non-historical 476 * records are kept in-memory. 477 * 478 * Records are organized as a per-inode RB-Tree. If the inode is not 479 * on disk then neither are any records and the in-memory record tree 480 * represents the entire contents of the inode. If the inode is on disk 481 * then the on-disk B-Tree is scanned in parallel with the in-memory 482 * RB-Tree to synthesize the current state of the file. 483 * 484 * Records are also used to enforce the ordering of directory create/delete 485 * operations. A new inode will not be flushed to disk unless its related 486 * directory entry is also being flushed at the same time. A directory entry 487 * will not be removed unless its related inode is also being removed at the 488 * same time. 489 */ 490 typedef enum hammer_record_type { 491 HAMMER_MEM_RECORD_GENERAL, /* misc record */ 492 HAMMER_MEM_RECORD_INODE, /* inode record */ 493 HAMMER_MEM_RECORD_ADD, /* positive memory cache record */ 494 HAMMER_MEM_RECORD_DEL, /* negative delete-on-disk record */ 495 HAMMER_MEM_RECORD_DATA /* bulk-data record w/on-disk ref */ 496 } hammer_record_type_t; 497 498 struct hammer_record { 499 RB_ENTRY(hammer_record) rb_node; 500 TAILQ_ENTRY(hammer_record) target_entry; 501 hammer_inode_state_t flush_state; 502 hammer_flush_group_t flush_group; 503 hammer_record_type_t type; 504 struct hammer_lock lock; 505 struct hammer_reserve *resv; 506 struct hammer_inode *ip; 507 struct hammer_inode *target_ip; 508 struct hammer_btree_leaf_elm leaf; 509 union hammer_data_ondisk *data; 510 int flags; 511 int gflags; 512 hammer_off_t zone2_offset; /* direct-write only */ 513 }; 514 515 typedef struct hammer_record *hammer_record_t; 516 517 /* 518 * Record flags. Note that FE can only be set by the frontend if the 519 * record has not been interlocked by the backend w/ BE. 520 */ 521 #define HAMMER_RECF_ALLOCDATA 0x0001 522 #define HAMMER_RECF_ONRBTREE 0x0002 523 #define HAMMER_RECF_DELETED_FE 0x0004 /* deleted (frontend) */ 524 #define HAMMER_RECF_DELETED_BE 0x0008 /* deleted (backend) */ 525 #define HAMMER_RECF_COMMITTED 0x0010 /* committed to the B-Tree */ 526 #define HAMMER_RECF_INTERLOCK_BE 0x0020 /* backend interlock */ 527 #define HAMMER_RECF_WANTED 0x0040 /* wanted by the frontend */ 528 #define HAMMER_RECF_CONVERT_DELETE 0x0100 /* special case */ 529 #define HAMMER_RECF_REDO 0x1000 /* REDO was laid down */ 530 531 /* 532 * These flags must be separate to deal with SMP races 533 */ 534 #define HAMMER_RECG_DIRECT_IO 0x0001 /* related direct I/O running*/ 535 #define HAMMER_RECG_DIRECT_WAIT 0x0002 /* related direct I/O running*/ 536 #define HAMMER_RECG_DIRECT_INVAL 0x0004 /* buffer alias invalidation */ 537 /* 538 * hammer_create_at_cursor() and hammer_delete_at_cursor() flags. 539 */ 540 #define HAMMER_CREATE_MODE_UMIRROR 0x0001 541 #define HAMMER_CREATE_MODE_SYS 0x0002 542 543 #define HAMMER_DELETE_ADJUST 0x0001 544 #define HAMMER_DELETE_DESTROY 0x0002 545 546 /* 547 * In-memory structures representing on-disk structures. 548 */ 549 struct hammer_volume; 550 struct hammer_buffer; 551 struct hammer_node; 552 struct hammer_undo; 553 struct hammer_reserve; 554 555 RB_HEAD(hammer_vol_rb_tree, hammer_volume); 556 RB_HEAD(hammer_buf_rb_tree, hammer_buffer); 557 RB_HEAD(hammer_nod_rb_tree, hammer_node); 558 RB_HEAD(hammer_und_rb_tree, hammer_undo); 559 RB_HEAD(hammer_res_rb_tree, hammer_reserve); 560 561 RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node, 562 hammer_vol_rb_compare, int32_t); 563 RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node, 564 hammer_buf_rb_compare, hammer_off_t); 565 RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node, 566 hammer_nod_rb_compare, hammer_off_t); 567 RB_PROTOTYPE2(hammer_und_rb_tree, hammer_undo, rb_node, 568 hammer_und_rb_compare, hammer_off_t); 569 RB_PROTOTYPE2(hammer_res_rb_tree, hammer_reserve, rb_node, 570 hammer_res_rb_compare, hammer_off_t); 571 572 /* 573 * IO management - embedded at the head of various in-memory structures 574 * 575 * VOLUME - hammer_volume containing meta-data 576 * META_BUFFER - hammer_buffer containing meta-data 577 * DATA_BUFFER - hammer_buffer containing pure-data 578 * 579 * Dirty volume headers and dirty meta-data buffers are locked until the 580 * flusher can sequence them out. Dirty pure-data buffers can be written. 581 * Clean buffers can be passively released. 582 */ 583 typedef enum hammer_io_type { 584 HAMMER_STRUCTURE_VOLUME, 585 HAMMER_STRUCTURE_META_BUFFER, 586 HAMMER_STRUCTURE_UNDO_BUFFER, 587 HAMMER_STRUCTURE_DATA_BUFFER, 588 HAMMER_STRUCTURE_DUMMY 589 } hammer_io_type_t; 590 591 union hammer_io_structure; 592 struct hammer_io; 593 594 struct worklist { 595 LIST_ENTRY(worklist) node; 596 }; 597 598 TAILQ_HEAD(hammer_io_list, hammer_io); 599 typedef struct hammer_io_list *hammer_io_list_t; 600 601 struct hammer_io { 602 struct worklist worklist; 603 struct hammer_lock lock; 604 enum hammer_io_type type; 605 struct hammer_mount *hmp; 606 struct hammer_volume *volume; 607 TAILQ_ENTRY(hammer_io) mod_entry; /* list entry if modified */ 608 TAILQ_ENTRY(hammer_io) iorun_entry; /* iorun_list */ 609 hammer_io_list_t mod_list; 610 struct buf *bp; 611 int64_t offset; /* zone-2 offset */ 612 int bytes; /* buffer cache buffer size */ 613 int modify_refs; 614 615 /* 616 * These can be modified at any time by the backend while holding 617 * io_token, due to bio_done and hammer_io_complete() callbacks. 618 */ 619 u_int running : 1; /* bp write IO in progress */ 620 u_int waiting : 1; /* someone is waiting on us */ 621 u_int ioerror : 1; /* abort on io-error */ 622 u_int unusedA : 29; 623 624 /* 625 * These can only be modified by the frontend while holding 626 * fs_token, or by the backend while holding the io interlocked 627 * with no references (which will block the frontend when it 628 * tries to reference it). 629 * 630 * WARNING! SMP RACES will create havoc if the callbacks ever tried 631 * to modify any of these outside the above restrictions. 632 */ 633 u_int modified : 1; /* bp's data was modified */ 634 u_int released : 1; /* bp released (w/ B_LOCKED set) */ 635 u_int validated : 1; /* ondisk has been validated */ 636 u_int waitdep : 1; /* flush waits for dependancies */ 637 u_int recovered : 1; /* has recovery ref */ 638 u_int waitmod : 1; /* waiting for modify_refs */ 639 u_int reclaim : 1; /* reclaim requested */ 640 u_int gencrc : 1; /* crc needs to be generated */ 641 u_int unusedB : 24; 642 }; 643 644 typedef struct hammer_io *hammer_io_t; 645 646 #define HAMMER_CLUSTER_SIZE (64 * 1024) 647 #if HAMMER_CLUSTER_SIZE > MAXBSIZE 648 #undef HAMMER_CLUSTER_SIZE 649 #define HAMMER_CLUSTER_SIZE MAXBSIZE 650 #endif 651 #define HAMMER_CLUSTER_BUFS (HAMMER_CLUSTER_SIZE / HAMMER_BUFSIZE) 652 653 /* 654 * In-memory volume representing on-disk buffer 655 */ 656 struct hammer_volume { 657 struct hammer_io io; 658 RB_ENTRY(hammer_volume) rb_node; 659 struct hammer_volume_ondisk *ondisk; 660 int32_t vol_no; 661 int64_t nblocks; /* note: special calculation for statfs */ 662 int64_t buffer_base; /* base offset of buffer 0 */ 663 hammer_off_t maxbuf_off; /* Maximum buffer offset (zone-2) */ 664 hammer_off_t maxraw_off; /* Maximum raw offset for device */ 665 char *vol_name; 666 struct vnode *devvp; 667 int vol_flags; 668 }; 669 670 typedef struct hammer_volume *hammer_volume_t; 671 672 /* 673 * In-memory buffer (other then volume, super-cluster, or cluster), 674 * representing an on-disk buffer. 675 */ 676 struct hammer_buffer { 677 struct hammer_io io; 678 RB_ENTRY(hammer_buffer) rb_node; 679 void *ondisk; 680 hammer_off_t zoneX_offset; 681 hammer_off_t zone2_offset; 682 struct hammer_reserve *resv; 683 struct hammer_node_list clist; 684 }; 685 686 typedef struct hammer_buffer *hammer_buffer_t; 687 688 /* 689 * In-memory B-Tree node, representing an on-disk B-Tree node. 690 * 691 * This is a hang-on structure which is backed by a hammer_buffer, 692 * indexed by a hammer_cluster, and used for fine-grained locking of 693 * B-Tree nodes in order to properly control lock ordering. A hammer_buffer 694 * can contain multiple nodes representing wildly disassociated portions 695 * of the B-Tree so locking cannot be done on a buffer-by-buffer basis. 696 * 697 * This structure uses a cluster-relative index to reduce the number 698 * of layers required to access it, and also because all on-disk B-Tree 699 * references are cluster-relative offsets. 700 */ 701 struct hammer_node { 702 struct hammer_lock lock; /* node-by-node lock */ 703 TAILQ_ENTRY(hammer_node) entry; /* per-buffer linkage */ 704 RB_ENTRY(hammer_node) rb_node; /* per-cluster linkage */ 705 hammer_off_t node_offset; /* full offset spec */ 706 struct hammer_mount *hmp; 707 struct hammer_buffer *buffer; /* backing buffer */ 708 hammer_node_ondisk_t ondisk; /* ptr to on-disk structure */ 709 TAILQ_HEAD(, hammer_cursor) cursor_list; /* deadlock recovery */ 710 struct hammer_node_cache_list cache_list; /* passive caches */ 711 int flags; 712 }; 713 714 #define HAMMER_NODE_DELETED 0x0001 715 #define HAMMER_NODE_FLUSH 0x0002 716 #define HAMMER_NODE_CRCGOOD 0x0004 717 #define HAMMER_NODE_NEEDSCRC 0x0008 718 #define HAMMER_NODE_NEEDSMIRROR 0x0010 719 #define HAMMER_NODE_CRCBAD 0x0020 720 #define HAMMER_NODE_NONLINEAR 0x0040 /* linear heuristic */ 721 722 #define HAMMER_NODE_CRCANY (HAMMER_NODE_CRCGOOD | HAMMER_NODE_CRCBAD) 723 724 typedef struct hammer_node *hammer_node_t; 725 726 /* 727 * List of locked nodes. This structure is used to lock potentially large 728 * numbers of nodes as an aid for complex B-Tree operations. 729 */ 730 struct hammer_node_lock; 731 TAILQ_HEAD(hammer_node_lock_list, hammer_node_lock); 732 733 struct hammer_node_lock { 734 TAILQ_ENTRY(hammer_node_lock) entry; 735 struct hammer_node_lock_list list; 736 struct hammer_node_lock *parent; 737 hammer_node_t node; 738 hammer_node_ondisk_t copy; /* copy of on-disk data */ 739 int index; /* index of this node in parent */ 740 int count; /* count children */ 741 int flags; 742 }; 743 744 typedef struct hammer_node_lock *hammer_node_lock_t; 745 746 #define HAMMER_NODE_LOCK_UPDATED 0x0001 747 #define HAMMER_NODE_LOCK_LCACHE 0x0002 748 749 /* 750 * Common I/O management structure - embedded in in-memory structures 751 * which are backed by filesystem buffers. 752 */ 753 union hammer_io_structure { 754 struct hammer_io io; 755 struct hammer_volume volume; 756 struct hammer_buffer buffer; 757 }; 758 759 typedef union hammer_io_structure *hammer_io_structure_t; 760 761 /* 762 * The reserve structure prevents the blockmap from allocating 763 * out of a reserved bigblock. Such reservations are used by 764 * the direct-write mechanism. 765 * 766 * The structure is also used to hold off on reallocations of 767 * big blocks from the freemap until flush dependancies have 768 * been dealt with. 769 */ 770 struct hammer_reserve { 771 RB_ENTRY(hammer_reserve) rb_node; 772 TAILQ_ENTRY(hammer_reserve) delay_entry; 773 int flush_group; 774 int flags; 775 int refs; 776 int zone; 777 int append_off; 778 hammer_off_t zone_offset; 779 }; 780 781 typedef struct hammer_reserve *hammer_reserve_t; 782 783 #define HAMMER_RESF_ONDELAY 0x0001 784 #define HAMMER_RESF_LAYER2FREE 0x0002 785 786 #include "hammer_cursor.h" 787 788 /* 789 * The undo structure tracks recent undos to avoid laying down duplicate 790 * undos within a flush group, saving us a significant amount of overhead. 791 * 792 * This is strictly a heuristic. 793 */ 794 #define HAMMER_MAX_UNDOS 1024 795 #define HAMMER_MAX_FLUSHERS 4 796 797 struct hammer_undo { 798 RB_ENTRY(hammer_undo) rb_node; 799 TAILQ_ENTRY(hammer_undo) lru_entry; 800 hammer_off_t offset; 801 int bytes; 802 }; 803 804 typedef struct hammer_undo *hammer_undo_t; 805 806 struct hammer_flusher_info; 807 TAILQ_HEAD(hammer_flusher_info_list, hammer_flusher_info); 808 809 struct hammer_flusher { 810 int signal; /* flusher thread sequencer */ 811 int act; /* currently active flush group */ 812 int done; /* set to act when complete */ 813 int next; /* next flush group */ 814 int group_lock; /* lock sequencing of the next flush */ 815 int exiting; /* request master exit */ 816 thread_t td; /* master flusher thread */ 817 hammer_tid_t tid; /* last flushed transaction id */ 818 int finalize_want; /* serialize finalization */ 819 struct hammer_lock finalize_lock; /* serialize finalization */ 820 struct hammer_transaction trans; /* shared transaction */ 821 struct hammer_flusher_info_list run_list; 822 struct hammer_flusher_info_list ready_list; 823 }; 824 825 #define HAMMER_FLUSH_UNDOS_RELAXED 0 826 #define HAMMER_FLUSH_UNDOS_FORCED 1 827 #define HAMMER_FLUSH_UNDOS_AUTO 2 828 /* 829 * Internal hammer mount data structure 830 */ 831 struct hammer_mount { 832 struct mount *mp; 833 /*struct vnode *rootvp;*/ 834 struct hammer_ino_rb_tree rb_inos_root; 835 struct hammer_redo_rb_tree rb_redo_root; 836 struct hammer_vol_rb_tree rb_vols_root; 837 struct hammer_nod_rb_tree rb_nods_root; 838 struct hammer_und_rb_tree rb_undo_root; 839 struct hammer_res_rb_tree rb_resv_root; 840 struct hammer_buf_rb_tree rb_bufs_root; 841 struct hammer_pfs_rb_tree rb_pfsm_root; 842 struct hammer_volume *rootvol; 843 struct hammer_base_elm root_btree_beg; 844 struct hammer_base_elm root_btree_end; 845 846 struct malloc_type *m_misc; 847 struct malloc_type *m_inodes; 848 849 int flags; /* HAMMER_MOUNT_xxx flags */ 850 int hflags; 851 int ronly; 852 int nvolumes; 853 int volume_iterator; 854 int master_id; /* -1 or 0-15 - clustering and mirroring */ 855 int version; /* hammer filesystem version to use */ 856 int rsv_inodes; /* reserved space due to dirty inodes */ 857 int64_t rsv_databytes; /* reserved space due to record data */ 858 int rsv_recs; /* reserved space due to dirty records */ 859 int rsv_fromdelay; /* bigblocks reserved due to flush delay */ 860 int undo_rec_limit; /* based on size of undo area */ 861 int last_newrecords; 862 int count_newrecords; 863 864 int volume_to_remove; /* volume that is currently being removed */ 865 866 int inode_reclaims; /* inodes pending reclaim by flusher */ 867 int count_inodes; /* total number of inodes */ 868 int count_iqueued; /* inodes queued to flusher */ 869 870 struct hammer_flusher flusher; 871 872 u_int check_interrupt; 873 u_int check_yield; 874 uuid_t fsid; 875 struct hammer_io_list volu_list; /* dirty undo buffers */ 876 struct hammer_io_list undo_list; /* dirty undo buffers */ 877 struct hammer_io_list data_list; /* dirty data buffers */ 878 struct hammer_io_list alt_data_list; /* dirty data buffers */ 879 struct hammer_io_list meta_list; /* dirty meta bufs */ 880 struct hammer_io_list lose_list; /* loose buffers */ 881 int locked_dirty_space; /* meta/volu count */ 882 int io_running_space; /* io_token */ 883 int io_running_wakeup; /* io_token */ 884 int objid_cache_count; 885 int error; /* critical I/O error */ 886 struct krate krate; /* rate limited kprintf */ 887 hammer_tid_t asof; /* snapshot mount */ 888 hammer_tid_t next_tid; 889 hammer_tid_t flush_tid1; /* flusher tid sequencing */ 890 hammer_tid_t flush_tid2; /* flusher tid sequencing */ 891 int64_t copy_stat_freebigblocks; /* number of free bigblocks */ 892 u_int32_t undo_seqno; /* UNDO/REDO FIFO seqno */ 893 u_int32_t recover_stage2_seqno; /* REDO recovery seqno */ 894 hammer_off_t recover_stage2_offset; /* REDO recovery offset */ 895 896 struct netexport export; 897 struct hammer_lock sync_lock; 898 struct hammer_lock free_lock; 899 struct hammer_lock undo_lock; 900 struct hammer_lock blkmap_lock; 901 struct hammer_lock snapshot_lock; 902 struct hammer_lock volume_lock; 903 struct hammer_blockmap blockmap[HAMMER_MAX_ZONES]; 904 struct hammer_undo undos[HAMMER_MAX_UNDOS]; 905 int undo_alloc; 906 TAILQ_HEAD(, hammer_undo) undo_lru_list; 907 TAILQ_HEAD(, hammer_reserve) delay_list; 908 struct hammer_flush_group_list flush_group_list; 909 hammer_flush_group_t next_flush_group; 910 TAILQ_HEAD(, hammer_objid_cache) objid_cache_list; 911 TAILQ_HEAD(, hammer_reclaim) reclaim_list; 912 TAILQ_HEAD(, hammer_io) iorun_list; 913 914 struct lwkt_token fs_token; /* high level */ 915 struct lwkt_token io_token; /* low level (IO callback) */ 916 917 struct hammer_inostats inostats[HAMMER_INOSTATS_HSIZE]; 918 }; 919 920 typedef struct hammer_mount *hammer_mount_t; 921 922 #define HAMMER_MOUNT_CRITICAL_ERROR 0x0001 923 #define HAMMER_MOUNT_FLUSH_RECOVERY 0x0002 924 #define HAMMER_MOUNT_REDO_SYNC 0x0004 925 #define HAMMER_MOUNT_REDO_RECOVERY_REQ 0x0008 926 #define HAMMER_MOUNT_REDO_RECOVERY_RUN 0x0010 927 928 struct hammer_sync_info { 929 int error; 930 int waitfor; 931 }; 932 933 /* 934 * Minium buffer cache bufs required to rebalance the B-Tree. 935 * This is because we must hold the children and the children's children 936 * locked. Even this might not be enough if things are horribly out 937 * of balance. 938 */ 939 #define HAMMER_REBALANCE_MIN_BUFS \ 940 (HAMMER_BTREE_LEAF_ELMS * HAMMER_BTREE_LEAF_ELMS) 941 942 943 #endif 944 945 /* 946 * checkspace slop (8MB chunks), higher numbers are more conservative. 947 */ 948 #define HAMMER_CHKSPC_REBLOCK 25 949 #define HAMMER_CHKSPC_MIRROR 20 950 #define HAMMER_CHKSPC_WRITE 20 951 #define HAMMER_CHKSPC_CREATE 20 952 #define HAMMER_CHKSPC_REMOVE 10 953 #define HAMMER_CHKSPC_EMERGENCY 0 954 955 #if defined(_KERNEL) 956 957 extern struct vop_ops hammer_vnode_vops; 958 extern struct vop_ops hammer_spec_vops; 959 extern struct vop_ops hammer_fifo_vops; 960 extern struct bio_ops hammer_bioops; 961 962 extern int hammer_debug_io; 963 extern int hammer_debug_general; 964 extern int hammer_debug_debug; 965 extern int hammer_debug_inode; 966 extern int hammer_debug_locks; 967 extern int hammer_debug_btree; 968 extern int hammer_debug_tid; 969 extern int hammer_debug_recover; 970 extern int hammer_debug_recover_faults; 971 extern int hammer_debug_critical; 972 extern int hammer_cluster_enable; 973 extern int hammer_count_fsyncs; 974 extern int hammer_count_inodes; 975 extern int hammer_count_iqueued; 976 extern int hammer_count_reclaiming; 977 extern int hammer_count_records; 978 extern int hammer_count_record_datas; 979 extern int hammer_count_volumes; 980 extern int hammer_count_buffers; 981 extern int hammer_count_nodes; 982 extern int64_t hammer_count_extra_space_used; 983 extern int64_t hammer_stats_btree_lookups; 984 extern int64_t hammer_stats_btree_searches; 985 extern int64_t hammer_stats_btree_inserts; 986 extern int64_t hammer_stats_btree_deletes; 987 extern int64_t hammer_stats_btree_elements; 988 extern int64_t hammer_stats_btree_splits; 989 extern int64_t hammer_stats_btree_iterations; 990 extern int64_t hammer_stats_btree_root_iterations; 991 extern int64_t hammer_stats_record_iterations; 992 extern int64_t hammer_stats_file_read; 993 extern int64_t hammer_stats_file_write; 994 extern int64_t hammer_stats_file_iopsr; 995 extern int64_t hammer_stats_file_iopsw; 996 extern int64_t hammer_stats_disk_read; 997 extern int64_t hammer_stats_disk_write; 998 extern int64_t hammer_stats_inode_flushes; 999 extern int64_t hammer_stats_commits; 1000 extern int64_t hammer_stats_undo; 1001 extern int64_t hammer_stats_redo; 1002 extern int hammer_count_dirtybufspace; 1003 extern int hammer_count_refedbufs; 1004 extern int hammer_count_reservations; 1005 extern int hammer_count_io_running_read; 1006 extern int hammer_count_io_running_write; 1007 extern int hammer_count_io_locked; 1008 extern int hammer_limit_dirtybufspace; 1009 extern int hammer_limit_running_io; 1010 extern int hammer_limit_recs; 1011 extern int hammer_limit_inode_recs; 1012 extern int hammer_limit_reclaim; 1013 extern int hammer_limit_redo; 1014 extern int hammer_bio_count; 1015 extern int hammer_verify_zone; 1016 extern int hammer_verify_data; 1017 extern int hammer_write_mode; 1018 extern int hammer_yield_check; 1019 extern int hammer_fsync_mode; 1020 extern int hammer_autoflush; 1021 extern int64_t hammer_contention_count; 1022 1023 void hammer_critical_error(hammer_mount_t hmp, hammer_inode_t ip, 1024 int error, const char *msg); 1025 int hammer_vop_inactive(struct vop_inactive_args *); 1026 int hammer_vop_reclaim(struct vop_reclaim_args *); 1027 int hammer_get_vnode(struct hammer_inode *ip, struct vnode **vpp); 1028 struct hammer_inode *hammer_get_inode(hammer_transaction_t trans, 1029 hammer_inode_t dip, int64_t obj_id, 1030 hammer_tid_t asof, u_int32_t localization, 1031 int flags, int *errorp); 1032 struct hammer_inode *hammer_get_dummy_inode(hammer_transaction_t trans, 1033 hammer_inode_t dip, int64_t obj_id, 1034 hammer_tid_t asof, u_int32_t localization, 1035 int flags, int *errorp); 1036 struct hammer_inode *hammer_find_inode(hammer_transaction_t trans, 1037 int64_t obj_id, hammer_tid_t asof, 1038 u_int32_t localization); 1039 void hammer_scan_inode_snapshots(hammer_mount_t hmp, 1040 hammer_inode_info_t iinfo, 1041 int (*callback)(hammer_inode_t ip, void *data), 1042 void *data); 1043 void hammer_put_inode(struct hammer_inode *ip); 1044 void hammer_put_inode_ref(struct hammer_inode *ip); 1045 void hammer_inode_waitreclaims(hammer_transaction_t trans); 1046 1047 int hammer_unload_volume(hammer_volume_t volume, void *data __unused); 1048 int hammer_adjust_volume_mode(hammer_volume_t volume, void *data __unused); 1049 1050 int hammer_unload_buffer(hammer_buffer_t buffer, void *data); 1051 int hammer_install_volume(hammer_mount_t hmp, const char *volname, 1052 struct vnode *devvp); 1053 int hammer_mountcheck_volumes(hammer_mount_t hmp); 1054 1055 int hammer_mem_add(hammer_record_t record); 1056 int hammer_ip_lookup(hammer_cursor_t cursor); 1057 int hammer_ip_first(hammer_cursor_t cursor); 1058 int hammer_ip_next(hammer_cursor_t cursor); 1059 int hammer_ip_resolve_data(hammer_cursor_t cursor); 1060 int hammer_ip_delete_record(hammer_cursor_t cursor, hammer_inode_t ip, 1061 hammer_tid_t tid); 1062 int hammer_create_at_cursor(hammer_cursor_t cursor, 1063 hammer_btree_leaf_elm_t leaf, void *udata, int mode); 1064 int hammer_delete_at_cursor(hammer_cursor_t cursor, int delete_flags, 1065 hammer_tid_t delete_tid, u_int32_t delete_ts, 1066 int track, int64_t *stat_bytes); 1067 int hammer_ip_check_directory_empty(hammer_transaction_t trans, 1068 hammer_inode_t ip); 1069 int hammer_sync_hmp(hammer_mount_t hmp, int waitfor); 1070 int hammer_queue_inodes_flusher(hammer_mount_t hmp, int waitfor); 1071 1072 hammer_record_t 1073 hammer_alloc_mem_record(hammer_inode_t ip, int data_len); 1074 void hammer_flush_record_done(hammer_record_t record, int error); 1075 void hammer_wait_mem_record_ident(hammer_record_t record, const char *ident); 1076 void hammer_rel_mem_record(hammer_record_t record); 1077 1078 int hammer_cursor_up(hammer_cursor_t cursor); 1079 int hammer_cursor_up_locked(hammer_cursor_t cursor); 1080 int hammer_cursor_down(hammer_cursor_t cursor); 1081 int hammer_cursor_upgrade(hammer_cursor_t cursor); 1082 int hammer_cursor_upgrade_node(hammer_cursor_t cursor); 1083 void hammer_cursor_downgrade(hammer_cursor_t cursor); 1084 int hammer_cursor_upgrade2(hammer_cursor_t c1, hammer_cursor_t c2); 1085 void hammer_cursor_downgrade2(hammer_cursor_t c1, hammer_cursor_t c2); 1086 int hammer_cursor_seek(hammer_cursor_t cursor, hammer_node_t node, 1087 int index); 1088 void hammer_lock_ex_ident(struct hammer_lock *lock, const char *ident); 1089 int hammer_lock_ex_try(struct hammer_lock *lock); 1090 void hammer_lock_sh(struct hammer_lock *lock); 1091 int hammer_lock_sh_try(struct hammer_lock *lock); 1092 int hammer_lock_upgrade(struct hammer_lock *lock, int shcount); 1093 void hammer_lock_downgrade(struct hammer_lock *lock, int shcount); 1094 int hammer_lock_status(struct hammer_lock *lock); 1095 void hammer_unlock(struct hammer_lock *lock); 1096 void hammer_ref(struct hammer_lock *lock); 1097 int hammer_ref_interlock(struct hammer_lock *lock); 1098 int hammer_ref_interlock_true(struct hammer_lock *lock); 1099 void hammer_ref_interlock_done(struct hammer_lock *lock); 1100 void hammer_rel(struct hammer_lock *lock); 1101 int hammer_rel_interlock(struct hammer_lock *lock, int locked); 1102 void hammer_rel_interlock_done(struct hammer_lock *lock, int orig_locked); 1103 int hammer_get_interlock(struct hammer_lock *lock); 1104 int hammer_try_interlock_norefs(struct hammer_lock *lock); 1105 void hammer_put_interlock(struct hammer_lock *lock, int error); 1106 1107 void hammer_sync_lock_ex(hammer_transaction_t trans); 1108 void hammer_sync_lock_sh(hammer_transaction_t trans); 1109 int hammer_sync_lock_sh_try(hammer_transaction_t trans); 1110 void hammer_sync_unlock(hammer_transaction_t trans); 1111 1112 u_int32_t hammer_to_unix_xid(uuid_t *uuid); 1113 void hammer_guid_to_uuid(uuid_t *uuid, u_int32_t guid); 1114 void hammer_time_to_timespec(u_int64_t xtime, struct timespec *ts); 1115 u_int64_t hammer_timespec_to_time(struct timespec *ts); 1116 int hammer_str_to_tid(const char *str, int *ispfsp, 1117 hammer_tid_t *tidp, u_int32_t *localizationp); 1118 int hammer_is_atatext(const char *name, int len); 1119 hammer_tid_t hammer_alloc_objid(hammer_mount_t hmp, hammer_inode_t dip, 1120 int64_t namekey); 1121 void hammer_clear_objid(hammer_inode_t dip); 1122 void hammer_destroy_objid_cache(hammer_mount_t hmp); 1123 1124 int hammer_enter_undo_history(hammer_mount_t hmp, hammer_off_t offset, 1125 int bytes); 1126 void hammer_clear_undo_history(hammer_mount_t hmp); 1127 enum vtype hammer_get_vnode_type(u_int8_t obj_type); 1128 int hammer_get_dtype(u_int8_t obj_type); 1129 u_int8_t hammer_get_obj_type(enum vtype vtype); 1130 int64_t hammer_directory_namekey(hammer_inode_t dip, const void *name, int len, 1131 u_int32_t *max_iterationsp); 1132 int hammer_nohistory(hammer_inode_t ip); 1133 1134 int hammer_init_cursor(hammer_transaction_t trans, hammer_cursor_t cursor, 1135 hammer_node_cache_t cache, hammer_inode_t ip); 1136 void hammer_normalize_cursor(hammer_cursor_t cursor); 1137 void hammer_done_cursor(hammer_cursor_t cursor); 1138 int hammer_recover_cursor(hammer_cursor_t cursor); 1139 void hammer_unlock_cursor(hammer_cursor_t cursor); 1140 int hammer_lock_cursor(hammer_cursor_t cursor); 1141 hammer_cursor_t hammer_push_cursor(hammer_cursor_t ocursor); 1142 void hammer_pop_cursor(hammer_cursor_t ocursor, hammer_cursor_t ncursor); 1143 1144 void hammer_cursor_replaced_node(hammer_node_t onode, hammer_node_t nnode); 1145 void hammer_cursor_removed_node(hammer_node_t onode, hammer_node_t parent, 1146 int index); 1147 void hammer_cursor_split_node(hammer_node_t onode, hammer_node_t nnode, 1148 int index); 1149 void hammer_cursor_moved_element(hammer_node_t oparent, int pindex, 1150 hammer_node_t onode, int oindex, 1151 hammer_node_t nnode, int nindex); 1152 void hammer_cursor_parent_changed(hammer_node_t node, hammer_node_t oparent, 1153 hammer_node_t nparent, int nindex); 1154 void hammer_cursor_inserted_element(hammer_node_t node, int index); 1155 void hammer_cursor_deleted_element(hammer_node_t node, int index); 1156 void hammer_cursor_invalidate_cache(hammer_cursor_t cursor); 1157 1158 int hammer_btree_lookup(hammer_cursor_t cursor); 1159 int hammer_btree_first(hammer_cursor_t cursor); 1160 int hammer_btree_last(hammer_cursor_t cursor); 1161 int hammer_btree_extract(hammer_cursor_t cursor, int flags); 1162 int hammer_btree_iterate(hammer_cursor_t cursor); 1163 int hammer_btree_iterate_reverse(hammer_cursor_t cursor); 1164 int hammer_btree_insert(hammer_cursor_t cursor, 1165 hammer_btree_leaf_elm_t elm, int *doprop); 1166 int hammer_btree_delete(hammer_cursor_t cursor); 1167 void hammer_btree_do_propagation(hammer_cursor_t cursor, 1168 hammer_pseudofs_inmem_t pfsm, 1169 hammer_btree_leaf_elm_t leaf); 1170 int hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2); 1171 int hammer_btree_chkts(hammer_tid_t ts, hammer_base_elm_t key); 1172 int hammer_btree_correct_rhb(hammer_cursor_t cursor, hammer_tid_t tid); 1173 int hammer_btree_correct_lhb(hammer_cursor_t cursor, hammer_tid_t tid); 1174 1175 int btree_set_parent(hammer_transaction_t trans, hammer_node_t node, 1176 hammer_btree_elm_t elm); 1177 void hammer_node_lock_init(hammer_node_lock_t parent, hammer_node_t node); 1178 void hammer_btree_lcache_init(hammer_mount_t hmp, hammer_node_lock_t lcache, 1179 int depth); 1180 void hammer_btree_lcache_free(hammer_mount_t hmp, hammer_node_lock_t lcache); 1181 int hammer_btree_lock_children(hammer_cursor_t cursor, int depth, 1182 hammer_node_lock_t parent, 1183 hammer_node_lock_t lcache); 1184 void hammer_btree_lock_copy(hammer_cursor_t cursor, 1185 hammer_node_lock_t parent); 1186 int hammer_btree_sync_copy(hammer_cursor_t cursor, 1187 hammer_node_lock_t parent); 1188 void hammer_btree_unlock_children(hammer_mount_t hmp, 1189 hammer_node_lock_t parent, 1190 hammer_node_lock_t lcache); 1191 int hammer_btree_search_node(hammer_base_elm_t elm, hammer_node_ondisk_t node); 1192 hammer_node_t hammer_btree_get_parent(hammer_transaction_t trans, 1193 hammer_node_t node, int *parent_indexp, 1194 int *errorp, int try_exclusive); 1195 1196 void hammer_print_btree_node(hammer_node_ondisk_t ondisk); 1197 void hammer_print_btree_elm(hammer_btree_elm_t elm, u_int8_t type, int i); 1198 1199 void *hammer_bread(struct hammer_mount *hmp, hammer_off_t off, 1200 int *errorp, struct hammer_buffer **bufferp); 1201 void *hammer_bnew(struct hammer_mount *hmp, hammer_off_t off, 1202 int *errorp, struct hammer_buffer **bufferp); 1203 void *hammer_bread_ext(struct hammer_mount *hmp, hammer_off_t off, int bytes, 1204 int *errorp, struct hammer_buffer **bufferp); 1205 void *hammer_bnew_ext(struct hammer_mount *hmp, hammer_off_t off, int bytes, 1206 int *errorp, struct hammer_buffer **bufferp); 1207 1208 hammer_volume_t hammer_get_root_volume(hammer_mount_t hmp, int *errorp); 1209 1210 hammer_volume_t hammer_get_volume(hammer_mount_t hmp, 1211 int32_t vol_no, int *errorp); 1212 hammer_buffer_t hammer_get_buffer(hammer_mount_t hmp, hammer_off_t buf_offset, 1213 int bytes, int isnew, int *errorp); 1214 void hammer_sync_buffers(hammer_mount_t hmp, 1215 hammer_off_t base_offset, int bytes); 1216 int hammer_del_buffers(hammer_mount_t hmp, 1217 hammer_off_t base_offset, 1218 hammer_off_t zone2_offset, int bytes, 1219 int report_conflicts); 1220 1221 int hammer_ref_volume(hammer_volume_t volume); 1222 int hammer_ref_buffer(hammer_buffer_t buffer); 1223 void hammer_flush_buffer_nodes(hammer_buffer_t buffer); 1224 1225 void hammer_rel_volume(hammer_volume_t volume, int locked); 1226 void hammer_rel_buffer(hammer_buffer_t buffer, int locked); 1227 1228 int hammer_vfs_export(struct mount *mp, int op, 1229 const struct export_args *export); 1230 hammer_node_t hammer_get_node(hammer_transaction_t trans, 1231 hammer_off_t node_offset, int isnew, int *errorp); 1232 void hammer_ref_node(hammer_node_t node); 1233 hammer_node_t hammer_ref_node_safe(hammer_transaction_t trans, 1234 hammer_node_cache_t cache, int *errorp); 1235 void hammer_rel_node(hammer_node_t node); 1236 void hammer_delete_node(hammer_transaction_t trans, 1237 hammer_node_t node); 1238 void hammer_cache_node(hammer_node_cache_t cache, 1239 hammer_node_t node); 1240 void hammer_uncache_node(hammer_node_cache_t cache); 1241 void hammer_flush_node(hammer_node_t node, int locked); 1242 1243 void hammer_dup_buffer(struct hammer_buffer **bufferp, 1244 struct hammer_buffer *buffer); 1245 hammer_node_t hammer_alloc_btree(hammer_transaction_t trans, 1246 hammer_off_t hint, int *errorp); 1247 void *hammer_alloc_data(hammer_transaction_t trans, int32_t data_len, 1248 u_int16_t rec_type, hammer_off_t *data_offsetp, 1249 struct hammer_buffer **data_bufferp, 1250 hammer_off_t hint, int *errorp); 1251 1252 int hammer_generate_undo(hammer_transaction_t trans, 1253 hammer_off_t zone1_offset, void *base, int len); 1254 int hammer_generate_redo(hammer_transaction_t trans, hammer_inode_t ip, 1255 hammer_off_t file_offset, u_int32_t flags, 1256 void *base, int len); 1257 void hammer_generate_redo_sync(hammer_transaction_t trans); 1258 void hammer_redo_fifo_start_flush(hammer_inode_t ip); 1259 void hammer_redo_fifo_end_flush(hammer_inode_t ip); 1260 1261 void hammer_format_undo(void *base, u_int32_t seqno); 1262 int hammer_upgrade_undo_4(hammer_transaction_t trans); 1263 1264 void hammer_put_volume(struct hammer_volume *volume, int flush); 1265 void hammer_put_buffer(struct hammer_buffer *buffer, int flush); 1266 1267 hammer_off_t hammer_freemap_alloc(hammer_transaction_t trans, 1268 hammer_off_t owner, int *errorp); 1269 void hammer_freemap_free(hammer_transaction_t trans, hammer_off_t phys_offset, 1270 hammer_off_t owner, int *errorp); 1271 int _hammer_checkspace(hammer_mount_t hmp, int slop, int64_t *resp); 1272 hammer_off_t hammer_blockmap_alloc(hammer_transaction_t trans, int zone, 1273 int bytes, hammer_off_t hint, int *errorp); 1274 hammer_reserve_t hammer_blockmap_reserve(hammer_mount_t hmp, int zone, 1275 int bytes, hammer_off_t *zone_offp, int *errorp); 1276 void hammer_blockmap_reserve_complete(hammer_mount_t hmp, 1277 hammer_reserve_t resv); 1278 void hammer_reserve_clrdelay(hammer_mount_t hmp, hammer_reserve_t resv); 1279 void hammer_blockmap_free(hammer_transaction_t trans, 1280 hammer_off_t bmap_off, int bytes); 1281 int hammer_blockmap_dedup(hammer_transaction_t trans, 1282 hammer_off_t bmap_off, int bytes); 1283 int hammer_blockmap_finalize(hammer_transaction_t trans, 1284 hammer_reserve_t resv, 1285 hammer_off_t bmap_off, int bytes); 1286 int hammer_blockmap_getfree(hammer_mount_t hmp, hammer_off_t bmap_off, 1287 int *curp, int *errorp); 1288 hammer_off_t hammer_blockmap_lookup(hammer_mount_t hmp, hammer_off_t bmap_off, 1289 int *errorp); 1290 hammer_off_t hammer_undo_lookup(hammer_mount_t hmp, hammer_off_t bmap_off, 1291 int *errorp); 1292 int64_t hammer_undo_used(hammer_transaction_t trans); 1293 int64_t hammer_undo_space(hammer_transaction_t trans); 1294 int64_t hammer_undo_max(hammer_mount_t hmp); 1295 int hammer_undo_reclaim(hammer_io_t io); 1296 1297 void hammer_start_transaction(struct hammer_transaction *trans, 1298 struct hammer_mount *hmp); 1299 void hammer_simple_transaction(struct hammer_transaction *trans, 1300 struct hammer_mount *hmp); 1301 void hammer_start_transaction_fls(struct hammer_transaction *trans, 1302 struct hammer_mount *hmp); 1303 void hammer_done_transaction(struct hammer_transaction *trans); 1304 hammer_tid_t hammer_alloc_tid(hammer_mount_t hmp, int count); 1305 1306 void hammer_modify_inode(hammer_transaction_t trans, hammer_inode_t ip, int flags); 1307 void hammer_flush_inode(hammer_inode_t ip, int flags); 1308 void hammer_flush_inode_done(hammer_inode_t ip, int error); 1309 void hammer_wait_inode(hammer_inode_t ip); 1310 1311 int hammer_create_inode(struct hammer_transaction *trans, struct vattr *vap, 1312 struct ucred *cred, struct hammer_inode *dip, 1313 const char *name, int namelen, 1314 hammer_pseudofs_inmem_t pfsm, 1315 struct hammer_inode **ipp); 1316 void hammer_rel_inode(hammer_inode_t ip, int flush); 1317 int hammer_reload_inode(hammer_inode_t ip, void *arg __unused); 1318 int hammer_ino_rb_compare(hammer_inode_t ip1, hammer_inode_t ip2); 1319 int hammer_redo_rb_compare(hammer_inode_t ip1, hammer_inode_t ip2); 1320 int hammer_destroy_inode_callback(hammer_inode_t ip, void *data __unused); 1321 1322 int hammer_sync_inode(hammer_transaction_t trans, hammer_inode_t ip); 1323 void hammer_test_inode(hammer_inode_t dip); 1324 void hammer_inode_unloadable_check(hammer_inode_t ip, int getvp); 1325 1326 int hammer_ip_add_directory(struct hammer_transaction *trans, 1327 hammer_inode_t dip, const char *name, int bytes, 1328 hammer_inode_t nip); 1329 int hammer_ip_del_directory(struct hammer_transaction *trans, 1330 hammer_cursor_t cursor, hammer_inode_t dip, 1331 hammer_inode_t ip); 1332 void hammer_ip_replace_bulk(hammer_mount_t hmp, hammer_record_t record); 1333 hammer_record_t hammer_ip_add_bulk(hammer_inode_t ip, off_t file_offset, 1334 void *data, int bytes, int *errorp); 1335 int hammer_ip_frontend_trunc(struct hammer_inode *ip, off_t file_size); 1336 int hammer_ip_add_record(struct hammer_transaction *trans, 1337 hammer_record_t record); 1338 int hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip, 1339 int64_t ran_beg, int64_t ran_end, int truncating); 1340 int hammer_ip_delete_clean(hammer_cursor_t cursor, hammer_inode_t ip, 1341 int *countp); 1342 int hammer_ip_sync_data(hammer_cursor_t cursor, hammer_inode_t ip, 1343 int64_t offset, void *data, int bytes); 1344 int hammer_ip_sync_record(hammer_transaction_t trans, hammer_record_t rec); 1345 int hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t rec); 1346 hammer_pseudofs_inmem_t hammer_load_pseudofs(hammer_transaction_t trans, 1347 u_int32_t localization, int *errorp); 1348 int hammer_mkroot_pseudofs(hammer_transaction_t trans, struct ucred *cred, 1349 hammer_pseudofs_inmem_t pfsm); 1350 int hammer_save_pseudofs(hammer_transaction_t trans, 1351 hammer_pseudofs_inmem_t pfsm); 1352 int hammer_unload_pseudofs(hammer_transaction_t trans, u_int32_t localization); 1353 void hammer_rel_pseudofs(hammer_mount_t hmp, hammer_pseudofs_inmem_t pfsm); 1354 int hammer_ioctl(hammer_inode_t ip, u_long com, caddr_t data, int fflag, 1355 struct ucred *cred); 1356 1357 void hammer_io_init(hammer_io_t io, hammer_volume_t volume, 1358 enum hammer_io_type type); 1359 int hammer_io_read(struct vnode *devvp, struct hammer_io *io, int limit); 1360 void hammer_io_advance(struct hammer_io *io); 1361 int hammer_io_new(struct vnode *devvp, struct hammer_io *io); 1362 int hammer_io_inval(hammer_volume_t volume, hammer_off_t zone2_offset); 1363 struct buf *hammer_io_release(struct hammer_io *io, int flush); 1364 void hammer_io_flush(struct hammer_io *io, int reclaim); 1365 void hammer_io_wait(struct hammer_io *io); 1366 void hammer_io_waitdep(struct hammer_io *io); 1367 void hammer_io_wait_all(hammer_mount_t hmp, const char *ident, int doflush); 1368 int hammer_io_direct_read(hammer_mount_t hmp, struct bio *bio, 1369 hammer_btree_leaf_elm_t leaf); 1370 int hammer_io_direct_write(hammer_mount_t hmp, struct bio *bio, 1371 hammer_record_t record); 1372 void hammer_io_direct_wait(hammer_record_t record); 1373 void hammer_io_direct_uncache(hammer_mount_t hmp, hammer_btree_leaf_elm_t leaf); 1374 void hammer_io_write_interlock(hammer_io_t io); 1375 void hammer_io_done_interlock(hammer_io_t io); 1376 void hammer_io_clear_modify(struct hammer_io *io, int inval); 1377 void hammer_io_clear_modlist(struct hammer_io *io); 1378 void hammer_io_flush_sync(hammer_mount_t hmp); 1379 void hammer_io_clear_error(struct hammer_io *io); 1380 void hammer_io_clear_error_noassert(struct hammer_io *io); 1381 void hammer_io_notmeta(hammer_buffer_t buffer); 1382 void hammer_io_limit_backlog(hammer_mount_t hmp); 1383 1384 void hammer_modify_volume(hammer_transaction_t trans, hammer_volume_t volume, 1385 void *base, int len); 1386 void hammer_modify_buffer(hammer_transaction_t trans, hammer_buffer_t buffer, 1387 void *base, int len); 1388 void hammer_modify_volume_done(hammer_volume_t volume); 1389 void hammer_modify_buffer_done(hammer_buffer_t buffer); 1390 1391 int hammer_ioc_reblock(hammer_transaction_t trans, hammer_inode_t ip, 1392 struct hammer_ioc_reblock *reblock); 1393 int hammer_ioc_rebalance(hammer_transaction_t trans, hammer_inode_t ip, 1394 struct hammer_ioc_rebalance *rebal); 1395 int hammer_ioc_prune(hammer_transaction_t trans, hammer_inode_t ip, 1396 struct hammer_ioc_prune *prune); 1397 int hammer_ioc_mirror_read(hammer_transaction_t trans, hammer_inode_t ip, 1398 struct hammer_ioc_mirror_rw *mirror); 1399 int hammer_ioc_mirror_write(hammer_transaction_t trans, hammer_inode_t ip, 1400 struct hammer_ioc_mirror_rw *mirror); 1401 int hammer_ioc_set_pseudofs(hammer_transaction_t trans, hammer_inode_t ip, 1402 struct ucred *cred, struct hammer_ioc_pseudofs_rw *pfs); 1403 int hammer_ioc_get_pseudofs(hammer_transaction_t trans, hammer_inode_t ip, 1404 struct hammer_ioc_pseudofs_rw *pfs); 1405 int hammer_ioc_destroy_pseudofs(hammer_transaction_t trans, hammer_inode_t ip, 1406 struct hammer_ioc_pseudofs_rw *pfs); 1407 int hammer_ioc_downgrade_pseudofs(hammer_transaction_t trans, hammer_inode_t ip, 1408 struct hammer_ioc_pseudofs_rw *pfs); 1409 int hammer_ioc_upgrade_pseudofs(hammer_transaction_t trans, hammer_inode_t ip, 1410 struct hammer_ioc_pseudofs_rw *pfs); 1411 int hammer_ioc_wait_pseudofs(hammer_transaction_t trans, hammer_inode_t ip, 1412 struct hammer_ioc_pseudofs_rw *pfs); 1413 int hammer_ioc_volume_add(hammer_transaction_t trans, hammer_inode_t ip, 1414 struct hammer_ioc_volume *ioc); 1415 int hammer_ioc_volume_del(hammer_transaction_t trans, hammer_inode_t ip, 1416 struct hammer_ioc_volume *ioc); 1417 int hammer_ioc_volume_list(hammer_transaction_t trans, hammer_inode_t ip, 1418 struct hammer_ioc_volume_list *ioc); 1419 int hammer_ioc_dedup(hammer_transaction_t trans, hammer_inode_t ip, 1420 struct hammer_ioc_dedup *dedup); 1421 1422 int hammer_signal_check(hammer_mount_t hmp); 1423 1424 void hammer_flusher_create(hammer_mount_t hmp); 1425 void hammer_flusher_destroy(hammer_mount_t hmp); 1426 void hammer_flusher_sync(hammer_mount_t hmp); 1427 int hammer_flusher_async(hammer_mount_t hmp, hammer_flush_group_t flg); 1428 int hammer_flusher_async_one(hammer_mount_t hmp); 1429 void hammer_flusher_wait(hammer_mount_t hmp, int seq); 1430 void hammer_flusher_wait_next(hammer_mount_t hmp); 1431 int hammer_flusher_meta_limit(hammer_mount_t hmp); 1432 int hammer_flusher_meta_halflimit(hammer_mount_t hmp); 1433 int hammer_flusher_undo_exhausted(hammer_transaction_t trans, int quarter); 1434 void hammer_flusher_clean_loose_ios(hammer_mount_t hmp); 1435 void hammer_flusher_finalize(hammer_transaction_t trans, int final); 1436 int hammer_flusher_haswork(hammer_mount_t hmp); 1437 void hammer_flusher_flush_undos(hammer_mount_t hmp, int already_flushed); 1438 1439 int hammer_recover_stage1(hammer_mount_t hmp, hammer_volume_t rootvol); 1440 int hammer_recover_stage2(hammer_mount_t hmp, hammer_volume_t rootvol); 1441 void hammer_recover_flush_buffers(hammer_mount_t hmp, 1442 hammer_volume_t root_volume, int final); 1443 1444 void hammer_crc_set_blockmap(hammer_blockmap_t blockmap); 1445 void hammer_crc_set_volume(hammer_volume_ondisk_t ondisk); 1446 void hammer_crc_set_leaf(void *data, hammer_btree_leaf_elm_t leaf); 1447 1448 int hammer_crc_test_blockmap(hammer_blockmap_t blockmap); 1449 int hammer_crc_test_volume(hammer_volume_ondisk_t ondisk); 1450 int hammer_crc_test_btree(hammer_node_ondisk_t ondisk); 1451 int hammer_crc_test_leaf(void *data, hammer_btree_leaf_elm_t leaf); 1452 void hkprintf(const char *ctl, ...) __printflike(1, 2); 1453 udev_t hammer_fsid_to_udev(uuid_t *uuid); 1454 1455 1456 int hammer_blocksize(int64_t file_offset); 1457 int hammer_blockoff(int64_t file_offset); 1458 int64_t hammer_blockdemarc(int64_t file_offset1, int64_t file_offset2); 1459 1460 /* 1461 * Shortcut for _hammer_checkspace(), used all over the code. 1462 */ 1463 static __inline int 1464 hammer_checkspace(hammer_mount_t hmp, int slop) 1465 { 1466 return(_hammer_checkspace(hmp, slop, NULL)); 1467 } 1468 1469 #endif 1470 1471 static __inline void 1472 hammer_wait_mem_record(hammer_record_t record) 1473 { 1474 hammer_wait_mem_record_ident(record, "hmmwai"); 1475 } 1476 1477 static __inline void 1478 hammer_lock_ex(struct hammer_lock *lock) 1479 { 1480 hammer_lock_ex_ident(lock, "hmrlck"); 1481 } 1482 1483 /* 1484 * Indicate that a B-Tree node is being modified. 1485 */ 1486 static __inline void 1487 hammer_modify_node_noundo(hammer_transaction_t trans, hammer_node_t node) 1488 { 1489 KKASSERT((node->flags & HAMMER_NODE_CRCBAD) == 0); 1490 hammer_modify_buffer(trans, node->buffer, NULL, 0); 1491 } 1492 1493 static __inline void 1494 hammer_modify_node_all(hammer_transaction_t trans, struct hammer_node *node) 1495 { 1496 KKASSERT((node->flags & HAMMER_NODE_CRCBAD) == 0); 1497 hammer_modify_buffer(trans, node->buffer, 1498 node->ondisk, sizeof(*node->ondisk)); 1499 } 1500 1501 static __inline void 1502 hammer_modify_node(hammer_transaction_t trans, hammer_node_t node, 1503 void *base, int len) 1504 { 1505 hammer_crc_t *crcptr; 1506 1507 KKASSERT((char *)base >= (char *)node->ondisk && 1508 (char *)base + len <= 1509 (char *)node->ondisk + sizeof(*node->ondisk)); 1510 KKASSERT((node->flags & HAMMER_NODE_CRCBAD) == 0); 1511 hammer_modify_buffer(trans, node->buffer, base, len); 1512 crcptr = &node->ondisk->crc; 1513 hammer_modify_buffer(trans, node->buffer, crcptr, sizeof(hammer_crc_t)); 1514 --node->buffer->io.modify_refs; /* only want one ref */ 1515 } 1516 1517 /* 1518 * Indicate that the specified modifications have been completed. 1519 * 1520 * Do not try to generate the crc here, it's very expensive to do and a 1521 * sequence of insertions or deletions can result in many calls to this 1522 * function on the same node. 1523 */ 1524 static __inline void 1525 hammer_modify_node_done(hammer_node_t node) 1526 { 1527 node->flags |= HAMMER_NODE_CRCGOOD; 1528 if ((node->flags & HAMMER_NODE_NEEDSCRC) == 0) { 1529 node->flags |= HAMMER_NODE_NEEDSCRC; 1530 node->buffer->io.gencrc = 1; 1531 hammer_ref_node(node); 1532 } 1533 hammer_modify_buffer_done(node->buffer); 1534 } 1535 1536 #define hammer_modify_volume_field(trans, vol, field) \ 1537 hammer_modify_volume(trans, vol, &(vol)->ondisk->field, \ 1538 sizeof((vol)->ondisk->field)) 1539 1540 #define hammer_modify_node_field(trans, node, field) \ 1541 hammer_modify_node(trans, node, &(node)->ondisk->field, \ 1542 sizeof((node)->ondisk->field)) 1543 1544 /* 1545 * The HAMMER_INODE_CAP_DIR_LOCAL_INO capability is set on newly 1546 * created directories for HAMMER version 2 or greater and causes 1547 * directory entries to be placed the inode localization zone in 1548 * the B-Tree instead of the misc zone. 1549 * 1550 * This greatly improves localization between directory entries and 1551 * inodes 1552 */ 1553 static __inline u_int32_t 1554 hammer_dir_localization(hammer_inode_t dip) 1555 { 1556 if (dip->ino_data.cap_flags & HAMMER_INODE_CAP_DIR_LOCAL_INO) 1557 return(HAMMER_LOCALIZE_INODE); 1558 else 1559 return(HAMMER_LOCALIZE_MISC); 1560 } 1561