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 $
37 #include "hammer_util.h"
40 hammer_key_beg_init(hammer_base_elm_t base
)
42 bzero(base
, sizeof(*base
));
44 base
->localization
= HAMMER_MIN_LOCALIZATION
;
45 base
->obj_id
= HAMMER_MIN_OBJID
;
46 base
->key
= HAMMER_MIN_KEY
;
48 base
->rec_type
= HAMMER_MIN_RECTYPE
;
53 hammer_key_end_init(hammer_base_elm_t base
)
55 bzero(base
, sizeof(*base
));
57 base
->localization
= HAMMER_MAX_LOCALIZATION
;
58 base
->obj_id
= HAMMER_MAX_OBJID
;
59 base
->key
= HAMMER_MAX_KEY
;
60 base
->create_tid
= HAMMER_MAX_TID
;
61 base
->rec_type
= HAMMER_MAX_RECTYPE
;
71 if (fgets(buf
, sizeof(buf
), stdin
) == NULL
)
74 while (len
&& (buf
[len
-1] == '\n' || buf
[len
-1] == '\r'))
77 if (strcmp(buf
, "y") == 0 ||
78 strcmp(buf
, "yes") == 0 ||
79 strcmp(buf
, "Y") == 0 ||
80 strcmp(buf
, "YES") == 0) {
91 if (size
< 1024 / 2) {
92 snprintf(buf
, sizeof(buf
), "%6.2fB", (double)size
);
93 } else if (size
< 1024 * 1024 / 2) {
94 snprintf(buf
, sizeof(buf
), "%6.2fKB", (double)size
/ 1024);
95 } else if (size
< 1024 * 1024 * 1024LL / 2) {
96 snprintf(buf
, sizeof(buf
), "%6.2fMB",
97 (double)size
/ (1024 * 1024));
98 } else if (size
< 1024 * 1024 * 1024LL * 1024LL / 2) {
99 snprintf(buf
, sizeof(buf
), "%6.2fGB",
100 (double)size
/ (1024 * 1024 * 1024LL));
102 snprintf(buf
, sizeof(buf
), "%6.2fTB",
103 (double)size
/ (1024 * 1024 * 1024LL * 1024LL));
109 hammer_fs_to_vol(const char *fs
, struct hammer_ioc_volume_list
*p
)
111 struct hammer_ioc_volume_list ioc
;
114 fd
= open(fs
, O_RDONLY
);
120 bzero(&ioc
, sizeof(ioc
));
121 ioc
.nvols
= HAMMER_MAX_VOLUMES
;
122 ioc
.vols
= malloc(ioc
.nvols
* sizeof(*ioc
.vols
));
123 if (ioc
.vols
== NULL
) {
129 if (ioctl(fd
, HAMMERIOC_LIST_VOLUMES
, &ioc
) < 0) {
136 bcopy(&ioc
, p
, sizeof(ioc
));
143 hammer_fs_to_rootvol(const char *fs
, char *buf
, int len
)
145 struct hammer_ioc_volume_list ioc
;
148 if (hammer_fs_to_vol(fs
, &ioc
) == -1)
151 for (i
= 0; i
< ioc
.nvols
; i
++) {
152 if (ioc
.vols
[i
].vol_no
== HAMMER_ROOT_VOLNO
) {
154 strncpy(buf
, ioc
.vols
[i
].device_name
, len
- 1);
158 assert(i
!= ioc
.nvols
); /* root volume must exist */
165 * Functions and data structure for zone statistics
168 * Each layer1 needs ((2^19) / 64) = 8192 uint64_t.
170 #define HAMMER_LAYER1_UINT64 8192
171 #define HAMMER_LAYER1_BYTES (HAMMER_LAYER1_UINT64 * sizeof(uint64_t))
173 static int *l1_max
= NULL
;
174 static uint64_t **l1_bits
= NULL
;
178 hammer_set_layer_bits(uint64_t *bits
, int i
)
183 r
= i
& ((1 << 6) - 1);
186 if (!((*bits
) & ((uint64_t)1 << r
))) {
187 (*bits
) |= ((uint64_t)1 << r
);
190 return(0); /* already seen this block */
195 hammer_extend_layer1_bits(int vol
, int newsiz
, int oldsiz
)
199 assert(newsiz
> oldsiz
);
200 assert(newsiz
> 0 && oldsiz
>= 0);
204 p
= malloc(HAMMER_LAYER1_BYTES
* newsiz
);
206 p
= realloc(p
, HAMMER_LAYER1_BYTES
* newsiz
);
213 p
+= HAMMER_LAYER1_UINT64
* oldsiz
;
214 bzero(p
, HAMMER_LAYER1_BYTES
* (newsiz
- oldsiz
));
218 hammer_init_zone_stat(void)
220 return(calloc(HAMMER_MAX_ZONES
, sizeof(struct zone_stat
)));
224 hammer_init_zone_stat_bits(void)
228 l1_max
= calloc(HAMMER_MAX_VOLUMES
, sizeof(int));
229 if (l1_max
== NULL
) {
234 l1_bits
= calloc(HAMMER_MAX_VOLUMES
, sizeof(uint64_t*));
235 if (l1_bits
== NULL
) {
240 for (i
= 0; i
< HAMMER_MAX_VOLUMES
; i
++) {
241 l1_max
[i
] = -1; /* +1 needs to be 0 */
244 return(hammer_init_zone_stat());
248 hammer_cleanup_zone_stat(zone_stat_t stats
)
253 for (i
= 0; i
< HAMMER_MAX_VOLUMES
; i
++) {
270 _hammer_add_zone_stat(zone_stat_t stats
, int zone
, int bytes
,
271 int new_block
, int new_item
)
273 zone_stat_t sp
= stats
+ zone
;
283 hammer_add_zone_stat(zone_stat_t stats
, hammer_off_t offset
, int bytes
)
285 int zone
, vol
, i
, j
, new_block
;
288 offset
&= ~HAMMER_BIGBLOCK_MASK64
;
289 zone
= HAMMER_ZONE_DECODE(offset
);
290 vol
= HAMMER_VOL_DECODE(offset
);
292 offset
= HAMMER_OFF_SHORT_ENCODE(offset
); /* cut off volume bits */
293 i
= HAMMER_BLOCKMAP_LAYER1_INDEX(offset
);
294 j
= HAMMER_BLOCKMAP_LAYER2_INDEX(offset
);
296 if (i
> l1_max
[vol
]) {
297 assert(i
< (HAMMER_BLOCKMAP_RADIX1
/ HAMMER_MAX_VOLUMES
));
298 hammer_extend_layer1_bits(vol
, i
+ 1, l1_max
[vol
] + 1);
302 p
= l1_bits
[vol
] + i
* HAMMER_LAYER1_UINT64
;
303 new_block
= hammer_set_layer_bits(p
, j
);
304 _hammer_add_zone_stat(stats
, zone
, bytes
, new_block
, 1);
308 * If the same layer2 is used more than once the result will be wrong.
311 hammer_add_zone_stat_layer2(zone_stat_t stats
,
312 hammer_blockmap_layer2_t layer2
)
314 _hammer_add_zone_stat(stats
, layer2
->zone
,
315 HAMMER_BIGBLOCK_SIZE
- layer2
->bytes_free
, 1, 0);
320 _calc_used_percentage(int64_t blocks
, int64_t used
)
325 res
= ((double)(used
* 100)) / (blocks
<< HAMMER_BIGBLOCK_BITS
);
332 hammer_print_zone_stat(zone_stat_t stats
)
335 int64_t total_blocks
= 0;
336 int64_t total_items
= 0;
337 int64_t total_used
= 0;
338 zone_stat_t p
= stats
;
341 printf("HAMMER zone statistics\n");
342 printf(INDENT
"zone # "
343 "blocks items used[B] used[%%]\n");
344 for (i
= 0; i
< HAMMER_MAX_ZONES
; i
++) {
345 printf(INDENT
"zone %-2d %-10s %-12ju %-18ju %-19ju %g\n",
346 i
, zone_labels
[i
], p
->blocks
, p
->items
, p
->used
,
347 _calc_used_percentage(p
->blocks
, p
->used
));
348 total_blocks
+= p
->blocks
;
349 total_items
+= p
->items
;
350 total_used
+= p
->used
;
355 * Remember that zone0 is always 0% used and zone15 is
358 printf(INDENT
"--------------------------------------------------------------------------------\n");
359 printf(INDENT
"total %-12ju %-18ju %-19ju %g\n",
360 (uintmax_t)total_blocks
,
361 (uintmax_t)total_items
,
362 (uintmax_t)total_used
,
363 _calc_used_percentage(total_blocks
, total_used
));