dn_flow_queue
struct dn_flow_queue *q = NULL;
struct dn_flow_queue *q;
x->idle_heap.offset = __offsetof(struct dn_flow_queue, heap_pos);
struct dn_flow_queue *q;
if (((struct dn_flow_queue *)h->p[i].object)->fs == fs) {
const struct dn_flow_queue *q;
static void ready_event(struct dn_flow_queue *);
move_pkt(struct dn_pkt *pkt, struct dn_flow_queue *q,
ready_event(struct dn_flow_queue *q)
struct dn_flow_queue *q = sch->p[0].object;
struct dn_flow_queue *q = neh->p[0].object;
struct dn_flow_queue *q = p->idle_heap.p[i].object;
struct dn_flow_queue *q = pipe->idle_heap.p[0].object;
struct dn_flow_queue *q, *qn;
static struct dn_flow_queue *
struct dn_flow_queue *q;
static struct dn_flow_queue *
struct dn_flow_queue *q;
struct dn_flow_queue *qn;
red_drops(struct dn_flow_set *fs, struct dn_flow_queue *q, int len)
LIST_ENTRY(dn_flow_queue) q_link;
LIST_HEAD(dn_flowqueue_head, dn_flow_queue);
struct dn_flow_queue *q = NULL;
struct dn_flow_queue *q;
x->idle_heap.offset = __offsetof(struct dn_flow_queue, heap_pos);
struct dn_flow_queue *q;
if (((struct dn_flow_queue *)h->p[i].object)->fs == fs) {
const struct dn_flow_queue *q;
static void ready_event(struct dn_flow_queue *);
move_pkt(struct dn_pkt *pkt, struct dn_flow_queue *q,
ready_event(struct dn_flow_queue *q)
struct dn_flow_queue *q = sch->p[0].object;
struct dn_flow_queue *q = neh->p[0].object;
struct dn_flow_queue *q = p->idle_heap.p[i].object;
struct dn_flow_queue *q = pipe->idle_heap.p[0].object;
struct dn_flow_queue *q, *qn;
static struct dn_flow_queue *
struct dn_flow_queue *q;
static struct dn_flow_queue *
struct dn_flow_queue *q;
struct dn_flow_queue *qn;
red_drops(struct dn_flow_set *fs, struct dn_flow_queue *q, int len)
LIST_ENTRY(dn_flow_queue) q_link;
LIST_HEAD(dn_flowqueue_head, dn_flow_queue);