Home
last modified time | relevance | path

Searched refs:dn_key (Results 1 – 4 of 4) sorted by relevance

/dragonfly/sys/net/dummynet3/
HDip_dummynet3.h69 typedef uint64_t dn_key; /* sorting key */ typedef
99 dn_key key; /* sorting key. Topmost element is smallest one */
157 dn_key output_time; /* when the pkt is due for delivery */
257 dn_key sched_time; /* current time when queue enters ready_heap */
259 dn_key S, F; /* start time, finish time */
344 dn_key V; /* virtual time */
348 dn_key sched_time; /* time pipe was scheduled in ready_heap */
400 dn_key S; /* virtual start time */
401 dn_key F; /* virtual finish time */
441 dn_key V; /* virtual time */
HDip_dummynet3.c137 static dn_key curr_time = 0; /* current simulation time */
210 static int heap_insert(struct dn_heap *, dn_key, void *);
298 heap_insert(struct dn_heap *h, dn_key key1, void *p) in heap_insert()
519 dn_key t = SET_TICKS(pkt, q, p); /* ticks i have to wait */ in ready_event()
638 dn_key t = 0; /* Number of ticks i have to wait */ in ready_event_wfq()
1127 dn_key t = 0; in dummynet_io()
/dragonfly/sys/net/dummynet/
HDip_dummynet.h54 typedef uint64_t dn_key; /* sorting key */ typedef
84 dn_key key; /* sorting key. Topmost element is smallest one */
142 dn_key output_time; /* when the pkt is due for delivery */
242 dn_key sched_time; /* current time when queue enters ready_heap */
244 dn_key S, F; /* start time, finish time */
329 dn_key V; /* virtual time */
333 dn_key sched_time; /* time pipe was scheduled in ready_heap */
385 dn_key S; /* virtual start time */
386 dn_key F; /* virtual finish time */
426 dn_key V; /* virtual time */
HDip_dummynet.c107 static dn_key curr_time = 0; /* current simulation time */
191 static int heap_insert(struct dn_heap *, dn_key, void *);
279 heap_insert(struct dn_heap *h, dn_key key1, void *p) in heap_insert()
500 dn_key t = SET_TICKS(pkt, q, p); /* ticks i have to wait */ in ready_event()
619 dn_key t = 0; /* Number of ticks i have to wait */ in ready_event_wfq()
1108 dn_key t = 0; in dummynet_io()