57 	struct ubifs_lpt_heap *heap;  in valuable()  local
63 		heap = &c->lpt_heap[cat - 1];  in valuable()
64 		if (heap->cnt < heap->max_cnt)  in valuable()
141 	struct ubifs_lpt_heap *heap;  in scan_for_dirty()  local
146 	heap = &c->lpt_heap[LPROPS_FREE - 1];  in scan_for_dirty()
147 	for (i = 0; i < heap->cnt; i++) {  in scan_for_dirty()
148 		lprops = heap->arr[i];  in scan_for_dirty()
238 	struct ubifs_lpt_heap *heap, *idx_heap;  in ubifs_find_dirty_leb()  local
284 	heap = &c->lpt_heap[LPROPS_DIRTY - 1];  in ubifs_find_dirty_leb()
304 	if (heap->cnt) {  in ubifs_find_dirty_leb()
305 		lp = heap->arr[0];  in ubifs_find_dirty_leb()
412 	struct ubifs_lpt_heap *heap;  in do_find_free_space()  local
432 	heap = &c->lpt_heap[LPROPS_DIRTY - 1];  in do_find_free_space()
433 	for (i = 0; i < heap->cnt; i++) {  in do_find_free_space()
434 		lprops = heap->arr[i];  in do_find_free_space()
838 	struct ubifs_lpt_heap *heap;  in find_dirty_idx_leb()  local
844 	heap = &c->lpt_heap[LPROPS_DIRTY_IDX - 1];  in find_dirty_idx_leb()
845 	for (i = 0; i < heap->cnt; i++) {  in find_dirty_idx_leb()
846 		lprops = heap->arr[i];  in find_dirty_idx_leb()