sock.c 88.4 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0-or-later
L
Linus Torvalds 已提交
2 3 4 5 6 7 8 9
/*
 * INET		An implementation of the TCP/IP protocol suite for the LINUX
 *		operating system.  INET is implemented using the  BSD Socket
 *		interface as the means of communication with the user level.
 *
 *		Generic socket support routines. Memory allocators, socket lock/release
 *		handler for protocols to use and generic option handler.
 *
10
 * Authors:	Ross Biro
L
Linus Torvalds 已提交
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
 *		Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
 *		Florian La Roche, <flla@stud.uni-sb.de>
 *		Alan Cox, <A.Cox@swansea.ac.uk>
 *
 * Fixes:
 *		Alan Cox	: 	Numerous verify_area() problems
 *		Alan Cox	:	Connecting on a connecting socket
 *					now returns an error for tcp.
 *		Alan Cox	:	sock->protocol is set correctly.
 *					and is not sometimes left as 0.
 *		Alan Cox	:	connect handles icmp errors on a
 *					connect properly. Unfortunately there
 *					is a restart syscall nasty there. I
 *					can't match BSD without hacking the C
 *					library. Ideas urgently sought!
 *		Alan Cox	:	Disallow bind() to addresses that are
 *					not ours - especially broadcast ones!!
 *		Alan Cox	:	Socket 1024 _IS_ ok for users. (fencepost)
 *		Alan Cox	:	sock_wfree/sock_rfree don't destroy sockets,
 *					instead they leave that for the DESTROY timer.
 *		Alan Cox	:	Clean up error flag in accept
 *		Alan Cox	:	TCP ack handling is buggy, the DESTROY timer
 *					was buggy. Put a remove_sock() in the handler
 *					for memory when we hit 0. Also altered the timer
35
 *					code. The ACK stuff can wait and needs major
L
Linus Torvalds 已提交
36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85
 *					TCP layer surgery.
 *		Alan Cox	:	Fixed TCP ack bug, removed remove sock
 *					and fixed timer/inet_bh race.
 *		Alan Cox	:	Added zapped flag for TCP
 *		Alan Cox	:	Move kfree_skb into skbuff.c and tidied up surplus code
 *		Alan Cox	:	for new sk_buff allocations wmalloc/rmalloc now call alloc_skb
 *		Alan Cox	:	kfree_s calls now are kfree_skbmem so we can track skb resources
 *		Alan Cox	:	Supports socket option broadcast now as does udp. Packet and raw need fixing.
 *		Alan Cox	:	Added RCVBUF,SNDBUF size setting. It suddenly occurred to me how easy it was so...
 *		Rick Sladkey	:	Relaxed UDP rules for matching packets.
 *		C.E.Hawkins	:	IFF_PROMISC/SIOCGHWADDR support
 *	Pauline Middelink	:	identd support
 *		Alan Cox	:	Fixed connect() taking signals I think.
 *		Alan Cox	:	SO_LINGER supported
 *		Alan Cox	:	Error reporting fixes
 *		Anonymous	:	inet_create tidied up (sk->reuse setting)
 *		Alan Cox	:	inet sockets don't set sk->type!
 *		Alan Cox	:	Split socket option code
 *		Alan Cox	:	Callbacks
 *		Alan Cox	:	Nagle flag for Charles & Johannes stuff
 *		Alex		:	Removed restriction on inet fioctl
 *		Alan Cox	:	Splitting INET from NET core
 *		Alan Cox	:	Fixed bogus SO_TYPE handling in getsockopt()
 *		Adam Caldwell	:	Missing return in SO_DONTROUTE/SO_DEBUG code
 *		Alan Cox	:	Split IP from generic code
 *		Alan Cox	:	New kfree_skbmem()
 *		Alan Cox	:	Make SO_DEBUG superuser only.
 *		Alan Cox	:	Allow anyone to clear SO_DEBUG
 *					(compatibility fix)
 *		Alan Cox	:	Added optimistic memory grabbing for AF_UNIX throughput.
 *		Alan Cox	:	Allocator for a socket is settable.
 *		Alan Cox	:	SO_ERROR includes soft errors.
 *		Alan Cox	:	Allow NULL arguments on some SO_ opts
 *		Alan Cox	: 	Generic socket allocation to make hooks
 *					easier (suggested by Craig Metz).
 *		Michael Pall	:	SO_ERROR returns positive errno again
 *              Steve Whitehouse:       Added default destructor to free
 *                                      protocol private data.
 *              Steve Whitehouse:       Added various other default routines
 *                                      common to several socket families.
 *              Chris Evans     :       Call suser() check last on F_SETOWN
 *		Jay Schulist	:	Added SO_ATTACH_FILTER and SO_DETACH_FILTER.
 *		Andi Kleen	:	Add sock_kmalloc()/sock_kfree_s()
 *		Andi Kleen	:	Fix write_space callback
 *		Chris Evans	:	Security fixes - signedness again
 *		Arnaldo C. Melo :       cleanups, use skb_queue_purge
 *
 * To Fix:
 */

J
Joe Perches 已提交
86 87
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt

88
#include <asm/unaligned.h>
89
#include <linux/capability.h>
L
Linus Torvalds 已提交
90
#include <linux/errno.h>
91
#include <linux/errqueue.h>
L
Linus Torvalds 已提交
92 93 94 95 96 97 98 99
#include <linux/types.h>
#include <linux/socket.h>
#include <linux/in.h>
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/proc_fs.h>
#include <linux/seq_file.h>
#include <linux/sched.h>
100
#include <linux/sched/mm.h>
L
Linus Torvalds 已提交
101 102 103 104 105 106 107 108 109 110
#include <linux/timer.h>
#include <linux/string.h>
#include <linux/sockios.h>
#include <linux/net.h>
#include <linux/mm.h>
#include <linux/slab.h>
#include <linux/interrupt.h>
#include <linux/poll.h>
#include <linux/tcp.h>
#include <linux/init.h>
A
Al Viro 已提交
111
#include <linux/highmem.h>
112
#include <linux/user_namespace.h>
113
#include <linux/static_key.h>
114
#include <linux/memcontrol.h>
115
#include <linux/prefetch.h>
116
#include <linux/compat.h>
L
Linus Torvalds 已提交
117

118
#include <linux/uaccess.h>
L
Linus Torvalds 已提交
119 120 121 122

#include <linux/netdevice.h>
#include <net/protocol.h>
#include <linux/skbuff.h>
123
#include <net/net_namespace.h>
124
#include <net/request_sock.h>
L
Linus Torvalds 已提交
125
#include <net/sock.h>
126
#include <linux/net_tstamp.h>
L
Linus Torvalds 已提交
127 128
#include <net/xfrm.h>
#include <linux/ipsec.h>
129
#include <net/cls_cgroup.h>
130
#include <net/netprio_cgroup.h>
131
#include <linux/sock_diag.h>
L
Linus Torvalds 已提交
132 133

#include <linux/filter.h>
134
#include <net/sock_reuseport.h>
135
#include <net/bpf_sk_storage.h>
L
Linus Torvalds 已提交
136

137 138
#include <trace/events/sock.h>

L
Linus Torvalds 已提交
139
#include <net/tcp.h>
140
#include <net/busy_poll.h>
E
Eliezer Tamir 已提交
141

142
static DEFINE_MUTEX(proto_list_mutex);
G
Glauber Costa 已提交
143 144
static LIST_HEAD(proto_list);

145 146
static void sock_inuse_add(struct net *net, int val);

147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167
/**
 * sk_ns_capable - General socket capability test
 * @sk: Socket to use a capability on or through
 * @user_ns: The user namespace of the capability to use
 * @cap: The capability to use
 *
 * Test to see if the opener of the socket had when the socket was
 * created and the current process has the capability @cap in the user
 * namespace @user_ns.
 */
bool sk_ns_capable(const struct sock *sk,
		   struct user_namespace *user_ns, int cap)
{
	return file_ns_capable(sk->sk_socket->file, user_ns, cap) &&
		ns_capable(user_ns, cap);
}
EXPORT_SYMBOL(sk_ns_capable);

/**
 * sk_capable - Socket global capability test
 * @sk: Socket to use a capability on or through
168
 * @cap: The global capability to use
169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184
 *
 * Test to see if the opener of the socket had when the socket was
 * created and the current process has the capability @cap in all user
 * namespaces.
 */
bool sk_capable(const struct sock *sk, int cap)
{
	return sk_ns_capable(sk, &init_user_ns, cap);
}
EXPORT_SYMBOL(sk_capable);

/**
 * sk_net_capable - Network namespace socket capability test
 * @sk: Socket to use a capability on or through
 * @cap: The capability to use
 *
185
 * Test to see if the opener of the socket had when the socket was created
186 187 188 189 190 191 192 193 194
 * and the current process has the capability @cap over the network namespace
 * the socket is a member of.
 */
bool sk_net_capable(const struct sock *sk, int cap)
{
	return sk_ns_capable(sk, sock_net(sk)->user_ns, cap);
}
EXPORT_SYMBOL(sk_net_capable);

195 196
/*
 * Each address family might have different locking rules, so we have
197 198
 * one slock key per address family and separate keys for internal and
 * userspace sockets.
199
 */
I
Ingo Molnar 已提交
200
static struct lock_class_key af_family_keys[AF_MAX];
201
static struct lock_class_key af_family_kern_keys[AF_MAX];
I
Ingo Molnar 已提交
202
static struct lock_class_key af_family_slock_keys[AF_MAX];
203
static struct lock_class_key af_family_kern_slock_keys[AF_MAX];
I
Ingo Molnar 已提交
204 205 206 207 208 209

/*
 * Make lock validator output more readable. (we pre-construct these
 * strings build-time, so that runtime initialization of socket
 * locks is fast):
 */
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225

#define _sock_locks(x)						  \
  x "AF_UNSPEC",	x "AF_UNIX"     ,	x "AF_INET"     , \
  x "AF_AX25"  ,	x "AF_IPX"      ,	x "AF_APPLETALK", \
  x "AF_NETROM",	x "AF_BRIDGE"   ,	x "AF_ATMPVC"   , \
  x "AF_X25"   ,	x "AF_INET6"    ,	x "AF_ROSE"     , \
  x "AF_DECnet",	x "AF_NETBEUI"  ,	x "AF_SECURITY" , \
  x "AF_KEY"   ,	x "AF_NETLINK"  ,	x "AF_PACKET"   , \
  x "AF_ASH"   ,	x "AF_ECONET"   ,	x "AF_ATMSVC"   , \
  x "AF_RDS"   ,	x "AF_SNA"      ,	x "AF_IRDA"     , \
  x "AF_PPPOX" ,	x "AF_WANPIPE"  ,	x "AF_LLC"      , \
  x "27"       ,	x "28"          ,	x "AF_CAN"      , \
  x "AF_TIPC"  ,	x "AF_BLUETOOTH",	x "IUCV"        , \
  x "AF_RXRPC" ,	x "AF_ISDN"     ,	x "AF_PHONET"   , \
  x "AF_IEEE802154",	x "AF_CAIF"	,	x "AF_ALG"      , \
  x "AF_NFC"   ,	x "AF_VSOCK"    ,	x "AF_KCM"      , \
B
Björn Töpel 已提交
226 227
  x "AF_QIPCRTR",	x "AF_SMC"	,	x "AF_XDP"	, \
  x "AF_MAX"
228

229
static const char *const af_family_key_strings[AF_MAX+1] = {
230
	_sock_locks("sk_lock-")
I
Ingo Molnar 已提交
231
};
232
static const char *const af_family_slock_key_strings[AF_MAX+1] = {
233
	_sock_locks("slock-")
I
Ingo Molnar 已提交
234
};
235
static const char *const af_family_clock_key_strings[AF_MAX+1] = {
236 237 238 239 240 241 242 243 244 245 246
	_sock_locks("clock-")
};

static const char *const af_family_kern_key_strings[AF_MAX+1] = {
	_sock_locks("k-sk_lock-")
};
static const char *const af_family_kern_slock_key_strings[AF_MAX+1] = {
	_sock_locks("k-slock-")
};
static const char *const af_family_kern_clock_key_strings[AF_MAX+1] = {
	_sock_locks("k-clock-")
247
};
248
static const char *const af_family_rlock_key_strings[AF_MAX+1] = {
249
	_sock_locks("rlock-")
250 251
};
static const char *const af_family_wlock_key_strings[AF_MAX+1] = {
252
	_sock_locks("wlock-")
253 254
};
static const char *const af_family_elock_key_strings[AF_MAX+1] = {
255
	_sock_locks("elock-")
256
};
257 258

/*
259
 * sk_callback_lock and sk queues locking rules are per-address-family,
260 261 262
 * so split the lock classes by using a per-AF key:
 */
static struct lock_class_key af_callback_keys[AF_MAX];
263 264 265
static struct lock_class_key af_rlock_keys[AF_MAX];
static struct lock_class_key af_wlock_keys[AF_MAX];
static struct lock_class_key af_elock_keys[AF_MAX];
266
static struct lock_class_key af_kern_callback_keys[AF_MAX];
267

L
Linus Torvalds 已提交
268
/* Run time adjustable parameters. */
269
__u32 sysctl_wmem_max __read_mostly = SK_WMEM_MAX;
270
EXPORT_SYMBOL(sysctl_wmem_max);
271
__u32 sysctl_rmem_max __read_mostly = SK_RMEM_MAX;
272
EXPORT_SYMBOL(sysctl_rmem_max);
273 274
__u32 sysctl_wmem_default __read_mostly = SK_WMEM_MAX;
__u32 sysctl_rmem_default __read_mostly = SK_RMEM_MAX;
L
Linus Torvalds 已提交
275

L
Lucas De Marchi 已提交
276
/* Maximal space eaten by iovec or ancillary data plus some space */
277
int sysctl_optmem_max __read_mostly = sizeof(unsigned long)*(2*UIO_MAXIOV+512);
E
Eric Dumazet 已提交
278
EXPORT_SYMBOL(sysctl_optmem_max);
L
Linus Torvalds 已提交
279

280 281
int sysctl_tstamp_allow_data __read_mostly = 1;

282 283
DEFINE_STATIC_KEY_FALSE(memalloc_socks_key);
EXPORT_SYMBOL_GPL(memalloc_socks_key);
284

285 286 287 288 289 290 291 292 293 294 295 296
/**
 * sk_set_memalloc - sets %SOCK_MEMALLOC
 * @sk: socket to set it on
 *
 * Set %SOCK_MEMALLOC on a socket for access to emergency reserves.
 * It's the responsibility of the admin to adjust min_free_kbytes
 * to meet the requirements
 */
void sk_set_memalloc(struct sock *sk)
{
	sock_set_flag(sk, SOCK_MEMALLOC);
	sk->sk_allocation |= __GFP_MEMALLOC;
297
	static_branch_inc(&memalloc_socks_key);
298 299 300 301 302 303 304
}
EXPORT_SYMBOL_GPL(sk_set_memalloc);

void sk_clear_memalloc(struct sock *sk)
{
	sock_reset_flag(sk, SOCK_MEMALLOC);
	sk->sk_allocation &= ~__GFP_MEMALLOC;
305
	static_branch_dec(&memalloc_socks_key);
306 307 308

	/*
	 * SOCK_MEMALLOC is allowed to ignore rmem limits to ensure forward
309 310 311 312
	 * progress of swapping. SOCK_MEMALLOC may be cleared while
	 * it has rmem allocations due to the last swapfile being deactivated
	 * but there is a risk that the socket is unusable due to exceeding
	 * the rmem limits. Reclaim the reserves and obey rmem limits again.
313
	 */
314
	sk_mem_reclaim(sk);
315 316 317
}
EXPORT_SYMBOL_GPL(sk_clear_memalloc);

318 319 320
int __sk_backlog_rcv(struct sock *sk, struct sk_buff *skb)
{
	int ret;
321
	unsigned int noreclaim_flag;
322 323 324 325

	/* these should have been dropped before queueing */
	BUG_ON(!sock_flag(sk, SOCK_MEMALLOC));

326
	noreclaim_flag = memalloc_noreclaim_save();
327
	ret = sk->sk_backlog_rcv(sk, skb);
328
	memalloc_noreclaim_restore(noreclaim_flag);
329 330 331 332 333

	return ret;
}
EXPORT_SYMBOL(__sk_backlog_rcv);

334
static int sock_get_timeout(long timeo, void *optval, bool old_timeval)
335
{
336
	struct __kernel_sock_timeval tv;
337 338 339 340 341 342 343 344 345

	if (timeo == MAX_SCHEDULE_TIMEOUT) {
		tv.tv_sec = 0;
		tv.tv_usec = 0;
	} else {
		tv.tv_sec = timeo / HZ;
		tv.tv_usec = ((timeo % HZ) * USEC_PER_SEC) / HZ;
	}

346
	if (old_timeval && in_compat_syscall() && !COMPAT_USE_64BIT_TIME) {
347 348 349 350 351
		struct old_timeval32 tv32 = { tv.tv_sec, tv.tv_usec };
		*(struct old_timeval32 *)optval = tv32;
		return sizeof(tv32);
	}

352 353 354 355 356
	if (old_timeval) {
		struct __kernel_old_timeval old_tv;
		old_tv.tv_sec = tv.tv_sec;
		old_tv.tv_usec = tv.tv_usec;
		*(struct __kernel_old_timeval *)optval = old_tv;
357
		return sizeof(old_tv);
358 359
	}

360 361
	*(struct __kernel_sock_timeval *)optval = tv;
	return sizeof(tv);
362 363
}

364 365
static int sock_set_timeout(long *timeo_p, sockptr_t optval, int optlen,
			    bool old_timeval)
L
Linus Torvalds 已提交
366
{
367
	struct __kernel_sock_timeval tv;
L
Linus Torvalds 已提交
368

369
	if (old_timeval && in_compat_syscall() && !COMPAT_USE_64BIT_TIME) {
370 371 372 373 374
		struct old_timeval32 tv32;

		if (optlen < sizeof(tv32))
			return -EINVAL;

375
		if (copy_from_sockptr(&tv32, optval, sizeof(tv32)))
376 377 378
			return -EFAULT;
		tv.tv_sec = tv32.tv_sec;
		tv.tv_usec = tv32.tv_usec;
379 380 381 382 383
	} else if (old_timeval) {
		struct __kernel_old_timeval old_tv;

		if (optlen < sizeof(old_tv))
			return -EINVAL;
384
		if (copy_from_sockptr(&old_tv, optval, sizeof(old_tv)))
385 386 387
			return -EFAULT;
		tv.tv_sec = old_tv.tv_sec;
		tv.tv_usec = old_tv.tv_usec;
388 389 390
	} else {
		if (optlen < sizeof(tv))
			return -EINVAL;
391
		if (copy_from_sockptr(&tv, optval, sizeof(tv)))
392 393
			return -EFAULT;
	}
394 395
	if (tv.tv_usec < 0 || tv.tv_usec >= USEC_PER_SEC)
		return -EDOM;
L
Linus Torvalds 已提交
396

397
	if (tv.tv_sec < 0) {
398 399
		static int warned __read_mostly;

400
		*timeo_p = 0;
401
		if (warned < 10 && net_ratelimit()) {
402
			warned++;
J
Joe Perches 已提交
403 404
			pr_info("%s: `%s' (pid %d) tries to set negative timeout\n",
				__func__, current->comm, task_pid_nr(current));
405
		}
406 407
		return 0;
	}
L
Linus Torvalds 已提交
408 409 410
	*timeo_p = MAX_SCHEDULE_TIMEOUT;
	if (tv.tv_sec == 0 && tv.tv_usec == 0)
		return 0;
411 412
	if (tv.tv_sec < (MAX_SCHEDULE_TIMEOUT / HZ - 1))
		*timeo_p = tv.tv_sec * HZ + DIV_ROUND_UP((unsigned long)tv.tv_usec, USEC_PER_SEC / HZ);
L
Linus Torvalds 已提交
413 414 415
	return 0;
}

