Searched refs:prod_tail (Results 1 – 4 of 4) sorted by relevance
166 uint32_t prod_tail; in buf_ring_dequeue_sc() local199 prod_tail = atomic_load_acq_32(&br->br_prod_tail); in buf_ring_dequeue_sc()206 if (cons_head == prod_tail) in buf_ring_dequeue_sc()210 if (cons_next != prod_tail) { in buf_ring_dequeue_sc()212 if (cons_next_next != prod_tail) in buf_ring_dequeue_sc()240 uint32_t prod_tail; in buf_ring_advance_sc() local243 prod_tail = br->br_prod_tail; in buf_ring_advance_sc()246 if (cons_head == prod_tail) in buf_ring_advance_sc()
136 uint32_t prod_tail; in __rte_ring_move_cons_head() local151 prod_tail = __atomic_load_n(&r->prod.tail, in __rte_ring_move_cons_head()159 *entries = (prod_tail - *old_head); in __rte_ring_move_cons_head()
491 uint32_t prod_tail = r->prod.tail; in rte_ring_count() local493 uint32_t count = (prod_tail - cons_tail) & r->mask; in rte_ring_count()538 uint32_t prod_tail = r->prod.tail; in rte_ring_empty() local540 return cons_tail == prod_tail; in rte_ring_empty()
94 The figures of the following sections refer to them as prod_head, prod_tail, cons_head and cons_tai…104 In this example, only the producer head and tail (prod_head and prod_tail) are modified,107 The initial state is to have a prod_head and prod_tail pointing at the same location.165 First, ring->cons_head and ring->prod_tail are copied in local variables.168 If there are not enough objects in the ring (this is detected by checking prod_tail), it returns an…211 In this example, only the producer head and tail (prod_head and prod_tail) are modified.213 The initial state is to have a prod_head and prod_tail pointing at the same location.272 Each core now wants to update ring->prod_tail.273 A core can only update it if ring->prod_tail is equal to the prod_head local variable.287 Once ring->prod_tail is updated by core 1, core 2 is allowed to update it too.[all …]