Searched refs:first_n (Results 1 – 2 of 2) sorted by relevance
1140 u32 first_n; in copy_partial_exec_reqs() local1152 for (first_n = 0; first_n < slice->nents; first_n++) in copy_partial_exec_reqs()1153 if (last_bytes > le32_to_cpu(reqs[first_n].len)) in copy_partial_exec_reqs()1154 last_bytes -= le32_to_cpu(reqs[first_n].len); in copy_partial_exec_reqs()1158 if (avail < (first_n + 1)) in copy_partial_exec_reqs()1161 if (first_n) { in copy_partial_exec_reqs()1162 if (tail + first_n > dbc->nelem) { in copy_partial_exec_reqs()1164 avail = min_t(u32, avail, first_n); in copy_partial_exec_reqs()1167 avail = first_n - avail; in copy_partial_exec_reqs()1171 memcpy(fifo_at(dbc->req_q_base, tail), reqs, sizeof(*reqs) * first_n); in copy_partial_exec_reqs()[all …]
4186 struct llist_node *ll_list, *first_n; in __dev_xmit_skb() local4229 first_n = READ_ONCE(q->defer_list.first); in __dev_xmit_skb()4231 if (first_n && !defer_count) { in __dev_xmit_skb()4238 skb->ll_node.next = first_n; in __dev_xmit_skb()4239 } while (!try_cmpxchg(&q->defer_list.first, &first_n, &skb->ll_node)); in __dev_xmit_skb()4244 if (first_n) in __dev_xmit_skb()