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