heap_insert
if (heap_insert(ctx->timers, id) < 0)
heap_insert(&ready_heap, curr_time + t, q);
heap_insert(&pipe->not_eligible_heap, q->S, q);
heap_insert(&pipe->scheduler_heap, q->F, q);
static int heap_insert(struct dn_heap *, dn_key, void *);
heap_insert(h, father, NULL); /* This one cannot fail */
heap_insert(h, i , NULL);
heap_insert(&extract_heap, pkt->output_time, pipe);
heap_insert(&ready_heap, curr_time + t, q);
heap_insert(&p->idle_heap, q->F, q);
heap_insert(neh, q->S, q);
heap_insert(sch, q->F, q);
heap_insert(sch, q->F, q);
heap_insert(&wfq_ready_heap, curr_time + t, p);
heap_insert(&ready_heap, curr_time + t, q);
heap_insert(&pipe->not_eligible_heap, q->S, q);
heap_insert(&pipe->scheduler_heap, q->F, q);
static int heap_insert(struct dn_heap *, dn_key, void *);
heap_insert(h, father, NULL); /* This one cannot fail */
heap_insert(h, i , NULL);
heap_insert(&extract_heap, pkt->output_time, pipe);
heap_insert(&ready_heap, curr_time + t, q);
heap_insert(&p->idle_heap, q->F, q);
heap_insert(neh, q->S, q);
heap_insert(sch, q->F, q);
heap_insert(sch, q->F, q);
heap_insert(&wfq_ready_heap, curr_time + t, p);