Lines Matching refs:idle_heap
682 heap_insert(&(p->idle_heap), q->F, q);
717 && p->idle_heap.elements > 0) {
723 for (i = 0 ; i < p->idle_heap.elements ; i++) {
724 struct dn_flow_queue *q = p->idle_heap.p[i].object ;
731 p->idle_heap.elements = 0 ;
809 if (pe->idle_heap.elements > 0 &&
810 DN_KEY_LT(pe->idle_heap.p[0].key, pe->V) ) {
811 struct dn_flow_queue *q = pe->idle_heap.p[0].object ;
813 heap_extract(&(pe->idle_heap), NULL);
1293 * idle_heap and set S to max(F,V).
1302 heap_extract(&(pipe->idle_heap), q);
1438 heap_free( &(pipe->idle_heap) );
1673 /* idle_heap is the only one from which we extract from the middle.
1675 x->idle_heap.size = x->idle_heap.elements = 0 ;
1676 x->idle_heap.offset=OFFSET_OF(struct dn_flow_queue, heap_pos);
1901 #if 1 /* XXX should i remove from idle_heap as well ? */
1902 fs_remove_from_heap(&(b->pipe->idle_heap), b);