1 // SPDX-License-Identifier: GPL-2.0-only
3 * This file is part of UBIFS.
5 * Copyright (C) 2006-2008 Nokia Corporation
7 * Authors: Artem Bityutskiy (Битюцкий Артём)
12 * This file implements most of the debugging stuff which is compiled in only
13 * when it is enabled. But some debugging check functions are implemented in
14 * corresponding subsystem, just because they are closely related and utilize
15 * various local functions of those subsystems.
18 #include <linux/module.h>
19 #include <linux/debugfs.h>
20 #include <linux/math64.h>
21 #include <linux/uaccess.h>
22 #include <linux/random.h>
23 #include <linux/ctype.h>
26 static DEFINE_SPINLOCK(dbg_lock
);
28 static const char *get_key_fmt(int fmt
)
31 case UBIFS_SIMPLE_KEY_FMT
:
34 return "unknown/invalid format";
38 static const char *get_key_hash(int hash
)
41 case UBIFS_KEY_HASH_R5
:
43 case UBIFS_KEY_HASH_TEST
:
46 return "unknown/invalid name hash";
50 static const char *get_key_type(int type
)
64 return "unknown/invalid key";
68 static const char *get_dent_type(int type
)
81 case UBIFS_ITYPE_FIFO
:
83 case UBIFS_ITYPE_SOCK
:
86 return "unknown/invalid type";
90 const char *dbg_snprintf_key(const struct ubifs_info
*c
,
91 const union ubifs_key
*key
, char *buffer
, int len
)
94 int type
= key_type(c
, key
);
96 if (c
->key_fmt
== UBIFS_SIMPLE_KEY_FMT
) {
99 len
-= snprintf(p
, len
, "(%lu, %s)",
100 (unsigned long)key_inum(c
, key
),
105 len
-= snprintf(p
, len
, "(%lu, %s, %#08x)",
106 (unsigned long)key_inum(c
, key
),
107 get_key_type(type
), key_hash(c
, key
));
110 len
-= snprintf(p
, len
, "(%lu, %s, %u)",
111 (unsigned long)key_inum(c
, key
),
112 get_key_type(type
), key_block(c
, key
));
115 len
-= snprintf(p
, len
, "(%lu, %s)",
116 (unsigned long)key_inum(c
, key
),
120 len
-= snprintf(p
, len
, "(bad key type: %#08x, %#08x)",
121 key
->u32
[0], key
->u32
[1]);
124 len
-= snprintf(p
, len
, "bad key format %d", c
->key_fmt
);
125 ubifs_assert(c
, len
> 0);
129 const char *dbg_ntype(int type
)
133 return "padding node";
135 return "superblock node";
137 return "master node";
139 return "reference node";
142 case UBIFS_DENT_NODE
:
143 return "direntry node";
144 case UBIFS_XENT_NODE
:
145 return "xentry node";
146 case UBIFS_DATA_NODE
:
148 case UBIFS_TRUN_NODE
:
149 return "truncate node";
151 return "indexing node";
153 return "commit start node";
154 case UBIFS_ORPH_NODE
:
155 return "orphan node";
156 case UBIFS_AUTH_NODE
:
159 return "unknown node";
163 static const char *dbg_gtype(int type
)
166 case UBIFS_NO_NODE_GROUP
:
167 return "no node group";
168 case UBIFS_IN_NODE_GROUP
:
169 return "in node group";
170 case UBIFS_LAST_OF_NODE_GROUP
:
171 return "last of node group";
177 const char *dbg_cstate(int cmt_state
)
181 return "commit resting";
182 case COMMIT_BACKGROUND
:
183 return "background commit requested";
184 case COMMIT_REQUIRED
:
185 return "commit required";
186 case COMMIT_RUNNING_BACKGROUND
:
187 return "BACKGROUND commit running";
188 case COMMIT_RUNNING_REQUIRED
:
189 return "commit running and required";
191 return "broken commit";
193 return "unknown commit state";
197 const char *dbg_jhead(int jhead
)
207 return "unknown journal head";
211 static void dump_ch(const struct ubifs_ch
*ch
)
213 pr_err("\tmagic %#x\n", le32_to_cpu(ch
->magic
));
214 pr_err("\tcrc %#x\n", le32_to_cpu(ch
->crc
));
215 pr_err("\tnode_type %d (%s)\n", ch
->node_type
,
216 dbg_ntype(ch
->node_type
));
217 pr_err("\tgroup_type %d (%s)\n", ch
->group_type
,
218 dbg_gtype(ch
->group_type
));
219 pr_err("\tsqnum %llu\n",
220 (unsigned long long)le64_to_cpu(ch
->sqnum
));
221 pr_err("\tlen %u\n", le32_to_cpu(ch
->len
));
224 void ubifs_dump_inode(struct ubifs_info
*c
, const struct inode
*inode
)
226 const struct ubifs_inode
*ui
= ubifs_inode(inode
);
227 struct fscrypt_name nm
= {0};
229 struct ubifs_dent_node
*dent
, *pdent
= NULL
;
232 pr_err("Dump in-memory inode:");
233 pr_err("\tinode %lu\n", inode
->i_ino
);
234 pr_err("\tsize %llu\n",
235 (unsigned long long)i_size_read(inode
));
236 pr_err("\tnlink %u\n", inode
->i_nlink
);
237 pr_err("\tuid %u\n", (unsigned int)i_uid_read(inode
));
238 pr_err("\tgid %u\n", (unsigned int)i_gid_read(inode
));
239 pr_err("\tatime %u.%u\n",
240 (unsigned int)inode
->i_atime
.tv_sec
,
241 (unsigned int)inode
->i_atime
.tv_nsec
);
242 pr_err("\tmtime %u.%u\n",
243 (unsigned int)inode
->i_mtime
.tv_sec
,
244 (unsigned int)inode
->i_mtime
.tv_nsec
);
245 pr_err("\tctime %u.%u\n",
246 (unsigned int)inode
->i_ctime
.tv_sec
,
247 (unsigned int)inode
->i_ctime
.tv_nsec
);
248 pr_err("\tcreat_sqnum %llu\n", ui
->creat_sqnum
);
249 pr_err("\txattr_size %u\n", ui
->xattr_size
);
250 pr_err("\txattr_cnt %u\n", ui
->xattr_cnt
);
251 pr_err("\txattr_names %u\n", ui
->xattr_names
);
252 pr_err("\tdirty %u\n", ui
->dirty
);
253 pr_err("\txattr %u\n", ui
->xattr
);
254 pr_err("\tbulk_read %u\n", ui
->bulk_read
);
255 pr_err("\tsynced_i_size %llu\n",
256 (unsigned long long)ui
->synced_i_size
);
257 pr_err("\tui_size %llu\n",
258 (unsigned long long)ui
->ui_size
);
259 pr_err("\tflags %d\n", ui
->flags
);
260 pr_err("\tcompr_type %d\n", ui
->compr_type
);
261 pr_err("\tlast_page_read %lu\n", ui
->last_page_read
);
262 pr_err("\tread_in_a_row %lu\n", ui
->read_in_a_row
);
263 pr_err("\tdata_len %d\n", ui
->data_len
);
265 if (!S_ISDIR(inode
->i_mode
))
268 pr_err("List of directory entries:\n");
269 ubifs_assert(c
, !mutex_is_locked(&c
->tnc_mutex
));
271 lowest_dent_key(c
, &key
, inode
->i_ino
);
273 dent
= ubifs_tnc_next_ent(c
, &key
, &nm
);
275 if (PTR_ERR(dent
) != -ENOENT
)
276 pr_err("error %ld\n", PTR_ERR(dent
));
280 pr_err("\t%d: inode %llu, type %s, len %d\n",
281 count
++, (unsigned long long) le64_to_cpu(dent
->inum
),
282 get_dent_type(dent
->type
),
283 le16_to_cpu(dent
->nlen
));
285 fname_name(&nm
) = dent
->name
;
286 fname_len(&nm
) = le16_to_cpu(dent
->nlen
);
289 key_read(c
, &dent
->key
, &key
);
294 void ubifs_dump_node(const struct ubifs_info
*c
, const void *node
)
298 const struct ubifs_ch
*ch
= node
;
299 char key_buf
[DBG_KEY_BUF_LEN
];
301 /* If the magic is incorrect, just hexdump the first bytes */
302 if (le32_to_cpu(ch
->magic
) != UBIFS_NODE_MAGIC
) {
303 pr_err("Not a node, first %zu bytes:", UBIFS_CH_SZ
);
304 print_hex_dump(KERN_ERR
, "", DUMP_PREFIX_OFFSET
, 32, 1,
305 (void *)node
, UBIFS_CH_SZ
, 1);
309 spin_lock(&dbg_lock
);
312 switch (ch
->node_type
) {
315 const struct ubifs_pad_node
*pad
= node
;
317 pr_err("\tpad_len %u\n", le32_to_cpu(pad
->pad_len
));
322 const struct ubifs_sb_node
*sup
= node
;
323 unsigned int sup_flags
= le32_to_cpu(sup
->flags
);
325 pr_err("\tkey_hash %d (%s)\n",
326 (int)sup
->key_hash
, get_key_hash(sup
->key_hash
));
327 pr_err("\tkey_fmt %d (%s)\n",
328 (int)sup
->key_fmt
, get_key_fmt(sup
->key_fmt
));
329 pr_err("\tflags %#x\n", sup_flags
);
330 pr_err("\tbig_lpt %u\n",
331 !!(sup_flags
& UBIFS_FLG_BIGLPT
));
332 pr_err("\tspace_fixup %u\n",
333 !!(sup_flags
& UBIFS_FLG_SPACE_FIXUP
));
334 pr_err("\tmin_io_size %u\n", le32_to_cpu(sup
->min_io_size
));
335 pr_err("\tleb_size %u\n", le32_to_cpu(sup
->leb_size
));
336 pr_err("\tleb_cnt %u\n", le32_to_cpu(sup
->leb_cnt
));
337 pr_err("\tmax_leb_cnt %u\n", le32_to_cpu(sup
->max_leb_cnt
));
338 pr_err("\tmax_bud_bytes %llu\n",
339 (unsigned long long)le64_to_cpu(sup
->max_bud_bytes
));
340 pr_err("\tlog_lebs %u\n", le32_to_cpu(sup
->log_lebs
));
341 pr_err("\tlpt_lebs %u\n", le32_to_cpu(sup
->lpt_lebs
));
342 pr_err("\torph_lebs %u\n", le32_to_cpu(sup
->orph_lebs
));
343 pr_err("\tjhead_cnt %u\n", le32_to_cpu(sup
->jhead_cnt
));
344 pr_err("\tfanout %u\n", le32_to_cpu(sup
->fanout
));
345 pr_err("\tlsave_cnt %u\n", le32_to_cpu(sup
->lsave_cnt
));
346 pr_err("\tdefault_compr %u\n",
347 (int)le16_to_cpu(sup
->default_compr
));
348 pr_err("\trp_size %llu\n",
349 (unsigned long long)le64_to_cpu(sup
->rp_size
));
350 pr_err("\trp_uid %u\n", le32_to_cpu(sup
->rp_uid
));
351 pr_err("\trp_gid %u\n", le32_to_cpu(sup
->rp_gid
));
352 pr_err("\tfmt_version %u\n", le32_to_cpu(sup
->fmt_version
));
353 pr_err("\ttime_gran %u\n", le32_to_cpu(sup
->time_gran
));
354 pr_err("\tUUID %pUB\n", sup
->uuid
);
359 const struct ubifs_mst_node
*mst
= node
;
361 pr_err("\thighest_inum %llu\n",
362 (unsigned long long)le64_to_cpu(mst
->highest_inum
));
363 pr_err("\tcommit number %llu\n",
364 (unsigned long long)le64_to_cpu(mst
->cmt_no
));
365 pr_err("\tflags %#x\n", le32_to_cpu(mst
->flags
));
366 pr_err("\tlog_lnum %u\n", le32_to_cpu(mst
->log_lnum
));
367 pr_err("\troot_lnum %u\n", le32_to_cpu(mst
->root_lnum
));
368 pr_err("\troot_offs %u\n", le32_to_cpu(mst
->root_offs
));
369 pr_err("\troot_len %u\n", le32_to_cpu(mst
->root_len
));
370 pr_err("\tgc_lnum %u\n", le32_to_cpu(mst
->gc_lnum
));
371 pr_err("\tihead_lnum %u\n", le32_to_cpu(mst
->ihead_lnum
));
372 pr_err("\tihead_offs %u\n", le32_to_cpu(mst
->ihead_offs
));
373 pr_err("\tindex_size %llu\n",
374 (unsigned long long)le64_to_cpu(mst
->index_size
));
375 pr_err("\tlpt_lnum %u\n", le32_to_cpu(mst
->lpt_lnum
));
376 pr_err("\tlpt_offs %u\n", le32_to_cpu(mst
->lpt_offs
));
377 pr_err("\tnhead_lnum %u\n", le32_to_cpu(mst
->nhead_lnum
));
378 pr_err("\tnhead_offs %u\n", le32_to_cpu(mst
->nhead_offs
));
379 pr_err("\tltab_lnum %u\n", le32_to_cpu(mst
->ltab_lnum
));
380 pr_err("\tltab_offs %u\n", le32_to_cpu(mst
->ltab_offs
));
381 pr_err("\tlsave_lnum %u\n", le32_to_cpu(mst
->lsave_lnum
));
382 pr_err("\tlsave_offs %u\n", le32_to_cpu(mst
->lsave_offs
));
383 pr_err("\tlscan_lnum %u\n", le32_to_cpu(mst
->lscan_lnum
));
384 pr_err("\tleb_cnt %u\n", le32_to_cpu(mst
->leb_cnt
));
385 pr_err("\tempty_lebs %u\n", le32_to_cpu(mst
->empty_lebs
));
386 pr_err("\tidx_lebs %u\n", le32_to_cpu(mst
->idx_lebs
));
387 pr_err("\ttotal_free %llu\n",
388 (unsigned long long)le64_to_cpu(mst
->total_free
));
389 pr_err("\ttotal_dirty %llu\n",
390 (unsigned long long)le64_to_cpu(mst
->total_dirty
));
391 pr_err("\ttotal_used %llu\n",
392 (unsigned long long)le64_to_cpu(mst
->total_used
));
393 pr_err("\ttotal_dead %llu\n",
394 (unsigned long long)le64_to_cpu(mst
->total_dead
));
395 pr_err("\ttotal_dark %llu\n",
396 (unsigned long long)le64_to_cpu(mst
->total_dark
));
401 const struct ubifs_ref_node
*ref
= node
;
403 pr_err("\tlnum %u\n", le32_to_cpu(ref
->lnum
));
404 pr_err("\toffs %u\n", le32_to_cpu(ref
->offs
));
405 pr_err("\tjhead %u\n", le32_to_cpu(ref
->jhead
));
410 const struct ubifs_ino_node
*ino
= node
;
412 key_read(c
, &ino
->key
, &key
);
414 dbg_snprintf_key(c
, &key
, key_buf
, DBG_KEY_BUF_LEN
));
415 pr_err("\tcreat_sqnum %llu\n",
416 (unsigned long long)le64_to_cpu(ino
->creat_sqnum
));
417 pr_err("\tsize %llu\n",
418 (unsigned long long)le64_to_cpu(ino
->size
));
419 pr_err("\tnlink %u\n", le32_to_cpu(ino
->nlink
));
420 pr_err("\tatime %lld.%u\n",
421 (long long)le64_to_cpu(ino
->atime_sec
),
422 le32_to_cpu(ino
->atime_nsec
));
423 pr_err("\tmtime %lld.%u\n",
424 (long long)le64_to_cpu(ino
->mtime_sec
),
425 le32_to_cpu(ino
->mtime_nsec
));
426 pr_err("\tctime %lld.%u\n",
427 (long long)le64_to_cpu(ino
->ctime_sec
),
428 le32_to_cpu(ino
->ctime_nsec
));
429 pr_err("\tuid %u\n", le32_to_cpu(ino
->uid
));
430 pr_err("\tgid %u\n", le32_to_cpu(ino
->gid
));
431 pr_err("\tmode %u\n", le32_to_cpu(ino
->mode
));
432 pr_err("\tflags %#x\n", le32_to_cpu(ino
->flags
));
433 pr_err("\txattr_cnt %u\n", le32_to_cpu(ino
->xattr_cnt
));
434 pr_err("\txattr_size %u\n", le32_to_cpu(ino
->xattr_size
));
435 pr_err("\txattr_names %u\n", le32_to_cpu(ino
->xattr_names
));
436 pr_err("\tcompr_type %#x\n",
437 (int)le16_to_cpu(ino
->compr_type
));
438 pr_err("\tdata len %u\n", le32_to_cpu(ino
->data_len
));
441 case UBIFS_DENT_NODE
:
442 case UBIFS_XENT_NODE
:
444 const struct ubifs_dent_node
*dent
= node
;
445 int nlen
= le16_to_cpu(dent
->nlen
);
447 key_read(c
, &dent
->key
, &key
);
449 dbg_snprintf_key(c
, &key
, key_buf
, DBG_KEY_BUF_LEN
));
450 pr_err("\tinum %llu\n",
451 (unsigned long long)le64_to_cpu(dent
->inum
));
452 pr_err("\ttype %d\n", (int)dent
->type
);
453 pr_err("\tnlen %d\n", nlen
);
456 if (nlen
> UBIFS_MAX_NLEN
)
457 pr_err("(bad name length, not printing, bad or corrupted node)");
459 for (i
= 0; i
< nlen
&& dent
->name
[i
]; i
++)
460 pr_cont("%c", isprint(dent
->name
[i
]) ?
461 dent
->name
[i
] : '?');
467 case UBIFS_DATA_NODE
:
469 const struct ubifs_data_node
*dn
= node
;
470 int dlen
= le32_to_cpu(ch
->len
) - UBIFS_DATA_NODE_SZ
;
472 key_read(c
, &dn
->key
, &key
);
474 dbg_snprintf_key(c
, &key
, key_buf
, DBG_KEY_BUF_LEN
));
475 pr_err("\tsize %u\n", le32_to_cpu(dn
->size
));
476 pr_err("\tcompr_typ %d\n",
477 (int)le16_to_cpu(dn
->compr_type
));
478 pr_err("\tdata size %d\n", dlen
);
480 print_hex_dump(KERN_ERR
, "\t", DUMP_PREFIX_OFFSET
, 32, 1,
481 (void *)&dn
->data
, dlen
, 0);
484 case UBIFS_TRUN_NODE
:
486 const struct ubifs_trun_node
*trun
= node
;
488 pr_err("\tinum %u\n", le32_to_cpu(trun
->inum
));
489 pr_err("\told_size %llu\n",
490 (unsigned long long)le64_to_cpu(trun
->old_size
));
491 pr_err("\tnew_size %llu\n",
492 (unsigned long long)le64_to_cpu(trun
->new_size
));
497 const struct ubifs_idx_node
*idx
= node
;
499 n
= le16_to_cpu(idx
->child_cnt
);
500 pr_err("\tchild_cnt %d\n", n
);
501 pr_err("\tlevel %d\n", (int)le16_to_cpu(idx
->level
));
502 pr_err("\tBranches:\n");
504 for (i
= 0; i
< n
&& i
< c
->fanout
- 1; i
++) {
505 const struct ubifs_branch
*br
;
507 br
= ubifs_idx_branch(c
, idx
, i
);
508 key_read(c
, &br
->key
, &key
);
509 pr_err("\t%d: LEB %d:%d len %d key %s\n",
510 i
, le32_to_cpu(br
->lnum
), le32_to_cpu(br
->offs
),
511 le32_to_cpu(br
->len
),
512 dbg_snprintf_key(c
, &key
, key_buf
,
519 case UBIFS_ORPH_NODE
:
521 const struct ubifs_orph_node
*orph
= node
;
523 pr_err("\tcommit number %llu\n",
525 le64_to_cpu(orph
->cmt_no
) & LLONG_MAX
);
526 pr_err("\tlast node flag %llu\n",
527 (unsigned long long)(le64_to_cpu(orph
->cmt_no
)) >> 63);
528 n
= (le32_to_cpu(ch
->len
) - UBIFS_ORPH_NODE_SZ
) >> 3;
529 pr_err("\t%d orphan inode numbers:\n", n
);
530 for (i
= 0; i
< n
; i
++)
531 pr_err("\t ino %llu\n",
532 (unsigned long long)le64_to_cpu(orph
->inos
[i
]));
535 case UBIFS_AUTH_NODE
:
540 pr_err("node type %d was not recognized\n",
543 spin_unlock(&dbg_lock
);
546 void ubifs_dump_budget_req(const struct ubifs_budget_req
*req
)
548 spin_lock(&dbg_lock
);
549 pr_err("Budgeting request: new_ino %d, dirtied_ino %d\n",
550 req
->new_ino
, req
->dirtied_ino
);
551 pr_err("\tnew_ino_d %d, dirtied_ino_d %d\n",
552 req
->new_ino_d
, req
->dirtied_ino_d
);
553 pr_err("\tnew_page %d, dirtied_page %d\n",
554 req
->new_page
, req
->dirtied_page
);
555 pr_err("\tnew_dent %d, mod_dent %d\n",
556 req
->new_dent
, req
->mod_dent
);
557 pr_err("\tidx_growth %d\n", req
->idx_growth
);
558 pr_err("\tdata_growth %d dd_growth %d\n",
559 req
->data_growth
, req
->dd_growth
);
560 spin_unlock(&dbg_lock
);
563 void ubifs_dump_lstats(const struct ubifs_lp_stats
*lst
)
565 spin_lock(&dbg_lock
);
566 pr_err("(pid %d) Lprops statistics: empty_lebs %d, idx_lebs %d\n",
567 current
->pid
, lst
->empty_lebs
, lst
->idx_lebs
);
568 pr_err("\ttaken_empty_lebs %d, total_free %lld, total_dirty %lld\n",
569 lst
->taken_empty_lebs
, lst
->total_free
, lst
->total_dirty
);
570 pr_err("\ttotal_used %lld, total_dark %lld, total_dead %lld\n",
571 lst
->total_used
, lst
->total_dark
, lst
->total_dead
);
572 spin_unlock(&dbg_lock
);
575 void ubifs_dump_budg(struct ubifs_info
*c
, const struct ubifs_budg_info
*bi
)
579 struct ubifs_bud
*bud
;
580 struct ubifs_gced_idx_leb
*idx_gc
;
581 long long available
, outstanding
, free
;
583 spin_lock(&c
->space_lock
);
584 spin_lock(&dbg_lock
);
585 pr_err("(pid %d) Budgeting info: data budget sum %lld, total budget sum %lld\n",
586 current
->pid
, bi
->data_growth
+ bi
->dd_growth
,
587 bi
->data_growth
+ bi
->dd_growth
+ bi
->idx_growth
);
588 pr_err("\tbudg_data_growth %lld, budg_dd_growth %lld, budg_idx_growth %lld\n",
589 bi
->data_growth
, bi
->dd_growth
, bi
->idx_growth
);
590 pr_err("\tmin_idx_lebs %d, old_idx_sz %llu, uncommitted_idx %lld\n",
591 bi
->min_idx_lebs
, bi
->old_idx_sz
, bi
->uncommitted_idx
);
592 pr_err("\tpage_budget %d, inode_budget %d, dent_budget %d\n",
593 bi
->page_budget
, bi
->inode_budget
, bi
->dent_budget
);
594 pr_err("\tnospace %u, nospace_rp %u\n", bi
->nospace
, bi
->nospace_rp
);
595 pr_err("\tdark_wm %d, dead_wm %d, max_idx_node_sz %d\n",
596 c
->dark_wm
, c
->dead_wm
, c
->max_idx_node_sz
);
600 * If we are dumping saved budgeting data, do not print
601 * additional information which is about the current state, not
602 * the old one which corresponded to the saved budgeting data.
606 pr_err("\tfreeable_cnt %d, calc_idx_sz %lld, idx_gc_cnt %d\n",
607 c
->freeable_cnt
, c
->calc_idx_sz
, c
->idx_gc_cnt
);
608 pr_err("\tdirty_pg_cnt %ld, dirty_zn_cnt %ld, clean_zn_cnt %ld\n",
609 atomic_long_read(&c
->dirty_pg_cnt
),
610 atomic_long_read(&c
->dirty_zn_cnt
),
611 atomic_long_read(&c
->clean_zn_cnt
));
612 pr_err("\tgc_lnum %d, ihead_lnum %d\n", c
->gc_lnum
, c
->ihead_lnum
);
614 /* If we are in R/O mode, journal heads do not exist */
616 for (i
= 0; i
< c
->jhead_cnt
; i
++)
617 pr_err("\tjhead %s\t LEB %d\n",
618 dbg_jhead(c
->jheads
[i
].wbuf
.jhead
),
619 c
->jheads
[i
].wbuf
.lnum
);
620 for (rb
= rb_first(&c
->buds
); rb
; rb
= rb_next(rb
)) {
621 bud
= rb_entry(rb
, struct ubifs_bud
, rb
);
622 pr_err("\tbud LEB %d\n", bud
->lnum
);
624 list_for_each_entry(bud
, &c
->old_buds
, list
)
625 pr_err("\told bud LEB %d\n", bud
->lnum
);
626 list_for_each_entry(idx_gc
, &c
->idx_gc
, list
)
627 pr_err("\tGC'ed idx LEB %d unmap %d\n",
628 idx_gc
->lnum
, idx_gc
->unmap
);
629 pr_err("\tcommit state %d\n", c
->cmt_state
);
631 /* Print budgeting predictions */
632 available
= ubifs_calc_available(c
, c
->bi
.min_idx_lebs
);
633 outstanding
= c
->bi
.data_growth
+ c
->bi
.dd_growth
;
634 free
= ubifs_get_free_space_nolock(c
);
635 pr_err("Budgeting predictions:\n");
636 pr_err("\tavailable: %lld, outstanding %lld, free %lld\n",
637 available
, outstanding
, free
);
639 spin_unlock(&dbg_lock
);
640 spin_unlock(&c
->space_lock
);
643 void ubifs_dump_lprop(const struct ubifs_info
*c
, const struct ubifs_lprops
*lp
)
645 int i
, spc
, dark
= 0, dead
= 0;
647 struct ubifs_bud
*bud
;
649 spc
= lp
->free
+ lp
->dirty
;
650 if (spc
< c
->dead_wm
)
653 dark
= ubifs_calc_dark(c
, spc
);
655 if (lp
->flags
& LPROPS_INDEX
)
656 pr_err("LEB %-7d free %-8d dirty %-8d used %-8d free + dirty %-8d flags %#x (",
657 lp
->lnum
, lp
->free
, lp
->dirty
, c
->leb_size
- spc
, spc
,
660 pr_err("LEB %-7d free %-8d dirty %-8d used %-8d free + dirty %-8d dark %-4d dead %-4d nodes fit %-3d flags %#-4x (",
661 lp
->lnum
, lp
->free
, lp
->dirty
, c
->leb_size
- spc
, spc
,
662 dark
, dead
, (int)(spc
/ UBIFS_MAX_NODE_SZ
), lp
->flags
);
664 if (lp
->flags
& LPROPS_TAKEN
) {
665 if (lp
->flags
& LPROPS_INDEX
)
666 pr_cont("index, taken");
672 if (lp
->flags
& LPROPS_INDEX
) {
673 switch (lp
->flags
& LPROPS_CAT_MASK
) {
674 case LPROPS_DIRTY_IDX
:
677 case LPROPS_FRDI_IDX
:
678 s
= "freeable index";
684 switch (lp
->flags
& LPROPS_CAT_MASK
) {
686 s
= "not categorized";
697 case LPROPS_FREEABLE
:
708 for (rb
= rb_first((struct rb_root
*)&c
->buds
); rb
; rb
= rb_next(rb
)) {
709 bud
= rb_entry(rb
, struct ubifs_bud
, rb
);
710 if (bud
->lnum
== lp
->lnum
) {
712 for (i
= 0; i
< c
->jhead_cnt
; i
++) {
714 * Note, if we are in R/O mode or in the middle
715 * of mounting/re-mounting, the write-buffers do
719 lp
->lnum
== c
->jheads
[i
].wbuf
.lnum
) {
720 pr_cont(", jhead %s", dbg_jhead(i
));
725 pr_cont(", bud of jhead %s",
726 dbg_jhead(bud
->jhead
));
729 if (lp
->lnum
== c
->gc_lnum
)
734 void ubifs_dump_lprops(struct ubifs_info
*c
)
737 struct ubifs_lprops lp
;
738 struct ubifs_lp_stats lst
;
740 pr_err("(pid %d) start dumping LEB properties\n", current
->pid
);
741 ubifs_get_lp_stats(c
, &lst
);
742 ubifs_dump_lstats(&lst
);
744 for (lnum
= c
->main_first
; lnum
< c
->leb_cnt
; lnum
++) {
745 err
= ubifs_read_one_lp(c
, lnum
, &lp
);
747 ubifs_err(c
, "cannot read lprops for LEB %d", lnum
);
751 ubifs_dump_lprop(c
, &lp
);
753 pr_err("(pid %d) finish dumping LEB properties\n", current
->pid
);
756 void ubifs_dump_lpt_info(struct ubifs_info
*c
)
760 spin_lock(&dbg_lock
);
761 pr_err("(pid %d) dumping LPT information\n", current
->pid
);
762 pr_err("\tlpt_sz: %lld\n", c
->lpt_sz
);
763 pr_err("\tpnode_sz: %d\n", c
->pnode_sz
);
764 pr_err("\tnnode_sz: %d\n", c
->nnode_sz
);
765 pr_err("\tltab_sz: %d\n", c
->ltab_sz
);
766 pr_err("\tlsave_sz: %d\n", c
->lsave_sz
);
767 pr_err("\tbig_lpt: %d\n", c
->big_lpt
);
768 pr_err("\tlpt_hght: %d\n", c
->lpt_hght
);
769 pr_err("\tpnode_cnt: %d\n", c
->pnode_cnt
);
770 pr_err("\tnnode_cnt: %d\n", c
->nnode_cnt
);
771 pr_err("\tdirty_pn_cnt: %d\n", c
->dirty_pn_cnt
);
772 pr_err("\tdirty_nn_cnt: %d\n", c
->dirty_nn_cnt
);
773 pr_err("\tlsave_cnt: %d\n", c
->lsave_cnt
);
774 pr_err("\tspace_bits: %d\n", c
->space_bits
);
775 pr_err("\tlpt_lnum_bits: %d\n", c
->lpt_lnum_bits
);
776 pr_err("\tlpt_offs_bits: %d\n", c
->lpt_offs_bits
);
777 pr_err("\tlpt_spc_bits: %d\n", c
->lpt_spc_bits
);
778 pr_err("\tpcnt_bits: %d\n", c
->pcnt_bits
);
779 pr_err("\tlnum_bits: %d\n", c
->lnum_bits
);
780 pr_err("\tLPT root is at %d:%d\n", c
->lpt_lnum
, c
->lpt_offs
);
781 pr_err("\tLPT head is at %d:%d\n",
782 c
->nhead_lnum
, c
->nhead_offs
);
783 pr_err("\tLPT ltab is at %d:%d\n", c
->ltab_lnum
, c
->ltab_offs
);
785 pr_err("\tLPT lsave is at %d:%d\n",
786 c
->lsave_lnum
, c
->lsave_offs
);
787 for (i
= 0; i
< c
->lpt_lebs
; i
++)
788 pr_err("\tLPT LEB %d free %d dirty %d tgc %d cmt %d\n",
789 i
+ c
->lpt_first
, c
->ltab
[i
].free
, c
->ltab
[i
].dirty
,
790 c
->ltab
[i
].tgc
, c
->ltab
[i
].cmt
);
791 spin_unlock(&dbg_lock
);
794 void ubifs_dump_sleb(const struct ubifs_info
*c
,
795 const struct ubifs_scan_leb
*sleb
, int offs
)
797 struct ubifs_scan_node
*snod
;
799 pr_err("(pid %d) start dumping scanned data from LEB %d:%d\n",
800 current
->pid
, sleb
->lnum
, offs
);
802 list_for_each_entry(snod
, &sleb
->nodes
, list
) {
804 pr_err("Dumping node at LEB %d:%d len %d\n",
805 sleb
->lnum
, snod
->offs
, snod
->len
);
806 ubifs_dump_node(c
, snod
->node
);
810 void ubifs_dump_leb(const struct ubifs_info
*c
, int lnum
)
812 struct ubifs_scan_leb
*sleb
;
813 struct ubifs_scan_node
*snod
;
816 pr_err("(pid %d) start dumping LEB %d\n", current
->pid
, lnum
);
818 buf
= __vmalloc(c
->leb_size
, GFP_NOFS
);
820 ubifs_err(c
, "cannot allocate memory for dumping LEB %d", lnum
);
824 sleb
= ubifs_scan(c
, lnum
, 0, buf
, 0);
826 ubifs_err(c
, "scan error %d", (int)PTR_ERR(sleb
));
830 pr_err("LEB %d has %d nodes ending at %d\n", lnum
,
831 sleb
->nodes_cnt
, sleb
->endpt
);
833 list_for_each_entry(snod
, &sleb
->nodes
, list
) {
835 pr_err("Dumping node at LEB %d:%d len %d\n", lnum
,
836 snod
->offs
, snod
->len
);
837 ubifs_dump_node(c
, snod
->node
);
840 pr_err("(pid %d) finish dumping LEB %d\n", current
->pid
, lnum
);
841 ubifs_scan_destroy(sleb
);
848 void ubifs_dump_znode(const struct ubifs_info
*c
,
849 const struct ubifs_znode
*znode
)
852 const struct ubifs_zbranch
*zbr
;
853 char key_buf
[DBG_KEY_BUF_LEN
];
855 spin_lock(&dbg_lock
);
857 zbr
= &znode
->parent
->zbranch
[znode
->iip
];
861 pr_err("znode %p, LEB %d:%d len %d parent %p iip %d level %d child_cnt %d flags %lx\n",
862 znode
, zbr
->lnum
, zbr
->offs
, zbr
->len
, znode
->parent
, znode
->iip
,
863 znode
->level
, znode
->child_cnt
, znode
->flags
);
865 if (znode
->child_cnt
<= 0 || znode
->child_cnt
> c
->fanout
) {
866 spin_unlock(&dbg_lock
);
870 pr_err("zbranches:\n");
871 for (n
= 0; n
< znode
->child_cnt
; n
++) {
872 zbr
= &znode
->zbranch
[n
];
873 if (znode
->level
> 0)
874 pr_err("\t%d: znode %p LEB %d:%d len %d key %s\n",
875 n
, zbr
->znode
, zbr
->lnum
, zbr
->offs
, zbr
->len
,
876 dbg_snprintf_key(c
, &zbr
->key
, key_buf
,
879 pr_err("\t%d: LNC %p LEB %d:%d len %d key %s\n",
880 n
, zbr
->znode
, zbr
->lnum
, zbr
->offs
, zbr
->len
,
881 dbg_snprintf_key(c
, &zbr
->key
, key_buf
,
884 spin_unlock(&dbg_lock
);
887 void ubifs_dump_heap(struct ubifs_info
*c
, struct ubifs_lpt_heap
*heap
, int cat
)
891 pr_err("(pid %d) start dumping heap cat %d (%d elements)\n",
892 current
->pid
, cat
, heap
->cnt
);
893 for (i
= 0; i
< heap
->cnt
; i
++) {
894 struct ubifs_lprops
*lprops
= heap
->arr
[i
];
896 pr_err("\t%d. LEB %d hpos %d free %d dirty %d flags %d\n",
897 i
, lprops
->lnum
, lprops
->hpos
, lprops
->free
,
898 lprops
->dirty
, lprops
->flags
);
900 pr_err("(pid %d) finish dumping heap\n", current
->pid
);
903 void ubifs_dump_pnode(struct ubifs_info
*c
, struct ubifs_pnode
*pnode
,
904 struct ubifs_nnode
*parent
, int iip
)
908 pr_err("(pid %d) dumping pnode:\n", current
->pid
);
909 pr_err("\taddress %zx parent %zx cnext %zx\n",
910 (size_t)pnode
, (size_t)parent
, (size_t)pnode
->cnext
);
911 pr_err("\tflags %lu iip %d level %d num %d\n",
912 pnode
->flags
, iip
, pnode
->level
, pnode
->num
);
913 for (i
= 0; i
< UBIFS_LPT_FANOUT
; i
++) {
914 struct ubifs_lprops
*lp
= &pnode
->lprops
[i
];
916 pr_err("\t%d: free %d dirty %d flags %d lnum %d\n",
917 i
, lp
->free
, lp
->dirty
, lp
->flags
, lp
->lnum
);
921 void ubifs_dump_tnc(struct ubifs_info
*c
)
923 struct ubifs_znode
*znode
;
927 pr_err("(pid %d) start dumping TNC tree\n", current
->pid
);
928 znode
= ubifs_tnc_levelorder_next(c
, c
->zroot
.znode
, NULL
);
929 level
= znode
->level
;
930 pr_err("== Level %d ==\n", level
);
932 if (level
!= znode
->level
) {
933 level
= znode
->level
;
934 pr_err("== Level %d ==\n", level
);
936 ubifs_dump_znode(c
, znode
);
937 znode
= ubifs_tnc_levelorder_next(c
, c
->zroot
.znode
, znode
);
939 pr_err("(pid %d) finish dumping TNC tree\n", current
->pid
);
942 static int dump_znode(struct ubifs_info
*c
, struct ubifs_znode
*znode
,
945 ubifs_dump_znode(c
, znode
);
950 * ubifs_dump_index - dump the on-flash index.
951 * @c: UBIFS file-system description object
953 * This function dumps whole UBIFS indexing B-tree, unlike 'ubifs_dump_tnc()'
954 * which dumps only in-memory znodes and does not read znodes which from flash.
956 void ubifs_dump_index(struct ubifs_info
*c
)
958 dbg_walk_index(c
, NULL
, dump_znode
, NULL
);
962 * dbg_save_space_info - save information about flash space.
963 * @c: UBIFS file-system description object
965 * This function saves information about UBIFS free space, dirty space, etc, in
966 * order to check it later.
968 void dbg_save_space_info(struct ubifs_info
*c
)
970 struct ubifs_debug_info
*d
= c
->dbg
;
973 spin_lock(&c
->space_lock
);
974 memcpy(&d
->saved_lst
, &c
->lst
, sizeof(struct ubifs_lp_stats
));
975 memcpy(&d
->saved_bi
, &c
->bi
, sizeof(struct ubifs_budg_info
));
976 d
->saved_idx_gc_cnt
= c
->idx_gc_cnt
;
979 * We use a dirty hack here and zero out @c->freeable_cnt, because it
980 * affects the free space calculations, and UBIFS might not know about
981 * all freeable eraseblocks. Indeed, we know about freeable eraseblocks
982 * only when we read their lprops, and we do this only lazily, upon the
983 * need. So at any given point of time @c->freeable_cnt might be not
986 * Just one example about the issue we hit when we did not zero
988 * 1. The file-system is mounted R/O, c->freeable_cnt is %0. We save the
989 * amount of free space in @d->saved_free
990 * 2. We re-mount R/W, which makes UBIFS to read the "lsave"
991 * information from flash, where we cache LEBs from various
992 * categories ('ubifs_remount_fs()' -> 'ubifs_lpt_init()'
993 * -> 'lpt_init_wr()' -> 'read_lsave()' -> 'ubifs_lpt_lookup()'
994 * -> 'ubifs_get_pnode()' -> 'update_cats()'
995 * -> 'ubifs_add_to_cat()').
996 * 3. Lsave contains a freeable eraseblock, and @c->freeable_cnt
998 * 4. We calculate the amount of free space when the re-mount is
999 * finished in 'dbg_check_space_info()' and it does not match
1002 freeable_cnt
= c
->freeable_cnt
;
1003 c
->freeable_cnt
= 0;
1004 d
->saved_free
= ubifs_get_free_space_nolock(c
);
1005 c
->freeable_cnt
= freeable_cnt
;
1006 spin_unlock(&c
->space_lock
);
1010 * dbg_check_space_info - check flash space information.
1011 * @c: UBIFS file-system description object
1013 * This function compares current flash space information with the information
1014 * which was saved when the 'dbg_save_space_info()' function was called.
1015 * Returns zero if the information has not changed, and %-EINVAL it it has
1018 int dbg_check_space_info(struct ubifs_info
*c
)
1020 struct ubifs_debug_info
*d
= c
->dbg
;
1021 struct ubifs_lp_stats lst
;
1025 spin_lock(&c
->space_lock
);
1026 freeable_cnt
= c
->freeable_cnt
;
1027 c
->freeable_cnt
= 0;
1028 free
= ubifs_get_free_space_nolock(c
);
1029 c
->freeable_cnt
= freeable_cnt
;
1030 spin_unlock(&c
->space_lock
);
1032 if (free
!= d
->saved_free
) {
1033 ubifs_err(c
, "free space changed from %lld to %lld",
1034 d
->saved_free
, free
);
1041 ubifs_msg(c
, "saved lprops statistics dump");
1042 ubifs_dump_lstats(&d
->saved_lst
);
1043 ubifs_msg(c
, "saved budgeting info dump");
1044 ubifs_dump_budg(c
, &d
->saved_bi
);
1045 ubifs_msg(c
, "saved idx_gc_cnt %d", d
->saved_idx_gc_cnt
);
1046 ubifs_msg(c
, "current lprops statistics dump");
1047 ubifs_get_lp_stats(c
, &lst
);
1048 ubifs_dump_lstats(&lst
);
1049 ubifs_msg(c
, "current budgeting info dump");
1050 ubifs_dump_budg(c
, &c
->bi
);
1056 * dbg_check_synced_i_size - check synchronized inode size.
1057 * @c: UBIFS file-system description object
1058 * @inode: inode to check
1060 * If inode is clean, synchronized inode size has to be equivalent to current
1061 * inode size. This function has to be called only for locked inodes (@i_mutex
1062 * has to be locked). Returns %0 if synchronized inode size if correct, and
1065 int dbg_check_synced_i_size(const struct ubifs_info
*c
, struct inode
*inode
)
1068 struct ubifs_inode
*ui
= ubifs_inode(inode
);
1070 if (!dbg_is_chk_gen(c
))
1072 if (!S_ISREG(inode
->i_mode
))
1075 mutex_lock(&ui
->ui_mutex
);
1076 spin_lock(&ui
->ui_lock
);
1077 if (ui
->ui_size
!= ui
->synced_i_size
&& !ui
->dirty
) {
1078 ubifs_err(c
, "ui_size is %lld, synced_i_size is %lld, but inode is clean",
1079 ui
->ui_size
, ui
->synced_i_size
);
1080 ubifs_err(c
, "i_ino %lu, i_mode %#x, i_size %lld", inode
->i_ino
,
1081 inode
->i_mode
, i_size_read(inode
));
1085 spin_unlock(&ui
->ui_lock
);
1086 mutex_unlock(&ui
->ui_mutex
);
1091 * dbg_check_dir - check directory inode size and link count.
1092 * @c: UBIFS file-system description object
1093 * @dir: the directory to calculate size for
1094 * @size: the result is returned here
1096 * This function makes sure that directory size and link count are correct.
1097 * Returns zero in case of success and a negative error code in case of
1100 * Note, it is good idea to make sure the @dir->i_mutex is locked before
1101 * calling this function.
1103 int dbg_check_dir(struct ubifs_info
*c
, const struct inode
*dir
)
1105 unsigned int nlink
= 2;
1106 union ubifs_key key
;
1107 struct ubifs_dent_node
*dent
, *pdent
= NULL
;
1108 struct fscrypt_name nm
= {0};
1109 loff_t size
= UBIFS_INO_NODE_SZ
;
1111 if (!dbg_is_chk_gen(c
))
1114 if (!S_ISDIR(dir
->i_mode
))
1117 lowest_dent_key(c
, &key
, dir
->i_ino
);
1121 dent
= ubifs_tnc_next_ent(c
, &key
, &nm
);
1123 err
= PTR_ERR(dent
);
1130 fname_name(&nm
) = dent
->name
;
1131 fname_len(&nm
) = le16_to_cpu(dent
->nlen
);
1132 size
+= CALC_DENT_SIZE(fname_len(&nm
));
1133 if (dent
->type
== UBIFS_ITYPE_DIR
)
1137 key_read(c
, &dent
->key
, &key
);
1141 if (i_size_read(dir
) != size
) {
1142 ubifs_err(c
, "directory inode %lu has size %llu, but calculated size is %llu",
1143 dir
->i_ino
, (unsigned long long)i_size_read(dir
),
1144 (unsigned long long)size
);
1145 ubifs_dump_inode(c
, dir
);
1149 if (dir
->i_nlink
!= nlink
) {
1150 ubifs_err(c
, "directory inode %lu has nlink %u, but calculated nlink is %u",
1151 dir
->i_ino
, dir
->i_nlink
, nlink
);
1152 ubifs_dump_inode(c
, dir
);
1161 * dbg_check_key_order - make sure that colliding keys are properly ordered.
1162 * @c: UBIFS file-system description object
1163 * @zbr1: first zbranch
1164 * @zbr2: following zbranch
1166 * In UBIFS indexing B-tree colliding keys has to be sorted in binary order of
1167 * names of the direntries/xentries which are referred by the keys. This
1168 * function reads direntries/xentries referred by @zbr1 and @zbr2 and makes
1169 * sure the name of direntry/xentry referred by @zbr1 is less than
1170 * direntry/xentry referred by @zbr2. Returns zero if this is true, %1 if not,
1171 * and a negative error code in case of failure.
1173 static int dbg_check_key_order(struct ubifs_info
*c
, struct ubifs_zbranch
*zbr1
,
1174 struct ubifs_zbranch
*zbr2
)
1176 int err
, nlen1
, nlen2
, cmp
;
1177 struct ubifs_dent_node
*dent1
, *dent2
;
1178 union ubifs_key key
;
1179 char key_buf
[DBG_KEY_BUF_LEN
];
1181 ubifs_assert(c
, !keys_cmp(c
, &zbr1
->key
, &zbr2
->key
));
1182 dent1
= kmalloc(UBIFS_MAX_DENT_NODE_SZ
, GFP_NOFS
);
1185 dent2
= kmalloc(UBIFS_MAX_DENT_NODE_SZ
, GFP_NOFS
);
1191 err
= ubifs_tnc_read_node(c
, zbr1
, dent1
);
1194 err
= ubifs_validate_entry(c
, dent1
);
1198 err
= ubifs_tnc_read_node(c
, zbr2
, dent2
);
1201 err
= ubifs_validate_entry(c
, dent2
);
1205 /* Make sure node keys are the same as in zbranch */
1207 key_read(c
, &dent1
->key
, &key
);
1208 if (keys_cmp(c
, &zbr1
->key
, &key
)) {
1209 ubifs_err(c
, "1st entry at %d:%d has key %s", zbr1
->lnum
,
1210 zbr1
->offs
, dbg_snprintf_key(c
, &key
, key_buf
,
1212 ubifs_err(c
, "but it should have key %s according to tnc",
1213 dbg_snprintf_key(c
, &zbr1
->key
, key_buf
,
1215 ubifs_dump_node(c
, dent1
);
1219 key_read(c
, &dent2
->key
, &key
);
1220 if (keys_cmp(c
, &zbr2
->key
, &key
)) {
1221 ubifs_err(c
, "2nd entry at %d:%d has key %s", zbr1
->lnum
,
1222 zbr1
->offs
, dbg_snprintf_key(c
, &key
, key_buf
,
1224 ubifs_err(c
, "but it should have key %s according to tnc",
1225 dbg_snprintf_key(c
, &zbr2
->key
, key_buf
,
1227 ubifs_dump_node(c
, dent2
);
1231 nlen1
= le16_to_cpu(dent1
->nlen
);
1232 nlen2
= le16_to_cpu(dent2
->nlen
);
1234 cmp
= memcmp(dent1
->name
, dent2
->name
, min_t(int, nlen1
, nlen2
));
1235 if (cmp
< 0 || (cmp
== 0 && nlen1
< nlen2
)) {
1239 if (cmp
== 0 && nlen1
== nlen2
)
1240 ubifs_err(c
, "2 xent/dent nodes with the same name");
1242 ubifs_err(c
, "bad order of colliding key %s",
1243 dbg_snprintf_key(c
, &key
, key_buf
, DBG_KEY_BUF_LEN
));
1245 ubifs_msg(c
, "first node at %d:%d\n", zbr1
->lnum
, zbr1
->offs
);
1246 ubifs_dump_node(c
, dent1
);
1247 ubifs_msg(c
, "second node at %d:%d\n", zbr2
->lnum
, zbr2
->offs
);
1248 ubifs_dump_node(c
, dent2
);
1257 * dbg_check_znode - check if znode is all right.
1258 * @c: UBIFS file-system description object
1259 * @zbr: zbranch which points to this znode
1261 * This function makes sure that znode referred to by @zbr is all right.
1262 * Returns zero if it is, and %-EINVAL if it is not.
1264 static int dbg_check_znode(struct ubifs_info
*c
, struct ubifs_zbranch
*zbr
)
1266 struct ubifs_znode
*znode
= zbr
->znode
;
1267 struct ubifs_znode
*zp
= znode
->parent
;
1270 if (znode
->child_cnt
<= 0 || znode
->child_cnt
> c
->fanout
) {
1274 if (znode
->level
< 0) {
1278 if (znode
->iip
< 0 || znode
->iip
>= c
->fanout
) {
1284 /* Only dirty zbranch may have no on-flash nodes */
1285 if (!ubifs_zn_dirty(znode
)) {
1290 if (ubifs_zn_dirty(znode
)) {
1292 * If znode is dirty, its parent has to be dirty as well. The
1293 * order of the operation is important, so we have to have
1297 if (zp
&& !ubifs_zn_dirty(zp
)) {
1299 * The dirty flag is atomic and is cleared outside the
1300 * TNC mutex, so znode's dirty flag may now have
1301 * been cleared. The child is always cleared before the
1302 * parent, so we just need to check again.
1305 if (ubifs_zn_dirty(znode
)) {
1313 const union ubifs_key
*min
, *max
;
1315 if (znode
->level
!= zp
->level
- 1) {
1320 /* Make sure the 'parent' pointer in our znode is correct */
1321 err
= ubifs_search_zbranch(c
, zp
, &zbr
->key
, &n
);
1323 /* This zbranch does not exist in the parent */
1328 if (znode
->iip
>= zp
->child_cnt
) {
1333 if (znode
->iip
!= n
) {
1334 /* This may happen only in case of collisions */
1335 if (keys_cmp(c
, &zp
->zbranch
[n
].key
,
1336 &zp
->zbranch
[znode
->iip
].key
)) {
1344 * Make sure that the first key in our znode is greater than or
1345 * equal to the key in the pointing zbranch.
1348 cmp
= keys_cmp(c
, min
, &znode
->zbranch
[0].key
);
1354 if (n
+ 1 < zp
->child_cnt
) {
1355 max
= &zp
->zbranch
[n
+ 1].key
;
1358 * Make sure the last key in our znode is less or
1359 * equivalent than the key in the zbranch which goes
1360 * after our pointing zbranch.
1362 cmp
= keys_cmp(c
, max
,
1363 &znode
->zbranch
[znode
->child_cnt
- 1].key
);
1370 /* This may only be root znode */
1371 if (zbr
!= &c
->zroot
) {
1378 * Make sure that next key is greater or equivalent then the previous
1381 for (n
= 1; n
< znode
->child_cnt
; n
++) {
1382 cmp
= keys_cmp(c
, &znode
->zbranch
[n
- 1].key
,
1383 &znode
->zbranch
[n
].key
);
1389 /* This can only be keys with colliding hash */
1390 if (!is_hash_key(c
, &znode
->zbranch
[n
].key
)) {
1395 if (znode
->level
!= 0 || c
->replaying
)
1399 * Colliding keys should follow binary order of
1400 * corresponding xentry/dentry names.
1402 err
= dbg_check_key_order(c
, &znode
->zbranch
[n
- 1],
1403 &znode
->zbranch
[n
]);
1413 for (n
= 0; n
< znode
->child_cnt
; n
++) {
1414 if (!znode
->zbranch
[n
].znode
&&
1415 (znode
->zbranch
[n
].lnum
== 0 ||
1416 znode
->zbranch
[n
].len
== 0)) {
1421 if (znode
->zbranch
[n
].lnum
!= 0 &&
1422 znode
->zbranch
[n
].len
== 0) {
1427 if (znode
->zbranch
[n
].lnum
== 0 &&
1428 znode
->zbranch
[n
].len
!= 0) {
1433 if (znode
->zbranch
[n
].lnum
== 0 &&
1434 znode
->zbranch
[n
].offs
!= 0) {
1439 if (znode
->level
!= 0 && znode
->zbranch
[n
].znode
)
1440 if (znode
->zbranch
[n
].znode
->parent
!= znode
) {
1449 ubifs_err(c
, "failed, error %d", err
);
1450 ubifs_msg(c
, "dump of the znode");
1451 ubifs_dump_znode(c
, znode
);
1453 ubifs_msg(c
, "dump of the parent znode");
1454 ubifs_dump_znode(c
, zp
);
1461 * dbg_check_tnc - check TNC tree.
1462 * @c: UBIFS file-system description object
1463 * @extra: do extra checks that are possible at start commit
1465 * This function traverses whole TNC tree and checks every znode. Returns zero
1466 * if everything is all right and %-EINVAL if something is wrong with TNC.
1468 int dbg_check_tnc(struct ubifs_info
*c
, int extra
)
1470 struct ubifs_znode
*znode
;
1471 long clean_cnt
= 0, dirty_cnt
= 0;
1474 if (!dbg_is_chk_index(c
))
1477 ubifs_assert(c
, mutex_is_locked(&c
->tnc_mutex
));
1478 if (!c
->zroot
.znode
)
1481 znode
= ubifs_tnc_postorder_first(c
->zroot
.znode
);
1483 struct ubifs_znode
*prev
;
1484 struct ubifs_zbranch
*zbr
;
1489 zbr
= &znode
->parent
->zbranch
[znode
->iip
];
1491 err
= dbg_check_znode(c
, zbr
);
1496 if (ubifs_zn_dirty(znode
))
1503 znode
= ubifs_tnc_postorder_next(c
, znode
);
1508 * If the last key of this znode is equivalent to the first key
1509 * of the next znode (collision), then check order of the keys.
1511 last
= prev
->child_cnt
- 1;
1512 if (prev
->level
== 0 && znode
->level
== 0 && !c
->replaying
&&
1513 !keys_cmp(c
, &prev
->zbranch
[last
].key
,
1514 &znode
->zbranch
[0].key
)) {
1515 err
= dbg_check_key_order(c
, &prev
->zbranch
[last
],
1516 &znode
->zbranch
[0]);
1520 ubifs_msg(c
, "first znode");
1521 ubifs_dump_znode(c
, prev
);
1522 ubifs_msg(c
, "second znode");
1523 ubifs_dump_znode(c
, znode
);
1530 if (clean_cnt
!= atomic_long_read(&c
->clean_zn_cnt
)) {
1531 ubifs_err(c
, "incorrect clean_zn_cnt %ld, calculated %ld",
1532 atomic_long_read(&c
->clean_zn_cnt
),
1536 if (dirty_cnt
!= atomic_long_read(&c
->dirty_zn_cnt
)) {
1537 ubifs_err(c
, "incorrect dirty_zn_cnt %ld, calculated %ld",
1538 atomic_long_read(&c
->dirty_zn_cnt
),
1548 * dbg_walk_index - walk the on-flash index.
1549 * @c: UBIFS file-system description object
1550 * @leaf_cb: called for each leaf node
1551 * @znode_cb: called for each indexing node
1552 * @priv: private data which is passed to callbacks
1554 * This function walks the UBIFS index and calls the @leaf_cb for each leaf
1555 * node and @znode_cb for each indexing node. Returns zero in case of success
1556 * and a negative error code in case of failure.
1558 * It would be better if this function removed every znode it pulled to into
1559 * the TNC, so that the behavior more closely matched the non-debugging
1562 int dbg_walk_index(struct ubifs_info
*c
, dbg_leaf_callback leaf_cb
,
1563 dbg_znode_callback znode_cb
, void *priv
)
1566 struct ubifs_zbranch
*zbr
;
1567 struct ubifs_znode
*znode
, *child
;
1569 mutex_lock(&c
->tnc_mutex
);
1570 /* If the root indexing node is not in TNC - pull it */
1571 if (!c
->zroot
.znode
) {
1572 c
->zroot
.znode
= ubifs_load_znode(c
, &c
->zroot
, NULL
, 0);
1573 if (IS_ERR(c
->zroot
.znode
)) {
1574 err
= PTR_ERR(c
->zroot
.znode
);
1575 c
->zroot
.znode
= NULL
;
1581 * We are going to traverse the indexing tree in the postorder manner.
1582 * Go down and find the leftmost indexing node where we are going to
1585 znode
= c
->zroot
.znode
;
1586 while (znode
->level
> 0) {
1587 zbr
= &znode
->zbranch
[0];
1590 child
= ubifs_load_znode(c
, zbr
, znode
, 0);
1591 if (IS_ERR(child
)) {
1592 err
= PTR_ERR(child
);
1600 /* Iterate over all indexing nodes */
1607 err
= znode_cb(c
, znode
, priv
);
1609 ubifs_err(c
, "znode checking function returned error %d",
1611 ubifs_dump_znode(c
, znode
);
1615 if (leaf_cb
&& znode
->level
== 0) {
1616 for (idx
= 0; idx
< znode
->child_cnt
; idx
++) {
1617 zbr
= &znode
->zbranch
[idx
];
1618 err
= leaf_cb(c
, zbr
, priv
);
1620 ubifs_err(c
, "leaf checking function returned error %d, for leaf at LEB %d:%d",
1621 err
, zbr
->lnum
, zbr
->offs
);
1630 idx
= znode
->iip
+ 1;
1631 znode
= znode
->parent
;
1632 if (idx
< znode
->child_cnt
) {
1633 /* Switch to the next index in the parent */
1634 zbr
= &znode
->zbranch
[idx
];
1637 child
= ubifs_load_znode(c
, zbr
, znode
, idx
);
1638 if (IS_ERR(child
)) {
1639 err
= PTR_ERR(child
);
1647 * This is the last child, switch to the parent and
1652 /* Go to the lowest leftmost znode in the new sub-tree */
1653 while (znode
->level
> 0) {
1654 zbr
= &znode
->zbranch
[0];
1657 child
= ubifs_load_znode(c
, zbr
, znode
, 0);
1658 if (IS_ERR(child
)) {
1659 err
= PTR_ERR(child
);
1668 mutex_unlock(&c
->tnc_mutex
);
1673 zbr
= &znode
->parent
->zbranch
[znode
->iip
];
1676 ubifs_msg(c
, "dump of znode at LEB %d:%d", zbr
->lnum
, zbr
->offs
);
1677 ubifs_dump_znode(c
, znode
);
1679 mutex_unlock(&c
->tnc_mutex
);
1684 * add_size - add znode size to partially calculated index size.
1685 * @c: UBIFS file-system description object
1686 * @znode: znode to add size for
1687 * @priv: partially calculated index size
1689 * This is a helper function for 'dbg_check_idx_size()' which is called for
1690 * every indexing node and adds its size to the 'long long' variable pointed to
1693 static int add_size(struct ubifs_info
*c
, struct ubifs_znode
*znode
, void *priv
)
1695 long long *idx_size
= priv
;
1698 add
= ubifs_idx_node_sz(c
, znode
->child_cnt
);
1699 add
= ALIGN(add
, 8);
1705 * dbg_check_idx_size - check index size.
1706 * @c: UBIFS file-system description object
1707 * @idx_size: size to check
1709 * This function walks the UBIFS index, calculates its size and checks that the
1710 * size is equivalent to @idx_size. Returns zero in case of success and a
1711 * negative error code in case of failure.
1713 int dbg_check_idx_size(struct ubifs_info
*c
, long long idx_size
)
1718 if (!dbg_is_chk_index(c
))
1721 err
= dbg_walk_index(c
, NULL
, add_size
, &calc
);
1723 ubifs_err(c
, "error %d while walking the index", err
);
1727 if (calc
!= idx_size
) {
1728 ubifs_err(c
, "index size check failed: calculated size is %lld, should be %lld",
1738 * struct fsck_inode - information about an inode used when checking the file-system.
1739 * @rb: link in the RB-tree of inodes
1740 * @inum: inode number
1741 * @mode: inode type, permissions, etc
1742 * @nlink: inode link count
1743 * @xattr_cnt: count of extended attributes
1744 * @references: how many directory/xattr entries refer this inode (calculated
1745 * while walking the index)
1746 * @calc_cnt: for directory inode count of child directories
1747 * @size: inode size (read from on-flash inode)
1748 * @xattr_sz: summary size of all extended attributes (read from on-flash
1750 * @calc_sz: for directories calculated directory size
1751 * @calc_xcnt: count of extended attributes
1752 * @calc_xsz: calculated summary size of all extended attributes
1753 * @xattr_nms: sum of lengths of all extended attribute names belonging to this
1754 * inode (read from on-flash inode)
1755 * @calc_xnms: calculated sum of lengths of all extended attribute names
1762 unsigned int xattr_cnt
;
1766 unsigned int xattr_sz
;
1768 long long calc_xcnt
;
1770 unsigned int xattr_nms
;
1771 long long calc_xnms
;
1775 * struct fsck_data - private FS checking information.
1776 * @inodes: RB-tree of all inodes (contains @struct fsck_inode objects)
1779 struct rb_root inodes
;
1783 * add_inode - add inode information to RB-tree of inodes.
1784 * @c: UBIFS file-system description object
1785 * @fsckd: FS checking information
1786 * @ino: raw UBIFS inode to add
1788 * This is a helper function for 'check_leaf()' which adds information about
1789 * inode @ino to the RB-tree of inodes. Returns inode information pointer in
1790 * case of success and a negative error code in case of failure.
1792 static struct fsck_inode
*add_inode(struct ubifs_info
*c
,
1793 struct fsck_data
*fsckd
,
1794 struct ubifs_ino_node
*ino
)
1796 struct rb_node
**p
, *parent
= NULL
;
1797 struct fsck_inode
*fscki
;
1798 ino_t inum
= key_inum_flash(c
, &ino
->key
);
1799 struct inode
*inode
;
1800 struct ubifs_inode
*ui
;
1802 p
= &fsckd
->inodes
.rb_node
;
1805 fscki
= rb_entry(parent
, struct fsck_inode
, rb
);
1806 if (inum
< fscki
->inum
)
1808 else if (inum
> fscki
->inum
)
1809 p
= &(*p
)->rb_right
;
1814 if (inum
> c
->highest_inum
) {
1815 ubifs_err(c
, "too high inode number, max. is %lu",
1816 (unsigned long)c
->highest_inum
);
1817 return ERR_PTR(-EINVAL
);
1820 fscki
= kzalloc(sizeof(struct fsck_inode
), GFP_NOFS
);
1822 return ERR_PTR(-ENOMEM
);
1824 inode
= ilookup(c
->vfs_sb
, inum
);
1828 * If the inode is present in the VFS inode cache, use it instead of
1829 * the on-flash inode which might be out-of-date. E.g., the size might
1830 * be out-of-date. If we do not do this, the following may happen, for
1832 * 1. A power cut happens
1833 * 2. We mount the file-system R/O, the replay process fixes up the
1834 * inode size in the VFS cache, but on on-flash.
1835 * 3. 'check_leaf()' fails because it hits a data node beyond inode
1839 fscki
->nlink
= le32_to_cpu(ino
->nlink
);
1840 fscki
->size
= le64_to_cpu(ino
->size
);
1841 fscki
->xattr_cnt
= le32_to_cpu(ino
->xattr_cnt
);
1842 fscki
->xattr_sz
= le32_to_cpu(ino
->xattr_size
);
1843 fscki
->xattr_nms
= le32_to_cpu(ino
->xattr_names
);
1844 fscki
->mode
= le32_to_cpu(ino
->mode
);
1846 ui
= ubifs_inode(inode
);
1847 fscki
->nlink
= inode
->i_nlink
;
1848 fscki
->size
= inode
->i_size
;
1849 fscki
->xattr_cnt
= ui
->xattr_cnt
;
1850 fscki
->xattr_sz
= ui
->xattr_size
;
1851 fscki
->xattr_nms
= ui
->xattr_names
;
1852 fscki
->mode
= inode
->i_mode
;
1856 if (S_ISDIR(fscki
->mode
)) {
1857 fscki
->calc_sz
= UBIFS_INO_NODE_SZ
;
1858 fscki
->calc_cnt
= 2;
1861 rb_link_node(&fscki
->rb
, parent
, p
);
1862 rb_insert_color(&fscki
->rb
, &fsckd
->inodes
);
1868 * search_inode - search inode in the RB-tree of inodes.
1869 * @fsckd: FS checking information
1870 * @inum: inode number to search
1872 * This is a helper function for 'check_leaf()' which searches inode @inum in
1873 * the RB-tree of inodes and returns an inode information pointer or %NULL if
1874 * the inode was not found.
1876 static struct fsck_inode
*search_inode(struct fsck_data
*fsckd
, ino_t inum
)
1879 struct fsck_inode
*fscki
;
1881 p
= fsckd
->inodes
.rb_node
;
1883 fscki
= rb_entry(p
, struct fsck_inode
, rb
);
1884 if (inum
< fscki
->inum
)
1886 else if (inum
> fscki
->inum
)
1895 * read_add_inode - read inode node and add it to RB-tree of inodes.
1896 * @c: UBIFS file-system description object
1897 * @fsckd: FS checking information
1898 * @inum: inode number to read
1900 * This is a helper function for 'check_leaf()' which finds inode node @inum in
1901 * the index, reads it, and adds it to the RB-tree of inodes. Returns inode
1902 * information pointer in case of success and a negative error code in case of
1905 static struct fsck_inode
*read_add_inode(struct ubifs_info
*c
,
1906 struct fsck_data
*fsckd
, ino_t inum
)
1909 union ubifs_key key
;
1910 struct ubifs_znode
*znode
;
1911 struct ubifs_zbranch
*zbr
;
1912 struct ubifs_ino_node
*ino
;
1913 struct fsck_inode
*fscki
;
1915 fscki
= search_inode(fsckd
, inum
);
1919 ino_key_init(c
, &key
, inum
);
1920 err
= ubifs_lookup_level0(c
, &key
, &znode
, &n
);
1922 ubifs_err(c
, "inode %lu not found in index", (unsigned long)inum
);
1923 return ERR_PTR(-ENOENT
);
1924 } else if (err
< 0) {
1925 ubifs_err(c
, "error %d while looking up inode %lu",
1926 err
, (unsigned long)inum
);
1927 return ERR_PTR(err
);
1930 zbr
= &znode
->zbranch
[n
];
1931 if (zbr
->len
< UBIFS_INO_NODE_SZ
) {
1932 ubifs_err(c
, "bad node %lu node length %d",
1933 (unsigned long)inum
, zbr
->len
);
1934 return ERR_PTR(-EINVAL
);
1937 ino
= kmalloc(zbr
->len
, GFP_NOFS
);
1939 return ERR_PTR(-ENOMEM
);
1941 err
= ubifs_tnc_read_node(c
, zbr
, ino
);
1943 ubifs_err(c
, "cannot read inode node at LEB %d:%d, error %d",
1944 zbr
->lnum
, zbr
->offs
, err
);
1946 return ERR_PTR(err
);
1949 fscki
= add_inode(c
, fsckd
, ino
);
1951 if (IS_ERR(fscki
)) {
1952 ubifs_err(c
, "error %ld while adding inode %lu node",
1953 PTR_ERR(fscki
), (unsigned long)inum
);
1961 * check_leaf - check leaf node.
1962 * @c: UBIFS file-system description object
1963 * @zbr: zbranch of the leaf node to check
1964 * @priv: FS checking information
1966 * This is a helper function for 'dbg_check_filesystem()' which is called for
1967 * every single leaf node while walking the indexing tree. It checks that the
1968 * leaf node referred from the indexing tree exists, has correct CRC, and does
1969 * some other basic validation. This function is also responsible for building
1970 * an RB-tree of inodes - it adds all inodes into the RB-tree. It also
1971 * calculates reference count, size, etc for each inode in order to later
1972 * compare them to the information stored inside the inodes and detect possible
1973 * inconsistencies. Returns zero in case of success and a negative error code
1974 * in case of failure.
1976 static int check_leaf(struct ubifs_info
*c
, struct ubifs_zbranch
*zbr
,
1981 struct ubifs_ch
*ch
;
1982 int err
, type
= key_type(c
, &zbr
->key
);
1983 struct fsck_inode
*fscki
;
1985 if (zbr
->len
< UBIFS_CH_SZ
) {
1986 ubifs_err(c
, "bad leaf length %d (LEB %d:%d)",
1987 zbr
->len
, zbr
->lnum
, zbr
->offs
);
1991 node
= kmalloc(zbr
->len
, GFP_NOFS
);
1995 err
= ubifs_tnc_read_node(c
, zbr
, node
);
1997 ubifs_err(c
, "cannot read leaf node at LEB %d:%d, error %d",
1998 zbr
->lnum
, zbr
->offs
, err
);
2002 /* If this is an inode node, add it to RB-tree of inodes */
2003 if (type
== UBIFS_INO_KEY
) {
2004 fscki
= add_inode(c
, priv
, node
);
2005 if (IS_ERR(fscki
)) {
2006 err
= PTR_ERR(fscki
);
2007 ubifs_err(c
, "error %d while adding inode node", err
);
2013 if (type
!= UBIFS_DENT_KEY
&& type
!= UBIFS_XENT_KEY
&&
2014 type
!= UBIFS_DATA_KEY
) {
2015 ubifs_err(c
, "unexpected node type %d at LEB %d:%d",
2016 type
, zbr
->lnum
, zbr
->offs
);
2022 if (le64_to_cpu(ch
->sqnum
) > c
->max_sqnum
) {
2023 ubifs_err(c
, "too high sequence number, max. is %llu",
2029 if (type
== UBIFS_DATA_KEY
) {
2031 struct ubifs_data_node
*dn
= node
;
2033 ubifs_assert(c
, zbr
->len
>= UBIFS_DATA_NODE_SZ
);
2036 * Search the inode node this data node belongs to and insert
2037 * it to the RB-tree of inodes.
2039 inum
= key_inum_flash(c
, &dn
->key
);
2040 fscki
= read_add_inode(c
, priv
, inum
);
2041 if (IS_ERR(fscki
)) {
2042 err
= PTR_ERR(fscki
);
2043 ubifs_err(c
, "error %d while processing data node and trying to find inode node %lu",
2044 err
, (unsigned long)inum
);
2048 /* Make sure the data node is within inode size */
2049 blk_offs
= key_block_flash(c
, &dn
->key
);
2050 blk_offs
<<= UBIFS_BLOCK_SHIFT
;
2051 blk_offs
+= le32_to_cpu(dn
->size
);
2052 if (blk_offs
> fscki
->size
) {
2053 ubifs_err(c
, "data node at LEB %d:%d is not within inode size %lld",
2054 zbr
->lnum
, zbr
->offs
, fscki
->size
);
2060 struct ubifs_dent_node
*dent
= node
;
2061 struct fsck_inode
*fscki1
;
2063 ubifs_assert(c
, zbr
->len
>= UBIFS_DENT_NODE_SZ
);
2065 err
= ubifs_validate_entry(c
, dent
);
2070 * Search the inode node this entry refers to and the parent
2071 * inode node and insert them to the RB-tree of inodes.
2073 inum
= le64_to_cpu(dent
->inum
);
2074 fscki
= read_add_inode(c
, priv
, inum
);
2075 if (IS_ERR(fscki
)) {
2076 err
= PTR_ERR(fscki
);
2077 ubifs_err(c
, "error %d while processing entry node and trying to find inode node %lu",
2078 err
, (unsigned long)inum
);
2082 /* Count how many direntries or xentries refers this inode */
2083 fscki
->references
+= 1;
2085 inum
= key_inum_flash(c
, &dent
->key
);
2086 fscki1
= read_add_inode(c
, priv
, inum
);
2087 if (IS_ERR(fscki1
)) {
2088 err
= PTR_ERR(fscki1
);
2089 ubifs_err(c
, "error %d while processing entry node and trying to find parent inode node %lu",
2090 err
, (unsigned long)inum
);
2094 nlen
= le16_to_cpu(dent
->nlen
);
2095 if (type
== UBIFS_XENT_KEY
) {
2096 fscki1
->calc_xcnt
+= 1;
2097 fscki1
->calc_xsz
+= CALC_DENT_SIZE(nlen
);
2098 fscki1
->calc_xsz
+= CALC_XATTR_BYTES(fscki
->size
);
2099 fscki1
->calc_xnms
+= nlen
;
2101 fscki1
->calc_sz
+= CALC_DENT_SIZE(nlen
);
2102 if (dent
->type
== UBIFS_ITYPE_DIR
)
2103 fscki1
->calc_cnt
+= 1;
2112 ubifs_msg(c
, "dump of node at LEB %d:%d", zbr
->lnum
, zbr
->offs
);
2113 ubifs_dump_node(c
, node
);
2120 * free_inodes - free RB-tree of inodes.
2121 * @fsckd: FS checking information
2123 static void free_inodes(struct fsck_data
*fsckd
)
2125 struct fsck_inode
*fscki
, *n
;
2127 rbtree_postorder_for_each_entry_safe(fscki
, n
, &fsckd
->inodes
, rb
)
2132 * check_inodes - checks all inodes.
2133 * @c: UBIFS file-system description object
2134 * @fsckd: FS checking information
2136 * This is a helper function for 'dbg_check_filesystem()' which walks the
2137 * RB-tree of inodes after the index scan has been finished, and checks that
2138 * inode nlink, size, etc are correct. Returns zero if inodes are fine,
2139 * %-EINVAL if not, and a negative error code in case of failure.
2141 static int check_inodes(struct ubifs_info
*c
, struct fsck_data
*fsckd
)
2144 union ubifs_key key
;
2145 struct ubifs_znode
*znode
;
2146 struct ubifs_zbranch
*zbr
;
2147 struct ubifs_ino_node
*ino
;
2148 struct fsck_inode
*fscki
;
2149 struct rb_node
*this = rb_first(&fsckd
->inodes
);
2152 fscki
= rb_entry(this, struct fsck_inode
, rb
);
2153 this = rb_next(this);
2155 if (S_ISDIR(fscki
->mode
)) {
2157 * Directories have to have exactly one reference (they
2158 * cannot have hardlinks), although root inode is an
2161 if (fscki
->inum
!= UBIFS_ROOT_INO
&&
2162 fscki
->references
!= 1) {
2163 ubifs_err(c
, "directory inode %lu has %d direntries which refer it, but should be 1",
2164 (unsigned long)fscki
->inum
,
2168 if (fscki
->inum
== UBIFS_ROOT_INO
&&
2169 fscki
->references
!= 0) {
2170 ubifs_err(c
, "root inode %lu has non-zero (%d) direntries which refer it",
2171 (unsigned long)fscki
->inum
,
2175 if (fscki
->calc_sz
!= fscki
->size
) {
2176 ubifs_err(c
, "directory inode %lu size is %lld, but calculated size is %lld",
2177 (unsigned long)fscki
->inum
,
2178 fscki
->size
, fscki
->calc_sz
);
2181 if (fscki
->calc_cnt
!= fscki
->nlink
) {
2182 ubifs_err(c
, "directory inode %lu nlink is %d, but calculated nlink is %d",
2183 (unsigned long)fscki
->inum
,
2184 fscki
->nlink
, fscki
->calc_cnt
);
2188 if (fscki
->references
!= fscki
->nlink
) {
2189 ubifs_err(c
, "inode %lu nlink is %d, but calculated nlink is %d",
2190 (unsigned long)fscki
->inum
,
2191 fscki
->nlink
, fscki
->references
);
2195 if (fscki
->xattr_sz
!= fscki
->calc_xsz
) {
2196 ubifs_err(c
, "inode %lu has xattr size %u, but calculated size is %lld",
2197 (unsigned long)fscki
->inum
, fscki
->xattr_sz
,
2201 if (fscki
->xattr_cnt
!= fscki
->calc_xcnt
) {
2202 ubifs_err(c
, "inode %lu has %u xattrs, but calculated count is %lld",
2203 (unsigned long)fscki
->inum
,
2204 fscki
->xattr_cnt
, fscki
->calc_xcnt
);
2207 if (fscki
->xattr_nms
!= fscki
->calc_xnms
) {
2208 ubifs_err(c
, "inode %lu has xattr names' size %u, but calculated names' size is %lld",
2209 (unsigned long)fscki
->inum
, fscki
->xattr_nms
,
2218 /* Read the bad inode and dump it */
2219 ino_key_init(c
, &key
, fscki
->inum
);
2220 err
= ubifs_lookup_level0(c
, &key
, &znode
, &n
);
2222 ubifs_err(c
, "inode %lu not found in index",
2223 (unsigned long)fscki
->inum
);
2225 } else if (err
< 0) {
2226 ubifs_err(c
, "error %d while looking up inode %lu",
2227 err
, (unsigned long)fscki
->inum
);
2231 zbr
= &znode
->zbranch
[n
];
2232 ino
= kmalloc(zbr
->len
, GFP_NOFS
);
2236 err
= ubifs_tnc_read_node(c
, zbr
, ino
);
2238 ubifs_err(c
, "cannot read inode node at LEB %d:%d, error %d",
2239 zbr
->lnum
, zbr
->offs
, err
);
2244 ubifs_msg(c
, "dump of the inode %lu sitting in LEB %d:%d",
2245 (unsigned long)fscki
->inum
, zbr
->lnum
, zbr
->offs
);
2246 ubifs_dump_node(c
, ino
);
2252 * dbg_check_filesystem - check the file-system.
2253 * @c: UBIFS file-system description object
2255 * This function checks the file system, namely:
2256 * o makes sure that all leaf nodes exist and their CRCs are correct;
2257 * o makes sure inode nlink, size, xattr size/count are correct (for all
2260 * The function reads whole indexing tree and all nodes, so it is pretty
2261 * heavy-weight. Returns zero if the file-system is consistent, %-EINVAL if
2262 * not, and a negative error code in case of failure.
2264 int dbg_check_filesystem(struct ubifs_info
*c
)
2267 struct fsck_data fsckd
;
2269 if (!dbg_is_chk_fs(c
))
2272 fsckd
.inodes
= RB_ROOT
;
2273 err
= dbg_walk_index(c
, check_leaf
, NULL
, &fsckd
);
2277 err
= check_inodes(c
, &fsckd
);
2281 free_inodes(&fsckd
);
2285 ubifs_err(c
, "file-system check failed with error %d", err
);
2287 free_inodes(&fsckd
);
2292 * dbg_check_data_nodes_order - check that list of data nodes is sorted.
2293 * @c: UBIFS file-system description object
2294 * @head: the list of nodes ('struct ubifs_scan_node' objects)
2296 * This function returns zero if the list of data nodes is sorted correctly,
2297 * and %-EINVAL if not.
2299 int dbg_check_data_nodes_order(struct ubifs_info
*c
, struct list_head
*head
)
2301 struct list_head
*cur
;
2302 struct ubifs_scan_node
*sa
, *sb
;
2304 if (!dbg_is_chk_gen(c
))
2307 for (cur
= head
->next
; cur
->next
!= head
; cur
= cur
->next
) {
2309 uint32_t blka
, blkb
;
2312 sa
= container_of(cur
, struct ubifs_scan_node
, list
);
2313 sb
= container_of(cur
->next
, struct ubifs_scan_node
, list
);
2315 if (sa
->type
!= UBIFS_DATA_NODE
) {
2316 ubifs_err(c
, "bad node type %d", sa
->type
);
2317 ubifs_dump_node(c
, sa
->node
);
2320 if (sb
->type
!= UBIFS_DATA_NODE
) {
2321 ubifs_err(c
, "bad node type %d", sb
->type
);
2322 ubifs_dump_node(c
, sb
->node
);
2326 inuma
= key_inum(c
, &sa
->key
);
2327 inumb
= key_inum(c
, &sb
->key
);
2331 if (inuma
> inumb
) {
2332 ubifs_err(c
, "larger inum %lu goes before inum %lu",
2333 (unsigned long)inuma
, (unsigned long)inumb
);
2337 blka
= key_block(c
, &sa
->key
);
2338 blkb
= key_block(c
, &sb
->key
);
2341 ubifs_err(c
, "larger block %u goes before %u", blka
, blkb
);
2345 ubifs_err(c
, "two data nodes for the same block");
2353 ubifs_dump_node(c
, sa
->node
);
2354 ubifs_dump_node(c
, sb
->node
);
2359 * dbg_check_nondata_nodes_order - check that list of data nodes is sorted.
2360 * @c: UBIFS file-system description object
2361 * @head: the list of nodes ('struct ubifs_scan_node' objects)
2363 * This function returns zero if the list of non-data nodes is sorted correctly,
2364 * and %-EINVAL if not.
2366 int dbg_check_nondata_nodes_order(struct ubifs_info
*c
, struct list_head
*head
)
2368 struct list_head
*cur
;
2369 struct ubifs_scan_node
*sa
, *sb
;
2371 if (!dbg_is_chk_gen(c
))
2374 for (cur
= head
->next
; cur
->next
!= head
; cur
= cur
->next
) {
2376 uint32_t hasha
, hashb
;
2379 sa
= container_of(cur
, struct ubifs_scan_node
, list
);
2380 sb
= container_of(cur
->next
, struct ubifs_scan_node
, list
);
2382 if (sa
->type
!= UBIFS_INO_NODE
&& sa
->type
!= UBIFS_DENT_NODE
&&
2383 sa
->type
!= UBIFS_XENT_NODE
) {
2384 ubifs_err(c
, "bad node type %d", sa
->type
);
2385 ubifs_dump_node(c
, sa
->node
);
2388 if (sb
->type
!= UBIFS_INO_NODE
&& sb
->type
!= UBIFS_DENT_NODE
&&
2389 sb
->type
!= UBIFS_XENT_NODE
) {
2390 ubifs_err(c
, "bad node type %d", sb
->type
);
2391 ubifs_dump_node(c
, sb
->node
);
2395 if (sa
->type
!= UBIFS_INO_NODE
&& sb
->type
== UBIFS_INO_NODE
) {
2396 ubifs_err(c
, "non-inode node goes before inode node");
2400 if (sa
->type
== UBIFS_INO_NODE
&& sb
->type
!= UBIFS_INO_NODE
)
2403 if (sa
->type
== UBIFS_INO_NODE
&& sb
->type
== UBIFS_INO_NODE
) {
2404 /* Inode nodes are sorted in descending size order */
2405 if (sa
->len
< sb
->len
) {
2406 ubifs_err(c
, "smaller inode node goes first");
2413 * This is either a dentry or xentry, which should be sorted in
2414 * ascending (parent ino, hash) order.
2416 inuma
= key_inum(c
, &sa
->key
);
2417 inumb
= key_inum(c
, &sb
->key
);
2421 if (inuma
> inumb
) {
2422 ubifs_err(c
, "larger inum %lu goes before inum %lu",
2423 (unsigned long)inuma
, (unsigned long)inumb
);
2427 hasha
= key_block(c
, &sa
->key
);
2428 hashb
= key_block(c
, &sb
->key
);
2430 if (hasha
> hashb
) {
2431 ubifs_err(c
, "larger hash %u goes before %u",
2440 ubifs_msg(c
, "dumping first node");
2441 ubifs_dump_node(c
, sa
->node
);
2442 ubifs_msg(c
, "dumping second node");
2443 ubifs_dump_node(c
, sb
->node
);
2448 static inline int chance(unsigned int n
, unsigned int out_of
)
2450 return !!((prandom_u32() % out_of
) + 1 <= n
);
2454 static int power_cut_emulated(struct ubifs_info
*c
, int lnum
, int write
)
2456 struct ubifs_debug_info
*d
= c
->dbg
;
2458 ubifs_assert(c
, dbg_is_tst_rcvry(c
));
2461 /* First call - decide delay to the power cut */
2463 unsigned long delay
;
2467 /* Fail within 1 minute */
2468 delay
= prandom_u32() % 60000;
2469 d
->pc_timeout
= jiffies
;
2470 d
->pc_timeout
+= msecs_to_jiffies(delay
);
2471 ubifs_warn(c
, "failing after %lums", delay
);
2474 delay
= prandom_u32() % 10000;
2475 /* Fail within 10000 operations */
2476 d
->pc_cnt_max
= delay
;
2477 ubifs_warn(c
, "failing after %lu calls", delay
);
2484 /* Determine if failure delay has expired */
2485 if (d
->pc_delay
== 1 && time_before(jiffies
, d
->pc_timeout
))
2487 if (d
->pc_delay
== 2 && d
->pc_cnt
++ < d
->pc_cnt_max
)
2490 if (lnum
== UBIFS_SB_LNUM
) {
2491 if (write
&& chance(1, 2))
2495 ubifs_warn(c
, "failing in super block LEB %d", lnum
);
2496 } else if (lnum
== UBIFS_MST_LNUM
|| lnum
== UBIFS_MST_LNUM
+ 1) {
2499 ubifs_warn(c
, "failing in master LEB %d", lnum
);
2500 } else if (lnum
>= UBIFS_LOG_LNUM
&& lnum
<= c
->log_last
) {
2501 if (write
&& chance(99, 100))
2503 if (chance(399, 400))
2505 ubifs_warn(c
, "failing in log LEB %d", lnum
);
2506 } else if (lnum
>= c
->lpt_first
&& lnum
<= c
->lpt_last
) {
2507 if (write
&& chance(7, 8))
2511 ubifs_warn(c
, "failing in LPT LEB %d", lnum
);
2512 } else if (lnum
>= c
->orph_first
&& lnum
<= c
->orph_last
) {
2513 if (write
&& chance(1, 2))
2517 ubifs_warn(c
, "failing in orphan LEB %d", lnum
);
2518 } else if (lnum
== c
->ihead_lnum
) {
2519 if (chance(99, 100))
2521 ubifs_warn(c
, "failing in index head LEB %d", lnum
);
2522 } else if (c
->jheads
&& lnum
== c
->jheads
[GCHD
].wbuf
.lnum
) {
2525 ubifs_warn(c
, "failing in GC head LEB %d", lnum
);
2526 } else if (write
&& !RB_EMPTY_ROOT(&c
->buds
) &&
2527 !ubifs_search_bud(c
, lnum
)) {
2530 ubifs_warn(c
, "failing in non-bud LEB %d", lnum
);
2531 } else if (c
->cmt_state
== COMMIT_RUNNING_BACKGROUND
||
2532 c
->cmt_state
== COMMIT_RUNNING_REQUIRED
) {
2533 if (chance(999, 1000))
2535 ubifs_warn(c
, "failing in bud LEB %d commit running", lnum
);
2537 if (chance(9999, 10000))
2539 ubifs_warn(c
, "failing in bud LEB %d commit not running", lnum
);
2543 ubifs_warn(c
, "========== Power cut emulated ==========");
2548 static int corrupt_data(const struct ubifs_info
*c
, const void *buf
,
2551 unsigned int from
, to
, ffs
= chance(1, 2);
2552 unsigned char *p
= (void *)buf
;
2554 from
= prandom_u32() % len
;
2555 /* Corruption span max to end of write unit */
2556 to
= min(len
, ALIGN(from
+ 1, c
->max_write_size
));
2558 ubifs_warn(c
, "filled bytes %u-%u with %s", from
, to
- 1,
2559 ffs
? "0xFFs" : "random data");
2562 memset(p
+ from
, 0xFF, to
- from
);
2564 prandom_bytes(p
+ from
, to
- from
);
2569 int dbg_leb_write(struct ubifs_info
*c
, int lnum
, const void *buf
,
2574 if (dbg_is_power_cut(c
))
2577 failing
= power_cut_emulated(c
, lnum
, 1);
2579 len
= corrupt_data(c
, buf
, len
);
2580 ubifs_warn(c
, "actually write %d bytes to LEB %d:%d (the buffer was corrupted)",
2583 err
= ubi_leb_write(c
->ubi
, lnum
, buf
, offs
, len
);
2591 int dbg_leb_change(struct ubifs_info
*c
, int lnum
, const void *buf
,
2596 if (dbg_is_power_cut(c
))
2598 if (power_cut_emulated(c
, lnum
, 1))
2600 err
= ubi_leb_change(c
->ubi
, lnum
, buf
, len
);
2603 if (power_cut_emulated(c
, lnum
, 1))
2608 int dbg_leb_unmap(struct ubifs_info
*c
, int lnum
)
2612 if (dbg_is_power_cut(c
))
2614 if (power_cut_emulated(c
, lnum
, 0))
2616 err
= ubi_leb_unmap(c
->ubi
, lnum
);
2619 if (power_cut_emulated(c
, lnum
, 0))
2624 int dbg_leb_map(struct ubifs_info
*c
, int lnum
)
2628 if (dbg_is_power_cut(c
))
2630 if (power_cut_emulated(c
, lnum
, 0))
2632 err
= ubi_leb_map(c
->ubi
, lnum
);
2635 if (power_cut_emulated(c
, lnum
, 0))
2641 * Root directory for UBIFS stuff in debugfs. Contains sub-directories which
2642 * contain the stuff specific to particular file-system mounts.
2644 static struct dentry
*dfs_rootdir
;
2646 static int dfs_file_open(struct inode
*inode
, struct file
*file
)
2648 file
->private_data
= inode
->i_private
;
2649 return nonseekable_open(inode
, file
);
2653 * provide_user_output - provide output to the user reading a debugfs file.
2654 * @val: boolean value for the answer
2655 * @u: the buffer to store the answer at
2656 * @count: size of the buffer
2657 * @ppos: position in the @u output buffer
2659 * This is a simple helper function which stores @val boolean value in the user
2660 * buffer when the user reads one of UBIFS debugfs files. Returns amount of
2661 * bytes written to @u in case of success and a negative error code in case of
2664 static int provide_user_output(int val
, char __user
*u
, size_t count
,
2676 return simple_read_from_buffer(u
, count
, ppos
, buf
, 2);
2679 static ssize_t
dfs_file_read(struct file
*file
, char __user
*u
, size_t count
,
2682 struct dentry
*dent
= file
->f_path
.dentry
;
2683 struct ubifs_info
*c
= file
->private_data
;
2684 struct ubifs_debug_info
*d
= c
->dbg
;
2687 if (dent
== d
->dfs_chk_gen
)
2689 else if (dent
== d
->dfs_chk_index
)
2691 else if (dent
== d
->dfs_chk_orph
)
2693 else if (dent
== d
->dfs_chk_lprops
)
2694 val
= d
->chk_lprops
;
2695 else if (dent
== d
->dfs_chk_fs
)
2697 else if (dent
== d
->dfs_tst_rcvry
)
2699 else if (dent
== d
->dfs_ro_error
)
2704 return provide_user_output(val
, u
, count
, ppos
);
2708 * interpret_user_input - interpret user debugfs file input.
2709 * @u: user-provided buffer with the input
2710 * @count: buffer size
2712 * This is a helper function which interpret user input to a boolean UBIFS
2713 * debugfs file. Returns %0 or %1 in case of success and a negative error code
2714 * in case of failure.
2716 static int interpret_user_input(const char __user
*u
, size_t count
)
2721 buf_size
= min_t(size_t, count
, (sizeof(buf
) - 1));
2722 if (copy_from_user(buf
, u
, buf_size
))
2727 else if (buf
[0] == '0')
2733 static ssize_t
dfs_file_write(struct file
*file
, const char __user
*u
,
2734 size_t count
, loff_t
*ppos
)
2736 struct ubifs_info
*c
= file
->private_data
;
2737 struct ubifs_debug_info
*d
= c
->dbg
;
2738 struct dentry
*dent
= file
->f_path
.dentry
;
2741 if (file
->f_path
.dentry
== d
->dfs_dump_lprops
) {
2742 ubifs_dump_lprops(c
);
2745 if (file
->f_path
.dentry
== d
->dfs_dump_budg
) {
2746 ubifs_dump_budg(c
, &c
->bi
);
2749 if (file
->f_path
.dentry
== d
->dfs_dump_tnc
) {
2750 mutex_lock(&c
->tnc_mutex
);
2752 mutex_unlock(&c
->tnc_mutex
);
2756 val
= interpret_user_input(u
, count
);
2760 if (dent
== d
->dfs_chk_gen
)
2762 else if (dent
== d
->dfs_chk_index
)
2764 else if (dent
== d
->dfs_chk_orph
)
2766 else if (dent
== d
->dfs_chk_lprops
)
2767 d
->chk_lprops
= val
;
2768 else if (dent
== d
->dfs_chk_fs
)
2770 else if (dent
== d
->dfs_tst_rcvry
)
2772 else if (dent
== d
->dfs_ro_error
)
2773 c
->ro_error
= !!val
;
2780 static const struct file_operations dfs_fops
= {
2781 .open
= dfs_file_open
,
2782 .read
= dfs_file_read
,
2783 .write
= dfs_file_write
,
2784 .owner
= THIS_MODULE
,
2785 .llseek
= no_llseek
,
2789 * dbg_debugfs_init_fs - initialize debugfs for UBIFS instance.
2790 * @c: UBIFS file-system description object
2792 * This function creates all debugfs files for this instance of UBIFS.
2794 * Note, the only reason we have not merged this function with the
2795 * 'ubifs_debugging_init()' function is because it is better to initialize
2796 * debugfs interfaces at the very end of the mount process, and remove them at
2797 * the very beginning of the mount process.
2799 void dbg_debugfs_init_fs(struct ubifs_info
*c
)
2803 struct ubifs_debug_info
*d
= c
->dbg
;
2805 n
= snprintf(d
->dfs_dir_name
, UBIFS_DFS_DIR_LEN
+ 1, UBIFS_DFS_DIR_NAME
,
2806 c
->vi
.ubi_num
, c
->vi
.vol_id
);
2807 if (n
== UBIFS_DFS_DIR_LEN
) {
2808 /* The array size is too small */
2812 fname
= d
->dfs_dir_name
;
2813 d
->dfs_dir
= debugfs_create_dir(fname
, dfs_rootdir
);
2815 fname
= "dump_lprops";
2816 d
->dfs_dump_lprops
= debugfs_create_file(fname
, S_IWUSR
, d
->dfs_dir
, c
,
2819 fname
= "dump_budg";
2820 d
->dfs_dump_budg
= debugfs_create_file(fname
, S_IWUSR
, d
->dfs_dir
, c
,
2824 d
->dfs_dump_tnc
= debugfs_create_file(fname
, S_IWUSR
, d
->dfs_dir
, c
,
2827 fname
= "chk_general";
2828 d
->dfs_chk_gen
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2829 d
->dfs_dir
, c
, &dfs_fops
);
2831 fname
= "chk_index";
2832 d
->dfs_chk_index
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2833 d
->dfs_dir
, c
, &dfs_fops
);
2835 fname
= "chk_orphans";
2836 d
->dfs_chk_orph
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2837 d
->dfs_dir
, c
, &dfs_fops
);
2839 fname
= "chk_lprops";
2840 d
->dfs_chk_lprops
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2841 d
->dfs_dir
, c
, &dfs_fops
);
2844 d
->dfs_chk_fs
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2845 d
->dfs_dir
, c
, &dfs_fops
);
2847 fname
= "tst_recovery";
2848 d
->dfs_tst_rcvry
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2849 d
->dfs_dir
, c
, &dfs_fops
);
2852 d
->dfs_ro_error
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2853 d
->dfs_dir
, c
, &dfs_fops
);
2857 * dbg_debugfs_exit_fs - remove all debugfs files.
2858 * @c: UBIFS file-system description object
2860 void dbg_debugfs_exit_fs(struct ubifs_info
*c
)
2862 debugfs_remove_recursive(c
->dbg
->dfs_dir
);
2865 struct ubifs_global_debug_info ubifs_dbg
;
2867 static struct dentry
*dfs_chk_gen
;
2868 static struct dentry
*dfs_chk_index
;
2869 static struct dentry
*dfs_chk_orph
;
2870 static struct dentry
*dfs_chk_lprops
;
2871 static struct dentry
*dfs_chk_fs
;
2872 static struct dentry
*dfs_tst_rcvry
;
2874 static ssize_t
dfs_global_file_read(struct file
*file
, char __user
*u
,
2875 size_t count
, loff_t
*ppos
)
2877 struct dentry
*dent
= file
->f_path
.dentry
;
2880 if (dent
== dfs_chk_gen
)
2881 val
= ubifs_dbg
.chk_gen
;
2882 else if (dent
== dfs_chk_index
)
2883 val
= ubifs_dbg
.chk_index
;
2884 else if (dent
== dfs_chk_orph
)
2885 val
= ubifs_dbg
.chk_orph
;
2886 else if (dent
== dfs_chk_lprops
)
2887 val
= ubifs_dbg
.chk_lprops
;
2888 else if (dent
== dfs_chk_fs
)
2889 val
= ubifs_dbg
.chk_fs
;
2890 else if (dent
== dfs_tst_rcvry
)
2891 val
= ubifs_dbg
.tst_rcvry
;
2895 return provide_user_output(val
, u
, count
, ppos
);
2898 static ssize_t
dfs_global_file_write(struct file
*file
, const char __user
*u
,
2899 size_t count
, loff_t
*ppos
)
2901 struct dentry
*dent
= file
->f_path
.dentry
;
2904 val
= interpret_user_input(u
, count
);
2908 if (dent
== dfs_chk_gen
)
2909 ubifs_dbg
.chk_gen
= val
;
2910 else if (dent
== dfs_chk_index
)
2911 ubifs_dbg
.chk_index
= val
;
2912 else if (dent
== dfs_chk_orph
)
2913 ubifs_dbg
.chk_orph
= val
;
2914 else if (dent
== dfs_chk_lprops
)
2915 ubifs_dbg
.chk_lprops
= val
;
2916 else if (dent
== dfs_chk_fs
)
2917 ubifs_dbg
.chk_fs
= val
;
2918 else if (dent
== dfs_tst_rcvry
)
2919 ubifs_dbg
.tst_rcvry
= val
;
2926 static const struct file_operations dfs_global_fops
= {
2927 .read
= dfs_global_file_read
,
2928 .write
= dfs_global_file_write
,
2929 .owner
= THIS_MODULE
,
2930 .llseek
= no_llseek
,
2934 * dbg_debugfs_init - initialize debugfs file-system.
2936 * UBIFS uses debugfs file-system to expose various debugging knobs to
2937 * user-space. This function creates "ubifs" directory in the debugfs
2940 void dbg_debugfs_init(void)
2945 dfs_rootdir
= debugfs_create_dir(fname
, NULL
);
2947 fname
= "chk_general";
2948 dfs_chk_gen
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
, dfs_rootdir
,
2949 NULL
, &dfs_global_fops
);
2951 fname
= "chk_index";
2952 dfs_chk_index
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2953 dfs_rootdir
, NULL
, &dfs_global_fops
);
2955 fname
= "chk_orphans";
2956 dfs_chk_orph
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2957 dfs_rootdir
, NULL
, &dfs_global_fops
);
2959 fname
= "chk_lprops";
2960 dfs_chk_lprops
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2961 dfs_rootdir
, NULL
, &dfs_global_fops
);
2964 dfs_chk_fs
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
, dfs_rootdir
,
2965 NULL
, &dfs_global_fops
);
2967 fname
= "tst_recovery";
2968 dfs_tst_rcvry
= debugfs_create_file(fname
, S_IRUSR
| S_IWUSR
,
2969 dfs_rootdir
, NULL
, &dfs_global_fops
);
2973 * dbg_debugfs_exit - remove the "ubifs" directory from debugfs file-system.
2975 void dbg_debugfs_exit(void)
2977 debugfs_remove_recursive(dfs_rootdir
);
2980 void ubifs_assert_failed(struct ubifs_info
*c
, const char *expr
,
2981 const char *file
, int line
)
2983 ubifs_err(c
, "UBIFS assert failed: %s, in %s:%u", expr
, file
, line
);
2985 switch (c
->assert_action
) {
2991 ubifs_ro_mode(c
, -EINVAL
);
3003 * ubifs_debugging_init - initialize UBIFS debugging.
3004 * @c: UBIFS file-system description object
3006 * This function initializes debugging-related data for the file system.
3007 * Returns zero in case of success and a negative error code in case of
3010 int ubifs_debugging_init(struct ubifs_info
*c
)
3012 c
->dbg
= kzalloc(sizeof(struct ubifs_debug_info
), GFP_KERNEL
);
3020 * ubifs_debugging_exit - free debugging data.
3021 * @c: UBIFS file-system description object
3023 void ubifs_debugging_exit(struct ubifs_info
*c
)