gc.c (4e73e0eb633f8a1b5cbf20e7f42c6dbfec1d1ca7) gc.c (348709bad348d2fd013e1529b4cf5f220717c328)
1/*
2 * This file is part of UBIFS.
3 *
4 * Copyright (C) 2006-2008 Nokia Corporation.
5 *
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.

--- 515 unchanged lines hidden (view full) ---

524 c->need_recovery);
525 ubifs_assert(c->gc_lnum != lnum);
526 ubifs_assert(wbuf->lnum != lnum);
527
528 /*
529 * We scan the entire LEB even though we only really need to scan up to
530 * (c->leb_size - lp->free).
531 */
1/*
2 * This file is part of UBIFS.
3 *
4 * Copyright (C) 2006-2008 Nokia Corporation.
5 *
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.

--- 515 unchanged lines hidden (view full) ---

524 c->need_recovery);
525 ubifs_assert(c->gc_lnum != lnum);
526 ubifs_assert(wbuf->lnum != lnum);
527
528 /*
529 * We scan the entire LEB even though we only really need to scan up to
530 * (c->leb_size - lp->free).
531 */
532 sleb = ubifs_scan(c, lnum, 0, c->sbuf);
532 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 0);
533 if (IS_ERR(sleb))
534 return PTR_ERR(sleb);
535
536 ubifs_assert(!list_empty(&sleb->nodes));
537 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list);
538
539 if (snod->type == UBIFS_IDX_NODE) {
540 struct ubifs_gced_idx_leb *idx_gc;

--- 493 unchanged lines hidden --- 		533 if (IS_ERR(sleb))
534 return PTR_ERR(sleb);
535
536 ubifs_assert(!list_empty(&sleb->nodes));
537 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list);
538
539 if (snod->type == UBIFS_IDX_NODE) {
540 struct ubifs_gced_idx_leb *idx_gc;

--- 493 unchanged lines hidden ---