416 417 418 419 420 421 422 423 424 425 426
static bool sock_needs_netstamp(const struct sock *sk)
{
	switch (sk->sk_family) {
	case AF_UNSPEC:
	case AF_UNIX:
		return false;
	default:
		return true;
	}
}

E
Eric Dumazet 已提交
427
static void sock_disable_timestamp(struct sock *sk, unsigned long flags)
428
{
E
Eric Dumazet 已提交
429 430
	if (sk->sk_flags & flags) {
		sk->sk_flags &= ~flags;
431 432
		if (sock_needs_netstamp(sk) &&
		    !(sk->sk_flags & SK_FLAGS_TIMESTAMP))
433
			net_disable_timestamp();
L
Linus Torvalds 已提交
434 435 436 437
	}
}


438
int __sock_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
439
{
440 441
	unsigned long flags;
	struct sk_buff_head *list = &sk->sk_receive_queue;
442

E
Eric Dumazet 已提交
443
	if (atomic_read(&sk->sk_rmem_alloc) >= sk->sk_rcvbuf) {
E
Eric Dumazet 已提交
444
		atomic_inc(&sk->sk_drops);
445
		trace_sock_rcvqueue_full(sk, skb);
E
Eric Dumazet 已提交
446
		return -ENOMEM;
447 448
	}

449
	if (!sk_rmem_schedule(sk, skb, skb->truesize)) {
E
Eric Dumazet 已提交
450 451
		atomic_inc(&sk->sk_drops);
		return -ENOBUFS;
452 453
	}

454 455
	skb->dev = NULL;
	skb_set_owner_r(skb, sk);
456

E
Eric Dumazet 已提交
457 458 459 460 461
	/* we escape from rcu protected region, make sure we dont leak
	 * a norefcounted dst
	 */
	skb_dst_force(skb);

462
	spin_lock_irqsave(&list->lock, flags);
463
	sock_skb_set_dropcount(sk, skb);
464 465
	__skb_queue_tail(list, skb);
	spin_unlock_irqrestore(&list->lock, flags);
466 467

	if (!sock_flag(sk, SOCK_DEAD))
468
		sk->sk_data_ready(sk);
E
Eric Dumazet 已提交
469
	return 0;
470
}
471 472 473 474 475 476 477 478 479 480 481 482
EXPORT_SYMBOL(__sock_queue_rcv_skb);

int sock_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
{
	int err;

	err = sk_filter(sk, skb);
	if (err)
		return err;

	return __sock_queue_rcv_skb(sk, skb);
}
483 484
EXPORT_SYMBOL(sock_queue_rcv_skb);

485
int __sk_receive_skb(struct sock *sk, struct sk_buff *skb,
486
		     const int nested, unsigned int trim_cap, bool refcounted)
487 488 489
{
	int rc = NET_RX_SUCCESS;

490
	if (sk_filter_trim_cap(sk, skb, trim_cap))
491 492 493 494
		goto discard_and_relse;

	skb->dev = NULL;

495
	if (sk_rcvqueues_full(sk, sk->sk_rcvbuf)) {
496 497 498
		atomic_inc(&sk->sk_drops);
		goto discard_and_relse;
	}
499 500 501 502
	if (nested)
		bh_lock_sock_nested(sk);
	else
		bh_lock_sock(sk);
I
Ingo Molnar 已提交
503 504 505 506 507 508
	if (!sock_owned_by_user(sk)) {
		/*
		 * trylock + unlock semantics:
		 */
		mutex_acquire(&sk->sk_lock.dep_map, 0, 1, _RET_IP_);

P
Peter Zijlstra 已提交
509
		rc = sk_backlog_rcv(sk, skb);
I
Ingo Molnar 已提交
510

511
		mutex_release(&sk->sk_lock.dep_map, _RET_IP_);
512
	} else if (sk_add_backlog(sk, skb, READ_ONCE(sk->sk_rcvbuf))) {
Z
Zhu Yi 已提交
513 514 515 516 517
		bh_unlock_sock(sk);
		atomic_inc(&sk->sk_drops);
		goto discard_and_relse;
	}

518 519
	bh_unlock_sock(sk);
out:
520 521
	if (refcounted)
		sock_put(sk);
522 523 524 525 526
	return rc;
discard_and_relse:
	kfree_skb(skb);
	goto out;
}
527
EXPORT_SYMBOL(__sk_receive_skb);
528 529 530

struct dst_entry *__sk_dst_check(struct sock *sk, u32 cookie)
{
E
Eric Dumazet 已提交
531
	struct dst_entry *dst = __sk_dst_get(sk);
532 533

	if (dst && dst->obsolete && dst->ops->check(dst, cookie) == NULL) {
K
Krishna Kumar 已提交
534
		sk_tx_queue_clear(sk);
535
		sk->sk_dst_pending_confirm = 0;
536
		RCU_INIT_POINTER(sk->sk_dst_cache, NULL);
537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
		dst_release(dst);
		return NULL;
	}

	return dst;
}
EXPORT_SYMBOL(__sk_dst_check);

struct dst_entry *sk_dst_check(struct sock *sk, u32 cookie)
{
	struct dst_entry *dst = sk_dst_get(sk);

	if (dst && dst->obsolete && dst->ops->check(dst, cookie) == NULL) {
		sk_dst_reset(sk);
		dst_release(dst);
		return NULL;
	}

	return dst;
}
EXPORT_SYMBOL(sk_dst_check);

C
Christoph Hellwig 已提交
559
static int sock_bindtoindex_locked(struct sock *sk, int ifindex)
560 561 562
{
	int ret = -ENOPROTOOPT;
#ifdef CONFIG_NETDEVICES
563
	struct net *net = sock_net(sk);
564 565 566

	/* Sorry... */
	ret = -EPERM;
567
	if (sk->sk_bound_dev_if && !ns_capable(net->user_ns, CAP_NET_RAW))
568 569
		goto out;

570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586
	ret = -EINVAL;
	if (ifindex < 0)
		goto out;

	sk->sk_bound_dev_if = ifindex;
	if (sk->sk_prot->rehash)
		sk->sk_prot->rehash(sk);
	sk_dst_reset(sk);

	ret = 0;

out:
#endif

	return ret;
}

587
int sock_bindtoindex(struct sock *sk, int ifindex, bool lock_sk)
C
Christoph Hellwig 已提交
588 589 590
{
	int ret;

591 592
	if (lock_sk)
		lock_sock(sk);
C
Christoph Hellwig 已提交
593
	ret = sock_bindtoindex_locked(sk, ifindex);
594 595
	if (lock_sk)
		release_sock(sk);
C
Christoph Hellwig 已提交
596 597 598 599 600

	return ret;
}
EXPORT_SYMBOL(sock_bindtoindex);

601
static int sock_setbindtodevice(struct sock *sk, sockptr_t optval, int optlen)
602 603 604 605 606 607 608
{
	int ret = -ENOPROTOOPT;
#ifdef CONFIG_NETDEVICES
	struct net *net = sock_net(sk);
	char devname[IFNAMSIZ];
	int index;

609 610 611 612 613 614 615 616 617 618 619 620 621 622
	ret = -EINVAL;
	if (optlen < 0)
		goto out;

	/* Bind this socket to a particular device like "eth0",
	 * as specified in the passed interface name. If the
	 * name is "" or the option length is zero the socket
	 * is not bound.
	 */
	if (optlen > IFNAMSIZ - 1)
		optlen = IFNAMSIZ - 1;
	memset(devname, 0, sizeof(devname));

	ret = -EFAULT;
623
	if (copy_from_sockptr(devname, optval, optlen))
624 625
		goto out;

626 627
	index = 0;
	if (devname[0] != '\0') {
628
		struct net_device *dev;
629

630 631 632 633 634
		rcu_read_lock();
		dev = dev_get_by_name_rcu(net, devname);
		if (dev)
			index = dev->ifindex;
		rcu_read_unlock();
635 636 637 638 639
		ret = -ENODEV;
		if (!dev)
			goto out;
	}

640
	return sock_bindtoindex(sk, index, true);
641 642 643 644 645 646
out:
#endif

	return ret;
}

647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663
static int sock_getbindtodevice(struct sock *sk, char __user *optval,
				int __user *optlen, int len)
{
	int ret = -ENOPROTOOPT;
#ifdef CONFIG_NETDEVICES
	struct net *net = sock_net(sk);
	char devname[IFNAMSIZ];

	if (sk->sk_bound_dev_if == 0) {
		len = 0;
		goto zero;
	}

	ret = -EINVAL;
	if (len < IFNAMSIZ)
		goto out;

664 665
	ret = netdev_get_name(net, devname, sk->sk_bound_dev_if);
	if (ret)
666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686
		goto out;

	len = strlen(devname) + 1;

	ret = -EFAULT;
	if (copy_to_user(optval, devname, len))
		goto out;

zero:
	ret = -EFAULT;
	if (put_user(len, optlen))
		goto out;

	ret = 0;

out:
#endif

	return ret;
}

687 688 689 690 691 692 693 694 695 696 697 698 699 700
bool sk_mc_loop(struct sock *sk)
{
	if (dev_recursion_level())
		return false;
	if (!sk)
		return true;
	switch (sk->sk_family) {
	case AF_INET:
		return inet_sk(sk)->mc_loop;
#if IS_ENABLED(CONFIG_IPV6)
	case AF_INET6:
		return inet6_sk(sk)->mc_loop;
#endif
	}
701
	WARN_ON_ONCE(1);
702 703 704 705
	return true;
}
EXPORT_SYMBOL(sk_mc_loop);

C
Christoph Hellwig 已提交
706 707 708 709 710 711 712 713
void sock_set_reuseaddr(struct sock *sk)
{
	lock_sock(sk);
	sk->sk_reuse = SK_CAN_REUSE;
	release_sock(sk);
}
EXPORT_SYMBOL(sock_set_reuseaddr);

C
Christoph Hellwig 已提交
714 715 716 717 718 719 720 721
void sock_set_reuseport(struct sock *sk)
{
	lock_sock(sk);
	sk->sk_reuseport = true;
	release_sock(sk);
}
EXPORT_SYMBOL(sock_set_reuseport);

C
Christoph Hellwig 已提交
722 723 724 725 726 727 728 729 730
void sock_no_linger(struct sock *sk)
{
	lock_sock(sk);
	sk->sk_lingertime = 0;
	sock_set_flag(sk, SOCK_LINGER);
	release_sock(sk);
}
EXPORT_SYMBOL(sock_no_linger);

C
Christoph Hellwig 已提交
731 732 733 734 735 736 737 738
void sock_set_priority(struct sock *sk, u32 priority)
{
	lock_sock(sk);
	sk->sk_priority = priority;
	release_sock(sk);
}
EXPORT_SYMBOL(sock_set_priority);

C
Christoph Hellwig 已提交
739 740 741 742 743 744 745 746 747 748 749
void sock_set_sndtimeo(struct sock *sk, s64 secs)
{
	lock_sock(sk);
	if (secs && secs < MAX_SCHEDULE_TIMEOUT / HZ - 1)
		sk->sk_sndtimeo = secs * HZ;
	else
		sk->sk_sndtimeo = MAX_SCHEDULE_TIMEOUT;
	release_sock(sk);
}
EXPORT_SYMBOL(sock_set_sndtimeo);

750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770
static void __sock_set_timestamps(struct sock *sk, bool val, bool new, bool ns)
{
	if (val)  {
		sock_valbool_flag(sk, SOCK_TSTAMP_NEW, new);
		sock_valbool_flag(sk, SOCK_RCVTSTAMPNS, ns);
		sock_set_flag(sk, SOCK_RCVTSTAMP);
		sock_enable_timestamp(sk, SOCK_TIMESTAMP);
	} else {
		sock_reset_flag(sk, SOCK_RCVTSTAMP);
		sock_reset_flag(sk, SOCK_RCVTSTAMPNS);
	}
}

void sock_enable_timestamps(struct sock *sk)
{
	lock_sock(sk);
	__sock_set_timestamps(sk, true, false, true);
	release_sock(sk);
}
EXPORT_SYMBOL(sock_enable_timestamps);

C
Christoph Hellwig 已提交
771 772 773 774 775 776 777 778 779 780
void sock_set_keepalive(struct sock *sk)
{
	lock_sock(sk);
	if (sk->sk_prot->keepalive)
		sk->sk_prot->keepalive(sk, true);
	sock_valbool_flag(sk, SOCK_KEEPOPEN, true);
	release_sock(sk);
}
EXPORT_SYMBOL(sock_set_keepalive);

C
Christoph Hellwig 已提交
781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809
static void __sock_set_rcvbuf(struct sock *sk, int val)
{
	/* Ensure val * 2 fits into an int, to prevent max_t() from treating it
	 * as a negative value.
	 */
	val = min_t(int, val, INT_MAX / 2);
	sk->sk_userlocks |= SOCK_RCVBUF_LOCK;

	/* We double it on the way in to account for "struct sk_buff" etc.
	 * overhead.   Applications assume that the SO_RCVBUF setting they make
	 * will allow that much actual data to be received on that socket.
	 *
	 * Applications are unaware that "struct sk_buff" and other overheads
	 * allocate from the receive buffer during socket buffer allocation.
	 *
	 * And after considering the possible alternatives, returning the value
	 * we actually used in getsockopt is the most desirable behavior.
	 */
	WRITE_ONCE(sk->sk_rcvbuf, max_t(int, val * 2, SOCK_MIN_RCVBUF));
}

void sock_set_rcvbuf(struct sock *sk, int val)
{
	lock_sock(sk);
	__sock_set_rcvbuf(sk, val);
	release_sock(sk);
}
EXPORT_SYMBOL(sock_set_rcvbuf);

A
Alexander Aring 已提交
810 811 812 813 814 815 816 817
void sock_set_mark(struct sock *sk, u32 val)
{
	lock_sock(sk);
	sk->sk_mark = val;
	release_sock(sk);
}
EXPORT_SYMBOL(sock_set_mark);

L
Linus Torvalds 已提交
818 819 820 821 822 823
/*
 *	This is meant for all protocols to use and covers goings on
 *	at the socket level. Everything here is generic.
 */

int sock_setsockopt(struct socket *sock, int level, int optname,
824
		    sockptr_t optval, unsigned int optlen)
