dn_key
static dn_key curr_time = 0; /* current simulation time */
dn_key t = 0;
static int heap_insert(struct dn_heap *, dn_key, void *);
heap_insert(struct dn_heap *h, dn_key key1, void *p)
dn_key t = SET_TICKS(pkt, q, p); /* ticks i have to wait */
dn_key t = 0; /* Number of ticks i have to wait */
dn_key output_time; /* when the pkt is due for delivery */
dn_key sched_time; /* current time when queue enters ready_heap */
dn_key S, F; /* start time, finish time */
dn_key V; /* virtual time */
dn_key sched_time; /* time pipe was scheduled in ready_heap */
dn_key S; /* virtual start time */
dn_key F; /* virtual finish time */
dn_key V; /* virtual time */
dn_key key; /* sorting key. Topmost element is smallest one */
dn_key t = 0;
static dn_key curr_time = 0; /* current simulation time */
static int heap_insert(struct dn_heap *, dn_key, void *);
heap_insert(struct dn_heap *h, dn_key key1, void *p)
dn_key t = SET_TICKS(pkt, q, p); /* ticks i have to wait */
dn_key t = 0; /* Number of ticks i have to wait */
dn_key output_time; /* when the pkt is due for delivery */
dn_key sched_time; /* current time when queue enters ready_heap */
dn_key S, F; /* start time, finish time */
dn_key V; /* virtual time */
dn_key sched_time; /* time pipe was scheduled in ready_heap */
dn_key S; /* virtual start time */
dn_key F; /* virtual finish time */
dn_key V; /* virtual time */
dn_key key; /* sorting key. Topmost element is smallest one */