Home
last modified time | relevance | path

Searched refs:heap_insert (Results 1 – 6 of 6) sorted by relevance

/f-stack/freebsd/netpfil/ipfw/
H A Ddn_sched_wf2q.c184 heap_insert(&si->ne_heap, alg_fq->S, q); in wf2qp_enqueue()
186 heap_insert(&si->sch_heap, alg_fq->F, q); in wf2qp_enqueue()
238 heap_insert(sch, alg_fq->F, q); in wf2qp_dequeue()
250 heap_insert(&si->idle_heap, alg_fq->F, q); in wf2qp_dequeue()
256 heap_insert(sch, alg_fq->F, q); in wf2qp_dequeue()
258 heap_insert(neh, alg_fq->S, q); in wf2qp_dequeue()
H A Ddn_heap.h104 int heap_insert(struct dn_heap *h, uint64_t key1, void *p);
H A Ddn_heap.c145 heap_insert(struct dn_heap *h, uint64_t key1, void *p) in heap_insert() function
224 heap_insert(h, father, NULL); in heap_extract()
282 heap_insert(h, i , NULL); in heapify()
H A Dip_dn_io.c572 heap_insert(&dn_cfg.evheap, pkt->output_time, dline); in transmit_event()
653 heap_insert(&dn_cfg.evheap, now + t, si); in serve_sched()
/f-stack/freebsd/netpfil/ipfw/test/
H A Dtest_dn_heap.c150 heap_insert(&h, n3 ? n-i: random(), (void *)(100+i)); in main()
/f-stack/app/redis-5.0.5/deps/jemalloc/test/unit/
H A Dph.c215 heap_insert(&heap, &nodes[k]); in TEST_BEGIN()