Searched refs:first (Results 1 - 25 of 30) sorted by relevance

12

/net/rds/
H A Dib_send.c513 * This can be called multiple times for a given message. The first time
531 struct rds_ib_send_work *first; local
589 /* map the message the first time we see it */
634 * should call rds_ib_ring_alloc first. */
659 first = send;
756 failed_wr = &first->s_wr;
757 ret = ib_post_send(ic->i_cm_id->qp, &first->s_wr, &failed_wr);
758 rdsdebug("ic %p first %p (wr %p) ret %d wr %p\n", ic,
759 first, &first
879 struct rds_ib_send_work *first; local
[all...]
H A Diw_send.c484 * This can be called multiple times for a given message. The first time
502 struct rds_iw_send_work *first; local
557 /* map the message the first time we see it */
610 * should call rds_iw_ring_alloc first. */
623 first = send;
746 failed_wr = &first->s_wr;
747 ret = ib_post_send(ic->i_cm_id->qp, &first->s_wr, &failed_wr);
748 rdsdebug("ic %p first %p (wr %p) ret %d wr %p\n", ic,
749 first, &first
792 struct rds_iw_send_work *first; local
[all...]
H A Dib_recv.c111 head->first = NULL;
142 if (head->first) {
143 list_splice_entire_tail(head->first, caller_list);
144 head->first = NULL;
428 chpfirst = __this_cpu_read(cache->percpu->first);
434 __this_cpu_write(cache->percpu->first, new_item);
441 * Return our per-cpu first list to the cache's xfer by atomically
454 __this_cpu_write(cache->percpu->first, NULL);
H A Dib.h48 struct list_head *first; member in struct:rds_ib_cache_head
/net/sched/
H A Dsch_fq.c60 struct sk_buff *head; /* list of skbs for this flow : first skb */
77 struct fq_flow *first; member in struct:fq_flow_head
156 if (head->first)
159 head->first = flow;
429 if (!head->first) {
431 if (!head->first) {
439 f = head->first;
443 head->first = f->next;
449 head->first = f->next;
456 head->first
[all...]
H A Dcls_api.c106 u32 first = TC_H_MAKE(0xC0000000U, 0U); local
109 first = tp->prio - 1;
111 return first;
H A DKconfig10 device, it has to decide which ones to send first, which ones to
16 is a FIFO (first come, first served). If you say Y here, you will be
334 command, only packets up to the first plug are released for delivery.
/net/ax25/
H A Dax25_out.c124 int frontlen, len, fragno, ka9qfrag, first = 1; local
171 if (first) {
173 first = 0;
/net/netfilter/ipset/
H A Dip_set_bitmap_gen.h205 u32 id, first = cb->args[IPSET_CB_ARG0]; local
223 if (id == first) {
245 if (unlikely(id == first)) {
H A Dip_set_list_set.c505 u32 i, first = cb->args[IPSET_CB_ARG0]; local
522 if (i == first) {
543 if (unlikely(i == first)) {
H A Dip_set_hash_gen.h69 u8 pos; /* position of the first free entry */
114 /* Round up to the first 2^n value */
294 /* Add in increasing prefix order, so larger cidr first */
642 /* Choosing the first entry in the array to replace */
677 /* Reuse first timed out entry */
960 u32 first = cb->args[IPSET_CB_ARG0]; local
984 if (cb->args[IPSET_CB_ARG0] == first) {
1005 if (unlikely(first == cb->args[IPSET_CB_ARG0])) {
/net/netrom/
H A Dnr_route.c596 * Find the first active NET/ROM device, usually "nr0".
600 struct net_device *dev, *first = NULL; local
605 if (first == NULL || strncmp(dev->name, first->name, 3) < 0)
606 first = dev;
608 if (first)
609 dev_hold(first);
612 return first;
/net/caif/
H A Dcfctrl.c143 struct cfctrl_request_info *p, *tmp, *first; local
145 first = list_first_entry(&ctrl->list, struct cfctrl_request_info, list);
149 if (p != first)
/net/rose/
H A Drose_route.c138 * later when we are searching this list the first match will be the
606 * Find the first active ROSE device, usually "rose0".
610 struct net_device *dev, *first = NULL; local
615 if (first == NULL || strncmp(dev->name, first->name, 3) < 0)
616 first = dev;
620 return first;
/net/tipc/
H A Dlink.c859 u32 first = buf_seqno(buf); local
861 while (buf && less(first, r_q_head)) {
862 first = mod(first + 1);
865 l_ptr->retransm_queue_head = r_q_head = first;
866 l_ptr->retransm_queue_size = r_q_size = mod(last - first);
897 u32 first = buf_seqno(l_ptr->first_out); local
899 if (mod(next - first) < l_ptr->queue_limit[0]) {
1742 * duplicate of the first link's send queue via the new link. This way, we
/net/batman-adv/
H A Dfragmentation.c226 * Expand the first skb in the chain and copy the content of the remaining
245 /* Remove first entry, as this is the destination for the rest of the
248 entry = hlist_entry(chain->first, struct batadv_frag_list_entry, list);
/net/ipv4/
H A Digmp.c127 * joining a group, but we delay the first report by a
435 int scount, stotal, first, isquery, truncate; local
463 first = 1;
480 first*sizeof(struct igmpv3_grec)) {
481 if (truncate && !first)
488 first = 1;
491 if (first) {
493 first = 0;
H A Dudp.c221 unsigned short first, last; local
228 first = reciprocal_scale(rand, remaining) + low;
233 last = first + udptable->mask + 1;
235 hslot = udp_hashslot(udptable, net, first);
241 snum = first;
253 } while (snum != first);
255 } while (++first != last);
605 * header points to the first 8 bytes of the udp header. We need
1165 * first_packet_length - return length of first packet in receive queue
1906 * if the first socke
[all...]
/net/ipv6/
H A Dmcast.c1705 int scount, stotal, first, isquery, truncate; local
1733 first = 1;
1750 first*sizeof(struct mld2_grec)) {
1751 if (truncate && !first)
1758 first = 1;
1761 if (first) {
1763 first = 0;
/net/sunrpc/auth_gss/
H A Dauth_gss.c573 /* XXX: warning on the first, under the assumption we
1027 * Note: if we created the old pipe first, then someone who
1030 * the new pipe first.
1725 int first, last, i; local
1732 first = snd_buf->page_base >> PAGE_CACHE_SHIFT;
1734 rqstp->rq_enc_pages_num = last - first + 1 + 1;
1765 int first; local
1779 first = snd_buf->page_base >> PAGE_CACHE_SHIFT;
1780 inpages = snd_buf->pages + first;
1782 snd_buf->page_base -= first << PAGE_CACHE_SHIF
[all...]
/net/rxrpc/
H A Drxkad.c164 __be32 first; /* first four bytes of data and padding */ member in struct:__anon146
176 memcpy(&tmpbuf.first, sechdr + 4, sizeof(tmpbuf.first));
/net/ipv4/netfilter/
H A DKconfig341 first in the netfilter framework and hooks in at the PREROUTING
/net/netfilter/
H A Dnfnetlink_queue_core.c1188 return q->instance_table[st->bucket].first;
1206 h = q->instance_table[st->bucket].first;
/net/sunrpc/
H A Dauth.c412 cred = hlist_entry(head->first, struct rpc_cred, cr_hash);
/net/atm/
H A Dlec.c50 * 1 = 30 first bytes
840 e = tbl->first;
842 e = tbl->first;
2080 * Not found, snatch address from first data packet that arrives

Completed in 4338 milliseconds

12