2 * This file is part of UBIFS.
4 * Copyright (C) 2006-2008 Nokia Corporation.
6 * This program is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 as published by
8 * the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
15 * You should have received a copy of the GNU General Public License along with
16 * this program; if not, write to the Free Software Foundation, Inc., 51
17 * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 * Authors: Adrian Hunter
20 * Artem Bityutskiy (Битюцкий Артём)
24 * This file contains journal replay code. It runs when the file-system is being
25 * mounted and requires no locking.
27 * The larger is the journal, the longer it takes to scan it, so the longer it
28 * takes to mount UBIFS. This is why the journal has limited size which may be
29 * changed depending on the system requirements. But a larger journal gives
30 * faster I/O speed because it writes the index less frequently. So this is a
31 * trade-off. Also, the journal is indexed by the in-memory index (TNC), so the
32 * larger is the journal, the more memory its index may consume.
36 #include <linux/list_sort.h>
39 * struct replay_entry - replay list entry.
40 * @lnum: logical eraseblock number of the node
43 * @deletion: non-zero if this entry corresponds to a node deletion
44 * @sqnum: node sequence number
45 * @list: links the replay list
47 * @nm: directory entry name
48 * @old_size: truncation old size
49 * @new_size: truncation new size
51 * The replay process first scans all buds and builds the replay list, then
52 * sorts the replay list in nodes sequence number order, and then inserts all
53 * the replay entries to the TNC.
59 unsigned int deletion
:1;
60 unsigned long long sqnum
;
61 struct list_head list
;
73 * struct bud_entry - entry in the list of buds to replay.
74 * @list: next bud in the list
75 * @bud: bud description object
76 * @sqnum: reference node sequence number
77 * @free: free bytes in the bud
78 * @dirty: dirty bytes in the bud
81 struct list_head list
;
82 struct ubifs_bud
*bud
;
83 unsigned long long sqnum
;
89 * set_bud_lprops - set free and dirty space used by a bud.
90 * @c: UBIFS file-system description object
91 * @b: bud entry which describes the bud
93 * This function makes sure the LEB properties of bud @b are set correctly
94 * after the replay. Returns zero in case of success and a negative error code
97 static int set_bud_lprops(struct ubifs_info
*c
, struct bud_entry
*b
)
99 const struct ubifs_lprops
*lp
;
104 lp
= ubifs_lpt_lookup_dirty(c
, b
->bud
->lnum
);
111 if (b
->bud
->start
== 0 && (lp
->free
!= c
->leb_size
|| lp
->dirty
!= 0)) {
113 * The LEB was added to the journal with a starting offset of
114 * zero which means the LEB must have been empty. The LEB
115 * property values should be @lp->free == @c->leb_size and
116 * @lp->dirty == 0, but that is not the case. The reason is that
117 * the LEB had been garbage collected before it became the bud,
118 * and there was not commit inbetween. The garbage collector
119 * resets the free and dirty space without recording it
120 * anywhere except lprops, so if there was no commit then
121 * lprops does not have that information.
123 * We do not need to adjust free space because the scan has told
124 * us the exact value which is recorded in the replay entry as
127 * However we do need to subtract from the dirty space the
128 * amount of space that the garbage collector reclaimed, which
129 * is the whole LEB minus the amount of space that was free.
131 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b
->bud
->lnum
,
132 lp
->free
, lp
->dirty
);
133 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b
->bud
->lnum
,
134 lp
->free
, lp
->dirty
);
135 dirty
-= c
->leb_size
- lp
->free
;
137 * If the replay order was perfect the dirty space would now be
138 * zero. The order is not perfect because the journal heads
139 * race with each other. This is not a problem but is does mean
140 * that the dirty space may temporarily exceed c->leb_size
144 dbg_msg("LEB %d lp: %d free %d dirty "
145 "replay: %d free %d dirty", b
->bud
->lnum
,
146 lp
->free
, lp
->dirty
, b
->free
, b
->dirty
);
148 lp
= ubifs_change_lp(c
, lp
, b
->free
, dirty
+ b
->dirty
,
149 lp
->flags
| LPROPS_TAKEN
, 0);
155 /* Make sure the journal head points to the latest bud */
156 err
= ubifs_wbuf_seek_nolock(&c
->jheads
[b
->bud
->jhead
].wbuf
,
157 b
->bud
->lnum
, c
->leb_size
- b
->free
,
161 ubifs_release_lprops(c
);
166 * set_buds_lprops - set free and dirty space for all replayed buds.
167 * @c: UBIFS file-system description object
169 * This function sets LEB properties for all replayed buds. Returns zero in
170 * case of success and a negative error code in case of failure.
172 static int set_buds_lprops(struct ubifs_info
*c
)
177 list_for_each_entry(b
, &c
->replay_buds
, list
) {
178 err
= set_bud_lprops(c
, b
);
187 * trun_remove_range - apply a replay entry for a truncation to the TNC.
188 * @c: UBIFS file-system description object
189 * @r: replay entry of truncation
191 static int trun_remove_range(struct ubifs_info
*c
, struct replay_entry
*r
)
193 unsigned min_blk
, max_blk
;
194 union ubifs_key min_key
, max_key
;
197 min_blk
= r
->new_size
/ UBIFS_BLOCK_SIZE
;
198 if (r
->new_size
& (UBIFS_BLOCK_SIZE
- 1))
201 max_blk
= r
->old_size
/ UBIFS_BLOCK_SIZE
;
202 if ((r
->old_size
& (UBIFS_BLOCK_SIZE
- 1)) == 0)
205 ino
= key_inum(c
, &r
->key
);
207 data_key_init(c
, &min_key
, ino
, min_blk
);
208 data_key_init(c
, &max_key
, ino
, max_blk
);
210 return ubifs_tnc_remove_range(c
, &min_key
, &max_key
);
214 * apply_replay_entry - apply a replay entry to the TNC.
215 * @c: UBIFS file-system description object
216 * @r: replay entry to apply
218 * Apply a replay entry to the TNC.
220 static int apply_replay_entry(struct ubifs_info
*c
, struct replay_entry
*r
)
224 dbg_mnt("LEB %d:%d len %d deletion %d sqnum %llu %s", r
->lnum
,
225 r
->offs
, r
->len
, r
->deletion
, r
->sqnum
, DBGKEY(&r
->key
));
227 /* Set c->replay_sqnum to help deal with dangling branches. */
228 c
->replay_sqnum
= r
->sqnum
;
230 if (is_hash_key(c
, &r
->key
)) {
232 err
= ubifs_tnc_remove_nm(c
, &r
->key
, &r
->nm
);
234 err
= ubifs_tnc_add_nm(c
, &r
->key
, r
->lnum
, r
->offs
,
238 switch (key_type(c
, &r
->key
)) {
241 ino_t inum
= key_inum(c
, &r
->key
);
243 err
= ubifs_tnc_remove_ino(c
, inum
);
247 err
= trun_remove_range(c
, r
);
250 err
= ubifs_tnc_remove(c
, &r
->key
);
254 err
= ubifs_tnc_add(c
, &r
->key
, r
->lnum
, r
->offs
,
259 if (c
->need_recovery
)
260 err
= ubifs_recover_size_accum(c
, &r
->key
, r
->deletion
,
268 * replay_entries_cmp - compare 2 replay entries.
269 * @priv: UBIFS file-system description object
270 * @a: first replay entry
271 * @a: second replay entry
273 * This is a comparios function for 'list_sort()' which compares 2 replay
274 * entries @a and @b by comparing their sequence numer. Returns %1 if @a has
275 * greater sequence number and %-1 otherwise.
277 static int replay_entries_cmp(void *priv
, struct list_head
*a
,
280 struct replay_entry
*ra
, *rb
;
286 ra
= list_entry(a
, struct replay_entry
, list
);
287 rb
= list_entry(b
, struct replay_entry
, list
);
288 ubifs_assert(ra
->sqnum
!= rb
->sqnum
);
289 if (ra
->sqnum
> rb
->sqnum
)
295 * apply_replay_list - apply the replay list to the TNC.
296 * @c: UBIFS file-system description object
298 * Apply all entries in the replay list to the TNC. Returns zero in case of
299 * success and a negative error code in case of failure.
301 static int apply_replay_list(struct ubifs_info
*c
)
303 struct replay_entry
*r
;
306 list_sort(c
, &c
->replay_list
, &replay_entries_cmp
);
308 list_for_each_entry(r
, &c
->replay_list
, list
) {
311 err
= apply_replay_entry(c
, r
);
320 * destroy_replay_list - destroy the replay.
321 * @c: UBIFS file-system description object
323 * Destroy the replay list.
325 static void destroy_replay_list(struct ubifs_info
*c
)
327 struct replay_entry
*r
, *tmp
;
329 list_for_each_entry_safe(r
, tmp
, &c
->replay_list
, list
) {
330 if (is_hash_key(c
, &r
->key
))
338 * insert_node - insert a node to the replay list
339 * @c: UBIFS file-system description object
340 * @lnum: node logical eraseblock number
344 * @sqnum: sequence number
345 * @deletion: non-zero if this is a deletion
346 * @used: number of bytes in use in a LEB
347 * @old_size: truncation old size
348 * @new_size: truncation new size
350 * This function inserts a scanned non-direntry node to the replay list. The
351 * replay list contains @struct replay_entry elements, and we sort this list in
352 * sequence number order before applying it. The replay list is applied at the
353 * very end of the replay process. Since the list is sorted in sequence number
354 * order, the older modifications are applied first. This function returns zero
355 * in case of success and a negative error code in case of failure.
357 static int insert_node(struct ubifs_info
*c
, int lnum
, int offs
, int len
,
358 union ubifs_key
*key
, unsigned long long sqnum
,
359 int deletion
, int *used
, loff_t old_size
,
362 struct replay_entry
*r
;
364 dbg_mnt("add LEB %d:%d, key %s", lnum
, offs
, DBGKEY(key
));
366 if (key_inum(c
, key
) >= c
->highest_inum
)
367 c
->highest_inum
= key_inum(c
, key
);
369 r
= kzalloc(sizeof(struct replay_entry
), GFP_KERNEL
);
374 *used
+= ALIGN(len
, 8);
378 r
->deletion
= !!deletion
;
380 key_copy(c
, key
, &r
->key
);
381 r
->old_size
= old_size
;
382 r
->new_size
= new_size
;
384 list_add_tail(&r
->list
, &c
->replay_list
);
389 * insert_dent - insert a directory entry node into the replay list.
390 * @c: UBIFS file-system description object
391 * @lnum: node logical eraseblock number
395 * @name: directory entry name
396 * @nlen: directory entry name length
397 * @sqnum: sequence number
398 * @deletion: non-zero if this is a deletion
399 * @used: number of bytes in use in a LEB
401 * This function inserts a scanned directory entry node or an extended
402 * attribute entry to the replay list. Returns zero in case of success and a
403 * negative error code in case of failure.
405 static int insert_dent(struct ubifs_info
*c
, int lnum
, int offs
, int len
,
406 union ubifs_key
*key
, const char *name
, int nlen
,
407 unsigned long long sqnum
, int deletion
, int *used
)
409 struct replay_entry
*r
;
412 dbg_mnt("add LEB %d:%d, key %s", lnum
, offs
, DBGKEY(key
));
413 if (key_inum(c
, key
) >= c
->highest_inum
)
414 c
->highest_inum
= key_inum(c
, key
);
416 r
= kzalloc(sizeof(struct replay_entry
), GFP_KERNEL
);
420 nbuf
= kmalloc(nlen
+ 1, GFP_KERNEL
);
427 *used
+= ALIGN(len
, 8);
431 r
->deletion
= !!deletion
;
433 key_copy(c
, key
, &r
->key
);
435 memcpy(nbuf
, name
, nlen
);
439 list_add_tail(&r
->list
, &c
->replay_list
);
444 * ubifs_validate_entry - validate directory or extended attribute entry node.
445 * @c: UBIFS file-system description object
446 * @dent: the node to validate
448 * This function validates directory or extended attribute entry node @dent.
449 * Returns zero if the node is all right and a %-EINVAL if not.
451 int ubifs_validate_entry(struct ubifs_info
*c
,
452 const struct ubifs_dent_node
*dent
)
454 int key_type
= key_type_flash(c
, dent
->key
);
455 int nlen
= le16_to_cpu(dent
->nlen
);
457 if (le32_to_cpu(dent
->ch
.len
) != nlen
+ UBIFS_DENT_NODE_SZ
+ 1 ||
458 dent
->type
>= UBIFS_ITYPES_CNT
||
459 nlen
> UBIFS_MAX_NLEN
|| dent
->name
[nlen
] != 0 ||
460 strnlen(dent
->name
, nlen
) != nlen
||
461 le64_to_cpu(dent
->inum
) > MAX_INUM
) {
462 ubifs_err("bad %s node", key_type
== UBIFS_DENT_KEY
?
463 "directory entry" : "extended attribute entry");
467 if (key_type
!= UBIFS_DENT_KEY
&& key_type
!= UBIFS_XENT_KEY
) {
468 ubifs_err("bad key type %d", key_type
);
476 * replay_bud - replay a bud logical eraseblock.
477 * @c: UBIFS file-system description object
478 * @b: bud entry which describes the bud
480 * This function replays bud @bud, recovers it if needed, and adds all nodes
481 * from this bud to the replay list. Returns zero in case of success and a
482 * negative error code in case of failure.
484 static int replay_bud(struct ubifs_info
*c
, struct bud_entry
*b
)
486 int err
= 0, used
= 0, lnum
= b
->bud
->lnum
, offs
= b
->bud
->start
;
487 int jhead
= b
->bud
->jhead
;
488 struct ubifs_scan_leb
*sleb
;
489 struct ubifs_scan_node
*snod
;
490 struct ubifs_bud
*bud
;
492 dbg_mnt("replay bud LEB %d, head %d, offs %d", lnum
, jhead
, offs
);
494 if (c
->need_recovery
)
495 sleb
= ubifs_recover_leb(c
, lnum
, offs
, c
->sbuf
, jhead
!= GCHD
);
497 sleb
= ubifs_scan(c
, lnum
, offs
, c
->sbuf
, 0);
499 return PTR_ERR(sleb
);
502 * The bud does not have to start from offset zero - the beginning of
503 * the 'lnum' LEB may contain previously committed data. One of the
504 * things we have to do in replay is to correctly update lprops with
505 * newer information about this LEB.
507 * At this point lprops thinks that this LEB has 'c->leb_size - offs'
508 * bytes of free space because it only contain information about
511 * But we know that real amount of free space is 'c->leb_size -
512 * sleb->endpt', and the space in the 'lnum' LEB between 'offs' and
513 * 'sleb->endpt' is used by bud data. We have to correctly calculate
514 * how much of these data are dirty and update lprops with this
517 * The dirt in that LEB region is comprised of padding nodes, deletion
518 * nodes, truncation nodes and nodes which are obsoleted by subsequent
519 * nodes in this LEB. So instead of calculating clean space, we
520 * calculate used space ('used' variable).
523 list_for_each_entry(snod
, &sleb
->nodes
, list
) {
528 if (snod
->sqnum
>= SQNUM_WATERMARK
) {
529 ubifs_err("file system's life ended");
533 if (snod
->sqnum
> c
->max_sqnum
)
534 c
->max_sqnum
= snod
->sqnum
;
536 switch (snod
->type
) {
539 struct ubifs_ino_node
*ino
= snod
->node
;
540 loff_t new_size
= le64_to_cpu(ino
->size
);
542 if (le32_to_cpu(ino
->nlink
) == 0)
544 err
= insert_node(c
, lnum
, snod
->offs
, snod
->len
,
545 &snod
->key
, snod
->sqnum
, deletion
,
549 case UBIFS_DATA_NODE
:
551 struct ubifs_data_node
*dn
= snod
->node
;
552 loff_t new_size
= le32_to_cpu(dn
->size
) +
553 key_block(c
, &snod
->key
) *
556 err
= insert_node(c
, lnum
, snod
->offs
, snod
->len
,
557 &snod
->key
, snod
->sqnum
, deletion
,
561 case UBIFS_DENT_NODE
:
562 case UBIFS_XENT_NODE
:
564 struct ubifs_dent_node
*dent
= snod
->node
;
566 err
= ubifs_validate_entry(c
, dent
);
570 err
= insert_dent(c
, lnum
, snod
->offs
, snod
->len
,
571 &snod
->key
, dent
->name
,
572 le16_to_cpu(dent
->nlen
), snod
->sqnum
,
573 !le64_to_cpu(dent
->inum
), &used
);
576 case UBIFS_TRUN_NODE
:
578 struct ubifs_trun_node
*trun
= snod
->node
;
579 loff_t old_size
= le64_to_cpu(trun
->old_size
);
580 loff_t new_size
= le64_to_cpu(trun
->new_size
);
583 /* Validate truncation node */
584 if (old_size
< 0 || old_size
> c
->max_inode_sz
||
585 new_size
< 0 || new_size
> c
->max_inode_sz
||
586 old_size
<= new_size
) {
587 ubifs_err("bad truncation node");
592 * Create a fake truncation key just to use the same
593 * functions which expect nodes to have keys.
595 trun_key_init(c
, &key
, le32_to_cpu(trun
->inum
));
596 err
= insert_node(c
, lnum
, snod
->offs
, snod
->len
,
597 &key
, snod
->sqnum
, 1, &used
,
602 ubifs_err("unexpected node type %d in bud LEB %d:%d",
603 snod
->type
, lnum
, snod
->offs
);
611 bud
= ubifs_search_bud(c
, lnum
);
615 ubifs_assert(sleb
->endpt
- offs
>= used
);
616 ubifs_assert(sleb
->endpt
% c
->min_io_size
== 0);
618 b
->dirty
= sleb
->endpt
- offs
- used
;
619 b
->free
= c
->leb_size
- sleb
->endpt
;
620 dbg_mnt("bud LEB %d replied: dirty %d, free %d", lnum
, b
->dirty
, b
->free
);
623 ubifs_scan_destroy(sleb
);
627 ubifs_err("bad node is at LEB %d:%d", lnum
, snod
->offs
);
628 dbg_dump_node(c
, snod
->node
);
629 ubifs_scan_destroy(sleb
);
634 * replay_buds - replay all buds.
635 * @c: UBIFS file-system description object
637 * This function returns zero in case of success and a negative error code in
640 static int replay_buds(struct ubifs_info
*c
)
644 unsigned long long prev_sqnum
= 0;
646 list_for_each_entry(b
, &c
->replay_buds
, list
) {
647 err
= replay_bud(c
, b
);
651 ubifs_assert(b
->sqnum
> prev_sqnum
);
652 prev_sqnum
= b
->sqnum
;
659 * destroy_bud_list - destroy the list of buds to replay.
660 * @c: UBIFS file-system description object
662 static void destroy_bud_list(struct ubifs_info
*c
)
666 while (!list_empty(&c
->replay_buds
)) {
667 b
= list_entry(c
->replay_buds
.next
, struct bud_entry
, list
);
674 * add_replay_bud - add a bud to the list of buds to replay.
675 * @c: UBIFS file-system description object
676 * @lnum: bud logical eraseblock number to replay
677 * @offs: bud start offset
678 * @jhead: journal head to which this bud belongs
679 * @sqnum: reference node sequence number
681 * This function returns zero in case of success and a negative error code in
684 static int add_replay_bud(struct ubifs_info
*c
, int lnum
, int offs
, int jhead
,
685 unsigned long long sqnum
)
687 struct ubifs_bud
*bud
;
690 dbg_mnt("add replay bud LEB %d:%d, head %d", lnum
, offs
, jhead
);
692 bud
= kmalloc(sizeof(struct ubifs_bud
), GFP_KERNEL
);
696 b
= kmalloc(sizeof(struct bud_entry
), GFP_KERNEL
);
705 ubifs_add_bud(c
, bud
);
709 list_add_tail(&b
->list
, &c
->replay_buds
);
715 * validate_ref - validate a reference node.
716 * @c: UBIFS file-system description object
717 * @ref: the reference node to validate
718 * @ref_lnum: LEB number of the reference node
719 * @ref_offs: reference node offset
721 * This function returns %1 if a bud reference already exists for the LEB. %0 is
722 * returned if the reference node is new, otherwise %-EINVAL is returned if
725 static int validate_ref(struct ubifs_info
*c
, const struct ubifs_ref_node
*ref
)
727 struct ubifs_bud
*bud
;
728 int lnum
= le32_to_cpu(ref
->lnum
);
729 unsigned int offs
= le32_to_cpu(ref
->offs
);
730 unsigned int jhead
= le32_to_cpu(ref
->jhead
);
733 * ref->offs may point to the end of LEB when the journal head points
734 * to the end of LEB and we write reference node for it during commit.
735 * So this is why we require 'offs > c->leb_size'.
737 if (jhead
>= c
->jhead_cnt
|| lnum
>= c
->leb_cnt
||
738 lnum
< c
->main_first
|| offs
> c
->leb_size
||
739 offs
& (c
->min_io_size
- 1))
742 /* Make sure we have not already looked at this bud */
743 bud
= ubifs_search_bud(c
, lnum
);
745 if (bud
->jhead
== jhead
&& bud
->start
<= offs
)
747 ubifs_err("bud at LEB %d:%d was already referred", lnum
, offs
);
755 * replay_log_leb - replay a log logical eraseblock.
756 * @c: UBIFS file-system description object
757 * @lnum: log logical eraseblock to replay
758 * @offs: offset to start replaying from
761 * This function replays a log LEB and returns zero in case of success, %1 if
762 * this is the last LEB in the log, and a negative error code in case of
765 static int replay_log_leb(struct ubifs_info
*c
, int lnum
, int offs
, void *sbuf
)
768 struct ubifs_scan_leb
*sleb
;
769 struct ubifs_scan_node
*snod
;
770 const struct ubifs_cs_node
*node
;
772 dbg_mnt("replay log LEB %d:%d", lnum
, offs
);
773 sleb
= ubifs_scan(c
, lnum
, offs
, sbuf
, c
->need_recovery
);
775 if (PTR_ERR(sleb
) != -EUCLEAN
|| !c
->need_recovery
)
776 return PTR_ERR(sleb
);
778 * Note, the below function will recover this log LEB only if
779 * it is the last, because unclean reboots can possibly corrupt
780 * only the tail of the log.
782 sleb
= ubifs_recover_log_leb(c
, lnum
, offs
, sbuf
);
784 return PTR_ERR(sleb
);
787 if (sleb
->nodes_cnt
== 0) {
793 snod
= list_entry(sleb
->nodes
.next
, struct ubifs_scan_node
, list
);
794 if (c
->cs_sqnum
== 0) {
796 * This is the first log LEB we are looking at, make sure that
797 * the first node is a commit start node. Also record its
798 * sequence number so that UBIFS can determine where the log
799 * ends, because all nodes which were have higher sequence
802 if (snod
->type
!= UBIFS_CS_NODE
) {
803 dbg_err("first log node at LEB %d:%d is not CS node",
807 if (le64_to_cpu(node
->cmt_no
) != c
->cmt_no
) {
808 dbg_err("first CS node at LEB %d:%d has wrong "
809 "commit number %llu expected %llu",
811 (unsigned long long)le64_to_cpu(node
->cmt_no
),
816 c
->cs_sqnum
= le64_to_cpu(node
->ch
.sqnum
);
817 dbg_mnt("commit start sqnum %llu", c
->cs_sqnum
);
820 if (snod
->sqnum
< c
->cs_sqnum
) {
822 * This means that we reached end of log and now
823 * look to the older log data, which was already
824 * committed but the eraseblock was not erased (UBIFS
825 * only un-maps it). So this basically means we have to
826 * exit with "end of log" code.
832 /* Make sure the first node sits at offset zero of the LEB */
833 if (snod
->offs
!= 0) {
834 dbg_err("first node is not at zero offset");
838 list_for_each_entry(snod
, &sleb
->nodes
, list
) {
841 if (snod
->sqnum
>= SQNUM_WATERMARK
) {
842 ubifs_err("file system's life ended");
846 if (snod
->sqnum
< c
->cs_sqnum
) {
847 dbg_err("bad sqnum %llu, commit sqnum %llu",
848 snod
->sqnum
, c
->cs_sqnum
);
852 if (snod
->sqnum
> c
->max_sqnum
)
853 c
->max_sqnum
= snod
->sqnum
;
855 switch (snod
->type
) {
856 case UBIFS_REF_NODE
: {
857 const struct ubifs_ref_node
*ref
= snod
->node
;
859 err
= validate_ref(c
, ref
);
861 break; /* Already have this bud */
865 err
= add_replay_bud(c
, le32_to_cpu(ref
->lnum
),
866 le32_to_cpu(ref
->offs
),
867 le32_to_cpu(ref
->jhead
),
875 /* Make sure it sits at the beginning of LEB */
876 if (snod
->offs
!= 0) {
877 ubifs_err("unexpected node in log");
882 ubifs_err("unexpected node in log");
887 if (sleb
->endpt
|| c
->lhead_offs
>= c
->leb_size
) {
888 c
->lhead_lnum
= lnum
;
889 c
->lhead_offs
= sleb
->endpt
;
894 ubifs_scan_destroy(sleb
);
898 ubifs_err("log error detected while replaying the log at LEB %d:%d",
899 lnum
, offs
+ snod
->offs
);
900 dbg_dump_node(c
, snod
->node
);
901 ubifs_scan_destroy(sleb
);
906 * take_ihead - update the status of the index head in lprops to 'taken'.
907 * @c: UBIFS file-system description object
909 * This function returns the amount of free space in the index head LEB or a
910 * negative error code.
912 static int take_ihead(struct ubifs_info
*c
)
914 const struct ubifs_lprops
*lp
;
919 lp
= ubifs_lpt_lookup_dirty(c
, c
->ihead_lnum
);
927 lp
= ubifs_change_lp(c
, lp
, LPROPS_NC
, LPROPS_NC
,
928 lp
->flags
| LPROPS_TAKEN
, 0);
936 ubifs_release_lprops(c
);
941 * ubifs_replay_journal - replay journal.
942 * @c: UBIFS file-system description object
944 * This function scans the journal, replays and cleans it up. It makes sure all
945 * memory data structures related to uncommitted journal are built (dirty TNC
946 * tree, tree of buds, modified lprops, etc).
948 int ubifs_replay_journal(struct ubifs_info
*c
)
950 int err
, i
, lnum
, offs
, free
;
952 BUILD_BUG_ON(UBIFS_TRUN_KEY
> 5);
954 /* Update the status of the index head in lprops to 'taken' */
955 free
= take_ihead(c
);
957 return free
; /* Error code */
959 if (c
->ihead_offs
!= c
->leb_size
- free
) {
960 ubifs_err("bad index head LEB %d:%d", c
->ihead_lnum
,
965 dbg_mnt("start replaying the journal");
967 lnum
= c
->ltail_lnum
= c
->lhead_lnum
;
968 offs
= c
->lhead_offs
;
970 for (i
= 0; i
< c
->log_lebs
; i
++, lnum
++) {
971 if (lnum
>= UBIFS_LOG_LNUM
+ c
->log_lebs
) {
973 * The log is logically circular, we reached the last
974 * LEB, switch to the first one.
976 lnum
= UBIFS_LOG_LNUM
;
979 err
= replay_log_leb(c
, lnum
, offs
, c
->sbuf
);
981 /* We hit the end of the log */
988 err
= replay_buds(c
);
992 err
= apply_replay_list(c
);
996 err
= set_buds_lprops(c
);
1001 * UBIFS budgeting calculations use @c->bi.uncommitted_idx variable
1002 * to roughly estimate index growth. Things like @c->bi.min_idx_lebs
1003 * depend on it. This means we have to initialize it to make sure
1004 * budgeting works properly.
1006 c
->bi
.uncommitted_idx
= atomic_long_read(&c
->dirty_zn_cnt
);
1007 c
->bi
.uncommitted_idx
*= c
->max_idx_node_sz
;
1009 ubifs_assert(c
->bud_bytes
<= c
->max_bud_bytes
|| c
->need_recovery
);
1010 dbg_mnt("finished, log head LEB %d:%d, max_sqnum %llu, "
1011 "highest_inum %lu", c
->lhead_lnum
, c
->lhead_offs
, c
->max_sqnum
,
1012 (unsigned long)c
->highest_inum
);
1014 destroy_replay_list(c
);
1015 destroy_bud_list(c
);
This page took 0.166177 seconds and 5 git commands to generate.