45 	struct ubifs_lpt_heap *heap;  in valuable()  local
51 		heap = &c->lpt_heap[cat - 1];  in valuable()
52 		if (heap->cnt < heap->max_cnt)  in valuable()
129 	struct ubifs_lpt_heap *heap;  in scan_for_dirty()  local
133 	/* There may be an LEB with enough dirty space on the free heap */  in scan_for_dirty()
134 	heap = &c->lpt_heap[LPROPS_FREE - 1];  in scan_for_dirty()
135 	for (i = 0; i < heap->cnt; i++) {  in scan_for_dirty()
136 		lprops = heap->arr[i];  in scan_for_dirty()
144 	 * A LEB may have fallen off of the bottom of the dirty heap, and ended  in scan_for_dirty()
199  * dirty index heap, and it falls-back to LPT scanning if the heaps are empty
226 	struct ubifs_lpt_heap *heap, *idx_heap;  in ubifs_find_dirty_leb()  local
272 	heap = &c->lpt_heap[LPROPS_DIRTY - 1];  in ubifs_find_dirty_leb()
292 	if (heap->cnt) {  in ubifs_find_dirty_leb()
293 		lp = heap->arr[0];  in ubifs_find_dirty_leb()
400 	struct ubifs_lpt_heap *heap;  in do_find_free_space()  local
419 	/* There may be an LEB with enough free space on the dirty heap */  in do_find_free_space()
420 	heap = &c->lpt_heap[LPROPS_DIRTY - 1];  in do_find_free_space()
421 	for (i = 0; i < heap->cnt; i++) {  in do_find_free_space()
422 		lprops = heap->arr[i];  in do_find_free_space()
427 	 * A LEB may have fallen off of the bottom of the free heap, and ended  in do_find_free_space()
751 	/* Copy the LPROPS_DIRTY_IDX heap */  in ubifs_save_dirty_idx_lnums()
819 	struct ubifs_lpt_heap *heap;  in find_dirty_idx_leb()  local
825 	heap = &c->lpt_heap[LPROPS_DIRTY_IDX - 1];  in find_dirty_idx_leb()
826 	for (i = 0; i < heap->cnt; i++) {  in find_dirty_idx_leb()
827 		lprops = heap->arr[i];  in find_dirty_idx_leb()