Lines Matching refs:cnt
64 if (heap->cnt < heap->max_cnt) in valuable()
147 for (i = 0; i < heap->cnt; i++) { in scan_for_dirty()
287 if (idx_heap->cnt && !exclude_index) { in ubifs_find_dirty_leb()
304 if (heap->cnt) { in ubifs_find_dirty_leb()
433 for (i = 0; i < heap->cnt; i++) { in do_find_free_space()
773 c->dirty_idx.cnt = c->lpt_heap[LPROPS_DIRTY_IDX - 1].cnt; in ubifs_save_dirty_idx_lnums()
775 sizeof(void *) * c->dirty_idx.cnt); in ubifs_save_dirty_idx_lnums()
777 sort(c->dirty_idx.arr, c->dirty_idx.cnt, sizeof(void *), in ubifs_save_dirty_idx_lnums()
780 dbg_find("found %d dirty index LEBs", c->dirty_idx.cnt); in ubifs_save_dirty_idx_lnums()
781 if (c->dirty_idx.cnt) in ubifs_save_dirty_idx_lnums()
783 c->dirty_idx.arr[c->dirty_idx.cnt - 1]->lnum, in ubifs_save_dirty_idx_lnums()
784 c->dirty_idx.arr[c->dirty_idx.cnt - 1]->dirty, in ubifs_save_dirty_idx_lnums()
785 c->dirty_idx.arr[c->dirty_idx.cnt - 1]->free); in ubifs_save_dirty_idx_lnums()
787 for (i = 0; i < c->dirty_idx.cnt; i++) in ubifs_save_dirty_idx_lnums()
848 for (i = 0; i < heap->cnt; i++) { in find_dirty_idx_leb()
933 if (!c->dirty_idx.cnt) in find_dirtiest_idx_leb()
936 lnum = (size_t)c->dirty_idx.arr[--c->dirty_idx.cnt]; in find_dirtiest_idx_leb()