/* * NET		An implementation of the SOCKET network access protocol. * * Version:	@(#)socket.c	1.1.93	18/02/95 * * Authors:	Orest Zborowski, <obz@Kodak.COM> *		Ross Biro *		Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG> * * Fixes: *		Anonymous	:	NOTSOCK/BADF cleanup. Error fix in *					shutdown() *		Alan Cox	:	verify_area() fixes *		Alan Cox	:	Removed DDI *		Jonathan Kamens	:	SOCK_DGRAM reconnect bug *		Alan Cox	:	Moved a load of checks to the very *					top level. *		Alan Cox	:	Move address structures to/from user *					mode above the protocol layers. *		Rob Janssen	:	Allow 0 length sends. *		Alan Cox	:	Asynchronous I/O support (cribbed from the *					tty drivers). *		Niibe Yutaka	:	Asynchronous I/O for writes (4.4BSD style) *		Jeff Uphoff	:	Made max number of sockets command-line *					configurable. *		Matti Aarnio	:	Made the number of sockets dynamic, *					to be allocated when needed, and mr. *					Uphoff's max is used as max to be *					allowed to allocate. *		Linus		:	Argh. removed all the socket allocation *					altogether: it's in the inode now. *		Alan Cox	:	Made sock_alloc()/sock_release() public *					for NetROM and future kernel nfsd type *					stuff. *		Alan Cox	:	sendmsg/recvmsg basics. *		Tom Dyas	:	Export net symbols. *		Marcin Dalecki	:	Fixed problems with CONFIG_NET="n". *		Alan Cox	:	Added thread locking to sys_* calls *					for sockets. May have errors at the *					moment. *		Kevin Buhr	:	Fixed the dumb errors in the above. *		Andi Kleen	:	Some small cleanups, optimizations, *					and fixed a copy_from_user() bug. *		Tigran Aivazian	:	sys_send(args) calls sys_sendto(args, NULL, 0) *		Tigran Aivazian	:	Made listen(2) backlog sanity checks *					protocol-independent * * *		This program is free software; you can redistribute it and/or *		modify it under the terms of the GNU General Public License *		as published by the Free Software Foundation; either version *		2 of the License, or (at your option) any later version. * * *	This module is effectively the top level interface to the BSD socket *	paradigm. * *	Based upon Swansea University Computer Society NET3.039 */ #include <linux/mm.h>#include <linux/socket.h>#include <linux/file.h>#include <linux/net.h>#include <linux/interrupt.h>#include <linux/thread_info.h>#include <linux/rcupdate.h>#include <linux/netdevice.h>#include <linux/proc_fs.h>#include <linux/seq_file.h>#include <linux/mutex.h>#include <linux/if_bridge.h>#include <linux/if_frad.h>#include <linux/if_vlan.h>#include <linux/ptp_classify.h>#include <linux/init.h>#include <linux/poll.h>#include <linux/cache.h>#include <linux/module.h>#include <linux/highmem.h>#include <linux/mount.h>#include <linux/security.h>#include <linux/syscalls.h>#include <linux/compat.h>#include <linux/kmod.h>#include <linux/audit.h>#include <linux/wireless.h>#include <linux/nsproxy.h>#include <linux/magic.h>#include <linux/slab.h>#include <linux/xattr.h> #include <asm/uaccess.h>#include <asm/unistd.h> #include <net/compat.h>#include <net/wext.h>#include <net/cls_cgroup.h> #include <net/sock.h>#include <linux/netfilter.h> #include <linux/if_tun.h>#include <linux/ipv6_route.h>#include <linux/route.h>#include <linux/sockios.h>#include <linux/atalk.h>#include <net/busy_poll.h>#include <linux/errqueue.h> #ifdef CONFIG_NET_RX_BUSY_POLLunsigned int sysctl_net_busy_read __read_mostly;unsigned int sysctl_net_busy_poll __read_mostly;#endif static ssize_t sock_read_iter(struct kiocb *iocb, struct iov_iter *to);static ssize_t sock_write_iter(struct kiocb *iocb, struct iov_iter *from);static int sock_mmap(struct file *file, struct vm_area_struct *vma); static int sock_close(struct inode *inode, struct file *file);static unsigned int sock_poll(struct file *file,			      struct poll_table_struct *wait);static long sock_ioctl(struct file *file, unsigned int cmd, unsigned long arg);#ifdef CONFIG_COMPATstatic long compat_sock_ioctl(struct file *file,			      unsigned int cmd, unsigned long arg);#endifstatic int sock_fasync(int fd, struct file *filp, int on);static ssize_t sock_sendpage(struct file *file, struct page *page,			     int offset, size_t size, loff_t *ppos, int more);static ssize_t sock_splice_read(struct file *file, loff_t *ppos,				struct pipe_inode_info *pipe, size_t len,				unsigned int flags); /* *	Socket files have a set of 'special' operations as well as the generic file ones. These don't appear *	in the operation structures but are done directly via the socketcall() multiplexor. */ static const struct file_operations socket_file_ops = {	.owner =	THIS_MODULE,	.llseek =	no_llseek,	.read_iter =	sock_read_iter,	.write_iter =	sock_write_iter,	.poll =		sock_poll,	.unlocked_ioctl = sock_ioctl,#ifdef CONFIG_COMPAT	.compat_ioctl = compat_sock_ioctl,#endif	.mmap =		sock_mmap,	.release =	sock_close,	.fasync =	sock_fasync,	.sendpage =	sock_sendpage,	.splice_write = generic_splice_sendpage,	.splice_read =	sock_splice_read,}; /* *	The protocol list. Each protocol is registered in here. */ static DEFINE_SPINLOCK(net_family_lock);static const struct net_proto_family __rcu *net_families[NPROTO] __read_mostly; /* *	Statistics counters of the socket lists */ static DEFINE_PER_CPU(int, sockets_in_use); /* * Support routines. * Move socket addresses back and forth across the kernel/user * divide and look after the messy bits. */ /** *	move_addr_to_kernel	-	copy a socket address into kernel space *	@uaddr: Address in user space *	@kaddr: Address in kernel space *	@ulen: Length in user space * *	The address is copied into kernel space. If the provided address is *	too long an error code of -EINVAL is returned. If the copy gives *	invalid addresses -EFAULT is returned. On a success 0 is returned. */ int move_addr_to_kernel(void __user *uaddr, int ulen, struct sockaddr_storage *kaddr){	if (ulen < 0 || ulen > sizeof(struct sockaddr_storage))		return -EINVAL;	if (ulen == 0)		return 0;	if (copy_from_user(kaddr, uaddr, ulen))		return -EFAULT;	return audit_sockaddr(ulen, kaddr);} /** *	move_addr_to_user	-	copy an address to user space *	@kaddr: kernel space address *	@klen: length of address in kernel *	@uaddr: user space address *	@ulen: pointer to user length field * *	The value pointed to by ulen on entry is the buffer length available. *	This is overwritten with the buffer space used. -EINVAL is returned *	if an overlong buffer is specified or a negative buffer size. -EFAULT *	is returned if either the buffer or the length field are not *	accessible. *	After copying the data up to the limit the user specifies, the true *	length of the data is written over the length limit the user *	specified. Zero is returned for a success. */ static int move_addr_to_user(struct sockaddr_storage *kaddr, int klen,			     void __user *uaddr, int __user *ulen){	int err;	int len; 	BUG_ON(klen > sizeof(struct sockaddr_storage));	err = get_user(len, ulen);	if (err)		return err;	if (len > klen)		len = klen;	if (len < 0)		return -EINVAL;	if (len) {		if (audit_sockaddr(klen, kaddr))			return -ENOMEM;		if (copy_to_user(uaddr, kaddr, len))			return -EFAULT;	}	/*	 *      "fromlen shall refer to the value before truncation.."	 *                      1003.1g	 */	return __put_user(klen, ulen);} static struct kmem_cache *sock_inode_cachep __read_mostly; static struct inode *sock_alloc_inode(struct super_block *sb){	struct socket_alloc *ei;	struct socket_wq *wq; 	ei = kmem_cache_alloc(sock_inode_cachep, GFP_KERNEL);	if (!ei)		return NULL;	wq = kmalloc(sizeof(*wq), GFP_KERNEL);	if (!wq) {		kmem_cache_free(sock_inode_cachep, ei);		return NULL;	}	init_waitqueue_head(&wq->wait);	wq->fasync_list = NULL;	wq->flags = 0;	RCU_INIT_POINTER(ei->socket.wq, wq); 	ei->socket.state = SS_UNCONNECTED;	ei->socket.flags = 0;	ei->socket.ops = NULL;	ei->socket.sk = NULL;	ei->socket.file = NULL; 	return &ei->vfs_inode;} static void sock_destroy_inode(struct inode *inode){	struct socket_alloc *ei;	struct socket_wq *wq; 	ei = container_of(inode, struct socket_alloc, vfs_inode);	wq = rcu_dereference_protected(ei->socket.wq, 1);	kfree_rcu(wq, rcu);	kmem_cache_free(sock_inode_cachep, ei);} static void init_once(void *foo){	struct socket_alloc *ei = (struct socket_alloc *)foo; 	inode_init_once(&ei->vfs_inode);} static int init_inodecache(void){	sock_inode_cachep = kmem_cache_create("sock_inode_cache",					      sizeof(struct socket_alloc),					      0,					      (SLAB_HWCACHE_ALIGN |					       SLAB_RECLAIM_ACCOUNT |					       SLAB_MEM_SPREAD),					      init_once);	if (sock_inode_cachep == NULL)		return -ENOMEM;	return 0;} static const struct super_operations sockfs_ops = {	.alloc_inode	= sock_alloc_inode,	.destroy_inode	= sock_destroy_inode,	.statfs		= simple_statfs,}; /* * sockfs_dname() is called from d_path(). */static char *sockfs_dname(struct dentry *dentry, char *buffer, int buflen){	return dynamic_dname(dentry, buffer, buflen, "socket:[%lu]",				d_inode(dentry)->i_ino);} static const struct dentry_operations sockfs_dentry_operations = {	.d_dname  = sockfs_dname,}; static struct dentry *sockfs_mount(struct file_system_type *fs_type,			 int flags, const char *dev_name, void *data){	return mount_pseudo(fs_type, "socket:", &sockfs_ops,		&sockfs_dentry_operations, SOCKFS_MAGIC);} static struct vfsmount *sock_mnt __read_mostly; static struct file_system_type sock_fs_type = {	.name =		"sockfs",	.mount =	sockfs_mount,	.kill_sb =	kill_anon_super,}; /* *	Obtains the first available file descriptor and sets it up for use. * *	These functions create file structures and maps them to fd space *	of the current process. On success it returns file descriptor *	and file struct implicitly stored in sock->file. *	Note that another thread may close file descriptor before we return *	from this function. We use the fact that now we do not refer *	to socket after mapping. If one day we will need it, this *	function will increment ref. count on file by 1. * *	In any case returned fd MAY BE not valid! *	This race condition is unavoidable *	with shared fd spaces, we cannot solve it inside kernel, *	but we take care of internal coherence yet. */ struct file *sock_alloc_file(struct socket *sock, int flags, const char *dname){	struct qstr name = { .name = "" };	struct path path;	struct file *file; 	if (dname) {		name.name = dname;		name.len = strlen(name.name);	} else if (sock->sk) {		name.name = sock->sk->sk_prot_creator->name;		name.len = strlen(name.name);	}	path.dentry = d_alloc_pseudo(sock_mnt->mnt_sb, &name);	if (unlikely(!path.dentry))		return ERR_PTR(-ENOMEM);	path.mnt = mntget(sock_mnt); 	d_instantiate(path.dentry, SOCK_INODE(sock)); 	file = alloc_file(&path, FMODE_READ | FMODE_WRITE,		  &socket_file_ops);	if (IS_ERR(file)) {		/* drop dentry, keep inode */		ihold(d_inode(path.dentry));		path_put(&path);		return file;	} 	sock->file = file;	file->f_flags = O_RDWR | (flags & O_NONBLOCK);	file->private_data = sock;	return file;}EXPORT_SYMBOL(sock_alloc_file); static int sock_map_fd(struct socket *sock, int flags){	struct file *newfile;	int fd = get_unused_fd_flags(flags);	if (unlikely(fd < 0))		return fd; 	newfile = sock_alloc_file(sock, flags, NULL);	if (likely(!IS_ERR(newfile))) {		fd_install(fd, newfile);		return fd;	} 	put_unused_fd(fd);	return PTR_ERR(newfile);} struct socket *sock_from_file(struct file *file, int *err){	if (file->f_op == &socket_file_ops)		return file->private_data;	/* set in sock_map_fd */ 	*err = -ENOTSOCK;	return NULL;}EXPORT_SYMBOL(sock_from_file); /** *	sockfd_lookup - Go from a file number to its socket slot *	@fd: file handle *	@err: pointer to an error code return * *	The file handle passed in is locked and the socket it is bound *	too is returned. If an error occurs the err pointer is overwritten *	with a negative errno code and NULL is returned. The function checks *	for both invalid handles and passing a handle which is not a socket. * *	On a success the socket object pointer is returned. */ struct socket *sockfd_lookup(int fd, int *err){	struct file *file;	struct socket *sock; 	file = fget(fd);	if (!file) {		*err = -EBADF;		return NULL;	} 	sock = sock_from_file(file, err);	if (!sock)		fput(file);	return sock;}EXPORT_SYMBOL(sockfd_lookup); static struct socket *sockfd_lookup_light(int fd, int *err, int *fput_needed){	struct fd f = fdget(fd);	struct socket *sock; 	*err = -EBADF;	if (f.file) {		sock = sock_from_file(f.file, err);		if (likely(sock)) {			*fput_needed = f.flags;			return sock;		}		fdput(f);	}	return NULL;} #define XATTR_SOCKPROTONAME_SUFFIX "sockprotoname"#define XATTR_NAME_SOCKPROTONAME (XATTR_SYSTEM_PREFIX XATTR_SOCKPROTONAME_SUFFIX)#define XATTR_NAME_SOCKPROTONAME_LEN (sizeof(XATTR_NAME_SOCKPROTONAME)-1)static ssize_t sockfs_getxattr(struct dentry *dentry,			       const char *name, void *value, size_t size){	const char *proto_name;	size_t proto_size;	int error; 	error = -ENODATA;	if (!strncmp(name, XATTR_NAME_SOCKPROTONAME, XATTR_NAME_SOCKPROTONAME_LEN)) {		proto_name = dentry->d_name.name;		proto_size = strlen(proto_name); 		if (value) {			error = -ERANGE;			if (proto_size + 1 > size)				goto out; 			strncpy(value, proto_name, proto_size + 1);		}		error = proto_size + 1;	} out:	return error;} static ssize_t sockfs_listxattr(struct dentry *dentry, char *buffer,				size_t size){	ssize_t len;	ssize_t used = 0; 

Lines 1–500 of 3296. Load more