L
Linus Torvalds 已提交
825
{
826
	struct sock_txtime sk_txtime;
E
Eric Dumazet 已提交
827
	struct sock *sk = sock->sk;
L
Linus Torvalds 已提交
828 829 830 831
	int val;
	int valbool;
	struct linger ling;
	int ret = 0;
832

L
Linus Torvalds 已提交
833 834 835 836
	/*
	 *	Options without arguments
	 */

837
	if (optname == SO_BINDTODEVICE)
838
		return sock_setbindtodevice(sk, optval, optlen);
839

840 841
	if (optlen < sizeof(int))
		return -EINVAL;
842

843
	if (copy_from_sockptr(&val, optval, sizeof(val)))
L
Linus Torvalds 已提交
844
		return -EFAULT;
845

E
Eric Dumazet 已提交
846
	valbool = val ? 1 : 0;
L
Linus Torvalds 已提交
847 848 849

	lock_sock(sk);

E
Eric Dumazet 已提交
850
	switch (optname) {
851
	case SO_DEBUG:
E
Eric Dumazet 已提交
852
		if (val && !capable(CAP_NET_ADMIN))
853
			ret = -EACCES;
E
Eric Dumazet 已提交
854
		else
855
			sock_valbool_flag(sk, SOCK_DBG, valbool);
856 857
		break;
	case SO_REUSEADDR:
858
		sk->sk_reuse = (valbool ? SK_CAN_REUSE : SK_NO_REUSE);
859
		break;
T
Tom Herbert 已提交
860 861 862
	case SO_REUSEPORT:
		sk->sk_reuseport = valbool;
		break;
863
	case SO_TYPE:
864
	case SO_PROTOCOL:
865
	case SO_DOMAIN:
866 867 868 869
	case SO_ERROR:
		ret = -ENOPROTOOPT;
		break;
	case SO_DONTROUTE:
870
		sock_valbool_flag(sk, SOCK_LOCALROUTE, valbool);
871
		sk_dst_reset(sk);
872 873 874 875 876 877
		break;
	case SO_BROADCAST:
		sock_valbool_flag(sk, SOCK_BROADCAST, valbool);
		break;
	case SO_SNDBUF:
		/* Don't error on this BSD doesn't and if you think
878 879 880 881 882
		 * about it this is right. Otherwise apps have to
		 * play 'guess the biggest size' games. RCVBUF/SNDBUF
		 * are treated in BSD as hints
		 */
		val = min_t(u32, val, sysctl_wmem_max);
883
set_sndbuf:
884 885 886 887
		/* Ensure val * 2 fits into an int, to prevent max_t()
		 * from treating it as a negative value.
		 */
		val = min_t(int, val, INT_MAX / 2);
888
		sk->sk_userlocks |= SOCK_SNDBUF_LOCK;
889 890
		WRITE_ONCE(sk->sk_sndbuf,
			   max_t(int, val * 2, SOCK_MIN_SNDBUF));
891
		/* Wake up sending tasks if we upped the value. */
892 893
		sk->sk_write_space(sk);
		break;
L
Linus Torvalds 已提交
894

895 896 897 898 899
	case SO_SNDBUFFORCE:
		if (!capable(CAP_NET_ADMIN)) {
			ret = -EPERM;
			break;
		}
900 901 902 903 904 905

		/* No negative values (to prevent underflow, as val will be
		 * multiplied by 2).
		 */
		if (val < 0)
			val = 0;
906
		goto set_sndbuf;
907

908 909
	case SO_RCVBUF:
		/* Don't error on this BSD doesn't and if you think
910 911 912 913
		 * about it this is right. Otherwise apps have to
		 * play 'guess the biggest size' games. RCVBUF/SNDBUF
		 * are treated in BSD as hints
		 */
C
Christoph Hellwig 已提交
914
		__sock_set_rcvbuf(sk, min_t(u32, val, sysctl_rmem_max));
915 916 917 918 919
		break;

	case SO_RCVBUFFORCE:
		if (!capable(CAP_NET_ADMIN)) {
			ret = -EPERM;
L
Linus Torvalds 已提交
920
			break;
921
		}
922 923 924 925

		/* No negative values (to prevent underflow, as val will be
		 * multiplied by 2).
		 */
C
Christoph Hellwig 已提交
926 927
		__sock_set_rcvbuf(sk, max(val, 0));
		break;
L
Linus Torvalds 已提交
928

929
	case SO_KEEPALIVE:
930 931
		if (sk->sk_prot->keepalive)
			sk->sk_prot->keepalive(sk, valbool);
932 933 934 935 936 937 938 939
		sock_valbool_flag(sk, SOCK_KEEPOPEN, valbool);
		break;

	case SO_OOBINLINE:
		sock_valbool_flag(sk, SOCK_URGINLINE, valbool);
		break;

	case SO_NO_CHECK:
940
		sk->sk_no_check_tx = valbool;
941 942 943
		break;

	case SO_PRIORITY:
944 945
		if ((val >= 0 && val <= 6) ||
		    ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
946 947 948 949 950 951 952 953
			sk->sk_priority = val;
		else
			ret = -EPERM;
		break;

	case SO_LINGER:
		if (optlen < sizeof(ling)) {
			ret = -EINVAL;	/* 1003.1g */
L
Linus Torvalds 已提交
954
			break;
955
		}
956
		if (copy_from_sockptr(&ling, optval, sizeof(ling))) {
957
			ret = -EFAULT;
L
Linus Torvalds 已提交
958
			break;
959 960 961 962
		}
		if (!ling.l_onoff)
			sock_reset_flag(sk, SOCK_LINGER);
		else {
L
Linus Torvalds 已提交
963
#if (BITS_PER_LONG == 32)
964 965
			if ((unsigned int)ling.l_linger >= MAX_SCHEDULE_TIMEOUT/HZ)
				sk->sk_lingertime = MAX_SCHEDULE_TIMEOUT;
L
Linus Torvalds 已提交
966
			else
967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982
#endif
				sk->sk_lingertime = (unsigned int)ling.l_linger * HZ;
			sock_set_flag(sk, SOCK_LINGER);
		}
		break;

	case SO_BSDCOMPAT:
		break;

	case SO_PASSCRED:
		if (valbool)
			set_bit(SOCK_PASSCRED, &sock->flags);
		else
			clear_bit(SOCK_PASSCRED, &sock->flags);
		break;

983
	case SO_TIMESTAMP_OLD:
984 985
		__sock_set_timestamps(sk, valbool, false, false);
		break;
986
	case SO_TIMESTAMP_NEW:
987 988
		__sock_set_timestamps(sk, valbool, true, false);
		break;
989
	case SO_TIMESTAMPNS_OLD:
990 991
		__sock_set_timestamps(sk, valbool, false, true);
		break;
992
	case SO_TIMESTAMPNS_NEW:
993
		__sock_set_timestamps(sk, valbool, true, true);
994
		break;
D
Deepa Dinamani 已提交
995
	case SO_TIMESTAMPING_NEW:
996
	case SO_TIMESTAMPING_OLD:
997
		if (val & ~SOF_TIMESTAMPING_MASK) {
998
			ret = -EINVAL;
999 1000
			break;
		}
1001

1002
		if (val & SOF_TIMESTAMPING_OPT_ID &&
1003
		    !(sk->sk_tsflags & SOF_TIMESTAMPING_OPT_ID)) {
1004 1005
			if (sk->sk_protocol == IPPROTO_TCP &&
			    sk->sk_type == SOCK_STREAM) {
1006 1007
				if ((1 << sk->sk_state) &
				    (TCPF_CLOSE | TCPF_LISTEN)) {
1008 1009 1010 1011 1012 1013 1014 1015
					ret = -EINVAL;
					break;
				}
				sk->sk_tskey = tcp_sk(sk)->snd_una;
			} else {
				sk->sk_tskey = 0;
			}
		}
1016 1017 1018 1019 1020 1021 1022

		if (val & SOF_TIMESTAMPING_OPT_STATS &&
		    !(val & SOF_TIMESTAMPING_OPT_TSONLY)) {
			ret = -EINVAL;
			break;
		}

1023
		sk->sk_tsflags = val;
1024 1025
		sock_valbool_flag(sk, SOCK_TSTAMP_NEW, optname == SO_TIMESTAMPING_NEW);

1026 1027 1028
		if (val & SOF_TIMESTAMPING_RX_SOFTWARE)
			sock_enable_timestamp(sk,
					      SOCK_TIMESTAMPING_RX_SOFTWARE);
1029
		else
1030
			sock_disable_timestamp(sk,
E
Eric Dumazet 已提交
1031
					       (1UL << SOCK_TIMESTAMPING_RX_SOFTWARE));
1032 1033
		break;

1034 1035 1036
	case SO_RCVLOWAT:
		if (val < 0)
			val = INT_MAX;
1037 1038 1039
		if (sock->ops->set_rcvlowat)
			ret = sock->ops->set_rcvlowat(sk, val);
		else
1040
			WRITE_ONCE(sk->sk_rcvlowat, val ? : 1);
1041 1042
		break;

1043
	case SO_RCVTIMEO_OLD:
1044
	case SO_RCVTIMEO_NEW:
1045
		ret = sock_set_timeout(&sk->sk_rcvtimeo, optval,
1046
				       optlen, optname == SO_RCVTIMEO_OLD);
1047 1048
		break;

1049
	case SO_SNDTIMEO_OLD:
1050
	case SO_SNDTIMEO_NEW:
1051
		ret = sock_set_timeout(&sk->sk_sndtimeo, optval,
1052
				       optlen, optname == SO_SNDTIMEO_OLD);
1053
		break;
L
Linus Torvalds 已提交
1054

1055 1056
	case SO_ATTACH_FILTER: {
		struct sock_fprog fprog;
1057

1058
		ret = copy_bpf_fprog_from_user(&fprog, optval, optlen);
1059
		if (!ret)
1060 1061
			ret = sk_attach_filter(&fprog, sk);
		break;
1062
	}
1063 1064 1065 1066 1067 1068
	case SO_ATTACH_BPF:
		ret = -EINVAL;
		if (optlen == sizeof(u32)) {
			u32 ufd;

			ret = -EFAULT;
1069
			if (copy_from_sockptr(&ufd, optval, sizeof(ufd)))
1070 1071 1072 1073 1074 1075
				break;

			ret = sk_attach_bpf(ufd, sk);
		}
		break;

1076 1077
	case SO_ATTACH_REUSEPORT_CBPF: {
		struct sock_fprog fprog;
1078

1079
		ret = copy_bpf_fprog_from_user(&fprog, optval, optlen);
1080
		if (!ret)
1081 1082
			ret = sk_reuseport_attach_filter(&fprog, sk);
		break;
1083
	}
1084 1085 1086 1087 1088 1089
	case SO_ATTACH_REUSEPORT_EBPF:
		ret = -EINVAL;
		if (optlen == sizeof(u32)) {
			u32 ufd;

			ret = -EFAULT;
1090
			if (copy_from_sockptr(&ufd, optval, sizeof(ufd)))
1091 1092 1093 1094 1095 1096
				break;

			ret = sk_reuseport_attach_bpf(ufd, sk);
		}
		break;

1097 1098 1099 1100
	case SO_DETACH_REUSEPORT_BPF:
		ret = reuseport_detach_prog(sk);
		break;

1101
	case SO_DETACH_FILTER:
1102
		ret = sk_detach_filter(sk);
1103
		break;
L
Linus Torvalds 已提交
1104

1105 1106 1107 1108 1109 1110 1111
	case SO_LOCK_FILTER:
		if (sock_flag(sk, SOCK_FILTER_LOCKED) && !valbool)
			ret = -EPERM;
		else
			sock_valbool_flag(sk, SOCK_FILTER_LOCKED, valbool);
		break;

1112 1113 1114 1115 1116 1117
	case SO_PASSSEC:
		if (valbool)
			set_bit(SOCK_PASSSEC, &sock->flags);
		else
			clear_bit(SOCK_PASSSEC, &sock->flags);
		break;
1118
	case SO_MARK:
1119
		if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN)) {
1120
			ret = -EPERM;
1121
		} else if (val != sk->sk_mark) {
1122
			sk->sk_mark = val;
1123 1124
			sk_dst_reset(sk);
		}
1125
		break;
C
Catherine Zhang 已提交
1126

1127
	case SO_RXQ_OVFL:
1128
		sock_valbool_flag(sk, SOCK_RXQ_OVFL, valbool);
1129
		break;
1130 1131 1132 1133 1134

	case SO_WIFI_STATUS:
		sock_valbool_flag(sk, SOCK_WIFI_STATUS, valbool);
		break;

1135 1136
	case SO_PEEK_OFF:
		if (sock->ops->set_peek_off)
1137
			ret = sock->ops->set_peek_off(sk, val);
1138 1139 1140
		else
			ret = -EOPNOTSUPP;
		break;
1141 1142 1143 1144 1145

	case SO_NOFCS:
		sock_valbool_flag(sk, SOCK_NOFCS, valbool);
		break;

1146 1147 1148 1149
	case SO_SELECT_ERR_QUEUE:
		sock_valbool_flag(sk, SOCK_SELECT_ERR_QUEUE, valbool);
		break;

1150
#ifdef CONFIG_NET_RX_BUSY_POLL
1151
	case SO_BUSY_POLL:
1152 1153 1154 1155 1156 1157 1158 1159 1160 1161
		/* allow unprivileged users to decrease the value */
		if ((val > sk->sk_ll_usec) && !capable(CAP_NET_ADMIN))
			ret = -EPERM;
		else {
			if (val < 0)
				ret = -EINVAL;
			else
				sk->sk_ll_usec = val;
		}
		break;
1162 1163 1164 1165 1166 1167
	case SO_PREFER_BUSY_POLL:
		if (valbool && !capable(CAP_NET_ADMIN))
			ret = -EPERM;
		else
			WRITE_ONCE(sk->sk_prefer_busy_poll, valbool);
		break;
1168 1169 1170 1171 1172 1173 1174 1175 1176 1177
	case SO_BUSY_POLL_BUDGET:
		if (val > READ_ONCE(sk->sk_busy_poll_budget) && !capable(CAP_NET_ADMIN)) {
			ret = -EPERM;
		} else {
			if (val < 0 || val > U16_MAX)
				ret = -EINVAL;
			else
				WRITE_ONCE(sk->sk_busy_poll_budget, val);
		}
		break;
1178
#endif
E
Eric Dumazet 已提交
1179 1180

	case SO_MAX_PACING_RATE:
1181
		{
1182
		unsigned long ulval = (val == ~0U) ? ~0UL : (unsigned int)val;
1183 1184 1185

		if (sizeof(ulval) != sizeof(val) &&
		    optlen >= sizeof(ulval) &&
1186
		    copy_from_sockptr(&ulval, optval, sizeof(ulval))) {
1187 1188 1189 1190
			ret = -EFAULT;
			break;
		}
		if (ulval != ~0UL)
1191 1192 1193
			cmpxchg(&sk->sk_pacing_status,
				SK_PACING_NONE,
				SK_PACING_NEEDED);
1194 1195
		sk->sk_max_pacing_rate = ulval;
		sk->sk_pacing_rate = min(sk->sk_pacing_rate, ulval);
E
Eric Dumazet 已提交
1196
		break;
1197
		}
1198
	case SO_INCOMING_CPU:
1199
		WRITE_ONCE(sk->sk_incoming_cpu, val);
1200 1201
		break;

1202 1203 1204 1205
	case SO_CNX_ADVICE:
		if (val == 1)
			dst_negative_advice(sk);
		break;
1206 1207

	case SO_ZEROCOPY:
1208
		if (sk->sk_family == PF_INET || sk->sk_family == PF_INET6) {
W
Willem de Bruijn 已提交
1209 1210 1211 1212
			if (!((sk->sk_type == SOCK_STREAM &&
			       sk->sk_protocol == IPPROTO_TCP) ||
			      (sk->sk_type == SOCK_DGRAM &&
			       sk->sk_protocol == IPPROTO_UDP)))
1213 1214
				ret = -ENOTSUPP;
		} else if (sk->sk_family != PF_RDS) {
1215
			ret = -ENOTSUPP;
1216 1217 1218 1219 1220 1221 1222
		}
		if (!ret) {
			if (val < 0 || val > 1)
				ret = -EINVAL;
			else
				sock_valbool_flag(sk, SOCK_ZEROCOPY, valbool);
		}
1223 1224
		break;

1225
	case SO_TXTIME:
1226
		if (optlen != sizeof(struct sock_txtime)) {
1227
			ret = -EINVAL;
1228
			break;
1229
		} else if (copy_from_sockptr(&sk_txtime, optval,
1230 1231
			   sizeof(struct sock_txtime))) {
			ret = -EFAULT;
1232
			break;
1233 1234
		} else if (sk_txtime.flags & ~SOF_TXTIME_FLAGS_MASK) {
			ret = -EINVAL;
1235 1236 1237 1238 1239 1240 1241 1242 1243
			break;
		}
		/* CLOCK_MONOTONIC is only used by sch_fq, and this packet
		 * scheduler has enough safe guards.
		 */
		if (sk_txtime.clockid != CLOCK_MONOTONIC &&
		    !ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN)) {
			ret = -EPERM;
			break;
1244
		}
1245 1246 1247 1248 1249 1250
		sock_valbool_flag(sk, SOCK_TXTIME, true);
		sk->sk_clockid = sk_txtime.clockid;
		sk->sk_txtime_deadline_mode =
			!!(sk_txtime.flags & SOF_TXTIME_DEADLINE_MODE);
		sk->sk_txtime_report_errors =
			!!(sk_txtime.flags & SOF_TXTIME_REPORT_ERRORS);
1251 1252
		break;

1253
	case SO_BINDTOIFINDEX:
C
Christoph Hellwig 已提交
1254
		ret = sock_bindtoindex_locked(sk, val);
1255 1256
		break;

1257 1258 1259
	default:
		ret = -ENOPROTOOPT;
		break;
1260
	}
L
Linus Torvalds 已提交
1261 1262 1263
	release_sock(sk);
	return ret;
}
E
Eric Dumazet 已提交
1264
EXPORT_SYMBOL(sock_setsockopt);
L
Linus Torvalds 已提交
1265 1266


S
stephen hemminger 已提交
1267 1268
static void cred_to_ucred(struct pid *pid, const struct cred *cred,
			  struct ucred *ucred)
1269 1270 1271 1272 1273 1274
{
	ucred->pid = pid_vnr(pid);
	ucred->uid = ucred->gid = -1;
	if (cred) {
		struct user_namespace *current_ns = current_user_ns();

1275 1276
		ucred->uid = from_kuid_munged(current_ns, cred->euid);
		ucred->gid = from_kgid_munged(current_ns, cred->egid);
1277 1278 1279
	}
}

1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291
static int groups_to_user(gid_t __user *dst, const struct group_info *src)
{
	struct user_namespace *user_ns = current_user_ns();
	int i;

	for (i = 0; i < src->ngroups; i++)
		if (put_user(from_kgid_munged(user_ns, src->gid[i]), dst + i))
			return -EFAULT;

	return 0;
}

