2 * Copyright (c) 2008 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * $DragonFly: src/sbin/hammer/misc.c,v 1.5 2008/06/26 04:07:57 dillon Exp $
39 const char *ScoreBoardFile;
42 * (taken from /usr/src/sys/vfs/hammer/hammer_btree.c)
44 * Compare two B-Tree elements, return -N, 0, or +N (e.g. similar to strcmp).
46 * Note that for this particular function a return value of -1, 0, or +1
47 * can denote a match if delete_tid is otherwise discounted. A delete_tid
48 * of zero is considered to be 'infinity' in comparisons.
50 * See also hammer_rec_rb_compare() and hammer_rec_cmp() in hammer_object.c.
53 hammer_btree_cmp(hammer_base_elm_t key1, hammer_base_elm_t key2)
55 if (key1->localization < key2->localization)
57 if (key1->localization > key2->localization)
60 if (key1->obj_id < key2->obj_id)
62 if (key1->obj_id > key2->obj_id)
65 if (key1->rec_type < key2->rec_type)
67 if (key1->rec_type > key2->rec_type)
70 if (key1->key < key2->key)
72 if (key1->key > key2->key)
75 if (key1->create_tid == 0) {
76 if (key2->create_tid == 0)
80 if (key2->create_tid == 0)
82 if (key1->create_tid < key2->create_tid)
84 if (key1->create_tid > key2->create_tid)
90 hammer_key_beg_init(hammer_base_elm_t base)
92 bzero(base, sizeof(*base));
94 base->localization = HAMMER_MIN_LOCALIZATION;
95 base->obj_id = HAMMER_MIN_OBJID;
96 base->key = HAMMER_MIN_KEY;
98 base->rec_type = HAMMER_MIN_RECTYPE;
102 hammer_key_end_init(hammer_base_elm_t base)
104 bzero(base, sizeof(*base));
106 base->localization = HAMMER_MAX_LOCALIZATION;
107 base->obj_id = HAMMER_MAX_OBJID;
108 base->key = HAMMER_MAX_KEY;
109 base->create_tid = HAMMER_MAX_TID;
110 base->rec_type = HAMMER_MAX_RECTYPE;
114 hammer_crc_test_leaf(void *data, hammer_btree_leaf_elm_t leaf)
118 if (leaf->data_len == 0) {
121 switch(leaf->base.rec_type) {
122 case HAMMER_RECTYPE_INODE:
123 if (leaf->data_len != sizeof(struct hammer_inode_data))
125 crc = crc32(data, HAMMER_INODE_CRCSIZE);
128 crc = crc32(data, leaf->data_len);
132 return (leaf->data_crc == crc);
136 score_printf(size_t i, size_t w, const char *ctl, ...)
142 static char ScoreBuf[1024];
144 if (ScoreBoardFile == NULL)
146 assert(i + w < sizeof(ScoreBuf));
148 SFd = open(ScoreBoardFile, O_RDWR|O_CREAT|O_TRUNC, 0644);
153 for (n = 0; n < i; ++n) {
154 if (ScoreBuf[n] == 0)
158 vsnprintf(ScoreBuf + i, w - 1, ctl, va);
160 n = strlen(ScoreBuf + i);
162 ScoreBuf[i + n] = ' ';
165 ScoreBuf[i + n] = '\n';
168 pwrite(SFd, ScoreBuf, SSize, 0);
172 hammer_check_restrict(const char *filesystem)
177 if (RestrictTarget == NULL)
179 rlen = strlen(RestrictTarget);
180 if (strncmp(filesystem, RestrictTarget, rlen) != 0) {
181 fprintf(stderr, "hammer-remote: restricted target\n");
185 while (filesystem[rlen]) {
187 filesystem[rlen] == '.' &&
188 filesystem[rlen+1] == '.') {
189 fprintf(stderr, "hammer-remote: '..' not allowed\n");
192 if (filesystem[rlen] == '/')
201 * Functions and data structure for zone statistics
204 * Each layer1 needs ((2^19) / 64) = 8192 uint64_t.
206 #define HAMMER_LAYER1_UINT64 8192
207 #define HAMMER_LAYER1_BYTES (HAMMER_LAYER1_UINT64 * sizeof(uint64_t))
209 static int *l1_max = NULL;
210 static uint64_t **l1_bits = NULL;
214 hammer_set_layer_bits(uint64_t *bits, int i)
219 r = i & ((1 << 6) - 1);
222 if (!((*bits) & ((uint64_t)1 << r))) {
223 (*bits) |= ((uint64_t)1 << r);
226 return(0); /* already seen this block */
231 hammer_extend_layer1_bits(int vol, int newsiz, int oldsiz)
235 assert(newsiz > oldsiz);
236 assert(newsiz > 0 && oldsiz >= 0);
240 p = malloc(HAMMER_LAYER1_BYTES * newsiz);
242 p = realloc(p, HAMMER_LAYER1_BYTES * newsiz);
247 p += HAMMER_LAYER1_UINT64 * oldsiz;
248 bzero((void*)p, HAMMER_LAYER1_BYTES * (newsiz - oldsiz));
253 hammer_dump_layer1_bits(void)
258 printf("Layer1 bitmaps\n");
260 for (i = 0; i < HAMMER_MAX_VOLUMES; i++) {
261 if (l1_max[i] != -1) {
262 printf("volume=%d %p\n", i, l1_bits[i]);
263 n = (l1_max[i] + 1) * HAMMER_LAYER1_UINT64;
264 for (j = 0; j < n; j++) {
265 printf("\tblock[%d][%d]=0x%016lX\n",
266 i, j << 6, *(l1_bits[i] + j));
273 hammer_init_zone_stat(void)
275 return calloc(HAMMER_MAX_ZONES, sizeof(struct zone_stat));
279 hammer_init_zone_stat_bits(void)
283 l1_max = calloc(HAMMER_MAX_VOLUMES, sizeof(int));
287 l1_bits = calloc(HAMMER_MAX_VOLUMES, sizeof(uint64_t*));
291 for (i = 0; i < HAMMER_MAX_VOLUMES; i++) {
292 l1_max[i] = -1; /* +1 needs to be 0 */
295 return(hammer_init_zone_stat());
299 hammer_cleanup_zone_stat(struct zone_stat *stats)
305 hammer_dump_layer1_bits();
306 for (i = 0; i < HAMMER_MAX_VOLUMES; i++) {
323 _hammer_add_zone_stat(struct zone_stat *stats, int zone,
324 hammer_off_t bytes, int new_block, int new_item)
326 struct zone_stat *sp = stats + zone;
336 hammer_add_zone_stat(struct zone_stat *stats, hammer_off_t offset,
339 int zone, vol, i, j, new_block;
342 offset &= ~HAMMER_BIGBLOCK_MASK64;
343 zone = HAMMER_ZONE_DECODE(offset);
344 vol = HAMMER_VOL_DECODE(offset);
346 offset &= HAMMER_OFF_SHORT_MASK; /* cut off volume bits from layer1 */
347 i = (int)HAMMER_BLOCKMAP_LAYER1_INDEX(offset);
348 j = (int)HAMMER_BLOCKMAP_LAYER2_INDEX(offset);
350 if (i > l1_max[vol]) {
351 assert(i < 1024); /* XXX hardcoded */
352 hammer_extend_layer1_bits(vol, i + 1, l1_max[vol] + 1);
356 p = l1_bits[vol] + i * HAMMER_LAYER1_UINT64;
357 new_block = hammer_set_layer_bits(p, j);
358 _hammer_add_zone_stat(stats, zone, bytes, new_block, 1);
362 * If the same layer2 is used more than once the result will be wrong.
365 hammer_add_zone_stat_layer2(struct zone_stat *stats,
366 struct hammer_blockmap_layer2 *layer2)
368 _hammer_add_zone_stat(stats, layer2->zone,
369 HAMMER_BIGBLOCK_SIZE - layer2->bytes_free, 1, 0);
373 hammer_print_zone_stat(const struct zone_stat *stats)
377 hammer_off_t total_blocks = 0;
378 hammer_off_t total_items = 0;
379 hammer_off_t total_used = 0;
380 const struct zone_stat *p = stats;
382 printf("HAMMER zone statistics\n");
383 printf("\tzone # blocks items used[B] used[%%]\n");
385 for (i = 0; i < HAMMER_MAX_ZONES; i++) {
387 per = ((double)(p->used * 100)) /
388 (p->blocks * HAMMER_BIGBLOCK_SIZE);
391 printf("\tzone %-2d %-12ju %-18ju %-19ju %g\n",
392 i, p->blocks, p->items, p->used, per);
393 total_blocks += p->blocks;
394 total_items += p->items;
395 total_used += p->used;
400 * Remember that zone0 is always 0% used and zone15 is
404 per = ((double)(total_used * 100)) /
405 (total_blocks * HAMMER_BIGBLOCK_SIZE);
409 printf("\t----------------------------------------------------------------------\n");
410 printf("\ttotal %-12ju %-18ju %-19ju %g\n",
411 (uintmax_t)total_blocks, (uintmax_t)total_items,
412 (uintmax_t)total_used, per);