Searched defs:child (Results 1 - 18 of 18) sorted by relevance

/net/dccp/
H A Dminisocks.c158 struct sock *child = NULL; local
199 child = inet_csk(sk)->icsk_af_ops->syn_recv_sock(sk, skb, req, NULL);
200 if (child == NULL)
205 inet_csk_reqsk_queue_add(sk, req, child);
207 return child;
226 int dccp_child_process(struct sock *parent, struct sock *child, argument
230 const int state = child->sk_state;
232 if (!sock_owned_by_user(child)) {
233 ret = dccp_rcv_state_process(child, skb, dccp_hdr(skb),
237 if (state == DCCP_RESPOND && child
[all...]
/net/ipv4/
H A Dtcp_fastopen.c136 struct sock *child; local
142 child = inet_csk(sk)->icsk_af_ops->syn_recv_sock(sk, skb, req, NULL);
143 if (child == NULL)
150 /* Initialize the child socket. Have to fix some values to take
151 * into account the child is a Fast Open socket and is created
154 tp = tcp_sk(child);
158 * closed, the child that has been accepted can live on and still
173 inet_csk_reset_xmit_timer(child, ICSK_TIME_RETRANS,
176 /* Add the child socket directly into the accept queue */
177 inet_csk_reqsk_queue_add(sk, req, child);
[all...]
H A Dsyncookies.c205 struct sock *child; local
207 child = icsk->icsk_af_ops->syn_recv_sock(sk, skb, req, dst);
208 if (child)
209 inet_csk_reqsk_queue_add(sk, req, child);
213 return child;
H A Dtcp_minisocks.c523 * points to the child socket.
537 struct sock *child; local
646 * elsewhere and is checked directly against the child socket rather
700 * child socket).
719 child = inet_csk(sk)->icsk_af_ops->syn_recv_sock(sk, skb, req, NULL);
720 if (child == NULL)
726 inet_csk_reqsk_queue_add(sk, req, child);
727 return child;
760 * For the vast majority of cases child->sk_state will be TCP_SYN_RECV
767 int tcp_child_process(struct sock *parent, struct sock *child, argument
[all...]
H A Dinet_hashtables.c131 int __inet_inherit_port(struct sock *sk, struct sock *child) argument
134 unsigned short port = inet_sk(child)->inet_num;
146 * as that of the child socket. We have to look up or
147 * create a new bind bucket for the child here. */
162 inet_bind_hash(child, tb, port);
H A Dinet_connection_sock.c331 * NULL to signify that the child socket is taken
805 struct sock *child = req->sk; local
810 bh_lock_sock(child);
811 WARN_ON(sock_owned_by_user(child));
812 sock_hold(child);
814 sk->sk_prot->disconnect(child, O_NONBLOCK);
816 sock_orphan(child);
821 BUG_ON(tcp_sk(child)->fastopen_rsk != req);
825 * an inbound pkt destined for child is
830 tcp_sk(child)
[all...]
H A Dfib_trie.c129 struct rt_trie_node __rcu *child[0]; member in struct:tnode
220 return rtnl_dereference(tn->child[i]);
230 return rcu_dereference_rtnl(tn->child[i]);
321 index into the parent's child array. That is, they will be used to find
331 n's child array, and will of course be different for each child.
489 * Add a child at position i overwriting the old value.
496 struct rt_trie_node *chi = rtnl_dereference(tn->child[i]);
520 rcu_assign_pointer(tn->child[i], n);
543 /* One child */
[all...]
/net/core/
H A Ddst.c174 dst->child = NULL;
237 struct dst_entry *child; local
242 child = dst->child;
253 dst = child;
258 /* We were real parent of this dst, so kill child. */
/net/ipv6/
H A Dsyncookies.c49 struct sock *child; local
51 child = icsk->icsk_af_ops->syn_recv_sock(sk, skb, req, dst);
52 if (child)
53 inet_csk_reqsk_queue_add(sk, req, child);
57 return child;
H A Dip6_fib.c1174 struct fib6_node *child, *pn; local
1187 child = NULL;
1189 child = fn->right, children |= 1;
1191 child = fn->left, children |= 2;
1195 /* Subtree root (i.e. fn) may have one child */
1220 pn->right = child;
1222 pn->left = child;
1227 if (child)
1228 child->parent = pn;
1236 if (!child) {
[all...]
/net/sched/
H A Dsch_multiq.c219 struct Qdisc *child = q->queues[i]; local
221 qdisc_tree_decrease_qlen(child, child->q.qlen);
222 qdisc_destroy(child);
230 struct Qdisc *child, *old; local
231 child = qdisc_create_dflt(sch->dev_queue,
235 if (child) {
238 q->queues[i] = child;
H A Dsch_prio.c191 struct Qdisc *child = q->queues[i]; local
193 if (child != &noop_qdisc) {
194 qdisc_tree_decrease_qlen(child, child->q.qlen);
195 qdisc_destroy(child);
202 struct Qdisc *child, *old; local
204 child = qdisc_create_dflt(sch->dev_queue,
207 if (child) {
210 q->queues[i] = child;
H A Dsch_red.c62 struct Qdisc *child = q->qdisc; local
67 child->qstats.backlog);
98 ret = qdisc_enqueue(skb, child);
116 struct Qdisc *child = q->qdisc; local
118 skb = child->dequeue(child);
132 struct Qdisc *child = q->qdisc; local
134 return child->ops->peek(child);
140 struct Qdisc *child local
184 struct Qdisc *child = NULL; local
[all...]
H A Dsch_tbf.c318 struct Qdisc *child = NULL; local
393 child = fifo_create_dflt(sch, &bfifo_qdisc_ops, qopt->limit);
394 if (IS_ERR(child)) {
395 err = PTR_ERR(child);
401 if (child) {
404 q->qdisc = child;
H A Dsch_sfb.c81 u32 childdrop; /* drops in child qdisc */
283 struct Qdisc *child = q->qdisc; local
408 ret = qdisc_enqueue(skb, child);
431 struct Qdisc *child = q->qdisc; local
434 skb = child->dequeue(q->qdisc);
448 struct Qdisc *child = q->qdisc; local
450 return child->ops->peek(child);
453 /* No sfb_drop -- impossible since the child doesn't return the dropped skb. */
494 struct Qdisc *child; local
[all...]
H A Dsch_cbq.c629 static int cbq_reshape_fail(struct sk_buff *skb, struct Qdisc *child) argument
631 struct Qdisc *sch = child->__parent;
/net/dsa/
H A Ddsa.c442 struct device_node *child, *mdio, *ethernet, *port, *link; local
486 for_each_available_child_of_node(np, child) {
490 cd->of_node = child;
493 sw_addr = of_get_property(child, "reg", NULL);
501 for_each_available_child_of_node(child, port) {
/net/sunrpc/
H A Drpcb_clnt.c677 struct rpc_task *child; local
780 child = rpcb_call_async(rpcb_clnt, map, proc);
782 if (IS_ERR(child)) {
790 rpc_put_task(child);
803 * Rpcbind child task calls this callback via tk_exit.
805 static void rpcb_getport_done(struct rpc_task *child, void *data) argument
809 int status = child->tk_status;
834 child->tk_pid, status, map->r_port);

Completed in 883 milliseconds