1 /* 2 * Copyright (c) 2007 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 35 #ifndef HAMMER_UTIL_H_ 36 #define HAMMER_UTIL_H_ 37 38 #include <sys/types.h> 39 #include <sys/stat.h> 40 #include <sys/time.h> 41 #include <sys/tree.h> 42 #include <sys/queue.h> 43 #include <sys/mount.h> 44 45 #include <assert.h> 46 #include <stdio.h> 47 #include <stdlib.h> 48 #include <stdarg.h> 49 #include <string.h> 50 #include <unistd.h> 51 #include <stddef.h> 52 #include <err.h> 53 #include <errno.h> 54 #include <fcntl.h> 55 56 #include <vfs/hammer/hammer_disk.h> 57 #include <vfs/hammer/hammer_ioctl.h> 58 #include <uuid.h> 59 60 /* 61 * pidfile management - common definitions so code is more robust 62 */ 63 64 #define PIDFILE_BUFSIZE 64 65 static const char pidfile_loc[] = "/var/run"; 66 67 /* 68 * Cache management - so the user code can keep its memory use under control 69 */ 70 struct volume_info; 71 struct buffer_info; 72 73 TAILQ_HEAD(volume_list, volume_info); 74 75 struct cache_info { 76 TAILQ_ENTRY(cache_info) entry; 77 struct buffer_info *buffer; 78 int refs; /* structural references */ 79 int modified; /* ondisk modified flag */ 80 int delete; /* delete flag - delete on last ref */ 81 }; 82 83 #define HAMMER_BUFLISTS 64 84 #define HAMMER_BUFLISTMASK (HAMMER_BUFLISTS - 1) 85 86 /* 87 * These structures are used by newfs_hammer to track the filesystem 88 * buffers it constructs while building the filesystem. No attempt 89 * is made to try to make this efficient. 90 */ 91 struct volume_info { 92 TAILQ_ENTRY(volume_info) entry; 93 int vol_no; 94 int rdonly; 95 96 hammer_off_t vol_free_off; /* zone-2 offset */ 97 hammer_off_t vol_free_end; /* zone-2 offset */ 98 99 char *name; 100 int fd; 101 off_t size; 102 off_t device_offset; 103 const char *type; 104 105 struct hammer_volume_ondisk *ondisk; 106 107 TAILQ_HEAD(, buffer_info) buffer_lists[HAMMER_BUFLISTS]; 108 }; 109 110 struct buffer_info { 111 struct cache_info cache; 112 TAILQ_ENTRY(buffer_info) entry; 113 hammer_off_t buf_offset; /* full hammer offset spec */ 114 int64_t raw_offset; /* physical offset */ 115 struct volume_info *volume; 116 void *ondisk; 117 }; 118 119 struct softprune { 120 struct softprune *next; 121 struct statfs fs; 122 char *filesystem; 123 struct hammer_ioc_prune prune; 124 int maxelms; 125 int prune_min; 126 }; 127 128 /* 129 * Data structure for zone statistics. 130 */ 131 struct zone_stat { 132 int zone; /* zone index, not used */ 133 hammer_off_t blocks; /* number of big-blocks */ 134 hammer_off_t items; /* number of items */ 135 hammer_off_t used; /* bytes used */ 136 }; 137 138 extern uuid_t Hammer_FSType; 139 extern uuid_t Hammer_FSId; 140 extern int DebugOpt; 141 extern const char *ScoreBoardFile; 142 extern const char *RestrictTarget; 143 extern struct volume_list VolList; 144 extern int UseReadBehind; 145 extern int UseReadAhead; 146 extern int AssertOnFailure; 147 148 uint32_t crc32(const void *buf, size_t size); 149 uint32_t crc32_ext(const void *buf, size_t size, uint32_t ocrc); 150 151 struct volume_info *init_volume(int32_t vol_no, const char *filename, 152 int oflags); 153 struct volume_info *load_volume(const char *filename, int oflags); 154 void check_volume(struct volume_info *vol); 155 struct volume_info *get_volume(int32_t vol_no); 156 struct volume_info *get_root_volume(void); 157 struct buffer_info *get_buffer(hammer_off_t buf_offset, int isnew); 158 void *get_buffer_data(hammer_off_t buf_offset, struct buffer_info **bufferp, 159 int isnew); 160 hammer_node_ondisk_t get_node(hammer_off_t node_offset, 161 struct buffer_info **bufp); 162 163 void rel_volume(struct volume_info *volume); 164 void rel_buffer(struct buffer_info *buffer); 165 166 hammer_off_t alloc_bigblock(struct volume_info *volume, int zone); 167 void *alloc_blockmap(int zone, int bytes, hammer_off_t *result_offp, 168 struct buffer_info **bufferp); 169 hammer_off_t blockmap_lookup(hammer_off_t bmap_off, 170 struct hammer_blockmap_layer1 *layer1, 171 struct hammer_blockmap_layer2 *layer2, 172 int *errorp); 173 void format_undomap(struct volume_info *root_vol, int64_t *undo_buffer_size); 174 175 void *alloc_btree_element(hammer_off_t *offp, 176 struct buffer_info **data_bufferp); 177 void *alloc_meta_element(hammer_off_t *offp, int32_t data_len, 178 struct buffer_info **data_bufferp); 179 void *alloc_data_element(hammer_off_t *offp, int32_t data_len, 180 struct buffer_info **data_bufferp); 181 182 int hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2); 183 void hammer_key_beg_init(hammer_base_elm_t base); 184 void hammer_key_end_init(hammer_base_elm_t base); 185 int hammer_crc_test_leaf(void *data, hammer_btree_leaf_elm_t leaf); 186 187 void format_blockmap(struct volume_info *vol, int zone, hammer_off_t offset); 188 void format_freemap(struct volume_info *root_vol); 189 int64_t initialize_freemap(struct volume_info *vol); 190 int64_t count_freemap(struct volume_info *vol); 191 192 void flush_all_volumes(void); 193 void flush_volume(struct volume_info *vol); 194 void flush_buffer(struct buffer_info *buf); 195 196 int64_t init_boot_area_size(int64_t value, off_t avg_vol_size); 197 int64_t init_mem_area_size(int64_t value, off_t avg_vol_size); 198 199 void hammer_cache_set(int bytes); 200 void hammer_cache_add(struct cache_info *cache); 201 void hammer_cache_del(struct cache_info *cache); 202 void hammer_cache_used(struct cache_info *cache); 203 void hammer_cache_flush(void); 204 205 void score_printf(size_t i, size_t w, const char *ctl, ...) __printflike(3, 4); 206 207 struct zone_stat *hammer_init_zone_stat(void); 208 struct zone_stat *hammer_init_zone_stat_bits(void); 209 void hammer_cleanup_zone_stat(struct zone_stat *stats); 210 void hammer_add_zone_stat(struct zone_stat *stats, hammer_off_t offset, 211 hammer_off_t bytes); 212 void hammer_add_zone_stat_layer2(struct zone_stat *stats, 213 struct hammer_blockmap_layer2 *layer2); 214 void hammer_print_zone_stat(const struct zone_stat *stats); 215 216 #endif /* !HAMMER_UTIL_H_ */ 217