L
Linus Torvalds 已提交
1292 1293 1294 1295
int sock_getsockopt(struct socket *sock, int level, int optname,
		    char __user *optval, int __user *optlen)
{
	struct sock *sk = sock->sk;
1296

1297
	union {
1298
		int val;
1299
		u64 val64;
1300
		unsigned long ulval;
1301
		struct linger ling;
1302 1303
		struct old_timeval32 tm32;
		struct __kernel_old_timeval tm;
1304
		struct  __kernel_sock_timeval stm;
1305
		struct sock_txtime txtime;
L
Linus Torvalds 已提交
1306
	} v;
1307

1308
	int lv = sizeof(int);
L
Linus Torvalds 已提交
1309
	int len;
1310

1311
	if (get_user(len, optlen))
1312
		return -EFAULT;
1313
	if (len < 0)
L
Linus Torvalds 已提交
1314
		return -EINVAL;
1315

1316
	memset(&v, 0, sizeof(v));
1317

E
Eric Dumazet 已提交
1318
	switch (optname) {
1319 1320 1321 1322 1323 1324 1325 1326 1327
	case SO_DEBUG:
		v.val = sock_flag(sk, SOCK_DBG);
		break;

	case SO_DONTROUTE:
		v.val = sock_flag(sk, SOCK_LOCALROUTE);
		break;

	case SO_BROADCAST:
E
Eric Dumazet 已提交
1328
		v.val = sock_flag(sk, SOCK_BROADCAST);
1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342
		break;

	case SO_SNDBUF:
		v.val = sk->sk_sndbuf;
		break;

	case SO_RCVBUF:
		v.val = sk->sk_rcvbuf;
		break;

	case SO_REUSEADDR:
		v.val = sk->sk_reuse;
		break;

T
Tom Herbert 已提交
1343 1344 1345 1346
	case SO_REUSEPORT:
		v.val = sk->sk_reuseport;
		break;

1347
	case SO_KEEPALIVE:
E
Eric Dumazet 已提交
1348
		v.val = sock_flag(sk, SOCK_KEEPOPEN);
1349 1350 1351 1352 1353 1354
		break;

	case SO_TYPE:
		v.val = sk->sk_type;
		break;

1355 1356 1357 1358
	case SO_PROTOCOL:
		v.val = sk->sk_protocol;
		break;

1359 1360 1361 1362
	case SO_DOMAIN:
		v.val = sk->sk_family;
		break;

1363 1364
	case SO_ERROR:
		v.val = -sock_error(sk);
E
Eric Dumazet 已提交
1365
		if (v.val == 0)
1366 1367 1368 1369
			v.val = xchg(&sk->sk_err_soft, 0);
		break;

	case SO_OOBINLINE:
E
Eric Dumazet 已提交
1370
		v.val = sock_flag(sk, SOCK_URGINLINE);
1371 1372 1373
		break;

	case SO_NO_CHECK:
1374
		v.val = sk->sk_no_check_tx;
1375 1376 1377 1378 1379 1380 1381 1382
		break;

	case SO_PRIORITY:
		v.val = sk->sk_priority;
		break;

	case SO_LINGER:
		lv		= sizeof(v.ling);
E
Eric Dumazet 已提交
1383
		v.ling.l_onoff	= sock_flag(sk, SOCK_LINGER);
1384 1385 1386 1387 1388 1389
		v.ling.l_linger	= sk->sk_lingertime / HZ;
		break;

	case SO_BSDCOMPAT:
		break;

1390
	case SO_TIMESTAMP_OLD:
1391
		v.val = sock_flag(sk, SOCK_RCVTSTAMP) &&
1392
				!sock_flag(sk, SOCK_TSTAMP_NEW) &&
1393 1394 1395
				!sock_flag(sk, SOCK_RCVTSTAMPNS);
		break;

1396
	case SO_TIMESTAMPNS_OLD:
1397 1398 1399 1400 1401 1402 1403 1404 1405
		v.val = sock_flag(sk, SOCK_RCVTSTAMPNS) && !sock_flag(sk, SOCK_TSTAMP_NEW);
		break;

	case SO_TIMESTAMP_NEW:
		v.val = sock_flag(sk, SOCK_RCVTSTAMP) && sock_flag(sk, SOCK_TSTAMP_NEW);
		break;

	case SO_TIMESTAMPNS_NEW:
		v.val = sock_flag(sk, SOCK_RCVTSTAMPNS) && sock_flag(sk, SOCK_TSTAMP_NEW);
1406 1407
		break;

1408
	case SO_TIMESTAMPING_OLD:
1409
		v.val = sk->sk_tsflags;
1410 1411
		break;

1412 1413 1414
	case SO_RCVTIMEO_OLD:
	case SO_RCVTIMEO_NEW:
		lv = sock_get_timeout(sk->sk_rcvtimeo, &v, SO_RCVTIMEO_OLD == optname);
1415 1416
		break;

1417 1418 1419
	case SO_SNDTIMEO_OLD:
	case SO_SNDTIMEO_NEW:
		lv = sock_get_timeout(sk->sk_sndtimeo, &v, SO_SNDTIMEO_OLD == optname);
1420
		break;
L
Linus Torvalds 已提交
1421

1422 1423 1424
	case SO_RCVLOWAT:
		v.val = sk->sk_rcvlowat;
		break;
L
Linus Torvalds 已提交
1425

1426
	case SO_SNDLOWAT:
E
Eric Dumazet 已提交
1427
		v.val = 1;
1428
		break;
L
Linus Torvalds 已提交
1429

1430
	case SO_PASSCRED:
1431
		v.val = !!test_bit(SOCK_PASSCRED, &sock->flags);
1432
		break;
L
Linus Torvalds 已提交
1433

1434
	case SO_PEERCRED:
1435 1436 1437 1438 1439 1440
	{
		struct ucred peercred;
		if (len > sizeof(peercred))
			len = sizeof(peercred);
		cred_to_ucred(sk->sk_peer_pid, sk->sk_peer_cred, &peercred);
		if (copy_to_user(optval, &peercred, len))
1441 1442
			return -EFAULT;
		goto lenout;
1443
	}
L
Linus Torvalds 已提交
1444

1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465
	case SO_PEERGROUPS:
	{
		int ret, n;

		if (!sk->sk_peer_cred)
			return -ENODATA;

		n = sk->sk_peer_cred->group_info->ngroups;
		if (len < n * sizeof(gid_t)) {
			len = n * sizeof(gid_t);
			return put_user(len, optlen) ? -EFAULT : -ERANGE;
		}
		len = n * sizeof(gid_t);

		ret = groups_to_user((gid_t __user *)optval,
				     sk->sk_peer_cred->group_info);
		if (ret)
			return ret;
		goto lenout;
	}

1466 1467 1468 1469
	case SO_PEERNAME:
	{
		char address[128];

1470 1471
		lv = sock->ops->getname(sock, (struct sockaddr *)address, 2);
		if (lv < 0)
1472 1473 1474 1475 1476 1477 1478
			return -ENOTCONN;
		if (lv < len)
			return -EINVAL;
		if (copy_to_user(optval, address, len))
			return -EFAULT;
		goto lenout;
	}
L
Linus Torvalds 已提交
1479

1480 1481 1482 1483 1484 1485
	/* Dubious BSD thing... Probably nobody even uses it, but
	 * the UNIX standard wants it for whatever reason... -DaveM
	 */
	case SO_ACCEPTCONN:
		v.val = sk->sk_state == TCP_LISTEN;
		break;
L
Linus Torvalds 已提交
1486

1487
	case SO_PASSSEC:
1488
		v.val = !!test_bit(SOCK_PASSSEC, &sock->flags);
1489
		break;
C
Catherine Zhang 已提交
1490

1491 1492
	case SO_PEERSEC:
		return security_socket_getpeersec_stream(sock, optval, optlen, len);
L
Linus Torvalds 已提交
1493

1494 1495 1496 1497
	case SO_MARK:
		v.val = sk->sk_mark;
		break;

1498
	case SO_RXQ_OVFL:
E
Eric Dumazet 已提交
1499
		v.val = sock_flag(sk, SOCK_RXQ_OVFL);
1500 1501
		break;

1502
	case SO_WIFI_STATUS:
E
Eric Dumazet 已提交
1503
		v.val = sock_flag(sk, SOCK_WIFI_STATUS);
1504 1505
		break;

1506 1507 1508 1509 1510 1511
	case SO_PEEK_OFF:
		if (!sock->ops->set_peek_off)
			return -EOPNOTSUPP;

		v.val = sk->sk_peek_off;
		break;
1512
	case SO_NOFCS:
E
Eric Dumazet 已提交
1513
		v.val = sock_flag(sk, SOCK_NOFCS);
1514
		break;
1515

1516
	case SO_BINDTODEVICE:
1517 1518
		return sock_getbindtodevice(sk, optval, optlen, len);

1519 1520 1521 1522 1523 1524
	case SO_GET_FILTER:
		len = sk_get_filter(sk, (struct sock_filter __user *)optval, len);
		if (len < 0)
			return len;

		goto lenout;
1525

1526 1527 1528 1529
	case SO_LOCK_FILTER:
		v.val = sock_flag(sk, SOCK_FILTER_LOCKED);
		break;

1530 1531 1532 1533
	case SO_BPF_EXTENSIONS:
		v.val = bpf_tell_extensions();
		break;

1534 1535 1536 1537
	case SO_SELECT_ERR_QUEUE:
		v.val = sock_flag(sk, SOCK_SELECT_ERR_QUEUE);
		break;

1538
#ifdef CONFIG_NET_RX_BUSY_POLL
1539
	case SO_BUSY_POLL:
1540 1541
		v.val = sk->sk_ll_usec;
		break;
1542 1543 1544
	case SO_PREFER_BUSY_POLL:
		v.val = READ_ONCE(sk->sk_prefer_busy_poll);
		break;
1545 1546
#endif

E
Eric Dumazet 已提交
1547
	case SO_MAX_PACING_RATE:
1548 1549 1550 1551 1552 1553 1554
		if (sizeof(v.ulval) != sizeof(v.val) && len >= sizeof(v.ulval)) {
			lv = sizeof(v.ulval);
			v.ulval = sk->sk_max_pacing_rate;
		} else {
			/* 32bit version */
			v.val = min_t(unsigned long, sk->sk_max_pacing_rate, ~0U);
		}
E
Eric Dumazet 已提交
1555 1556
		break;

E
Eric Dumazet 已提交
1557
	case SO_INCOMING_CPU:
1558
		v.val = READ_ONCE(sk->sk_incoming_cpu);
E
Eric Dumazet 已提交
1559 1560
		break;

1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572
	case SO_MEMINFO:
	{
		u32 meminfo[SK_MEMINFO_VARS];

		sk_get_meminfo(sk, meminfo);

		len = min_t(unsigned int, len, sizeof(meminfo));
		if (copy_to_user(optval, &meminfo, len))
			return -EFAULT;

		goto lenout;
	}
1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584

#ifdef CONFIG_NET_RX_BUSY_POLL
	case SO_INCOMING_NAPI_ID:
		v.val = READ_ONCE(sk->sk_napi_id);

		/* aggregate non-NAPI IDs down to 0 */
		if (v.val < MIN_NAPI_ID)
			v.val = 0;

		break;
#endif

1585 1586 1587 1588 1589 1590 1591
	case SO_COOKIE:
		lv = sizeof(u64);
		if (len < lv)
			return -EINVAL;
		v.val64 = sock_gen_cookie(sk);
		break;

1592 1593 1594 1595
	case SO_ZEROCOPY:
		v.val = sock_flag(sk, SOCK_ZEROCOPY);
		break;

1596 1597 1598 1599 1600
	case SO_TXTIME:
		lv = sizeof(v.txtime);
		v.txtime.clockid = sk->sk_clockid;
		v.txtime.flags |= sk->sk_txtime_deadline_mode ?
				  SOF_TXTIME_DEADLINE_MODE : 0;
1601 1602
		v.txtime.flags |= sk->sk_txtime_report_errors ?
				  SOF_TXTIME_REPORT_ERRORS : 0;
1603 1604
		break;

1605 1606 1607 1608
	case SO_BINDTOIFINDEX:
		v.val = sk->sk_bound_dev_if;
		break;

1609
	default:
1610 1611 1612
		/* We implement the SO_SNDLOWAT etc to not be settable
		 * (1003.1g 7).
		 */
1613
		return -ENOPROTOOPT;
L
Linus Torvalds 已提交
1614
	}
1615

L
Linus Torvalds 已提交
1616 1617 1618 1619 1620
	if (len > lv)
		len = lv;
	if (copy_to_user(optval, &v, len))
		return -EFAULT;
lenout:
1621 1622 1623
	if (put_user(len, optlen))
		return -EFAULT;
	return 0;
L
Linus Torvalds 已提交
1624 1625
}

I
Ingo Molnar 已提交
1626 1627 1628 1629 1630
/*
 * Initialize an sk_lock.
 *
 * (We also register the sk_lock with the lock validator.)
 */
D
Dave Jones 已提交
1631
static inline void sock_lock_init(struct sock *sk)
I
Ingo Molnar 已提交
1632
{
1633 1634 1635 1636 1637 1638 1639 1640 1641 1642
	if (sk->sk_kern_sock)
		sock_lock_init_class_and_name(
			sk,
			af_family_kern_slock_key_strings[sk->sk_family],
			af_family_kern_slock_keys + sk->sk_family,
			af_family_kern_key_strings[sk->sk_family],
			af_family_kern_keys + sk->sk_family);
	else
		sock_lock_init_class_and_name(
			sk,
1643 1644 1645 1646
			af_family_slock_key_strings[sk->sk_family],
			af_family_slock_keys + sk->sk_family,
			af_family_key_strings[sk->sk_family],
			af_family_keys + sk->sk_family);
I
Ingo Molnar 已提交
1647 1648
}

E
Eric Dumazet 已提交
1649 1650 1651
/*
 * Copy all fields from osk to nsk but nsk->sk_refcnt must not change yet,
 * even temporarly, because of RCU lookups. sk_node should also be left as is.
1652
 * We must not copy fields between sk_dontcopy_begin and sk_dontcopy_end
E
Eric Dumazet 已提交
1653
 */
1654 1655
static void sock_copy(struct sock *nsk, const struct sock *osk)
{
1656
	const struct proto *prot = READ_ONCE(osk->sk_prot);
1657 1658 1659
#ifdef CONFIG_SECURITY_NETWORK
	void *sptr = nsk->sk_security;
#endif
1660 1661 1662
	memcpy(nsk, osk, offsetof(struct sock, sk_dontcopy_begin));

	memcpy(&nsk->sk_dontcopy_end, &osk->sk_dontcopy_end,
1663
	       prot->obj_size - offsetof(struct sock, sk_dontcopy_end));
1664

1665 1666 1667 1668 1669 1670
#ifdef CONFIG_SECURITY_NETWORK
	nsk->sk_security = sptr;
	security_sk_clone(osk, nsk);
#endif
}

1671 1672
static struct sock *sk_prot_alloc(struct proto *prot, gfp_t priority,
		int family)
1673 1674 1675 1676 1677
{
	struct sock *sk;
	struct kmem_cache *slab;

	slab = prot->slab;
1678 1679 1680 1681
	if (slab != NULL) {
		sk = kmem_cache_alloc(slab, priority & ~__GFP_ZERO);
		if (!sk)
			return sk;
1682
		if (want_init_on_alloc(priority))
E
Eric Dumazet 已提交
1683
			sk_prot_clear_nulls(sk, prot->obj_size);
1684
	} else
1685 1686
		sk = kmalloc(prot->obj_size, priority);

1687 1688 1689 1690 1691 1692
	if (sk != NULL) {
		if (security_sk_alloc(sk, family, priority))
			goto out_free;

		if (!try_module_get(prot->owner))
			goto out_free_sec;
K
Krishna Kumar 已提交
1693
		sk_tx_queue_clear(sk);
1694 1695
	}

1696
	return sk;
1697 1698 1699 1700 1701 1702 1703 1704 1705

out_free_sec:
	security_sk_free(sk);
out_free:
	if (slab != NULL)
		kmem_cache_free(slab, sk);
	else
		kfree(sk);
	return NULL;
1706 1707 1708 1709 1710
}

static void sk_prot_free(struct proto *prot, struct sock *sk)
{
	struct kmem_cache *slab;
1711
	struct module *owner;
1712

1713
	owner = prot->owner;
1714
	slab = prot->slab;
1715

T
Tejun Heo 已提交
1716
	cgroup_sk_free(&sk->sk_cgrp_data);
1717
	mem_cgroup_sk_free(sk);
1718
	security_sk_free(sk);
1719 1720 1721 1722
	if (slab != NULL)
		kmem_cache_free(slab, sk);
	else
		kfree(sk);
1723
	module_put(owner);
1724 1725
}

L
Linus Torvalds 已提交
1726 1727
/**
 *	sk_alloc - All socket objects are allocated here
1728
 *	@net: the applicable net namespace
1729 1730 1731
 *	@family: protocol family
 *	@priority: for allocation (%GFP_KERNEL, %GFP_ATOMIC, etc)
 *	@prot: struct proto associated with this new sock instance
1732
 *	@kern: is this to be a kernel socket?
L
Linus Torvalds 已提交
1733
 */
1734
struct sock *sk_alloc(struct net *net, int family, gfp_t priority,
1735
		      struct proto *prot, int kern)
L
Linus Torvalds 已提交
1736
{
1737
	struct sock *sk;
L
Linus Torvalds 已提交
1738

1739
	sk = sk_prot_alloc(prot, priority | __GFP_ZERO, family);
L
Linus Torvalds 已提交
1740
	if (sk) {
1741 1742 1743 1744 1745 1746
		sk->sk_family = family;
		/*
		 * See comment in struct sock definition to understand
		 * why we need sk_prot_creator -acme
		 */
		sk->sk_prot = sk->sk_prot_creator = prot;
1747
		sk->sk_kern_sock = kern;
1748
		sock_lock_init(sk);
1749
		sk->sk_net_refcnt = kern ? 0 : 1;
1750
		if (likely(sk->sk_net_refcnt)) {
1751
			get_net(net);
1752 1753 1754
			sock_inuse_add(net, 1);
		}

1755
		sock_net_set(sk, net);
1756
		refcount_set(&sk->sk_wmem_alloc, 1);
1757

1758
		mem_cgroup_sk_alloc(sk);
1759
		cgroup_sk_alloc(&sk->sk_cgrp_data);
1760 1761
		sock_update_classid(&sk->sk_cgrp_data);
		sock_update_netprioidx(&sk->sk_cgrp_data);
1762
		sk_tx_queue_clear(sk);
L
Linus Torvalds 已提交
1763
	}
1764

1765
	return sk;
L
Linus Torvalds 已提交
1766
}
E
Eric Dumazet 已提交
1767
EXPORT_SYMBOL(sk_alloc);
L
Linus Torvalds 已提交
1768

1769 1770 1771 1772
/* Sockets having SOCK_RCU_FREE will call this function after one RCU
 * grace period. This is the case for UDP sockets and TCP listeners.
 */
static void __sk_destruct(struct rcu_head *head)
L
Linus Torvalds 已提交
1773
{
1774
	struct sock *sk = container_of(head, struct sock, sk_rcu);
L
Linus Torvalds 已提交
1775 1776 1777 1778 1779
	struct sk_filter *filter;

	if (sk->sk_destruct)
		sk->sk_destruct(sk);

1780
	filter = rcu_dereference_check(sk->sk_filter,
1781
				       refcount_read(&sk->sk_wmem_alloc) == 0);
L
Linus Torvalds 已提交
1782
	if (filter) {
1783
		sk_filter_uncharge(sk, filter);
1784
		RCU_INIT_POINTER(sk->sk_filter, NULL);
L
Linus Torvalds 已提交
1785 1786
	}

E
Eric Dumazet 已提交
1787
	sock_disable_timestamp(sk, SK_FLAGS_TIMESTAMP);
L
Linus Torvalds 已提交
1788

1789 1790 1791 1792
#ifdef CONFIG_BPF_SYSCALL
	bpf_sk_storage_free(sk);
#endif

L
Linus Torvalds 已提交
1793
	if (atomic_read(&sk->sk_omem_alloc))
J
Joe Perches 已提交
1794 1795
		pr_debug("%s: optmem leakage (%d bytes) detected\n",
			 __func__, atomic_read(&sk->sk_omem_alloc));
L
Linus Torvalds 已提交
1796

1797 1798 1799 1800 1801
	if (sk->sk_frag.page) {
		put_page(sk->sk_frag.page);
		sk->sk_frag.page = NULL;
	}

1802 1803 1804
	if (sk->sk_peer_cred)
		put_cred(sk->sk_peer_cred);
	put_pid(sk->sk_peer_pid);
1805 1806
	if (likely(sk->sk_net_refcnt))
		put_net(sock_net(sk));
1807
	sk_prot_free(sk->sk_prot_creator, sk);
L
Linus Torvalds 已提交
1808
}
1809

1810 1811
void sk_destruct(struct sock *sk)
{
1812 1813 1814 1815 1816 1817 1818 1819
	bool use_call_rcu = sock_flag(sk, SOCK_RCU_FREE);

	if (rcu_access_pointer(sk->sk_reuseport_cb)) {
		reuseport_detach_sock(sk);
		use_call_rcu = true;
	}

	if (use_call_rcu)
1820 1821 1822 1823 1824
		call_rcu(&sk->sk_rcu, __sk_destruct);
	else
		__sk_destruct(&sk->sk_rcu);
}

1825 1826
static void __sk_free(struct sock *sk)
{
1827 1828 1829
	if (likely(sk->sk_net_refcnt))
		sock_inuse_add(sock_net(sk), -1);

1830
	if (unlikely(sk->sk_net_refcnt && sock_diag_has_destroy_listeners(sk)))
1831 1832 1833 1834 1835
		sock_diag_broadcast_destroy(sk);
	else
		sk_destruct(sk);
}

1836 1837 1838
void sk_free(struct sock *sk)
{
	/*
L
Lucas De Marchi 已提交
1839
	 * We subtract one from sk_wmem_alloc and can know if
1840 1841 1842
	 * some packets are still in some tx queue.
	 * If not null, sock_wfree() will call __sk_free(sk) later
	 */
1843
	if (refcount_dec_and_test(&sk->sk_wmem_alloc))
1844 1845
		__sk_free(sk);
}
E
Eric Dumazet 已提交
1846
EXPORT_SYMBOL(sk_free);
L
Linus Torvalds 已提交
1847

1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868
static void sk_init_common(struct sock *sk)
{
	skb_queue_head_init(&sk->sk_receive_queue);
	skb_queue_head_init(&sk->sk_write_queue);
	skb_queue_head_init(&sk->sk_error_queue);

	rwlock_init(&sk->sk_callback_lock);
	lockdep_set_class_and_name(&sk->sk_receive_queue.lock,
			af_rlock_keys + sk->sk_family,
			af_family_rlock_key_strings[sk->sk_family]);
	lockdep_set_class_and_name(&sk->sk_write_queue.lock,
			af_wlock_keys + sk->sk_family,
			af_family_wlock_key_strings[sk->sk_family]);
	lockdep_set_class_and_name(&sk->sk_error_queue.lock,
			af_elock_keys + sk->sk_family,
			af_family_elock_key_strings[sk->sk_family]);
	lockdep_set_class_and_name(&sk->sk_callback_lock,
			af_callback_keys + sk->sk_family,
			af_family_clock_key_strings[sk->sk_family]);
}

1869 1870 1871 1872 1873 1874 1875 1876
/**
 *	sk_clone_lock - clone a socket, and lock its clone
 *	@sk: the socket to clone
 *	@priority: for allocation (%GFP_KERNEL, %GFP_ATOMIC, etc)
 *
 *	Caller must unlock socket even in error path (bh_unlock_sock(newsk))
 */
