Merge branch 'master' of ssh://crater.dragonflybsd.org/repository/git/dragonfly into...
[dragonfly.git] / sys / vfs / hammer / hammer.h
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/stat.h>
53 #include <sys/globaldata.h>
54 #include <sys/lockf.h>
55 #include <sys/buf.h>
56 #include <sys/queue.h>
57 #include <sys/ktr.h>
58 #include <sys/globaldata.h>
59
60 #include <sys/buf2.h>
61 #include <sys/signal2.h>
62 #include "hammer_disk.h"
63 #include "hammer_mount.h"
64 #include "hammer_ioctl.h"
65
66 #if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
67
68 MALLOC_DECLARE(M_HAMMER);
69
70 /*
71  * Kernel trace
72  */
73 #if !defined(KTR_HAMMER)
74 #define KTR_HAMMER      KTR_ALL
75 #endif
76 KTR_INFO_MASTER_EXTERN(hammer);
77
78 /*
79  * Misc structures
80  */
81 struct hammer_mount;
82
83 /*
84  * Key structure used for custom RB tree inode lookups.  This prototypes
85  * the function hammer_ino_rb_tree_RB_LOOKUP_INFO(root, info).
86  */
87 typedef struct hammer_inode_info {
88         int64_t         obj_id;         /* (key) object identifier */
89         hammer_tid_t    obj_asof;       /* (key) snapshot transid or 0 */
90         u_int32_t       obj_localization; /* (key) pseudo-fs */
91         union {
92                 struct hammer_btree_leaf_elm *leaf;
93         } u;
94 } *hammer_inode_info_t;
95
96 typedef enum hammer_transaction_type {
97         HAMMER_TRANS_RO,
98         HAMMER_TRANS_STD,
99         HAMMER_TRANS_FLS
100 } hammer_transaction_type_t;
101
102 /*
103  * HAMMER Transaction tracking
104  */
105 struct hammer_transaction {
106         hammer_transaction_type_t type;
107         struct hammer_mount *hmp;
108         hammer_tid_t    tid;
109         u_int64_t       time;
110         u_int32_t       time32;
111         int             sync_lock_refs;
112         int             flags;
113         struct hammer_volume *rootvol;
114 };
115
116 typedef struct hammer_transaction *hammer_transaction_t;
117
118 #define HAMMER_TRANSF_NEWINODE  0x0001
119 #define HAMMER_TRANSF_DIDIO     0x0002
120
121 /*
122  * HAMMER locks
123  */
124 struct hammer_lock {
125         int     refs;           /* active references delay writes */
126         int     lockcount;      /* lock count for exclusive/shared access */
127         int     wanted;
128         int     exwanted;       /* number of threads waiting for ex lock */
129         struct thread *locktd;
130 };
131
132 static __inline int
133 hammer_islocked(struct hammer_lock *lock)
134 {
135         return(lock->lockcount != 0);
136 }
137
138 static __inline int
139 hammer_isactive(struct hammer_lock *lock)
140 {
141         return(lock->refs != 0);
142 }
143
144 static __inline int
145 hammer_islastref(struct hammer_lock *lock)
146 {
147         return(lock->refs == 1);
148 }
149
150 /*
151  * Return if we specifically own the lock exclusively.
152  */
153 static __inline int
154 hammer_lock_excl_owned(struct hammer_lock *lock, thread_t td)
155 {
156         if (lock->lockcount > 0 && lock->locktd == td)
157                 return(1);
158         return(0);
159 }
160
161 /*
162  * Flush state, used by various structures
163  */
164 typedef enum hammer_inode_state {
165         HAMMER_FST_IDLE,
166         HAMMER_FST_SETUP,
167         HAMMER_FST_FLUSH
168 } hammer_inode_state_t;
169
170 TAILQ_HEAD(hammer_record_list, hammer_record);
171
172 /*
173  * Pseudo-filesystem extended data tracking
174  */
175 struct hammer_pfs_rb_tree;
176 struct hammer_pseudofs_inmem;
177 RB_HEAD(hammer_pfs_rb_tree, hammer_pseudofs_inmem);
178 RB_PROTOTYPE2(hammer_pfs_rb_tree, hammer_pseudofs_inmem, rb_node,
179               hammer_pfs_rb_compare, u_int32_t);
180
181 struct hammer_pseudofs_inmem {
182         RB_ENTRY(hammer_pseudofs_inmem) rb_node;
183         struct hammer_lock      lock;
184         u_int32_t               localization;
185         hammer_tid_t            create_tid;
186         int                     flags;
187         udev_t                  fsid_udev;
188         struct hammer_pseudofs_data pfsd;
189 };
190
191 typedef struct hammer_pseudofs_inmem *hammer_pseudofs_inmem_t;
192
193 #define HAMMER_PFSM_DELETED     0x0001
194
195 /*
196  * Cache object ids.  A fixed number of objid cache structures are
197  * created to reserve object id's for newly created files in multiples
198  * of 100,000, localized to a particular directory, and recycled as
199  * needed.  This allows parallel create operations in different
200  * directories to retain fairly localized object ids which in turn
201  * improves reblocking performance and layout.
202  */
203 #define OBJID_CACHE_SIZE        1024
204 #define OBJID_CACHE_BULK        100000
205
206 typedef struct hammer_objid_cache {
207         TAILQ_ENTRY(hammer_objid_cache) entry;
208         struct hammer_inode             *dip;
209         hammer_tid_t                    next_tid;
210         int                             count;
211 } *hammer_objid_cache_t;
212
213 /*
214  * Associate an inode with a B-Tree node to cache search start positions
215  */
216 typedef struct hammer_node_cache {
217         TAILQ_ENTRY(hammer_node_cache)  entry;
218         struct hammer_node              *node;
219         struct hammer_inode             *ip;
220 } *hammer_node_cache_t;
221
222 TAILQ_HEAD(hammer_node_cache_list, hammer_node_cache);
223
224 /*
225  * Structure used to organize flush groups.  Flush groups must be
226  * organized into chunks in order to avoid blowing out the UNDO FIFO.
227  * Without this a 'sync' could end up flushing 50,000 inodes in a single
228  * transaction.
229  */
230 struct hammer_flush_group {
231         TAILQ_ENTRY(hammer_flush_group) flush_entry;
232         TAILQ_HEAD(, hammer_inode)      flush_list;
233         int                             inode_count;    /* inode load */
234         int                             total_count;    /* record load */
235         int                             running;        /* group is running */
236         int                             closed;
237         int                             refs;
238 };
239
240 typedef struct hammer_flush_group *hammer_flush_group_t;
241
242 TAILQ_HEAD(hammer_flush_group_list, hammer_flush_group);
243
244 /*
245  * Structure used to represent an inode in-memory.
246  *
247  * The record and data associated with an inode may be out of sync with
248  * the disk (xDIRTY flags), or not even on the disk at all (ONDISK flag
249  * clear).
250  *
251  * An inode may also hold a cache of unsynchronized records, used for
252  * database and directories only.  Unsynchronized regular file data is
253  * stored in the buffer cache.
254  *
255  * NOTE: A file which is created and destroyed within the initial
256  * synchronization period can wind up not doing any disk I/O at all.
257  *
258  * Finally, an inode may cache numerous disk-referencing B-Tree cursors.
259  */
260 struct hammer_ino_rb_tree;
261 struct hammer_inode;
262 RB_HEAD(hammer_ino_rb_tree, hammer_inode);
263 RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,
264               hammer_ino_rb_compare, hammer_inode_info_t);
265
266 struct hammer_rec_rb_tree;
267 struct hammer_record;
268 RB_HEAD(hammer_rec_rb_tree, hammer_record);
269 RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node,
270               hammer_rec_rb_compare, hammer_btree_leaf_elm_t);
271
272 TAILQ_HEAD(hammer_node_list, hammer_node);
273
274 struct hammer_inode {
275         RB_ENTRY(hammer_inode)  rb_node;
276         hammer_inode_state_t    flush_state;
277         hammer_flush_group_t    flush_group;
278         TAILQ_ENTRY(hammer_inode) flush_entry;
279         struct hammer_record_list target_list;  /* target of dependant recs */
280         int64_t                 obj_id;         /* (key) object identifier */
281         hammer_tid_t            obj_asof;       /* (key) snapshot or 0 */
282         u_int32_t               obj_localization; /* (key) pseudo-fs */
283         struct hammer_mount     *hmp;
284         hammer_objid_cache_t    objid_cache;
285         int                     flags;
286         int                     error;          /* flush error */
287         int                     cursor_ip_refs; /* sanity */
288         int                     rsv_recs;
289         struct vnode            *vp;
290         hammer_pseudofs_inmem_t pfsm;
291         struct lockf            advlock;
292         struct hammer_lock      lock;           /* sync copy interlock */
293         off_t                   trunc_off;
294         struct hammer_btree_leaf_elm ino_leaf;  /* in-memory cache */
295         struct hammer_inode_data ino_data;      /* in-memory cache */
296         struct hammer_rec_rb_tree rec_tree;     /* in-memory cache */
297         struct hammer_node_cache cache[2];      /* search initiate cache */
298
299         /*
300          * When a demark is created to synchronize an inode to
301          * disk, certain fields are copied so the front-end VOPs
302          * can continue to run in parallel with the synchronization
303          * occuring in the background.
304          */
305         int             sync_flags;             /* to-sync flags cache */
306         off_t           sync_trunc_off;         /* to-sync truncation */
307         off_t           save_trunc_off;         /* write optimization */
308         struct hammer_btree_leaf_elm sync_ino_leaf; /* to-sync cache */
309         struct hammer_inode_data sync_ino_data; /* to-sync cache */
310 };
311
312 typedef struct hammer_inode *hammer_inode_t;
313
314 #define VTOI(vp)        ((struct hammer_inode *)(vp)->v_data)
315
316 #define HAMMER_INODE_DDIRTY     0x0001  /* in-memory ino_data is dirty */
317                                         /* (not including atime/mtime) */
318 #define HAMMER_INODE_RSV_INODES 0x0002  /* hmp->rsv_inodes bumped */
319 #define HAMMER_INODE_CONN_DOWN  0x0004  /* include in downward recursion */
320 #define HAMMER_INODE_XDIRTY     0x0008  /* in-memory records */
321 #define HAMMER_INODE_ONDISK     0x0010  /* inode is on-disk (else not yet) */
322 #define HAMMER_INODE_FLUSH      0x0020  /* flush on last ref */
323 #define HAMMER_INODE_DELETED    0x0080  /* inode delete (backend) */
324 #define HAMMER_INODE_DELONDISK  0x0100  /* delete synchronized to disk */
325 #define HAMMER_INODE_RO         0x0200  /* read-only (because of as-of) */
326 #define HAMMER_INODE_VHELD      0x0400  /* vnode held on sync */
327 #define HAMMER_INODE_DONDISK    0x0800  /* data records may be on disk */
328 #define HAMMER_INODE_BUFS       0x1000  /* dirty high level bps present */
329 #define HAMMER_INODE_REFLUSH    0x2000  /* flush on dependancy / reflush */
330 #define HAMMER_INODE_RECLAIM    0x4000  /* trying to reclaim */
331 #define HAMMER_INODE_FLUSHW     0x8000  /* Someone waiting for flush */
332
333 #define HAMMER_INODE_TRUNCATED  0x00010000
334 #define HAMMER_INODE_DELETING   0x00020000 /* inode delete request (frontend)*/
335 #define HAMMER_INODE_RESIGNAL   0x00040000 /* re-signal on re-flush */
336 #define HAMMER_INODE_ATIME      0x00100000 /* in-memory atime modified */
337 #define HAMMER_INODE_MTIME      0x00200000 /* in-memory mtime modified */
338 #define HAMMER_INODE_WOULDBLOCK 0x00400000 /* re-issue to new flush group */
339
340 #define HAMMER_INODE_MODMASK    (HAMMER_INODE_DDIRTY|                       \
341                                  HAMMER_INODE_XDIRTY|HAMMER_INODE_BUFS|     \
342                                  HAMMER_INODE_ATIME|HAMMER_INODE_MTIME|     \
343                                  HAMMER_INODE_TRUNCATED|HAMMER_INODE_DELETING)
344
345 #define HAMMER_INODE_MODMASK_NOXDIRTY \
346                                 (HAMMER_INODE_MODMASK & ~HAMMER_INODE_XDIRTY)
347
348 #define HAMMER_FLUSH_GROUP_SIZE 64
349
350 #define HAMMER_FLUSH_SIGNAL     0x0001
351 #define HAMMER_FLUSH_RECURSION  0x0002
352
353 /*
354  * Used by the inode reclaim code to pipeline reclaims and avoid
355  * blowing out kernel memory or letting the flusher get too far
356  * behind.  The reclaim wakes up when count reaches 0 or the
357  * timer expires.
358  */
359 struct hammer_reclaim {
360         TAILQ_ENTRY(hammer_reclaim) entry;
361         int     count;
362 };
363
364 #define HAMMER_RECLAIM_FLUSH    2000
365 #define HAMMER_RECLAIM_WAIT     4000
366
367 /*
368  * Structure used to represent an unsynchronized record in-memory.  These
369  * records typically represent directory entries.  Only non-historical
370  * records are kept in-memory.
371  *
372  * Records are organized as a per-inode RB-Tree.  If the inode is not
373  * on disk then neither are any records and the in-memory record tree
374  * represents the entire contents of the inode.  If the inode is on disk
375  * then the on-disk B-Tree is scanned in parallel with the in-memory
376  * RB-Tree to synthesize the current state of the file.
377  *
378  * Records are also used to enforce the ordering of directory create/delete
379  * operations.  A new inode will not be flushed to disk unless its related
380  * directory entry is also being flushed at the same time.  A directory entry
381  * will not be removed unless its related inode is also being removed at the
382  * same time.
383  */
384 typedef enum hammer_record_type {
385         HAMMER_MEM_RECORD_GENERAL,      /* misc record */
386         HAMMER_MEM_RECORD_INODE,        /* inode record */
387         HAMMER_MEM_RECORD_ADD,          /* positive memory cache record */
388         HAMMER_MEM_RECORD_DEL,          /* negative delete-on-disk record */
389         HAMMER_MEM_RECORD_DATA          /* bulk-data record w/on-disk ref */
390 } hammer_record_type_t;
391
392 struct hammer_record {
393         RB_ENTRY(hammer_record)         rb_node;
394         TAILQ_ENTRY(hammer_record)      target_entry;
395         hammer_inode_state_t            flush_state;
396         hammer_flush_group_t            flush_group;
397         hammer_record_type_t            type;
398         struct hammer_lock              lock;
399         struct hammer_reserve           *resv;
400         struct hammer_inode             *ip;
401         struct hammer_inode             *target_ip;
402         struct hammer_btree_leaf_elm    leaf;
403         union hammer_data_ondisk        *data;
404         int                             flags;
405         hammer_off_t                    zone2_offset;   /* direct-write only */
406 };
407
408 typedef struct hammer_record *hammer_record_t;
409
410 /*
411  * Record flags.  Note that FE can only be set by the frontend if the
412  * record has not been interlocked by the backend w/ BE.
413  */
414 #define HAMMER_RECF_ALLOCDATA           0x0001
415 #define HAMMER_RECF_ONRBTREE            0x0002
416 #define HAMMER_RECF_DELETED_FE          0x0004  /* deleted (frontend) */
417 #define HAMMER_RECF_DELETED_BE          0x0008  /* deleted (backend) */
418 #define HAMMER_RECF_COMMITTED           0x0010  /* committed to the B-Tree */
419 #define HAMMER_RECF_INTERLOCK_BE        0x0020  /* backend interlock */
420 #define HAMMER_RECF_WANTED              0x0040  /* wanted by the frontend */
421 #define HAMMER_RECF_CONVERT_DELETE      0x0100  /* special case */
422 #define HAMMER_RECF_DIRECT_IO           0x0200  /* related direct I/O running*/
423 #define HAMMER_RECF_DIRECT_WAIT         0x0400  /* related direct I/O running*/
424 #define HAMMER_RECF_DIRECT_INVAL        0x0800  /* buffer alias invalidation */
425
426 /*
427  * hammer_delete_at_cursor() flags
428  */
429 #define HAMMER_DELETE_ADJUST            0x0001
430 #define HAMMER_DELETE_DESTROY           0x0002
431
432 /*
433  * In-memory structures representing on-disk structures.
434  */
435 struct hammer_volume;
436 struct hammer_buffer;
437 struct hammer_node;
438 struct hammer_undo;
439 struct hammer_reserve;
440
441 RB_HEAD(hammer_vol_rb_tree, hammer_volume);
442 RB_HEAD(hammer_buf_rb_tree, hammer_buffer);
443 RB_HEAD(hammer_nod_rb_tree, hammer_node);
444 RB_HEAD(hammer_und_rb_tree, hammer_undo);
445 RB_HEAD(hammer_res_rb_tree, hammer_reserve);
446
447 RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node,
448               hammer_vol_rb_compare, int32_t);
449 RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node,
450               hammer_buf_rb_compare, hammer_off_t);
451 RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node,
452               hammer_nod_rb_compare, hammer_off_t);
453 RB_PROTOTYPE2(hammer_und_rb_tree, hammer_undo, rb_node,
454               hammer_und_rb_compare, hammer_off_t);
455 RB_PROTOTYPE2(hammer_res_rb_tree, hammer_reserve, rb_node,
456               hammer_res_rb_compare, hammer_off_t);
457
458 /*
459  * IO management - embedded at the head of various in-memory structures
460  *
461  * VOLUME       - hammer_volume containing meta-data
462  * META_BUFFER  - hammer_buffer containing meta-data
463  * DATA_BUFFER  - hammer_buffer containing pure-data
464  *
465  * Dirty volume headers and dirty meta-data buffers are locked until the
466  * flusher can sequence them out.  Dirty pure-data buffers can be written.
467  * Clean buffers can be passively released.
468  */
469 typedef enum hammer_io_type {
470         HAMMER_STRUCTURE_VOLUME,
471         HAMMER_STRUCTURE_META_BUFFER,
472         HAMMER_STRUCTURE_UNDO_BUFFER,
473         HAMMER_STRUCTURE_DATA_BUFFER
474 } hammer_io_type_t;
475
476 union hammer_io_structure;
477 struct hammer_io;
478
479 struct worklist {
480         LIST_ENTRY(worklist) node;
481 };
482
483 TAILQ_HEAD(hammer_io_list, hammer_io);
484 typedef struct hammer_io_list *hammer_io_list_t;
485
486 struct hammer_io {
487         struct worklist         worklist;
488         struct hammer_lock      lock;
489         enum hammer_io_type     type;
490         struct hammer_mount     *hmp;
491         struct hammer_volume    *volume;
492         TAILQ_ENTRY(hammer_io)  mod_entry; /* list entry if modified */
493         hammer_io_list_t        mod_list;
494         struct buf              *bp;
495         int64_t                 offset;    /* zone-2 offset */
496         int                     bytes;     /* buffer cache buffer size */
497         int                     loading;   /* loading/unloading interlock */
498         int                     modify_refs;
499
500         u_int           modified : 1;   /* bp's data was modified */
501         u_int           released : 1;   /* bp released (w/ B_LOCKED set) */
502         u_int           running : 1;    /* bp write IO in progress */
503         u_int           waiting : 1;    /* someone is waiting on us */
504         u_int           validated : 1;  /* ondisk has been validated */
505         u_int           waitdep : 1;    /* flush waits for dependancies */
506         u_int           recovered : 1;  /* has recovery ref */
507         u_int           waitmod : 1;    /* waiting for modify_refs */
508         u_int           reclaim : 1;    /* reclaim requested */
509         u_int           gencrc : 1;     /* crc needs to be generated */
510         u_int           ioerror : 1;    /* abort on io-error */
511 };
512
513 typedef struct hammer_io *hammer_io_t;
514
515 #define HAMMER_CLUSTER_SIZE     (64 * 1024)
516 #if HAMMER_CLUSTER_SIZE > MAXBSIZE
517 #undef  HAMMER_CLUSTER_SIZE
518 #define HAMMER_CLUSTER_SIZE     MAXBSIZE
519 #endif
520 #define HAMMER_CLUSTER_BUFS     (HAMMER_CLUSTER_SIZE / HAMMER_BUFSIZE)
521
522 /*
523  * In-memory volume representing on-disk buffer
524  */
525 struct hammer_volume {
526         struct hammer_io io;
527         RB_ENTRY(hammer_volume) rb_node;
528         struct hammer_volume_ondisk *ondisk;
529         int32_t vol_no;
530         int64_t nblocks;        /* note: special calculation for statfs */
531         int64_t buffer_base;    /* base offset of buffer 0 */
532         hammer_off_t maxbuf_off; /* Maximum buffer offset (zone-2) */
533         hammer_off_t maxraw_off; /* Maximum raw offset for device */
534         char    *vol_name;
535         struct vnode *devvp;
536         int     vol_flags;
537 };
538
539 typedef struct hammer_volume *hammer_volume_t;
540
541 /*
542  * In-memory buffer (other then volume, super-cluster, or cluster),
543  * representing an on-disk buffer.
544  */
545 struct hammer_buffer {
546         struct hammer_io io;
547         RB_ENTRY(hammer_buffer) rb_node;
548         void *ondisk;
549         hammer_off_t zoneX_offset;
550         hammer_off_t zone2_offset;
551         struct hammer_reserve *resv;
552         struct hammer_node_list clist;
553 };
554
555 typedef struct hammer_buffer *hammer_buffer_t;
556
557 /*
558  * In-memory B-Tree node, representing an on-disk B-Tree node.
559  *
560  * This is a hang-on structure which is backed by a hammer_buffer,
561  * indexed by a hammer_cluster, and used for fine-grained locking of
562  * B-Tree nodes in order to properly control lock ordering.  A hammer_buffer
563  * can contain multiple nodes representing wildly disassociated portions
564  * of the B-Tree so locking cannot be done on a buffer-by-buffer basis.
565  *
566  * This structure uses a cluster-relative index to reduce the number
567  * of layers required to access it, and also because all on-disk B-Tree
568  * references are cluster-relative offsets.
569  */
570 struct hammer_node {
571         struct hammer_lock      lock;           /* node-by-node lock */
572         TAILQ_ENTRY(hammer_node) entry;         /* per-buffer linkage */
573         RB_ENTRY(hammer_node)   rb_node;        /* per-cluster linkage */
574         hammer_off_t            node_offset;    /* full offset spec */
575         struct hammer_mount     *hmp;
576         struct hammer_buffer    *buffer;        /* backing buffer */
577         hammer_node_ondisk_t    ondisk;         /* ptr to on-disk structure */
578         TAILQ_HEAD(, hammer_cursor) cursor_list;  /* deadlock recovery */
579         struct hammer_node_cache_list cache_list; /* passive caches */
580         int                     flags;
581         int                     loading;        /* load interlock */
582 };
583
584 #define HAMMER_NODE_DELETED     0x0001
585 #define HAMMER_NODE_FLUSH       0x0002
586 #define HAMMER_NODE_CRCGOOD     0x0004
587 #define HAMMER_NODE_NEEDSCRC    0x0008
588 #define HAMMER_NODE_NEEDSMIRROR 0x0010
589
590 typedef struct hammer_node      *hammer_node_t;
591
592 /*
593  * List of locked nodes.
594  */
595 struct hammer_node_locklist {
596         struct hammer_node_locklist *next;
597         hammer_node_t   node;
598 };
599
600 typedef struct hammer_node_locklist *hammer_node_locklist_t;
601
602
603 /*
604  * Common I/O management structure - embedded in in-memory structures
605  * which are backed by filesystem buffers.
606  */
607 union hammer_io_structure {
608         struct hammer_io        io;
609         struct hammer_volume    volume;
610         struct hammer_buffer    buffer;
611 };
612
613 typedef union hammer_io_structure *hammer_io_structure_t;
614
615 /*
616  * The reserve structure prevents the blockmap from allocating
617  * out of a reserved bigblock.  Such reservations are used by
618  * the direct-write mechanism.
619  *
620  * The structure is also used to hold off on reallocations of
621  * big blocks from the freemap until flush dependancies have
622  * been dealt with.
623  */
624 struct hammer_reserve {
625         RB_ENTRY(hammer_reserve) rb_node;
626         TAILQ_ENTRY(hammer_reserve) delay_entry;
627         int             flush_group;
628         int             flags;
629         int             refs;
630         int             zone;
631         int             append_off;
632         hammer_off_t    zone_offset;
633 };
634
635 typedef struct hammer_reserve *hammer_reserve_t;
636
637 #define HAMMER_RESF_ONDELAY     0x0001
638 #define HAMMER_RESF_LAYER2FREE  0x0002
639
640 #include "hammer_cursor.h"
641
642 /*
643  * The undo structure tracks recent undos to avoid laying down duplicate
644  * undos within a flush group, saving us a significant amount of overhead.
645  *
646  * This is strictly a heuristic.
647  */
648 #define HAMMER_MAX_UNDOS                1024
649 #define HAMMER_MAX_FLUSHERS             4
650
651 struct hammer_undo {
652         RB_ENTRY(hammer_undo)   rb_node;
653         TAILQ_ENTRY(hammer_undo) lru_entry;
654         hammer_off_t            offset;
655         int                     bytes;
656 };
657
658 typedef struct hammer_undo *hammer_undo_t;
659
660 struct hammer_flusher_info;
661 TAILQ_HEAD(hammer_flusher_info_list, hammer_flusher_info);
662
663 struct hammer_flusher {
664         int             signal;         /* flusher thread sequencer */
665         int             act;            /* currently active flush group */
666         int             done;           /* set to act when complete */
667         int             next;           /* next flush group */
668         int             group_lock;     /* lock sequencing of the next flush */
669         int             exiting;        /* request master exit */
670         thread_t        td;             /* master flusher thread */
671         hammer_tid_t    tid;            /* last flushed transaction id */
672         int             finalize_want;          /* serialize finalization */
673         struct hammer_lock finalize_lock;       /* serialize finalization */
674         struct hammer_transaction trans;        /* shared transaction */
675         struct hammer_flusher_info_list run_list;
676         struct hammer_flusher_info_list ready_list;
677 };
678
679 /*
680  * Internal hammer mount data structure
681  */
682 struct hammer_mount {
683         struct mount *mp;
684         /*struct vnode *rootvp;*/
685         struct hammer_ino_rb_tree rb_inos_root;
686         struct hammer_vol_rb_tree rb_vols_root;
687         struct hammer_nod_rb_tree rb_nods_root;
688         struct hammer_und_rb_tree rb_undo_root;
689         struct hammer_res_rb_tree rb_resv_root;
690         struct hammer_buf_rb_tree rb_bufs_root;
691         struct hammer_pfs_rb_tree rb_pfsm_root;
692         struct hammer_volume *rootvol;
693         struct hammer_base_elm root_btree_beg;
694         struct hammer_base_elm root_btree_end;
695
696         struct malloc_type      *m_misc;
697         struct malloc_type      *m_inodes;
698
699         int     flags;          /* HAMMER_MOUNT_xxx flags */
700         int     hflags;
701         int     ronly;
702         int     nvolumes;
703         int     volume_iterator;
704         int     master_id;      /* -1 or 0-15 - clustering and mirroring */
705         int     version;        /* hammer filesystem version to use */
706         int     rsv_inodes;     /* reserved space due to dirty inodes */
707         int64_t rsv_databytes;  /* reserved space due to record data */
708         int     rsv_recs;       /* reserved space due to dirty records */
709         int     rsv_fromdelay;  /* bigblocks reserved due to flush delay */
710         int     undo_rec_limit; /* based on size of undo area */
711         int     last_newrecords;
712         int     count_newrecords;
713
714         int     inode_reclaims; /* inodes pending reclaim by flusher */
715         int     count_inodes;   /* total number of inodes */
716         int     count_iqueued;  /* inodes queued to flusher */
717
718         struct hammer_flusher flusher;
719
720         u_int   check_interrupt;
721         uuid_t  fsid;
722         struct hammer_io_list volu_list;        /* dirty undo buffers */
723         struct hammer_io_list undo_list;        /* dirty undo buffers */
724         struct hammer_io_list data_list;        /* dirty data buffers */
725         struct hammer_io_list alt_data_list;    /* dirty data buffers */
726         struct hammer_io_list meta_list;        /* dirty meta bufs    */
727         struct hammer_io_list lose_list;        /* loose buffers      */
728         int     locked_dirty_space;             /* meta/volu count    */
729         int     io_running_space;
730         int     objid_cache_count;
731         int     error;                          /* critical I/O error */
732         struct krate    krate;                  /* rate limited kprintf */
733         hammer_tid_t    asof;                   /* snapshot mount */
734         hammer_tid_t    next_tid;
735         hammer_tid_t    flush_tid1;             /* flusher tid sequencing */
736         hammer_tid_t    flush_tid2;             /* flusher tid sequencing */
737         int64_t copy_stat_freebigblocks;        /* number of free bigblocks */
738
739         struct netexport export;
740         struct hammer_lock sync_lock;
741         struct hammer_lock free_lock;
742         struct hammer_lock undo_lock;
743         struct hammer_lock blkmap_lock;
744         struct hammer_blockmap  blockmap[HAMMER_MAX_ZONES];
745         struct hammer_undo      undos[HAMMER_MAX_UNDOS];
746         int                     undo_alloc;
747         TAILQ_HEAD(, hammer_undo)  undo_lru_list;
748         TAILQ_HEAD(, hammer_reserve) delay_list;
749         struct hammer_flush_group_list  flush_group_list;
750         hammer_flush_group_t    next_flush_group;
751         TAILQ_HEAD(, hammer_objid_cache) objid_cache_list;
752         TAILQ_HEAD(, hammer_reclaim) reclaim_list;
753 };
754
755 typedef struct hammer_mount     *hammer_mount_t;
756
757 #define HAMMER_MOUNT_CRITICAL_ERROR     0x0001
758 #define HAMMER_MOUNT_FLUSH_RECOVERY     0x0002
759
760 struct hammer_sync_info {
761         int error;
762         int waitfor;
763 };
764
765 #endif
766
767 /*
768  * checkspace slop (8MB chunks), higher numbers are more conservative.
769  */
770 #define HAMMER_CHKSPC_REBLOCK   25
771 #define HAMMER_CHKSPC_MIRROR    20
772 #define HAMMER_CHKSPC_WRITE     20
773 #define HAMMER_CHKSPC_CREATE    20
774 #define HAMMER_CHKSPC_REMOVE    10
775 #define HAMMER_CHKSPC_EMERGENCY 0
776
777 #if defined(_KERNEL)
778
779 extern struct vop_ops hammer_vnode_vops;
780 extern struct vop_ops hammer_spec_vops;
781 extern struct vop_ops hammer_fifo_vops;
782 extern struct bio_ops hammer_bioops;
783
784 extern int hammer_debug_io;
785 extern int hammer_debug_general;
786 extern int hammer_debug_debug;
787 extern int hammer_debug_inode;
788 extern int hammer_debug_locks;
789 extern int hammer_debug_btree;
790 extern int hammer_debug_tid;
791 extern int hammer_debug_recover;
792 extern int hammer_debug_recover_faults;
793 extern int hammer_cluster_enable;
794 extern int hammer_count_fsyncs;
795 extern int hammer_count_inodes;
796 extern int hammer_count_iqueued;
797 extern int hammer_count_reclaiming;
798 extern int hammer_count_records;
799 extern int hammer_count_record_datas;
800 extern int hammer_count_volumes;
801 extern int hammer_count_buffers;
802 extern int hammer_count_nodes;
803 extern int64_t hammer_count_extra_space_used;
804 extern int64_t hammer_stats_btree_lookups;
805 extern int64_t hammer_stats_btree_searches;
806 extern int64_t hammer_stats_btree_inserts;
807 extern int64_t hammer_stats_btree_deletes;
808 extern int64_t hammer_stats_btree_elements;
809 extern int64_t hammer_stats_btree_splits;
810 extern int64_t hammer_stats_btree_iterations;
811 extern int64_t hammer_stats_record_iterations;
812 extern int64_t hammer_stats_file_read;
813 extern int64_t hammer_stats_file_write;
814 extern int64_t hammer_stats_file_iopsr;
815 extern int64_t hammer_stats_file_iopsw;
816 extern int64_t hammer_stats_disk_read;
817 extern int64_t hammer_stats_disk_write;
818 extern int64_t hammer_stats_inode_flushes;
819 extern int64_t hammer_stats_commits;
820 extern int hammer_count_dirtybufspace;
821 extern int hammer_count_refedbufs;
822 extern int hammer_count_reservations;
823 extern int hammer_count_io_running_read;
824 extern int hammer_count_io_running_write;
825 extern int hammer_count_io_locked;
826 extern int hammer_limit_dirtybufspace;
827 extern int hammer_limit_recs;
828 extern int hammer_bio_count;
829 extern int hammer_verify_zone;
830 extern int hammer_verify_data;
831 extern int hammer_write_mode;
832 extern int hammer_autoflush;
833 extern int64_t hammer_contention_count;
834
835 void    hammer_critical_error(hammer_mount_t hmp, hammer_inode_t ip,
836                         int error, const char *msg);
837 int     hammer_vop_inactive(struct vop_inactive_args *);
838 int     hammer_vop_reclaim(struct vop_reclaim_args *);
839 int     hammer_get_vnode(struct hammer_inode *ip, struct vnode **vpp);
840 struct hammer_inode *hammer_get_inode(hammer_transaction_t trans,
841                         hammer_inode_t dip, int64_t obj_id,
842                         hammer_tid_t asof, u_int32_t localization,
843                         int flags, int *errorp);
844 void    hammer_scan_inode_snapshots(hammer_mount_t hmp,
845                         hammer_inode_info_t iinfo,
846                         int (*callback)(hammer_inode_t ip, void *data),
847                         void *data);
848 void    hammer_put_inode(struct hammer_inode *ip);
849 void    hammer_put_inode_ref(struct hammer_inode *ip);
850 void    hammer_inode_waitreclaims(hammer_mount_t hmp);
851 void    hammer_inode_waithard(hammer_mount_t hmp);
852
853 int     hammer_unload_volume(hammer_volume_t volume, void *data __unused);
854 int     hammer_adjust_volume_mode(hammer_volume_t volume, void *data __unused);
855
856 int     hammer_unload_buffer(hammer_buffer_t buffer, void *data __unused);
857 int     hammer_install_volume(hammer_mount_t hmp, const char *volname,
858                         struct vnode *devvp);
859 int     hammer_mountcheck_volumes(hammer_mount_t hmp);
860
861 int     hammer_mem_add(hammer_record_t record);
862 int     hammer_ip_lookup(hammer_cursor_t cursor);
863 int     hammer_ip_first(hammer_cursor_t cursor);
864 int     hammer_ip_next(hammer_cursor_t cursor);
865 int     hammer_ip_resolve_data(hammer_cursor_t cursor);
866 int     hammer_ip_delete_record(hammer_cursor_t cursor, hammer_inode_t ip,
867                         hammer_tid_t tid);
868 int     hammer_delete_at_cursor(hammer_cursor_t cursor, int delete_flags,
869                         hammer_tid_t delete_tid, u_int32_t delete_ts,
870                         int track, int64_t *stat_bytes);
871 int     hammer_ip_check_directory_empty(hammer_transaction_t trans,
872                         hammer_inode_t ip);
873 int     hammer_sync_hmp(hammer_mount_t hmp, int waitfor);
874 int     hammer_queue_inodes_flusher(hammer_mount_t hmp, int waitfor);
875
876 hammer_record_t
877         hammer_alloc_mem_record(hammer_inode_t ip, int data_len);
878 void    hammer_flush_record_done(hammer_record_t record, int error);
879 void    hammer_wait_mem_record_ident(hammer_record_t record, const char *ident);
880 void    hammer_rel_mem_record(hammer_record_t record);
881
882 int     hammer_cursor_up(hammer_cursor_t cursor);
883 int     hammer_cursor_up_locked(hammer_cursor_t cursor);
884 int     hammer_cursor_down(hammer_cursor_t cursor);
885 int     hammer_cursor_upgrade(hammer_cursor_t cursor);
886 int     hammer_cursor_upgrade_node(hammer_cursor_t cursor);
887 void    hammer_cursor_downgrade(hammer_cursor_t cursor);
888 int     hammer_cursor_seek(hammer_cursor_t cursor, hammer_node_t node,
889                         int index);
890 void    hammer_lock_ex_ident(struct hammer_lock *lock, const char *ident);
891 int     hammer_lock_ex_try(struct hammer_lock *lock);
892 void    hammer_lock_sh(struct hammer_lock *lock);
893 int     hammer_lock_sh_try(struct hammer_lock *lock);
894 int     hammer_lock_upgrade(struct hammer_lock *lock);
895 void    hammer_lock_downgrade(struct hammer_lock *lock);
896 int     hammer_lock_status(struct hammer_lock *lock);
897 void    hammer_unlock(struct hammer_lock *lock);
898 void    hammer_ref(struct hammer_lock *lock);
899 void    hammer_unref(struct hammer_lock *lock);
900
901 void    hammer_sync_lock_ex(hammer_transaction_t trans);
902 void    hammer_sync_lock_sh(hammer_transaction_t trans);
903 int     hammer_sync_lock_sh_try(hammer_transaction_t trans);
904 void    hammer_sync_unlock(hammer_transaction_t trans);
905
906 u_int32_t hammer_to_unix_xid(uuid_t *uuid);
907 void hammer_guid_to_uuid(uuid_t *uuid, u_int32_t guid);
908 void    hammer_time_to_timespec(u_int64_t xtime, struct timespec *ts);
909 u_int64_t hammer_timespec_to_time(struct timespec *ts);
910 int     hammer_str_to_tid(const char *str, int *ispfsp,
911                         hammer_tid_t *tidp, u_int32_t *localizationp);
912 int     hammer_is_atatext(const char *name, int len);
913 hammer_tid_t hammer_alloc_objid(hammer_mount_t hmp, hammer_inode_t dip);
914 void hammer_clear_objid(hammer_inode_t dip);
915 void hammer_destroy_objid_cache(hammer_mount_t hmp);
916
917 int hammer_enter_undo_history(hammer_mount_t hmp, hammer_off_t offset,
918                         int bytes);
919 void hammer_clear_undo_history(hammer_mount_t hmp);
920 enum vtype hammer_get_vnode_type(u_int8_t obj_type);
921 int hammer_get_dtype(u_int8_t obj_type);
922 u_int8_t hammer_get_obj_type(enum vtype vtype);
923 int64_t hammer_directory_namekey(hammer_inode_t dip, const void *name, int len,
924                         u_int32_t *max_iterationsp);
925 int     hammer_nohistory(hammer_inode_t ip);
926
927 int     hammer_init_cursor(hammer_transaction_t trans, hammer_cursor_t cursor,
928                         hammer_node_cache_t cache, hammer_inode_t ip);
929 void    hammer_normalize_cursor(hammer_cursor_t cursor);
930 void    hammer_done_cursor(hammer_cursor_t cursor);
931 int     hammer_recover_cursor(hammer_cursor_t cursor);
932 void    hammer_unlock_cursor(hammer_cursor_t cursor, int also_ip);
933 int     hammer_lock_cursor(hammer_cursor_t cursor, int also_ip);
934 hammer_cursor_t hammer_push_cursor(hammer_cursor_t ocursor);
935 void    hammer_pop_cursor(hammer_cursor_t ocursor, hammer_cursor_t ncursor);
936
937 void    hammer_cursor_replaced_node(hammer_node_t onode, hammer_node_t nnode);
938 void    hammer_cursor_removed_node(hammer_node_t onode, hammer_node_t parent,
939                         int index);
940 void    hammer_cursor_split_node(hammer_node_t onode, hammer_node_t nnode,
941                         int index);
942 void    hammer_cursor_inserted_element(hammer_node_t node, int index);
943 void    hammer_cursor_deleted_element(hammer_node_t node, int index);
944
945 int     hammer_btree_lookup(hammer_cursor_t cursor);
946 int     hammer_btree_first(hammer_cursor_t cursor);
947 int     hammer_btree_last(hammer_cursor_t cursor);
948 int     hammer_btree_extract(hammer_cursor_t cursor, int flags);
949 int     hammer_btree_iterate(hammer_cursor_t cursor);
950 int     hammer_btree_iterate_reverse(hammer_cursor_t cursor);
951 int     hammer_btree_insert(hammer_cursor_t cursor,
952                             hammer_btree_leaf_elm_t elm, int *doprop);
953 int     hammer_btree_delete(hammer_cursor_t cursor);
954 void    hammer_btree_do_propagation(hammer_cursor_t cursor,
955                             hammer_pseudofs_inmem_t pfsm,
956                             hammer_btree_leaf_elm_t leaf);
957 int     hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2);
958 int     hammer_btree_chkts(hammer_tid_t ts, hammer_base_elm_t key);
959 int     hammer_btree_correct_rhb(hammer_cursor_t cursor, hammer_tid_t tid);
960 int     hammer_btree_correct_lhb(hammer_cursor_t cursor, hammer_tid_t tid);
961
962 int     btree_set_parent(hammer_transaction_t trans, hammer_node_t node,
963                         hammer_btree_elm_t elm);
964 int     hammer_btree_lock_children(hammer_cursor_t cursor,
965                         struct hammer_node_locklist **locklistp);
966 void    hammer_btree_unlock_children(hammer_cursor_t cursor,
967                         struct hammer_node_locklist **locklistp);
968 int     hammer_btree_search_node(hammer_base_elm_t elm, hammer_node_ondisk_t node);
969 hammer_node_t hammer_btree_get_parent(hammer_transaction_t trans,
970                         hammer_node_t node, int *parent_indexp,
971                         int *errorp, int try_exclusive);
972
973 void    hammer_print_btree_node(hammer_node_ondisk_t ondisk);
974 void    hammer_print_btree_elm(hammer_btree_elm_t elm, u_int8_t type, int i);
975
976 void    *hammer_bread(struct hammer_mount *hmp, hammer_off_t off,
977                         int *errorp, struct hammer_buffer **bufferp);
978 void    *hammer_bnew(struct hammer_mount *hmp, hammer_off_t off,
979                         int *errorp, struct hammer_buffer **bufferp);
980 void    *hammer_bread_ext(struct hammer_mount *hmp, hammer_off_t off, int bytes,
981                         int *errorp, struct hammer_buffer **bufferp);
982 void    *hammer_bnew_ext(struct hammer_mount *hmp, hammer_off_t off, int bytes,
983                         int *errorp, struct hammer_buffer **bufferp);
984
985 hammer_volume_t hammer_get_root_volume(hammer_mount_t hmp, int *errorp);
986
987 hammer_volume_t hammer_get_volume(hammer_mount_t hmp,
988                         int32_t vol_no, int *errorp);
989 hammer_buffer_t hammer_get_buffer(hammer_mount_t hmp, hammer_off_t buf_offset,
990                         int bytes, int isnew, int *errorp);
991 void            hammer_sync_buffers(hammer_mount_t hmp,
992                         hammer_off_t base_offset, int bytes);
993 void            hammer_del_buffers(hammer_mount_t hmp,
994                         hammer_off_t base_offset,
995                         hammer_off_t zone2_offset, int bytes);
996
997 int             hammer_ref_volume(hammer_volume_t volume);
998 int             hammer_ref_buffer(hammer_buffer_t buffer);
999 void            hammer_flush_buffer_nodes(hammer_buffer_t buffer);
1000
1001 void            hammer_rel_volume(hammer_volume_t volume, int flush);
1002 void            hammer_rel_buffer(hammer_buffer_t buffer, int flush);
1003
1004 int             hammer_vfs_export(struct mount *mp, int op,
1005                         const struct export_args *export);
1006 hammer_node_t   hammer_get_node(hammer_transaction_t trans,
1007                         hammer_off_t node_offset, int isnew, int *errorp);
1008 void            hammer_ref_node(hammer_node_t node);
1009 hammer_node_t   hammer_ref_node_safe(struct hammer_mount *hmp,
1010                         hammer_node_cache_t cache, int *errorp);
1011 void            hammer_rel_node(hammer_node_t node);
1012 void            hammer_delete_node(hammer_transaction_t trans,
1013                         hammer_node_t node);
1014 void            hammer_cache_node(hammer_node_cache_t cache,
1015                         hammer_node_t node);
1016 void            hammer_uncache_node(hammer_node_cache_t cache);
1017 void            hammer_flush_node(hammer_node_t node);
1018
1019 void hammer_dup_buffer(struct hammer_buffer **bufferp,
1020                         struct hammer_buffer *buffer);
1021 hammer_node_t hammer_alloc_btree(hammer_transaction_t trans, int *errorp);
1022 void *hammer_alloc_data(hammer_transaction_t trans, int32_t data_len,
1023                         u_int16_t rec_type, hammer_off_t *data_offsetp,
1024                         struct hammer_buffer **data_bufferp, int *errorp);
1025
1026 int hammer_generate_undo(hammer_transaction_t trans, hammer_io_t io,
1027                         hammer_off_t zone1_offset, void *base, int len);
1028
1029 void hammer_put_volume(struct hammer_volume *volume, int flush);
1030 void hammer_put_buffer(struct hammer_buffer *buffer, int flush);
1031
1032 hammer_off_t hammer_freemap_alloc(hammer_transaction_t trans,
1033                         hammer_off_t owner, int *errorp);
1034 void hammer_freemap_free(hammer_transaction_t trans, hammer_off_t phys_offset,
1035                         hammer_off_t owner, int *errorp);
1036 int hammer_checkspace(hammer_mount_t hmp, int slop);
1037 hammer_off_t hammer_blockmap_alloc(hammer_transaction_t trans, int zone,
1038                         int bytes, int *errorp);
1039 hammer_reserve_t hammer_blockmap_reserve(hammer_mount_t hmp, int zone,
1040                         int bytes, hammer_off_t *zone_offp, int *errorp);
1041 void hammer_blockmap_reserve_undo(hammer_mount_t hmp, hammer_reserve_t resv,
1042                         hammer_off_t zone_offset, int bytes);
1043 void hammer_blockmap_reserve_complete(hammer_mount_t hmp,
1044                         hammer_reserve_t resv);
1045 void hammer_reserve_clrdelay(hammer_mount_t hmp, hammer_reserve_t resv);
1046 void hammer_blockmap_free(hammer_transaction_t trans,
1047                         hammer_off_t bmap_off, int bytes);
1048 int hammer_blockmap_finalize(hammer_transaction_t trans,
1049                         hammer_reserve_t resv,
1050                         hammer_off_t bmap_off, int bytes);
1051 int hammer_blockmap_getfree(hammer_mount_t hmp, hammer_off_t bmap_off,
1052                         int *curp, int *errorp);
1053 hammer_off_t hammer_blockmap_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
1054                         int *errorp);
1055 hammer_off_t hammer_undo_lookup(hammer_mount_t hmp, hammer_off_t bmap_off,
1056                         int *errorp);
1057 int64_t hammer_undo_used(hammer_transaction_t trans);
1058 int64_t hammer_undo_space(hammer_transaction_t trans);
1059 int64_t hammer_undo_max(hammer_mount_t hmp);
1060
1061 void hammer_start_transaction(struct hammer_transaction *trans,
1062                               struct hammer_mount *hmp);
1063 void hammer_simple_transaction(struct hammer_transaction *trans,
1064                               struct hammer_mount *hmp);
1065 void hammer_start_transaction_fls(struct hammer_transaction *trans,
1066                                   struct hammer_mount *hmp);
1067 void hammer_done_transaction(struct hammer_transaction *trans);
1068
1069 void hammer_modify_inode(hammer_inode_t ip, int flags);
1070 void hammer_flush_inode(hammer_inode_t ip, int flags);
1071 void hammer_flush_inode_done(hammer_inode_t ip, int error);
1072 void hammer_wait_inode(hammer_inode_t ip);
1073
1074 int  hammer_create_inode(struct hammer_transaction *trans, struct vattr *vap,
1075                         struct ucred *cred, struct hammer_inode *dip,
1076                         hammer_pseudofs_inmem_t pfsm,
1077                         struct hammer_inode **ipp);
1078 void hammer_rel_inode(hammer_inode_t ip, int flush);
1079 int hammer_reload_inode(hammer_inode_t ip, void *arg __unused);
1080 int hammer_ino_rb_compare(hammer_inode_t ip1, hammer_inode_t ip2);
1081 int hammer_destroy_inode_callback(hammer_inode_t ip, void *data __unused);
1082
1083 int hammer_sync_inode(hammer_transaction_t trans, hammer_inode_t ip);
1084 void hammer_test_inode(hammer_inode_t dip);
1085 void hammer_inode_unloadable_check(hammer_inode_t ip, int getvp);
1086
1087 int  hammer_ip_add_directory(struct hammer_transaction *trans,
1088                         hammer_inode_t dip, const char *name, int bytes,
1089                         hammer_inode_t nip);
1090 int  hammer_ip_del_directory(struct hammer_transaction *trans,
1091                         hammer_cursor_t cursor, hammer_inode_t dip,
1092                         hammer_inode_t ip);
1093 hammer_record_t hammer_ip_add_bulk(hammer_inode_t ip, off_t file_offset,
1094                         void *data, int bytes, int *errorp);
1095 int  hammer_ip_frontend_trunc(struct hammer_inode *ip, off_t file_size);
1096 int  hammer_ip_add_record(struct hammer_transaction *trans,
1097                         hammer_record_t record);
1098 int  hammer_ip_delete_range(hammer_cursor_t cursor, hammer_inode_t ip,
1099                         int64_t ran_beg, int64_t ran_end, int truncating);
1100 int  hammer_ip_delete_clean(hammer_cursor_t cursor, hammer_inode_t ip,
1101                         int *countp);
1102 int  hammer_ip_sync_data(hammer_cursor_t cursor, hammer_inode_t ip,
1103                         int64_t offset, void *data, int bytes);
1104 int  hammer_ip_sync_record(hammer_transaction_t trans, hammer_record_t rec);
1105 int  hammer_ip_sync_record_cursor(hammer_cursor_t cursor, hammer_record_t rec);
1106 hammer_pseudofs_inmem_t  hammer_load_pseudofs(hammer_transaction_t trans,
1107                         u_int32_t localization, int *errorp);
1108 int  hammer_mkroot_pseudofs(hammer_transaction_t trans, struct ucred *cred,
1109                         hammer_pseudofs_inmem_t pfsm);
1110 int  hammer_save_pseudofs(hammer_transaction_t trans,
1111                         hammer_pseudofs_inmem_t pfsm);
1112 int  hammer_unload_pseudofs(hammer_transaction_t trans, u_int32_t localization);
1113 void hammer_rel_pseudofs(hammer_mount_t hmp, hammer_pseudofs_inmem_t pfsm);
1114 int hammer_ioctl(hammer_inode_t ip, u_long com, caddr_t data, int fflag,
1115                         struct ucred *cred);
1116
1117 void hammer_io_init(hammer_io_t io, hammer_volume_t volume,
1118                         enum hammer_io_type type);
1119 int hammer_io_read(struct vnode *devvp, struct hammer_io *io,
1120                         hammer_off_t limit);
1121 int hammer_io_new(struct vnode *devvp, struct hammer_io *io);
1122 void hammer_io_inval(hammer_volume_t volume, hammer_off_t zone2_offset);
1123 struct buf *hammer_io_release(struct hammer_io *io, int flush);
1124 void hammer_io_flush(struct hammer_io *io);
1125 void hammer_io_wait(struct hammer_io *io);
1126 void hammer_io_waitdep(struct hammer_io *io);
1127 void hammer_io_wait_all(hammer_mount_t hmp, const char *ident);
1128 int hammer_io_direct_read(hammer_mount_t hmp, struct bio *bio,
1129                         hammer_btree_leaf_elm_t leaf);
1130 int hammer_io_direct_write(hammer_mount_t hmp, hammer_record_t record,
1131                         struct bio *bio);
1132 void hammer_io_direct_wait(hammer_record_t record);
1133 void hammer_io_direct_uncache(hammer_mount_t hmp, hammer_btree_leaf_elm_t leaf);
1134 void hammer_io_write_interlock(hammer_io_t io);
1135 void hammer_io_done_interlock(hammer_io_t io);
1136 void hammer_io_clear_modify(struct hammer_io *io, int inval);
1137 void hammer_io_clear_modlist(struct hammer_io *io);
1138 void hammer_io_flush_sync(hammer_mount_t hmp);
1139
1140 void hammer_modify_volume(hammer_transaction_t trans, hammer_volume_t volume,
1141                         void *base, int len);
1142 void hammer_modify_buffer(hammer_transaction_t trans, hammer_buffer_t buffer,
1143                         void *base, int len);
1144 void hammer_modify_volume_done(hammer_volume_t volume);
1145 void hammer_modify_buffer_done(hammer_buffer_t buffer);
1146
1147 int hammer_ioc_reblock(hammer_transaction_t trans, hammer_inode_t ip,
1148                         struct hammer_ioc_reblock *reblock);
1149 int hammer_ioc_prune(hammer_transaction_t trans, hammer_inode_t ip,
1150                         struct hammer_ioc_prune *prune);
1151 int hammer_ioc_mirror_read(hammer_transaction_t trans, hammer_inode_t ip,
1152                         struct hammer_ioc_mirror_rw *mirror);
1153 int hammer_ioc_mirror_write(hammer_transaction_t trans, hammer_inode_t ip,
1154                         struct hammer_ioc_mirror_rw *mirror);
1155 int hammer_ioc_set_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1156                         struct ucred *cred, struct hammer_ioc_pseudofs_rw *pfs);
1157 int hammer_ioc_get_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1158                         struct hammer_ioc_pseudofs_rw *pfs);
1159 int hammer_ioc_destroy_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1160                         struct hammer_ioc_pseudofs_rw *pfs);
1161 int hammer_ioc_downgrade_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1162                         struct hammer_ioc_pseudofs_rw *pfs);
1163 int hammer_ioc_upgrade_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1164                         struct hammer_ioc_pseudofs_rw *pfs);
1165 int hammer_ioc_wait_pseudofs(hammer_transaction_t trans, hammer_inode_t ip,
1166                         struct hammer_ioc_pseudofs_rw *pfs);
1167
1168 int hammer_signal_check(hammer_mount_t hmp);
1169
1170 void hammer_flusher_create(hammer_mount_t hmp);
1171 void hammer_flusher_destroy(hammer_mount_t hmp);
1172 void hammer_flusher_sync(hammer_mount_t hmp);
1173 int  hammer_flusher_async(hammer_mount_t hmp, hammer_flush_group_t flg);
1174 int  hammer_flusher_async_one(hammer_mount_t hmp);
1175 void hammer_flusher_wait(hammer_mount_t hmp, int seq);
1176 void hammer_flusher_wait_next(hammer_mount_t hmp);
1177 int  hammer_flusher_meta_limit(hammer_mount_t hmp);
1178 int  hammer_flusher_meta_halflimit(hammer_mount_t hmp);
1179 int  hammer_flusher_undo_exhausted(hammer_transaction_t trans, int quarter);
1180 void hammer_flusher_clean_loose_ios(hammer_mount_t hmp);
1181 void hammer_flusher_finalize(hammer_transaction_t trans, int final);
1182 int  hammer_flusher_haswork(hammer_mount_t hmp);
1183
1184
1185 int hammer_recover(hammer_mount_t hmp, hammer_volume_t rootvol);
1186 void hammer_recover_flush_buffers(hammer_mount_t hmp,
1187                         hammer_volume_t root_volume, int final);
1188
1189 void hammer_crc_set_blockmap(hammer_blockmap_t blockmap);
1190 void hammer_crc_set_volume(hammer_volume_ondisk_t ondisk);
1191 void hammer_crc_set_leaf(void *data, hammer_btree_leaf_elm_t leaf);
1192
1193 int hammer_crc_test_blockmap(hammer_blockmap_t blockmap);
1194 int hammer_crc_test_volume(hammer_volume_ondisk_t ondisk);
1195 int hammer_crc_test_btree(hammer_node_ondisk_t ondisk);
1196 int hammer_crc_test_leaf(void *data, hammer_btree_leaf_elm_t leaf);
1197 void hkprintf(const char *ctl, ...);
1198 udev_t hammer_fsid_to_udev(uuid_t *uuid);
1199
1200
1201 int hammer_blocksize(int64_t file_offset);
1202 int64_t hammer_blockdemarc(int64_t file_offset1, int64_t file_offset2);
1203
1204 #endif
1205
1206 static __inline void
1207 hammer_wait_mem_record(hammer_record_t record)
1208 {
1209         hammer_wait_mem_record_ident(record, "hmmwai");
1210 }
1211
1212 static __inline void
1213 hammer_lock_ex(struct hammer_lock *lock)
1214 {
1215         hammer_lock_ex_ident(lock, "hmrlck");
1216 }
1217
1218 /*
1219  * Indicate that a B-Tree node is being modified.
1220  */
1221 static __inline void
1222 hammer_modify_node_noundo(hammer_transaction_t trans, hammer_node_t node)
1223 {
1224         hammer_modify_buffer(trans, node->buffer, NULL, 0);
1225 }
1226
1227 static __inline void
1228 hammer_modify_node_all(hammer_transaction_t trans, struct hammer_node *node)
1229 {
1230         hammer_modify_buffer(trans, node->buffer,
1231                              node->ondisk, sizeof(*node->ondisk));
1232 }
1233
1234 static __inline void
1235 hammer_modify_node(hammer_transaction_t trans, hammer_node_t node,
1236                    void *base, int len)
1237 {
1238         hammer_crc_t *crcptr;
1239
1240         KKASSERT((char *)base >= (char *)node->ondisk &&
1241                  (char *)base + len <=
1242                     (char *)node->ondisk + sizeof(*node->ondisk));
1243         hammer_modify_buffer(trans, node->buffer, base, len);
1244         crcptr = &node->ondisk->crc;
1245         hammer_modify_buffer(trans, node->buffer, crcptr, sizeof(hammer_crc_t));
1246         --node->buffer->io.modify_refs; /* only want one ref */
1247 }
1248
1249 /*
1250  * Indicate that the specified modifications have been completed.
1251  *
1252  * Do not try to generate the crc here, it's very expensive to do and a
1253  * sequence of insertions or deletions can result in many calls to this
1254  * function on the same node.
1255  */
1256 static __inline void
1257 hammer_modify_node_done(hammer_node_t node)
1258 {
1259         node->flags |= HAMMER_NODE_CRCGOOD;
1260         if ((node->flags & HAMMER_NODE_NEEDSCRC) == 0) {
1261                 node->flags |= HAMMER_NODE_NEEDSCRC;
1262                 node->buffer->io.gencrc = 1;
1263                 hammer_ref_node(node);
1264         }
1265         hammer_modify_buffer_done(node->buffer);
1266 }
1267
1268 #define hammer_modify_volume_field(trans, vol, field)           \
1269         hammer_modify_volume(trans, vol, &(vol)->ondisk->field, \
1270                              sizeof((vol)->ondisk->field))
1271
1272 #define hammer_modify_node_field(trans, node, field)            \
1273         hammer_modify_node(trans, node, &(node)->ondisk->field, \
1274                              sizeof((node)->ondisk->field))
1275