Searched refs:erasable_list (Results 1 - 14 of 14) sorted by relevance
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/fs/jffs2/ |
H A D | jffs2_fs_sb.h | 88 struct list_head erasable_list; /* Blocks which are completely dirty, and need erasing */ member in struct:jffs2_sb_info
|
H A D | nodemgmt.c | 67 * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks 226 !list_empty(&c->erasable_list)) { 229 ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list); 244 /* Have another go. It'll be on the erasable_list now */ 252 c->nr_erasing_blocks, c->nr_free_blocks, list_empty(&c->erasable_list)?"yes":"no", 629 D1(printk(KERN_DEBUG "...and adding to erasable_list\n")); 630 list_add_tail(&jeb->list, &c->erasable_list); 760 * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks
|
H A D | build.c | 356 INIT_LIST_HEAD(&c->erasable_list);
|
H A D | gc.c | 56 } else if (n < 50 && !list_empty(&c->erasable_list)) { 58 So don't favour the erasable_list _too_ much. */ 59 D1(printk(KERN_DEBUG "Picking block from erasable_list to GC next\n")); 60 nextlist = &c->erasable_list; 78 } else if (!list_empty(&c->erasable_list)) { 79 D1(printk(KERN_DEBUG "Picking block from erasable_list to GC next (clean_list and {very_,}dirty_list were empty)\n")); 81 nextlist = &c->erasable_list;
|
H A D | debug.c | 206 list_for_each_entry(jeb, &c->erasable_list, list) { 544 if (list_empty(&c->erasable_list)) { 545 printk(JFFS2_DBG "erasable_list: empty\n"); 549 list_for_each(this, &c->erasable_list) { 553 printk(JFFS2_DBG "erasable_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
|
H A D | scan.c | 1125 x = count_list(&c->erasable_list); 1128 rotate_list((&c->erasable_list), rotateby);
|
H A D | wbuf.c | 128 D1(printk(KERN_DEBUG "...and adding to erasable_list\n")); 129 list_add_tail(&jeb->list, &c->erasable_list);
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/fs/jffs2/ |
H A D | jffs2_fs_sb.h | 88 struct list_head erasable_list; /* Blocks which are completely dirty, and need erasing */ member in struct:jffs2_sb_info
|
H A D | nodemgmt.c | 67 * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks 226 !list_empty(&c->erasable_list)) { 229 ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list); 244 /* Have another go. It'll be on the erasable_list now */ 252 c->nr_erasing_blocks, c->nr_free_blocks, list_empty(&c->erasable_list)?"yes":"no", 629 D1(printk(KERN_DEBUG "...and adding to erasable_list\n")); 630 list_add_tail(&jeb->list, &c->erasable_list); 760 * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks
|
H A D | build.c | 356 INIT_LIST_HEAD(&c->erasable_list);
|
H A D | gc.c | 56 } else if (n < 50 && !list_empty(&c->erasable_list)) { 58 So don't favour the erasable_list _too_ much. */ 59 D1(printk(KERN_DEBUG "Picking block from erasable_list to GC next\n")); 60 nextlist = &c->erasable_list; 78 } else if (!list_empty(&c->erasable_list)) { 79 D1(printk(KERN_DEBUG "Picking block from erasable_list to GC next (clean_list and {very_,}dirty_list were empty)\n")); 81 nextlist = &c->erasable_list;
|
H A D | debug.c | 206 list_for_each_entry(jeb, &c->erasable_list, list) { 544 if (list_empty(&c->erasable_list)) { 545 printk(JFFS2_DBG "erasable_list: empty\n"); 549 list_for_each(this, &c->erasable_list) { 553 printk(JFFS2_DBG "erasable_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
|
H A D | scan.c | 1125 x = count_list(&c->erasable_list); 1128 rotate_list((&c->erasable_list), rotateby);
|
H A D | wbuf.c | 128 D1(printk(KERN_DEBUG "...and adding to erasable_list\n")); 129 list_add_tail(&jeb->list, &c->erasable_list);
|
Completed in 193 milliseconds