struct sock *sk_clone_lock(const struct sock *sk, const gfp_t priority)
1877
{
1878
	struct proto *prot = READ_ONCE(sk->sk_prot);
1879
	struct sk_filter *filter;
1880
	bool is_charged = true;
1881
	struct sock *newsk;
1882

1883
	newsk = sk_prot_alloc(prot, priority, sk->sk_family);
1884 1885
	if (!newsk)
		goto out;
1886

1887
	sock_copy(newsk, sk);
1888

1889
	newsk->sk_prot_creator = prot;
1890

1891 1892 1893 1894 1895 1896 1897 1898
	/* SANITY */
	if (likely(newsk->sk_net_refcnt))
		get_net(sock_net(newsk));
	sk_node_init(&newsk->sk_node);
	sock_lock_init(newsk);
	bh_lock_sock(newsk);
	newsk->sk_backlog.head	= newsk->sk_backlog.tail = NULL;
	newsk->sk_backlog.len = 0;
1899

1900
	atomic_set(&newsk->sk_rmem_alloc, 0);
1901

1902 1903
	/* sk_wmem_alloc set to one (see sk_free() and sock_wfree()) */
	refcount_set(&newsk->sk_wmem_alloc, 1);
1904

1905 1906
	atomic_set(&newsk->sk_omem_alloc, 0);
	sk_init_common(newsk);
1907

1908 1909 1910 1911 1912 1913 1914 1915
	newsk->sk_dst_cache	= NULL;
	newsk->sk_dst_pending_confirm = 0;
	newsk->sk_wmem_queued	= 0;
	newsk->sk_forward_alloc = 0;
	atomic_set(&newsk->sk_drops, 0);
	newsk->sk_send_head	= NULL;
	newsk->sk_userlocks	= sk->sk_userlocks & ~SOCK_BINDPORT_LOCK;
	atomic_set(&newsk->sk_zckey, 0);
1916

1917
	sock_reset_flag(newsk, SOCK_DONE);
1918

1919 1920
	/* sk->sk_memcg will be populated at accept() time */
	newsk->sk_memcg = NULL;
1921

1922
	cgroup_sk_clone(&newsk->sk_cgrp_data);
1923

1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938
	rcu_read_lock();
	filter = rcu_dereference(sk->sk_filter);
	if (filter != NULL)
		/* though it's an empty new sock, the charging may fail
		 * if sysctl_optmem_max was changed between creation of
		 * original socket and cloning
		 */
		is_charged = sk_filter_charge(newsk, filter);
	RCU_INIT_POINTER(newsk->sk_filter, filter);
	rcu_read_unlock();

	if (unlikely(!is_charged || xfrm_sk_clone_policy(newsk, sk))) {
		/* We need to make sure that we don't uncharge the new
		 * socket if we couldn't charge it in the first place
		 * as otherwise we uncharge the parent's filter.
1939
		 */
1940 1941 1942 1943 1944 1945 1946
		if (!is_charged)
			RCU_INIT_POINTER(newsk->sk_filter, NULL);
		sk_free_unlock_clone(newsk);
		newsk = NULL;
		goto out;
	}
	RCU_INIT_POINTER(newsk->sk_reuseport_cb, NULL);
1947

1948 1949 1950 1951 1952
	if (bpf_sk_storage_clone(sk, newsk)) {
		sk_free_unlock_clone(newsk);
		newsk = NULL;
		goto out;
	}
1953

1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971
	/* Clear sk_user_data if parent had the pointer tagged
	 * as not suitable for copying when cloning.
	 */
	if (sk_user_data_is_nocopy(newsk))
		newsk->sk_user_data = NULL;

	newsk->sk_err	   = 0;
	newsk->sk_err_soft = 0;
	newsk->sk_priority = 0;
	newsk->sk_incoming_cpu = raw_smp_processor_id();
	if (likely(newsk->sk_net_refcnt))
		sock_inuse_add(sock_net(newsk), 1);

	/* Before updating sk_refcnt, we must commit prior changes to memory
	 * (Documentation/RCU/rculist_nulls.rst for details)
	 */
	smp_wmb();
	refcount_set(&newsk->sk_refcnt, 2);
1972

1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986
	/* Increment the counter in the same struct proto as the master
	 * sock (sk_refcnt_debug_inc uses newsk->sk_prot->socks, that
	 * is the same as sk->sk_prot->socks, as this field was copied
	 * with memcpy).
	 *
	 * This _changes_ the previous behaviour, where
	 * tcp_create_openreq_child always was incrementing the
	 * equivalent to tcp_prot->socks (inet_sock_nr), so this have
	 * to be taken into account in all callers. -acme
	 */
	sk_refcnt_debug_inc(newsk);
	sk_set_socket(newsk, NULL);
	sk_tx_queue_clear(newsk);
	RCU_INIT_POINTER(newsk->sk_wq, NULL);
1987

1988 1989
	if (newsk->sk_prot->sockets_allocated)
		sk_sockets_allocated_inc(newsk);
1990

1991 1992
	if (sock_needs_netstamp(sk) && newsk->sk_flags & SK_FLAGS_TIMESTAMP)
		net_enable_timestamp();
1993 1994 1995
out:
	return newsk;
}
1996
EXPORT_SYMBOL_GPL(sk_clone_lock);
1997

1998 1999 2000 2001 2002 2003 2004 2005 2006 2007
void sk_free_unlock_clone(struct sock *sk)
{
	/* It is still raw copy of parent, so invalidate
	 * destructor and make plain sk_free() */
	sk->sk_destruct = NULL;
	bh_unlock_sock(sk);
	sk_free(sk);
}
EXPORT_SYMBOL_GPL(sk_free_unlock_clone);

2008 2009
void sk_setup_caps(struct sock *sk, struct dst_entry *dst)
{
2010 2011
	u32 max_segs = 1;

E
Eric Dumazet 已提交
2012
	sk_dst_set(sk, dst);
2013
	sk->sk_route_caps = dst->dev->features | sk->sk_route_forced_caps;
2014
	if (sk->sk_route_caps & NETIF_F_GSO)
2015
		sk->sk_route_caps |= NETIF_F_GSO_SOFTWARE;
E
Eric Dumazet 已提交
2016
	sk->sk_route_caps &= ~sk->sk_route_nocaps;
2017
	if (sk_can_gso(sk)) {
2018
		if (dst->header_len && !xfrm_dst_offload_ok(dst)) {
2019
			sk->sk_route_caps &= ~NETIF_F_GSO_MASK;
2020
		} else {
2021
			sk->sk_route_caps |= NETIF_F_SG | NETIF_F_HW_CSUM;
2022
			sk->sk_gso_max_size = dst->dev->gso_max_size;
2023
			max_segs = max_t(u32, dst->dev->gso_max_segs, 1);
2024
		}
2025
	}
2026
	sk->sk_gso_max_segs = max_segs;
2027 2028 2029
}
EXPORT_SYMBOL_GPL(sk_setup_caps);

L
Linus Torvalds 已提交
2030 2031 2032 2033 2034
/*
 *	Simple resource managers for sockets.
 */


2035 2036
/*
 * Write buffer destructor automatically called from kfree_skb.
L
Linus Torvalds 已提交
2037 2038 2039 2040
 */
void sock_wfree(struct sk_buff *skb)
{
	struct sock *sk = skb->sk;
E
Eric Dumazet 已提交
2041
	unsigned int len = skb->truesize;
L
Linus Torvalds 已提交
2042

E
Eric Dumazet 已提交
2043 2044 2045 2046 2047
	if (!sock_flag(sk, SOCK_USE_WRITE_QUEUE)) {
		/*
		 * Keep a reference on sk_wmem_alloc, this will be released
		 * after sk_write_space() call
		 */
2048
		WARN_ON(refcount_sub_and_test(len - 1, &sk->sk_wmem_alloc));
L
Linus Torvalds 已提交
2049
		sk->sk_write_space(sk);
E
Eric Dumazet 已提交
2050 2051
		len = 1;
	}
2052
	/*
E
Eric Dumazet 已提交
2053 2054
	 * if sk_wmem_alloc reaches 0, we must finish what sk_free()
	 * could not do because of in-flight packets
2055
	 */
2056
	if (refcount_sub_and_test(len, &sk->sk_wmem_alloc))
2057
		__sk_free(sk);
L
Linus Torvalds 已提交
2058
}
E
Eric Dumazet 已提交
2059
EXPORT_SYMBOL(sock_wfree);
L
Linus Torvalds 已提交
2060

E
Eric Dumazet 已提交
2061 2062 2063 2064 2065 2066 2067
/* This variant of sock_wfree() is used by TCP,
 * since it sets SOCK_USE_WRITE_QUEUE.
 */
void __sock_wfree(struct sk_buff *skb)
{
	struct sock *sk = skb->sk;

2068
	if (refcount_sub_and_test(skb->truesize, &sk->sk_wmem_alloc))
E
Eric Dumazet 已提交
2069 2070 2071
		__sk_free(sk);
}

2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089
void skb_set_owner_w(struct sk_buff *skb, struct sock *sk)
{
	skb_orphan(skb);
	skb->sk = sk;
#ifdef CONFIG_INET
	if (unlikely(!sk_fullsock(sk))) {
		skb->destructor = sock_edemux;
		sock_hold(sk);
		return;
	}
#endif
	skb->destructor = sock_wfree;
	skb_set_hash_from_sk(skb, sk);
	/*
	 * We used to take a refcount on sk, but following operation
	 * is enough to guarantee sk_free() wont free this sock until
	 * all in-flight packets are completed
	 */
2090
	refcount_add(skb->truesize, &sk->sk_wmem_alloc);
2091 2092 2093
}
EXPORT_SYMBOL(skb_set_owner_w);

2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106
static bool can_skb_orphan_partial(const struct sk_buff *skb)
{
#ifdef CONFIG_TLS_DEVICE
	/* Drivers depend on in-order delivery for crypto offload,
	 * partial orphan breaks out-of-order-OK logic.
	 */
	if (skb->decrypted)
		return false;
#endif
	return (skb->destructor == sock_wfree ||
		(IS_ENABLED(CONFIG_INET) && skb->destructor == tcp_wfree));
}

E
Eric Dumazet 已提交
2107 2108 2109 2110
/* This helper is used by netem, as it can hold packets in its
 * delay queue. We want to allow the owner socket to send more
 * packets, as if they were already TX completed by a typical driver.
 * But we also want to keep skb->sk set because some packet schedulers
E
Eric Dumazet 已提交
2111
 * rely on it (sch_fq for example).
E
Eric Dumazet 已提交
2112
 */
2113 2114
void skb_orphan_partial(struct sk_buff *skb)
{
E
Eric Dumazet 已提交
2115
	if (skb_is_tcp_pure_ack(skb))
E
Eric Dumazet 已提交
2116 2117
		return;

2118
	if (can_skb_orphan_partial(skb)) {
E
Eric Dumazet 已提交
2119 2120
		struct sock *sk = skb->sk;

2121
		if (refcount_inc_not_zero(&sk->sk_refcnt)) {
2122
			WARN_ON(refcount_sub_and_test(skb->truesize, &sk->sk_wmem_alloc));
E
Eric Dumazet 已提交
2123 2124
			skb->destructor = sock_efree;
		}
2125 2126 2127 2128 2129 2130
	} else {
		skb_orphan(skb);
	}
}
EXPORT_SYMBOL(skb_orphan_partial);

2131 2132
/*
 * Read buffer destructor automatically called from kfree_skb.
L
Linus Torvalds 已提交
2133 2134 2135 2136
 */
void sock_rfree(struct sk_buff *skb)
{
	struct sock *sk = skb->sk;
E
Eric Dumazet 已提交
2137
	unsigned int len = skb->truesize;
L
Linus Torvalds 已提交
2138

E
Eric Dumazet 已提交
2139 2140
	atomic_sub(len, &sk->sk_rmem_alloc);
	sk_mem_uncharge(sk, len);
L
Linus Torvalds 已提交
2141
}
E
Eric Dumazet 已提交
2142
EXPORT_SYMBOL(sock_rfree);
L
Linus Torvalds 已提交
2143

2144 2145 2146 2147
/*
 * Buffer destructor for skbs that are not used directly in read or write
 * path, e.g. for error handler skbs. Automatically called from kfree_skb.
 */
2148 2149 2150 2151 2152 2153
void sock_efree(struct sk_buff *skb)
{
	sock_put(skb->sk);
}
EXPORT_SYMBOL(sock_efree);

J
Joe Stringer 已提交
2154 2155 2156 2157 2158 2159
/* Buffer destructor for prefetch/receive path where reference count may
 * not be held, e.g. for listen sockets.
 */
#ifdef CONFIG_INET
void sock_pfree(struct sk_buff *skb)
{
2160 2161
	if (sk_is_refcounted(skb->sk))
		sock_gen_put(skb->sk);
J
Joe Stringer 已提交
2162 2163 2164 2165
}
EXPORT_SYMBOL(sock_pfree);
#endif /* CONFIG_INET */

2166
kuid_t sock_i_uid(struct sock *sk)
L
Linus Torvalds 已提交
2167
{
2168
	kuid_t uid;
L
Linus Torvalds 已提交
2169

E
Eric Dumazet 已提交
2170
	read_lock_bh(&sk->sk_callback_lock);
2171
	uid = sk->sk_socket ? SOCK_INODE(sk->sk_socket)->i_uid : GLOBAL_ROOT_UID;
E
Eric Dumazet 已提交
2172
	read_unlock_bh(&sk->sk_callback_lock);
L
Linus Torvalds 已提交
2173 2174
	return uid;
}
E
Eric Dumazet 已提交
2175
EXPORT_SYMBOL(sock_i_uid);
L
Linus Torvalds 已提交
2176 2177 2178 2179 2180

unsigned long sock_i_ino(struct sock *sk)
{
	unsigned long ino;

E
Eric Dumazet 已提交
2181
	read_lock_bh(&sk->sk_callback_lock);
L
Linus Torvalds 已提交
2182
	ino = sk->sk_socket ? SOCK_INODE(sk->sk_socket)->i_ino : 0;
E
Eric Dumazet 已提交
2183
	read_unlock_bh(&sk->sk_callback_lock);
L
Linus Torvalds 已提交
2184 2185
	return ino;
}
E
Eric Dumazet 已提交
2186
EXPORT_SYMBOL(sock_i_ino);
L
Linus Torvalds 已提交
2187 2188 2189 2190

/*
 * Allocate a skb from the socket's send buffer.
 */
V
Victor Fusco 已提交
2191
struct sk_buff *sock_wmalloc(struct sock *sk, unsigned long size, int force,
A
Al Viro 已提交
2192
			     gfp_t priority)
L
Linus Torvalds 已提交
2193
{
2194 2195
	if (force ||
	    refcount_read(&sk->sk_wmem_alloc) < READ_ONCE(sk->sk_sndbuf)) {
E
Eric Dumazet 已提交
2196
		struct sk_buff *skb = alloc_skb(size, priority);
2197

L
Linus Torvalds 已提交
2198 2199 2200 2201 2202 2203 2204
		if (skb) {
			skb_set_owner_w(skb, sk);
			return skb;
		}
	}
	return NULL;
}
E
Eric Dumazet 已提交
2205
EXPORT_SYMBOL(sock_wmalloc);
L
Linus Torvalds 已提交
2206

2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233
static void sock_ofree(struct sk_buff *skb)
{
	struct sock *sk = skb->sk;

	atomic_sub(skb->truesize, &sk->sk_omem_alloc);
}

struct sk_buff *sock_omalloc(struct sock *sk, unsigned long size,
			     gfp_t priority)
{
	struct sk_buff *skb;

	/* small safe race: SKB_TRUESIZE may differ from final skb->truesize */
	if (atomic_read(&sk->sk_omem_alloc) + SKB_TRUESIZE(size) >
	    sysctl_optmem_max)
		return NULL;

	skb = alloc_skb(size, priority);
	if (!skb)
		return NULL;

	atomic_add(skb->truesize, &sk->sk_omem_alloc);
	skb->sk = sk;
	skb->destructor = sock_ofree;
	return skb;
}

2234
/*
L
Linus Torvalds 已提交
2235
 * Allocate a memory block from the socket's option memory buffer.
2236
 */
A
Al Viro 已提交
2237
void *sock_kmalloc(struct sock *sk, int size, gfp_t priority)
L
Linus Torvalds 已提交
2238
{
2239
	if ((unsigned int)size <= sysctl_optmem_max &&
L
Linus Torvalds 已提交
2240 2241 2242
	    atomic_read(&sk->sk_omem_alloc) + size < sysctl_optmem_max) {
		void *mem;
		/* First do the add, to avoid the race if kmalloc
2243
		 * might sleep.
L
Linus Torvalds 已提交
2244 2245 2246 2247 2248 2249 2250 2251 2252
		 */
		atomic_add(size, &sk->sk_omem_alloc);
		mem = kmalloc(size, priority);
		if (mem)
			return mem;
		atomic_sub(size, &sk->sk_omem_alloc);
	}
	return NULL;
}
E
Eric Dumazet 已提交
2253
EXPORT_SYMBOL(sock_kmalloc);
L
Linus Torvalds 已提交
2254

2255 2256 2257
/* Free an option memory block. Note, we actually want the inline
 * here as this allows gcc to detect the nullify and fold away the
 * condition entirely.
L
Linus Torvalds 已提交
2258
 */
2259 2260
static inline void __sock_kfree_s(struct sock *sk, void *mem, int size,
				  const bool nullify)
L
Linus Torvalds 已提交
2261
{
2262 2263
	if (WARN_ON_ONCE(!mem))
		return;
2264
	if (nullify)
2265
		kfree_sensitive(mem);
2266 2267
	else
		kfree(mem);
L
Linus Torvalds 已提交
2268 2269
	atomic_sub(size, &sk->sk_omem_alloc);
}
2270 2271 2272 2273 2274

void sock_kfree_s(struct sock *sk, void *mem, int size)
{
	__sock_kfree_s(sk, mem, size, false);
}
E
Eric Dumazet 已提交
2275
EXPORT_SYMBOL(sock_kfree_s);
L
Linus Torvalds 已提交
2276

2277 2278 2279 2280 2281 2282
void sock_kzfree_s(struct sock *sk, void *mem, int size)
{
	__sock_kfree_s(sk, mem, size, true);
}
EXPORT_SYMBOL(sock_kzfree_s);

L
Linus Torvalds 已提交
2283 2284 2285
/* It is almost wait_for_tcp_memory minus release_sock/lock_sock.
   I think, these locks should be removed for datagram sockets.
 */
E
Eric Dumazet 已提交
2286
static long sock_wait_for_wmem(struct sock *sk, long timeo)
L
Linus Torvalds 已提交
2287 2288 2289
{
	DEFINE_WAIT(wait);

2290
	sk_clear_bit(SOCKWQ_ASYNC_NOSPACE, sk);
L
Linus Torvalds 已提交
2291 2292 2293 2294 2295 2296
	for (;;) {
		if (!timeo)
			break;
		if (signal_pending(current))
			break;
		set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
E
Eric Dumazet 已提交
2297
		prepare_to_wait(sk_sleep(sk), &wait, TASK_INTERRUPTIBLE);
2298
		if (refcount_read(&sk->sk_wmem_alloc) < READ_ONCE(sk->sk_sndbuf))
L
Linus Torvalds 已提交
2299 2300 2301 2302 2303 2304 2305
			break;
		if (sk->sk_shutdown & SEND_SHUTDOWN)
			break;
		if (sk->sk_err)
			break;
		timeo = schedule_timeout(timeo);
	}
E
Eric Dumazet 已提交
2306
	finish_wait(sk_sleep(sk), &wait);
L
Linus Torvalds 已提交
2307 2308 2309 2310 2311 2312 2313 2314
	return timeo;
}


/*
 *	Generic send/receive buffer handlers
 */

H
Herbert Xu 已提交
2315 2316
struct sk_buff *sock_alloc_send_pskb(struct sock *sk, unsigned long header_len,
				     unsigned long data_len, int noblock,
2317
				     int *errcode, int max_page_order)
