Lines Matching refs:idle_heap
472 bcopy( &(p->idle_heap), &(pipe_bp->idle_heap), sizeof(struct dn_heap_32));
473 pipe_bp->idle_heap.p = CAST_DOWN_EXPLICIT(user32_addr_t, pipe_bp->idle_heap.p);
513 bcopy( &(p->idle_heap), &(pipe_bp->idle_heap), sizeof(struct dn_heap_64));
514 pipe_bp->idle_heap.p = CAST_DOWN(user64_addr_t, pipe_bp->idle_heap.p);
918 heap_insert(&(p->idle_heap), q->F, q);
953 && p->idle_heap.elements > 0) {
959 for (i = 0 ; i < p->idle_heap.elements ; i++) {
960 struct dn_flow_queue *q = p->idle_heap.p[i].object ;
967 p->idle_heap.elements = 0 ;
1058 if (pe->idle_heap.elements > 0 &&
1059 DN_KEY_LT(pe->idle_heap.p[0].key, pe->V) ) {
1060 struct dn_flow_queue *q = pe->idle_heap.p[0].object ;
1062 heap_extract(&(pe->idle_heap), NULL);
1726 * idle_heap and set S to max(F,V).
1735 heap_extract(&(pipe->idle_heap), q);
1876 heap_free( &(pipe->idle_heap) );
2114 /* idle_heap is the only one from which we extract from the middle.
2116 x->idle_heap.size = x->idle_heap.elements = 0 ;
2117 x->idle_heap.offset=offsetof(struct dn_flow_queue, heap_pos);
2340 #if 1 /* XXX should i remove from idle_heap as well ? */
2341 fs_remove_from_heap(&(b->pipe->idle_heap), b);