Lines Matching defs:heap
57 struct ubifs_lpt_heap *heap;
63 heap = &c->lpt_heap[cat - 1];
64 if (heap->cnt < heap->max_cnt)
141 struct ubifs_lpt_heap *heap;
145 /* There may be an LEB with enough dirty space on the free heap */
146 heap = &c->lpt_heap[LPROPS_FREE - 1];
147 for (i = 0; i < heap->cnt; i++) {
148 lprops = heap->arr[i];
156 * A LEB may have fallen off of the bottom of the dirty heap, and ended
211 * dirty index heap, and it falls-back to LPT scanning if the heaps are empty
238 struct ubifs_lpt_heap *heap, *idx_heap;
284 heap = &c->lpt_heap[LPROPS_DIRTY - 1];
304 if (heap->cnt) {
305 lp = heap->arr[0];
412 struct ubifs_lpt_heap *heap;
431 /* There may be an LEB with enough free space on the dirty heap */
432 heap = &c->lpt_heap[LPROPS_DIRTY - 1];
433 for (i = 0; i < heap->cnt; i++) {
434 lprops = heap->arr[i];
439 * A LEB may have fallen off of the bottom of the free heap, and ended
772 /* Copy the LPROPS_DIRTY_IDX heap */
841 struct ubifs_lpt_heap *heap;
847 heap = &c->lpt_heap[LPROPS_DIRTY_IDX - 1];
848 for (i = 0; i < heap->cnt; i++) {
849 lprops = heap->arr[i];