L
Linus Torvalds 已提交
2318
{
2319
	struct sk_buff *skb;
L
Linus Torvalds 已提交
2320 2321 2322 2323
	long timeo;
	int err;

	timeo = sock_sndtimeo(sk, noblock);
2324
	for (;;) {
L
Linus Torvalds 已提交
2325 2326 2327 2328 2329 2330 2331 2332
		err = sock_error(sk);
		if (err != 0)
			goto failure;

		err = -EPIPE;
		if (sk->sk_shutdown & SEND_SHUTDOWN)
			goto failure;

2333
		if (sk_wmem_alloc_get(sk) < READ_ONCE(sk->sk_sndbuf))
2334
			break;
2335

2336
		sk_set_bit(SOCKWQ_ASYNC_NOSPACE, sk);
2337 2338 2339
		set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
		err = -EAGAIN;
		if (!timeo)
L
Linus Torvalds 已提交
2340
			goto failure;
2341 2342 2343
		if (signal_pending(current))
			goto interrupted;
		timeo = sock_wait_for_wmem(sk, timeo);
L
Linus Torvalds 已提交
2344
	}
2345 2346 2347 2348
	skb = alloc_skb_with_frags(header_len, data_len, max_page_order,
				   errcode, sk->sk_allocation);
	if (skb)
		skb_set_owner_w(skb, sk);
L
Linus Torvalds 已提交
2349 2350 2351 2352 2353 2354 2355 2356
	return skb;

interrupted:
	err = sock_intr_errno(timeo);
failure:
	*errcode = err;
	return NULL;
}
H
Herbert Xu 已提交
2357
EXPORT_SYMBOL(sock_alloc_send_pskb);
L
Linus Torvalds 已提交
2358

2359
struct sk_buff *sock_alloc_send_skb(struct sock *sk, unsigned long size,
L
Linus Torvalds 已提交
2360 2361
				    int noblock, int *errcode)
{
2362
	return sock_alloc_send_pskb(sk, size, 0, noblock, errcode, 0);
L
Linus Torvalds 已提交
2363
}
E
Eric Dumazet 已提交
2364
EXPORT_SYMBOL(sock_alloc_send_skb);
L
Linus Torvalds 已提交
2365

2366 2367 2368
int __sock_cmsg_send(struct sock *sk, struct msghdr *msg, struct cmsghdr *cmsg,
		     struct sockcm_cookie *sockc)
{
2369 2370
	u32 tsflags;

2371 2372 2373 2374 2375 2376 2377 2378
	switch (cmsg->cmsg_type) {
	case SO_MARK:
		if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
			return -EPERM;
		if (cmsg->cmsg_len != CMSG_LEN(sizeof(u32)))
			return -EINVAL;
		sockc->mark = *(u32 *)CMSG_DATA(cmsg);
		break;
2379
	case SO_TIMESTAMPING_OLD:
2380 2381 2382 2383 2384 2385 2386 2387 2388 2389
		if (cmsg->cmsg_len != CMSG_LEN(sizeof(u32)))
			return -EINVAL;

		tsflags = *(u32 *)CMSG_DATA(cmsg);
		if (tsflags & ~SOF_TIMESTAMPING_TX_RECORD_MASK)
			return -EINVAL;

		sockc->tsflags &= ~SOF_TIMESTAMPING_TX_RECORD_MASK;
		sockc->tsflags |= tsflags;
		break;
2390 2391 2392 2393 2394 2395 2396
	case SCM_TXTIME:
		if (!sock_flag(sk, SOCK_TXTIME))
			return -EINVAL;
		if (cmsg->cmsg_len != CMSG_LEN(sizeof(u64)))
			return -EINVAL;
		sockc->transmit_time = get_unaligned((u64 *)CMSG_DATA(cmsg));
		break;
2397 2398 2399 2400
	/* SCM_RIGHTS and SCM_CREDENTIALS are semantically in SOL_UNIX. */
	case SCM_RIGHTS:
	case SCM_CREDENTIALS:
		break;
2401 2402 2403 2404 2405 2406 2407
	default:
		return -EINVAL;
	}
	return 0;
}
EXPORT_SYMBOL(__sock_cmsg_send);

E
Edward Jee 已提交
2408 2409 2410 2411
int sock_cmsg_send(struct sock *sk, struct msghdr *msg,
		   struct sockcm_cookie *sockc)
{
	struct cmsghdr *cmsg;
2412
	int ret;
E
Edward Jee 已提交
2413 2414 2415 2416 2417 2418

	for_each_cmsghdr(cmsg, msg) {
		if (!CMSG_OK(msg, cmsg))
			return -EINVAL;
		if (cmsg->cmsg_level != SOL_SOCKET)
			continue;
2419 2420 2421
		ret = __sock_cmsg_send(sk, msg, cmsg, sockc);
		if (ret)
			return ret;
E
Edward Jee 已提交
2422 2423 2424 2425 2426
	}
	return 0;
}
EXPORT_SYMBOL(sock_cmsg_send);

2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441
static void sk_enter_memory_pressure(struct sock *sk)
{
	if (!sk->sk_prot->enter_memory_pressure)
		return;

	sk->sk_prot->enter_memory_pressure(sk);
}

static void sk_leave_memory_pressure(struct sock *sk)
{
	if (sk->sk_prot->leave_memory_pressure) {
		sk->sk_prot->leave_memory_pressure(sk);
	} else {
		unsigned long *memory_pressure = sk->sk_prot->memory_pressure;

2442 2443
		if (memory_pressure && READ_ONCE(*memory_pressure))
			WRITE_ONCE(*memory_pressure, 0);
2444 2445 2446
	}
}

2447
#define SKB_FRAG_PAGE_ORDER	get_order(32768)
2448
DEFINE_STATIC_KEY_FALSE(net_high_order_alloc_disable_key);
2449

E
Eric Dumazet 已提交
2450 2451 2452 2453
/**
 * skb_page_frag_refill - check that a page_frag contains enough room
 * @sz: minimum size of the fragment we want to get
 * @pfrag: pointer to page_frag
2454
 * @gfp: priority for memory allocation
E
Eric Dumazet 已提交
2455 2456 2457 2458 2459
 *
 * Note: While this allocator tries to use high order pages, there is
 * no guarantee that allocations succeed. Therefore, @sz MUST be
 * less or equal than PAGE_SIZE.
 */
2460
bool skb_page_frag_refill(unsigned int sz, struct page_frag *pfrag, gfp_t gfp)
2461 2462
{
	if (pfrag->page) {
2463
		if (page_ref_count(pfrag->page) == 1) {
2464 2465 2466
			pfrag->offset = 0;
			return true;
		}
E
Eric Dumazet 已提交
2467
		if (pfrag->offset + sz <= pfrag->size)
2468 2469 2470 2471
			return true;
		put_page(pfrag->page);
	}

2472
	pfrag->offset = 0;
2473 2474
	if (SKB_FRAG_PAGE_ORDER &&
	    !static_branch_unlikely(&net_high_order_alloc_disable_key)) {
2475 2476 2477 2478
		/* Avoid direct reclaim but allow kswapd to wake */
		pfrag->page = alloc_pages((gfp & ~__GFP_DIRECT_RECLAIM) |
					  __GFP_COMP | __GFP_NOWARN |
					  __GFP_NORETRY,
2479
					  SKB_FRAG_PAGE_ORDER);
2480
		if (likely(pfrag->page)) {
2481
			pfrag->size = PAGE_SIZE << SKB_FRAG_PAGE_ORDER;
2482 2483
			return true;
		}
2484 2485 2486 2487 2488 2489
	}
	pfrag->page = alloc_page(gfp);
	if (likely(pfrag->page)) {
		pfrag->size = PAGE_SIZE;
		return true;
	}
E
Eric Dumazet 已提交
2490 2491 2492 2493 2494 2495 2496 2497 2498
	return false;
}
EXPORT_SYMBOL(skb_page_frag_refill);

bool sk_page_frag_refill(struct sock *sk, struct page_frag *pfrag)
{
	if (likely(skb_page_frag_refill(32U, pfrag, sk->sk_allocation)))
		return true;

2499 2500 2501 2502 2503 2504
	sk_enter_memory_pressure(sk);
	sk_stream_moderate_sndbuf(sk);
	return false;
}
EXPORT_SYMBOL(sk_page_frag_refill);

2505
void __lock_sock(struct sock *sk)
2506 2507
	__releases(&sk->sk_lock.slock)
	__acquires(&sk->sk_lock.slock)
L
Linus Torvalds 已提交
2508 2509 2510
{
	DEFINE_WAIT(wait);

2511
	for (;;) {
L
Linus Torvalds 已提交
2512 2513 2514 2515 2516
		prepare_to_wait_exclusive(&sk->sk_lock.wq, &wait,
					TASK_UNINTERRUPTIBLE);
		spin_unlock_bh(&sk->sk_lock.slock);
		schedule();
		spin_lock_bh(&sk->sk_lock.slock);
2517
		if (!sock_owned_by_user(sk))
L
Linus Torvalds 已提交
2518 2519 2520 2521 2522
			break;
	}
	finish_wait(&sk->sk_lock.wq, &wait);
}

2523
void __release_sock(struct sock *sk)
2524 2525
	__releases(&sk->sk_lock.slock)
	__acquires(&sk->sk_lock.slock)
L
Linus Torvalds 已提交
2526
{
2527
	struct sk_buff *skb, *next;
L
Linus Torvalds 已提交
2528

2529
	while ((skb = sk->sk_backlog.head) != NULL) {
L
Linus Torvalds 已提交
2530 2531
		sk->sk_backlog.head = sk->sk_backlog.tail = NULL;

2532
		spin_unlock_bh(&sk->sk_lock.slock);
L
Linus Torvalds 已提交
2533

2534 2535
		do {
			next = skb->next;
2536
			prefetch(next);
E
Eric Dumazet 已提交
2537
			WARN_ON_ONCE(skb_dst_is_noref(skb));
2538
			skb_mark_not_on_list(skb);
P
Peter Zijlstra 已提交
2539
			sk_backlog_rcv(sk, skb);
L
Linus Torvalds 已提交
2540

2541
			cond_resched();
L
Linus Torvalds 已提交
2542 2543 2544 2545

			skb = next;
		} while (skb != NULL);

2546 2547
		spin_lock_bh(&sk->sk_lock.slock);
	}
Z
Zhu Yi 已提交
2548 2549 2550 2551 2552 2553

	/*
	 * Doing the zeroing here guarantee we can not loop forever
	 * while a wild producer attempts to flood us.
	 */
	sk->sk_backlog.len = 0;
L
Linus Torvalds 已提交
2554 2555
}

2556 2557 2558 2559 2560 2561 2562
void __sk_flush_backlog(struct sock *sk)
{
	spin_lock_bh(&sk->sk_lock.slock);
	__release_sock(sk);
	spin_unlock_bh(&sk->sk_lock.slock);
}

L
Linus Torvalds 已提交
2563 2564
/**
 * sk_wait_data - wait for data to arrive at sk_receive_queue
2565 2566
 * @sk:    sock to wait on
 * @timeo: for how long
2567
 * @skb:   last skb seen on sk_receive_queue
L
Linus Torvalds 已提交
2568 2569 2570 2571 2572 2573
 *
 * Now socket state including sk->sk_err is changed only under lock,
 * hence we may omit checks after joining wait queue.
 * We check receive queue before schedule() only as optimization;
 * it is very likely that release_sock() added new data.
 */
2574
int sk_wait_data(struct sock *sk, long *timeo, const struct sk_buff *skb)
L
Linus Torvalds 已提交
2575
{
W
WANG Cong 已提交
2576
	DEFINE_WAIT_FUNC(wait, woken_wake_function);
L
Linus Torvalds 已提交
2577 2578
	int rc;

W
WANG Cong 已提交
2579
	add_wait_queue(sk_sleep(sk), &wait);
2580
	sk_set_bit(SOCKWQ_ASYNC_WAITDATA, sk);
W
WANG Cong 已提交
2581
	rc = sk_wait_event(sk, timeo, skb_peek_tail(&sk->sk_receive_queue) != skb, &wait);
2582
	sk_clear_bit(SOCKWQ_ASYNC_WAITDATA, sk);
W
WANG Cong 已提交
2583
	remove_wait_queue(sk_sleep(sk), &wait);
L
Linus Torvalds 已提交
2584 2585 2586 2587
	return rc;
}
EXPORT_SYMBOL(sk_wait_data);

2588
/**
2589
 *	__sk_mem_raise_allocated - increase memory_allocated
2590 2591
 *	@sk: socket
 *	@size: memory size to allocate
2592
 *	@amt: pages to allocate
2593 2594
 *	@kind: allocation type
 *
2595
 *	Similar to __sk_mem_schedule(), but does not update sk_forward_alloc
2596
 */
2597
int __sk_mem_raise_allocated(struct sock *sk, int size, int amt, int kind)
2598 2599
{
	struct proto *prot = sk->sk_prot;
2600
	long allocated = sk_memory_allocated_add(sk, amt);
2601
	bool charged = true;
2602

2603
	if (mem_cgroup_sockets_enabled && sk->sk_memcg &&
2604
	    !(charged = mem_cgroup_charge_skmem(sk->sk_memcg, amt)))
2605
		goto suppress_allocation;
2606 2607

	/* Under limit. */
2608
	if (allocated <= sk_prot_mem_limits(sk, 0)) {
2609
		sk_leave_memory_pressure(sk);
2610 2611 2612
		return 1;
	}

2613 2614
	/* Under pressure. */
	if (allocated > sk_prot_mem_limits(sk, 1))
2615
		sk_enter_memory_pressure(sk);
2616

2617 2618
	/* Over hard limit. */
	if (allocated > sk_prot_mem_limits(sk, 2))
2619 2620 2621 2622
		goto suppress_allocation;

	/* guarantee minimum buffer size under pressure */
	if (kind == SK_MEM_RECV) {
2623
		if (atomic_read(&sk->sk_rmem_alloc) < sk_get_rmem0(sk, prot))
2624
			return 1;
2625

2626
	} else { /* SK_MEM_SEND */
2627 2628
		int wmem0 = sk_get_wmem0(sk, prot);

2629
		if (sk->sk_type == SOCK_STREAM) {
2630
			if (sk->sk_wmem_queued < wmem0)
2631
				return 1;
2632
		} else if (refcount_read(&sk->sk_wmem_alloc) < wmem0) {
2633
				return 1;
2634
		}
2635 2636
	}

2637
	if (sk_has_memory_pressure(sk)) {
2638
		u64 alloc;
2639

2640
		if (!sk_under_memory_pressure(sk))
2641
			return 1;
2642 2643
		alloc = sk_sockets_allocated_read_positive(sk);
		if (sk_prot_mem_limits(sk, 2) > alloc *
2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661
		    sk_mem_pages(sk->sk_wmem_queued +
				 atomic_read(&sk->sk_rmem_alloc) +
				 sk->sk_forward_alloc))
			return 1;
	}

suppress_allocation:

	if (kind == SK_MEM_SEND && sk->sk_type == SOCK_STREAM) {
		sk_stream_moderate_sndbuf(sk);

		/* Fail only if socket is _under_ its sndbuf.
		 * In this case we cannot block, so that we have to fail.
		 */
		if (sk->sk_wmem_queued + size >= sk->sk_sndbuf)
			return 1;
	}

2662 2663
	if (kind == SK_MEM_SEND || (kind == SK_MEM_RECV && charged))
		trace_sock_exceed_buf_limit(sk, prot, allocated, kind);
2664

2665
	sk_memory_allocated_sub(sk, amt);
2666

2667 2668
	if (mem_cgroup_sockets_enabled && sk->sk_memcg)
		mem_cgroup_uncharge_skmem(sk->sk_memcg, amt);
2669

2670 2671
	return 0;
}
2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693
EXPORT_SYMBOL(__sk_mem_raise_allocated);

/**
 *	__sk_mem_schedule - increase sk_forward_alloc and memory_allocated
 *	@sk: socket
 *	@size: memory size to allocate
 *	@kind: allocation type
 *
 *	If kind is SK_MEM_SEND, it means wmem allocation. Otherwise it means
 *	rmem allocation. This function assumes that protocols which have
 *	memory_pressure use sk_wmem_queued as write buffer accounting.
 */
int __sk_mem_schedule(struct sock *sk, int size, int kind)
{
	int ret, amt = sk_mem_pages(size);

	sk->sk_forward_alloc += amt << SK_MEM_QUANTUM_SHIFT;
	ret = __sk_mem_raise_allocated(sk, size, amt, kind);
	if (!ret)
		sk->sk_forward_alloc -= amt << SK_MEM_QUANTUM_SHIFT;
	return ret;
}
2694 2695 2696
EXPORT_SYMBOL(__sk_mem_schedule);

/**
2697
 *	__sk_mem_reduce_allocated - reclaim memory_allocated
2698
 *	@sk: socket
2699 2700 2701
 *	@amount: number of quanta
 *
 *	Similar to __sk_mem_reclaim(), but does not update sk_forward_alloc
2702
 */
2703
void __sk_mem_reduce_allocated(struct sock *sk, int amount)
2704
{
E
Eric Dumazet 已提交
2705
	sk_memory_allocated_sub(sk, amount);
2706

2707 2708
	if (mem_cgroup_sockets_enabled && sk->sk_memcg)
		mem_cgroup_uncharge_skmem(sk->sk_memcg, amount);
2709

2710 2711 2712
	if (sk_under_memory_pressure(sk) &&
	    (sk_memory_allocated(sk) < sk_prot_mem_limits(sk, 0)))
		sk_leave_memory_pressure(sk);
2713
}
2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726
EXPORT_SYMBOL(__sk_mem_reduce_allocated);

/**
 *	__sk_mem_reclaim - reclaim sk_forward_alloc and memory_allocated
 *	@sk: socket
 *	@amount: number of bytes (rounded down to a SK_MEM_QUANTUM multiple)
 */
void __sk_mem_reclaim(struct sock *sk, int amount)
{
	amount >>= SK_MEM_QUANTUM_SHIFT;
	sk->sk_forward_alloc -= amount << SK_MEM_QUANTUM_SHIFT;
	__sk_mem_reduce_allocated(sk, amount);
}
2727 2728
EXPORT_SYMBOL(__sk_mem_reclaim);

2729 2730 2731 2732 2733 2734
int sk_set_peek_off(struct sock *sk, int val)
{
	sk->sk_peek_off = val;
	return 0;
}
EXPORT_SYMBOL_GPL(sk_set_peek_off);
2735

L
Linus Torvalds 已提交
2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746
/*
 * Set of default routines for initialising struct proto_ops when
 * the protocol does not support a particular function. In certain
 * cases where it makes no sense for a protocol to have a "do nothing"
 * function, some default processing is provided.
 */

int sock_no_bind(struct socket *sock, struct sockaddr *saddr, int len)
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2747
EXPORT_SYMBOL(sock_no_bind);
L
Linus Torvalds 已提交
2748

2749
int sock_no_connect(struct socket *sock, struct sockaddr *saddr,
L
Linus Torvalds 已提交
2750 2751 2752 2753
		    int len, int flags)
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2754
EXPORT_SYMBOL(sock_no_connect);
L
Linus Torvalds 已提交
2755 2756 2757 2758 2759

int sock_no_socketpair(struct socket *sock1, struct socket *sock2)
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2760
EXPORT_SYMBOL(sock_no_socketpair);
L
Linus Torvalds 已提交
2761

2762 2763
int sock_no_accept(struct socket *sock, struct socket *newsock, int flags,
		   bool kern)
L
Linus Torvalds 已提交
2764 2765 2766
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2767
EXPORT_SYMBOL(sock_no_accept);
L
Linus Torvalds 已提交
2768

