4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
24 * User-level tool to check iam files sanity.
26 * Author: Artem Blagodarenko <artem.blagodarenko@hpe.com>
37 #include <sys/types.h>
38 #include <linux/lustre/lustre_user.h>
39 #include <asm/byteorder.h>
40 #include <lustre/libiam.h>
59 printf("usage: %s [-h] [-v] iam_file\n", str);
72 unsigned long idle_blocks;
73 unsigned long current_block;
74 unsigned long long file_size;
75 unsigned long blocks_count;
76 struct node_info *node_info;
80 int check_idle_blocks(char *buf, struct iam_params *params)
82 struct iam_idle_head *idle;
85 idle = (struct iam_idle_head *)buf;
87 if (idle->iih_magic != __cpu_to_le16(IAM_IDLE_HEADER_MAGIC)) {
88 printf("Wrong magic 0x%x\n", idle->iih_magic);
93 printf(", %i blocks, next table in block %i, idle blocks: ",
94 __le16_to_cpu(idle->iih_count),
95 __le32_to_cpu(idle->iih_next));
98 for (i = 0; i < __le32_to_cpu(idle->iih_count); i++) {
99 unsigned int blk = __le32_to_cpu(idle->iih_blks[i]);
103 if (blk >= params->blocks_count) {
104 printf("Pointer to the idle block (%i) outside the file\n",
108 if (params->node_info[blk].referenced && verbose)
109 printf("Reference to recycled node (%i)\n",
111 params->node_info[blk].recycled = 1;
121 static int check_entries(unsigned char *entries, size_t size, int count,
122 struct iam_params *params)
127 for (i = 0; i < count; i++) {
129 size -= (params->keysize + params->ptrsize);
133 printf("index outside of buffer\n");
141 for (j = 0; j < params->keysize; j++, entries++)
143 printf("%02x", *entries);
145 ptr = __le32_to_cpu(*((__le32 *)entries));
147 if (ptr >= params->blocks_count) {
152 printf(", ptr: %u%s\n", ptr, rc ? " wrong" : "");
154 entries += params->ptrsize;
159 if (params->node_info[ptr].recycled && verbose) {
160 printf("Reference to recycled node (%u) from node %lu\n",
161 ptr, params->current_block);
163 params->node_info[ptr].referenced = 1;
169 static int check_index(char *buf, struct iam_params *params)
171 struct iam_index_head *index;
173 struct dx_countlimit *limit;
175 index = (struct iam_index_head *)buf;
176 limit = &index->limit;
178 params->node_info[params->current_block].node_type = INDEX_NODE;
181 printf("Index block, count %i, limit %i\n",
182 __le16_to_cpu(limit->count),
183 __le16_to_cpu(limit->limit));
185 counted_limit = node_limit(params->node_gap, params->blocksize,
186 params->keysize + params->ptrsize);
188 if (__le16_to_cpu(limit->limit) != counted_limit) {
189 fprintf(stderr, "Wrong limit %i, counted limit %i\n",
190 __le16_to_cpu(limit->limit), counted_limit);
195 if (__le16_to_cpu(limit->count) > __le16_to_cpu(limit->limit)) {
196 printf("More elements (%i) then limit (%i)\n",
197 __le16_to_cpu(limit->count),
198 __le16_to_cpu(limit->limit));
202 /* count - 1, because limit is entry itself */
203 if (check_entries(index->entries,
204 params->blocksize - offsetof(struct iam_index_head,
206 __le16_to_cpu(limit->count) - 1, params)) {
207 printf("Broken entries\n");
214 static int check_root(char *buf, size_t size, struct iam_params *params)
216 struct iam_lfix_root *root;
217 unsigned int counted_limit;
219 struct dx_countlimit *limit;
222 printf("Root format ");
224 root = (struct iam_lfix_root *)buf;
225 if (root->ilr_magic == __cpu_to_le64(IAM_LFIX_ROOT_MAGIC)) {
226 params->fmt = FMT_LFIX;
229 } else if (root->ilr_magic == __cpu_to_le64(IAM_LVAR_ROOT_MAGIC)) {
230 params->fmt = FMT_LVAR;
234 printf("Bad magic %llu\n", __le64_to_cpu(root->ilr_magic));
238 limit = &root->limit;
240 params->keysize = __le16_to_cpu(root->ilr_keysize);
241 params->recsize = __le16_to_cpu(root->ilr_recsize);
242 params->ptrsize = __le16_to_cpu(root->ilr_ptrsize);
243 params->indirect_levels = root->ilr_indirect_levels;
245 params->node_info[0].referenced = 1; //self referance
246 params->node_info[0].node_type = ROOT_NODE;
248 params->idle_blocks = __le32_to_cpu(root->idle_blocks);
249 if (params->idle_blocks >= params->blocks_count) {
250 printf("Idle blocks number (%lu) is out of blocks range (%lu)\n",
251 params->idle_blocks, params->blocks_count);
254 params->node_info[params->idle_blocks].referenced = 1;
255 params->node_info[params->idle_blocks].node_type = IDLE_NODE;
259 printf("Idle blocks block number %lu\n", params->idle_blocks);
260 printf("keysize %i, recsize %i, ptrsize %i, indirect_levels %i\n",
261 params->keysize, params->recsize, params->ptrsize,
262 params->indirect_levels);
265 if (params->ptrsize != 4 && params->ptrsize != 8) {
266 printf("Invalid ptrsize (%i). Only 4 and 8 are supported\n",
271 if (params->keysize < 1 || params->recsize < 0) {
272 printf("Too small key(%i) or recorod(%i)\n",
273 params->keysize, params->recsize);
277 if ((params->keysize + params->recsize +
278 (int)sizeof(struct iam_leaf_head)) > (params->blocksize / 3)) {
279 printf("Too large record + key or too small block, %i, %i\n",
280 (params->keysize + params->recsize +
281 (int)sizeof(struct iam_leaf_head)),
286 counted_limit = root_limit(params->root_gap, params->node_gap,
288 params->keysize + params->ptrsize);
291 if (__le16_to_cpu(limit->limit) != counted_limit) {
292 fprintf(stderr, "Wrong limit %i, counted limit %i\n",
293 __le16_to_cpu(limit->limit), counted_limit);
297 min = (counted_limit < __le16_to_cpu(limit->limit)) ?
298 counted_limit : __le16_to_cpu(limit->limit);
300 if (__le16_to_cpu(limit->count) > __le16_to_cpu(limit->limit)) {
301 printf("More elements (%i) then limit (%i)\n",
302 __le16_to_cpu(root->limit.count),
303 __le16_to_cpu(root->limit.limit));
307 min = (__le16_to_cpu(limit->count) < min) ?
308 __le16_to_cpu(limit->count) : min;
312 printf("count %i, limit %i\n",
313 __le16_to_cpu(root->limit.count),
314 __le16_to_cpu(root->limit.limit));
316 /* cound - 1, because limit is entry itself */
317 if (check_entries(root->entries,
318 size - offsetof(struct iam_lfix_root, entries),
320 printf("Broken entries\n");
327 static int check_block(char *buf, struct iam_params *params)
329 struct iam_leaf_head *head;
331 head = (struct iam_leaf_head *)buf;
334 printf("Block %lu,", params->current_block);
336 switch (head->ill_magic) {
337 case __cpu_to_le16(IAM_LEAF_HEADER_MAGIC):
340 params->node_info[params->current_block].node_type =
343 case __cpu_to_le16(IAM_LVAR_ROOT_MAGIC):
345 printf("LVAR leaf,");
347 case __cpu_to_le16(IAM_IDLE_HEADER_MAGIC):
349 printf("IDLE block");
351 params->node_info[params->current_block].referenced = 1;
353 if (check_idle_blocks(buf, params)) {
354 printf("Broken idle blocks\n");
359 if (check_index(buf, params)) {
360 printf("Broken index node\n");
366 printf("count %i\n", head->ill_count);
371 static void print_node_type(int type)
387 printf("UNKNOWN %i\n", type);
391 static int check_unconnected(struct iam_params *params)
396 for (i = 0; i < params->blocks_count; i++) {
397 if (params->node_info[i].referenced &&
398 params->node_info[i].recycled) {
399 printf("Node %lu referenced and recycled. FAIL, ", i);
400 print_node_type(params->node_info[i].node_type);
403 if (!params->node_info[i].referenced &&
404 !params->node_info[i].recycled) {
405 printf("Unconnected node %lu. FAIL, ", i);
406 print_node_type(params->node_info[i].node_type);
412 int main(int argc, char **argv)
414 struct iam_params params;
423 opt = getopt(argc, argv, "hv");
430 fprintf(stderr, "Unable to parse options.");
438 if (optind >= argc) {
439 fprintf(stderr, "Expected filename after options\n");
443 params.filename = argv[optind];
444 params.blocksize = 4096;
445 params.current_block = 0;
446 params.root_gap = sizeof(struct iam_lfix_root);
449 fd = open(params.filename, O_RDONLY);
451 fprintf(stderr, "Can not open file %s, %s\n",
452 params.filename, strerror(errno));
456 if (fstat(fd, &sb) == -1) {
457 fprintf(stderr, "Error stat file.\n");
461 params.file_size = (unsigned long long)sb.st_size;
462 params.blocks_count = params.file_size / params.blocksize +
463 ((params.file_size % params.blocksize) ? 1 : 0);
466 printf("Filesize %llu, blocks count %lu\n", params.file_size,
467 params.blocks_count);
468 buf = malloc(params.blocksize);
470 fprintf(stderr, "Can't allocate buffer\n");
474 params.node_info = malloc(params.blocks_count *
475 sizeof(struct node_info));
476 memset(params.node_info, 0,
477 params.blocks_count * sizeof(struct node_info));
479 /* Read root block */
480 if (read(fd, buf, params.blocksize) < params.blocksize) {
481 fprintf(stderr, "Can't read root block\n");
486 rc = check_root(buf, params.blocksize, ¶ms);
488 printf("Root node is insane\n");
492 params.current_block++;
494 /* Read all another blocks */
495 while (read(fd, buf, params.blocksize)) {
496 rc = check_block(buf, ¶ms);
498 printf("Node with offset 0x%lx in %s is broken\n",
499 params.current_block * params.blocksize,
503 params.current_block++;
506 rc = check_unconnected(¶ms);
508 printf("There are unconnected nodes\n");
510 if (!(rc ? rc : params.rc))
511 printf("NO ERRORS\n");
513 printf("FINISHED WITH ERRORS\n");
515 free(params.node_info);
519 return rc ?: params.rc;