Searched refs:cons_head (Results 1 – 2 of 2) sorted by relevance
157 cons_next = cons_head + 1; in buf_ring_dequeue_mc()165 cons_idx = cons_head & mask; in buf_ring_dequeue_mc()198 cons_head = br->br_cons_head; in buf_ring_dequeue_sc()201 cons_next = cons_head + 1; in buf_ring_dequeue_sc()203 if (cons_head == prod_tail) in buf_ring_dequeue_sc()206 cons_idx = cons_head & mask; in buf_ring_dequeue_sc()238 cons_head = br->br_cons_head; in buf_ring_advance_sc()241 cons_next = cons_head + 1; in buf_ring_advance_sc()242 if (cons_head == prod_tail) in buf_ring_advance_sc()296 if (cons_head == prod_tail) in buf_ring_peek()[all …]
615 uint64_t cons_head; /* cached copy */ member859 q->cons_head = q->_head; in cons()862 struct q_pkt *p = pkt_at(q, q->cons_head); in cons()866 if (q->cons_head == q->cons_tail) { //reset record in cons()873 q->cons_head = 0; //restart from beginning of the queue in cons()902 q->cons_head = p->next; in cons()