2769
int sock_no_getname(struct socket *sock, struct sockaddr *saddr,
2770
		    int peer)
L
Linus Torvalds 已提交
2771 2772 2773
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2774
EXPORT_SYMBOL(sock_no_getname);
L
Linus Torvalds 已提交
2775 2776 2777 2778 2779

int sock_no_ioctl(struct socket *sock, unsigned int cmd, unsigned long arg)
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2780
EXPORT_SYMBOL(sock_no_ioctl);
L
Linus Torvalds 已提交
2781 2782 2783 2784 2785

int sock_no_listen(struct socket *sock, int backlog)
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2786
EXPORT_SYMBOL(sock_no_listen);
L
Linus Torvalds 已提交
2787 2788 2789 2790 2791

int sock_no_shutdown(struct socket *sock, int how)
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2792
EXPORT_SYMBOL(sock_no_shutdown);
L
Linus Torvalds 已提交
2793

2794
int sock_no_sendmsg(struct socket *sock, struct msghdr *m, size_t len)
L
Linus Torvalds 已提交
2795 2796 2797
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2798
EXPORT_SYMBOL(sock_no_sendmsg);
L
Linus Torvalds 已提交
2799

2800 2801 2802 2803 2804 2805
int sock_no_sendmsg_locked(struct sock *sk, struct msghdr *m, size_t len)
{
	return -EOPNOTSUPP;
}
EXPORT_SYMBOL(sock_no_sendmsg_locked);

2806 2807
int sock_no_recvmsg(struct socket *sock, struct msghdr *m, size_t len,
		    int flags)
L
Linus Torvalds 已提交
2808 2809 2810
{
	return -EOPNOTSUPP;
}
E
Eric Dumazet 已提交
2811
EXPORT_SYMBOL(sock_no_recvmsg);
L
Linus Torvalds 已提交
2812 2813 2814 2815 2816 2817

int sock_no_mmap(struct file *file, struct socket *sock, struct vm_area_struct *vma)
{
	/* Mirror missing mmap method error code */
	return -ENODEV;
}
E
Eric Dumazet 已提交
2818
EXPORT_SYMBOL(sock_no_mmap);
L
Linus Torvalds 已提交
2819

2820 2821 2822 2823 2824 2825 2826 2827
/*
 * When a file is received (via SCM_RIGHTS, etc), we must bump the
 * various sock-based usage counts.
 */
void __receive_sock(struct file *file)
{
	struct socket *sock;

2828
	sock = sock_from_file(file);
2829 2830 2831 2832 2833 2834
	if (sock) {
		sock_update_netprioidx(&sock->sk->sk_cgrp_data);
		sock_update_classid(&sock->sk->sk_cgrp_data);
	}
}

L
Linus Torvalds 已提交
2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846
ssize_t sock_no_sendpage(struct socket *sock, struct page *page, int offset, size_t size, int flags)
{
	ssize_t res;
	struct msghdr msg = {.msg_flags = flags};
	struct kvec iov;
	char *kaddr = kmap(page);
	iov.iov_base = kaddr + offset;
	iov.iov_len = size;
	res = kernel_sendmsg(sock, &msg, &iov, 1, size);
	kunmap(page);
	return res;
}
E
Eric Dumazet 已提交
2847
EXPORT_SYMBOL(sock_no_sendpage);
L
Linus Torvalds 已提交
2848

2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864
ssize_t sock_no_sendpage_locked(struct sock *sk, struct page *page,
				int offset, size_t size, int flags)
{
	ssize_t res;
	struct msghdr msg = {.msg_flags = flags};
	struct kvec iov;
	char *kaddr = kmap(page);

	iov.iov_base = kaddr + offset;
	iov.iov_len = size;
	res = kernel_sendmsg_locked(sk, &msg, &iov, 1, size);
	kunmap(page);
	return res;
}
EXPORT_SYMBOL(sock_no_sendpage_locked);

L
Linus Torvalds 已提交
2865 2866 2867 2868 2869 2870
/*
 *	Default Socket Callbacks
 */

static void sock_def_wakeup(struct sock *sk)
{
2871 2872 2873 2874
	struct socket_wq *wq;

	rcu_read_lock();
	wq = rcu_dereference(sk->sk_wq);
H
Herbert Xu 已提交
2875
	if (skwq_has_sleeper(wq))
2876 2877
		wake_up_interruptible_all(&wq->wait);
	rcu_read_unlock();
L
Linus Torvalds 已提交
2878 2879 2880 2881
}

static void sock_def_error_report(struct sock *sk)
{
2882 2883 2884 2885
	struct socket_wq *wq;

	rcu_read_lock();
	wq = rcu_dereference(sk->sk_wq);
H
Herbert Xu 已提交
2886
	if (skwq_has_sleeper(wq))
2887
		wake_up_interruptible_poll(&wq->wait, EPOLLERR);
2888
	sk_wake_async(sk, SOCK_WAKE_IO, POLL_ERR);
2889
	rcu_read_unlock();
L
Linus Torvalds 已提交
2890 2891
}

2892
void sock_def_readable(struct sock *sk)
L
Linus Torvalds 已提交
2893
{
2894 2895 2896 2897
	struct socket_wq *wq;

	rcu_read_lock();
	wq = rcu_dereference(sk->sk_wq);
H
Herbert Xu 已提交
2898
	if (skwq_has_sleeper(wq))
2899 2900
		wake_up_interruptible_sync_poll(&wq->wait, EPOLLIN | EPOLLPRI |
						EPOLLRDNORM | EPOLLRDBAND);
2901
	sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_IN);
2902
	rcu_read_unlock();
L
Linus Torvalds 已提交
2903 2904 2905 2906
}

static void sock_def_write_space(struct sock *sk)
{
2907 2908 2909
	struct socket_wq *wq;

	rcu_read_lock();
L
Linus Torvalds 已提交
2910 2911 2912 2913

	/* Do not wake up a writer until he can make "significant"
	 * progress.  --DaveM
	 */
2914
	if ((refcount_read(&sk->sk_wmem_alloc) << 1) <= READ_ONCE(sk->sk_sndbuf)) {
2915
		wq = rcu_dereference(sk->sk_wq);
H
Herbert Xu 已提交
2916
		if (skwq_has_sleeper(wq))
2917 2918
			wake_up_interruptible_sync_poll(&wq->wait, EPOLLOUT |
						EPOLLWRNORM | EPOLLWRBAND);
L
Linus Torvalds 已提交
2919 2920 2921

		/* Should agree with poll, otherwise some programs break */
		if (sock_writeable(sk))
2922
			sk_wake_async(sk, SOCK_WAKE_SPACE, POLL_OUT);
L
Linus Torvalds 已提交
2923 2924
	}

2925
	rcu_read_unlock();
L
Linus Torvalds 已提交
2926 2927 2928 2929 2930 2931 2932 2933 2934 2935
}

static void sock_def_destruct(struct sock *sk)
{
}

void sk_send_sigurg(struct sock *sk)
{
	if (sk->sk_socket && sk->sk_socket->file)
		if (send_sigurg(&sk->sk_socket->file->f_owner))
2936
			sk_wake_async(sk, SOCK_WAKE_URG, POLL_PRI);
L
Linus Torvalds 已提交
2937
}
E
Eric Dumazet 已提交
2938
EXPORT_SYMBOL(sk_send_sigurg);
L
Linus Torvalds 已提交
2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949

void sk_reset_timer(struct sock *sk, struct timer_list* timer,
		    unsigned long expires)
{
	if (!mod_timer(timer, expires))
		sock_hold(sk);
}
EXPORT_SYMBOL(sk_reset_timer);

void sk_stop_timer(struct sock *sk, struct timer_list* timer)
{
2950
	if (del_timer(timer))
L
Linus Torvalds 已提交
2951 2952 2953 2954
		__sock_put(sk);
}
EXPORT_SYMBOL(sk_stop_timer);

2955 2956 2957 2958 2959 2960 2961
void sk_stop_timer_sync(struct sock *sk, struct timer_list *timer)
{
	if (del_timer_sync(timer))
		__sock_put(sk);
}
EXPORT_SYMBOL(sk_stop_timer_sync);

L
Linus Torvalds 已提交
2962 2963
void sock_init_data(struct socket *sock, struct sock *sk)
{
2964
	sk_init_common(sk);
L
Linus Torvalds 已提交
2965 2966
	sk->sk_send_head	=	NULL;

2967
	timer_setup(&sk->sk_timer, NULL, 0);
2968

L
Linus Torvalds 已提交
2969 2970 2971 2972
	sk->sk_allocation	=	GFP_KERNEL;
	sk->sk_rcvbuf		=	sysctl_rmem_default;
	sk->sk_sndbuf		=	sysctl_wmem_default;
	sk->sk_state		=	TCP_CLOSE;
2973
	sk_set_socket(sk, sock);
L
Linus Torvalds 已提交
2974 2975 2976

	sock_set_flag(sk, SOCK_ZAPPED);

2977
	if (sock) {
L
Linus Torvalds 已提交
2978
		sk->sk_type	=	sock->type;
2979
		RCU_INIT_POINTER(sk->sk_wq, &sock->wq);
L
Linus Torvalds 已提交
2980
		sock->sk	=	sk;
2981 2982
		sk->sk_uid	=	SOCK_INODE(sock)->i_uid;
	} else {
2983
		RCU_INIT_POINTER(sk->sk_wq, NULL);
2984 2985
		sk->sk_uid	=	make_kuid(sock_net(sk)->user_ns, 0);
	}
L
Linus Torvalds 已提交
2986 2987

	rwlock_init(&sk->sk_callback_lock);
2988 2989 2990 2991 2992 2993 2994 2995
	if (sk->sk_kern_sock)
		lockdep_set_class_and_name(
			&sk->sk_callback_lock,
			af_kern_callback_keys + sk->sk_family,
			af_family_kern_clock_key_strings[sk->sk_family]);
	else
		lockdep_set_class_and_name(
			&sk->sk_callback_lock,
2996 2997
			af_callback_keys + sk->sk_family,
			af_family_clock_key_strings[sk->sk_family]);
L
Linus Torvalds 已提交
2998 2999 3000 3001 3002 3003 3004

	sk->sk_state_change	=	sock_def_wakeup;
	sk->sk_data_ready	=	sock_def_readable;
	sk->sk_write_space	=	sock_def_write_space;
	sk->sk_error_report	=	sock_def_error_report;
	sk->sk_destruct		=	sock_def_destruct;

3005 3006
	sk->sk_frag.page	=	NULL;
	sk->sk_frag.offset	=	0;
3007
	sk->sk_peek_off		=	-1;
L
Linus Torvalds 已提交
3008

3009 3010
	sk->sk_peer_pid 	=	NULL;
	sk->sk_peer_cred	=	NULL;
L
Linus Torvalds 已提交
3011 3012 3013 3014 3015
	sk->sk_write_pending	=	0;
	sk->sk_rcvlowat		=	1;
	sk->sk_rcvtimeo		=	MAX_SCHEDULE_TIMEOUT;
	sk->sk_sndtimeo		=	MAX_SCHEDULE_TIMEOUT;

3016
	sk->sk_stamp = SK_DEFAULT_STAMP;
3017 3018 3019
#if BITS_PER_LONG==32
	seqlock_init(&sk->sk_stamp_seq);
#endif
W
Willem de Bruijn 已提交
3020
	atomic_set(&sk->sk_zckey, 0);
L
Linus Torvalds 已提交
3021

3022
#ifdef CONFIG_NET_RX_BUSY_POLL
E
Eliezer Tamir 已提交
3023
	sk->sk_napi_id		=	0;
3024
	sk->sk_ll_usec		=	sysctl_net_busy_read;
E
Eliezer Tamir 已提交
3025 3026
#endif

3027 3028
	sk->sk_max_pacing_rate = ~0UL;
	sk->sk_pacing_rate = ~0UL;
3029
	WRITE_ONCE(sk->sk_pacing_shift, 10);
3030
	sk->sk_incoming_cpu = -1;
3031 3032

	sk_rx_queue_clear(sk);
E
Eric Dumazet 已提交
3033 3034
	/*
	 * Before updating sk_refcnt, we must commit prior changes to memory
3035
	 * (Documentation/RCU/rculist_nulls.rst for details)
E
Eric Dumazet 已提交
3036 3037
	 */
	smp_wmb();
3038
	refcount_set(&sk->sk_refcnt, 1);
W
Wang Chen 已提交
3039
	atomic_set(&sk->sk_drops, 0);
L
Linus Torvalds 已提交
3040
}
E
Eric Dumazet 已提交
3041
EXPORT_SYMBOL(sock_init_data);
L
Linus Torvalds 已提交
3042

H
Harvey Harrison 已提交
3043
void lock_sock_nested(struct sock *sk, int subclass)
L
Linus Torvalds 已提交
3044 3045
{
	might_sleep();
I
Ingo Molnar 已提交
3046
	spin_lock_bh(&sk->sk_lock.slock);
3047
	if (sk->sk_lock.owned)
L
Linus Torvalds 已提交
3048
		__lock_sock(sk);
3049
	sk->sk_lock.owned = 1;
I
Ingo Molnar 已提交
3050 3051 3052 3053
	spin_unlock(&sk->sk_lock.slock);
	/*
	 * The sk_lock has mutex_lock() semantics here:
	 */
3054
	mutex_acquire(&sk->sk_lock.dep_map, subclass, 0, _RET_IP_);
I
Ingo Molnar 已提交
3055
	local_bh_enable();
L
Linus Torvalds 已提交
3056
}
3057
EXPORT_SYMBOL(lock_sock_nested);
L
Linus Torvalds 已提交
3058

H
Harvey Harrison 已提交
3059
void release_sock(struct sock *sk)
L
Linus Torvalds 已提交
3060
{
I
Ingo Molnar 已提交
3061
	spin_lock_bh(&sk->sk_lock.slock);
L
Linus Torvalds 已提交
3062 3063
	if (sk->sk_backlog.tail)
		__release_sock(sk);
E
Eric Dumazet 已提交
3064

3065 3066 3067
	/* Warning : release_cb() might need to release sk ownership,
	 * ie call sock_release_ownership(sk) before us.
	 */
E
Eric Dumazet 已提交
3068 3069 3070
	if (sk->sk_prot->release_cb)
		sk->sk_prot->release_cb(sk);

3071
	sock_release_ownership(sk);
I
Ingo Molnar 已提交
3072 3073 3074
	if (waitqueue_active(&sk->sk_lock.wq))
		wake_up(&sk->sk_lock.wq);
	spin_unlock_bh(&sk->sk_lock.slock);
L
Linus Torvalds 已提交
3075 3076 3077
}
EXPORT_SYMBOL(release_sock);

3078 3079 3080 3081 3082
/**
 * lock_sock_fast - fast version of lock_sock
 * @sk: socket
 *
 * This version should be used for very small section, where process wont block
3083 3084
 * return false if fast path is taken:
 *
3085
 *   sk_lock.slock locked, owned = 0, BH disabled
3086 3087 3088
 *
 * return true if slow path is taken:
 *
3089 3090
 *   sk_lock.slock unlocked, owned = 1, BH enabled
 */
3091
bool lock_sock_fast(struct sock *sk) __acquires(&sk->sk_lock.slock)
3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108
{
	might_sleep();
	spin_lock_bh(&sk->sk_lock.slock);

	if (!sk->sk_lock.owned)
		/*
		 * Note : We must disable BH
		 */
		return false;

	__lock_sock(sk);
	sk->sk_lock.owned = 1;
	spin_unlock(&sk->sk_lock.slock);
	/*
	 * The sk_lock has mutex_lock() semantics here:
	 */
	mutex_acquire(&sk->sk_lock.dep_map, 0, 0, _RET_IP_);
3109
	__acquire(&sk->sk_lock.slock);
3110 3111 3112 3113 3114
	local_bh_enable();
	return true;
}
EXPORT_SYMBOL(lock_sock_fast);

3115 3116
int sock_gettstamp(struct socket *sock, void __user *userstamp,
		   bool timeval, bool time32)
3117
{
3118 3119
	struct sock *sk = sock->sk;
	struct timespec64 ts;
3120 3121

	sock_enable_timestamp(sk, SOCK_TIMESTAMP);
3122 3123
	ts = ktime_to_timespec64(sock_read_timestamp(sk));
	if (ts.tv_sec == -1)
L
Linus Torvalds 已提交
3124
		return -ENOENT;
3125
	if (ts.tv_sec == 0) {
3126
		ktime_t kt = ktime_get_real();
Y
YueHaibing 已提交
3127
		sock_write_timestamp(sk, kt);
3128
		ts = ktime_to_timespec64(kt);
3129
	}
L
Linus Torvalds 已提交
3130

3131 3132
	if (timeval)
		ts.tv_nsec /= 1000;
3133

3134 3135 3136 3137 3138 3139 3140 3141
#ifdef CONFIG_COMPAT_32BIT_TIME
	if (time32)
		return put_old_timespec32(&ts, userstamp);
#endif
#ifdef CONFIG_SPARC64
	/* beware of padding in sparc64 timeval */
	if (timeval && !in_compat_syscall()) {
		struct __kernel_old_timeval __user tv = {
3142 3143
			.tv_sec = ts.tv_sec,
			.tv_usec = ts.tv_nsec,
3144
		};
3145
		if (copy_to_user(userstamp, &tv, sizeof(tv)))
3146 3147
			return -EFAULT;
		return 0;
3148
	}
3149 3150
#endif
	return put_timespec64(&ts, userstamp);
3151
}
3152
EXPORT_SYMBOL(sock_gettstamp);
3153

A
Alexey Dobriyan 已提交
3154
void sock_enable_timestamp(struct sock *sk, enum sock_flags flag)
3155
{
3156
	if (!sock_flag(sk, flag)) {
E
Eric Dumazet 已提交
3157 3158
		unsigned long previous_flags = sk->sk_flags;

3159 3160 3161 3162 3163 3164
		sock_set_flag(sk, flag);
		/*
		 * we just set one of the two flags which require net
		 * time stamping, but time stamping might have been on
		 * already because of the other one
		 */
3165 3166
		if (sock_needs_netstamp(sk) &&
		    !(previous_flags & SK_FLAGS_TIMESTAMP))
3167
			net_enable_timestamp();
L
Linus Torvalds 已提交
3168 3169 3170
	}
}

3171 3172 3173 3174
int sock_recv_errqueue(struct sock *sk, struct msghdr *msg, int len,
		       int level, int type)
{
	struct sock_exterr_skb *serr;
3175
	struct sk_buff *skb;
3176 3177 3178
	int copied, err;

	err = -EAGAIN;
3179
	skb = sock_dequeue_err_skb(sk);
3180 3181 3182 3183 3184 3185 3186 3187
	if (skb == NULL)
		goto out;

	copied = skb->len;
	if (copied > len) {
		msg->msg_flags |= MSG_TRUNC;
		copied = len;
	}
3188
	err = skb_copy_datagram_msg(skb, 0, msg, copied);
3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206
	if (err)
		goto out_free_skb;

	sock_recv_timestamp(msg, sk, skb);

	serr = SKB_EXT_ERR(skb);
	put_cmsg(msg, level, type, sizeof(serr->ee), &serr->ee);

	msg->msg_flags |= MSG_ERRQUEUE;
	err = copied;

out_free_skb:
	kfree_skb(skb);
out:
	return err;
}
EXPORT_SYMBOL(sock_recv_errqueue);

L
Linus Torvalds 已提交
3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222
/*
 *	Get a socket option on an socket.
 *
 *	FIX: POSIX 1003.1g is very ambiguous here. It states that
 *	asynchronous errors should be reported by getsockopt. We assume
 *	this means if you specify SO_ERROR (otherwise whats the point of it).
 */
int sock_common_getsockopt(struct socket *sock, int level, int optname,
			   char __user *optval, int __user *optlen)
{
	struct sock *sk = sock->sk;

	return sk->sk_prot->getsockopt(sk, level, optname, optval, optlen);
}
EXPORT_SYMBOL(sock_common_getsockopt);

3223 3224
int sock_common_recvmsg(struct socket *sock, struct msghdr *msg, size_t size,
			int flags)
L
Linus Torvalds 已提交
3225 3226 3227 3228 3229
{
	struct sock *sk = sock->sk;
	int addr_len = 0;
	int err;

3230
	err = sk->sk_prot->recvmsg(sk, msg, size, flags & MSG_DONTWAIT,
L
Linus Torvalds 已提交
3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241
				   flags & ~MSG_DONTWAIT, &addr_len);
	if (err >= 0)
		msg->msg_namelen = addr_len;
	return err;
}
EXPORT_SYMBOL(sock_common_recvmsg);

/*
 *	Set socket options on an inet socket.
 */
int sock_common_setsockopt(struct socket *sock, int level, int optname,
3242
			   sockptr_t optval, unsigned int optlen)
L
Linus Torvalds 已提交
3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255
{
	struct sock *sk = sock->sk;

	return sk->sk_prot->setsockopt(sk, level, optname, optval, optlen);
}
EXPORT_SYMBOL(sock_common_setsockopt);

void sk_common_release(struct sock *sk)
{
	if (sk->sk_prot->destroy)
		sk->sk_prot->destroy(sk);

	/*
M
Miaohe Lin 已提交
3256
	 * Observation: when sk_common_release is called, processes have
L
Linus Torvalds 已提交
3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280
	 * no access to socket. But net still has.
	 * Step one, detach it from networking:
	 *
	 * A. Remove from hash tables.
	 */

	sk->sk_prot->unhash(sk);

	/*
	 * In this point socket cannot receive new packets, but it is possible
	 * that some packets are in flight because some CPU runs receiver and
	 * did hash table lookup before we unhashed socket. They will achieve
	 * receive queue and will be purged by socket destructor.
	 *
	 * Also we still have packets pending on receive queue and probably,
	 * our own packets waiting in device queues. sock_destroy will drain
	 * receive queue, but transmitted packets will delay socket destruction
	 * until the last reference will be released.
	 */

	sock_orphan(sk);

	xfrm_sk_free_policy(sk);

3281
	sk_refcnt_debug_release(sk);
3282

L
Linus Torvalds 已提交
3283 3284 3285 3286
	sock_put(sk);
}
EXPORT_SYMBOL(sk_common_release);

3287 3288 3289 3290 3291
void sk_get_meminfo(const struct sock *sk, u32 *mem)
{
	memset(mem, 0, sizeof(*mem) * SK_MEMINFO_VARS);

	mem[SK_MEMINFO_RMEM_ALLOC] = sk_rmem_alloc_get(sk);
3292
	mem[SK_MEMINFO_RCVBUF] = READ_ONCE(sk->sk_rcvbuf);
3293
	mem[SK_MEMINFO_WMEM_ALLOC] = sk_wmem_alloc_get(sk);
3294
	mem[SK_MEMINFO_SNDBUF] = READ_ONCE(sk->sk_sndbuf);
3295
	mem[SK_MEMINFO_FWD_ALLOC] = sk->sk_forward_alloc;
3296
	mem[SK_MEMINFO_WMEM_QUEUED] = READ_ONCE(sk->sk_wmem_queued);
3297
	mem[SK_MEMINFO_OPTMEM] = atomic_read(&sk->sk_omem_alloc);
3298
	mem[SK_MEMINFO_BACKLOG] = READ_ONCE(sk->sk_backlog.len);
3299 3300 3301
	mem[SK_MEMINFO_DROPS] = atomic_read(&sk->sk_drops);
}

3302 3303
#ifdef CONFIG_PROC_FS
#define PROTO_INUSE_NR	64	/* should be enough for the first time */
3304 3305 3306
struct prot_inuse {
	int val[PROTO_INUSE_NR];
};
3307 3308

static DECLARE_BITMAP(proto_inuse_idx, PROTO_INUSE_NR);
3309 3310 3311

void sock_prot_inuse_add(struct net *net, struct proto *prot, int val)
{
3312
	__this_cpu_add(net->core.prot_inuse->val[prot->inuse_idx], val);
3313 3314 3315 3316 3317 3318 3319 3320 3321
}
EXPORT_SYMBOL_GPL(sock_prot_inuse_add);

int sock_prot_inuse_get(struct net *net, struct proto *prot)
{
	int cpu, idx = prot->inuse_idx;
	int res = 0;

	for_each_possible_cpu(cpu)
3322
		res += per_cpu_ptr(net->core.prot_inuse, cpu)->val[idx];
3323 3324 3325 3326 3327

	return res >= 0 ? res : 0;
}
EXPORT_SYMBOL_GPL(sock_prot_inuse_get);

3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344
static void sock_inuse_add(struct net *net, int val)
{
	this_cpu_add(*net->core.sock_inuse, val);
}

int sock_inuse_get(struct net *net)
{
	int cpu, res = 0;

	for_each_possible_cpu(cpu)
		res += *per_cpu_ptr(net->core.sock_inuse, cpu);

	return res;
}

EXPORT_SYMBOL_GPL(sock_inuse_get);

3345
static int __net_init sock_inuse_init_net(struct net *net)
3346
{
3347
	net->core.prot_inuse = alloc_percpu(struct prot_inuse);
3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359
	if (net->core.prot_inuse == NULL)
		return -ENOMEM;

	net->core.sock_inuse = alloc_percpu(int);
	if (net->core.sock_inuse == NULL)
		goto out;

	return 0;

out:
	free_percpu(net->core.prot_inuse);
	return -ENOMEM;
3360 3361
}

3362
static void __net_exit sock_inuse_exit_net(struct net *net)
3363
{
3364
	free_percpu(net->core.prot_inuse);
3365
	free_percpu(net->core.sock_inuse);
3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381
}

static struct pernet_operations net_inuse_ops = {
	.init = sock_inuse_init_net,
	.exit = sock_inuse_exit_net,
};

static __init int net_inuse_init(void)
{
	if (register_pernet_subsys(&net_inuse_ops))
		panic("Cannot initialize net inuse counters");

	return 0;
}

core_initcall(net_inuse_init);
3382

3383
static int assign_proto_idx(struct proto *prot)
3384 3385 3386 3387
{
	prot->inuse_idx = find_first_zero_bit(proto_inuse_idx, PROTO_INUSE_NR);

	if (unlikely(prot->inuse_idx == PROTO_INUSE_NR - 1)) {
J
Joe Perches 已提交
3388
		pr_err("PROTO_INUSE_NR exhausted\n");
3389
		return -ENOSPC;
3390 3391 3392
	}

	set_bit(prot->inuse_idx, proto_inuse_idx);
3393
	return 0;
3394 3395 3396 3397 3398 3399 3400 3401
}

static void release_proto_idx(struct proto *prot)
{
	if (prot->inuse_idx != PROTO_INUSE_NR - 1)
		clear_bit(prot->inuse_idx, proto_inuse_idx);
}
#else
3402
static inline int assign_proto_idx(struct proto *prot)
3403
{
3404
	return 0;
3405 3406 3407 3408 3409
}

static inline void release_proto_idx(struct proto *prot)
{
}
3410 3411 3412 3413

static void sock_inuse_add(struct net *net, int val)
{
}
3414 3415
#endif

3416 3417 3418 3419 3420 3421 3422 3423 3424 3425
static void tw_prot_cleanup(struct timewait_sock_ops *twsk_prot)
{
	if (!twsk_prot)
		return;
	kfree(twsk_prot->twsk_slab_name);
	twsk_prot->twsk_slab_name = NULL;
	kmem_cache_destroy(twsk_prot->twsk_slab);
	twsk_prot->twsk_slab = NULL;
}

3426 3427 3428 3429 3430 3431
static void req_prot_cleanup(struct request_sock_ops *rsk_prot)
{
	if (!rsk_prot)
		return;
	kfree(rsk_prot->slab_name);
	rsk_prot->slab_name = NULL;
3432 3433
	kmem_cache_destroy(rsk_prot->slab);
	rsk_prot->slab = NULL;
3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449
}

static int req_prot_init(const struct proto *prot)
{
	struct request_sock_ops *rsk_prot = prot->rsk_prot;

	if (!rsk_prot)
		return 0;

	rsk_prot->slab_name = kasprintf(GFP_KERNEL, "request_sock_%s",
					prot->name);
	if (!rsk_prot->slab_name)
		return -ENOMEM;

	rsk_prot->slab = kmem_cache_create(rsk_prot->slab_name,
					   rsk_prot->obj_size, 0,
3450 3451
					   SLAB_ACCOUNT | prot->slab_flags,
					   NULL);
3452 3453 3454 3455 3456 3457 3458 3459 3460

	if (!rsk_prot->slab) {
		pr_crit("%s: Can't create request sock SLAB cache!\n",
			prot->name);
		return -ENOMEM;
	}
	return 0;
}

3461 3462
int proto_register(struct proto *prot, int alloc_slab)
{
3463 3464
	int ret = -ENOBUFS;

L
Linus Torvalds 已提交
3465
	if (alloc_slab) {
3466 3467
		prot->slab = kmem_cache_create_usercopy(prot->name,
					prot->obj_size, 0,
3468 3469
					SLAB_HWCACHE_ALIGN | SLAB_ACCOUNT |
					prot->slab_flags,
3470
					prot->useroffset, prot->usersize,
3471
					NULL);
L
Linus Torvalds 已提交
3472 3473

		if (prot->slab == NULL) {
J
Joe Perches 已提交
3474 3475
			pr_crit("%s: Can't create sock SLAB cache!\n",
				prot->name);
3476
			goto out;
L
Linus Torvalds 已提交
3477
		}
3478

3479 3480
		if (req_prot_init(prot))
			goto out_free_request_sock_slab;
3481

3482
		if (prot->twsk_prot != NULL) {
3483
			prot->twsk_prot->twsk_slab_name = kasprintf(GFP_KERNEL, "tw_sock_%s", prot->name);
3484

3485
			if (prot->twsk_prot->twsk_slab_name == NULL)
3486 3487
				goto out_free_request_sock_slab;

3488
			prot->twsk_prot->twsk_slab =
3489
				kmem_cache_create(prot->twsk_prot->twsk_slab_name,
3490
						  prot->twsk_prot->twsk_obj_size,
3491
						  0,
3492
						  SLAB_ACCOUNT |
3493
						  prot->slab_flags,
3494
						  NULL);
3495
			if (prot->twsk_prot->twsk_slab == NULL)
3496
				goto out_free_timewait_sock_slab;
3497
		}
L
Linus Torvalds 已提交
3498 3499
	}

3500
	mutex_lock(&proto_list_mutex);
3501 3502 3503
	ret = assign_proto_idx(prot);
	if (ret) {
		mutex_unlock(&proto_list_mutex);
3504
		goto out_free_timewait_sock_slab;
3505
	}
L
Linus Torvalds 已提交
3506
	list_add(&prot->node, &proto_list);
3507
	mutex_unlock(&proto_list_mutex);
3508
	return ret;
3509

3510
out_free_timewait_sock_slab:
3511
	if (alloc_slab && prot->twsk_prot)
3512
		tw_prot_cleanup(prot->twsk_prot);
3513
out_free_request_sock_slab:
3514 3515
	if (alloc_slab) {
		req_prot_cleanup(prot->rsk_prot);
3516

3517 3518 3519
		kmem_cache_destroy(prot->slab);
		prot->slab = NULL;
	}
3520
out:
3521
	return ret;
L
Linus Torvalds 已提交
3522 3523 3524 3525 3526
}
EXPORT_SYMBOL(proto_register);

void proto_unregister(struct proto *prot)
{
3527
	mutex_lock(&proto_list_mutex);
3528
	release_proto_idx(prot);
3529
	list_del(&prot->node);
3530
	mutex_unlock(&proto_list_mutex);
L
Linus Torvalds 已提交
3531

3532 3533
	kmem_cache_destroy(prot->slab);
	prot->slab = NULL;
L
Linus Torvalds 已提交
3534

3535
	req_prot_cleanup(prot->rsk_prot);
3536
	tw_prot_cleanup(prot->twsk_prot);
L
Linus Torvalds 已提交
3537 3538 3539
}
EXPORT_SYMBOL(proto_unregister);

3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551
int sock_load_diag_module(int family, int protocol)
{
	if (!protocol) {
		if (!sock_is_registered(family))
			return -ENOENT;

		return request_module("net-pf-%d-proto-%d-type-%d", PF_NETLINK,
				      NETLINK_SOCK_DIAG, family);
	}

#ifdef CONFIG_INET
	if (family == AF_INET &&
3552
	    protocol != IPPROTO_RAW &&
3553
	    protocol < MAX_INET_PROTOS &&
3554 3555 3556 3557 3558 3559 3560 3561 3562
	    !rcu_access_pointer(inet_protos[protocol]))
		return -ENOENT;
#endif

	return request_module("net-pf-%d-proto-%d-type-%d-%d", PF_NETLINK,
			      NETLINK_SOCK_DIAG, family, protocol);
}
EXPORT_SYMBOL(sock_load_diag_module);

L
Linus Torvalds 已提交
3563 3564
#ifdef CONFIG_PROC_FS
static void *proto_seq_start(struct seq_file *seq, loff_t *pos)
3565
	__acquires(proto_list_mutex)
L
Linus Torvalds 已提交
3566
{
3567
	mutex_lock(&proto_list_mutex);
3568
	return seq_list_start_head(&proto_list, *pos);
L
Linus Torvalds 已提交
3569 3570 3571 3572
}

static void *proto_seq_next(struct seq_file *seq, void *v, loff_t *pos)
{
3573
	return seq_list_next(v, &proto_list, pos);
L
Linus Torvalds 已提交
3574 3575 3576
}

static void proto_seq_stop(struct seq_file *seq, void *v)
3577
	__releases(proto_list_mutex)
L
Linus Torvalds 已提交
3578
{
3579
	mutex_unlock(&proto_list_mutex);
L
Linus Torvalds 已提交
3580 3581 3582 3583 3584 3585
}

static char proto_method_implemented(const void *method)
{
	return method == NULL ? 'n' : 'y';
}
3586 3587
static long sock_prot_memory_allocated(struct proto *proto)
{
3588
	return proto->memory_allocated != NULL ? proto_memory_allocated(proto) : -1L;
3589 3590
}

3591
static const char *sock_prot_memory_pressure(struct proto *proto)
3592 3593 3594 3595
{
	return proto->memory_pressure != NULL ?
	proto_memory_pressure(proto) ? "yes" : "no" : "NI";
}
L
Linus Torvalds 已提交
3596 3597 3598

static void proto_seq_printf(struct seq_file *seq, struct proto *proto)
{
3599

E
Eric Dumazet 已提交
3600
	seq_printf(seq, "%-9s %4u %6d  %6ld   %-3s %6u   %-3s  %-10s "
L
Linus Torvalds 已提交
3601 3602 3603
			"%2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c\n",
		   proto->name,
		   proto->obj_size,
3604
		   sock_prot_inuse_get(seq_file_net(seq), proto),
3605 3606
		   sock_prot_memory_allocated(proto),
		   sock_prot_memory_pressure(proto),
L
Linus Torvalds 已提交
3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632
		   proto->max_header,
		   proto->slab == NULL ? "no" : "yes",
		   module_name(proto->owner),
		   proto_method_implemented(proto->close),
		   proto_method_implemented(proto->connect),
		   proto_method_implemented(proto->disconnect),
		   proto_method_implemented(proto->accept),
		   proto_method_implemented(proto->ioctl),
		   proto_method_implemented(proto->init),
		   proto_method_implemented(proto->destroy),
		   proto_method_implemented(proto->shutdown),
		   proto_method_implemented(proto->setsockopt),
		   proto_method_implemented(proto->getsockopt),
		   proto_method_implemented(proto->sendmsg),
		   proto_method_implemented(proto->recvmsg),
		   proto_method_implemented(proto->sendpage),
		   proto_method_implemented(proto->bind),
		   proto_method_implemented(proto->backlog_rcv),
		   proto_method_implemented(proto->hash),
		   proto_method_implemented(proto->unhash),
		   proto_method_implemented(proto->get_port),
		   proto_method_implemented(proto->enter_memory_pressure));
}

static int proto_seq_show(struct seq_file *seq, void *v)
{
3633
	if (v == &proto_list)
L
Linus Torvalds 已提交
3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644
		seq_printf(seq, "%-9s %-4s %-8s %-6s %-5s %-7s %-4s %-10s %s",
			   "protocol",
			   "size",
			   "sockets",
			   "memory",
			   "press",
			   "maxhdr",
			   "slab",
			   "module",
			   "cl co di ac io in de sh ss gs se re sp bi br ha uh gp em\n");
	else
3645
		proto_seq_printf(seq, list_entry(v, struct proto, node));
L
Linus Torvalds 已提交
3646 3647 3648
	return 0;
}

3649
static const struct seq_operations proto_seq_ops = {
L
Linus Torvalds 已提交
3650 3651 3652 3653 3654 3655
	.start  = proto_seq_start,
	.next   = proto_seq_next,
	.stop   = proto_seq_stop,
	.show   = proto_seq_show,
};

3656 3657
static __net_init int proto_init_net(struct net *net)
{
3658 3659
	if (!proc_create_net("protocols", 0444, net->proc_net, &proto_seq_ops,
			sizeof(struct seq_net_private)))
3660 3661 3662 3663 3664 3665 3666
		return -ENOMEM;

	return 0;
}

static __net_exit void proto_exit_net(struct net *net)
{
3667
	remove_proc_entry("protocols", net->proc_net);
3668 3669 3670 3671 3672 3673
}


static __net_initdata struct pernet_operations proto_net_ops = {
	.init = proto_init_net,
	.exit = proto_exit_net,
L
Linus Torvalds 已提交
3674 3675 3676 3677
};

static int __init proto_init(void)
{
3678
	return register_pernet_subsys(&proto_net_ops);
L
Linus Torvalds 已提交
3679 3680 3681 3682 3683
}

subsys_initcall(proto_init);

#endif /* PROC_FS */
3684 3685 3686 3687 3688 3689

#ifdef CONFIG_NET_RX_BUSY_POLL
bool sk_busy_loop_end(void *p, unsigned long start_time)
{
	struct sock *sk = p;

3690
	return !skb_queue_empty_lockless(&sk->sk_receive_queue) ||
3691 3692 3693 3694
	       sk_busy_loop_timeout(sk, start_time);
}
EXPORT_SYMBOL(sk_busy_loop_end);
#endif /* CONFIG_NET_RX_BUSY_POLL */
3695 3696 3697 3698 3699 3700 3701 3702

int sock_bind_add(struct sock *sk, struct sockaddr *addr, int addr_len)
{
	if (!sk->sk_prot->bind_add)
		return -EOPNOTSUPP;
	return sk->sk_prot->bind_add(sk, addr, addr_len);
}
EXPORT_SYMBOL(sock_bind_add);