personality) == PER_OSF4))\n\t\tif (osf_fix_iov_len(vector, count))\n\t\t\treturn -EFAULT;\n\treturn sys_readv(fd, vector, count);\n}","SYSCALL_DEFINE3(osf_writev, unsigned long, fd,\n\t\tconst struct iovec __user *, vector, unsigned long, count)\n{\n\tif (unlikely(personality(current->personality) == PER_OSF4))\n\t\tif (osf_fix_iov_len(vector, count))\n\t\t\treturn -EFAULT;\n\treturn sys_writev(fd, vector, count);\n}","#endif"],"string":"[\n \"/*\\n * linux/arch/alpha/kernel/osf_sys.c\\n *\\n * Copyright (C) 1995 Linus Torvalds\\n */\",\n \"/*\\n * This file handles some of the stranger OSF/1 system call interfaces.\\n * Some of the system calls expect a non-C calling standard, others have\\n * special parameter blocks..\\n */\",\n \"#include <linux/errno.h>\\n#include <linux/sched.h>\\n#include <linux/kernel.h>\\n#include <linux/mm.h>\\n#include <linux/smp.h>\\n#include <linux/stddef.h>\\n#include <linux/syscalls.h>\\n#include <linux/unistd.h>\\n#include <linux/ptrace.h>\\n#include <linux/user.h>\\n#include <linux/utsname.h>\\n#include <linux/time.h>\\n#include <linux/timex.h>\\n#include <linux/major.h>\\n#include <linux/stat.h>\\n#include <linux/mman.h>\\n#include <linux/shm.h>\\n#include <linux/poll.h>\\n#include <linux/file.h>\\n#include <linux/types.h>\\n#include <linux/ipc.h>\\n#include <linux/namei.h>\\n#include <linux/uio.h>\\n#include <linux/vfs.h>\\n#include <linux/rcupdate.h>\\n#include <linux/slab.h>\",\n \"#include <asm/fpu.h>\\n#include <asm/io.h>\\n#include <asm/uaccess.h>\\n#include <asm/system.h>\\n#include <asm/sysinfo.h>\\n#include <asm/hwrpb.h>\\n#include <asm/processor.h>\",\n \"/*\\n * Brk needs to return an error. Still support Linux's brk(0) query idiom,\\n * which OSF programs just shouldn't be doing. We're still not quite\\n * identical to OSF as we don't return 0 on success, but doing otherwise\\n * would require changes to libc. Hopefully this is good enough.\\n */\\nSYSCALL_DEFINE1(osf_brk, unsigned long, brk)\\n{\\n\\tunsigned long retval = sys_brk(brk);\\n\\tif (brk && brk != retval)\\n\\t\\tretval = -ENOMEM;\\n\\treturn retval;\\n}\\n \\n/*\\n * This is pure guess-work..\\n */\\nSYSCALL_DEFINE4(osf_set_program_attributes, unsigned long, text_start,\\n\\t\\tunsigned long, text_len, unsigned long, bss_start,\\n\\t\\tunsigned long, bss_len)\\n{\\n\\tstruct mm_struct *mm;\",\n \"\\tmm = current->mm;\\n\\tmm->end_code = bss_start + bss_len;\\n\\tmm->start_brk = bss_start + bss_len;\\n\\tmm->brk = bss_start + bss_len;\\n#if 0\\n\\tprintk(\\\"set_program_attributes(%lx %lx %lx %lx)\\\\n\\\",\\n\\t\\ttext_start, text_len, bss_start, bss_len);\\n#endif\\n\\treturn 0;\\n}\",\n \"/*\\n * OSF/1 directory handling functions...\\n *\\n * The \\\"getdents()\\\" interface is much more sane: the \\\"basep\\\" stuff is\\n * braindamage (it can't really handle filesystems where the directory\\n * offset differences aren't the same as \\\"d_reclen\\\").\\n */\\n#define NAME_OFFSET\\toffsetof (struct osf_dirent, d_name)\",\n \"struct osf_dirent {\\n\\tunsigned int d_ino;\\n\\tunsigned short d_reclen;\\n\\tunsigned short d_namlen;\\n\\tchar d_name[1];\\n};\",\n \"struct osf_dirent_callback {\\n\\tstruct osf_dirent __user *dirent;\\n\\tlong __user *basep;\\n\\tunsigned int count;\\n\\tint error;\\n};\",\n \"static int\\nosf_filldir(void *__buf, const char *name, int namlen, loff_t offset,\\n\\t u64 ino, unsigned int d_type)\\n{\\n\\tstruct osf_dirent __user *dirent;\\n\\tstruct osf_dirent_callback *buf = (struct osf_dirent_callback *) __buf;\\n\\tunsigned int reclen = ALIGN(NAME_OFFSET + namlen + 1, sizeof(u32));\\n\\tunsigned int d_ino;\",\n \"\\tbuf->error = -EINVAL;\\t/* only used if we fail */\\n\\tif (reclen > buf->count)\\n\\t\\treturn -EINVAL;\\n\\td_ino = ino;\\n\\tif (sizeof(d_ino) < sizeof(ino) && d_ino != ino) {\\n\\t\\tbuf->error = -EOVERFLOW;\\n\\t\\treturn -EOVERFLOW;\\n\\t}\\n\\tif (buf->basep) {\\n\\t\\tif (put_user(offset, buf->basep))\\n\\t\\t\\tgoto Efault;\\n\\t\\tbuf->basep = NULL;\\n\\t}\\n\\tdirent = buf->dirent;\\n\\tif (put_user(d_ino, &dirent->d_ino) ||\\n\\t put_user(namlen, &dirent->d_namlen) ||\\n\\t put_user(reclen, &dirent->d_reclen) ||\\n\\t copy_to_user(dirent->d_name, name, namlen) ||\\n\\t put_user(0, dirent->d_name + namlen))\\n\\t\\tgoto Efault;\\n\\tdirent = (void __user *)dirent + reclen;\\n\\tbuf->dirent = dirent;\\n\\tbuf->count -= reclen;\\n\\treturn 0;\\nEfault:\\n\\tbuf->error = -EFAULT;\\n\\treturn -EFAULT;\\n}\",\n \"SYSCALL_DEFINE4(osf_getdirentries, unsigned int, fd,\\n\\t\\tstruct osf_dirent __user *, dirent, unsigned int, count,\\n\\t\\tlong __user *, basep)\\n{\\n\\tint error;\\n\\tstruct file *file;\\n\\tstruct osf_dirent_callback buf;\",\n \"\\terror = -EBADF;\\n\\tfile = fget(fd);\\n\\tif (!file)\\n\\t\\tgoto out;\",\n \"\\tbuf.dirent = dirent;\\n\\tbuf.basep = basep;\\n\\tbuf.count = count;\\n\\tbuf.error = 0;\",\n \"\\terror = vfs_readdir(file, osf_filldir, &buf);\\n\\tif (error >= 0)\\n\\t\\terror = buf.error;\\n\\tif (count != buf.count)\\n\\t\\terror = count - buf.count;\",\n \"\\tfput(file);\\n out:\\n\\treturn error;\\n}\",\n \"#undef NAME_OFFSET\",\n \"SYSCALL_DEFINE6(osf_mmap, unsigned long, addr, unsigned long, len,\\n\\t\\tunsigned long, prot, unsigned long, flags, unsigned long, fd,\\n\\t\\tunsigned long, off)\\n{\\n\\tunsigned long ret = -EINVAL;\",\n \"#if 0\\n\\tif (flags & (_MAP_HASSEMAPHORE | _MAP_INHERIT | _MAP_UNALIGNED))\\n\\t\\tprintk(\\\"%s: unimplemented OSF mmap flags %04lx\\\\n\\\", \\n\\t\\t\\tcurrent->comm, flags);\\n#endif\\n\\tif ((off + PAGE_ALIGN(len)) < off)\\n\\t\\tgoto out;\\n\\tif (off & ~PAGE_MASK)\\n\\t\\tgoto out;\\n\\tret = sys_mmap_pgoff(addr, len, prot, flags, fd, off >> PAGE_SHIFT);\\n out:\\n\\treturn ret;\\n}\",\n \"\\n/*\\n * The OSF/1 statfs structure is much larger, but this should\\n * match the beginning, at least.\\n */\\nstruct osf_statfs {\\n\\tshort f_type;\\n\\tshort f_flags;\\n\\tint f_fsize;\\n\\tint f_bsize;\\n\\tint f_blocks;\\n\\tint f_bfree;\\n\\tint f_bavail;\\n\\tint f_files;\\n\\tint f_ffree;\\n\\t__kernel_fsid_t f_fsid;\\n};\",\n \"static int\\nlinux_to_osf_statfs(struct kstatfs *linux_stat, struct osf_statfs __user *osf_stat,\\n\\t\\t unsigned long bufsiz)\\n{\\n\\tstruct osf_statfs tmp_stat;\",\n \"\\ttmp_stat.f_type = linux_stat->f_type;\\n\\ttmp_stat.f_flags = 0;\\t/* mount flags */\\n\\ttmp_stat.f_fsize = linux_stat->f_frsize;\\n\\ttmp_stat.f_bsize = linux_stat->f_bsize;\\n\\ttmp_stat.f_blocks = linux_stat->f_blocks;\\n\\ttmp_stat.f_bfree = linux_stat->f_bfree;\\n\\ttmp_stat.f_bavail = linux_stat->f_bavail;\\n\\ttmp_stat.f_files = linux_stat->f_files;\\n\\ttmp_stat.f_ffree = linux_stat->f_ffree;\\n\\ttmp_stat.f_fsid = linux_stat->f_fsid;\\n\\tif (bufsiz > sizeof(tmp_stat))\\n\\t\\tbufsiz = sizeof(tmp_stat);\\n\\treturn copy_to_user(osf_stat, &tmp_stat, bufsiz) ? -EFAULT : 0;\\n}\",\n \"SYSCALL_DEFINE3(osf_statfs, const char __user *, pathname,\\n\\t\\tstruct osf_statfs __user *, buffer, unsigned long, bufsiz)\\n{\\n\\tstruct kstatfs linux_stat;\\n\\tint error = user_statfs(pathname, &linux_stat);\\n\\tif (!error)\\n\\t\\terror = linux_to_osf_statfs(&linux_stat, buffer, bufsiz);\\n\\treturn error;\\t\\n}\",\n \"SYSCALL_DEFINE3(osf_fstatfs, unsigned long, fd,\\n\\t\\tstruct osf_statfs __user *, buffer, unsigned long, bufsiz)\\n{\\n\\tstruct kstatfs linux_stat;\\n\\tint error = fd_statfs(fd, &linux_stat);\\n\\tif (!error)\\n\\t\\terror = linux_to_osf_statfs(&linux_stat, buffer, bufsiz);\\n\\treturn error;\\n}\",\n \"/*\\n * Uhh.. OSF/1 mount parameters aren't exactly obvious..\\n *\\n * Although to be frank, neither are the native Linux/i386 ones..\\n */\\nstruct ufs_args {\\n\\tchar __user *devname;\\n\\tint flags;\\n\\tuid_t exroot;\\n};\",\n \"struct cdfs_args {\\n\\tchar __user *devname;\\n\\tint flags;\\n\\tuid_t exroot;\",\n \"\\t/* This has lots more here, which Linux handles with the option block\\n\\t but I'm too lazy to do the translation into ASCII. */\\n};\",\n \"struct procfs_args {\\n\\tchar __user *devname;\\n\\tint flags;\\n\\tuid_t exroot;\\n};\",\n \"/*\\n * We can't actually handle ufs yet, so we translate UFS mounts to\\n * ext2fs mounts. I wouldn't mind a UFS filesystem, but the UFS\\n * layout is so braindead it's a major headache doing it.\\n *\\n * Just how long ago was it written? OTOH our UFS driver may be still\\n * unhappy with OSF UFS. [CHECKME]\\n */\\nstatic int\\nosf_ufs_mount(char *dirname, struct ufs_args __user *args, int flags)\\n{\\n\\tint retval;\\n\\tstruct cdfs_args tmp;\\n\\tchar *devname;\",\n \"\\tretval = -EFAULT;\\n\\tif (copy_from_user(&tmp, args, sizeof(tmp)))\\n\\t\\tgoto out;\\n\\tdevname = getname(tmp.devname);\\n\\tretval = PTR_ERR(devname);\\n\\tif (IS_ERR(devname))\\n\\t\\tgoto out;\\n\\tretval = do_mount(devname, dirname, \\\"ext2\\\", flags, NULL);\\n\\tputname(devname);\\n out:\\n\\treturn retval;\\n}\",\n \"static int\\nosf_cdfs_mount(char *dirname, struct cdfs_args __user *args, int flags)\\n{\\n\\tint retval;\\n\\tstruct cdfs_args tmp;\\n\\tchar *devname;\",\n \"\\tretval = -EFAULT;\\n\\tif (copy_from_user(&tmp, args, sizeof(tmp)))\\n\\t\\tgoto out;\\n\\tdevname = getname(tmp.devname);\\n\\tretval = PTR_ERR(devname);\\n\\tif (IS_ERR(devname))\\n\\t\\tgoto out;\\n\\tretval = do_mount(devname, dirname, \\\"iso9660\\\", flags, NULL);\\n\\tputname(devname);\\n out:\\n\\treturn retval;\\n}\",\n \"static int\\nosf_procfs_mount(char *dirname, struct procfs_args __user *args, int flags)\\n{\\n\\tstruct procfs_args tmp;\",\n \"\\tif (copy_from_user(&tmp, args, sizeof(tmp)))\\n\\t\\treturn -EFAULT;\",\n \"\\treturn do_mount(\\\"\\\", dirname, \\\"proc\\\", flags, NULL);\\n}\",\n \"SYSCALL_DEFINE4(osf_mount, unsigned long, typenr, const char __user *, path,\\n\\t\\tint, flag, void __user *, data)\\n{\\n\\tint retval;\\n\\tchar *name;\",\n \"\\tname = getname(path);\\n\\tretval = PTR_ERR(name);\\n\\tif (IS_ERR(name))\\n\\t\\tgoto out;\\n\\tswitch (typenr) {\\n\\tcase 1:\\n\\t\\tretval = osf_ufs_mount(name, data, flag);\\n\\t\\tbreak;\\n\\tcase 6:\\n\\t\\tretval = osf_cdfs_mount(name, data, flag);\\n\\t\\tbreak;\\n\\tcase 9:\\n\\t\\tretval = osf_procfs_mount(name, data, flag);\\n\\t\\tbreak;\\n\\tdefault:\\n\\t\\tretval = -EINVAL;\\n\\t\\tprintk(\\\"osf_mount(%ld, %x)\\\\n\\\", typenr, flag);\\n\\t}\\n\\tputname(name);\\n out:\\n\\treturn retval;\\n}\",\n \"SYSCALL_DEFINE1(osf_utsname, char __user *, name)\\n{\\n\\tint error;\",\n \"\\tdown_read(&uts_sem);\\n\\terror = -EFAULT;\\n\\tif (copy_to_user(name + 0, utsname()->sysname, 32))\\n\\t\\tgoto out;\\n\\tif (copy_to_user(name + 32, utsname()->nodename, 32))\\n\\t\\tgoto out;\\n\\tif (copy_to_user(name + 64, utsname()->release, 32))\\n\\t\\tgoto out;\\n\\tif (copy_to_user(name + 96, utsname()->version, 32))\\n\\t\\tgoto out;\\n\\tif (copy_to_user(name + 128, utsname()->machine, 32))\\n\\t\\tgoto out;\",\n \"\\terror = 0;\\n out:\\n\\tup_read(&uts_sem);\\t\\n\\treturn error;\\n}\",\n \"SYSCALL_DEFINE0(getpagesize)\\n{\\n\\treturn PAGE_SIZE;\\n}\",\n \"SYSCALL_DEFINE0(getdtablesize)\\n{\\n\\treturn sysctl_nr_open;\\n}\",\n \"/*\\n * For compatibility with OSF/1 only. Use utsname(2) instead.\\n */\\nSYSCALL_DEFINE2(osf_getdomainname, char __user *, name, int, namelen)\\n{\\n\\tunsigned len;\\n\\tint i;\",\n \"\\tif (!access_ok(VERIFY_WRITE, name, namelen))\\n\\t\\treturn -EFAULT;\",\n \"\\tlen = namelen;\",\n \"\\tif (len > 32)\",\n \"\\t\\tlen = 32;\",\n \"\\tdown_read(&uts_sem);\\n\\tfor (i = 0; i < len; ++i) {\\n\\t\\t__put_user(utsname()->domainname[i], name + i);\\n\\t\\tif (utsname()->domainname[i] == '\\\\0')\\n\\t\\t\\tbreak;\\n\\t}\\n\\tup_read(&uts_sem);\",\n \"\\treturn 0;\\n}\",\n \"/*\\n * The following stuff should move into a header file should it ever\\n * be labeled \\\"officially supported.\\\" Right now, there is just enough\\n * support to avoid applications (such as tar) printing error\\n * messages. The attributes are not really implemented.\\n */\",\n \"/*\\n * Values for Property list entry flag\\n */\\n#define PLE_PROPAGATE_ON_COPY\\t\\t0x1\\t/* cp(1) will copy entry\\n\\t\\t\\t\\t\\t\\t by default */\\n#define PLE_FLAG_MASK\\t\\t\\t0x1\\t/* Valid flag values */\\n#define PLE_FLAG_ALL\\t\\t\\t-1\\t/* All flag value */\",\n \"struct proplistname_args {\\n\\tunsigned int pl_mask;\\n\\tunsigned int pl_numnames;\\n\\tchar **pl_names;\\n};\",\n \"union pl_args {\\n\\tstruct setargs {\\n\\t\\tchar __user *path;\\n\\t\\tlong follow;\\n\\t\\tlong nbytes;\\n\\t\\tchar __user *buf;\\n\\t} set;\\n\\tstruct fsetargs {\\n\\t\\tlong fd;\\n\\t\\tlong nbytes;\\n\\t\\tchar __user *buf;\\n\\t} fset;\\n\\tstruct getargs {\\n\\t\\tchar __user *path;\\n\\t\\tlong follow;\\n\\t\\tstruct proplistname_args __user *name_args;\\n\\t\\tlong nbytes;\\n\\t\\tchar __user *buf;\\n\\t\\tint __user *min_buf_size;\\n\\t} get;\\n\\tstruct fgetargs {\\n\\t\\tlong fd;\\n\\t\\tstruct proplistname_args __user *name_args;\\n\\t\\tlong nbytes;\\n\\t\\tchar __user *buf;\\n\\t\\tint __user *min_buf_size;\\n\\t} fget;\\n\\tstruct delargs {\\n\\t\\tchar __user *path;\\n\\t\\tlong follow;\\n\\t\\tstruct proplistname_args __user *name_args;\\n\\t} del;\\n\\tstruct fdelargs {\\n\\t\\tlong fd;\\n\\t\\tstruct proplistname_args __user *name_args;\\n\\t} fdel;\\n};\",\n \"enum pl_code {\\n\\tPL_SET = 1, PL_FSET = 2,\\n\\tPL_GET = 3, PL_FGET = 4,\\n\\tPL_DEL = 5, PL_FDEL = 6\\n};\",\n \"SYSCALL_DEFINE2(osf_proplist_syscall, enum pl_code, code,\\n\\t\\tunion pl_args __user *, args)\\n{\\n\\tlong error;\\n\\tint __user *min_buf_size_ptr;\",\n \"\\tswitch (code) {\\n\\tcase PL_SET:\\n\\t\\tif (get_user(error, &args->set.nbytes))\\n\\t\\t\\terror = -EFAULT;\\n\\t\\tbreak;\\n\\tcase PL_FSET:\\n\\t\\tif (get_user(error, &args->fset.nbytes))\\n\\t\\t\\terror = -EFAULT;\\n\\t\\tbreak;\\n\\tcase PL_GET:\\n\\t\\terror = get_user(min_buf_size_ptr, &args->get.min_buf_size);\\n\\t\\tif (error)\\n\\t\\t\\tbreak;\\n\\t\\terror = put_user(0, min_buf_size_ptr);\\n\\t\\tbreak;\\n\\tcase PL_FGET:\\n\\t\\terror = get_user(min_buf_size_ptr, &args->fget.min_buf_size);\\n\\t\\tif (error)\\n\\t\\t\\tbreak;\\n\\t\\terror = put_user(0, min_buf_size_ptr);\\n\\t\\tbreak;\\n\\tcase PL_DEL:\\n\\tcase PL_FDEL:\\n\\t\\terror = 0;\\n\\t\\tbreak;\\n\\tdefault:\\n\\t\\terror = -EOPNOTSUPP;\\n\\t\\tbreak;\\n\\t};\\n\\treturn error;\\n}\",\n \"SYSCALL_DEFINE2(osf_sigstack, struct sigstack __user *, uss,\\n\\t\\tstruct sigstack __user *, uoss)\\n{\\n\\tunsigned long usp = rdusp();\\n\\tunsigned long oss_sp = current->sas_ss_sp + current->sas_ss_size;\\n\\tunsigned long oss_os = on_sig_stack(usp);\\n\\tint error;\",\n \"\\tif (uss) {\\n\\t\\tvoid __user *ss_sp;\",\n \"\\t\\terror = -EFAULT;\\n\\t\\tif (get_user(ss_sp, &uss->ss_sp))\\n\\t\\t\\tgoto out;\",\n \"\\t\\t/* If the current stack was set with sigaltstack, don't\\n\\t\\t swap stacks while we are on it. */\\n\\t\\terror = -EPERM;\\n\\t\\tif (current->sas_ss_sp && on_sig_stack(usp))\\n\\t\\t\\tgoto out;\",\n \"\\t\\t/* Since we don't know the extent of the stack, and we don't\\n\\t\\t track onstack-ness, but rather calculate it, we must \\n\\t\\t presume a size. Ho hum this interface is lossy. */\\n\\t\\tcurrent->sas_ss_sp = (unsigned long)ss_sp - SIGSTKSZ;\\n\\t\\tcurrent->sas_ss_size = SIGSTKSZ;\\n\\t}\",\n \"\\tif (uoss) {\\n\\t\\terror = -EFAULT;\\n\\t\\tif (! access_ok(VERIFY_WRITE, uoss, sizeof(*uoss))\\n\\t\\t || __put_user(oss_sp, &uoss->ss_sp)\\n\\t\\t || __put_user(oss_os, &uoss->ss_onstack))\\n\\t\\t\\tgoto out;\\n\\t}\",\n \"\\terror = 0;\\n out:\\n\\treturn error;\\n}\",\n \"SYSCALL_DEFINE3(osf_sysinfo, int, command, char __user *, buf, long, count)\\n{\\n\\tconst char *sysinfo_table[] = {\\n\\t\\tutsname()->sysname,\\n\\t\\tutsname()->nodename,\\n\\t\\tutsname()->release,\\n\\t\\tutsname()->version,\\n\\t\\tutsname()->machine,\\n\\t\\t\\\"alpha\\\",\\t/* instruction set architecture */\\n\\t\\t\\\"dummy\\\",\\t/* hardware serial number */\\n\\t\\t\\\"dummy\\\",\\t/* hardware manufacturer */\\n\\t\\t\\\"dummy\\\",\\t/* secure RPC domain */\\n\\t};\\n\\tunsigned long offset;\\n\\tconst char *res;\\n\\tlong len, err = -EINVAL;\",\n \"\\toffset = command-1;\\n\\tif (offset >= ARRAY_SIZE(sysinfo_table)) {\\n\\t\\t/* Digital UNIX has a few unpublished interfaces here */\\n\\t\\tprintk(\\\"sysinfo(%d)\\\", command);\\n\\t\\tgoto out;\\n\\t}\",\n \"\\tdown_read(&uts_sem);\\n\\tres = sysinfo_table[offset];\\n\\tlen = strlen(res)+1;\",\n \"\\tif ((unsigned long)len > (unsigned long)count)\",\n \"\\t\\tlen = count;\\n\\tif (copy_to_user(buf, res, len))\\n\\t\\terr = -EFAULT;\\n\\telse\\n\\t\\terr = 0;\\n\\tup_read(&uts_sem);\\n out:\\n\\treturn err;\\n}\",\n \"SYSCALL_DEFINE5(osf_getsysinfo, unsigned long, op, void __user *, buffer,\\n\\t\\tunsigned long, nbytes, int __user *, start, void __user *, arg)\\n{\\n\\tunsigned long w;\\n\\tstruct percpu_struct *cpu;\",\n \"\\tswitch (op) {\\n\\tcase GSI_IEEE_FP_CONTROL:\\n\\t\\t/* Return current software fp control & status bits. */\\n\\t\\t/* Note that DU doesn't verify available space here. */\",\n \" \\t\\tw = current_thread_info()->ieee_state & IEEE_SW_MASK;\\n \\t\\tw = swcr_update_status(w, rdfpcr());\\n\\t\\tif (put_user(w, (unsigned long __user *) buffer))\\n\\t\\t\\treturn -EFAULT;\\n\\t\\treturn 0;\",\n \"\\tcase GSI_IEEE_STATE_AT_SIGNAL:\\n\\t\\t/*\\n\\t\\t * Not sure anybody will ever use this weird stuff. These\\n\\t\\t * ops can be used (under OSF/1) to set the fpcr that should\\n\\t\\t * be used when a signal handler starts executing.\\n\\t\\t */\\n\\t\\tbreak;\",\n \" \\tcase GSI_UACPROC:\\n\\t\\tif (nbytes < sizeof(unsigned int))\\n\\t\\t\\treturn -EINVAL;\\n \\t\\tw = (current_thread_info()->flags >> UAC_SHIFT) & UAC_BITMASK;\\n \\t\\tif (put_user(w, (unsigned int __user *)buffer))\\n \\t\\t\\treturn -EFAULT;\\n \\t\\treturn 1;\",\n \"\\tcase GSI_PROC_TYPE:\\n\\t\\tif (nbytes < sizeof(unsigned long))\\n\\t\\t\\treturn -EINVAL;\\n\\t\\tcpu = (struct percpu_struct*)\\n\\t\\t ((char*)hwrpb + hwrpb->processor_offset);\\n\\t\\tw = cpu->type;\\n\\t\\tif (put_user(w, (unsigned long __user*)buffer))\\n\\t\\t\\treturn -EFAULT;\\n\\t\\treturn 1;\",\n \"\\tcase GSI_GET_HWRPB:\",\n \"\\t\\tif (nbytes > sizeof(*hwrpb))\",\n \"\\t\\t\\treturn -EINVAL;\\n\\t\\tif (copy_to_user(buffer, hwrpb, nbytes) != 0)\\n\\t\\t\\treturn -EFAULT;\\n\\t\\treturn 1;\",\n \"\\tdefault:\\n\\t\\tbreak;\\n\\t}\",\n \"\\treturn -EOPNOTSUPP;\\n}\",\n \"SYSCALL_DEFINE5(osf_setsysinfo, unsigned long, op, void __user *, buffer,\\n\\t\\tunsigned long, nbytes, int __user *, start, void __user *, arg)\\n{\\n\\tswitch (op) {\\n\\tcase SSI_IEEE_FP_CONTROL: {\\n\\t\\tunsigned long swcr, fpcr;\\n\\t\\tunsigned int *state;\",\n \"\\t\\t/* \\n\\t\\t * Alpha Architecture Handbook 4.7.7.3:\\n\\t\\t * To be fully IEEE compiant, we must track the current IEEE\\n\\t\\t * exception state in software, because spurious bits can be\\n\\t\\t * set in the trap shadow of a software-complete insn.\\n\\t\\t */\",\n \"\\t\\tif (get_user(swcr, (unsigned long __user *)buffer))\\n\\t\\t\\treturn -EFAULT;\\n\\t\\tstate = ¤t_thread_info()->ieee_state;\",\n \"\\t\\t/* Update softare trap enable bits. */\\n\\t\\t*state = (*state & ~IEEE_SW_MASK) | (swcr & IEEE_SW_MASK);\",\n \"\\t\\t/* Update the real fpcr. */\\n\\t\\tfpcr = rdfpcr() & FPCR_DYN_MASK;\\n\\t\\tfpcr |= ieee_swcr_to_fpcr(swcr);\\n\\t\\twrfpcr(fpcr);\",\n \"\\t\\treturn 0;\\n\\t}\",\n \"\\tcase SSI_IEEE_RAISE_EXCEPTION: {\\n\\t\\tunsigned long exc, swcr, fpcr, fex;\\n\\t\\tunsigned int *state;\",\n \"\\t\\tif (get_user(exc, (unsigned long __user *)buffer))\\n\\t\\t\\treturn -EFAULT;\\n\\t\\tstate = ¤t_thread_info()->ieee_state;\\n\\t\\texc &= IEEE_STATUS_MASK;\",\n \"\\t\\t/* Update softare trap enable bits. */\\n \\t\\tswcr = (*state & IEEE_SW_MASK) | exc;\\n\\t\\t*state |= exc;\",\n \"\\t\\t/* Update the real fpcr. */\\n\\t\\tfpcr = rdfpcr();\\n\\t\\tfpcr |= ieee_swcr_to_fpcr(swcr);\\n\\t\\twrfpcr(fpcr);\",\n \" \\t\\t/* If any exceptions set by this call, and are unmasked,\\n\\t\\t send a signal. Old exceptions are not signaled. */\\n\\t\\tfex = (exc >> IEEE_STATUS_TO_EXCSUM_SHIFT) & swcr;\\n \\t\\tif (fex) {\\n\\t\\t\\tsiginfo_t info;\\n\\t\\t\\tint si_code = 0;\",\n \"\\t\\t\\tif (fex & IEEE_TRAP_ENABLE_DNO) si_code = FPE_FLTUND;\\n\\t\\t\\tif (fex & IEEE_TRAP_ENABLE_INE) si_code = FPE_FLTRES;\\n\\t\\t\\tif (fex & IEEE_TRAP_ENABLE_UNF) si_code = FPE_FLTUND;\\n\\t\\t\\tif (fex & IEEE_TRAP_ENABLE_OVF) si_code = FPE_FLTOVF;\\n\\t\\t\\tif (fex & IEEE_TRAP_ENABLE_DZE) si_code = FPE_FLTDIV;\\n\\t\\t\\tif (fex & IEEE_TRAP_ENABLE_INV) si_code = FPE_FLTINV;\",\n \"\\t\\t\\tinfo.si_signo = SIGFPE;\\n\\t\\t\\tinfo.si_errno = 0;\\n\\t\\t\\tinfo.si_code = si_code;\\n\\t\\t\\tinfo.si_addr = NULL; /* FIXME */\\n \\t\\t\\tsend_sig_info(SIGFPE, &info, current);\\n \\t\\t}\\n\\t\\treturn 0;\\n\\t}\",\n \"\\tcase SSI_IEEE_STATE_AT_SIGNAL:\\n\\tcase SSI_IEEE_IGNORE_STATE_AT_SIGNAL:\\n\\t\\t/*\\n\\t\\t * Not sure anybody will ever use this weird stuff. These\\n\\t\\t * ops can be used (under OSF/1) to set the fpcr that should\\n\\t\\t * be used when a signal handler starts executing.\\n\\t\\t */\\n\\t\\tbreak;\",\n \" \\tcase SSI_NVPAIRS: {\\n\\t\\tunsigned long v, w, i;\\n\\t\\tunsigned int old, new;\\n\\t\\t\\n \\t\\tfor (i = 0; i < nbytes; ++i) {\",\n \" \\t\\t\\tif (get_user(v, 2*i + (unsigned int __user *)buffer))\\n \\t\\t\\t\\treturn -EFAULT;\\n \\t\\t\\tif (get_user(w, 2*i + 1 + (unsigned int __user *)buffer))\\n \\t\\t\\t\\treturn -EFAULT;\\n \\t\\t\\tswitch (v) {\\n \\t\\t\\tcase SSIN_UACPROC:\\n\\t\\t\\tagain:\\n\\t\\t\\t\\told = current_thread_info()->flags;\\n\\t\\t\\t\\tnew = old & ~(UAC_BITMASK << UAC_SHIFT);\\n\\t\\t\\t\\tnew = new | (w & UAC_BITMASK) << UAC_SHIFT;\\n\\t\\t\\t\\tif (cmpxchg(¤t_thread_info()->flags,\\n\\t\\t\\t\\t\\t old, new) != old)\\n\\t\\t\\t\\t\\tgoto again;\\n \\t\\t\\t\\tbreak;\\n \\n \\t\\t\\tdefault:\\n \\t\\t\\t\\treturn -EOPNOTSUPP;\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\treturn 0;\\n\\t}\\n \\n\\tdefault:\\n\\t\\tbreak;\\n\\t}\",\n \"\\treturn -EOPNOTSUPP;\\n}\",\n \"/* Translations due to the fact that OSF's time_t is an int. Which\\n affects all sorts of things, like timeval and itimerval. */\",\n \"extern struct timezone sys_tz;\",\n \"struct timeval32\\n{\\n int tv_sec, tv_usec;\\n};\",\n \"struct itimerval32\\n{\\n struct timeval32 it_interval;\\n struct timeval32 it_value;\\n};\",\n \"static inline long\\nget_tv32(struct timeval *o, struct timeval32 __user *i)\\n{\\n\\treturn (!access_ok(VERIFY_READ, i, sizeof(*i)) ||\\n\\t\\t(__get_user(o->tv_sec, &i->tv_sec) |\\n\\t\\t __get_user(o->tv_usec, &i->tv_usec)));\\n}\",\n \"static inline long\\nput_tv32(struct timeval32 __user *o, struct timeval *i)\\n{\\n\\treturn (!access_ok(VERIFY_WRITE, o, sizeof(*o)) ||\\n\\t\\t(__put_user(i->tv_sec, &o->tv_sec) |\\n\\t\\t __put_user(i->tv_usec, &o->tv_usec)));\\n}\",\n \"static inline long\\nget_it32(struct itimerval *o, struct itimerval32 __user *i)\\n{\\n\\treturn (!access_ok(VERIFY_READ, i, sizeof(*i)) ||\\n\\t\\t(__get_user(o->it_interval.tv_sec, &i->it_interval.tv_sec) |\\n\\t\\t __get_user(o->it_interval.tv_usec, &i->it_interval.tv_usec) |\\n\\t\\t __get_user(o->it_value.tv_sec, &i->it_value.tv_sec) |\\n\\t\\t __get_user(o->it_value.tv_usec, &i->it_value.tv_usec)));\\n}\",\n \"static inline long\\nput_it32(struct itimerval32 __user *o, struct itimerval *i)\\n{\\n\\treturn (!access_ok(VERIFY_WRITE, o, sizeof(*o)) ||\\n\\t\\t(__put_user(i->it_interval.tv_sec, &o->it_interval.tv_sec) |\\n\\t\\t __put_user(i->it_interval.tv_usec, &o->it_interval.tv_usec) |\\n\\t\\t __put_user(i->it_value.tv_sec, &o->it_value.tv_sec) |\\n\\t\\t __put_user(i->it_value.tv_usec, &o->it_value.tv_usec)));\\n}\",\n \"static inline void\\njiffies_to_timeval32(unsigned long jiffies, struct timeval32 *value)\\n{\\n\\tvalue->tv_usec = (jiffies % HZ) * (1000000L / HZ);\\n\\tvalue->tv_sec = jiffies / HZ;\\n}\",\n \"SYSCALL_DEFINE2(osf_gettimeofday, struct timeval32 __user *, tv,\\n\\t\\tstruct timezone __user *, tz)\\n{\\n\\tif (tv) {\\n\\t\\tstruct timeval ktv;\\n\\t\\tdo_gettimeofday(&ktv);\\n\\t\\tif (put_tv32(tv, &ktv))\\n\\t\\t\\treturn -EFAULT;\\n\\t}\\n\\tif (tz) {\\n\\t\\tif (copy_to_user(tz, &sys_tz, sizeof(sys_tz)))\\n\\t\\t\\treturn -EFAULT;\\n\\t}\\n\\treturn 0;\\n}\",\n \"SYSCALL_DEFINE2(osf_settimeofday, struct timeval32 __user *, tv,\\n\\t\\tstruct timezone __user *, tz)\\n{\\n\\tstruct timespec kts;\\n\\tstruct timezone ktz;\",\n \" \\tif (tv) {\\n\\t\\tif (get_tv32((struct timeval *)&kts, tv))\\n\\t\\t\\treturn -EFAULT;\\n\\t}\\n\\tif (tz) {\\n\\t\\tif (copy_from_user(&ktz, tz, sizeof(*tz)))\\n\\t\\t\\treturn -EFAULT;\\n\\t}\",\n \"\\tkts.tv_nsec *= 1000;\",\n \"\\treturn do_sys_settimeofday(tv ? &kts : NULL, tz ? &ktz : NULL);\\n}\",\n \"SYSCALL_DEFINE2(osf_getitimer, int, which, struct itimerval32 __user *, it)\\n{\\n\\tstruct itimerval kit;\\n\\tint error;\",\n \"\\terror = do_getitimer(which, &kit);\\n\\tif (!error && put_it32(it, &kit))\\n\\t\\terror = -EFAULT;\",\n \"\\treturn error;\\n}\",\n \"SYSCALL_DEFINE3(osf_setitimer, int, which, struct itimerval32 __user *, in,\\n\\t\\tstruct itimerval32 __user *, out)\\n{\\n\\tstruct itimerval kin, kout;\\n\\tint error;\",\n \"\\tif (in) {\\n\\t\\tif (get_it32(&kin, in))\\n\\t\\t\\treturn -EFAULT;\\n\\t} else\\n\\t\\tmemset(&kin, 0, sizeof(kin));\",\n \"\\terror = do_setitimer(which, &kin, out ? &kout : NULL);\\n\\tif (error || !out)\\n\\t\\treturn error;\",\n \"\\tif (put_it32(out, &kout))\\n\\t\\treturn -EFAULT;\",\n \"\\treturn 0;\",\n \"}\",\n \"SYSCALL_DEFINE2(osf_utimes, const char __user *, filename,\\n\\t\\tstruct timeval32 __user *, tvs)\\n{\\n\\tstruct timespec tv[2];\",\n \"\\tif (tvs) {\\n\\t\\tstruct timeval ktvs[2];\\n\\t\\tif (get_tv32(&ktvs[0], &tvs[0]) ||\\n\\t\\t get_tv32(&ktvs[1], &tvs[1]))\\n\\t\\t\\treturn -EFAULT;\",\n \"\\t\\tif (ktvs[0].tv_usec < 0 || ktvs[0].tv_usec >= 1000000 ||\\n\\t\\t ktvs[1].tv_usec < 0 || ktvs[1].tv_usec >= 1000000)\\n\\t\\t\\treturn -EINVAL;\",\n \"\\t\\ttv[0].tv_sec = ktvs[0].tv_sec;\\n\\t\\ttv[0].tv_nsec = 1000 * ktvs[0].tv_usec;\\n\\t\\ttv[1].tv_sec = ktvs[1].tv_sec;\\n\\t\\ttv[1].tv_nsec = 1000 * ktvs[1].tv_usec;\\n\\t}\",\n \"\\treturn do_utimes(AT_FDCWD, filename, tvs ? tv : NULL, 0);\\n}\",\n \"SYSCALL_DEFINE5(osf_select, int, n, fd_set __user *, inp, fd_set __user *, outp,\\n\\t\\tfd_set __user *, exp, struct timeval32 __user *, tvp)\\n{\\n\\tstruct timespec end_time, *to = NULL;\\n\\tif (tvp) {\\n\\t\\ttime_t sec, usec;\",\n \"\\t\\tto = &end_time;\",\n \"\\t\\tif (!access_ok(VERIFY_READ, tvp, sizeof(*tvp))\\n\\t\\t || __get_user(sec, &tvp->tv_sec)\\n\\t\\t || __get_user(usec, &tvp->tv_usec)) {\\n\\t\\t \\treturn -EFAULT;\\n\\t\\t}\",\n \"\\t\\tif (sec < 0 || usec < 0)\\n\\t\\t\\treturn -EINVAL;\",\n \"\\t\\tif (poll_select_set_timeout(to, sec, usec * NSEC_PER_USEC))\\n\\t\\t\\treturn -EINVAL;\\t\\t\",\n \"\\t}\",\n \"\\t/* OSF does not copy back the remaining time. */\\n\\treturn core_sys_select(n, inp, outp, exp, to);\\n}\",\n \"struct rusage32 {\\n\\tstruct timeval32 ru_utime;\\t/* user time used */\\n\\tstruct timeval32 ru_stime;\\t/* system time used */\\n\\tlong\\tru_maxrss;\\t\\t/* maximum resident set size */\\n\\tlong\\tru_ixrss;\\t\\t/* integral shared memory size */\\n\\tlong\\tru_idrss;\\t\\t/* integral unshared data size */\\n\\tlong\\tru_isrss;\\t\\t/* integral unshared stack size */\\n\\tlong\\tru_minflt;\\t\\t/* page reclaims */\\n\\tlong\\tru_majflt;\\t\\t/* page faults */\\n\\tlong\\tru_nswap;\\t\\t/* swaps */\\n\\tlong\\tru_inblock;\\t\\t/* block input operations */\\n\\tlong\\tru_oublock;\\t\\t/* block output operations */\\n\\tlong\\tru_msgsnd;\\t\\t/* messages sent */\\n\\tlong\\tru_msgrcv;\\t\\t/* messages received */\\n\\tlong\\tru_nsignals;\\t\\t/* signals received */\\n\\tlong\\tru_nvcsw;\\t\\t/* voluntary context switches */\\n\\tlong\\tru_nivcsw;\\t\\t/* involuntary \\\" */\\n};\",\n \"SYSCALL_DEFINE2(osf_getrusage, int, who, struct rusage32 __user *, ru)\\n{\\n\\tstruct rusage32 r;\",\n \"\\tif (who != RUSAGE_SELF && who != RUSAGE_CHILDREN)\\n\\t\\treturn -EINVAL;\",\n \"\\tmemset(&r, 0, sizeof(r));\\n\\tswitch (who) {\\n\\tcase RUSAGE_SELF:\\n\\t\\tjiffies_to_timeval32(current->utime, &r.ru_utime);\\n\\t\\tjiffies_to_timeval32(current->stime, &r.ru_stime);\\n\\t\\tr.ru_minflt = current->min_flt;\\n\\t\\tr.ru_majflt = current->maj_flt;\\n\\t\\tbreak;\\n\\tcase RUSAGE_CHILDREN:\\n\\t\\tjiffies_to_timeval32(current->signal->cutime, &r.ru_utime);\\n\\t\\tjiffies_to_timeval32(current->signal->cstime, &r.ru_stime);\\n\\t\\tr.ru_minflt = current->signal->cmin_flt;\\n\\t\\tr.ru_majflt = current->signal->cmaj_flt;\\n\\t\\tbreak;\\n\\t}\",\n \"\\treturn copy_to_user(ru, &r, sizeof(r)) ? -EFAULT : 0;\\n}\",\n \"SYSCALL_DEFINE4(osf_wait4, pid_t, pid, int __user *, ustatus, int, options,\\n\\t\\tstruct rusage32 __user *, ur)\\n{\\n\\tstruct rusage r;\\n\\tlong ret, err;\",\n \"\\tunsigned int status = 0;\",\n \"\\tmm_segment_t old_fs;\",\n \"\\tif (!ur)\\n\\t\\treturn sys_wait4(pid, ustatus, options, NULL);\",\n \"\\told_fs = get_fs();\\n\\t\\t\\n\\tset_fs (KERNEL_DS);\",\n \"\\tret = sys_wait4(pid, (unsigned int __user *) &status, options,\\n\\t\\t\\t(struct rusage __user *) &r);\",\n \"\\tset_fs (old_fs);\",\n \"\\tif (!access_ok(VERIFY_WRITE, ur, sizeof(*ur)))\\n\\t\\treturn -EFAULT;\",\n \"\\terr = 0;\",\n \"\\terr |= put_user(status, ustatus);\",\n \"\\terr |= __put_user(r.ru_utime.tv_sec, &ur->ru_utime.tv_sec);\\n\\terr |= __put_user(r.ru_utime.tv_usec, &ur->ru_utime.tv_usec);\\n\\terr |= __put_user(r.ru_stime.tv_sec, &ur->ru_stime.tv_sec);\\n\\terr |= __put_user(r.ru_stime.tv_usec, &ur->ru_stime.tv_usec);\\n\\terr |= __put_user(r.ru_maxrss, &ur->ru_maxrss);\\n\\terr |= __put_user(r.ru_ixrss, &ur->ru_ixrss);\\n\\terr |= __put_user(r.ru_idrss, &ur->ru_idrss);\\n\\terr |= __put_user(r.ru_isrss, &ur->ru_isrss);\\n\\terr |= __put_user(r.ru_minflt, &ur->ru_minflt);\\n\\terr |= __put_user(r.ru_majflt, &ur->ru_majflt);\\n\\terr |= __put_user(r.ru_nswap, &ur->ru_nswap);\\n\\terr |= __put_user(r.ru_inblock, &ur->ru_inblock);\\n\\terr |= __put_user(r.ru_oublock, &ur->ru_oublock);\\n\\terr |= __put_user(r.ru_msgsnd, &ur->ru_msgsnd);\\n\\terr |= __put_user(r.ru_msgrcv, &ur->ru_msgrcv);\\n\\terr |= __put_user(r.ru_nsignals, &ur->ru_nsignals);\\n\\terr |= __put_user(r.ru_nvcsw, &ur->ru_nvcsw);\\n\\terr |= __put_user(r.ru_nivcsw, &ur->ru_nivcsw);\",\n \"\\treturn err ? err : ret;\\n}\",\n \"/*\\n * I don't know what the parameters are: the first one\\n * seems to be a timeval pointer, and I suspect the second\\n * one is the time remaining.. Ho humm.. No documentation.\\n */\\nSYSCALL_DEFINE2(osf_usleep_thread, struct timeval32 __user *, sleep,\\n\\t\\tstruct timeval32 __user *, remain)\\n{\\n\\tstruct timeval tmp;\\n\\tunsigned long ticks;\",\n \"\\tif (get_tv32(&tmp, sleep))\\n\\t\\tgoto fault;\",\n \"\\tticks = timeval_to_jiffies(&tmp);\",\n \"\\tticks = schedule_timeout_interruptible(ticks);\",\n \"\\tif (remain) {\\n\\t\\tjiffies_to_timeval(ticks, &tmp);\\n\\t\\tif (put_tv32(remain, &tmp))\\n\\t\\t\\tgoto fault;\\n\\t}\\n\\t\\n\\treturn 0;\\n fault:\\n\\treturn -EFAULT;\\n}\",\n \"\\nstruct timex32 {\\n\\tunsigned int modes;\\t/* mode selector */\\n\\tlong offset;\\t\\t/* time offset (usec) */\\n\\tlong freq;\\t\\t/* frequency offset (scaled ppm) */\\n\\tlong maxerror;\\t\\t/* maximum error (usec) */\\n\\tlong esterror;\\t\\t/* estimated error (usec) */\\n\\tint status;\\t\\t/* clock command/status */\\n\\tlong constant;\\t\\t/* pll time constant */\\n\\tlong precision;\\t\\t/* clock precision (usec) (read only) */\\n\\tlong tolerance;\\t\\t/* clock frequency tolerance (ppm)\\n\\t\\t\\t\\t * (read only)\\n\\t\\t\\t\\t */\\n\\tstruct timeval32 time;\\t/* (read only) */\\n\\tlong tick;\\t\\t/* (modified) usecs between clock ticks */\",\n \"\\tlong ppsfreq; /* pps frequency (scaled ppm) (ro) */\\n\\tlong jitter; /* pps jitter (us) (ro) */\\n\\tint shift; /* interval duration (s) (shift) (ro) */\\n\\tlong stabil; /* pps stability (scaled ppm) (ro) */\\n\\tlong jitcnt; /* jitter limit exceeded (ro) */\\n\\tlong calcnt; /* calibration intervals (ro) */\\n\\tlong errcnt; /* calibration errors (ro) */\\n\\tlong stbcnt; /* stability limit exceeded (ro) */\",\n \"\\tint :32; int :32; int :32; int :32;\\n\\tint :32; int :32; int :32; int :32;\\n\\tint :32; int :32; int :32; int :32;\\n};\",\n \"SYSCALL_DEFINE1(old_adjtimex, struct timex32 __user *, txc_p)\\n{\\n struct timex txc;\\n\\tint ret;\",\n \"\\t/* copy relevant bits of struct timex. */\\n\\tif (copy_from_user(&txc, txc_p, offsetof(struct timex32, time)) ||\\n\\t copy_from_user(&txc.tick, &txc_p->tick, sizeof(struct timex32) - \\n\\t\\t\\t offsetof(struct timex32, time)))\\n\\t return -EFAULT;\",\n \"\\tret = do_adjtimex(&txc);\\t\\n\\tif (ret < 0)\\n\\t return ret;\\n\\t\\n\\t/* copy back to timex32 */\\n\\tif (copy_to_user(txc_p, &txc, offsetof(struct timex32, time)) ||\\n\\t (copy_to_user(&txc_p->tick, &txc.tick, sizeof(struct timex32) - \\n\\t\\t\\t offsetof(struct timex32, tick))) ||\\n\\t (put_tv32(&txc_p->time, &txc.time)))\\n\\t return -EFAULT;\",\n \"\\treturn ret;\\n}\",\n \"/* Get an address range which is currently unmapped. Similar to the\\n generic version except that we know how to honor ADDR_LIMIT_32BIT. */\",\n \"static unsigned long\\narch_get_unmapped_area_1(unsigned long addr, unsigned long len,\\n\\t\\t unsigned long limit)\\n{\\n\\tstruct vm_area_struct *vma = find_vma(current->mm, addr);\",\n \"\\twhile (1) {\\n\\t\\t/* At this point: (!vma || addr < vma->vm_end). */\\n\\t\\tif (limit - len < addr)\\n\\t\\t\\treturn -ENOMEM;\\n\\t\\tif (!vma || addr + len <= vma->vm_start)\\n\\t\\t\\treturn addr;\\n\\t\\taddr = vma->vm_end;\\n\\t\\tvma = vma->vm_next;\\n\\t}\\n}\",\n \"unsigned long\\narch_get_unmapped_area(struct file *filp, unsigned long addr,\\n\\t\\t unsigned long len, unsigned long pgoff,\\n\\t\\t unsigned long flags)\\n{\\n\\tunsigned long limit;\",\n \"\\t/* \\\"32 bit\\\" actually means 31 bit, since pointers sign extend. */\\n\\tif (current->personality & ADDR_LIMIT_32BIT)\\n\\t\\tlimit = 0x80000000;\\n\\telse\\n\\t\\tlimit = TASK_SIZE;\",\n \"\\tif (len > limit)\\n\\t\\treturn -ENOMEM;\",\n \"\\tif (flags & MAP_FIXED)\\n\\t\\treturn addr;\",\n \"\\t/* First, see if the given suggestion fits.\",\n \"\\t The OSF/1 loader (/sbin/loader) relies on us returning an\\n\\t address larger than the requested if one exists, which is\\n\\t a terribly broken way to program.\",\n \"\\t That said, I can see the use in being able to suggest not\\n\\t merely specific addresses, but regions of memory -- perhaps\\n\\t this feature should be incorporated into all ports? */\",\n \"\\tif (addr) {\\n\\t\\taddr = arch_get_unmapped_area_1 (PAGE_ALIGN(addr), len, limit);\\n\\t\\tif (addr != (unsigned long) -ENOMEM)\\n\\t\\t\\treturn addr;\\n\\t}\",\n \"\\t/* Next, try allocating at TASK_UNMAPPED_BASE. */\\n\\taddr = arch_get_unmapped_area_1 (PAGE_ALIGN(TASK_UNMAPPED_BASE),\\n\\t\\t\\t\\t\\t len, limit);\\n\\tif (addr != (unsigned long) -ENOMEM)\\n\\t\\treturn addr;\",\n \"\\t/* Finally, try allocating in low memory. */\\n\\taddr = arch_get_unmapped_area_1 (PAGE_SIZE, len, limit);\",\n \"\\treturn addr;\\n}\",\n \"#ifdef CONFIG_OSF4_COMPAT\",\n \"/* Clear top 32 bits of iov_len in the user's buffer for\\n compatibility with old versions of OSF/1 where iov_len\\n was defined as int. */\\nstatic int\\nosf_fix_iov_len(const struct iovec __user *iov, unsigned long count)\\n{\\n\\tunsigned long i;\",\n \"\\tfor (i = 0 ; i < count ; i++) {\\n\\t\\tint __user *iov_len_high = (int __user *)&iov[i].iov_len + 1;\",\n \"\\t\\tif (put_user(0, iov_len_high))\\n\\t\\t\\treturn -EFAULT;\\n\\t}\\n\\treturn 0;\\n}\",\n \"SYSCALL_DEFINE3(osf_readv, unsigned long, fd,\\n\\t\\tconst struct iovec __user *, vector, unsigned long, count)\\n{\\n\\tif (unlikely(personality(current->personality) == PER_OSF4))\\n\\t\\tif (osf_fix_iov_len(vector, count))\\n\\t\\t\\treturn -EFAULT;\\n\\treturn sys_readv(fd, vector, count);\\n}\",\n \"SYSCALL_DEFINE3(osf_writev, unsigned long, fd,\\n\\t\\tconst struct iovec __user *, vector, unsigned long, count)\\n{\\n\\tif (unlikely(personality(current->personality) == PER_OSF4))\\n\\t\\tif (osf_fix_iov_len(vector, count))\\n\\t\\t\\treturn -EFAULT;\\n\\treturn sys_writev(fd, vector, count);\\n}\",\n \"#endif\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"REPOSVUL"},"index":{"kind":"number","value":73,"string":"73"}}},{"rowIdx":199,"cells":{"prompt":{"kind":"string","value":"Determine whether the code is vulnerable or not."},"completions":{"kind":"list like","value":["/*\n * linux/fs/proc/base.c\n *\n * Copyright (C) 1991, 1992 Linus Torvalds\n *\n * proc base directory handling functions\n *\n * 1999, Al Viro. Rewritten. Now it covers the whole per-process part.\n * Instead of using magical inumbers to determine the kind of object\n * we allocate and fill in-core inodes upon lookup. They don't even\n * go into icache. We cache the reference to task_struct upon lookup too.\n * Eventually it should become a filesystem in its own. We don't use the\n * rest of procfs anymore.\n *\n *\n * Changelog:\n * 17-Jan-2005\n * Allan Bezerra\n * Bruna Moreira <bruna.moreira@indt.org.br>\n * Edjard Mota <edjard.mota@indt.org.br>\n * Ilias Biris <ilias.biris@indt.org.br>\n * Mauricio Lin <mauricio.lin@indt.org.br>\n *\n * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT\n *\n * A new process specific entry (smaps) included in /proc. It shows the\n * size of rss for each memory area. The maps entry lacks information\n * about physical memory size (rss) for each mapped file, i.e.,\n * rss information for executables and library files.\n * This additional information is useful for any tools that need to know\n * about physical memory consumption for a process specific library.\n *\n * Changelog:\n * 21-Feb-2005\n * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT\n * Pud inclusion in the page table walking.\n *\n * ChangeLog:\n * 10-Mar-2005\n * 10LE Instituto Nokia de Tecnologia - INdT:\n * A better way to walks through the page table as suggested by Hugh Dickins.\n *\n * Simo Piiroinen <simo.piiroinen@nokia.com>:\n * Smaps information related to shared, private, clean and dirty pages.\n *\n * Paul Mundt <paul.mundt@nokia.com>:\n * Overall revision about smaps.\n */","#include <asm/uaccess.h>","#include <linux/errno.h>\n#include <linux/time.h>\n#include <linux/proc_fs.h>\n#include <linux/stat.h>\n#include <linux/task_io_accounting_ops.h>\n#include <linux/init.h>\n#include <linux/capability.h>\n#include <linux/file.h>\n#include <linux/fdtable.h>\n#include <linux/string.h>\n#include <linux/seq_file.h>\n#include <linux/namei.h>\n#include <linux/mnt_namespace.h>\n#include <linux/mm.h>\n#include <linux/swap.h>\n#include <linux/rcupdate.h>\n#include <linux/kallsyms.h>\n#include <linux/stacktrace.h>\n#include <linux/resource.h>\n#include <linux/module.h>\n#include <linux/mount.h>\n#include <linux/security.h>\n#include <linux/ptrace.h>\n#include <linux/tracehook.h>\n#include <linux/cgroup.h>\n#include <linux/cpuset.h>\n#include <linux/audit.h>\n#include <linux/poll.h>\n#include <linux/nsproxy.h>\n#include <linux/oom.h>\n#include <linux/elf.h>\n#include <linux/pid_namespace.h>\n#include <linux/fs_struct.h>\n#include <linux/slab.h>\n#ifdef CONFIG_HARDWALL\n#include <asm/hardwall.h>\n#endif\n#include \"internal.h\"","/* NOTE:\n *\tImplementing inode permission operations in /proc is almost\n *\tcertainly an error. Permission checks need to happen during\n *\teach system call not at open time. The reason is that most of\n *\twhat we wish to check for permissions in /proc varies at runtime.\n *\n *\tThe classic example of a problem is opening file descriptors\n *\tin /proc for a task before it execs a suid executable.\n */","struct pid_entry {\n\tchar *name;\n\tint len;\n\tmode_t mode;\n\tconst struct inode_operations *iop;\n\tconst struct file_operations *fop;\n\tunion proc_op op;\n};","#define NOD(NAME, MODE, IOP, FOP, OP) {\t\t\t\\\n\t.name = (NAME),\t\t\t\t\t\\\n\t.len = sizeof(NAME) - 1,\t\t\t\\\n\t.mode = MODE,\t\t\t\t\t\\\n\t.iop = IOP,\t\t\t\t\t\\\n\t.fop = FOP,\t\t\t\t\t\\\n\t.op = OP,\t\t\t\t\t\\\n}","#define DIR(NAME, MODE, iops, fops)\t\\\n\tNOD(NAME, (S_IFDIR|(MODE)), &iops, &fops, {} )\n#define LNK(NAME, get_link)\t\t\t\t\t\\\n\tNOD(NAME, (S_IFLNK|S_IRWXUGO),\t\t\t\t\\\n\t\t&proc_pid_link_inode_operations, NULL,\t\t\\\n\t\t{ .proc_get_link = get_link } )\n#define REG(NAME, MODE, fops)\t\t\t\t\\\n\tNOD(NAME, (S_IFREG|(MODE)), NULL, &fops, {})\n#define INF(NAME, MODE, read)\t\t\t\t\\\n\tNOD(NAME, (S_IFREG|(MODE)), \t\t\t\\\n\t\tNULL, &proc_info_file_operations,\t\\\n\t\t{ .proc_read = read } )\n#define ONE(NAME, MODE, show)\t\t\t\t\\\n\tNOD(NAME, (S_IFREG|(MODE)), \t\t\t\\\n\t\tNULL, &proc_single_file_operations,\t\\\n\t\t{ .proc_show = show } )","/*\n * Count the number of hardlinks for the pid_entry table, excluding the .\n * and .. links.\n */\nstatic unsigned int pid_entry_count_dirs(const struct pid_entry *entries,\n\tunsigned int n)\n{\n\tunsigned int i;\n\tunsigned int count;","\tcount = 0;\n\tfor (i = 0; i < n; ++i) {\n\t\tif (S_ISDIR(entries[i].mode))\n\t\t\t++count;\n\t}","\treturn count;\n}","static int get_task_root(struct task_struct *task, struct path *root)\n{\n\tint result = -ENOENT;","\ttask_lock(task);\n\tif (task->fs) {\n\t\tget_fs_root(task->fs, root);\n\t\tresult = 0;\n\t}\n\ttask_unlock(task);\n\treturn result;\n}","static int proc_cwd_link(struct inode *inode, struct path *path)\n{\n\tstruct task_struct *task = get_proc_task(inode);\n\tint result = -ENOENT;","\tif (task) {\n\t\ttask_lock(task);\n\t\tif (task->fs) {\n\t\t\tget_fs_pwd(task->fs, path);\n\t\t\tresult = 0;\n\t\t}\n\t\ttask_unlock(task);\n\t\tput_task_struct(task);\n\t}\n\treturn result;\n}","static int proc_root_link(struct inode *inode, struct path *path)\n{\n\tstruct task_struct *task = get_proc_task(inode);\n\tint result = -ENOENT;","\tif (task) {\n\t\tresult = get_task_root(task, path);\n\t\tput_task_struct(task);\n\t}\n\treturn result;\n}","static struct mm_struct *__check_mem_permission(struct task_struct *task)\n{\n\tstruct mm_struct *mm;","\tmm = get_task_mm(task);\n\tif (!mm)\n\t\treturn ERR_PTR(-EINVAL);","\t/*\n\t * A task can always look at itself, in case it chooses\n\t * to use system calls instead of load instructions.\n\t */\n\tif (task == current)\n\t\treturn mm;","\t/*\n\t * If current is actively ptrace'ing, and would also be\n\t * permitted to freshly attach with ptrace now, permit it.\n\t */\n\tif (task_is_stopped_or_traced(task)) {\n\t\tint match;\n\t\trcu_read_lock();\n\t\tmatch = (tracehook_tracer_task(task) == current);\n\t\trcu_read_unlock();\n\t\tif (match && ptrace_may_access(task, PTRACE_MODE_ATTACH))\n\t\t\treturn mm;\n\t}","\t/*\n\t * No one else is allowed.\n\t */\n\tmmput(mm);\n\treturn ERR_PTR(-EPERM);\n}","/*\n * If current may access user memory in @task return a reference to the\n * corresponding mm, otherwise ERR_PTR.\n */\nstatic struct mm_struct *check_mem_permission(struct task_struct *task)\n{\n\tstruct mm_struct *mm;\n\tint err;","\t/*\n\t * Avoid racing if task exec's as we might get a new mm but validate\n\t * against old credentials.\n\t */\n\terr = mutex_lock_killable(&task->signal->cred_guard_mutex);\n\tif (err)\n\t\treturn ERR_PTR(err);","\tmm = __check_mem_permission(task);\n\tmutex_unlock(&task->signal->cred_guard_mutex);","\treturn mm;\n}","struct mm_struct *mm_for_maps(struct task_struct *task)\n{\n\tstruct mm_struct *mm;\n\tint err;","\terr = mutex_lock_killable(&task->signal->cred_guard_mutex);\n\tif (err)\n\t\treturn ERR_PTR(err);","\tmm = get_task_mm(task);\n\tif (mm && mm != current->mm &&\n\t\t\t!ptrace_may_access(task, PTRACE_MODE_READ)) {\n\t\tmmput(mm);\n\t\tmm = ERR_PTR(-EACCES);\n\t}\n\tmutex_unlock(&task->signal->cred_guard_mutex);","\treturn mm;\n}","static int proc_pid_cmdline(struct task_struct *task, char * buffer)\n{\n\tint res = 0;\n\tunsigned int len;\n\tstruct mm_struct *mm = get_task_mm(task);\n\tif (!mm)\n\t\tgoto out;\n\tif (!mm->arg_end)\n\t\tgoto out_mm;\t/* Shh! No looking before we're done */"," \tlen = mm->arg_end - mm->arg_start;\n \n\tif (len > PAGE_SIZE)\n\t\tlen = PAGE_SIZE;\n \n\tres = access_process_vm(task, mm->arg_start, buffer, len, 0);","\t// If the nul at the end of args has been overwritten, then\n\t// assume application is using setproctitle(3).\n\tif (res > 0 && buffer[res-1] != '\\0' && len < PAGE_SIZE) {\n\t\tlen = strnlen(buffer, res);\n\t\tif (len < res) {\n\t\t res = len;\n\t\t} else {\n\t\t\tlen = mm->env_end - mm->env_start;\n\t\t\tif (len > PAGE_SIZE - res)\n\t\t\t\tlen = PAGE_SIZE - res;\n\t\t\tres += access_process_vm(task, mm->env_start, buffer+res, len, 0);\n\t\t\tres = strnlen(buffer, res);\n\t\t}\n\t}\nout_mm:\n\tmmput(mm);\nout:\n\treturn res;\n}","static int proc_pid_auxv(struct task_struct *task, char *buffer)\n{\n\tstruct mm_struct *mm = mm_for_maps(task);\n\tint res = PTR_ERR(mm);\n\tif (mm && !IS_ERR(mm)) {\n\t\tunsigned int nwords = 0;\n\t\tdo {\n\t\t\tnwords += 2;\n\t\t} while (mm->saved_auxv[nwords - 2] != 0); /* AT_NULL */\n\t\tres = nwords * sizeof(mm->saved_auxv[0]);\n\t\tif (res > PAGE_SIZE)\n\t\t\tres = PAGE_SIZE;\n\t\tmemcpy(buffer, mm->saved_auxv, res);\n\t\tmmput(mm);\n\t}\n\treturn res;\n}","\n#ifdef CONFIG_KALLSYMS\n/*\n * Provides a wchan file via kallsyms in a proper one-value-per-file format.\n * Returns the resolved symbol. If that fails, simply return the address.\n */\nstatic int proc_pid_wchan(struct task_struct *task, char *buffer)\n{\n\tunsigned long wchan;\n\tchar symname[KSYM_NAME_LEN];","\twchan = get_wchan(task);","\tif (lookup_symbol_name(wchan, symname) < 0)\n\t\tif (!ptrace_may_access(task, PTRACE_MODE_READ))\n\t\t\treturn 0;\n\t\telse\n\t\t\treturn sprintf(buffer, \"%lu\", wchan);\n\telse\n\t\treturn sprintf(buffer, \"%s\", symname);\n}\n#endif /* CONFIG_KALLSYMS */","static int lock_trace(struct task_struct *task)\n{\n\tint err = mutex_lock_killable(&task->signal->cred_guard_mutex);\n\tif (err)\n\t\treturn err;\n\tif (!ptrace_may_access(task, PTRACE_MODE_ATTACH)) {\n\t\tmutex_unlock(&task->signal->cred_guard_mutex);\n\t\treturn -EPERM;\n\t}\n\treturn 0;\n}","static void unlock_trace(struct task_struct *task)\n{\n\tmutex_unlock(&task->signal->cred_guard_mutex);\n}","#ifdef CONFIG_STACKTRACE","#define MAX_STACK_TRACE_DEPTH\t64","static int proc_pid_stack(struct seq_file *m, struct pid_namespace *ns,\n\t\t\t struct pid *pid, struct task_struct *task)\n{\n\tstruct stack_trace trace;\n\tunsigned long *entries;\n\tint err;\n\tint i;","\tentries = kmalloc(MAX_STACK_TRACE_DEPTH * sizeof(*entries), GFP_KERNEL);\n\tif (!entries)\n\t\treturn -ENOMEM;","\ttrace.nr_entries\t= 0;\n\ttrace.max_entries\t= MAX_STACK_TRACE_DEPTH;\n\ttrace.entries\t\t= entries;\n\ttrace.skip\t\t= 0;","\terr = lock_trace(task);\n\tif (!err) {\n\t\tsave_stack_trace_tsk(task, &trace);","\t\tfor (i = 0; i < trace.nr_entries; i++) {\n\t\t\tseq_printf(m, \"[<%pK>] %pS\\n\",\n\t\t\t\t (void *)entries[i], (void *)entries[i]);\n\t\t}\n\t\tunlock_trace(task);\n\t}\n\tkfree(entries);","\treturn err;\n}\n#endif","#ifdef CONFIG_SCHEDSTATS\n/*\n * Provides /proc/PID/schedstat\n */\nstatic int proc_pid_schedstat(struct task_struct *task, char *buffer)\n{\n\treturn sprintf(buffer, \"%llu %llu %lu\\n\",\n\t\t\t(unsigned long long)task->se.sum_exec_runtime,\n\t\t\t(unsigned long long)task->sched_info.run_delay,\n\t\t\ttask->sched_info.pcount);\n}\n#endif","#ifdef CONFIG_LATENCYTOP\nstatic int lstats_show_proc(struct seq_file *m, void *v)\n{\n\tint i;\n\tstruct inode *inode = m->private;\n\tstruct task_struct *task = get_proc_task(inode);","\tif (!task)\n\t\treturn -ESRCH;\n\tseq_puts(m, \"Latency Top version : v0.1\\n\");\n\tfor (i = 0; i < 32; i++) {\n\t\tstruct latency_record *lr = &task->latency_record[i];\n\t\tif (lr->backtrace[0]) {\n\t\t\tint q;\n\t\t\tseq_printf(m, \"%i %li %li\",\n\t\t\t\t lr->count, lr->time, lr->max);\n\t\t\tfor (q = 0; q < LT_BACKTRACEDEPTH; q++) {\n\t\t\t\tunsigned long bt = lr->backtrace[q];\n\t\t\t\tif (!bt)\n\t\t\t\t\tbreak;\n\t\t\t\tif (bt == ULONG_MAX)\n\t\t\t\t\tbreak;\n\t\t\t\tseq_printf(m, \" %ps\", (void *)bt);\n\t\t\t}\n\t\t\tseq_putc(m, '\\n');\n\t\t}","\t}\n\tput_task_struct(task);\n\treturn 0;\n}","static int lstats_open(struct inode *inode, struct file *file)\n{\n\treturn single_open(file, lstats_show_proc, inode);\n}","static ssize_t lstats_write(struct file *file, const char __user *buf,\n\t\t\t size_t count, loff_t *offs)\n{\n\tstruct task_struct *task = get_proc_task(file->f_dentry->d_inode);","\tif (!task)\n\t\treturn -ESRCH;\n\tclear_all_latency_tracing(task);\n\tput_task_struct(task);","\treturn count;\n}","static const struct file_operations proc_lstats_operations = {\n\t.open\t\t= lstats_open,\n\t.read\t\t= seq_read,\n\t.write\t\t= lstats_write,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= single_release,\n};","#endif","static int proc_oom_score(struct task_struct *task, char *buffer)\n{\n\tunsigned long points = 0;","\tread_lock(&tasklist_lock);\n\tif (pid_alive(task))\n\t\tpoints = oom_badness(task, NULL, NULL,\n\t\t\t\t\ttotalram_pages + total_swap_pages);\n\tread_unlock(&tasklist_lock);\n\treturn sprintf(buffer, \"%lu\\n\", points);\n}","struct limit_names {\n\tchar *name;\n\tchar *unit;\n};","static const struct limit_names lnames[RLIM_NLIMITS] = {\n\t[RLIMIT_CPU] = {\"Max cpu time\", \"seconds\"},\n\t[RLIMIT_FSIZE] = {\"Max file size\", \"bytes\"},\n\t[RLIMIT_DATA] = {\"Max data size\", \"bytes\"},\n\t[RLIMIT_STACK] = {\"Max stack size\", \"bytes\"},\n\t[RLIMIT_CORE] = {\"Max core file size\", \"bytes\"},\n\t[RLIMIT_RSS] = {\"Max resident set\", \"bytes\"},\n\t[RLIMIT_NPROC] = {\"Max processes\", \"processes\"},\n\t[RLIMIT_NOFILE] = {\"Max open files\", \"files\"},\n\t[RLIMIT_MEMLOCK] = {\"Max locked memory\", \"bytes\"},\n\t[RLIMIT_AS] = {\"Max address space\", \"bytes\"},\n\t[RLIMIT_LOCKS] = {\"Max file locks\", \"locks\"},\n\t[RLIMIT_SIGPENDING] = {\"Max pending signals\", \"signals\"},\n\t[RLIMIT_MSGQUEUE] = {\"Max msgqueue size\", \"bytes\"},\n\t[RLIMIT_NICE] = {\"Max nice priority\", NULL},\n\t[RLIMIT_RTPRIO] = {\"Max realtime priority\", NULL},\n\t[RLIMIT_RTTIME] = {\"Max realtime timeout\", \"us\"},\n};","/* Display limits for a process */\nstatic int proc_pid_limits(struct task_struct *task, char *buffer)\n{\n\tunsigned int i;\n\tint count = 0;\n\tunsigned long flags;\n\tchar *bufptr = buffer;","\tstruct rlimit rlim[RLIM_NLIMITS];","\tif (!lock_task_sighand(task, &flags))\n\t\treturn 0;\n\tmemcpy(rlim, task->signal->rlim, sizeof(struct rlimit) * RLIM_NLIMITS);\n\tunlock_task_sighand(task, &flags);","\t/*\n\t * print the file header\n\t */\n\tcount += sprintf(&bufptr[count], \"%-25s %-20s %-20s %-10s\\n\",\n\t\t\t\"Limit\", \"Soft Limit\", \"Hard Limit\", \"Units\");","\tfor (i = 0; i < RLIM_NLIMITS; i++) {\n\t\tif (rlim[i].rlim_cur == RLIM_INFINITY)\n\t\t\tcount += sprintf(&bufptr[count], \"%-25s %-20s \",\n\t\t\t\t\t lnames[i].name, \"unlimited\");\n\t\telse\n\t\t\tcount += sprintf(&bufptr[count], \"%-25s %-20lu \",\n\t\t\t\t\t lnames[i].name, rlim[i].rlim_cur);","\t\tif (rlim[i].rlim_max == RLIM_INFINITY)\n\t\t\tcount += sprintf(&bufptr[count], \"%-20s \", \"unlimited\");\n\t\telse\n\t\t\tcount += sprintf(&bufptr[count], \"%-20lu \",\n\t\t\t\t\t rlim[i].rlim_max);","\t\tif (lnames[i].unit)\n\t\t\tcount += sprintf(&bufptr[count], \"%-10s\\n\",\n\t\t\t\t\t lnames[i].unit);\n\t\telse\n\t\t\tcount += sprintf(&bufptr[count], \"\\n\");\n\t}","\treturn count;\n}","#ifdef CONFIG_HAVE_ARCH_TRACEHOOK\nstatic int proc_pid_syscall(struct task_struct *task, char *buffer)\n{\n\tlong nr;\n\tunsigned long args[6], sp, pc;\n\tint res = lock_trace(task);\n\tif (res)\n\t\treturn res;","\tif (task_current_syscall(task, &nr, args, 6, &sp, &pc))\n\t\tres = sprintf(buffer, \"running\\n\");\n\telse if (nr < 0)\n\t\tres = sprintf(buffer, \"%ld 0x%lx 0x%lx\\n\", nr, sp, pc);\n\telse\n\t\tres = sprintf(buffer,\n\t\t \"%ld 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx\\n\",\n\t\t nr,\n\t\t args[0], args[1], args[2], args[3], args[4], args[5],\n\t\t sp, pc);\n\tunlock_trace(task);\n\treturn res;\n}\n#endif /* CONFIG_HAVE_ARCH_TRACEHOOK */","/************************************************************************/\n/* Here the fs part begins */\n/************************************************************************/","/* permission checks */\nstatic int proc_fd_access_allowed(struct inode *inode)\n{\n\tstruct task_struct *task;\n\tint allowed = 0;\n\t/* Allow access to a task's file descriptors if it is us or we\n\t * may use ptrace attach to the process and find out that\n\t * information.\n\t */\n\ttask = get_proc_task(inode);\n\tif (task) {\n\t\tallowed = ptrace_may_access(task, PTRACE_MODE_READ);\n\t\tput_task_struct(task);\n\t}\n\treturn allowed;\n}","int proc_setattr(struct dentry *dentry, struct iattr *attr)\n{\n\tint error;\n\tstruct inode *inode = dentry->d_inode;","\tif (attr->ia_valid & ATTR_MODE)\n\t\treturn -EPERM;","\terror = inode_change_ok(inode, attr);\n\tif (error)\n\t\treturn error;","\tif ((attr->ia_valid & ATTR_SIZE) &&\n\t attr->ia_size != i_size_read(inode)) {\n\t\terror = vmtruncate(inode, attr->ia_size);\n\t\tif (error)\n\t\t\treturn error;\n\t}","\tsetattr_copy(inode, attr);\n\tmark_inode_dirty(inode);\n\treturn 0;\n}","static const struct inode_operations proc_def_inode_operations = {\n\t.setattr\t= proc_setattr,\n};","static int mounts_open_common(struct inode *inode, struct file *file,\n\t\t\t const struct seq_operations *op)\n{\n\tstruct task_struct *task = get_proc_task(inode);\n\tstruct nsproxy *nsp;\n\tstruct mnt_namespace *ns = NULL;\n\tstruct path root;\n\tstruct proc_mounts *p;\n\tint ret = -EINVAL;","\tif (task) {\n\t\trcu_read_lock();\n\t\tnsp = task_nsproxy(task);\n\t\tif (nsp) {\n\t\t\tns = nsp->mnt_ns;\n\t\t\tif (ns)\n\t\t\t\tget_mnt_ns(ns);\n\t\t}\n\t\trcu_read_unlock();\n\t\tif (ns && get_task_root(task, &root) == 0)\n\t\t\tret = 0;\n\t\tput_task_struct(task);\n\t}","\tif (!ns)\n\t\tgoto err;\n\tif (ret)\n\t\tgoto err_put_ns;","\tret = -ENOMEM;\n\tp = kmalloc(sizeof(struct proc_mounts), GFP_KERNEL);\n\tif (!p)\n\t\tgoto err_put_path;","\tfile->private_data = &p->m;\n\tret = seq_open(file, op);\n\tif (ret)\n\t\tgoto err_free;","\tp->m.private = p;\n\tp->ns = ns;\n\tp->root = root;\n\tp->event = ns->event;","\treturn 0;"," err_free:\n\tkfree(p);\n err_put_path:\n\tpath_put(&root);\n err_put_ns:\n\tput_mnt_ns(ns);\n err:\n\treturn ret;\n}","static int mounts_release(struct inode *inode, struct file *file)\n{\n\tstruct proc_mounts *p = file->private_data;\n\tpath_put(&p->root);\n\tput_mnt_ns(p->ns);\n\treturn seq_release(inode, file);\n}","static unsigned mounts_poll(struct file *file, poll_table *wait)\n{\n\tstruct proc_mounts *p = file->private_data;\n\tunsigned res = POLLIN | POLLRDNORM;","\tpoll_wait(file, &p->ns->poll, wait);\n\tif (mnt_had_events(p))\n\t\tres |= POLLERR | POLLPRI;","\treturn res;\n}","static int mounts_open(struct inode *inode, struct file *file)\n{\n\treturn mounts_open_common(inode, file, &mounts_op);\n}","static const struct file_operations proc_mounts_operations = {\n\t.open\t\t= mounts_open,\n\t.read\t\t= seq_read,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= mounts_release,\n\t.poll\t\t= mounts_poll,\n};","static int mountinfo_open(struct inode *inode, struct file *file)\n{\n\treturn mounts_open_common(inode, file, &mountinfo_op);\n}","static const struct file_operations proc_mountinfo_operations = {\n\t.open\t\t= mountinfo_open,\n\t.read\t\t= seq_read,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= mounts_release,\n\t.poll\t\t= mounts_poll,\n};","static int mountstats_open(struct inode *inode, struct file *file)\n{\n\treturn mounts_open_common(inode, file, &mountstats_op);\n}","static const struct file_operations proc_mountstats_operations = {\n\t.open\t\t= mountstats_open,\n\t.read\t\t= seq_read,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= mounts_release,\n};","#define PROC_BLOCK_SIZE\t(3*1024)\t\t/* 4K page size but our output routines use some slack for overruns */","static ssize_t proc_info_read(struct file * file, char __user * buf,\n\t\t\t size_t count, loff_t *ppos)\n{\n\tstruct inode * inode = file->f_path.dentry->d_inode;\n\tunsigned long page;\n\tssize_t length;\n\tstruct task_struct *task = get_proc_task(inode);","\tlength = -ESRCH;\n\tif (!task)\n\t\tgoto out_no_task;","\tif (count > PROC_BLOCK_SIZE)\n\t\tcount = PROC_BLOCK_SIZE;","\tlength = -ENOMEM;\n\tif (!(page = __get_free_page(GFP_TEMPORARY)))\n\t\tgoto out;","\tlength = PROC_I(inode)->op.proc_read(task, (char*)page);","\tif (length >= 0)\n\t\tlength = simple_read_from_buffer(buf, count, ppos, (char *)page, length);\n\tfree_page(page);\nout:\n\tput_task_struct(task);\nout_no_task:\n\treturn length;\n}","static const struct file_operations proc_info_file_operations = {\n\t.read\t\t= proc_info_read,\n\t.llseek\t\t= generic_file_llseek,\n};","static int proc_single_show(struct seq_file *m, void *v)\n{\n\tstruct inode *inode = m->private;\n\tstruct pid_namespace *ns;\n\tstruct pid *pid;\n\tstruct task_struct *task;\n\tint ret;","\tns = inode->i_sb->s_fs_info;\n\tpid = proc_pid(inode);\n\ttask = get_pid_task(pid, PIDTYPE_PID);\n\tif (!task)\n\t\treturn -ESRCH;","\tret = PROC_I(inode)->op.proc_show(m, ns, pid, task);","\tput_task_struct(task);\n\treturn ret;\n}","static int proc_single_open(struct inode *inode, struct file *filp)\n{\n\treturn single_open(filp, proc_single_show, inode);\n}","static const struct file_operations proc_single_file_operations = {\n\t.open\t\t= proc_single_open,\n\t.read\t\t= seq_read,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= single_release,\n};","static int mem_open(struct inode* inode, struct file* file)\n{\n\tfile->private_data = (void*)((long)current->self_exec_id);\n\t/* OK to pass negative loff_t, we can catch out-of-range */\n\tfile->f_mode |= FMODE_UNSIGNED_OFFSET;\n\treturn 0;\n}","static ssize_t mem_read(struct file * file, char __user * buf,\n\t\t\tsize_t count, loff_t *ppos)\n{\n\tstruct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);\n\tchar *page;\n\tunsigned long src = *ppos;\n\tint ret = -ESRCH;\n\tstruct mm_struct *mm;","\tif (!task)\n\t\tgoto out_no_task;","\tret = -ENOMEM;\n\tpage = (char *)__get_free_page(GFP_TEMPORARY);\n\tif (!page)\n\t\tgoto out;","\tmm = check_mem_permission(task);\n\tret = PTR_ERR(mm);\n\tif (IS_ERR(mm))\n\t\tgoto out_free;","\tret = -EIO;\n \n\tif (file->private_data != (void*)((long)current->self_exec_id))\n\t\tgoto out_put;","\tret = 0;\n \n\twhile (count > 0) {\n\t\tint this_len, retval;","\t\tthis_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;\n\t\tretval = access_remote_vm(mm, src, page, this_len, 0);\n\t\tif (!retval) {\n\t\t\tif (!ret)\n\t\t\t\tret = -EIO;\n\t\t\tbreak;\n\t\t}","\t\tif (copy_to_user(buf, page, retval)) {\n\t\t\tret = -EFAULT;\n\t\t\tbreak;\n\t\t}\n \n\t\tret += retval;\n\t\tsrc += retval;\n\t\tbuf += retval;\n\t\tcount -= retval;\n\t}\n\t*ppos = src;","out_put:\n\tmmput(mm);\nout_free:\n\tfree_page((unsigned long) page);\nout:\n\tput_task_struct(task);\nout_no_task:\n\treturn ret;\n}","static ssize_t mem_write(struct file * file, const char __user *buf,\n\t\t\t size_t count, loff_t *ppos)\n{\n\tint copied;\n\tchar *page;\n\tstruct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);\n\tunsigned long dst = *ppos;\n\tstruct mm_struct *mm;","\tcopied = -ESRCH;\n\tif (!task)\n\t\tgoto out_no_task;","\tcopied = -ENOMEM;\n\tpage = (char *)__get_free_page(GFP_TEMPORARY);\n\tif (!page)\n\t\tgoto out_task;","\tmm = check_mem_permission(task);\n\tcopied = PTR_ERR(mm);\n\tif (IS_ERR(mm))\n\t\tgoto out_free;","\tcopied = -EIO;\n\tif (file->private_data != (void *)((long)current->self_exec_id))\n\t\tgoto out_mm;","\tcopied = 0;\n\twhile (count > 0) {\n\t\tint this_len, retval;","\t\tthis_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;\n\t\tif (copy_from_user(page, buf, this_len)) {\n\t\t\tcopied = -EFAULT;\n\t\t\tbreak;\n\t\t}\n\t\tretval = access_remote_vm(mm, dst, page, this_len, 1);\n\t\tif (!retval) {\n\t\t\tif (!copied)\n\t\t\t\tcopied = -EIO;\n\t\t\tbreak;\n\t\t}\n\t\tcopied += retval;\n\t\tbuf += retval;\n\t\tdst += retval;\n\t\tcount -= retval;\t\t\t\n\t}\n\t*ppos = dst;","out_mm:\n\tmmput(mm);\nout_free:\n\tfree_page((unsigned long) page);\nout_task:\n\tput_task_struct(task);\nout_no_task:\n\treturn copied;\n}","loff_t mem_lseek(struct file *file, loff_t offset, int orig)\n{\n\tswitch (orig) {\n\tcase 0:\n\t\tfile->f_pos = offset;\n\t\tbreak;\n\tcase 1:\n\t\tfile->f_pos += offset;\n\t\tbreak;\n\tdefault:\n\t\treturn -EINVAL;\n\t}\n\tforce_successful_syscall_return();\n\treturn file->f_pos;\n}","static const struct file_operations proc_mem_operations = {\n\t.llseek\t\t= mem_lseek,\n\t.read\t\t= mem_read,\n\t.write\t\t= mem_write,\n\t.open\t\t= mem_open,\n};","static ssize_t environ_read(struct file *file, char __user *buf,\n\t\t\tsize_t count, loff_t *ppos)\n{\n\tstruct task_struct *task = get_proc_task(file->f_dentry->d_inode);\n\tchar *page;\n\tunsigned long src = *ppos;\n\tint ret = -ESRCH;\n\tstruct mm_struct *mm;","\tif (!task)\n\t\tgoto out_no_task;","\tret = -ENOMEM;\n\tpage = (char *)__get_free_page(GFP_TEMPORARY);\n\tif (!page)\n\t\tgoto out;","\n\tmm = mm_for_maps(task);\n\tret = PTR_ERR(mm);\n\tif (!mm || IS_ERR(mm))\n\t\tgoto out_free;","\tret = 0;\n\twhile (count > 0) {\n\t\tint this_len, retval, max_len;","\t\tthis_len = mm->env_end - (mm->env_start + src);","\t\tif (this_len <= 0)\n\t\t\tbreak;","\t\tmax_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;\n\t\tthis_len = (this_len > max_len) ? max_len : this_len;","\t\tretval = access_process_vm(task, (mm->env_start + src),\n\t\t\tpage, this_len, 0);","\t\tif (retval <= 0) {\n\t\t\tret = retval;\n\t\t\tbreak;\n\t\t}","\t\tif (copy_to_user(buf, page, retval)) {\n\t\t\tret = -EFAULT;\n\t\t\tbreak;\n\t\t}","\t\tret += retval;\n\t\tsrc += retval;\n\t\tbuf += retval;\n\t\tcount -= retval;\n\t}\n\t*ppos = src;","\tmmput(mm);\nout_free:\n\tfree_page((unsigned long) page);\nout:\n\tput_task_struct(task);\nout_no_task:\n\treturn ret;\n}","static const struct file_operations proc_environ_operations = {\n\t.read\t\t= environ_read,\n\t.llseek\t\t= generic_file_llseek,\n};","static ssize_t oom_adjust_read(struct file *file, char __user *buf,\n\t\t\t\tsize_t count, loff_t *ppos)\n{\n\tstruct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);\n\tchar buffer[PROC_NUMBUF];\n\tsize_t len;\n\tint oom_adjust = OOM_DISABLE;\n\tunsigned long flags;","\tif (!task)\n\t\treturn -ESRCH;","\tif (lock_task_sighand(task, &flags)) {\n\t\toom_adjust = task->signal->oom_adj;\n\t\tunlock_task_sighand(task, &flags);\n\t}","\tput_task_struct(task);","\tlen = snprintf(buffer, sizeof(buffer), \"%i\\n\", oom_adjust);","\treturn simple_read_from_buffer(buf, count, ppos, buffer, len);\n}","static ssize_t oom_adjust_write(struct file *file, const char __user *buf,\n\t\t\t\tsize_t count, loff_t *ppos)\n{\n\tstruct task_struct *task;\n\tchar buffer[PROC_NUMBUF];\n\tint oom_adjust;\n\tunsigned long flags;\n\tint err;","\tmemset(buffer, 0, sizeof(buffer));\n\tif (count > sizeof(buffer) - 1)\n\t\tcount = sizeof(buffer) - 1;\n\tif (copy_from_user(buffer, buf, count)) {\n\t\terr = -EFAULT;\n\t\tgoto out;\n\t}","\terr = kstrtoint(strstrip(buffer), 0, &oom_adjust);\n\tif (err)\n\t\tgoto out;\n\tif ((oom_adjust < OOM_ADJUST_MIN || oom_adjust > OOM_ADJUST_MAX) &&\n\t oom_adjust != OOM_DISABLE) {\n\t\terr = -EINVAL;\n\t\tgoto out;\n\t}","\ttask = get_proc_task(file->f_path.dentry->d_inode);\n\tif (!task) {\n\t\terr = -ESRCH;\n\t\tgoto out;\n\t}","\ttask_lock(task);\n\tif (!task->mm) {\n\t\terr = -EINVAL;\n\t\tgoto err_task_lock;\n\t}","\tif (!lock_task_sighand(task, &flags)) {\n\t\terr = -ESRCH;\n\t\tgoto err_task_lock;\n\t}","\tif (oom_adjust < task->signal->oom_adj && !capable(CAP_SYS_RESOURCE)) {\n\t\terr = -EACCES;\n\t\tgoto err_sighand;\n\t}","\tif (oom_adjust != task->signal->oom_adj) {\n\t\tif (oom_adjust == OOM_DISABLE)\n\t\t\tatomic_inc(&task->mm->oom_disable_count);\n\t\tif (task->signal->oom_adj == OOM_DISABLE)\n\t\t\tatomic_dec(&task->mm->oom_disable_count);\n\t}","\t/*\n\t * Warn that /proc/pid/oom_adj is deprecated, see\n\t * Documentation/feature-removal-schedule.txt.\n\t */\n\tprintk_once(KERN_WARNING \"%s (%d): /proc/%d/oom_adj is deprecated, \"\n\t\t\t\"please use /proc/%d/oom_score_adj instead.\\n\",\n\t\t\tcurrent->comm, task_pid_nr(current),\n\t\t\ttask_pid_nr(task), task_pid_nr(task));\n\ttask->signal->oom_adj = oom_adjust;\n\t/*\n\t * Scale /proc/pid/oom_score_adj appropriately ensuring that a maximum\n\t * value is always attainable.\n\t */\n\tif (task->signal->oom_adj == OOM_ADJUST_MAX)\n\t\ttask->signal->oom_score_adj = OOM_SCORE_ADJ_MAX;\n\telse\n\t\ttask->signal->oom_score_adj = (oom_adjust * OOM_SCORE_ADJ_MAX) /\n\t\t\t\t\t\t\t\t-OOM_DISABLE;\nerr_sighand:\n\tunlock_task_sighand(task, &flags);\nerr_task_lock:\n\ttask_unlock(task);\n\tput_task_struct(task);\nout:\n\treturn err < 0 ? err : count;\n}","static const struct file_operations proc_oom_adjust_operations = {\n\t.read\t\t= oom_adjust_read,\n\t.write\t\t= oom_adjust_write,\n\t.llseek\t\t= generic_file_llseek,\n};","static ssize_t oom_score_adj_read(struct file *file, char __user *buf,\n\t\t\t\t\tsize_t count, loff_t *ppos)\n{\n\tstruct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);\n\tchar buffer[PROC_NUMBUF];\n\tint oom_score_adj = OOM_SCORE_ADJ_MIN;\n\tunsigned long flags;\n\tsize_t len;","\tif (!task)\n\t\treturn -ESRCH;\n\tif (lock_task_sighand(task, &flags)) {\n\t\toom_score_adj = task->signal->oom_score_adj;\n\t\tunlock_task_sighand(task, &flags);\n\t}\n\tput_task_struct(task);\n\tlen = snprintf(buffer, sizeof(buffer), \"%d\\n\", oom_score_adj);\n\treturn simple_read_from_buffer(buf, count, ppos, buffer, len);\n}","static ssize_t oom_score_adj_write(struct file *file, const char __user *buf,\n\t\t\t\t\tsize_t count, loff_t *ppos)\n{\n\tstruct task_struct *task;\n\tchar buffer[PROC_NUMBUF];\n\tunsigned long flags;\n\tint oom_score_adj;\n\tint err;","\tmemset(buffer, 0, sizeof(buffer));\n\tif (count > sizeof(buffer) - 1)\n\t\tcount = sizeof(buffer) - 1;\n\tif (copy_from_user(buffer, buf, count)) {\n\t\terr = -EFAULT;\n\t\tgoto out;\n\t}","\terr = kstrtoint(strstrip(buffer), 0, &oom_score_adj);\n\tif (err)\n\t\tgoto out;\n\tif (oom_score_adj < OOM_SCORE_ADJ_MIN ||\n\t\t\toom_score_adj > OOM_SCORE_ADJ_MAX) {\n\t\terr = -EINVAL;\n\t\tgoto out;\n\t}","\ttask = get_proc_task(file->f_path.dentry->d_inode);\n\tif (!task) {\n\t\terr = -ESRCH;\n\t\tgoto out;\n\t}","\ttask_lock(task);\n\tif (!task->mm) {\n\t\terr = -EINVAL;\n\t\tgoto err_task_lock;\n\t}","\tif (!lock_task_sighand(task, &flags)) {\n\t\terr = -ESRCH;\n\t\tgoto err_task_lock;\n\t}","\tif (oom_score_adj < task->signal->oom_score_adj_min &&\n\t\t\t!capable(CAP_SYS_RESOURCE)) {\n\t\terr = -EACCES;\n\t\tgoto err_sighand;\n\t}","\tif (oom_score_adj != task->signal->oom_score_adj) {\n\t\tif (oom_score_adj == OOM_SCORE_ADJ_MIN)\n\t\t\tatomic_inc(&task->mm->oom_disable_count);\n\t\tif (task->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)\n\t\t\tatomic_dec(&task->mm->oom_disable_count);\n\t}\n\ttask->signal->oom_score_adj = oom_score_adj;\n\tif (has_capability_noaudit(current, CAP_SYS_RESOURCE))\n\t\ttask->signal->oom_score_adj_min = oom_score_adj;\n\t/*\n\t * Scale /proc/pid/oom_adj appropriately ensuring that OOM_DISABLE is\n\t * always attainable.\n\t */\n\tif (task->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)\n\t\ttask->signal->oom_adj = OOM_DISABLE;\n\telse\n\t\ttask->signal->oom_adj = (oom_score_adj * OOM_ADJUST_MAX) /\n\t\t\t\t\t\t\tOOM_SCORE_ADJ_MAX;\nerr_sighand:\n\tunlock_task_sighand(task, &flags);\nerr_task_lock:\n\ttask_unlock(task);\n\tput_task_struct(task);\nout:\n\treturn err < 0 ? err : count;\n}","static const struct file_operations proc_oom_score_adj_operations = {\n\t.read\t\t= oom_score_adj_read,\n\t.write\t\t= oom_score_adj_write,\n\t.llseek\t\t= default_llseek,\n};","#ifdef CONFIG_AUDITSYSCALL\n#define TMPBUFLEN 21\nstatic ssize_t proc_loginuid_read(struct file * file, char __user * buf,\n\t\t\t\t size_t count, loff_t *ppos)\n{\n\tstruct inode * inode = file->f_path.dentry->d_inode;\n\tstruct task_struct *task = get_proc_task(inode);\n\tssize_t length;\n\tchar tmpbuf[TMPBUFLEN];","\tif (!task)\n\t\treturn -ESRCH;\n\tlength = scnprintf(tmpbuf, TMPBUFLEN, \"%u\",\n\t\t\t\taudit_get_loginuid(task));\n\tput_task_struct(task);\n\treturn simple_read_from_buffer(buf, count, ppos, tmpbuf, length);\n}","static ssize_t proc_loginuid_write(struct file * file, const char __user * buf,\n\t\t\t\t size_t count, loff_t *ppos)\n{\n\tstruct inode * inode = file->f_path.dentry->d_inode;\n\tchar *page, *tmp;\n\tssize_t length;\n\tuid_t loginuid;","\tif (!capable(CAP_AUDIT_CONTROL))\n\t\treturn -EPERM;","\trcu_read_lock();\n\tif (current != pid_task(proc_pid(inode), PIDTYPE_PID)) {\n\t\trcu_read_unlock();\n\t\treturn -EPERM;\n\t}\n\trcu_read_unlock();","\tif (count >= PAGE_SIZE)\n\t\tcount = PAGE_SIZE - 1;","\tif (*ppos != 0) {\n\t\t/* No partial writes. */\n\t\treturn -EINVAL;\n\t}\n\tpage = (char*)__get_free_page(GFP_TEMPORARY);\n\tif (!page)\n\t\treturn -ENOMEM;\n\tlength = -EFAULT;\n\tif (copy_from_user(page, buf, count))\n\t\tgoto out_free_page;","\tpage[count] = '\\0';\n\tloginuid = simple_strtoul(page, &tmp, 10);\n\tif (tmp == page) {\n\t\tlength = -EINVAL;\n\t\tgoto out_free_page;","\t}\n\tlength = audit_set_loginuid(current, loginuid);\n\tif (likely(length == 0))\n\t\tlength = count;","out_free_page:\n\tfree_page((unsigned long) page);\n\treturn length;\n}","static const struct file_operations proc_loginuid_operations = {\n\t.read\t\t= proc_loginuid_read,\n\t.write\t\t= proc_loginuid_write,\n\t.llseek\t\t= generic_file_llseek,\n};","static ssize_t proc_sessionid_read(struct file * file, char __user * buf,\n\t\t\t\t size_t count, loff_t *ppos)\n{\n\tstruct inode * inode = file->f_path.dentry->d_inode;\n\tstruct task_struct *task = get_proc_task(inode);\n\tssize_t length;\n\tchar tmpbuf[TMPBUFLEN];","\tif (!task)\n\t\treturn -ESRCH;\n\tlength = scnprintf(tmpbuf, TMPBUFLEN, \"%u\",\n\t\t\t\taudit_get_sessionid(task));\n\tput_task_struct(task);\n\treturn simple_read_from_buffer(buf, count, ppos, tmpbuf, length);\n}","static const struct file_operations proc_sessionid_operations = {\n\t.read\t\t= proc_sessionid_read,\n\t.llseek\t\t= generic_file_llseek,\n};\n#endif","#ifdef CONFIG_FAULT_INJECTION\nstatic ssize_t proc_fault_inject_read(struct file * file, char __user * buf,\n\t\t\t\t size_t count, loff_t *ppos)\n{\n\tstruct task_struct *task = get_proc_task(file->f_dentry->d_inode);\n\tchar buffer[PROC_NUMBUF];\n\tsize_t len;\n\tint make_it_fail;","\tif (!task)\n\t\treturn -ESRCH;\n\tmake_it_fail = task->make_it_fail;\n\tput_task_struct(task);","\tlen = snprintf(buffer, sizeof(buffer), \"%i\\n\", make_it_fail);","\treturn simple_read_from_buffer(buf, count, ppos, buffer, len);\n}","static ssize_t proc_fault_inject_write(struct file * file,\n\t\t\tconst char __user * buf, size_t count, loff_t *ppos)\n{\n\tstruct task_struct *task;\n\tchar buffer[PROC_NUMBUF], *end;\n\tint make_it_fail;","\tif (!capable(CAP_SYS_RESOURCE))\n\t\treturn -EPERM;\n\tmemset(buffer, 0, sizeof(buffer));\n\tif (count > sizeof(buffer) - 1)\n\t\tcount = sizeof(buffer) - 1;\n\tif (copy_from_user(buffer, buf, count))\n\t\treturn -EFAULT;\n\tmake_it_fail = simple_strtol(strstrip(buffer), &end, 0);\n\tif (*end)\n\t\treturn -EINVAL;\n\ttask = get_proc_task(file->f_dentry->d_inode);\n\tif (!task)\n\t\treturn -ESRCH;\n\ttask->make_it_fail = make_it_fail;\n\tput_task_struct(task);","\treturn count;\n}","static const struct file_operations proc_fault_inject_operations = {\n\t.read\t\t= proc_fault_inject_read,\n\t.write\t\t= proc_fault_inject_write,\n\t.llseek\t\t= generic_file_llseek,\n};\n#endif","\n#ifdef CONFIG_SCHED_DEBUG\n/*\n * Print out various scheduling related per-task fields:\n */\nstatic int sched_show(struct seq_file *m, void *v)\n{\n\tstruct inode *inode = m->private;\n\tstruct task_struct *p;","\tp = get_proc_task(inode);\n\tif (!p)\n\t\treturn -ESRCH;\n\tproc_sched_show_task(p, m);","\tput_task_struct(p);","\treturn 0;\n}","static ssize_t\nsched_write(struct file *file, const char __user *buf,\n\t size_t count, loff_t *offset)\n{\n\tstruct inode *inode = file->f_path.dentry->d_inode;\n\tstruct task_struct *p;","\tp = get_proc_task(inode);\n\tif (!p)\n\t\treturn -ESRCH;\n\tproc_sched_set_task(p);","\tput_task_struct(p);","\treturn count;\n}","static int sched_open(struct inode *inode, struct file *filp)\n{\n\treturn single_open(filp, sched_show, inode);\n}","static const struct file_operations proc_pid_sched_operations = {\n\t.open\t\t= sched_open,\n\t.read\t\t= seq_read,\n\t.write\t\t= sched_write,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= single_release,\n};","#endif","#ifdef CONFIG_SCHED_AUTOGROUP\n/*\n * Print out autogroup related information:\n */\nstatic int sched_autogroup_show(struct seq_file *m, void *v)\n{\n\tstruct inode *inode = m->private;\n\tstruct task_struct *p;","\tp = get_proc_task(inode);\n\tif (!p)\n\t\treturn -ESRCH;\n\tproc_sched_autogroup_show_task(p, m);","\tput_task_struct(p);","\treturn 0;\n}","static ssize_t\nsched_autogroup_write(struct file *file, const char __user *buf,\n\t size_t count, loff_t *offset)\n{\n\tstruct inode *inode = file->f_path.dentry->d_inode;\n\tstruct task_struct *p;\n\tchar buffer[PROC_NUMBUF];\n\tint nice;\n\tint err;","\tmemset(buffer, 0, sizeof(buffer));\n\tif (count > sizeof(buffer) - 1)\n\t\tcount = sizeof(buffer) - 1;\n\tif (copy_from_user(buffer, buf, count))\n\t\treturn -EFAULT;","\terr = kstrtoint(strstrip(buffer), 0, &nice);\n\tif (err < 0)\n\t\treturn err;","\tp = get_proc_task(inode);\n\tif (!p)\n\t\treturn -ESRCH;","\terr = nice;\n\terr = proc_sched_autogroup_set_nice(p, &err);\n\tif (err)\n\t\tcount = err;","\tput_task_struct(p);","\treturn count;\n}","static int sched_autogroup_open(struct inode *inode, struct file *filp)\n{\n\tint ret;","\tret = single_open(filp, sched_autogroup_show, NULL);\n\tif (!ret) {\n\t\tstruct seq_file *m = filp->private_data;","\t\tm->private = inode;\n\t}\n\treturn ret;\n}","static const struct file_operations proc_pid_sched_autogroup_operations = {\n\t.open\t\t= sched_autogroup_open,\n\t.read\t\t= seq_read,\n\t.write\t\t= sched_autogroup_write,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= single_release,\n};","#endif /* CONFIG_SCHED_AUTOGROUP */","static ssize_t comm_write(struct file *file, const char __user *buf,\n\t\t\t\tsize_t count, loff_t *offset)\n{\n\tstruct inode *inode = file->f_path.dentry->d_inode;\n\tstruct task_struct *p;\n\tchar buffer[TASK_COMM_LEN];","\tmemset(buffer, 0, sizeof(buffer));\n\tif (count > sizeof(buffer) - 1)\n\t\tcount = sizeof(buffer) - 1;\n\tif (copy_from_user(buffer, buf, count))\n\t\treturn -EFAULT;","\tp = get_proc_task(inode);\n\tif (!p)\n\t\treturn -ESRCH;","\tif (same_thread_group(current, p))\n\t\tset_task_comm(p, buffer);\n\telse\n\t\tcount = -EINVAL;","\tput_task_struct(p);","\treturn count;\n}","static int comm_show(struct seq_file *m, void *v)\n{\n\tstruct inode *inode = m->private;\n\tstruct task_struct *p;","\tp = get_proc_task(inode);\n\tif (!p)\n\t\treturn -ESRCH;","\ttask_lock(p);\n\tseq_printf(m, \"%s\\n\", p->comm);\n\ttask_unlock(p);","\tput_task_struct(p);","\treturn 0;\n}","static int comm_open(struct inode *inode, struct file *filp)\n{\n\treturn single_open(filp, comm_show, inode);\n}","static const struct file_operations proc_pid_set_comm_operations = {\n\t.open\t\t= comm_open,\n\t.read\t\t= seq_read,\n\t.write\t\t= comm_write,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= single_release,\n};","static int proc_exe_link(struct inode *inode, struct path *exe_path)\n{\n\tstruct task_struct *task;\n\tstruct mm_struct *mm;\n\tstruct file *exe_file;","\ttask = get_proc_task(inode);\n\tif (!task)\n\t\treturn -ENOENT;\n\tmm = get_task_mm(task);\n\tput_task_struct(task);\n\tif (!mm)\n\t\treturn -ENOENT;\n\texe_file = get_mm_exe_file(mm);\n\tmmput(mm);\n\tif (exe_file) {\n\t\t*exe_path = exe_file->f_path;\n\t\tpath_get(&exe_file->f_path);\n\t\tfput(exe_file);\n\t\treturn 0;\n\t} else\n\t\treturn -ENOENT;\n}","static void *proc_pid_follow_link(struct dentry *dentry, struct nameidata *nd)\n{\n\tstruct inode *inode = dentry->d_inode;\n\tint error = -EACCES;","\t/* We don't need a base pointer in the /proc filesystem */\n\tpath_put(&nd->path);","\t/* Are we allowed to snoop on the tasks file descriptors? */\n\tif (!proc_fd_access_allowed(inode))\n\t\tgoto out;","\terror = PROC_I(inode)->op.proc_get_link(inode, &nd->path);\nout:\n\treturn ERR_PTR(error);\n}","static int do_proc_readlink(struct path *path, char __user *buffer, int buflen)\n{\n\tchar *tmp = (char*)__get_free_page(GFP_TEMPORARY);\n\tchar *pathname;\n\tint len;","\tif (!tmp)\n\t\treturn -ENOMEM;","\tpathname = d_path(path, tmp, PAGE_SIZE);\n\tlen = PTR_ERR(pathname);\n\tif (IS_ERR(pathname))\n\t\tgoto out;\n\tlen = tmp + PAGE_SIZE - 1 - pathname;","\tif (len > buflen)\n\t\tlen = buflen;\n\tif (copy_to_user(buffer, pathname, len))\n\t\tlen = -EFAULT;\n out:\n\tfree_page((unsigned long)tmp);\n\treturn len;\n}","static int proc_pid_readlink(struct dentry * dentry, char __user * buffer, int buflen)\n{\n\tint error = -EACCES;\n\tstruct inode *inode = dentry->d_inode;\n\tstruct path path;","\t/* Are we allowed to snoop on the tasks file descriptors? */\n\tif (!proc_fd_access_allowed(inode))\n\t\tgoto out;","\terror = PROC_I(inode)->op.proc_get_link(inode, &path);\n\tif (error)\n\t\tgoto out;","\terror = do_proc_readlink(&path, buffer, buflen);\n\tpath_put(&path);\nout:\n\treturn error;\n}","static const struct inode_operations proc_pid_link_inode_operations = {\n\t.readlink\t= proc_pid_readlink,\n\t.follow_link\t= proc_pid_follow_link,\n\t.setattr\t= proc_setattr,\n};","\n/* building an inode */","static int task_dumpable(struct task_struct *task)\n{\n\tint dumpable = 0;\n\tstruct mm_struct *mm;","\ttask_lock(task);\n\tmm = task->mm;\n\tif (mm)\n\t\tdumpable = get_dumpable(mm);\n\ttask_unlock(task);\n\tif(dumpable == 1)\n\t\treturn 1;\n\treturn 0;\n}","struct inode *proc_pid_make_inode(struct super_block * sb, struct task_struct *task)\n{\n\tstruct inode * inode;\n\tstruct proc_inode *ei;\n\tconst struct cred *cred;","\t/* We need a new inode */","\tinode = new_inode(sb);\n\tif (!inode)\n\t\tgoto out;","\t/* Common stuff */\n\tei = PROC_I(inode);\n\tinode->i_ino = get_next_ino();\n\tinode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;\n\tinode->i_op = &proc_def_inode_operations;","\t/*\n\t * grab the reference to task.\n\t */\n\tei->pid = get_task_pid(task, PIDTYPE_PID);\n\tif (!ei->pid)\n\t\tgoto out_unlock;","\tif (task_dumpable(task)) {\n\t\trcu_read_lock();\n\t\tcred = __task_cred(task);\n\t\tinode->i_uid = cred->euid;\n\t\tinode->i_gid = cred->egid;\n\t\trcu_read_unlock();\n\t}\n\tsecurity_task_to_inode(task, inode);","out:\n\treturn inode;","out_unlock:\n\tiput(inode);\n\treturn NULL;\n}","int pid_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)\n{\n\tstruct inode *inode = dentry->d_inode;\n\tstruct task_struct *task;\n\tconst struct cred *cred;","\tgeneric_fillattr(inode, stat);","\trcu_read_lock();\n\tstat->uid = 0;\n\tstat->gid = 0;\n\ttask = pid_task(proc_pid(inode), PIDTYPE_PID);\n\tif (task) {\n\t\tif ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||\n\t\t task_dumpable(task)) {\n\t\t\tcred = __task_cred(task);\n\t\t\tstat->uid = cred->euid;\n\t\t\tstat->gid = cred->egid;\n\t\t}\n\t}\n\trcu_read_unlock();\n\treturn 0;\n}","/* dentry stuff */","/*\n *\tExceptional case: normally we are not allowed to unhash a busy\n * directory. In this case, however, we can do it - no aliasing problems\n * due to the way we treat inodes.\n *\n * Rewrite the inode's ownerships here because the owning task may have\n * performed a setuid(), etc.\n *\n * Before the /proc/pid/status file was created the only way to read\n * the effective uid of a /process was to stat /proc/pid. Reading\n * /proc/pid/status is slow enough that procps and other packages\n * kept stating /proc/pid. To keep the rules in /proc simple I have\n * made this apply to all per process world readable and executable\n * directories.\n */\nint pid_revalidate(struct dentry *dentry, struct nameidata *nd)\n{\n\tstruct inode *inode;\n\tstruct task_struct *task;\n\tconst struct cred *cred;","\tif (nd && nd->flags & LOOKUP_RCU)\n\t\treturn -ECHILD;","\tinode = dentry->d_inode;\n\ttask = get_proc_task(inode);","\tif (task) {\n\t\tif ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||\n\t\t task_dumpable(task)) {\n\t\t\trcu_read_lock();\n\t\t\tcred = __task_cred(task);\n\t\t\tinode->i_uid = cred->euid;\n\t\t\tinode->i_gid = cred->egid;\n\t\t\trcu_read_unlock();\n\t\t} else {\n\t\t\tinode->i_uid = 0;\n\t\t\tinode->i_gid = 0;\n\t\t}\n\t\tinode->i_mode &= ~(S_ISUID | S_ISGID);\n\t\tsecurity_task_to_inode(task, inode);\n\t\tput_task_struct(task);\n\t\treturn 1;\n\t}\n\td_drop(dentry);\n\treturn 0;\n}","static int pid_delete_dentry(const struct dentry * dentry)\n{\n\t/* Is the task we represent dead?\n\t * If so, then don't put the dentry on the lru list,\n\t * kill it immediately.\n\t */\n\treturn !proc_pid(dentry->d_inode)->tasks[PIDTYPE_PID].first;\n}","const struct dentry_operations pid_dentry_operations =\n{\n\t.d_revalidate\t= pid_revalidate,\n\t.d_delete\t= pid_delete_dentry,\n};","/* Lookups */","/*\n * Fill a directory entry.\n *\n * If possible create the dcache entry and derive our inode number and\n * file type from dcache entry.\n *\n * Since all of the proc inode numbers are dynamically generated, the inode\n * numbers do not exist until the inode is cache. This means creating the\n * the dcache entry in readdir is necessary to keep the inode numbers\n * reported by readdir in sync with the inode numbers reported\n * by stat.\n */\nint proc_fill_cache(struct file *filp, void *dirent, filldir_t filldir,\n\tconst char *name, int len,\n\tinstantiate_t instantiate, struct task_struct *task, const void *ptr)\n{\n\tstruct dentry *child, *dir = filp->f_path.dentry;\n\tstruct inode *inode;\n\tstruct qstr qname;\n\tino_t ino = 0;\n\tunsigned type = DT_UNKNOWN;","\tqname.name = name;\n\tqname.len = len;\n\tqname.hash = full_name_hash(name, len);","\tchild = d_lookup(dir, &qname);\n\tif (!child) {\n\t\tstruct dentry *new;\n\t\tnew = d_alloc(dir, &qname);\n\t\tif (new) {\n\t\t\tchild = instantiate(dir->d_inode, new, task, ptr);\n\t\t\tif (child)\n\t\t\t\tdput(new);\n\t\t\telse\n\t\t\t\tchild = new;\n\t\t}\n\t}\n\tif (!child || IS_ERR(child) || !child->d_inode)\n\t\tgoto end_instantiate;\n\tinode = child->d_inode;\n\tif (inode) {\n\t\tino = inode->i_ino;\n\t\ttype = inode->i_mode >> 12;\n\t}\n\tdput(child);\nend_instantiate:\n\tif (!ino)\n\t\tino = find_inode_number(dir, &qname);\n\tif (!ino)\n\t\tino = 1;\n\treturn filldir(dirent, name, len, filp->f_pos, ino, type);\n}","static unsigned name_to_int(struct dentry *dentry)\n{\n\tconst char *name = dentry->d_name.name;\n\tint len = dentry->d_name.len;\n\tunsigned n = 0;","\tif (len > 1 && *name == '0')\n\t\tgoto out;\n\twhile (len-- > 0) {\n\t\tunsigned c = *name++ - '0';\n\t\tif (c > 9)\n\t\t\tgoto out;\n\t\tif (n >= (~0U-9)/10)\n\t\t\tgoto out;\n\t\tn *= 10;\n\t\tn += c;\n\t}\n\treturn n;\nout:\n\treturn ~0U;\n}","#define PROC_FDINFO_MAX 64","static int proc_fd_info(struct inode *inode, struct path *path, char *info)\n{\n\tstruct task_struct *task = get_proc_task(inode);\n\tstruct files_struct *files = NULL;\n\tstruct file *file;\n\tint fd = proc_fd(inode);","\tif (task) {\n\t\tfiles = get_files_struct(task);\n\t\tput_task_struct(task);\n\t}\n\tif (files) {\n\t\t/*\n\t\t * We are not taking a ref to the file structure, so we must\n\t\t * hold ->file_lock.\n\t\t */\n\t\tspin_lock(&files->file_lock);\n\t\tfile = fcheck_files(files, fd);\n\t\tif (file) {\n\t\t\tif (path) {\n\t\t\t\t*path = file->f_path;\n\t\t\t\tpath_get(&file->f_path);\n\t\t\t}\n\t\t\tif (info)\n\t\t\t\tsnprintf(info, PROC_FDINFO_MAX,\n\t\t\t\t\t \"pos:\\t%lli\\n\"\n\t\t\t\t\t \"flags:\\t0%o\\n\",\n\t\t\t\t\t (long long) file->f_pos,\n\t\t\t\t\t file->f_flags);\n\t\t\tspin_unlock(&files->file_lock);\n\t\t\tput_files_struct(files);\n\t\t\treturn 0;\n\t\t}\n\t\tspin_unlock(&files->file_lock);\n\t\tput_files_struct(files);\n\t}\n\treturn -ENOENT;\n}","static int proc_fd_link(struct inode *inode, struct path *path)\n{\n\treturn proc_fd_info(inode, path, NULL);\n}","static int tid_fd_revalidate(struct dentry *dentry, struct nameidata *nd)\n{\n\tstruct inode *inode;\n\tstruct task_struct *task;\n\tint fd;\n\tstruct files_struct *files;\n\tconst struct cred *cred;","\tif (nd && nd->flags & LOOKUP_RCU)\n\t\treturn -ECHILD;","\tinode = dentry->d_inode;\n\ttask = get_proc_task(inode);\n\tfd = proc_fd(inode);","\tif (task) {\n\t\tfiles = get_files_struct(task);\n\t\tif (files) {\n\t\t\trcu_read_lock();\n\t\t\tif (fcheck_files(files, fd)) {\n\t\t\t\trcu_read_unlock();\n\t\t\t\tput_files_struct(files);\n\t\t\t\tif (task_dumpable(task)) {\n\t\t\t\t\trcu_read_lock();\n\t\t\t\t\tcred = __task_cred(task);\n\t\t\t\t\tinode->i_uid = cred->euid;\n\t\t\t\t\tinode->i_gid = cred->egid;\n\t\t\t\t\trcu_read_unlock();\n\t\t\t\t} else {\n\t\t\t\t\tinode->i_uid = 0;\n\t\t\t\t\tinode->i_gid = 0;\n\t\t\t\t}\n\t\t\t\tinode->i_mode &= ~(S_ISUID | S_ISGID);\n\t\t\t\tsecurity_task_to_inode(task, inode);\n\t\t\t\tput_task_struct(task);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\trcu_read_unlock();\n\t\t\tput_files_struct(files);\n\t\t}\n\t\tput_task_struct(task);\n\t}\n\td_drop(dentry);\n\treturn 0;\n}","static const struct dentry_operations tid_fd_dentry_operations =\n{\n\t.d_revalidate\t= tid_fd_revalidate,\n\t.d_delete\t= pid_delete_dentry,\n};","static struct dentry *proc_fd_instantiate(struct inode *dir,\n\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\n{\n\tunsigned fd = *(const unsigned *)ptr;\n\tstruct file *file;\n\tstruct files_struct *files;\n \tstruct inode *inode;\n \tstruct proc_inode *ei;\n\tstruct dentry *error = ERR_PTR(-ENOENT);","\tinode = proc_pid_make_inode(dir->i_sb, task);\n\tif (!inode)\n\t\tgoto out;\n\tei = PROC_I(inode);\n\tei->fd = fd;\n\tfiles = get_files_struct(task);\n\tif (!files)\n\t\tgoto out_iput;\n\tinode->i_mode = S_IFLNK;","\t/*\n\t * We are not taking a ref to the file structure, so we must\n\t * hold ->file_lock.\n\t */\n\tspin_lock(&files->file_lock);\n\tfile = fcheck_files(files, fd);\n\tif (!file)\n\t\tgoto out_unlock;\n\tif (file->f_mode & FMODE_READ)\n\t\tinode->i_mode |= S_IRUSR | S_IXUSR;\n\tif (file->f_mode & FMODE_WRITE)\n\t\tinode->i_mode |= S_IWUSR | S_IXUSR;\n\tspin_unlock(&files->file_lock);\n\tput_files_struct(files);","\tinode->i_op = &proc_pid_link_inode_operations;\n\tinode->i_size = 64;\n\tei->op.proc_get_link = proc_fd_link;\n\td_set_d_op(dentry, &tid_fd_dentry_operations);\n\td_add(dentry, inode);\n\t/* Close the race of the process dying before we return the dentry */\n\tif (tid_fd_revalidate(dentry, NULL))\n\t\terror = NULL;"," out:\n\treturn error;\nout_unlock:\n\tspin_unlock(&files->file_lock);\n\tput_files_struct(files);\nout_iput:\n\tiput(inode);\n\tgoto out;\n}","static struct dentry *proc_lookupfd_common(struct inode *dir,\n\t\t\t\t\t struct dentry *dentry,\n\t\t\t\t\t instantiate_t instantiate)\n{\n\tstruct task_struct *task = get_proc_task(dir);\n\tunsigned fd = name_to_int(dentry);\n\tstruct dentry *result = ERR_PTR(-ENOENT);","\tif (!task)\n\t\tgoto out_no_task;\n\tif (fd == ~0U)\n\t\tgoto out;","\tresult = instantiate(dir, dentry, task, &fd);\nout:\n\tput_task_struct(task);\nout_no_task:\n\treturn result;\n}","static int proc_readfd_common(struct file * filp, void * dirent,\n\t\t\t filldir_t filldir, instantiate_t instantiate)\n{\n\tstruct dentry *dentry = filp->f_path.dentry;\n\tstruct inode *inode = dentry->d_inode;\n\tstruct task_struct *p = get_proc_task(inode);\n\tunsigned int fd, ino;\n\tint retval;\n\tstruct files_struct * files;","\tretval = -ENOENT;\n\tif (!p)\n\t\tgoto out_no_task;\n\tretval = 0;","\tfd = filp->f_pos;\n\tswitch (fd) {\n\t\tcase 0:\n\t\t\tif (filldir(dirent, \".\", 1, 0, inode->i_ino, DT_DIR) < 0)\n\t\t\t\tgoto out;\n\t\t\tfilp->f_pos++;\n\t\tcase 1:\n\t\t\tino = parent_ino(dentry);\n\t\t\tif (filldir(dirent, \"..\", 2, 1, ino, DT_DIR) < 0)\n\t\t\t\tgoto out;\n\t\t\tfilp->f_pos++;\n\t\tdefault:\n\t\t\tfiles = get_files_struct(p);\n\t\t\tif (!files)\n\t\t\t\tgoto out;\n\t\t\trcu_read_lock();\n\t\t\tfor (fd = filp->f_pos-2;\n\t\t\t fd < files_fdtable(files)->max_fds;\n\t\t\t fd++, filp->f_pos++) {\n\t\t\t\tchar name[PROC_NUMBUF];\n\t\t\t\tint len;","\t\t\t\tif (!fcheck_files(files, fd))\n\t\t\t\t\tcontinue;\n\t\t\t\trcu_read_unlock();","\t\t\t\tlen = snprintf(name, sizeof(name), \"%d\", fd);\n\t\t\t\tif (proc_fill_cache(filp, dirent, filldir,\n\t\t\t\t\t\t name, len, instantiate,\n\t\t\t\t\t\t p, &fd) < 0) {\n\t\t\t\t\trcu_read_lock();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\trcu_read_lock();\n\t\t\t}\n\t\t\trcu_read_unlock();\n\t\t\tput_files_struct(files);\n\t}\nout:\n\tput_task_struct(p);\nout_no_task:\n\treturn retval;\n}","static struct dentry *proc_lookupfd(struct inode *dir, struct dentry *dentry,\n\t\t\t\t struct nameidata *nd)\n{\n\treturn proc_lookupfd_common(dir, dentry, proc_fd_instantiate);\n}","static int proc_readfd(struct file *filp, void *dirent, filldir_t filldir)\n{\n\treturn proc_readfd_common(filp, dirent, filldir, proc_fd_instantiate);\n}","static ssize_t proc_fdinfo_read(struct file *file, char __user *buf,\n\t\t\t\t size_t len, loff_t *ppos)\n{\n\tchar tmp[PROC_FDINFO_MAX];\n\tint err = proc_fd_info(file->f_path.dentry->d_inode, NULL, tmp);\n\tif (!err)\n\t\terr = simple_read_from_buffer(buf, len, ppos, tmp, strlen(tmp));\n\treturn err;\n}","static const struct file_operations proc_fdinfo_file_operations = {\n\t.open = nonseekable_open,\n\t.read\t\t= proc_fdinfo_read,\n\t.llseek\t\t= no_llseek,\n};","static const struct file_operations proc_fd_operations = {\n\t.read\t\t= generic_read_dir,\n\t.readdir\t= proc_readfd,\n\t.llseek\t\t= default_llseek,\n};","/*\n * /proc/pid/fd needs a special permission handler so that a process can still\n * access /proc/self/fd after it has executed a setuid().\n */\nstatic int proc_fd_permission(struct inode *inode, int mask, unsigned int flags)\n{\n\tint rv = generic_permission(inode, mask, flags, NULL);\n\tif (rv == 0)\n\t\treturn 0;\n\tif (task_pid(current) == proc_pid(inode))\n\t\trv = 0;\n\treturn rv;\n}","/*\n * proc directories can do almost nothing..\n */\nstatic const struct inode_operations proc_fd_inode_operations = {\n\t.lookup\t\t= proc_lookupfd,\n\t.permission\t= proc_fd_permission,\n\t.setattr\t= proc_setattr,\n};","static struct dentry *proc_fdinfo_instantiate(struct inode *dir,\n\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\n{\n\tunsigned fd = *(unsigned *)ptr;\n \tstruct inode *inode;\n \tstruct proc_inode *ei;\n\tstruct dentry *error = ERR_PTR(-ENOENT);","\tinode = proc_pid_make_inode(dir->i_sb, task);\n\tif (!inode)\n\t\tgoto out;\n\tei = PROC_I(inode);\n\tei->fd = fd;\n\tinode->i_mode = S_IFREG | S_IRUSR;\n\tinode->i_fop = &proc_fdinfo_file_operations;\n\td_set_d_op(dentry, &tid_fd_dentry_operations);\n\td_add(dentry, inode);\n\t/* Close the race of the process dying before we return the dentry */\n\tif (tid_fd_revalidate(dentry, NULL))\n\t\terror = NULL;"," out:\n\treturn error;\n}","static struct dentry *proc_lookupfdinfo(struct inode *dir,\n\t\t\t\t\tstruct dentry *dentry,\n\t\t\t\t\tstruct nameidata *nd)\n{\n\treturn proc_lookupfd_common(dir, dentry, proc_fdinfo_instantiate);\n}","static int proc_readfdinfo(struct file *filp, void *dirent, filldir_t filldir)\n{\n\treturn proc_readfd_common(filp, dirent, filldir,\n\t\t\t\t proc_fdinfo_instantiate);\n}","static const struct file_operations proc_fdinfo_operations = {\n\t.read\t\t= generic_read_dir,\n\t.readdir\t= proc_readfdinfo,\n\t.llseek\t\t= default_llseek,\n};","/*\n * proc directories can do almost nothing..\n */\nstatic const struct inode_operations proc_fdinfo_inode_operations = {\n\t.lookup\t\t= proc_lookupfdinfo,\n\t.setattr\t= proc_setattr,\n};","\nstatic struct dentry *proc_pident_instantiate(struct inode *dir,\n\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\n{\n\tconst struct pid_entry *p = ptr;\n\tstruct inode *inode;\n\tstruct proc_inode *ei;\n\tstruct dentry *error = ERR_PTR(-ENOENT);","\tinode = proc_pid_make_inode(dir->i_sb, task);\n\tif (!inode)\n\t\tgoto out;","\tei = PROC_I(inode);\n\tinode->i_mode = p->mode;\n\tif (S_ISDIR(inode->i_mode))\n\t\tinode->i_nlink = 2;\t/* Use getattr to fix if necessary */\n\tif (p->iop)\n\t\tinode->i_op = p->iop;\n\tif (p->fop)\n\t\tinode->i_fop = p->fop;\n\tei->op = p->op;\n\td_set_d_op(dentry, &pid_dentry_operations);\n\td_add(dentry, inode);\n\t/* Close the race of the process dying before we return the dentry */\n\tif (pid_revalidate(dentry, NULL))\n\t\terror = NULL;\nout:\n\treturn error;\n}","static struct dentry *proc_pident_lookup(struct inode *dir, \n\t\t\t\t\t struct dentry *dentry,\n\t\t\t\t\t const struct pid_entry *ents,\n\t\t\t\t\t unsigned int nents)\n{\n\tstruct dentry *error;\n\tstruct task_struct *task = get_proc_task(dir);\n\tconst struct pid_entry *p, *last;","\terror = ERR_PTR(-ENOENT);","\tif (!task)\n\t\tgoto out_no_task;","\t/*\n\t * Yes, it does not scale. And it should not. Don't add\n\t * new entries into /proc/<tgid>/ without very good reasons.\n\t */\n\tlast = &ents[nents - 1];\n\tfor (p = ents; p <= last; p++) {\n\t\tif (p->len != dentry->d_name.len)\n\t\t\tcontinue;\n\t\tif (!memcmp(dentry->d_name.name, p->name, p->len))\n\t\t\tbreak;\n\t}\n\tif (p > last)\n\t\tgoto out;","\terror = proc_pident_instantiate(dir, dentry, task, p);\nout:\n\tput_task_struct(task);\nout_no_task:\n\treturn error;\n}","static int proc_pident_fill_cache(struct file *filp, void *dirent,\n\tfilldir_t filldir, struct task_struct *task, const struct pid_entry *p)\n{\n\treturn proc_fill_cache(filp, dirent, filldir, p->name, p->len,\n\t\t\t\tproc_pident_instantiate, task, p);\n}","static int proc_pident_readdir(struct file *filp,\n\t\tvoid *dirent, filldir_t filldir,\n\t\tconst struct pid_entry *ents, unsigned int nents)\n{\n\tint i;\n\tstruct dentry *dentry = filp->f_path.dentry;\n\tstruct inode *inode = dentry->d_inode;\n\tstruct task_struct *task = get_proc_task(inode);\n\tconst struct pid_entry *p, *last;\n\tino_t ino;\n\tint ret;","\tret = -ENOENT;\n\tif (!task)\n\t\tgoto out_no_task;","\tret = 0;\n\ti = filp->f_pos;\n\tswitch (i) {\n\tcase 0:\n\t\tino = inode->i_ino;\n\t\tif (filldir(dirent, \".\", 1, i, ino, DT_DIR) < 0)\n\t\t\tgoto out;\n\t\ti++;\n\t\tfilp->f_pos++;\n\t\t/* fall through */\n\tcase 1:\n\t\tino = parent_ino(dentry);\n\t\tif (filldir(dirent, \"..\", 2, i, ino, DT_DIR) < 0)\n\t\t\tgoto out;\n\t\ti++;\n\t\tfilp->f_pos++;\n\t\t/* fall through */\n\tdefault:\n\t\ti -= 2;\n\t\tif (i >= nents) {\n\t\t\tret = 1;\n\t\t\tgoto out;\n\t\t}\n\t\tp = ents + i;\n\t\tlast = &ents[nents - 1];\n\t\twhile (p <= last) {\n\t\t\tif (proc_pident_fill_cache(filp, dirent, filldir, task, p) < 0)\n\t\t\t\tgoto out;\n\t\t\tfilp->f_pos++;\n\t\t\tp++;\n\t\t}\n\t}","\tret = 1;\nout:\n\tput_task_struct(task);\nout_no_task:\n\treturn ret;\n}","#ifdef CONFIG_SECURITY\nstatic ssize_t proc_pid_attr_read(struct file * file, char __user * buf,\n\t\t\t\t size_t count, loff_t *ppos)\n{\n\tstruct inode * inode = file->f_path.dentry->d_inode;\n\tchar *p = NULL;\n\tssize_t length;\n\tstruct task_struct *task = get_proc_task(inode);","\tif (!task)\n\t\treturn -ESRCH;","\tlength = security_getprocattr(task,\n\t\t\t\t (char*)file->f_path.dentry->d_name.name,\n\t\t\t\t &p);\n\tput_task_struct(task);\n\tif (length > 0)\n\t\tlength = simple_read_from_buffer(buf, count, ppos, p, length);\n\tkfree(p);\n\treturn length;\n}","static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf,\n\t\t\t\t size_t count, loff_t *ppos)\n{\n\tstruct inode * inode = file->f_path.dentry->d_inode;\n\tchar *page;\n\tssize_t length;\n\tstruct task_struct *task = get_proc_task(inode);","\tlength = -ESRCH;\n\tif (!task)\n\t\tgoto out_no_task;\n\tif (count > PAGE_SIZE)\n\t\tcount = PAGE_SIZE;","\t/* No partial writes. */\n\tlength = -EINVAL;\n\tif (*ppos != 0)\n\t\tgoto out;","\tlength = -ENOMEM;\n\tpage = (char*)__get_free_page(GFP_TEMPORARY);\n\tif (!page)\n\t\tgoto out;","\tlength = -EFAULT;\n\tif (copy_from_user(page, buf, count))\n\t\tgoto out_free;","\t/* Guard against adverse ptrace interaction */\n\tlength = mutex_lock_interruptible(&task->signal->cred_guard_mutex);\n\tif (length < 0)\n\t\tgoto out_free;","\tlength = security_setprocattr(task,\n\t\t\t\t (char*)file->f_path.dentry->d_name.name,\n\t\t\t\t (void*)page, count);\n\tmutex_unlock(&task->signal->cred_guard_mutex);\nout_free:\n\tfree_page((unsigned long) page);\nout:\n\tput_task_struct(task);\nout_no_task:\n\treturn length;\n}","static const struct file_operations proc_pid_attr_operations = {\n\t.read\t\t= proc_pid_attr_read,\n\t.write\t\t= proc_pid_attr_write,\n\t.llseek\t\t= generic_file_llseek,\n};","static const struct pid_entry attr_dir_stuff[] = {\n\tREG(\"current\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\n\tREG(\"prev\", S_IRUGO,\t proc_pid_attr_operations),\n\tREG(\"exec\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\n\tREG(\"fscreate\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\n\tREG(\"keycreate\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\n\tREG(\"sockcreate\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\n};","static int proc_attr_dir_readdir(struct file * filp,\n\t\t\t void * dirent, filldir_t filldir)\n{\n\treturn proc_pident_readdir(filp,dirent,filldir,\n\t\t\t\t attr_dir_stuff,ARRAY_SIZE(attr_dir_stuff));\n}","static const struct file_operations proc_attr_dir_operations = {\n\t.read\t\t= generic_read_dir,\n\t.readdir\t= proc_attr_dir_readdir,\n\t.llseek\t\t= default_llseek,\n};","static struct dentry *proc_attr_dir_lookup(struct inode *dir,\n\t\t\t\tstruct dentry *dentry, struct nameidata *nd)\n{\n\treturn proc_pident_lookup(dir, dentry,\n\t\t\t\t attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));\n}","static const struct inode_operations proc_attr_dir_inode_operations = {\n\t.lookup\t\t= proc_attr_dir_lookup,\n\t.getattr\t= pid_getattr,\n\t.setattr\t= proc_setattr,\n};","#endif","#ifdef CONFIG_ELF_CORE\nstatic ssize_t proc_coredump_filter_read(struct file *file, char __user *buf,\n\t\t\t\t\t size_t count, loff_t *ppos)\n{\n\tstruct task_struct *task = get_proc_task(file->f_dentry->d_inode);\n\tstruct mm_struct *mm;\n\tchar buffer[PROC_NUMBUF];\n\tsize_t len;\n\tint ret;","\tif (!task)\n\t\treturn -ESRCH;","\tret = 0;\n\tmm = get_task_mm(task);\n\tif (mm) {\n\t\tlen = snprintf(buffer, sizeof(buffer), \"%08lx\\n\",\n\t\t\t ((mm->flags & MMF_DUMP_FILTER_MASK) >>\n\t\t\t\tMMF_DUMP_FILTER_SHIFT));\n\t\tmmput(mm);\n\t\tret = simple_read_from_buffer(buf, count, ppos, buffer, len);\n\t}","\tput_task_struct(task);","\treturn ret;\n}","static ssize_t proc_coredump_filter_write(struct file *file,\n\t\t\t\t\t const char __user *buf,\n\t\t\t\t\t size_t count,\n\t\t\t\t\t loff_t *ppos)\n{\n\tstruct task_struct *task;\n\tstruct mm_struct *mm;\n\tchar buffer[PROC_NUMBUF], *end;\n\tunsigned int val;\n\tint ret;\n\tint i;\n\tunsigned long mask;","\tret = -EFAULT;\n\tmemset(buffer, 0, sizeof(buffer));\n\tif (count > sizeof(buffer) - 1)\n\t\tcount = sizeof(buffer) - 1;\n\tif (copy_from_user(buffer, buf, count))\n\t\tgoto out_no_task;","\tret = -EINVAL;\n\tval = (unsigned int)simple_strtoul(buffer, &end, 0);\n\tif (*end == '\\n')\n\t\tend++;\n\tif (end - buffer == 0)\n\t\tgoto out_no_task;","\tret = -ESRCH;\n\ttask = get_proc_task(file->f_dentry->d_inode);\n\tif (!task)\n\t\tgoto out_no_task;","\tret = end - buffer;\n\tmm = get_task_mm(task);\n\tif (!mm)\n\t\tgoto out_no_mm;","\tfor (i = 0, mask = 1; i < MMF_DUMP_FILTER_BITS; i++, mask <<= 1) {\n\t\tif (val & mask)\n\t\t\tset_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);\n\t\telse\n\t\t\tclear_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);\n\t}","\tmmput(mm);\n out_no_mm:\n\tput_task_struct(task);\n out_no_task:\n\treturn ret;\n}","static const struct file_operations proc_coredump_filter_operations = {\n\t.read\t\t= proc_coredump_filter_read,\n\t.write\t\t= proc_coredump_filter_write,\n\t.llseek\t\t= generic_file_llseek,\n};\n#endif","/*\n * /proc/self:\n */\nstatic int proc_self_readlink(struct dentry *dentry, char __user *buffer,\n\t\t\t int buflen)\n{\n\tstruct pid_namespace *ns = dentry->d_sb->s_fs_info;\n\tpid_t tgid = task_tgid_nr_ns(current, ns);\n\tchar tmp[PROC_NUMBUF];\n\tif (!tgid)\n\t\treturn -ENOENT;\n\tsprintf(tmp, \"%d\", tgid);\n\treturn vfs_readlink(dentry,buffer,buflen,tmp);\n}","static void *proc_self_follow_link(struct dentry *dentry, struct nameidata *nd)\n{\n\tstruct pid_namespace *ns = dentry->d_sb->s_fs_info;\n\tpid_t tgid = task_tgid_nr_ns(current, ns);\n\tchar *name = ERR_PTR(-ENOENT);\n\tif (tgid) {\n\t\tname = __getname();\n\t\tif (!name)\n\t\t\tname = ERR_PTR(-ENOMEM);\n\t\telse\n\t\t\tsprintf(name, \"%d\", tgid);\n\t}\n\tnd_set_link(nd, name);\n\treturn NULL;\n}","static void proc_self_put_link(struct dentry *dentry, struct nameidata *nd,\n\t\t\t\tvoid *cookie)\n{\n\tchar *s = nd_get_link(nd);\n\tif (!IS_ERR(s))\n\t\t__putname(s);\n}","static const struct inode_operations proc_self_inode_operations = {\n\t.readlink\t= proc_self_readlink,\n\t.follow_link\t= proc_self_follow_link,\n\t.put_link\t= proc_self_put_link,\n};","/*\n * proc base\n *\n * These are the directory entries in the root directory of /proc\n * that properly belong to the /proc filesystem, as they describe\n * describe something that is process related.\n */\nstatic const struct pid_entry proc_base_stuff[] = {\n\tNOD(\"self\", S_IFLNK|S_IRWXUGO,\n\t\t&proc_self_inode_operations, NULL, {}),\n};","static struct dentry *proc_base_instantiate(struct inode *dir,\n\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\n{\n\tconst struct pid_entry *p = ptr;\n\tstruct inode *inode;\n\tstruct proc_inode *ei;\n\tstruct dentry *error;","\t/* Allocate the inode */\n\terror = ERR_PTR(-ENOMEM);\n\tinode = new_inode(dir->i_sb);\n\tif (!inode)\n\t\tgoto out;","\t/* Initialize the inode */\n\tei = PROC_I(inode);\n\tinode->i_ino = get_next_ino();\n\tinode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;","\t/*\n\t * grab the reference to the task.\n\t */\n\tei->pid = get_task_pid(task, PIDTYPE_PID);\n\tif (!ei->pid)\n\t\tgoto out_iput;","\tinode->i_mode = p->mode;\n\tif (S_ISDIR(inode->i_mode))\n\t\tinode->i_nlink = 2;\n\tif (S_ISLNK(inode->i_mode))\n\t\tinode->i_size = 64;\n\tif (p->iop)\n\t\tinode->i_op = p->iop;\n\tif (p->fop)\n\t\tinode->i_fop = p->fop;\n\tei->op = p->op;\n\td_add(dentry, inode);\n\terror = NULL;\nout:\n\treturn error;\nout_iput:\n\tiput(inode);\n\tgoto out;\n}","static struct dentry *proc_base_lookup(struct inode *dir, struct dentry *dentry)\n{\n\tstruct dentry *error;\n\tstruct task_struct *task = get_proc_task(dir);\n\tconst struct pid_entry *p, *last;","\terror = ERR_PTR(-ENOENT);","\tif (!task)\n\t\tgoto out_no_task;","\t/* Lookup the directory entry */\n\tlast = &proc_base_stuff[ARRAY_SIZE(proc_base_stuff) - 1];\n\tfor (p = proc_base_stuff; p <= last; p++) {\n\t\tif (p->len != dentry->d_name.len)\n\t\t\tcontinue;\n\t\tif (!memcmp(dentry->d_name.name, p->name, p->len))\n\t\t\tbreak;\n\t}\n\tif (p > last)\n\t\tgoto out;","\terror = proc_base_instantiate(dir, dentry, task, p);","out:\n\tput_task_struct(task);\nout_no_task:\n\treturn error;\n}","static int proc_base_fill_cache(struct file *filp, void *dirent,\n\tfilldir_t filldir, struct task_struct *task, const struct pid_entry *p)\n{\n\treturn proc_fill_cache(filp, dirent, filldir, p->name, p->len,\n\t\t\t\tproc_base_instantiate, task, p);\n}","#ifdef CONFIG_TASK_IO_ACCOUNTING\nstatic int do_io_accounting(struct task_struct *task, char *buffer, int whole)\n{\n\tstruct task_io_accounting acct = task->ioac;\n\tunsigned long flags;","\tif (!ptrace_may_access(task, PTRACE_MODE_READ))\n\t\treturn -EACCES;","\tif (whole && lock_task_sighand(task, &flags)) {\n\t\tstruct task_struct *t = task;","\t\ttask_io_accounting_add(&acct, &task->signal->ioac);\n\t\twhile_each_thread(task, t)\n\t\t\ttask_io_accounting_add(&acct, &t->ioac);","\t\tunlock_task_sighand(task, &flags);\n\t}\n\treturn sprintf(buffer,\n\t\t\t\"rchar: %llu\\n\"\n\t\t\t\"wchar: %llu\\n\"\n\t\t\t\"syscr: %llu\\n\"\n\t\t\t\"syscw: %llu\\n\"\n\t\t\t\"read_bytes: %llu\\n\"\n\t\t\t\"write_bytes: %llu\\n\"\n\t\t\t\"cancelled_write_bytes: %llu\\n\",\n\t\t\t(unsigned long long)acct.rchar,\n\t\t\t(unsigned long long)acct.wchar,\n\t\t\t(unsigned long long)acct.syscr,\n\t\t\t(unsigned long long)acct.syscw,\n\t\t\t(unsigned long long)acct.read_bytes,\n\t\t\t(unsigned long long)acct.write_bytes,\n\t\t\t(unsigned long long)acct.cancelled_write_bytes);\n}","static int proc_tid_io_accounting(struct task_struct *task, char *buffer)\n{\n\treturn do_io_accounting(task, buffer, 0);\n}","static int proc_tgid_io_accounting(struct task_struct *task, char *buffer)\n{\n\treturn do_io_accounting(task, buffer, 1);\n}\n#endif /* CONFIG_TASK_IO_ACCOUNTING */","static int proc_pid_personality(struct seq_file *m, struct pid_namespace *ns,\n\t\t\t\tstruct pid *pid, struct task_struct *task)\n{\n\tint err = lock_trace(task);\n\tif (!err) {\n\t\tseq_printf(m, \"%08x\\n\", task->personality);\n\t\tunlock_trace(task);\n\t}\n\treturn err;\n}","/*\n * Thread groups\n */\nstatic const struct file_operations proc_task_operations;\nstatic const struct inode_operations proc_task_inode_operations;","static const struct pid_entry tgid_base_stuff[] = {\n\tDIR(\"task\", S_IRUGO|S_IXUGO, proc_task_inode_operations, proc_task_operations),\n\tDIR(\"fd\", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),\n\tDIR(\"fdinfo\", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),\n\tDIR(\"ns\",\t S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),\n#ifdef CONFIG_NET\n\tDIR(\"net\", S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations),\n#endif\n\tREG(\"environ\", S_IRUSR, proc_environ_operations),\n\tINF(\"auxv\", S_IRUSR, proc_pid_auxv),\n\tONE(\"status\", S_IRUGO, proc_pid_status),\n\tONE(\"personality\", S_IRUGO, proc_pid_personality),\n\tINF(\"limits\",\t S_IRUGO, proc_pid_limits),\n#ifdef CONFIG_SCHED_DEBUG\n\tREG(\"sched\", S_IRUGO|S_IWUSR, proc_pid_sched_operations),\n#endif\n#ifdef CONFIG_SCHED_AUTOGROUP\n\tREG(\"autogroup\", S_IRUGO|S_IWUSR, proc_pid_sched_autogroup_operations),\n#endif\n\tREG(\"comm\", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),\n#ifdef CONFIG_HAVE_ARCH_TRACEHOOK\n\tINF(\"syscall\", S_IRUGO, proc_pid_syscall),\n#endif\n\tINF(\"cmdline\", S_IRUGO, proc_pid_cmdline),\n\tONE(\"stat\", S_IRUGO, proc_tgid_stat),\n\tONE(\"statm\", S_IRUGO, proc_pid_statm),\n\tREG(\"maps\", S_IRUGO, proc_maps_operations),\n#ifdef CONFIG_NUMA\n\tREG(\"numa_maps\", S_IRUGO, proc_numa_maps_operations),\n#endif\n\tREG(\"mem\", S_IRUSR|S_IWUSR, proc_mem_operations),\n\tLNK(\"cwd\", proc_cwd_link),\n\tLNK(\"root\", proc_root_link),\n\tLNK(\"exe\", proc_exe_link),\n\tREG(\"mounts\", S_IRUGO, proc_mounts_operations),\n\tREG(\"mountinfo\", S_IRUGO, proc_mountinfo_operations),\n\tREG(\"mountstats\", S_IRUSR, proc_mountstats_operations),\n#ifdef CONFIG_PROC_PAGE_MONITOR\n\tREG(\"clear_refs\", S_IWUSR, proc_clear_refs_operations),\n\tREG(\"smaps\", S_IRUGO, proc_smaps_operations),\n\tREG(\"pagemap\", S_IRUGO, proc_pagemap_operations),\n#endif\n#ifdef CONFIG_SECURITY\n\tDIR(\"attr\", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),\n#endif\n#ifdef CONFIG_KALLSYMS\n\tINF(\"wchan\", S_IRUGO, proc_pid_wchan),\n#endif\n#ifdef CONFIG_STACKTRACE\n\tONE(\"stack\", S_IRUGO, proc_pid_stack),\n#endif\n#ifdef CONFIG_SCHEDSTATS\n\tINF(\"schedstat\", S_IRUGO, proc_pid_schedstat),\n#endif\n#ifdef CONFIG_LATENCYTOP\n\tREG(\"latency\", S_IRUGO, proc_lstats_operations),\n#endif\n#ifdef CONFIG_PROC_PID_CPUSET\n\tREG(\"cpuset\", S_IRUGO, proc_cpuset_operations),\n#endif\n#ifdef CONFIG_CGROUPS\n\tREG(\"cgroup\", S_IRUGO, proc_cgroup_operations),\n#endif\n\tINF(\"oom_score\", S_IRUGO, proc_oom_score),\n\tREG(\"oom_adj\", S_IRUGO|S_IWUSR, proc_oom_adjust_operations),\n\tREG(\"oom_score_adj\", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),\n#ifdef CONFIG_AUDITSYSCALL\n\tREG(\"loginuid\", S_IWUSR|S_IRUGO, proc_loginuid_operations),\n\tREG(\"sessionid\", S_IRUGO, proc_sessionid_operations),\n#endif\n#ifdef CONFIG_FAULT_INJECTION\n\tREG(\"make-it-fail\", S_IRUGO|S_IWUSR, proc_fault_inject_operations),\n#endif\n#ifdef CONFIG_ELF_CORE\n\tREG(\"coredump_filter\", S_IRUGO|S_IWUSR, proc_coredump_filter_operations),\n#endif\n#ifdef CONFIG_TASK_IO_ACCOUNTING\n\tINF(\"io\",\tS_IRUSR, proc_tgid_io_accounting),\n#endif\n#ifdef CONFIG_HARDWALL\n\tINF(\"hardwall\", S_IRUGO, proc_pid_hardwall),\n#endif\n};","static int proc_tgid_base_readdir(struct file * filp,\n\t\t\t void * dirent, filldir_t filldir)\n{\n\treturn proc_pident_readdir(filp,dirent,filldir,\n\t\t\t\t tgid_base_stuff,ARRAY_SIZE(tgid_base_stuff));\n}","static const struct file_operations proc_tgid_base_operations = {\n\t.read\t\t= generic_read_dir,\n\t.readdir\t= proc_tgid_base_readdir,\n\t.llseek\t\t= default_llseek,\n};","static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd){\n\treturn proc_pident_lookup(dir, dentry,\n\t\t\t\t tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));\n}","static const struct inode_operations proc_tgid_base_inode_operations = {\n\t.lookup\t\t= proc_tgid_base_lookup,\n\t.getattr\t= pid_getattr,\n\t.setattr\t= proc_setattr,\n};","static void proc_flush_task_mnt(struct vfsmount *mnt, pid_t pid, pid_t tgid)\n{\n\tstruct dentry *dentry, *leader, *dir;\n\tchar buf[PROC_NUMBUF];\n\tstruct qstr name;","\tname.name = buf;\n\tname.len = snprintf(buf, sizeof(buf), \"%d\", pid);\n\tdentry = d_hash_and_lookup(mnt->mnt_root, &name);\n\tif (dentry) {\n\t\tshrink_dcache_parent(dentry);\n\t\td_drop(dentry);\n\t\tdput(dentry);\n\t}","\tname.name = buf;\n\tname.len = snprintf(buf, sizeof(buf), \"%d\", tgid);\n\tleader = d_hash_and_lookup(mnt->mnt_root, &name);\n\tif (!leader)\n\t\tgoto out;","\tname.name = \"task\";\n\tname.len = strlen(name.name);\n\tdir = d_hash_and_lookup(leader, &name);\n\tif (!dir)\n\t\tgoto out_put_leader;","\tname.name = buf;\n\tname.len = snprintf(buf, sizeof(buf), \"%d\", pid);\n\tdentry = d_hash_and_lookup(dir, &name);\n\tif (dentry) {\n\t\tshrink_dcache_parent(dentry);\n\t\td_drop(dentry);\n\t\tdput(dentry);\n\t}","\tdput(dir);\nout_put_leader:\n\tdput(leader);\nout:\n\treturn;\n}","/**\n * proc_flush_task - Remove dcache entries for @task from the /proc dcache.\n * @task: task that should be flushed.\n *\n * When flushing dentries from proc, one needs to flush them from global\n * proc (proc_mnt) and from all the namespaces' procs this task was seen\n * in. This call is supposed to do all of this job.\n *\n * Looks in the dcache for\n * /proc/@pid\n * /proc/@tgid/task/@pid\n * if either directory is present flushes it and all of it'ts children\n * from the dcache.\n *\n * It is safe and reasonable to cache /proc entries for a task until\n * that task exits. After that they just clog up the dcache with\n * useless entries, possibly causing useful dcache entries to be\n * flushed instead. This routine is proved to flush those useless\n * dcache entries at process exit time.\n *\n * NOTE: This routine is just an optimization so it does not guarantee\n * that no dcache entries will exist at process exit time it\n * just makes it very unlikely that any will persist.\n */","void proc_flush_task(struct task_struct *task)\n{\n\tint i;\n\tstruct pid *pid, *tgid;\n\tstruct upid *upid;","\tpid = task_pid(task);\n\ttgid = task_tgid(task);","\tfor (i = 0; i <= pid->level; i++) {\n\t\tupid = &pid->numbers[i];\n\t\tproc_flush_task_mnt(upid->ns->proc_mnt, upid->nr,\n\t\t\t\t\ttgid->numbers[i].nr);\n\t}","\tupid = &pid->numbers[pid->level];\n\tif (upid->nr == 1)\n\t\tpid_ns_release_proc(upid->ns);\n}","static struct dentry *proc_pid_instantiate(struct inode *dir,\n\t\t\t\t\t struct dentry * dentry,\n\t\t\t\t\t struct task_struct *task, const void *ptr)\n{\n\tstruct dentry *error = ERR_PTR(-ENOENT);\n\tstruct inode *inode;","\tinode = proc_pid_make_inode(dir->i_sb, task);\n\tif (!inode)\n\t\tgoto out;","\tinode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;\n\tinode->i_op = &proc_tgid_base_inode_operations;\n\tinode->i_fop = &proc_tgid_base_operations;\n\tinode->i_flags|=S_IMMUTABLE;","\tinode->i_nlink = 2 + pid_entry_count_dirs(tgid_base_stuff,\n\t\tARRAY_SIZE(tgid_base_stuff));","\td_set_d_op(dentry, &pid_dentry_operations);","\td_add(dentry, inode);\n\t/* Close the race of the process dying before we return the dentry */\n\tif (pid_revalidate(dentry, NULL))\n\t\terror = NULL;\nout:\n\treturn error;\n}","struct dentry *proc_pid_lookup(struct inode *dir, struct dentry * dentry, struct nameidata *nd)\n{\n\tstruct dentry *result;\n\tstruct task_struct *task;\n\tunsigned tgid;\n\tstruct pid_namespace *ns;","\tresult = proc_base_lookup(dir, dentry);\n\tif (!IS_ERR(result) || PTR_ERR(result) != -ENOENT)\n\t\tgoto out;","\ttgid = name_to_int(dentry);\n\tif (tgid == ~0U)\n\t\tgoto out;","\tns = dentry->d_sb->s_fs_info;\n\trcu_read_lock();\n\ttask = find_task_by_pid_ns(tgid, ns);\n\tif (task)\n\t\tget_task_struct(task);\n\trcu_read_unlock();\n\tif (!task)\n\t\tgoto out;","\tresult = proc_pid_instantiate(dir, dentry, task, NULL);\n\tput_task_struct(task);\nout:\n\treturn result;\n}","/*\n * Find the first task with tgid >= tgid\n *\n */\nstruct tgid_iter {\n\tunsigned int tgid;\n\tstruct task_struct *task;\n};\nstatic struct tgid_iter next_tgid(struct pid_namespace *ns, struct tgid_iter iter)\n{\n\tstruct pid *pid;","\tif (iter.task)\n\t\tput_task_struct(iter.task);\n\trcu_read_lock();\nretry:\n\titer.task = NULL;\n\tpid = find_ge_pid(iter.tgid, ns);\n\tif (pid) {\n\t\titer.tgid = pid_nr_ns(pid, ns);\n\t\titer.task = pid_task(pid, PIDTYPE_PID);\n\t\t/* What we to know is if the pid we have find is the\n\t\t * pid of a thread_group_leader. Testing for task\n\t\t * being a thread_group_leader is the obvious thing\n\t\t * todo but there is a window when it fails, due to\n\t\t * the pid transfer logic in de_thread.\n\t\t *\n\t\t * So we perform the straight forward test of seeing\n\t\t * if the pid we have found is the pid of a thread\n\t\t * group leader, and don't worry if the task we have\n\t\t * found doesn't happen to be a thread group leader.\n\t\t * As we don't care in the case of readdir.\n\t\t */\n\t\tif (!iter.task || !has_group_leader_pid(iter.task)) {\n\t\t\titer.tgid += 1;\n\t\t\tgoto retry;\n\t\t}\n\t\tget_task_struct(iter.task);\n\t}\n\trcu_read_unlock();\n\treturn iter;\n}","#define TGID_OFFSET (FIRST_PROCESS_ENTRY + ARRAY_SIZE(proc_base_stuff))","static int proc_pid_fill_cache(struct file *filp, void *dirent, filldir_t filldir,\n\tstruct tgid_iter iter)\n{\n\tchar name[PROC_NUMBUF];\n\tint len = snprintf(name, sizeof(name), \"%d\", iter.tgid);\n\treturn proc_fill_cache(filp, dirent, filldir, name, len,\n\t\t\t\tproc_pid_instantiate, iter.task, NULL);\n}","/* for the /proc/ directory itself, after non-process stuff has been done */\nint proc_pid_readdir(struct file * filp, void * dirent, filldir_t filldir)\n{\n\tunsigned int nr;\n\tstruct task_struct *reaper;\n\tstruct tgid_iter iter;\n\tstruct pid_namespace *ns;","\tif (filp->f_pos >= PID_MAX_LIMIT + TGID_OFFSET)\n\t\tgoto out_no_task;\n\tnr = filp->f_pos - FIRST_PROCESS_ENTRY;","\treaper = get_proc_task(filp->f_path.dentry->d_inode);\n\tif (!reaper)\n\t\tgoto out_no_task;","\tfor (; nr < ARRAY_SIZE(proc_base_stuff); filp->f_pos++, nr++) {\n\t\tconst struct pid_entry *p = &proc_base_stuff[nr];\n\t\tif (proc_base_fill_cache(filp, dirent, filldir, reaper, p) < 0)\n\t\t\tgoto out;\n\t}","\tns = filp->f_dentry->d_sb->s_fs_info;\n\titer.task = NULL;\n\titer.tgid = filp->f_pos - TGID_OFFSET;\n\tfor (iter = next_tgid(ns, iter);\n\t iter.task;\n\t iter.tgid += 1, iter = next_tgid(ns, iter)) {\n\t\tfilp->f_pos = iter.tgid + TGID_OFFSET;\n\t\tif (proc_pid_fill_cache(filp, dirent, filldir, iter) < 0) {\n\t\t\tput_task_struct(iter.task);\n\t\t\tgoto out;\n\t\t}\n\t}\n\tfilp->f_pos = PID_MAX_LIMIT + TGID_OFFSET;\nout:\n\tput_task_struct(reaper);\nout_no_task:\n\treturn 0;\n}","/*\n * Tasks\n */\nstatic const struct pid_entry tid_base_stuff[] = {\n\tDIR(\"fd\", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),\n\tDIR(\"fdinfo\", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),\n\tDIR(\"ns\",\t S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),\n\tREG(\"environ\", S_IRUSR, proc_environ_operations),\n\tINF(\"auxv\", S_IRUSR, proc_pid_auxv),\n\tONE(\"status\", S_IRUGO, proc_pid_status),\n\tONE(\"personality\", S_IRUGO, proc_pid_personality),\n\tINF(\"limits\",\t S_IRUGO, proc_pid_limits),\n#ifdef CONFIG_SCHED_DEBUG\n\tREG(\"sched\", S_IRUGO|S_IWUSR, proc_pid_sched_operations),\n#endif\n\tREG(\"comm\", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),\n#ifdef CONFIG_HAVE_ARCH_TRACEHOOK\n\tINF(\"syscall\", S_IRUGO, proc_pid_syscall),\n#endif\n\tINF(\"cmdline\", S_IRUGO, proc_pid_cmdline),\n\tONE(\"stat\", S_IRUGO, proc_tid_stat),\n\tONE(\"statm\", S_IRUGO, proc_pid_statm),\n\tREG(\"maps\", S_IRUGO, proc_maps_operations),\n#ifdef CONFIG_NUMA\n\tREG(\"numa_maps\", S_IRUGO, proc_numa_maps_operations),\n#endif\n\tREG(\"mem\", S_IRUSR|S_IWUSR, proc_mem_operations),\n\tLNK(\"cwd\", proc_cwd_link),\n\tLNK(\"root\", proc_root_link),\n\tLNK(\"exe\", proc_exe_link),\n\tREG(\"mounts\", S_IRUGO, proc_mounts_operations),\n\tREG(\"mountinfo\", S_IRUGO, proc_mountinfo_operations),\n#ifdef CONFIG_PROC_PAGE_MONITOR\n\tREG(\"clear_refs\", S_IWUSR, proc_clear_refs_operations),\n\tREG(\"smaps\", S_IRUGO, proc_smaps_operations),\n\tREG(\"pagemap\", S_IRUGO, proc_pagemap_operations),\n#endif\n#ifdef CONFIG_SECURITY\n\tDIR(\"attr\", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),\n#endif\n#ifdef CONFIG_KALLSYMS\n\tINF(\"wchan\", S_IRUGO, proc_pid_wchan),\n#endif\n#ifdef CONFIG_STACKTRACE\n\tONE(\"stack\", S_IRUGO, proc_pid_stack),\n#endif\n#ifdef CONFIG_SCHEDSTATS\n\tINF(\"schedstat\", S_IRUGO, proc_pid_schedstat),\n#endif\n#ifdef CONFIG_LATENCYTOP\n\tREG(\"latency\", S_IRUGO, proc_lstats_operations),\n#endif\n#ifdef CONFIG_PROC_PID_CPUSET\n\tREG(\"cpuset\", S_IRUGO, proc_cpuset_operations),\n#endif\n#ifdef CONFIG_CGROUPS\n\tREG(\"cgroup\", S_IRUGO, proc_cgroup_operations),\n#endif\n\tINF(\"oom_score\", S_IRUGO, proc_oom_score),\n\tREG(\"oom_adj\", S_IRUGO|S_IWUSR, proc_oom_adjust_operations),\n\tREG(\"oom_score_adj\", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),\n#ifdef CONFIG_AUDITSYSCALL\n\tREG(\"loginuid\", S_IWUSR|S_IRUGO, proc_loginuid_operations),\n\tREG(\"sessionid\", S_IRUGO, proc_sessionid_operations),\n#endif\n#ifdef CONFIG_FAULT_INJECTION\n\tREG(\"make-it-fail\", S_IRUGO|S_IWUSR, proc_fault_inject_operations),\n#endif\n#ifdef CONFIG_TASK_IO_ACCOUNTING\n\tINF(\"io\",\tS_IRUSR, proc_tid_io_accounting),\n#endif\n#ifdef CONFIG_HARDWALL\n\tINF(\"hardwall\", S_IRUGO, proc_pid_hardwall),\n#endif\n};","static int proc_tid_base_readdir(struct file * filp,\n\t\t\t void * dirent, filldir_t filldir)\n{\n\treturn proc_pident_readdir(filp,dirent,filldir,\n\t\t\t\t tid_base_stuff,ARRAY_SIZE(tid_base_stuff));\n}","static struct dentry *proc_tid_base_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd){\n\treturn proc_pident_lookup(dir, dentry,\n\t\t\t\t tid_base_stuff, ARRAY_SIZE(tid_base_stuff));\n}","static const struct file_operations proc_tid_base_operations = {\n\t.read\t\t= generic_read_dir,\n\t.readdir\t= proc_tid_base_readdir,\n\t.llseek\t\t= default_llseek,\n};","static const struct inode_operations proc_tid_base_inode_operations = {\n\t.lookup\t\t= proc_tid_base_lookup,\n\t.getattr\t= pid_getattr,\n\t.setattr\t= proc_setattr,\n};","static struct dentry *proc_task_instantiate(struct inode *dir,\n\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\n{\n\tstruct dentry *error = ERR_PTR(-ENOENT);\n\tstruct inode *inode;\n\tinode = proc_pid_make_inode(dir->i_sb, task);","\tif (!inode)\n\t\tgoto out;\n\tinode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;\n\tinode->i_op = &proc_tid_base_inode_operations;\n\tinode->i_fop = &proc_tid_base_operations;\n\tinode->i_flags|=S_IMMUTABLE;","\tinode->i_nlink = 2 + pid_entry_count_dirs(tid_base_stuff,\n\t\tARRAY_SIZE(tid_base_stuff));","\td_set_d_op(dentry, &pid_dentry_operations);","\td_add(dentry, inode);\n\t/* Close the race of the process dying before we return the dentry */\n\tif (pid_revalidate(dentry, NULL))\n\t\terror = NULL;\nout:\n\treturn error;\n}","static struct dentry *proc_task_lookup(struct inode *dir, struct dentry * dentry, struct nameidata *nd)\n{\n\tstruct dentry *result = ERR_PTR(-ENOENT);\n\tstruct task_struct *task;\n\tstruct task_struct *leader = get_proc_task(dir);\n\tunsigned tid;\n\tstruct pid_namespace *ns;","\tif (!leader)\n\t\tgoto out_no_task;","\ttid = name_to_int(dentry);\n\tif (tid == ~0U)\n\t\tgoto out;","\tns = dentry->d_sb->s_fs_info;\n\trcu_read_lock();\n\ttask = find_task_by_pid_ns(tid, ns);\n\tif (task)\n\t\tget_task_struct(task);\n\trcu_read_unlock();\n\tif (!task)\n\t\tgoto out;\n\tif (!same_thread_group(leader, task))\n\t\tgoto out_drop_task;","\tresult = proc_task_instantiate(dir, dentry, task, NULL);\nout_drop_task:\n\tput_task_struct(task);\nout:\n\tput_task_struct(leader);\nout_no_task:\n\treturn result;\n}","/*\n * Find the first tid of a thread group to return to user space.\n *\n * Usually this is just the thread group leader, but if the users\n * buffer was too small or there was a seek into the middle of the\n * directory we have more work todo.\n *\n * In the case of a short read we start with find_task_by_pid.\n *\n * In the case of a seek we start with the leader and walk nr\n * threads past it.\n */\nstatic struct task_struct *first_tid(struct task_struct *leader,\n\t\tint tid, int nr, struct pid_namespace *ns)\n{\n\tstruct task_struct *pos;","\trcu_read_lock();\n\t/* Attempt to start with the pid of a thread */\n\tif (tid && (nr > 0)) {\n\t\tpos = find_task_by_pid_ns(tid, ns);\n\t\tif (pos && (pos->group_leader == leader))\n\t\t\tgoto found;\n\t}","\t/* If nr exceeds the number of threads there is nothing todo */\n\tpos = NULL;\n\tif (nr && nr >= get_nr_threads(leader))\n\t\tgoto out;","\t/* If we haven't found our starting place yet start\n\t * with the leader and walk nr threads forward.\n\t */\n\tfor (pos = leader; nr > 0; --nr) {\n\t\tpos = next_thread(pos);\n\t\tif (pos == leader) {\n\t\t\tpos = NULL;\n\t\t\tgoto out;\n\t\t}\n\t}\nfound:\n\tget_task_struct(pos);\nout:\n\trcu_read_unlock();\n\treturn pos;\n}","/*\n * Find the next thread in the thread list.\n * Return NULL if there is an error or no next thread.\n *\n * The reference to the input task_struct is released.\n */\nstatic struct task_struct *next_tid(struct task_struct *start)\n{\n\tstruct task_struct *pos = NULL;\n\trcu_read_lock();\n\tif (pid_alive(start)) {\n\t\tpos = next_thread(start);\n\t\tif (thread_group_leader(pos))\n\t\t\tpos = NULL;\n\t\telse\n\t\t\tget_task_struct(pos);\n\t}\n\trcu_read_unlock();\n\tput_task_struct(start);\n\treturn pos;\n}","static int proc_task_fill_cache(struct file *filp, void *dirent, filldir_t filldir,\n\tstruct task_struct *task, int tid)\n{\n\tchar name[PROC_NUMBUF];\n\tint len = snprintf(name, sizeof(name), \"%d\", tid);\n\treturn proc_fill_cache(filp, dirent, filldir, name, len,\n\t\t\t\tproc_task_instantiate, task, NULL);\n}","/* for the /proc/TGID/task/ directories */\nstatic int proc_task_readdir(struct file * filp, void * dirent, filldir_t filldir)\n{\n\tstruct dentry *dentry = filp->f_path.dentry;\n\tstruct inode *inode = dentry->d_inode;\n\tstruct task_struct *leader = NULL;\n\tstruct task_struct *task;\n\tint retval = -ENOENT;\n\tino_t ino;\n\tint tid;\n\tstruct pid_namespace *ns;","\ttask = get_proc_task(inode);\n\tif (!task)\n\t\tgoto out_no_task;\n\trcu_read_lock();\n\tif (pid_alive(task)) {\n\t\tleader = task->group_leader;\n\t\tget_task_struct(leader);\n\t}\n\trcu_read_unlock();\n\tput_task_struct(task);\n\tif (!leader)\n\t\tgoto out_no_task;\n\tretval = 0;","\tswitch ((unsigned long)filp->f_pos) {\n\tcase 0:\n\t\tino = inode->i_ino;\n\t\tif (filldir(dirent, \".\", 1, filp->f_pos, ino, DT_DIR) < 0)\n\t\t\tgoto out;\n\t\tfilp->f_pos++;\n\t\t/* fall through */\n\tcase 1:\n\t\tino = parent_ino(dentry);\n\t\tif (filldir(dirent, \"..\", 2, filp->f_pos, ino, DT_DIR) < 0)\n\t\t\tgoto out;\n\t\tfilp->f_pos++;\n\t\t/* fall through */\n\t}","\t/* f_version caches the tgid value that the last readdir call couldn't\n\t * return. lseek aka telldir automagically resets f_version to 0.\n\t */\n\tns = filp->f_dentry->d_sb->s_fs_info;\n\ttid = (int)filp->f_version;\n\tfilp->f_version = 0;\n\tfor (task = first_tid(leader, tid, filp->f_pos - 2, ns);\n\t task;\n\t task = next_tid(task), filp->f_pos++) {\n\t\ttid = task_pid_nr_ns(task, ns);\n\t\tif (proc_task_fill_cache(filp, dirent, filldir, task, tid) < 0) {\n\t\t\t/* returning this tgid failed, save it as the first\n\t\t\t * pid for the next readir call */\n\t\t\tfilp->f_version = (u64)tid;\n\t\t\tput_task_struct(task);\n\t\t\tbreak;\n\t\t}\n\t}\nout:\n\tput_task_struct(leader);\nout_no_task:\n\treturn retval;\n}","static int proc_task_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)\n{\n\tstruct inode *inode = dentry->d_inode;\n\tstruct task_struct *p = get_proc_task(inode);\n\tgeneric_fillattr(inode, stat);","\tif (p) {\n\t\tstat->nlink += get_nr_threads(p);\n\t\tput_task_struct(p);\n\t}","\treturn 0;\n}","static const struct inode_operations proc_task_inode_operations = {\n\t.lookup\t\t= proc_task_lookup,\n\t.getattr\t= proc_task_getattr,\n\t.setattr\t= proc_setattr,\n};","static const struct file_operations proc_task_operations = {\n\t.read\t\t= generic_read_dir,\n\t.readdir\t= proc_task_readdir,\n\t.llseek\t\t= default_llseek,\n};\n"],"string":"[\n \"/*\\n * linux/fs/proc/base.c\\n *\\n * Copyright (C) 1991, 1992 Linus Torvalds\\n *\\n * proc base directory handling functions\\n *\\n * 1999, Al Viro. Rewritten. Now it covers the whole per-process part.\\n * Instead of using magical inumbers to determine the kind of object\\n * we allocate and fill in-core inodes upon lookup. They don't even\\n * go into icache. We cache the reference to task_struct upon lookup too.\\n * Eventually it should become a filesystem in its own. We don't use the\\n * rest of procfs anymore.\\n *\\n *\\n * Changelog:\\n * 17-Jan-2005\\n * Allan Bezerra\\n * Bruna Moreira <bruna.moreira@indt.org.br>\\n * Edjard Mota <edjard.mota@indt.org.br>\\n * Ilias Biris <ilias.biris@indt.org.br>\\n * Mauricio Lin <mauricio.lin@indt.org.br>\\n *\\n * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT\\n *\\n * A new process specific entry (smaps) included in /proc. It shows the\\n * size of rss for each memory area. The maps entry lacks information\\n * about physical memory size (rss) for each mapped file, i.e.,\\n * rss information for executables and library files.\\n * This additional information is useful for any tools that need to know\\n * about physical memory consumption for a process specific library.\\n *\\n * Changelog:\\n * 21-Feb-2005\\n * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT\\n * Pud inclusion in the page table walking.\\n *\\n * ChangeLog:\\n * 10-Mar-2005\\n * 10LE Instituto Nokia de Tecnologia - INdT:\\n * A better way to walks through the page table as suggested by Hugh Dickins.\\n *\\n * Simo Piiroinen <simo.piiroinen@nokia.com>:\\n * Smaps information related to shared, private, clean and dirty pages.\\n *\\n * Paul Mundt <paul.mundt@nokia.com>:\\n * Overall revision about smaps.\\n */\",\n \"#include <asm/uaccess.h>\",\n \"#include <linux/errno.h>\\n#include <linux/time.h>\\n#include <linux/proc_fs.h>\\n#include <linux/stat.h>\\n#include <linux/task_io_accounting_ops.h>\\n#include <linux/init.h>\\n#include <linux/capability.h>\\n#include <linux/file.h>\\n#include <linux/fdtable.h>\\n#include <linux/string.h>\\n#include <linux/seq_file.h>\\n#include <linux/namei.h>\\n#include <linux/mnt_namespace.h>\\n#include <linux/mm.h>\\n#include <linux/swap.h>\\n#include <linux/rcupdate.h>\\n#include <linux/kallsyms.h>\\n#include <linux/stacktrace.h>\\n#include <linux/resource.h>\\n#include <linux/module.h>\\n#include <linux/mount.h>\\n#include <linux/security.h>\\n#include <linux/ptrace.h>\\n#include <linux/tracehook.h>\\n#include <linux/cgroup.h>\\n#include <linux/cpuset.h>\\n#include <linux/audit.h>\\n#include <linux/poll.h>\\n#include <linux/nsproxy.h>\\n#include <linux/oom.h>\\n#include <linux/elf.h>\\n#include <linux/pid_namespace.h>\\n#include <linux/fs_struct.h>\\n#include <linux/slab.h>\\n#ifdef CONFIG_HARDWALL\\n#include <asm/hardwall.h>\\n#endif\\n#include \\\"internal.h\\\"\",\n \"/* NOTE:\\n *\\tImplementing inode permission operations in /proc is almost\\n *\\tcertainly an error. Permission checks need to happen during\\n *\\teach system call not at open time. The reason is that most of\\n *\\twhat we wish to check for permissions in /proc varies at runtime.\\n *\\n *\\tThe classic example of a problem is opening file descriptors\\n *\\tin /proc for a task before it execs a suid executable.\\n */\",\n \"struct pid_entry {\\n\\tchar *name;\\n\\tint len;\\n\\tmode_t mode;\\n\\tconst struct inode_operations *iop;\\n\\tconst struct file_operations *fop;\\n\\tunion proc_op op;\\n};\",\n \"#define NOD(NAME, MODE, IOP, FOP, OP) {\\t\\t\\t\\\\\\n\\t.name = (NAME),\\t\\t\\t\\t\\t\\\\\\n\\t.len = sizeof(NAME) - 1,\\t\\t\\t\\\\\\n\\t.mode = MODE,\\t\\t\\t\\t\\t\\\\\\n\\t.iop = IOP,\\t\\t\\t\\t\\t\\\\\\n\\t.fop = FOP,\\t\\t\\t\\t\\t\\\\\\n\\t.op = OP,\\t\\t\\t\\t\\t\\\\\\n}\",\n \"#define DIR(NAME, MODE, iops, fops)\\t\\\\\\n\\tNOD(NAME, (S_IFDIR|(MODE)), &iops, &fops, {} )\\n#define LNK(NAME, get_link)\\t\\t\\t\\t\\t\\\\\\n\\tNOD(NAME, (S_IFLNK|S_IRWXUGO),\\t\\t\\t\\t\\\\\\n\\t\\t&proc_pid_link_inode_operations, NULL,\\t\\t\\\\\\n\\t\\t{ .proc_get_link = get_link } )\\n#define REG(NAME, MODE, fops)\\t\\t\\t\\t\\\\\\n\\tNOD(NAME, (S_IFREG|(MODE)), NULL, &fops, {})\\n#define INF(NAME, MODE, read)\\t\\t\\t\\t\\\\\\n\\tNOD(NAME, (S_IFREG|(MODE)), \\t\\t\\t\\\\\\n\\t\\tNULL, &proc_info_file_operations,\\t\\\\\\n\\t\\t{ .proc_read = read } )\\n#define ONE(NAME, MODE, show)\\t\\t\\t\\t\\\\\\n\\tNOD(NAME, (S_IFREG|(MODE)), \\t\\t\\t\\\\\\n\\t\\tNULL, &proc_single_file_operations,\\t\\\\\\n\\t\\t{ .proc_show = show } )\",\n \"/*\\n * Count the number of hardlinks for the pid_entry table, excluding the .\\n * and .. links.\\n */\\nstatic unsigned int pid_entry_count_dirs(const struct pid_entry *entries,\\n\\tunsigned int n)\\n{\\n\\tunsigned int i;\\n\\tunsigned int count;\",\n \"\\tcount = 0;\\n\\tfor (i = 0; i < n; ++i) {\\n\\t\\tif (S_ISDIR(entries[i].mode))\\n\\t\\t\\t++count;\\n\\t}\",\n \"\\treturn count;\\n}\",\n \"static int get_task_root(struct task_struct *task, struct path *root)\\n{\\n\\tint result = -ENOENT;\",\n \"\\ttask_lock(task);\\n\\tif (task->fs) {\\n\\t\\tget_fs_root(task->fs, root);\\n\\t\\tresult = 0;\\n\\t}\\n\\ttask_unlock(task);\\n\\treturn result;\\n}\",\n \"static int proc_cwd_link(struct inode *inode, struct path *path)\\n{\\n\\tstruct task_struct *task = get_proc_task(inode);\\n\\tint result = -ENOENT;\",\n \"\\tif (task) {\\n\\t\\ttask_lock(task);\\n\\t\\tif (task->fs) {\\n\\t\\t\\tget_fs_pwd(task->fs, path);\\n\\t\\t\\tresult = 0;\\n\\t\\t}\\n\\t\\ttask_unlock(task);\\n\\t\\tput_task_struct(task);\\n\\t}\\n\\treturn result;\\n}\",\n \"static int proc_root_link(struct inode *inode, struct path *path)\\n{\\n\\tstruct task_struct *task = get_proc_task(inode);\\n\\tint result = -ENOENT;\",\n \"\\tif (task) {\\n\\t\\tresult = get_task_root(task, path);\\n\\t\\tput_task_struct(task);\\n\\t}\\n\\treturn result;\\n}\",\n \"static struct mm_struct *__check_mem_permission(struct task_struct *task)\\n{\\n\\tstruct mm_struct *mm;\",\n \"\\tmm = get_task_mm(task);\\n\\tif (!mm)\\n\\t\\treturn ERR_PTR(-EINVAL);\",\n \"\\t/*\\n\\t * A task can always look at itself, in case it chooses\\n\\t * to use system calls instead of load instructions.\\n\\t */\\n\\tif (task == current)\\n\\t\\treturn mm;\",\n \"\\t/*\\n\\t * If current is actively ptrace'ing, and would also be\\n\\t * permitted to freshly attach with ptrace now, permit it.\\n\\t */\\n\\tif (task_is_stopped_or_traced(task)) {\\n\\t\\tint match;\\n\\t\\trcu_read_lock();\\n\\t\\tmatch = (tracehook_tracer_task(task) == current);\\n\\t\\trcu_read_unlock();\\n\\t\\tif (match && ptrace_may_access(task, PTRACE_MODE_ATTACH))\\n\\t\\t\\treturn mm;\\n\\t}\",\n \"\\t/*\\n\\t * No one else is allowed.\\n\\t */\\n\\tmmput(mm);\\n\\treturn ERR_PTR(-EPERM);\\n}\",\n \"/*\\n * If current may access user memory in @task return a reference to the\\n * corresponding mm, otherwise ERR_PTR.\\n */\\nstatic struct mm_struct *check_mem_permission(struct task_struct *task)\\n{\\n\\tstruct mm_struct *mm;\\n\\tint err;\",\n \"\\t/*\\n\\t * Avoid racing if task exec's as we might get a new mm but validate\\n\\t * against old credentials.\\n\\t */\\n\\terr = mutex_lock_killable(&task->signal->cred_guard_mutex);\\n\\tif (err)\\n\\t\\treturn ERR_PTR(err);\",\n \"\\tmm = __check_mem_permission(task);\\n\\tmutex_unlock(&task->signal->cred_guard_mutex);\",\n \"\\treturn mm;\\n}\",\n \"struct mm_struct *mm_for_maps(struct task_struct *task)\\n{\\n\\tstruct mm_struct *mm;\\n\\tint err;\",\n \"\\terr = mutex_lock_killable(&task->signal->cred_guard_mutex);\\n\\tif (err)\\n\\t\\treturn ERR_PTR(err);\",\n \"\\tmm = get_task_mm(task);\\n\\tif (mm && mm != current->mm &&\\n\\t\\t\\t!ptrace_may_access(task, PTRACE_MODE_READ)) {\\n\\t\\tmmput(mm);\\n\\t\\tmm = ERR_PTR(-EACCES);\\n\\t}\\n\\tmutex_unlock(&task->signal->cred_guard_mutex);\",\n \"\\treturn mm;\\n}\",\n \"static int proc_pid_cmdline(struct task_struct *task, char * buffer)\\n{\\n\\tint res = 0;\\n\\tunsigned int len;\\n\\tstruct mm_struct *mm = get_task_mm(task);\\n\\tif (!mm)\\n\\t\\tgoto out;\\n\\tif (!mm->arg_end)\\n\\t\\tgoto out_mm;\\t/* Shh! No looking before we're done */\",\n \" \\tlen = mm->arg_end - mm->arg_start;\\n \\n\\tif (len > PAGE_SIZE)\\n\\t\\tlen = PAGE_SIZE;\\n \\n\\tres = access_process_vm(task, mm->arg_start, buffer, len, 0);\",\n \"\\t// If the nul at the end of args has been overwritten, then\\n\\t// assume application is using setproctitle(3).\\n\\tif (res > 0 && buffer[res-1] != '\\\\0' && len < PAGE_SIZE) {\\n\\t\\tlen = strnlen(buffer, res);\\n\\t\\tif (len < res) {\\n\\t\\t res = len;\\n\\t\\t} else {\\n\\t\\t\\tlen = mm->env_end - mm->env_start;\\n\\t\\t\\tif (len > PAGE_SIZE - res)\\n\\t\\t\\t\\tlen = PAGE_SIZE - res;\\n\\t\\t\\tres += access_process_vm(task, mm->env_start, buffer+res, len, 0);\\n\\t\\t\\tres = strnlen(buffer, res);\\n\\t\\t}\\n\\t}\\nout_mm:\\n\\tmmput(mm);\\nout:\\n\\treturn res;\\n}\",\n \"static int proc_pid_auxv(struct task_struct *task, char *buffer)\\n{\\n\\tstruct mm_struct *mm = mm_for_maps(task);\\n\\tint res = PTR_ERR(mm);\\n\\tif (mm && !IS_ERR(mm)) {\\n\\t\\tunsigned int nwords = 0;\\n\\t\\tdo {\\n\\t\\t\\tnwords += 2;\\n\\t\\t} while (mm->saved_auxv[nwords - 2] != 0); /* AT_NULL */\\n\\t\\tres = nwords * sizeof(mm->saved_auxv[0]);\\n\\t\\tif (res > PAGE_SIZE)\\n\\t\\t\\tres = PAGE_SIZE;\\n\\t\\tmemcpy(buffer, mm->saved_auxv, res);\\n\\t\\tmmput(mm);\\n\\t}\\n\\treturn res;\\n}\",\n \"\\n#ifdef CONFIG_KALLSYMS\\n/*\\n * Provides a wchan file via kallsyms in a proper one-value-per-file format.\\n * Returns the resolved symbol. If that fails, simply return the address.\\n */\\nstatic int proc_pid_wchan(struct task_struct *task, char *buffer)\\n{\\n\\tunsigned long wchan;\\n\\tchar symname[KSYM_NAME_LEN];\",\n \"\\twchan = get_wchan(task);\",\n \"\\tif (lookup_symbol_name(wchan, symname) < 0)\\n\\t\\tif (!ptrace_may_access(task, PTRACE_MODE_READ))\\n\\t\\t\\treturn 0;\\n\\t\\telse\\n\\t\\t\\treturn sprintf(buffer, \\\"%lu\\\", wchan);\\n\\telse\\n\\t\\treturn sprintf(buffer, \\\"%s\\\", symname);\\n}\\n#endif /* CONFIG_KALLSYMS */\",\n \"static int lock_trace(struct task_struct *task)\\n{\\n\\tint err = mutex_lock_killable(&task->signal->cred_guard_mutex);\\n\\tif (err)\\n\\t\\treturn err;\\n\\tif (!ptrace_may_access(task, PTRACE_MODE_ATTACH)) {\\n\\t\\tmutex_unlock(&task->signal->cred_guard_mutex);\\n\\t\\treturn -EPERM;\\n\\t}\\n\\treturn 0;\\n}\",\n \"static void unlock_trace(struct task_struct *task)\\n{\\n\\tmutex_unlock(&task->signal->cred_guard_mutex);\\n}\",\n \"#ifdef CONFIG_STACKTRACE\",\n \"#define MAX_STACK_TRACE_DEPTH\\t64\",\n \"static int proc_pid_stack(struct seq_file *m, struct pid_namespace *ns,\\n\\t\\t\\t struct pid *pid, struct task_struct *task)\\n{\\n\\tstruct stack_trace trace;\\n\\tunsigned long *entries;\\n\\tint err;\\n\\tint i;\",\n \"\\tentries = kmalloc(MAX_STACK_TRACE_DEPTH * sizeof(*entries), GFP_KERNEL);\\n\\tif (!entries)\\n\\t\\treturn -ENOMEM;\",\n \"\\ttrace.nr_entries\\t= 0;\\n\\ttrace.max_entries\\t= MAX_STACK_TRACE_DEPTH;\\n\\ttrace.entries\\t\\t= entries;\\n\\ttrace.skip\\t\\t= 0;\",\n \"\\terr = lock_trace(task);\\n\\tif (!err) {\\n\\t\\tsave_stack_trace_tsk(task, &trace);\",\n \"\\t\\tfor (i = 0; i < trace.nr_entries; i++) {\\n\\t\\t\\tseq_printf(m, \\\"[<%pK>] %pS\\\\n\\\",\\n\\t\\t\\t\\t (void *)entries[i], (void *)entries[i]);\\n\\t\\t}\\n\\t\\tunlock_trace(task);\\n\\t}\\n\\tkfree(entries);\",\n \"\\treturn err;\\n}\\n#endif\",\n \"#ifdef CONFIG_SCHEDSTATS\\n/*\\n * Provides /proc/PID/schedstat\\n */\\nstatic int proc_pid_schedstat(struct task_struct *task, char *buffer)\\n{\\n\\treturn sprintf(buffer, \\\"%llu %llu %lu\\\\n\\\",\\n\\t\\t\\t(unsigned long long)task->se.sum_exec_runtime,\\n\\t\\t\\t(unsigned long long)task->sched_info.run_delay,\\n\\t\\t\\ttask->sched_info.pcount);\\n}\\n#endif\",\n \"#ifdef CONFIG_LATENCYTOP\\nstatic int lstats_show_proc(struct seq_file *m, void *v)\\n{\\n\\tint i;\\n\\tstruct inode *inode = m->private;\\n\\tstruct task_struct *task = get_proc_task(inode);\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\\n\\tseq_puts(m, \\\"Latency Top version : v0.1\\\\n\\\");\\n\\tfor (i = 0; i < 32; i++) {\\n\\t\\tstruct latency_record *lr = &task->latency_record[i];\\n\\t\\tif (lr->backtrace[0]) {\\n\\t\\t\\tint q;\\n\\t\\t\\tseq_printf(m, \\\"%i %li %li\\\",\\n\\t\\t\\t\\t lr->count, lr->time, lr->max);\\n\\t\\t\\tfor (q = 0; q < LT_BACKTRACEDEPTH; q++) {\\n\\t\\t\\t\\tunsigned long bt = lr->backtrace[q];\\n\\t\\t\\t\\tif (!bt)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tif (bt == ULONG_MAX)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tseq_printf(m, \\\" %ps\\\", (void *)bt);\\n\\t\\t\\t}\\n\\t\\t\\tseq_putc(m, '\\\\n');\\n\\t\\t}\",\n \"\\t}\\n\\tput_task_struct(task);\\n\\treturn 0;\\n}\",\n \"static int lstats_open(struct inode *inode, struct file *file)\\n{\\n\\treturn single_open(file, lstats_show_proc, inode);\\n}\",\n \"static ssize_t lstats_write(struct file *file, const char __user *buf,\\n\\t\\t\\t size_t count, loff_t *offs)\\n{\\n\\tstruct task_struct *task = get_proc_task(file->f_dentry->d_inode);\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\\n\\tclear_all_latency_tracing(task);\\n\\tput_task_struct(task);\",\n \"\\treturn count;\\n}\",\n \"static const struct file_operations proc_lstats_operations = {\\n\\t.open\\t\\t= lstats_open,\\n\\t.read\\t\\t= seq_read,\\n\\t.write\\t\\t= lstats_write,\\n\\t.llseek\\t\\t= seq_lseek,\\n\\t.release\\t= single_release,\\n};\",\n \"#endif\",\n \"static int proc_oom_score(struct task_struct *task, char *buffer)\\n{\\n\\tunsigned long points = 0;\",\n \"\\tread_lock(&tasklist_lock);\\n\\tif (pid_alive(task))\\n\\t\\tpoints = oom_badness(task, NULL, NULL,\\n\\t\\t\\t\\t\\ttotalram_pages + total_swap_pages);\\n\\tread_unlock(&tasklist_lock);\\n\\treturn sprintf(buffer, \\\"%lu\\\\n\\\", points);\\n}\",\n \"struct limit_names {\\n\\tchar *name;\\n\\tchar *unit;\\n};\",\n \"static const struct limit_names lnames[RLIM_NLIMITS] = {\\n\\t[RLIMIT_CPU] = {\\\"Max cpu time\\\", \\\"seconds\\\"},\\n\\t[RLIMIT_FSIZE] = {\\\"Max file size\\\", \\\"bytes\\\"},\\n\\t[RLIMIT_DATA] = {\\\"Max data size\\\", \\\"bytes\\\"},\\n\\t[RLIMIT_STACK] = {\\\"Max stack size\\\", \\\"bytes\\\"},\\n\\t[RLIMIT_CORE] = {\\\"Max core file size\\\", \\\"bytes\\\"},\\n\\t[RLIMIT_RSS] = {\\\"Max resident set\\\", \\\"bytes\\\"},\\n\\t[RLIMIT_NPROC] = {\\\"Max processes\\\", \\\"processes\\\"},\\n\\t[RLIMIT_NOFILE] = {\\\"Max open files\\\", \\\"files\\\"},\\n\\t[RLIMIT_MEMLOCK] = {\\\"Max locked memory\\\", \\\"bytes\\\"},\\n\\t[RLIMIT_AS] = {\\\"Max address space\\\", \\\"bytes\\\"},\\n\\t[RLIMIT_LOCKS] = {\\\"Max file locks\\\", \\\"locks\\\"},\\n\\t[RLIMIT_SIGPENDING] = {\\\"Max pending signals\\\", \\\"signals\\\"},\\n\\t[RLIMIT_MSGQUEUE] = {\\\"Max msgqueue size\\\", \\\"bytes\\\"},\\n\\t[RLIMIT_NICE] = {\\\"Max nice priority\\\", NULL},\\n\\t[RLIMIT_RTPRIO] = {\\\"Max realtime priority\\\", NULL},\\n\\t[RLIMIT_RTTIME] = {\\\"Max realtime timeout\\\", \\\"us\\\"},\\n};\",\n \"/* Display limits for a process */\\nstatic int proc_pid_limits(struct task_struct *task, char *buffer)\\n{\\n\\tunsigned int i;\\n\\tint count = 0;\\n\\tunsigned long flags;\\n\\tchar *bufptr = buffer;\",\n \"\\tstruct rlimit rlim[RLIM_NLIMITS];\",\n \"\\tif (!lock_task_sighand(task, &flags))\\n\\t\\treturn 0;\\n\\tmemcpy(rlim, task->signal->rlim, sizeof(struct rlimit) * RLIM_NLIMITS);\\n\\tunlock_task_sighand(task, &flags);\",\n \"\\t/*\\n\\t * print the file header\\n\\t */\\n\\tcount += sprintf(&bufptr[count], \\\"%-25s %-20s %-20s %-10s\\\\n\\\",\\n\\t\\t\\t\\\"Limit\\\", \\\"Soft Limit\\\", \\\"Hard Limit\\\", \\\"Units\\\");\",\n \"\\tfor (i = 0; i < RLIM_NLIMITS; i++) {\\n\\t\\tif (rlim[i].rlim_cur == RLIM_INFINITY)\\n\\t\\t\\tcount += sprintf(&bufptr[count], \\\"%-25s %-20s \\\",\\n\\t\\t\\t\\t\\t lnames[i].name, \\\"unlimited\\\");\\n\\t\\telse\\n\\t\\t\\tcount += sprintf(&bufptr[count], \\\"%-25s %-20lu \\\",\\n\\t\\t\\t\\t\\t lnames[i].name, rlim[i].rlim_cur);\",\n \"\\t\\tif (rlim[i].rlim_max == RLIM_INFINITY)\\n\\t\\t\\tcount += sprintf(&bufptr[count], \\\"%-20s \\\", \\\"unlimited\\\");\\n\\t\\telse\\n\\t\\t\\tcount += sprintf(&bufptr[count], \\\"%-20lu \\\",\\n\\t\\t\\t\\t\\t rlim[i].rlim_max);\",\n \"\\t\\tif (lnames[i].unit)\\n\\t\\t\\tcount += sprintf(&bufptr[count], \\\"%-10s\\\\n\\\",\\n\\t\\t\\t\\t\\t lnames[i].unit);\\n\\t\\telse\\n\\t\\t\\tcount += sprintf(&bufptr[count], \\\"\\\\n\\\");\\n\\t}\",\n \"\\treturn count;\\n}\",\n \"#ifdef CONFIG_HAVE_ARCH_TRACEHOOK\\nstatic int proc_pid_syscall(struct task_struct *task, char *buffer)\\n{\\n\\tlong nr;\\n\\tunsigned long args[6], sp, pc;\\n\\tint res = lock_trace(task);\\n\\tif (res)\\n\\t\\treturn res;\",\n \"\\tif (task_current_syscall(task, &nr, args, 6, &sp, &pc))\\n\\t\\tres = sprintf(buffer, \\\"running\\\\n\\\");\\n\\telse if (nr < 0)\\n\\t\\tres = sprintf(buffer, \\\"%ld 0x%lx 0x%lx\\\\n\\\", nr, sp, pc);\\n\\telse\\n\\t\\tres = sprintf(buffer,\\n\\t\\t \\\"%ld 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx\\\\n\\\",\\n\\t\\t nr,\\n\\t\\t args[0], args[1], args[2], args[3], args[4], args[5],\\n\\t\\t sp, pc);\\n\\tunlock_trace(task);\\n\\treturn res;\\n}\\n#endif /* CONFIG_HAVE_ARCH_TRACEHOOK */\",\n \"/************************************************************************/\\n/* Here the fs part begins */\\n/************************************************************************/\",\n \"/* permission checks */\\nstatic int proc_fd_access_allowed(struct inode *inode)\\n{\\n\\tstruct task_struct *task;\\n\\tint allowed = 0;\\n\\t/* Allow access to a task's file descriptors if it is us or we\\n\\t * may use ptrace attach to the process and find out that\\n\\t * information.\\n\\t */\\n\\ttask = get_proc_task(inode);\\n\\tif (task) {\\n\\t\\tallowed = ptrace_may_access(task, PTRACE_MODE_READ);\\n\\t\\tput_task_struct(task);\\n\\t}\\n\\treturn allowed;\\n}\",\n \"int proc_setattr(struct dentry *dentry, struct iattr *attr)\\n{\\n\\tint error;\\n\\tstruct inode *inode = dentry->d_inode;\",\n \"\\tif (attr->ia_valid & ATTR_MODE)\\n\\t\\treturn -EPERM;\",\n \"\\terror = inode_change_ok(inode, attr);\\n\\tif (error)\\n\\t\\treturn error;\",\n \"\\tif ((attr->ia_valid & ATTR_SIZE) &&\\n\\t attr->ia_size != i_size_read(inode)) {\\n\\t\\terror = vmtruncate(inode, attr->ia_size);\\n\\t\\tif (error)\\n\\t\\t\\treturn error;\\n\\t}\",\n \"\\tsetattr_copy(inode, attr);\\n\\tmark_inode_dirty(inode);\\n\\treturn 0;\\n}\",\n \"static const struct inode_operations proc_def_inode_operations = {\\n\\t.setattr\\t= proc_setattr,\\n};\",\n \"static int mounts_open_common(struct inode *inode, struct file *file,\\n\\t\\t\\t const struct seq_operations *op)\\n{\\n\\tstruct task_struct *task = get_proc_task(inode);\\n\\tstruct nsproxy *nsp;\\n\\tstruct mnt_namespace *ns = NULL;\\n\\tstruct path root;\\n\\tstruct proc_mounts *p;\\n\\tint ret = -EINVAL;\",\n \"\\tif (task) {\\n\\t\\trcu_read_lock();\\n\\t\\tnsp = task_nsproxy(task);\\n\\t\\tif (nsp) {\\n\\t\\t\\tns = nsp->mnt_ns;\\n\\t\\t\\tif (ns)\\n\\t\\t\\t\\tget_mnt_ns(ns);\\n\\t\\t}\\n\\t\\trcu_read_unlock();\\n\\t\\tif (ns && get_task_root(task, &root) == 0)\\n\\t\\t\\tret = 0;\\n\\t\\tput_task_struct(task);\\n\\t}\",\n \"\\tif (!ns)\\n\\t\\tgoto err;\\n\\tif (ret)\\n\\t\\tgoto err_put_ns;\",\n \"\\tret = -ENOMEM;\\n\\tp = kmalloc(sizeof(struct proc_mounts), GFP_KERNEL);\\n\\tif (!p)\\n\\t\\tgoto err_put_path;\",\n \"\\tfile->private_data = &p->m;\\n\\tret = seq_open(file, op);\\n\\tif (ret)\\n\\t\\tgoto err_free;\",\n \"\\tp->m.private = p;\\n\\tp->ns = ns;\\n\\tp->root = root;\\n\\tp->event = ns->event;\",\n \"\\treturn 0;\",\n \" err_free:\\n\\tkfree(p);\\n err_put_path:\\n\\tpath_put(&root);\\n err_put_ns:\\n\\tput_mnt_ns(ns);\\n err:\\n\\treturn ret;\\n}\",\n \"static int mounts_release(struct inode *inode, struct file *file)\\n{\\n\\tstruct proc_mounts *p = file->private_data;\\n\\tpath_put(&p->root);\\n\\tput_mnt_ns(p->ns);\\n\\treturn seq_release(inode, file);\\n}\",\n \"static unsigned mounts_poll(struct file *file, poll_table *wait)\\n{\\n\\tstruct proc_mounts *p = file->private_data;\\n\\tunsigned res = POLLIN | POLLRDNORM;\",\n \"\\tpoll_wait(file, &p->ns->poll, wait);\\n\\tif (mnt_had_events(p))\\n\\t\\tres |= POLLERR | POLLPRI;\",\n \"\\treturn res;\\n}\",\n \"static int mounts_open(struct inode *inode, struct file *file)\\n{\\n\\treturn mounts_open_common(inode, file, &mounts_op);\\n}\",\n \"static const struct file_operations proc_mounts_operations = {\\n\\t.open\\t\\t= mounts_open,\\n\\t.read\\t\\t= seq_read,\\n\\t.llseek\\t\\t= seq_lseek,\\n\\t.release\\t= mounts_release,\\n\\t.poll\\t\\t= mounts_poll,\\n};\",\n \"static int mountinfo_open(struct inode *inode, struct file *file)\\n{\\n\\treturn mounts_open_common(inode, file, &mountinfo_op);\\n}\",\n \"static const struct file_operations proc_mountinfo_operations = {\\n\\t.open\\t\\t= mountinfo_open,\\n\\t.read\\t\\t= seq_read,\\n\\t.llseek\\t\\t= seq_lseek,\\n\\t.release\\t= mounts_release,\\n\\t.poll\\t\\t= mounts_poll,\\n};\",\n \"static int mountstats_open(struct inode *inode, struct file *file)\\n{\\n\\treturn mounts_open_common(inode, file, &mountstats_op);\\n}\",\n \"static const struct file_operations proc_mountstats_operations = {\\n\\t.open\\t\\t= mountstats_open,\\n\\t.read\\t\\t= seq_read,\\n\\t.llseek\\t\\t= seq_lseek,\\n\\t.release\\t= mounts_release,\\n};\",\n \"#define PROC_BLOCK_SIZE\\t(3*1024)\\t\\t/* 4K page size but our output routines use some slack for overruns */\",\n \"static ssize_t proc_info_read(struct file * file, char __user * buf,\\n\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tstruct inode * inode = file->f_path.dentry->d_inode;\\n\\tunsigned long page;\\n\\tssize_t length;\\n\\tstruct task_struct *task = get_proc_task(inode);\",\n \"\\tlength = -ESRCH;\\n\\tif (!task)\\n\\t\\tgoto out_no_task;\",\n \"\\tif (count > PROC_BLOCK_SIZE)\\n\\t\\tcount = PROC_BLOCK_SIZE;\",\n \"\\tlength = -ENOMEM;\\n\\tif (!(page = __get_free_page(GFP_TEMPORARY)))\\n\\t\\tgoto out;\",\n \"\\tlength = PROC_I(inode)->op.proc_read(task, (char*)page);\",\n \"\\tif (length >= 0)\\n\\t\\tlength = simple_read_from_buffer(buf, count, ppos, (char *)page, length);\\n\\tfree_page(page);\\nout:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn length;\\n}\",\n \"static const struct file_operations proc_info_file_operations = {\\n\\t.read\\t\\t= proc_info_read,\\n\\t.llseek\\t\\t= generic_file_llseek,\\n};\",\n \"static int proc_single_show(struct seq_file *m, void *v)\\n{\\n\\tstruct inode *inode = m->private;\\n\\tstruct pid_namespace *ns;\\n\\tstruct pid *pid;\\n\\tstruct task_struct *task;\\n\\tint ret;\",\n \"\\tns = inode->i_sb->s_fs_info;\\n\\tpid = proc_pid(inode);\\n\\ttask = get_pid_task(pid, PIDTYPE_PID);\\n\\tif (!task)\\n\\t\\treturn -ESRCH;\",\n \"\\tret = PROC_I(inode)->op.proc_show(m, ns, pid, task);\",\n \"\\tput_task_struct(task);\\n\\treturn ret;\\n}\",\n \"static int proc_single_open(struct inode *inode, struct file *filp)\\n{\\n\\treturn single_open(filp, proc_single_show, inode);\\n}\",\n \"static const struct file_operations proc_single_file_operations = {\\n\\t.open\\t\\t= proc_single_open,\\n\\t.read\\t\\t= seq_read,\\n\\t.llseek\\t\\t= seq_lseek,\\n\\t.release\\t= single_release,\\n};\",\n \"static int mem_open(struct inode* inode, struct file* file)\\n{\\n\\tfile->private_data = (void*)((long)current->self_exec_id);\\n\\t/* OK to pass negative loff_t, we can catch out-of-range */\\n\\tfile->f_mode |= FMODE_UNSIGNED_OFFSET;\\n\\treturn 0;\\n}\",\n \"static ssize_t mem_read(struct file * file, char __user * buf,\\n\\t\\t\\tsize_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);\\n\\tchar *page;\\n\\tunsigned long src = *ppos;\\n\\tint ret = -ESRCH;\\n\\tstruct mm_struct *mm;\",\n \"\\tif (!task)\\n\\t\\tgoto out_no_task;\",\n \"\\tret = -ENOMEM;\\n\\tpage = (char *)__get_free_page(GFP_TEMPORARY);\\n\\tif (!page)\\n\\t\\tgoto out;\",\n \"\\tmm = check_mem_permission(task);\\n\\tret = PTR_ERR(mm);\\n\\tif (IS_ERR(mm))\\n\\t\\tgoto out_free;\",\n \"\\tret = -EIO;\\n \\n\\tif (file->private_data != (void*)((long)current->self_exec_id))\\n\\t\\tgoto out_put;\",\n \"\\tret = 0;\\n \\n\\twhile (count > 0) {\\n\\t\\tint this_len, retval;\",\n \"\\t\\tthis_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;\\n\\t\\tretval = access_remote_vm(mm, src, page, this_len, 0);\\n\\t\\tif (!retval) {\\n\\t\\t\\tif (!ret)\\n\\t\\t\\t\\tret = -EIO;\\n\\t\\t\\tbreak;\\n\\t\\t}\",\n \"\\t\\tif (copy_to_user(buf, page, retval)) {\\n\\t\\t\\tret = -EFAULT;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n \\n\\t\\tret += retval;\\n\\t\\tsrc += retval;\\n\\t\\tbuf += retval;\\n\\t\\tcount -= retval;\\n\\t}\\n\\t*ppos = src;\",\n \"out_put:\\n\\tmmput(mm);\\nout_free:\\n\\tfree_page((unsigned long) page);\\nout:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn ret;\\n}\",\n \"static ssize_t mem_write(struct file * file, const char __user *buf,\\n\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tint copied;\\n\\tchar *page;\\n\\tstruct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);\\n\\tunsigned long dst = *ppos;\\n\\tstruct mm_struct *mm;\",\n \"\\tcopied = -ESRCH;\\n\\tif (!task)\\n\\t\\tgoto out_no_task;\",\n \"\\tcopied = -ENOMEM;\\n\\tpage = (char *)__get_free_page(GFP_TEMPORARY);\\n\\tif (!page)\\n\\t\\tgoto out_task;\",\n \"\\tmm = check_mem_permission(task);\\n\\tcopied = PTR_ERR(mm);\\n\\tif (IS_ERR(mm))\\n\\t\\tgoto out_free;\",\n \"\\tcopied = -EIO;\\n\\tif (file->private_data != (void *)((long)current->self_exec_id))\\n\\t\\tgoto out_mm;\",\n \"\\tcopied = 0;\\n\\twhile (count > 0) {\\n\\t\\tint this_len, retval;\",\n \"\\t\\tthis_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;\\n\\t\\tif (copy_from_user(page, buf, this_len)) {\\n\\t\\t\\tcopied = -EFAULT;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tretval = access_remote_vm(mm, dst, page, this_len, 1);\\n\\t\\tif (!retval) {\\n\\t\\t\\tif (!copied)\\n\\t\\t\\t\\tcopied = -EIO;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tcopied += retval;\\n\\t\\tbuf += retval;\\n\\t\\tdst += retval;\\n\\t\\tcount -= retval;\\t\\t\\t\\n\\t}\\n\\t*ppos = dst;\",\n \"out_mm:\\n\\tmmput(mm);\\nout_free:\\n\\tfree_page((unsigned long) page);\\nout_task:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn copied;\\n}\",\n \"loff_t mem_lseek(struct file *file, loff_t offset, int orig)\\n{\\n\\tswitch (orig) {\\n\\tcase 0:\\n\\t\\tfile->f_pos = offset;\\n\\t\\tbreak;\\n\\tcase 1:\\n\\t\\tfile->f_pos += offset;\\n\\t\\tbreak;\\n\\tdefault:\\n\\t\\treturn -EINVAL;\\n\\t}\\n\\tforce_successful_syscall_return();\\n\\treturn file->f_pos;\\n}\",\n \"static const struct file_operations proc_mem_operations = {\\n\\t.llseek\\t\\t= mem_lseek,\\n\\t.read\\t\\t= mem_read,\\n\\t.write\\t\\t= mem_write,\\n\\t.open\\t\\t= mem_open,\\n};\",\n \"static ssize_t environ_read(struct file *file, char __user *buf,\\n\\t\\t\\tsize_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task = get_proc_task(file->f_dentry->d_inode);\\n\\tchar *page;\\n\\tunsigned long src = *ppos;\\n\\tint ret = -ESRCH;\\n\\tstruct mm_struct *mm;\",\n \"\\tif (!task)\\n\\t\\tgoto out_no_task;\",\n \"\\tret = -ENOMEM;\\n\\tpage = (char *)__get_free_page(GFP_TEMPORARY);\\n\\tif (!page)\\n\\t\\tgoto out;\",\n \"\\n\\tmm = mm_for_maps(task);\\n\\tret = PTR_ERR(mm);\\n\\tif (!mm || IS_ERR(mm))\\n\\t\\tgoto out_free;\",\n \"\\tret = 0;\\n\\twhile (count > 0) {\\n\\t\\tint this_len, retval, max_len;\",\n \"\\t\\tthis_len = mm->env_end - (mm->env_start + src);\",\n \"\\t\\tif (this_len <= 0)\\n\\t\\t\\tbreak;\",\n \"\\t\\tmax_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;\\n\\t\\tthis_len = (this_len > max_len) ? max_len : this_len;\",\n \"\\t\\tretval = access_process_vm(task, (mm->env_start + src),\\n\\t\\t\\tpage, this_len, 0);\",\n \"\\t\\tif (retval <= 0) {\\n\\t\\t\\tret = retval;\\n\\t\\t\\tbreak;\\n\\t\\t}\",\n \"\\t\\tif (copy_to_user(buf, page, retval)) {\\n\\t\\t\\tret = -EFAULT;\\n\\t\\t\\tbreak;\\n\\t\\t}\",\n \"\\t\\tret += retval;\\n\\t\\tsrc += retval;\\n\\t\\tbuf += retval;\\n\\t\\tcount -= retval;\\n\\t}\\n\\t*ppos = src;\",\n \"\\tmmput(mm);\\nout_free:\\n\\tfree_page((unsigned long) page);\\nout:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn ret;\\n}\",\n \"static const struct file_operations proc_environ_operations = {\\n\\t.read\\t\\t= environ_read,\\n\\t.llseek\\t\\t= generic_file_llseek,\\n};\",\n \"static ssize_t oom_adjust_read(struct file *file, char __user *buf,\\n\\t\\t\\t\\tsize_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);\\n\\tchar buffer[PROC_NUMBUF];\\n\\tsize_t len;\\n\\tint oom_adjust = OOM_DISABLE;\\n\\tunsigned long flags;\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\",\n \"\\tif (lock_task_sighand(task, &flags)) {\\n\\t\\toom_adjust = task->signal->oom_adj;\\n\\t\\tunlock_task_sighand(task, &flags);\\n\\t}\",\n \"\\tput_task_struct(task);\",\n \"\\tlen = snprintf(buffer, sizeof(buffer), \\\"%i\\\\n\\\", oom_adjust);\",\n \"\\treturn simple_read_from_buffer(buf, count, ppos, buffer, len);\\n}\",\n \"static ssize_t oom_adjust_write(struct file *file, const char __user *buf,\\n\\t\\t\\t\\tsize_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task;\\n\\tchar buffer[PROC_NUMBUF];\\n\\tint oom_adjust;\\n\\tunsigned long flags;\\n\\tint err;\",\n \"\\tmemset(buffer, 0, sizeof(buffer));\\n\\tif (count > sizeof(buffer) - 1)\\n\\t\\tcount = sizeof(buffer) - 1;\\n\\tif (copy_from_user(buffer, buf, count)) {\\n\\t\\terr = -EFAULT;\\n\\t\\tgoto out;\\n\\t}\",\n \"\\terr = kstrtoint(strstrip(buffer), 0, &oom_adjust);\\n\\tif (err)\\n\\t\\tgoto out;\\n\\tif ((oom_adjust < OOM_ADJUST_MIN || oom_adjust > OOM_ADJUST_MAX) &&\\n\\t oom_adjust != OOM_DISABLE) {\\n\\t\\terr = -EINVAL;\\n\\t\\tgoto out;\\n\\t}\",\n \"\\ttask = get_proc_task(file->f_path.dentry->d_inode);\\n\\tif (!task) {\\n\\t\\terr = -ESRCH;\\n\\t\\tgoto out;\\n\\t}\",\n \"\\ttask_lock(task);\\n\\tif (!task->mm) {\\n\\t\\terr = -EINVAL;\\n\\t\\tgoto err_task_lock;\\n\\t}\",\n \"\\tif (!lock_task_sighand(task, &flags)) {\\n\\t\\terr = -ESRCH;\\n\\t\\tgoto err_task_lock;\\n\\t}\",\n \"\\tif (oom_adjust < task->signal->oom_adj && !capable(CAP_SYS_RESOURCE)) {\\n\\t\\terr = -EACCES;\\n\\t\\tgoto err_sighand;\\n\\t}\",\n \"\\tif (oom_adjust != task->signal->oom_adj) {\\n\\t\\tif (oom_adjust == OOM_DISABLE)\\n\\t\\t\\tatomic_inc(&task->mm->oom_disable_count);\\n\\t\\tif (task->signal->oom_adj == OOM_DISABLE)\\n\\t\\t\\tatomic_dec(&task->mm->oom_disable_count);\\n\\t}\",\n \"\\t/*\\n\\t * Warn that /proc/pid/oom_adj is deprecated, see\\n\\t * Documentation/feature-removal-schedule.txt.\\n\\t */\\n\\tprintk_once(KERN_WARNING \\\"%s (%d): /proc/%d/oom_adj is deprecated, \\\"\\n\\t\\t\\t\\\"please use /proc/%d/oom_score_adj instead.\\\\n\\\",\\n\\t\\t\\tcurrent->comm, task_pid_nr(current),\\n\\t\\t\\ttask_pid_nr(task), task_pid_nr(task));\\n\\ttask->signal->oom_adj = oom_adjust;\\n\\t/*\\n\\t * Scale /proc/pid/oom_score_adj appropriately ensuring that a maximum\\n\\t * value is always attainable.\\n\\t */\\n\\tif (task->signal->oom_adj == OOM_ADJUST_MAX)\\n\\t\\ttask->signal->oom_score_adj = OOM_SCORE_ADJ_MAX;\\n\\telse\\n\\t\\ttask->signal->oom_score_adj = (oom_adjust * OOM_SCORE_ADJ_MAX) /\\n\\t\\t\\t\\t\\t\\t\\t\\t-OOM_DISABLE;\\nerr_sighand:\\n\\tunlock_task_sighand(task, &flags);\\nerr_task_lock:\\n\\ttask_unlock(task);\\n\\tput_task_struct(task);\\nout:\\n\\treturn err < 0 ? err : count;\\n}\",\n \"static const struct file_operations proc_oom_adjust_operations = {\\n\\t.read\\t\\t= oom_adjust_read,\\n\\t.write\\t\\t= oom_adjust_write,\\n\\t.llseek\\t\\t= generic_file_llseek,\\n};\",\n \"static ssize_t oom_score_adj_read(struct file *file, char __user *buf,\\n\\t\\t\\t\\t\\tsize_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);\\n\\tchar buffer[PROC_NUMBUF];\\n\\tint oom_score_adj = OOM_SCORE_ADJ_MIN;\\n\\tunsigned long flags;\\n\\tsize_t len;\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\\n\\tif (lock_task_sighand(task, &flags)) {\\n\\t\\toom_score_adj = task->signal->oom_score_adj;\\n\\t\\tunlock_task_sighand(task, &flags);\\n\\t}\\n\\tput_task_struct(task);\\n\\tlen = snprintf(buffer, sizeof(buffer), \\\"%d\\\\n\\\", oom_score_adj);\\n\\treturn simple_read_from_buffer(buf, count, ppos, buffer, len);\\n}\",\n \"static ssize_t oom_score_adj_write(struct file *file, const char __user *buf,\\n\\t\\t\\t\\t\\tsize_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task;\\n\\tchar buffer[PROC_NUMBUF];\\n\\tunsigned long flags;\\n\\tint oom_score_adj;\\n\\tint err;\",\n \"\\tmemset(buffer, 0, sizeof(buffer));\\n\\tif (count > sizeof(buffer) - 1)\\n\\t\\tcount = sizeof(buffer) - 1;\\n\\tif (copy_from_user(buffer, buf, count)) {\\n\\t\\terr = -EFAULT;\\n\\t\\tgoto out;\\n\\t}\",\n \"\\terr = kstrtoint(strstrip(buffer), 0, &oom_score_adj);\\n\\tif (err)\\n\\t\\tgoto out;\\n\\tif (oom_score_adj < OOM_SCORE_ADJ_MIN ||\\n\\t\\t\\toom_score_adj > OOM_SCORE_ADJ_MAX) {\\n\\t\\terr = -EINVAL;\\n\\t\\tgoto out;\\n\\t}\",\n \"\\ttask = get_proc_task(file->f_path.dentry->d_inode);\\n\\tif (!task) {\\n\\t\\terr = -ESRCH;\\n\\t\\tgoto out;\\n\\t}\",\n \"\\ttask_lock(task);\\n\\tif (!task->mm) {\\n\\t\\terr = -EINVAL;\\n\\t\\tgoto err_task_lock;\\n\\t}\",\n \"\\tif (!lock_task_sighand(task, &flags)) {\\n\\t\\terr = -ESRCH;\\n\\t\\tgoto err_task_lock;\\n\\t}\",\n \"\\tif (oom_score_adj < task->signal->oom_score_adj_min &&\\n\\t\\t\\t!capable(CAP_SYS_RESOURCE)) {\\n\\t\\terr = -EACCES;\\n\\t\\tgoto err_sighand;\\n\\t}\",\n \"\\tif (oom_score_adj != task->signal->oom_score_adj) {\\n\\t\\tif (oom_score_adj == OOM_SCORE_ADJ_MIN)\\n\\t\\t\\tatomic_inc(&task->mm->oom_disable_count);\\n\\t\\tif (task->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)\\n\\t\\t\\tatomic_dec(&task->mm->oom_disable_count);\\n\\t}\\n\\ttask->signal->oom_score_adj = oom_score_adj;\\n\\tif (has_capability_noaudit(current, CAP_SYS_RESOURCE))\\n\\t\\ttask->signal->oom_score_adj_min = oom_score_adj;\\n\\t/*\\n\\t * Scale /proc/pid/oom_adj appropriately ensuring that OOM_DISABLE is\\n\\t * always attainable.\\n\\t */\\n\\tif (task->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)\\n\\t\\ttask->signal->oom_adj = OOM_DISABLE;\\n\\telse\\n\\t\\ttask->signal->oom_adj = (oom_score_adj * OOM_ADJUST_MAX) /\\n\\t\\t\\t\\t\\t\\t\\tOOM_SCORE_ADJ_MAX;\\nerr_sighand:\\n\\tunlock_task_sighand(task, &flags);\\nerr_task_lock:\\n\\ttask_unlock(task);\\n\\tput_task_struct(task);\\nout:\\n\\treturn err < 0 ? err : count;\\n}\",\n \"static const struct file_operations proc_oom_score_adj_operations = {\\n\\t.read\\t\\t= oom_score_adj_read,\\n\\t.write\\t\\t= oom_score_adj_write,\\n\\t.llseek\\t\\t= default_llseek,\\n};\",\n \"#ifdef CONFIG_AUDITSYSCALL\\n#define TMPBUFLEN 21\\nstatic ssize_t proc_loginuid_read(struct file * file, char __user * buf,\\n\\t\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tstruct inode * inode = file->f_path.dentry->d_inode;\\n\\tstruct task_struct *task = get_proc_task(inode);\\n\\tssize_t length;\\n\\tchar tmpbuf[TMPBUFLEN];\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\\n\\tlength = scnprintf(tmpbuf, TMPBUFLEN, \\\"%u\\\",\\n\\t\\t\\t\\taudit_get_loginuid(task));\\n\\tput_task_struct(task);\\n\\treturn simple_read_from_buffer(buf, count, ppos, tmpbuf, length);\\n}\",\n \"static ssize_t proc_loginuid_write(struct file * file, const char __user * buf,\\n\\t\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tstruct inode * inode = file->f_path.dentry->d_inode;\\n\\tchar *page, *tmp;\\n\\tssize_t length;\\n\\tuid_t loginuid;\",\n \"\\tif (!capable(CAP_AUDIT_CONTROL))\\n\\t\\treturn -EPERM;\",\n \"\\trcu_read_lock();\\n\\tif (current != pid_task(proc_pid(inode), PIDTYPE_PID)) {\\n\\t\\trcu_read_unlock();\\n\\t\\treturn -EPERM;\\n\\t}\\n\\trcu_read_unlock();\",\n \"\\tif (count >= PAGE_SIZE)\\n\\t\\tcount = PAGE_SIZE - 1;\",\n \"\\tif (*ppos != 0) {\\n\\t\\t/* No partial writes. */\\n\\t\\treturn -EINVAL;\\n\\t}\\n\\tpage = (char*)__get_free_page(GFP_TEMPORARY);\\n\\tif (!page)\\n\\t\\treturn -ENOMEM;\\n\\tlength = -EFAULT;\\n\\tif (copy_from_user(page, buf, count))\\n\\t\\tgoto out_free_page;\",\n \"\\tpage[count] = '\\\\0';\\n\\tloginuid = simple_strtoul(page, &tmp, 10);\\n\\tif (tmp == page) {\\n\\t\\tlength = -EINVAL;\\n\\t\\tgoto out_free_page;\",\n \"\\t}\\n\\tlength = audit_set_loginuid(current, loginuid);\\n\\tif (likely(length == 0))\\n\\t\\tlength = count;\",\n \"out_free_page:\\n\\tfree_page((unsigned long) page);\\n\\treturn length;\\n}\",\n \"static const struct file_operations proc_loginuid_operations = {\\n\\t.read\\t\\t= proc_loginuid_read,\\n\\t.write\\t\\t= proc_loginuid_write,\\n\\t.llseek\\t\\t= generic_file_llseek,\\n};\",\n \"static ssize_t proc_sessionid_read(struct file * file, char __user * buf,\\n\\t\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tstruct inode * inode = file->f_path.dentry->d_inode;\\n\\tstruct task_struct *task = get_proc_task(inode);\\n\\tssize_t length;\\n\\tchar tmpbuf[TMPBUFLEN];\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\\n\\tlength = scnprintf(tmpbuf, TMPBUFLEN, \\\"%u\\\",\\n\\t\\t\\t\\taudit_get_sessionid(task));\\n\\tput_task_struct(task);\\n\\treturn simple_read_from_buffer(buf, count, ppos, tmpbuf, length);\\n}\",\n \"static const struct file_operations proc_sessionid_operations = {\\n\\t.read\\t\\t= proc_sessionid_read,\\n\\t.llseek\\t\\t= generic_file_llseek,\\n};\\n#endif\",\n \"#ifdef CONFIG_FAULT_INJECTION\\nstatic ssize_t proc_fault_inject_read(struct file * file, char __user * buf,\\n\\t\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task = get_proc_task(file->f_dentry->d_inode);\\n\\tchar buffer[PROC_NUMBUF];\\n\\tsize_t len;\\n\\tint make_it_fail;\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\\n\\tmake_it_fail = task->make_it_fail;\\n\\tput_task_struct(task);\",\n \"\\tlen = snprintf(buffer, sizeof(buffer), \\\"%i\\\\n\\\", make_it_fail);\",\n \"\\treturn simple_read_from_buffer(buf, count, ppos, buffer, len);\\n}\",\n \"static ssize_t proc_fault_inject_write(struct file * file,\\n\\t\\t\\tconst char __user * buf, size_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task;\\n\\tchar buffer[PROC_NUMBUF], *end;\\n\\tint make_it_fail;\",\n \"\\tif (!capable(CAP_SYS_RESOURCE))\\n\\t\\treturn -EPERM;\\n\\tmemset(buffer, 0, sizeof(buffer));\\n\\tif (count > sizeof(buffer) - 1)\\n\\t\\tcount = sizeof(buffer) - 1;\\n\\tif (copy_from_user(buffer, buf, count))\\n\\t\\treturn -EFAULT;\\n\\tmake_it_fail = simple_strtol(strstrip(buffer), &end, 0);\\n\\tif (*end)\\n\\t\\treturn -EINVAL;\\n\\ttask = get_proc_task(file->f_dentry->d_inode);\\n\\tif (!task)\\n\\t\\treturn -ESRCH;\\n\\ttask->make_it_fail = make_it_fail;\\n\\tput_task_struct(task);\",\n \"\\treturn count;\\n}\",\n \"static const struct file_operations proc_fault_inject_operations = {\\n\\t.read\\t\\t= proc_fault_inject_read,\\n\\t.write\\t\\t= proc_fault_inject_write,\\n\\t.llseek\\t\\t= generic_file_llseek,\\n};\\n#endif\",\n \"\\n#ifdef CONFIG_SCHED_DEBUG\\n/*\\n * Print out various scheduling related per-task fields:\\n */\\nstatic int sched_show(struct seq_file *m, void *v)\\n{\\n\\tstruct inode *inode = m->private;\\n\\tstruct task_struct *p;\",\n \"\\tp = get_proc_task(inode);\\n\\tif (!p)\\n\\t\\treturn -ESRCH;\\n\\tproc_sched_show_task(p, m);\",\n \"\\tput_task_struct(p);\",\n \"\\treturn 0;\\n}\",\n \"static ssize_t\\nsched_write(struct file *file, const char __user *buf,\\n\\t size_t count, loff_t *offset)\\n{\\n\\tstruct inode *inode = file->f_path.dentry->d_inode;\\n\\tstruct task_struct *p;\",\n \"\\tp = get_proc_task(inode);\\n\\tif (!p)\\n\\t\\treturn -ESRCH;\\n\\tproc_sched_set_task(p);\",\n \"\\tput_task_struct(p);\",\n \"\\treturn count;\\n}\",\n \"static int sched_open(struct inode *inode, struct file *filp)\\n{\\n\\treturn single_open(filp, sched_show, inode);\\n}\",\n \"static const struct file_operations proc_pid_sched_operations = {\\n\\t.open\\t\\t= sched_open,\\n\\t.read\\t\\t= seq_read,\\n\\t.write\\t\\t= sched_write,\\n\\t.llseek\\t\\t= seq_lseek,\\n\\t.release\\t= single_release,\\n};\",\n \"#endif\",\n \"#ifdef CONFIG_SCHED_AUTOGROUP\\n/*\\n * Print out autogroup related information:\\n */\\nstatic int sched_autogroup_show(struct seq_file *m, void *v)\\n{\\n\\tstruct inode *inode = m->private;\\n\\tstruct task_struct *p;\",\n \"\\tp = get_proc_task(inode);\\n\\tif (!p)\\n\\t\\treturn -ESRCH;\\n\\tproc_sched_autogroup_show_task(p, m);\",\n \"\\tput_task_struct(p);\",\n \"\\treturn 0;\\n}\",\n \"static ssize_t\\nsched_autogroup_write(struct file *file, const char __user *buf,\\n\\t size_t count, loff_t *offset)\\n{\\n\\tstruct inode *inode = file->f_path.dentry->d_inode;\\n\\tstruct task_struct *p;\\n\\tchar buffer[PROC_NUMBUF];\\n\\tint nice;\\n\\tint err;\",\n \"\\tmemset(buffer, 0, sizeof(buffer));\\n\\tif (count > sizeof(buffer) - 1)\\n\\t\\tcount = sizeof(buffer) - 1;\\n\\tif (copy_from_user(buffer, buf, count))\\n\\t\\treturn -EFAULT;\",\n \"\\terr = kstrtoint(strstrip(buffer), 0, &nice);\\n\\tif (err < 0)\\n\\t\\treturn err;\",\n \"\\tp = get_proc_task(inode);\\n\\tif (!p)\\n\\t\\treturn -ESRCH;\",\n \"\\terr = nice;\\n\\terr = proc_sched_autogroup_set_nice(p, &err);\\n\\tif (err)\\n\\t\\tcount = err;\",\n \"\\tput_task_struct(p);\",\n \"\\treturn count;\\n}\",\n \"static int sched_autogroup_open(struct inode *inode, struct file *filp)\\n{\\n\\tint ret;\",\n \"\\tret = single_open(filp, sched_autogroup_show, NULL);\\n\\tif (!ret) {\\n\\t\\tstruct seq_file *m = filp->private_data;\",\n \"\\t\\tm->private = inode;\\n\\t}\\n\\treturn ret;\\n}\",\n \"static const struct file_operations proc_pid_sched_autogroup_operations = {\\n\\t.open\\t\\t= sched_autogroup_open,\\n\\t.read\\t\\t= seq_read,\\n\\t.write\\t\\t= sched_autogroup_write,\\n\\t.llseek\\t\\t= seq_lseek,\\n\\t.release\\t= single_release,\\n};\",\n \"#endif /* CONFIG_SCHED_AUTOGROUP */\",\n \"static ssize_t comm_write(struct file *file, const char __user *buf,\\n\\t\\t\\t\\tsize_t count, loff_t *offset)\\n{\\n\\tstruct inode *inode = file->f_path.dentry->d_inode;\\n\\tstruct task_struct *p;\\n\\tchar buffer[TASK_COMM_LEN];\",\n \"\\tmemset(buffer, 0, sizeof(buffer));\\n\\tif (count > sizeof(buffer) - 1)\\n\\t\\tcount = sizeof(buffer) - 1;\\n\\tif (copy_from_user(buffer, buf, count))\\n\\t\\treturn -EFAULT;\",\n \"\\tp = get_proc_task(inode);\\n\\tif (!p)\\n\\t\\treturn -ESRCH;\",\n \"\\tif (same_thread_group(current, p))\\n\\t\\tset_task_comm(p, buffer);\\n\\telse\\n\\t\\tcount = -EINVAL;\",\n \"\\tput_task_struct(p);\",\n \"\\treturn count;\\n}\",\n \"static int comm_show(struct seq_file *m, void *v)\\n{\\n\\tstruct inode *inode = m->private;\\n\\tstruct task_struct *p;\",\n \"\\tp = get_proc_task(inode);\\n\\tif (!p)\\n\\t\\treturn -ESRCH;\",\n \"\\ttask_lock(p);\\n\\tseq_printf(m, \\\"%s\\\\n\\\", p->comm);\\n\\ttask_unlock(p);\",\n \"\\tput_task_struct(p);\",\n \"\\treturn 0;\\n}\",\n \"static int comm_open(struct inode *inode, struct file *filp)\\n{\\n\\treturn single_open(filp, comm_show, inode);\\n}\",\n \"static const struct file_operations proc_pid_set_comm_operations = {\\n\\t.open\\t\\t= comm_open,\\n\\t.read\\t\\t= seq_read,\\n\\t.write\\t\\t= comm_write,\\n\\t.llseek\\t\\t= seq_lseek,\\n\\t.release\\t= single_release,\\n};\",\n \"static int proc_exe_link(struct inode *inode, struct path *exe_path)\\n{\\n\\tstruct task_struct *task;\\n\\tstruct mm_struct *mm;\\n\\tstruct file *exe_file;\",\n \"\\ttask = get_proc_task(inode);\\n\\tif (!task)\\n\\t\\treturn -ENOENT;\\n\\tmm = get_task_mm(task);\\n\\tput_task_struct(task);\\n\\tif (!mm)\\n\\t\\treturn -ENOENT;\\n\\texe_file = get_mm_exe_file(mm);\\n\\tmmput(mm);\\n\\tif (exe_file) {\\n\\t\\t*exe_path = exe_file->f_path;\\n\\t\\tpath_get(&exe_file->f_path);\\n\\t\\tfput(exe_file);\\n\\t\\treturn 0;\\n\\t} else\\n\\t\\treturn -ENOENT;\\n}\",\n \"static void *proc_pid_follow_link(struct dentry *dentry, struct nameidata *nd)\\n{\\n\\tstruct inode *inode = dentry->d_inode;\\n\\tint error = -EACCES;\",\n \"\\t/* We don't need a base pointer in the /proc filesystem */\\n\\tpath_put(&nd->path);\",\n \"\\t/* Are we allowed to snoop on the tasks file descriptors? */\\n\\tif (!proc_fd_access_allowed(inode))\\n\\t\\tgoto out;\",\n \"\\terror = PROC_I(inode)->op.proc_get_link(inode, &nd->path);\\nout:\\n\\treturn ERR_PTR(error);\\n}\",\n \"static int do_proc_readlink(struct path *path, char __user *buffer, int buflen)\\n{\\n\\tchar *tmp = (char*)__get_free_page(GFP_TEMPORARY);\\n\\tchar *pathname;\\n\\tint len;\",\n \"\\tif (!tmp)\\n\\t\\treturn -ENOMEM;\",\n \"\\tpathname = d_path(path, tmp, PAGE_SIZE);\\n\\tlen = PTR_ERR(pathname);\\n\\tif (IS_ERR(pathname))\\n\\t\\tgoto out;\\n\\tlen = tmp + PAGE_SIZE - 1 - pathname;\",\n \"\\tif (len > buflen)\\n\\t\\tlen = buflen;\\n\\tif (copy_to_user(buffer, pathname, len))\\n\\t\\tlen = -EFAULT;\\n out:\\n\\tfree_page((unsigned long)tmp);\\n\\treturn len;\\n}\",\n \"static int proc_pid_readlink(struct dentry * dentry, char __user * buffer, int buflen)\\n{\\n\\tint error = -EACCES;\\n\\tstruct inode *inode = dentry->d_inode;\\n\\tstruct path path;\",\n \"\\t/* Are we allowed to snoop on the tasks file descriptors? */\\n\\tif (!proc_fd_access_allowed(inode))\\n\\t\\tgoto out;\",\n \"\\terror = PROC_I(inode)->op.proc_get_link(inode, &path);\\n\\tif (error)\\n\\t\\tgoto out;\",\n \"\\terror = do_proc_readlink(&path, buffer, buflen);\\n\\tpath_put(&path);\\nout:\\n\\treturn error;\\n}\",\n \"static const struct inode_operations proc_pid_link_inode_operations = {\\n\\t.readlink\\t= proc_pid_readlink,\\n\\t.follow_link\\t= proc_pid_follow_link,\\n\\t.setattr\\t= proc_setattr,\\n};\",\n \"\\n/* building an inode */\",\n \"static int task_dumpable(struct task_struct *task)\\n{\\n\\tint dumpable = 0;\\n\\tstruct mm_struct *mm;\",\n \"\\ttask_lock(task);\\n\\tmm = task->mm;\\n\\tif (mm)\\n\\t\\tdumpable = get_dumpable(mm);\\n\\ttask_unlock(task);\\n\\tif(dumpable == 1)\\n\\t\\treturn 1;\\n\\treturn 0;\\n}\",\n \"struct inode *proc_pid_make_inode(struct super_block * sb, struct task_struct *task)\\n{\\n\\tstruct inode * inode;\\n\\tstruct proc_inode *ei;\\n\\tconst struct cred *cred;\",\n \"\\t/* We need a new inode */\",\n \"\\tinode = new_inode(sb);\\n\\tif (!inode)\\n\\t\\tgoto out;\",\n \"\\t/* Common stuff */\\n\\tei = PROC_I(inode);\\n\\tinode->i_ino = get_next_ino();\\n\\tinode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;\\n\\tinode->i_op = &proc_def_inode_operations;\",\n \"\\t/*\\n\\t * grab the reference to task.\\n\\t */\\n\\tei->pid = get_task_pid(task, PIDTYPE_PID);\\n\\tif (!ei->pid)\\n\\t\\tgoto out_unlock;\",\n \"\\tif (task_dumpable(task)) {\\n\\t\\trcu_read_lock();\\n\\t\\tcred = __task_cred(task);\\n\\t\\tinode->i_uid = cred->euid;\\n\\t\\tinode->i_gid = cred->egid;\\n\\t\\trcu_read_unlock();\\n\\t}\\n\\tsecurity_task_to_inode(task, inode);\",\n \"out:\\n\\treturn inode;\",\n \"out_unlock:\\n\\tiput(inode);\\n\\treturn NULL;\\n}\",\n \"int pid_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)\\n{\\n\\tstruct inode *inode = dentry->d_inode;\\n\\tstruct task_struct *task;\\n\\tconst struct cred *cred;\",\n \"\\tgeneric_fillattr(inode, stat);\",\n \"\\trcu_read_lock();\\n\\tstat->uid = 0;\\n\\tstat->gid = 0;\\n\\ttask = pid_task(proc_pid(inode), PIDTYPE_PID);\\n\\tif (task) {\\n\\t\\tif ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||\\n\\t\\t task_dumpable(task)) {\\n\\t\\t\\tcred = __task_cred(task);\\n\\t\\t\\tstat->uid = cred->euid;\\n\\t\\t\\tstat->gid = cred->egid;\\n\\t\\t}\\n\\t}\\n\\trcu_read_unlock();\\n\\treturn 0;\\n}\",\n \"/* dentry stuff */\",\n \"/*\\n *\\tExceptional case: normally we are not allowed to unhash a busy\\n * directory. In this case, however, we can do it - no aliasing problems\\n * due to the way we treat inodes.\\n *\\n * Rewrite the inode's ownerships here because the owning task may have\\n * performed a setuid(), etc.\\n *\\n * Before the /proc/pid/status file was created the only way to read\\n * the effective uid of a /process was to stat /proc/pid. Reading\\n * /proc/pid/status is slow enough that procps and other packages\\n * kept stating /proc/pid. To keep the rules in /proc simple I have\\n * made this apply to all per process world readable and executable\\n * directories.\\n */\\nint pid_revalidate(struct dentry *dentry, struct nameidata *nd)\\n{\\n\\tstruct inode *inode;\\n\\tstruct task_struct *task;\\n\\tconst struct cred *cred;\",\n \"\\tif (nd && nd->flags & LOOKUP_RCU)\\n\\t\\treturn -ECHILD;\",\n \"\\tinode = dentry->d_inode;\\n\\ttask = get_proc_task(inode);\",\n \"\\tif (task) {\\n\\t\\tif ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||\\n\\t\\t task_dumpable(task)) {\\n\\t\\t\\trcu_read_lock();\\n\\t\\t\\tcred = __task_cred(task);\\n\\t\\t\\tinode->i_uid = cred->euid;\\n\\t\\t\\tinode->i_gid = cred->egid;\\n\\t\\t\\trcu_read_unlock();\\n\\t\\t} else {\\n\\t\\t\\tinode->i_uid = 0;\\n\\t\\t\\tinode->i_gid = 0;\\n\\t\\t}\\n\\t\\tinode->i_mode &= ~(S_ISUID | S_ISGID);\\n\\t\\tsecurity_task_to_inode(task, inode);\\n\\t\\tput_task_struct(task);\\n\\t\\treturn 1;\\n\\t}\\n\\td_drop(dentry);\\n\\treturn 0;\\n}\",\n \"static int pid_delete_dentry(const struct dentry * dentry)\\n{\\n\\t/* Is the task we represent dead?\\n\\t * If so, then don't put the dentry on the lru list,\\n\\t * kill it immediately.\\n\\t */\\n\\treturn !proc_pid(dentry->d_inode)->tasks[PIDTYPE_PID].first;\\n}\",\n \"const struct dentry_operations pid_dentry_operations =\\n{\\n\\t.d_revalidate\\t= pid_revalidate,\\n\\t.d_delete\\t= pid_delete_dentry,\\n};\",\n \"/* Lookups */\",\n \"/*\\n * Fill a directory entry.\\n *\\n * If possible create the dcache entry and derive our inode number and\\n * file type from dcache entry.\\n *\\n * Since all of the proc inode numbers are dynamically generated, the inode\\n * numbers do not exist until the inode is cache. This means creating the\\n * the dcache entry in readdir is necessary to keep the inode numbers\\n * reported by readdir in sync with the inode numbers reported\\n * by stat.\\n */\\nint proc_fill_cache(struct file *filp, void *dirent, filldir_t filldir,\\n\\tconst char *name, int len,\\n\\tinstantiate_t instantiate, struct task_struct *task, const void *ptr)\\n{\\n\\tstruct dentry *child, *dir = filp->f_path.dentry;\\n\\tstruct inode *inode;\\n\\tstruct qstr qname;\\n\\tino_t ino = 0;\\n\\tunsigned type = DT_UNKNOWN;\",\n \"\\tqname.name = name;\\n\\tqname.len = len;\\n\\tqname.hash = full_name_hash(name, len);\",\n \"\\tchild = d_lookup(dir, &qname);\\n\\tif (!child) {\\n\\t\\tstruct dentry *new;\\n\\t\\tnew = d_alloc(dir, &qname);\\n\\t\\tif (new) {\\n\\t\\t\\tchild = instantiate(dir->d_inode, new, task, ptr);\\n\\t\\t\\tif (child)\\n\\t\\t\\t\\tdput(new);\\n\\t\\t\\telse\\n\\t\\t\\t\\tchild = new;\\n\\t\\t}\\n\\t}\\n\\tif (!child || IS_ERR(child) || !child->d_inode)\\n\\t\\tgoto end_instantiate;\\n\\tinode = child->d_inode;\\n\\tif (inode) {\\n\\t\\tino = inode->i_ino;\\n\\t\\ttype = inode->i_mode >> 12;\\n\\t}\\n\\tdput(child);\\nend_instantiate:\\n\\tif (!ino)\\n\\t\\tino = find_inode_number(dir, &qname);\\n\\tif (!ino)\\n\\t\\tino = 1;\\n\\treturn filldir(dirent, name, len, filp->f_pos, ino, type);\\n}\",\n \"static unsigned name_to_int(struct dentry *dentry)\\n{\\n\\tconst char *name = dentry->d_name.name;\\n\\tint len = dentry->d_name.len;\\n\\tunsigned n = 0;\",\n \"\\tif (len > 1 && *name == '0')\\n\\t\\tgoto out;\\n\\twhile (len-- > 0) {\\n\\t\\tunsigned c = *name++ - '0';\\n\\t\\tif (c > 9)\\n\\t\\t\\tgoto out;\\n\\t\\tif (n >= (~0U-9)/10)\\n\\t\\t\\tgoto out;\\n\\t\\tn *= 10;\\n\\t\\tn += c;\\n\\t}\\n\\treturn n;\\nout:\\n\\treturn ~0U;\\n}\",\n \"#define PROC_FDINFO_MAX 64\",\n \"static int proc_fd_info(struct inode *inode, struct path *path, char *info)\\n{\\n\\tstruct task_struct *task = get_proc_task(inode);\\n\\tstruct files_struct *files = NULL;\\n\\tstruct file *file;\\n\\tint fd = proc_fd(inode);\",\n \"\\tif (task) {\\n\\t\\tfiles = get_files_struct(task);\\n\\t\\tput_task_struct(task);\\n\\t}\\n\\tif (files) {\\n\\t\\t/*\\n\\t\\t * We are not taking a ref to the file structure, so we must\\n\\t\\t * hold ->file_lock.\\n\\t\\t */\\n\\t\\tspin_lock(&files->file_lock);\\n\\t\\tfile = fcheck_files(files, fd);\\n\\t\\tif (file) {\\n\\t\\t\\tif (path) {\\n\\t\\t\\t\\t*path = file->f_path;\\n\\t\\t\\t\\tpath_get(&file->f_path);\\n\\t\\t\\t}\\n\\t\\t\\tif (info)\\n\\t\\t\\t\\tsnprintf(info, PROC_FDINFO_MAX,\\n\\t\\t\\t\\t\\t \\\"pos:\\\\t%lli\\\\n\\\"\\n\\t\\t\\t\\t\\t \\\"flags:\\\\t0%o\\\\n\\\",\\n\\t\\t\\t\\t\\t (long long) file->f_pos,\\n\\t\\t\\t\\t\\t file->f_flags);\\n\\t\\t\\tspin_unlock(&files->file_lock);\\n\\t\\t\\tput_files_struct(files);\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tspin_unlock(&files->file_lock);\\n\\t\\tput_files_struct(files);\\n\\t}\\n\\treturn -ENOENT;\\n}\",\n \"static int proc_fd_link(struct inode *inode, struct path *path)\\n{\\n\\treturn proc_fd_info(inode, path, NULL);\\n}\",\n \"static int tid_fd_revalidate(struct dentry *dentry, struct nameidata *nd)\\n{\\n\\tstruct inode *inode;\\n\\tstruct task_struct *task;\\n\\tint fd;\\n\\tstruct files_struct *files;\\n\\tconst struct cred *cred;\",\n \"\\tif (nd && nd->flags & LOOKUP_RCU)\\n\\t\\treturn -ECHILD;\",\n \"\\tinode = dentry->d_inode;\\n\\ttask = get_proc_task(inode);\\n\\tfd = proc_fd(inode);\",\n \"\\tif (task) {\\n\\t\\tfiles = get_files_struct(task);\\n\\t\\tif (files) {\\n\\t\\t\\trcu_read_lock();\\n\\t\\t\\tif (fcheck_files(files, fd)) {\\n\\t\\t\\t\\trcu_read_unlock();\\n\\t\\t\\t\\tput_files_struct(files);\\n\\t\\t\\t\\tif (task_dumpable(task)) {\\n\\t\\t\\t\\t\\trcu_read_lock();\\n\\t\\t\\t\\t\\tcred = __task_cred(task);\\n\\t\\t\\t\\t\\tinode->i_uid = cred->euid;\\n\\t\\t\\t\\t\\tinode->i_gid = cred->egid;\\n\\t\\t\\t\\t\\trcu_read_unlock();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tinode->i_uid = 0;\\n\\t\\t\\t\\t\\tinode->i_gid = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tinode->i_mode &= ~(S_ISUID | S_ISGID);\\n\\t\\t\\t\\tsecurity_task_to_inode(task, inode);\\n\\t\\t\\t\\tput_task_struct(task);\\n\\t\\t\\t\\treturn 1;\\n\\t\\t\\t}\\n\\t\\t\\trcu_read_unlock();\\n\\t\\t\\tput_files_struct(files);\\n\\t\\t}\\n\\t\\tput_task_struct(task);\\n\\t}\\n\\td_drop(dentry);\\n\\treturn 0;\\n}\",\n \"static const struct dentry_operations tid_fd_dentry_operations =\\n{\\n\\t.d_revalidate\\t= tid_fd_revalidate,\\n\\t.d_delete\\t= pid_delete_dentry,\\n};\",\n \"static struct dentry *proc_fd_instantiate(struct inode *dir,\\n\\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\\n{\\n\\tunsigned fd = *(const unsigned *)ptr;\\n\\tstruct file *file;\\n\\tstruct files_struct *files;\\n \\tstruct inode *inode;\\n \\tstruct proc_inode *ei;\\n\\tstruct dentry *error = ERR_PTR(-ENOENT);\",\n \"\\tinode = proc_pid_make_inode(dir->i_sb, task);\\n\\tif (!inode)\\n\\t\\tgoto out;\\n\\tei = PROC_I(inode);\\n\\tei->fd = fd;\\n\\tfiles = get_files_struct(task);\\n\\tif (!files)\\n\\t\\tgoto out_iput;\\n\\tinode->i_mode = S_IFLNK;\",\n \"\\t/*\\n\\t * We are not taking a ref to the file structure, so we must\\n\\t * hold ->file_lock.\\n\\t */\\n\\tspin_lock(&files->file_lock);\\n\\tfile = fcheck_files(files, fd);\\n\\tif (!file)\\n\\t\\tgoto out_unlock;\\n\\tif (file->f_mode & FMODE_READ)\\n\\t\\tinode->i_mode |= S_IRUSR | S_IXUSR;\\n\\tif (file->f_mode & FMODE_WRITE)\\n\\t\\tinode->i_mode |= S_IWUSR | S_IXUSR;\\n\\tspin_unlock(&files->file_lock);\\n\\tput_files_struct(files);\",\n \"\\tinode->i_op = &proc_pid_link_inode_operations;\\n\\tinode->i_size = 64;\\n\\tei->op.proc_get_link = proc_fd_link;\\n\\td_set_d_op(dentry, &tid_fd_dentry_operations);\\n\\td_add(dentry, inode);\\n\\t/* Close the race of the process dying before we return the dentry */\\n\\tif (tid_fd_revalidate(dentry, NULL))\\n\\t\\terror = NULL;\",\n \" out:\\n\\treturn error;\\nout_unlock:\\n\\tspin_unlock(&files->file_lock);\\n\\tput_files_struct(files);\\nout_iput:\\n\\tiput(inode);\\n\\tgoto out;\\n}\",\n \"static struct dentry *proc_lookupfd_common(struct inode *dir,\\n\\t\\t\\t\\t\\t struct dentry *dentry,\\n\\t\\t\\t\\t\\t instantiate_t instantiate)\\n{\\n\\tstruct task_struct *task = get_proc_task(dir);\\n\\tunsigned fd = name_to_int(dentry);\\n\\tstruct dentry *result = ERR_PTR(-ENOENT);\",\n \"\\tif (!task)\\n\\t\\tgoto out_no_task;\\n\\tif (fd == ~0U)\\n\\t\\tgoto out;\",\n \"\\tresult = instantiate(dir, dentry, task, &fd);\\nout:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn result;\\n}\",\n \"static int proc_readfd_common(struct file * filp, void * dirent,\\n\\t\\t\\t filldir_t filldir, instantiate_t instantiate)\\n{\\n\\tstruct dentry *dentry = filp->f_path.dentry;\\n\\tstruct inode *inode = dentry->d_inode;\\n\\tstruct task_struct *p = get_proc_task(inode);\\n\\tunsigned int fd, ino;\\n\\tint retval;\\n\\tstruct files_struct * files;\",\n \"\\tretval = -ENOENT;\\n\\tif (!p)\\n\\t\\tgoto out_no_task;\\n\\tretval = 0;\",\n \"\\tfd = filp->f_pos;\\n\\tswitch (fd) {\\n\\t\\tcase 0:\\n\\t\\t\\tif (filldir(dirent, \\\".\\\", 1, 0, inode->i_ino, DT_DIR) < 0)\\n\\t\\t\\t\\tgoto out;\\n\\t\\t\\tfilp->f_pos++;\\n\\t\\tcase 1:\\n\\t\\t\\tino = parent_ino(dentry);\\n\\t\\t\\tif (filldir(dirent, \\\"..\\\", 2, 1, ino, DT_DIR) < 0)\\n\\t\\t\\t\\tgoto out;\\n\\t\\t\\tfilp->f_pos++;\\n\\t\\tdefault:\\n\\t\\t\\tfiles = get_files_struct(p);\\n\\t\\t\\tif (!files)\\n\\t\\t\\t\\tgoto out;\\n\\t\\t\\trcu_read_lock();\\n\\t\\t\\tfor (fd = filp->f_pos-2;\\n\\t\\t\\t fd < files_fdtable(files)->max_fds;\\n\\t\\t\\t fd++, filp->f_pos++) {\\n\\t\\t\\t\\tchar name[PROC_NUMBUF];\\n\\t\\t\\t\\tint len;\",\n \"\\t\\t\\t\\tif (!fcheck_files(files, fd))\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\trcu_read_unlock();\",\n \"\\t\\t\\t\\tlen = snprintf(name, sizeof(name), \\\"%d\\\", fd);\\n\\t\\t\\t\\tif (proc_fill_cache(filp, dirent, filldir,\\n\\t\\t\\t\\t\\t\\t name, len, instantiate,\\n\\t\\t\\t\\t\\t\\t p, &fd) < 0) {\\n\\t\\t\\t\\t\\trcu_read_lock();\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trcu_read_lock();\\n\\t\\t\\t}\\n\\t\\t\\trcu_read_unlock();\\n\\t\\t\\tput_files_struct(files);\\n\\t}\\nout:\\n\\tput_task_struct(p);\\nout_no_task:\\n\\treturn retval;\\n}\",\n \"static struct dentry *proc_lookupfd(struct inode *dir, struct dentry *dentry,\\n\\t\\t\\t\\t struct nameidata *nd)\\n{\\n\\treturn proc_lookupfd_common(dir, dentry, proc_fd_instantiate);\\n}\",\n \"static int proc_readfd(struct file *filp, void *dirent, filldir_t filldir)\\n{\\n\\treturn proc_readfd_common(filp, dirent, filldir, proc_fd_instantiate);\\n}\",\n \"static ssize_t proc_fdinfo_read(struct file *file, char __user *buf,\\n\\t\\t\\t\\t size_t len, loff_t *ppos)\\n{\\n\\tchar tmp[PROC_FDINFO_MAX];\\n\\tint err = proc_fd_info(file->f_path.dentry->d_inode, NULL, tmp);\\n\\tif (!err)\\n\\t\\terr = simple_read_from_buffer(buf, len, ppos, tmp, strlen(tmp));\\n\\treturn err;\\n}\",\n \"static const struct file_operations proc_fdinfo_file_operations = {\\n\\t.open = nonseekable_open,\\n\\t.read\\t\\t= proc_fdinfo_read,\\n\\t.llseek\\t\\t= no_llseek,\\n};\",\n \"static const struct file_operations proc_fd_operations = {\\n\\t.read\\t\\t= generic_read_dir,\\n\\t.readdir\\t= proc_readfd,\\n\\t.llseek\\t\\t= default_llseek,\\n};\",\n \"/*\\n * /proc/pid/fd needs a special permission handler so that a process can still\\n * access /proc/self/fd after it has executed a setuid().\\n */\\nstatic int proc_fd_permission(struct inode *inode, int mask, unsigned int flags)\\n{\\n\\tint rv = generic_permission(inode, mask, flags, NULL);\\n\\tif (rv == 0)\\n\\t\\treturn 0;\\n\\tif (task_pid(current) == proc_pid(inode))\\n\\t\\trv = 0;\\n\\treturn rv;\\n}\",\n \"/*\\n * proc directories can do almost nothing..\\n */\\nstatic const struct inode_operations proc_fd_inode_operations = {\\n\\t.lookup\\t\\t= proc_lookupfd,\\n\\t.permission\\t= proc_fd_permission,\\n\\t.setattr\\t= proc_setattr,\\n};\",\n \"static struct dentry *proc_fdinfo_instantiate(struct inode *dir,\\n\\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\\n{\\n\\tunsigned fd = *(unsigned *)ptr;\\n \\tstruct inode *inode;\\n \\tstruct proc_inode *ei;\\n\\tstruct dentry *error = ERR_PTR(-ENOENT);\",\n \"\\tinode = proc_pid_make_inode(dir->i_sb, task);\\n\\tif (!inode)\\n\\t\\tgoto out;\\n\\tei = PROC_I(inode);\\n\\tei->fd = fd;\\n\\tinode->i_mode = S_IFREG | S_IRUSR;\\n\\tinode->i_fop = &proc_fdinfo_file_operations;\\n\\td_set_d_op(dentry, &tid_fd_dentry_operations);\\n\\td_add(dentry, inode);\\n\\t/* Close the race of the process dying before we return the dentry */\\n\\tif (tid_fd_revalidate(dentry, NULL))\\n\\t\\terror = NULL;\",\n \" out:\\n\\treturn error;\\n}\",\n \"static struct dentry *proc_lookupfdinfo(struct inode *dir,\\n\\t\\t\\t\\t\\tstruct dentry *dentry,\\n\\t\\t\\t\\t\\tstruct nameidata *nd)\\n{\\n\\treturn proc_lookupfd_common(dir, dentry, proc_fdinfo_instantiate);\\n}\",\n \"static int proc_readfdinfo(struct file *filp, void *dirent, filldir_t filldir)\\n{\\n\\treturn proc_readfd_common(filp, dirent, filldir,\\n\\t\\t\\t\\t proc_fdinfo_instantiate);\\n}\",\n \"static const struct file_operations proc_fdinfo_operations = {\\n\\t.read\\t\\t= generic_read_dir,\\n\\t.readdir\\t= proc_readfdinfo,\\n\\t.llseek\\t\\t= default_llseek,\\n};\",\n \"/*\\n * proc directories can do almost nothing..\\n */\\nstatic const struct inode_operations proc_fdinfo_inode_operations = {\\n\\t.lookup\\t\\t= proc_lookupfdinfo,\\n\\t.setattr\\t= proc_setattr,\\n};\",\n \"\\nstatic struct dentry *proc_pident_instantiate(struct inode *dir,\\n\\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\\n{\\n\\tconst struct pid_entry *p = ptr;\\n\\tstruct inode *inode;\\n\\tstruct proc_inode *ei;\\n\\tstruct dentry *error = ERR_PTR(-ENOENT);\",\n \"\\tinode = proc_pid_make_inode(dir->i_sb, task);\\n\\tif (!inode)\\n\\t\\tgoto out;\",\n \"\\tei = PROC_I(inode);\\n\\tinode->i_mode = p->mode;\\n\\tif (S_ISDIR(inode->i_mode))\\n\\t\\tinode->i_nlink = 2;\\t/* Use getattr to fix if necessary */\\n\\tif (p->iop)\\n\\t\\tinode->i_op = p->iop;\\n\\tif (p->fop)\\n\\t\\tinode->i_fop = p->fop;\\n\\tei->op = p->op;\\n\\td_set_d_op(dentry, &pid_dentry_operations);\\n\\td_add(dentry, inode);\\n\\t/* Close the race of the process dying before we return the dentry */\\n\\tif (pid_revalidate(dentry, NULL))\\n\\t\\terror = NULL;\\nout:\\n\\treturn error;\\n}\",\n \"static struct dentry *proc_pident_lookup(struct inode *dir, \\n\\t\\t\\t\\t\\t struct dentry *dentry,\\n\\t\\t\\t\\t\\t const struct pid_entry *ents,\\n\\t\\t\\t\\t\\t unsigned int nents)\\n{\\n\\tstruct dentry *error;\\n\\tstruct task_struct *task = get_proc_task(dir);\\n\\tconst struct pid_entry *p, *last;\",\n \"\\terror = ERR_PTR(-ENOENT);\",\n \"\\tif (!task)\\n\\t\\tgoto out_no_task;\",\n \"\\t/*\\n\\t * Yes, it does not scale. And it should not. Don't add\\n\\t * new entries into /proc/<tgid>/ without very good reasons.\\n\\t */\\n\\tlast = &ents[nents - 1];\\n\\tfor (p = ents; p <= last; p++) {\\n\\t\\tif (p->len != dentry->d_name.len)\\n\\t\\t\\tcontinue;\\n\\t\\tif (!memcmp(dentry->d_name.name, p->name, p->len))\\n\\t\\t\\tbreak;\\n\\t}\\n\\tif (p > last)\\n\\t\\tgoto out;\",\n \"\\terror = proc_pident_instantiate(dir, dentry, task, p);\\nout:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn error;\\n}\",\n \"static int proc_pident_fill_cache(struct file *filp, void *dirent,\\n\\tfilldir_t filldir, struct task_struct *task, const struct pid_entry *p)\\n{\\n\\treturn proc_fill_cache(filp, dirent, filldir, p->name, p->len,\\n\\t\\t\\t\\tproc_pident_instantiate, task, p);\\n}\",\n \"static int proc_pident_readdir(struct file *filp,\\n\\t\\tvoid *dirent, filldir_t filldir,\\n\\t\\tconst struct pid_entry *ents, unsigned int nents)\\n{\\n\\tint i;\\n\\tstruct dentry *dentry = filp->f_path.dentry;\\n\\tstruct inode *inode = dentry->d_inode;\\n\\tstruct task_struct *task = get_proc_task(inode);\\n\\tconst struct pid_entry *p, *last;\\n\\tino_t ino;\\n\\tint ret;\",\n \"\\tret = -ENOENT;\\n\\tif (!task)\\n\\t\\tgoto out_no_task;\",\n \"\\tret = 0;\\n\\ti = filp->f_pos;\\n\\tswitch (i) {\\n\\tcase 0:\\n\\t\\tino = inode->i_ino;\\n\\t\\tif (filldir(dirent, \\\".\\\", 1, i, ino, DT_DIR) < 0)\\n\\t\\t\\tgoto out;\\n\\t\\ti++;\\n\\t\\tfilp->f_pos++;\\n\\t\\t/* fall through */\\n\\tcase 1:\\n\\t\\tino = parent_ino(dentry);\\n\\t\\tif (filldir(dirent, \\\"..\\\", 2, i, ino, DT_DIR) < 0)\\n\\t\\t\\tgoto out;\\n\\t\\ti++;\\n\\t\\tfilp->f_pos++;\\n\\t\\t/* fall through */\\n\\tdefault:\\n\\t\\ti -= 2;\\n\\t\\tif (i >= nents) {\\n\\t\\t\\tret = 1;\\n\\t\\t\\tgoto out;\\n\\t\\t}\\n\\t\\tp = ents + i;\\n\\t\\tlast = &ents[nents - 1];\\n\\t\\twhile (p <= last) {\\n\\t\\t\\tif (proc_pident_fill_cache(filp, dirent, filldir, task, p) < 0)\\n\\t\\t\\t\\tgoto out;\\n\\t\\t\\tfilp->f_pos++;\\n\\t\\t\\tp++;\\n\\t\\t}\\n\\t}\",\n \"\\tret = 1;\\nout:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn ret;\\n}\",\n \"#ifdef CONFIG_SECURITY\\nstatic ssize_t proc_pid_attr_read(struct file * file, char __user * buf,\\n\\t\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tstruct inode * inode = file->f_path.dentry->d_inode;\\n\\tchar *p = NULL;\\n\\tssize_t length;\\n\\tstruct task_struct *task = get_proc_task(inode);\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\",\n \"\\tlength = security_getprocattr(task,\\n\\t\\t\\t\\t (char*)file->f_path.dentry->d_name.name,\\n\\t\\t\\t\\t &p);\\n\\tput_task_struct(task);\\n\\tif (length > 0)\\n\\t\\tlength = simple_read_from_buffer(buf, count, ppos, p, length);\\n\\tkfree(p);\\n\\treturn length;\\n}\",\n \"static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf,\\n\\t\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tstruct inode * inode = file->f_path.dentry->d_inode;\\n\\tchar *page;\\n\\tssize_t length;\\n\\tstruct task_struct *task = get_proc_task(inode);\",\n \"\\tlength = -ESRCH;\\n\\tif (!task)\\n\\t\\tgoto out_no_task;\\n\\tif (count > PAGE_SIZE)\\n\\t\\tcount = PAGE_SIZE;\",\n \"\\t/* No partial writes. */\\n\\tlength = -EINVAL;\\n\\tif (*ppos != 0)\\n\\t\\tgoto out;\",\n \"\\tlength = -ENOMEM;\\n\\tpage = (char*)__get_free_page(GFP_TEMPORARY);\\n\\tif (!page)\\n\\t\\tgoto out;\",\n \"\\tlength = -EFAULT;\\n\\tif (copy_from_user(page, buf, count))\\n\\t\\tgoto out_free;\",\n \"\\t/* Guard against adverse ptrace interaction */\\n\\tlength = mutex_lock_interruptible(&task->signal->cred_guard_mutex);\\n\\tif (length < 0)\\n\\t\\tgoto out_free;\",\n \"\\tlength = security_setprocattr(task,\\n\\t\\t\\t\\t (char*)file->f_path.dentry->d_name.name,\\n\\t\\t\\t\\t (void*)page, count);\\n\\tmutex_unlock(&task->signal->cred_guard_mutex);\\nout_free:\\n\\tfree_page((unsigned long) page);\\nout:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn length;\\n}\",\n \"static const struct file_operations proc_pid_attr_operations = {\\n\\t.read\\t\\t= proc_pid_attr_read,\\n\\t.write\\t\\t= proc_pid_attr_write,\\n\\t.llseek\\t\\t= generic_file_llseek,\\n};\",\n \"static const struct pid_entry attr_dir_stuff[] = {\\n\\tREG(\\\"current\\\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\\n\\tREG(\\\"prev\\\", S_IRUGO,\\t proc_pid_attr_operations),\\n\\tREG(\\\"exec\\\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\\n\\tREG(\\\"fscreate\\\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\\n\\tREG(\\\"keycreate\\\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\\n\\tREG(\\\"sockcreate\\\", S_IRUGO|S_IWUGO, proc_pid_attr_operations),\\n};\",\n \"static int proc_attr_dir_readdir(struct file * filp,\\n\\t\\t\\t void * dirent, filldir_t filldir)\\n{\\n\\treturn proc_pident_readdir(filp,dirent,filldir,\\n\\t\\t\\t\\t attr_dir_stuff,ARRAY_SIZE(attr_dir_stuff));\\n}\",\n \"static const struct file_operations proc_attr_dir_operations = {\\n\\t.read\\t\\t= generic_read_dir,\\n\\t.readdir\\t= proc_attr_dir_readdir,\\n\\t.llseek\\t\\t= default_llseek,\\n};\",\n \"static struct dentry *proc_attr_dir_lookup(struct inode *dir,\\n\\t\\t\\t\\tstruct dentry *dentry, struct nameidata *nd)\\n{\\n\\treturn proc_pident_lookup(dir, dentry,\\n\\t\\t\\t\\t attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));\\n}\",\n \"static const struct inode_operations proc_attr_dir_inode_operations = {\\n\\t.lookup\\t\\t= proc_attr_dir_lookup,\\n\\t.getattr\\t= pid_getattr,\\n\\t.setattr\\t= proc_setattr,\\n};\",\n \"#endif\",\n \"#ifdef CONFIG_ELF_CORE\\nstatic ssize_t proc_coredump_filter_read(struct file *file, char __user *buf,\\n\\t\\t\\t\\t\\t size_t count, loff_t *ppos)\\n{\\n\\tstruct task_struct *task = get_proc_task(file->f_dentry->d_inode);\\n\\tstruct mm_struct *mm;\\n\\tchar buffer[PROC_NUMBUF];\\n\\tsize_t len;\\n\\tint ret;\",\n \"\\tif (!task)\\n\\t\\treturn -ESRCH;\",\n \"\\tret = 0;\\n\\tmm = get_task_mm(task);\\n\\tif (mm) {\\n\\t\\tlen = snprintf(buffer, sizeof(buffer), \\\"%08lx\\\\n\\\",\\n\\t\\t\\t ((mm->flags & MMF_DUMP_FILTER_MASK) >>\\n\\t\\t\\t\\tMMF_DUMP_FILTER_SHIFT));\\n\\t\\tmmput(mm);\\n\\t\\tret = simple_read_from_buffer(buf, count, ppos, buffer, len);\\n\\t}\",\n \"\\tput_task_struct(task);\",\n \"\\treturn ret;\\n}\",\n \"static ssize_t proc_coredump_filter_write(struct file *file,\\n\\t\\t\\t\\t\\t const char __user *buf,\\n\\t\\t\\t\\t\\t size_t count,\\n\\t\\t\\t\\t\\t loff_t *ppos)\\n{\\n\\tstruct task_struct *task;\\n\\tstruct mm_struct *mm;\\n\\tchar buffer[PROC_NUMBUF], *end;\\n\\tunsigned int val;\\n\\tint ret;\\n\\tint i;\\n\\tunsigned long mask;\",\n \"\\tret = -EFAULT;\\n\\tmemset(buffer, 0, sizeof(buffer));\\n\\tif (count > sizeof(buffer) - 1)\\n\\t\\tcount = sizeof(buffer) - 1;\\n\\tif (copy_from_user(buffer, buf, count))\\n\\t\\tgoto out_no_task;\",\n \"\\tret = -EINVAL;\\n\\tval = (unsigned int)simple_strtoul(buffer, &end, 0);\\n\\tif (*end == '\\\\n')\\n\\t\\tend++;\\n\\tif (end - buffer == 0)\\n\\t\\tgoto out_no_task;\",\n \"\\tret = -ESRCH;\\n\\ttask = get_proc_task(file->f_dentry->d_inode);\\n\\tif (!task)\\n\\t\\tgoto out_no_task;\",\n \"\\tret = end - buffer;\\n\\tmm = get_task_mm(task);\\n\\tif (!mm)\\n\\t\\tgoto out_no_mm;\",\n \"\\tfor (i = 0, mask = 1; i < MMF_DUMP_FILTER_BITS; i++, mask <<= 1) {\\n\\t\\tif (val & mask)\\n\\t\\t\\tset_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);\\n\\t\\telse\\n\\t\\t\\tclear_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);\\n\\t}\",\n \"\\tmmput(mm);\\n out_no_mm:\\n\\tput_task_struct(task);\\n out_no_task:\\n\\treturn ret;\\n}\",\n \"static const struct file_operations proc_coredump_filter_operations = {\\n\\t.read\\t\\t= proc_coredump_filter_read,\\n\\t.write\\t\\t= proc_coredump_filter_write,\\n\\t.llseek\\t\\t= generic_file_llseek,\\n};\\n#endif\",\n \"/*\\n * /proc/self:\\n */\\nstatic int proc_self_readlink(struct dentry *dentry, char __user *buffer,\\n\\t\\t\\t int buflen)\\n{\\n\\tstruct pid_namespace *ns = dentry->d_sb->s_fs_info;\\n\\tpid_t tgid = task_tgid_nr_ns(current, ns);\\n\\tchar tmp[PROC_NUMBUF];\\n\\tif (!tgid)\\n\\t\\treturn -ENOENT;\\n\\tsprintf(tmp, \\\"%d\\\", tgid);\\n\\treturn vfs_readlink(dentry,buffer,buflen,tmp);\\n}\",\n \"static void *proc_self_follow_link(struct dentry *dentry, struct nameidata *nd)\\n{\\n\\tstruct pid_namespace *ns = dentry->d_sb->s_fs_info;\\n\\tpid_t tgid = task_tgid_nr_ns(current, ns);\\n\\tchar *name = ERR_PTR(-ENOENT);\\n\\tif (tgid) {\\n\\t\\tname = __getname();\\n\\t\\tif (!name)\\n\\t\\t\\tname = ERR_PTR(-ENOMEM);\\n\\t\\telse\\n\\t\\t\\tsprintf(name, \\\"%d\\\", tgid);\\n\\t}\\n\\tnd_set_link(nd, name);\\n\\treturn NULL;\\n}\",\n \"static void proc_self_put_link(struct dentry *dentry, struct nameidata *nd,\\n\\t\\t\\t\\tvoid *cookie)\\n{\\n\\tchar *s = nd_get_link(nd);\\n\\tif (!IS_ERR(s))\\n\\t\\t__putname(s);\\n}\",\n \"static const struct inode_operations proc_self_inode_operations = {\\n\\t.readlink\\t= proc_self_readlink,\\n\\t.follow_link\\t= proc_self_follow_link,\\n\\t.put_link\\t= proc_self_put_link,\\n};\",\n \"/*\\n * proc base\\n *\\n * These are the directory entries in the root directory of /proc\\n * that properly belong to the /proc filesystem, as they describe\\n * describe something that is process related.\\n */\\nstatic const struct pid_entry proc_base_stuff[] = {\\n\\tNOD(\\\"self\\\", S_IFLNK|S_IRWXUGO,\\n\\t\\t&proc_self_inode_operations, NULL, {}),\\n};\",\n \"static struct dentry *proc_base_instantiate(struct inode *dir,\\n\\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\\n{\\n\\tconst struct pid_entry *p = ptr;\\n\\tstruct inode *inode;\\n\\tstruct proc_inode *ei;\\n\\tstruct dentry *error;\",\n \"\\t/* Allocate the inode */\\n\\terror = ERR_PTR(-ENOMEM);\\n\\tinode = new_inode(dir->i_sb);\\n\\tif (!inode)\\n\\t\\tgoto out;\",\n \"\\t/* Initialize the inode */\\n\\tei = PROC_I(inode);\\n\\tinode->i_ino = get_next_ino();\\n\\tinode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;\",\n \"\\t/*\\n\\t * grab the reference to the task.\\n\\t */\\n\\tei->pid = get_task_pid(task, PIDTYPE_PID);\\n\\tif (!ei->pid)\\n\\t\\tgoto out_iput;\",\n \"\\tinode->i_mode = p->mode;\\n\\tif (S_ISDIR(inode->i_mode))\\n\\t\\tinode->i_nlink = 2;\\n\\tif (S_ISLNK(inode->i_mode))\\n\\t\\tinode->i_size = 64;\\n\\tif (p->iop)\\n\\t\\tinode->i_op = p->iop;\\n\\tif (p->fop)\\n\\t\\tinode->i_fop = p->fop;\\n\\tei->op = p->op;\\n\\td_add(dentry, inode);\\n\\terror = NULL;\\nout:\\n\\treturn error;\\nout_iput:\\n\\tiput(inode);\\n\\tgoto out;\\n}\",\n \"static struct dentry *proc_base_lookup(struct inode *dir, struct dentry *dentry)\\n{\\n\\tstruct dentry *error;\\n\\tstruct task_struct *task = get_proc_task(dir);\\n\\tconst struct pid_entry *p, *last;\",\n \"\\terror = ERR_PTR(-ENOENT);\",\n \"\\tif (!task)\\n\\t\\tgoto out_no_task;\",\n \"\\t/* Lookup the directory entry */\\n\\tlast = &proc_base_stuff[ARRAY_SIZE(proc_base_stuff) - 1];\\n\\tfor (p = proc_base_stuff; p <= last; p++) {\\n\\t\\tif (p->len != dentry->d_name.len)\\n\\t\\t\\tcontinue;\\n\\t\\tif (!memcmp(dentry->d_name.name, p->name, p->len))\\n\\t\\t\\tbreak;\\n\\t}\\n\\tif (p > last)\\n\\t\\tgoto out;\",\n \"\\terror = proc_base_instantiate(dir, dentry, task, p);\",\n \"out:\\n\\tput_task_struct(task);\\nout_no_task:\\n\\treturn error;\\n}\",\n \"static int proc_base_fill_cache(struct file *filp, void *dirent,\\n\\tfilldir_t filldir, struct task_struct *task, const struct pid_entry *p)\\n{\\n\\treturn proc_fill_cache(filp, dirent, filldir, p->name, p->len,\\n\\t\\t\\t\\tproc_base_instantiate, task, p);\\n}\",\n \"#ifdef CONFIG_TASK_IO_ACCOUNTING\\nstatic int do_io_accounting(struct task_struct *task, char *buffer, int whole)\\n{\\n\\tstruct task_io_accounting acct = task->ioac;\\n\\tunsigned long flags;\",\n \"\\tif (!ptrace_may_access(task, PTRACE_MODE_READ))\\n\\t\\treturn -EACCES;\",\n \"\\tif (whole && lock_task_sighand(task, &flags)) {\\n\\t\\tstruct task_struct *t = task;\",\n \"\\t\\ttask_io_accounting_add(&acct, &task->signal->ioac);\\n\\t\\twhile_each_thread(task, t)\\n\\t\\t\\ttask_io_accounting_add(&acct, &t->ioac);\",\n \"\\t\\tunlock_task_sighand(task, &flags);\\n\\t}\\n\\treturn sprintf(buffer,\\n\\t\\t\\t\\\"rchar: %llu\\\\n\\\"\\n\\t\\t\\t\\\"wchar: %llu\\\\n\\\"\\n\\t\\t\\t\\\"syscr: %llu\\\\n\\\"\\n\\t\\t\\t\\\"syscw: %llu\\\\n\\\"\\n\\t\\t\\t\\\"read_bytes: %llu\\\\n\\\"\\n\\t\\t\\t\\\"write_bytes: %llu\\\\n\\\"\\n\\t\\t\\t\\\"cancelled_write_bytes: %llu\\\\n\\\",\\n\\t\\t\\t(unsigned long long)acct.rchar,\\n\\t\\t\\t(unsigned long long)acct.wchar,\\n\\t\\t\\t(unsigned long long)acct.syscr,\\n\\t\\t\\t(unsigned long long)acct.syscw,\\n\\t\\t\\t(unsigned long long)acct.read_bytes,\\n\\t\\t\\t(unsigned long long)acct.write_bytes,\\n\\t\\t\\t(unsigned long long)acct.cancelled_write_bytes);\\n}\",\n \"static int proc_tid_io_accounting(struct task_struct *task, char *buffer)\\n{\\n\\treturn do_io_accounting(task, buffer, 0);\\n}\",\n \"static int proc_tgid_io_accounting(struct task_struct *task, char *buffer)\\n{\\n\\treturn do_io_accounting(task, buffer, 1);\\n}\\n#endif /* CONFIG_TASK_IO_ACCOUNTING */\",\n \"static int proc_pid_personality(struct seq_file *m, struct pid_namespace *ns,\\n\\t\\t\\t\\tstruct pid *pid, struct task_struct *task)\\n{\\n\\tint err = lock_trace(task);\\n\\tif (!err) {\\n\\t\\tseq_printf(m, \\\"%08x\\\\n\\\", task->personality);\\n\\t\\tunlock_trace(task);\\n\\t}\\n\\treturn err;\\n}\",\n \"/*\\n * Thread groups\\n */\\nstatic const struct file_operations proc_task_operations;\\nstatic const struct inode_operations proc_task_inode_operations;\",\n \"static const struct pid_entry tgid_base_stuff[] = {\\n\\tDIR(\\\"task\\\", S_IRUGO|S_IXUGO, proc_task_inode_operations, proc_task_operations),\\n\\tDIR(\\\"fd\\\", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),\\n\\tDIR(\\\"fdinfo\\\", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),\\n\\tDIR(\\\"ns\\\",\\t S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),\\n#ifdef CONFIG_NET\\n\\tDIR(\\\"net\\\", S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations),\\n#endif\\n\\tREG(\\\"environ\\\", S_IRUSR, proc_environ_operations),\\n\\tINF(\\\"auxv\\\", S_IRUSR, proc_pid_auxv),\\n\\tONE(\\\"status\\\", S_IRUGO, proc_pid_status),\\n\\tONE(\\\"personality\\\", S_IRUGO, proc_pid_personality),\\n\\tINF(\\\"limits\\\",\\t S_IRUGO, proc_pid_limits),\\n#ifdef CONFIG_SCHED_DEBUG\\n\\tREG(\\\"sched\\\", S_IRUGO|S_IWUSR, proc_pid_sched_operations),\\n#endif\\n#ifdef CONFIG_SCHED_AUTOGROUP\\n\\tREG(\\\"autogroup\\\", S_IRUGO|S_IWUSR, proc_pid_sched_autogroup_operations),\\n#endif\\n\\tREG(\\\"comm\\\", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),\\n#ifdef CONFIG_HAVE_ARCH_TRACEHOOK\\n\\tINF(\\\"syscall\\\", S_IRUGO, proc_pid_syscall),\\n#endif\\n\\tINF(\\\"cmdline\\\", S_IRUGO, proc_pid_cmdline),\\n\\tONE(\\\"stat\\\", S_IRUGO, proc_tgid_stat),\\n\\tONE(\\\"statm\\\", S_IRUGO, proc_pid_statm),\\n\\tREG(\\\"maps\\\", S_IRUGO, proc_maps_operations),\\n#ifdef CONFIG_NUMA\\n\\tREG(\\\"numa_maps\\\", S_IRUGO, proc_numa_maps_operations),\\n#endif\\n\\tREG(\\\"mem\\\", S_IRUSR|S_IWUSR, proc_mem_operations),\\n\\tLNK(\\\"cwd\\\", proc_cwd_link),\\n\\tLNK(\\\"root\\\", proc_root_link),\\n\\tLNK(\\\"exe\\\", proc_exe_link),\\n\\tREG(\\\"mounts\\\", S_IRUGO, proc_mounts_operations),\\n\\tREG(\\\"mountinfo\\\", S_IRUGO, proc_mountinfo_operations),\\n\\tREG(\\\"mountstats\\\", S_IRUSR, proc_mountstats_operations),\\n#ifdef CONFIG_PROC_PAGE_MONITOR\\n\\tREG(\\\"clear_refs\\\", S_IWUSR, proc_clear_refs_operations),\\n\\tREG(\\\"smaps\\\", S_IRUGO, proc_smaps_operations),\\n\\tREG(\\\"pagemap\\\", S_IRUGO, proc_pagemap_operations),\\n#endif\\n#ifdef CONFIG_SECURITY\\n\\tDIR(\\\"attr\\\", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),\\n#endif\\n#ifdef CONFIG_KALLSYMS\\n\\tINF(\\\"wchan\\\", S_IRUGO, proc_pid_wchan),\\n#endif\\n#ifdef CONFIG_STACKTRACE\\n\\tONE(\\\"stack\\\", S_IRUGO, proc_pid_stack),\\n#endif\\n#ifdef CONFIG_SCHEDSTATS\\n\\tINF(\\\"schedstat\\\", S_IRUGO, proc_pid_schedstat),\\n#endif\\n#ifdef CONFIG_LATENCYTOP\\n\\tREG(\\\"latency\\\", S_IRUGO, proc_lstats_operations),\\n#endif\\n#ifdef CONFIG_PROC_PID_CPUSET\\n\\tREG(\\\"cpuset\\\", S_IRUGO, proc_cpuset_operations),\\n#endif\\n#ifdef CONFIG_CGROUPS\\n\\tREG(\\\"cgroup\\\", S_IRUGO, proc_cgroup_operations),\\n#endif\\n\\tINF(\\\"oom_score\\\", S_IRUGO, proc_oom_score),\\n\\tREG(\\\"oom_adj\\\", S_IRUGO|S_IWUSR, proc_oom_adjust_operations),\\n\\tREG(\\\"oom_score_adj\\\", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),\\n#ifdef CONFIG_AUDITSYSCALL\\n\\tREG(\\\"loginuid\\\", S_IWUSR|S_IRUGO, proc_loginuid_operations),\\n\\tREG(\\\"sessionid\\\", S_IRUGO, proc_sessionid_operations),\\n#endif\\n#ifdef CONFIG_FAULT_INJECTION\\n\\tREG(\\\"make-it-fail\\\", S_IRUGO|S_IWUSR, proc_fault_inject_operations),\\n#endif\\n#ifdef CONFIG_ELF_CORE\\n\\tREG(\\\"coredump_filter\\\", S_IRUGO|S_IWUSR, proc_coredump_filter_operations),\\n#endif\\n#ifdef CONFIG_TASK_IO_ACCOUNTING\\n\\tINF(\\\"io\\\",\\tS_IRUSR, proc_tgid_io_accounting),\\n#endif\\n#ifdef CONFIG_HARDWALL\\n\\tINF(\\\"hardwall\\\", S_IRUGO, proc_pid_hardwall),\\n#endif\\n};\",\n \"static int proc_tgid_base_readdir(struct file * filp,\\n\\t\\t\\t void * dirent, filldir_t filldir)\\n{\\n\\treturn proc_pident_readdir(filp,dirent,filldir,\\n\\t\\t\\t\\t tgid_base_stuff,ARRAY_SIZE(tgid_base_stuff));\\n}\",\n \"static const struct file_operations proc_tgid_base_operations = {\\n\\t.read\\t\\t= generic_read_dir,\\n\\t.readdir\\t= proc_tgid_base_readdir,\\n\\t.llseek\\t\\t= default_llseek,\\n};\",\n \"static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd){\\n\\treturn proc_pident_lookup(dir, dentry,\\n\\t\\t\\t\\t tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));\\n}\",\n \"static const struct inode_operations proc_tgid_base_inode_operations = {\\n\\t.lookup\\t\\t= proc_tgid_base_lookup,\\n\\t.getattr\\t= pid_getattr,\\n\\t.setattr\\t= proc_setattr,\\n};\",\n \"static void proc_flush_task_mnt(struct vfsmount *mnt, pid_t pid, pid_t tgid)\\n{\\n\\tstruct dentry *dentry, *leader, *dir;\\n\\tchar buf[PROC_NUMBUF];\\n\\tstruct qstr name;\",\n \"\\tname.name = buf;\\n\\tname.len = snprintf(buf, sizeof(buf), \\\"%d\\\", pid);\\n\\tdentry = d_hash_and_lookup(mnt->mnt_root, &name);\\n\\tif (dentry) {\\n\\t\\tshrink_dcache_parent(dentry);\\n\\t\\td_drop(dentry);\\n\\t\\tdput(dentry);\\n\\t}\",\n \"\\tname.name = buf;\\n\\tname.len = snprintf(buf, sizeof(buf), \\\"%d\\\", tgid);\\n\\tleader = d_hash_and_lookup(mnt->mnt_root, &name);\\n\\tif (!leader)\\n\\t\\tgoto out;\",\n \"\\tname.name = \\\"task\\\";\\n\\tname.len = strlen(name.name);\\n\\tdir = d_hash_and_lookup(leader, &name);\\n\\tif (!dir)\\n\\t\\tgoto out_put_leader;\",\n \"\\tname.name = buf;\\n\\tname.len = snprintf(buf, sizeof(buf), \\\"%d\\\", pid);\\n\\tdentry = d_hash_and_lookup(dir, &name);\\n\\tif (dentry) {\\n\\t\\tshrink_dcache_parent(dentry);\\n\\t\\td_drop(dentry);\\n\\t\\tdput(dentry);\\n\\t}\",\n \"\\tdput(dir);\\nout_put_leader:\\n\\tdput(leader);\\nout:\\n\\treturn;\\n}\",\n \"/**\\n * proc_flush_task - Remove dcache entries for @task from the /proc dcache.\\n * @task: task that should be flushed.\\n *\\n * When flushing dentries from proc, one needs to flush them from global\\n * proc (proc_mnt) and from all the namespaces' procs this task was seen\\n * in. This call is supposed to do all of this job.\\n *\\n * Looks in the dcache for\\n * /proc/@pid\\n * /proc/@tgid/task/@pid\\n * if either directory is present flushes it and all of it'ts children\\n * from the dcache.\\n *\\n * It is safe and reasonable to cache /proc entries for a task until\\n * that task exits. After that they just clog up the dcache with\\n * useless entries, possibly causing useful dcache entries to be\\n * flushed instead. This routine is proved to flush those useless\\n * dcache entries at process exit time.\\n *\\n * NOTE: This routine is just an optimization so it does not guarantee\\n * that no dcache entries will exist at process exit time it\\n * just makes it very unlikely that any will persist.\\n */\",\n \"void proc_flush_task(struct task_struct *task)\\n{\\n\\tint i;\\n\\tstruct pid *pid, *tgid;\\n\\tstruct upid *upid;\",\n \"\\tpid = task_pid(task);\\n\\ttgid = task_tgid(task);\",\n \"\\tfor (i = 0; i <= pid->level; i++) {\\n\\t\\tupid = &pid->numbers[i];\\n\\t\\tproc_flush_task_mnt(upid->ns->proc_mnt, upid->nr,\\n\\t\\t\\t\\t\\ttgid->numbers[i].nr);\\n\\t}\",\n \"\\tupid = &pid->numbers[pid->level];\\n\\tif (upid->nr == 1)\\n\\t\\tpid_ns_release_proc(upid->ns);\\n}\",\n \"static struct dentry *proc_pid_instantiate(struct inode *dir,\\n\\t\\t\\t\\t\\t struct dentry * dentry,\\n\\t\\t\\t\\t\\t struct task_struct *task, const void *ptr)\\n{\\n\\tstruct dentry *error = ERR_PTR(-ENOENT);\\n\\tstruct inode *inode;\",\n \"\\tinode = proc_pid_make_inode(dir->i_sb, task);\\n\\tif (!inode)\\n\\t\\tgoto out;\",\n \"\\tinode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;\\n\\tinode->i_op = &proc_tgid_base_inode_operations;\\n\\tinode->i_fop = &proc_tgid_base_operations;\\n\\tinode->i_flags|=S_IMMUTABLE;\",\n \"\\tinode->i_nlink = 2 + pid_entry_count_dirs(tgid_base_stuff,\\n\\t\\tARRAY_SIZE(tgid_base_stuff));\",\n \"\\td_set_d_op(dentry, &pid_dentry_operations);\",\n \"\\td_add(dentry, inode);\\n\\t/* Close the race of the process dying before we return the dentry */\\n\\tif (pid_revalidate(dentry, NULL))\\n\\t\\terror = NULL;\\nout:\\n\\treturn error;\\n}\",\n \"struct dentry *proc_pid_lookup(struct inode *dir, struct dentry * dentry, struct nameidata *nd)\\n{\\n\\tstruct dentry *result;\\n\\tstruct task_struct *task;\\n\\tunsigned tgid;\\n\\tstruct pid_namespace *ns;\",\n \"\\tresult = proc_base_lookup(dir, dentry);\\n\\tif (!IS_ERR(result) || PTR_ERR(result) != -ENOENT)\\n\\t\\tgoto out;\",\n \"\\ttgid = name_to_int(dentry);\\n\\tif (tgid == ~0U)\\n\\t\\tgoto out;\",\n \"\\tns = dentry->d_sb->s_fs_info;\\n\\trcu_read_lock();\\n\\ttask = find_task_by_pid_ns(tgid, ns);\\n\\tif (task)\\n\\t\\tget_task_struct(task);\\n\\trcu_read_unlock();\\n\\tif (!task)\\n\\t\\tgoto out;\",\n \"\\tresult = proc_pid_instantiate(dir, dentry, task, NULL);\\n\\tput_task_struct(task);\\nout:\\n\\treturn result;\\n}\",\n \"/*\\n * Find the first task with tgid >= tgid\\n *\\n */\\nstruct tgid_iter {\\n\\tunsigned int tgid;\\n\\tstruct task_struct *task;\\n};\\nstatic struct tgid_iter next_tgid(struct pid_namespace *ns, struct tgid_iter iter)\\n{\\n\\tstruct pid *pid;\",\n \"\\tif (iter.task)\\n\\t\\tput_task_struct(iter.task);\\n\\trcu_read_lock();\\nretry:\\n\\titer.task = NULL;\\n\\tpid = find_ge_pid(iter.tgid, ns);\\n\\tif (pid) {\\n\\t\\titer.tgid = pid_nr_ns(pid, ns);\\n\\t\\titer.task = pid_task(pid, PIDTYPE_PID);\\n\\t\\t/* What we to know is if the pid we have find is the\\n\\t\\t * pid of a thread_group_leader. Testing for task\\n\\t\\t * being a thread_group_leader is the obvious thing\\n\\t\\t * todo but there is a window when it fails, due to\\n\\t\\t * the pid transfer logic in de_thread.\\n\\t\\t *\\n\\t\\t * So we perform the straight forward test of seeing\\n\\t\\t * if the pid we have found is the pid of a thread\\n\\t\\t * group leader, and don't worry if the task we have\\n\\t\\t * found doesn't happen to be a thread group leader.\\n\\t\\t * As we don't care in the case of readdir.\\n\\t\\t */\\n\\t\\tif (!iter.task || !has_group_leader_pid(iter.task)) {\\n\\t\\t\\titer.tgid += 1;\\n\\t\\t\\tgoto retry;\\n\\t\\t}\\n\\t\\tget_task_struct(iter.task);\\n\\t}\\n\\trcu_read_unlock();\\n\\treturn iter;\\n}\",\n \"#define TGID_OFFSET (FIRST_PROCESS_ENTRY + ARRAY_SIZE(proc_base_stuff))\",\n \"static int proc_pid_fill_cache(struct file *filp, void *dirent, filldir_t filldir,\\n\\tstruct tgid_iter iter)\\n{\\n\\tchar name[PROC_NUMBUF];\\n\\tint len = snprintf(name, sizeof(name), \\\"%d\\\", iter.tgid);\\n\\treturn proc_fill_cache(filp, dirent, filldir, name, len,\\n\\t\\t\\t\\tproc_pid_instantiate, iter.task, NULL);\\n}\",\n \"/* for the /proc/ directory itself, after non-process stuff has been done */\\nint proc_pid_readdir(struct file * filp, void * dirent, filldir_t filldir)\\n{\\n\\tunsigned int nr;\\n\\tstruct task_struct *reaper;\\n\\tstruct tgid_iter iter;\\n\\tstruct pid_namespace *ns;\",\n \"\\tif (filp->f_pos >= PID_MAX_LIMIT + TGID_OFFSET)\\n\\t\\tgoto out_no_task;\\n\\tnr = filp->f_pos - FIRST_PROCESS_ENTRY;\",\n \"\\treaper = get_proc_task(filp->f_path.dentry->d_inode);\\n\\tif (!reaper)\\n\\t\\tgoto out_no_task;\",\n \"\\tfor (; nr < ARRAY_SIZE(proc_base_stuff); filp->f_pos++, nr++) {\\n\\t\\tconst struct pid_entry *p = &proc_base_stuff[nr];\\n\\t\\tif (proc_base_fill_cache(filp, dirent, filldir, reaper, p) < 0)\\n\\t\\t\\tgoto out;\\n\\t}\",\n \"\\tns = filp->f_dentry->d_sb->s_fs_info;\\n\\titer.task = NULL;\\n\\titer.tgid = filp->f_pos - TGID_OFFSET;\\n\\tfor (iter = next_tgid(ns, iter);\\n\\t iter.task;\\n\\t iter.tgid += 1, iter = next_tgid(ns, iter)) {\\n\\t\\tfilp->f_pos = iter.tgid + TGID_OFFSET;\\n\\t\\tif (proc_pid_fill_cache(filp, dirent, filldir, iter) < 0) {\\n\\t\\t\\tput_task_struct(iter.task);\\n\\t\\t\\tgoto out;\\n\\t\\t}\\n\\t}\\n\\tfilp->f_pos = PID_MAX_LIMIT + TGID_OFFSET;\\nout:\\n\\tput_task_struct(reaper);\\nout_no_task:\\n\\treturn 0;\\n}\",\n \"/*\\n * Tasks\\n */\\nstatic const struct pid_entry tid_base_stuff[] = {\\n\\tDIR(\\\"fd\\\", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),\\n\\tDIR(\\\"fdinfo\\\", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),\\n\\tDIR(\\\"ns\\\",\\t S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),\\n\\tREG(\\\"environ\\\", S_IRUSR, proc_environ_operations),\\n\\tINF(\\\"auxv\\\", S_IRUSR, proc_pid_auxv),\\n\\tONE(\\\"status\\\", S_IRUGO, proc_pid_status),\\n\\tONE(\\\"personality\\\", S_IRUGO, proc_pid_personality),\\n\\tINF(\\\"limits\\\",\\t S_IRUGO, proc_pid_limits),\\n#ifdef CONFIG_SCHED_DEBUG\\n\\tREG(\\\"sched\\\", S_IRUGO|S_IWUSR, proc_pid_sched_operations),\\n#endif\\n\\tREG(\\\"comm\\\", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),\\n#ifdef CONFIG_HAVE_ARCH_TRACEHOOK\\n\\tINF(\\\"syscall\\\", S_IRUGO, proc_pid_syscall),\\n#endif\\n\\tINF(\\\"cmdline\\\", S_IRUGO, proc_pid_cmdline),\\n\\tONE(\\\"stat\\\", S_IRUGO, proc_tid_stat),\\n\\tONE(\\\"statm\\\", S_IRUGO, proc_pid_statm),\\n\\tREG(\\\"maps\\\", S_IRUGO, proc_maps_operations),\\n#ifdef CONFIG_NUMA\\n\\tREG(\\\"numa_maps\\\", S_IRUGO, proc_numa_maps_operations),\\n#endif\\n\\tREG(\\\"mem\\\", S_IRUSR|S_IWUSR, proc_mem_operations),\\n\\tLNK(\\\"cwd\\\", proc_cwd_link),\\n\\tLNK(\\\"root\\\", proc_root_link),\\n\\tLNK(\\\"exe\\\", proc_exe_link),\\n\\tREG(\\\"mounts\\\", S_IRUGO, proc_mounts_operations),\\n\\tREG(\\\"mountinfo\\\", S_IRUGO, proc_mountinfo_operations),\\n#ifdef CONFIG_PROC_PAGE_MONITOR\\n\\tREG(\\\"clear_refs\\\", S_IWUSR, proc_clear_refs_operations),\\n\\tREG(\\\"smaps\\\", S_IRUGO, proc_smaps_operations),\\n\\tREG(\\\"pagemap\\\", S_IRUGO, proc_pagemap_operations),\\n#endif\\n#ifdef CONFIG_SECURITY\\n\\tDIR(\\\"attr\\\", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),\\n#endif\\n#ifdef CONFIG_KALLSYMS\\n\\tINF(\\\"wchan\\\", S_IRUGO, proc_pid_wchan),\\n#endif\\n#ifdef CONFIG_STACKTRACE\\n\\tONE(\\\"stack\\\", S_IRUGO, proc_pid_stack),\\n#endif\\n#ifdef CONFIG_SCHEDSTATS\\n\\tINF(\\\"schedstat\\\", S_IRUGO, proc_pid_schedstat),\\n#endif\\n#ifdef CONFIG_LATENCYTOP\\n\\tREG(\\\"latency\\\", S_IRUGO, proc_lstats_operations),\\n#endif\\n#ifdef CONFIG_PROC_PID_CPUSET\\n\\tREG(\\\"cpuset\\\", S_IRUGO, proc_cpuset_operations),\\n#endif\\n#ifdef CONFIG_CGROUPS\\n\\tREG(\\\"cgroup\\\", S_IRUGO, proc_cgroup_operations),\\n#endif\\n\\tINF(\\\"oom_score\\\", S_IRUGO, proc_oom_score),\\n\\tREG(\\\"oom_adj\\\", S_IRUGO|S_IWUSR, proc_oom_adjust_operations),\\n\\tREG(\\\"oom_score_adj\\\", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),\\n#ifdef CONFIG_AUDITSYSCALL\\n\\tREG(\\\"loginuid\\\", S_IWUSR|S_IRUGO, proc_loginuid_operations),\\n\\tREG(\\\"sessionid\\\", S_IRUGO, proc_sessionid_operations),\\n#endif\\n#ifdef CONFIG_FAULT_INJECTION\\n\\tREG(\\\"make-it-fail\\\", S_IRUGO|S_IWUSR, proc_fault_inject_operations),\\n#endif\\n#ifdef CONFIG_TASK_IO_ACCOUNTING\\n\\tINF(\\\"io\\\",\\tS_IRUSR, proc_tid_io_accounting),\\n#endif\\n#ifdef CONFIG_HARDWALL\\n\\tINF(\\\"hardwall\\\", S_IRUGO, proc_pid_hardwall),\\n#endif\\n};\",\n \"static int proc_tid_base_readdir(struct file * filp,\\n\\t\\t\\t void * dirent, filldir_t filldir)\\n{\\n\\treturn proc_pident_readdir(filp,dirent,filldir,\\n\\t\\t\\t\\t tid_base_stuff,ARRAY_SIZE(tid_base_stuff));\\n}\",\n \"static struct dentry *proc_tid_base_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd){\\n\\treturn proc_pident_lookup(dir, dentry,\\n\\t\\t\\t\\t tid_base_stuff, ARRAY_SIZE(tid_base_stuff));\\n}\",\n \"static const struct file_operations proc_tid_base_operations = {\\n\\t.read\\t\\t= generic_read_dir,\\n\\t.readdir\\t= proc_tid_base_readdir,\\n\\t.llseek\\t\\t= default_llseek,\\n};\",\n \"static const struct inode_operations proc_tid_base_inode_operations = {\\n\\t.lookup\\t\\t= proc_tid_base_lookup,\\n\\t.getattr\\t= pid_getattr,\\n\\t.setattr\\t= proc_setattr,\\n};\",\n \"static struct dentry *proc_task_instantiate(struct inode *dir,\\n\\tstruct dentry *dentry, struct task_struct *task, const void *ptr)\\n{\\n\\tstruct dentry *error = ERR_PTR(-ENOENT);\\n\\tstruct inode *inode;\\n\\tinode = proc_pid_make_inode(dir->i_sb, task);\",\n \"\\tif (!inode)\\n\\t\\tgoto out;\\n\\tinode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;\\n\\tinode->i_op = &proc_tid_base_inode_operations;\\n\\tinode->i_fop = &proc_tid_base_operations;\\n\\tinode->i_flags|=S_IMMUTABLE;\",\n \"\\tinode->i_nlink = 2 + pid_entry_count_dirs(tid_base_stuff,\\n\\t\\tARRAY_SIZE(tid_base_stuff));\",\n \"\\td_set_d_op(dentry, &pid_dentry_operations);\",\n \"\\td_add(dentry, inode);\\n\\t/* Close the race of the process dying before we return the dentry */\\n\\tif (pid_revalidate(dentry, NULL))\\n\\t\\terror = NULL;\\nout:\\n\\treturn error;\\n}\",\n \"static struct dentry *proc_task_lookup(struct inode *dir, struct dentry * dentry, struct nameidata *nd)\\n{\\n\\tstruct dentry *result = ERR_PTR(-ENOENT);\\n\\tstruct task_struct *task;\\n\\tstruct task_struct *leader = get_proc_task(dir);\\n\\tunsigned tid;\\n\\tstruct pid_namespace *ns;\",\n \"\\tif (!leader)\\n\\t\\tgoto out_no_task;\",\n \"\\ttid = name_to_int(dentry);\\n\\tif (tid == ~0U)\\n\\t\\tgoto out;\",\n \"\\tns = dentry->d_sb->s_fs_info;\\n\\trcu_read_lock();\\n\\ttask = find_task_by_pid_ns(tid, ns);\\n\\tif (task)\\n\\t\\tget_task_struct(task);\\n\\trcu_read_unlock();\\n\\tif (!task)\\n\\t\\tgoto out;\\n\\tif (!same_thread_group(leader, task))\\n\\t\\tgoto out_drop_task;\",\n \"\\tresult = proc_task_instantiate(dir, dentry, task, NULL);\\nout_drop_task:\\n\\tput_task_struct(task);\\nout:\\n\\tput_task_struct(leader);\\nout_no_task:\\n\\treturn result;\\n}\",\n \"/*\\n * Find the first tid of a thread group to return to user space.\\n *\\n * Usually this is just the thread group leader, but if the users\\n * buffer was too small or there was a seek into the middle of the\\n * directory we have more work todo.\\n *\\n * In the case of a short read we start with find_task_by_pid.\\n *\\n * In the case of a seek we start with the leader and walk nr\\n * threads past it.\\n */\\nstatic struct task_struct *first_tid(struct task_struct *leader,\\n\\t\\tint tid, int nr, struct pid_namespace *ns)\\n{\\n\\tstruct task_struct *pos;\",\n \"\\trcu_read_lock();\\n\\t/* Attempt to start with the pid of a thread */\\n\\tif (tid && (nr > 0)) {\\n\\t\\tpos = find_task_by_pid_ns(tid, ns);\\n\\t\\tif (pos && (pos->group_leader == leader))\\n\\t\\t\\tgoto found;\\n\\t}\",\n \"\\t/* If nr exceeds the number of threads there is nothing todo */\\n\\tpos = NULL;\\n\\tif (nr && nr >= get_nr_threads(leader))\\n\\t\\tgoto out;\",\n \"\\t/* If we haven't found our starting place yet start\\n\\t * with the leader and walk nr threads forward.\\n\\t */\\n\\tfor (pos = leader; nr > 0; --nr) {\\n\\t\\tpos = next_thread(pos);\\n\\t\\tif (pos == leader) {\\n\\t\\t\\tpos = NULL;\\n\\t\\t\\tgoto out;\\n\\t\\t}\\n\\t}\\nfound:\\n\\tget_task_struct(pos);\\nout:\\n\\trcu_read_unlock();\\n\\treturn pos;\\n}\",\n \"/*\\n * Find the next thread in the thread list.\\n * Return NULL if there is an error or no next thread.\\n *\\n * The reference to the input task_struct is released.\\n */\\nstatic struct task_struct *next_tid(struct task_struct *start)\\n{\\n\\tstruct task_struct *pos = NULL;\\n\\trcu_read_lock();\\n\\tif (pid_alive(start)) {\\n\\t\\tpos = next_thread(start);\\n\\t\\tif (thread_group_leader(pos))\\n\\t\\t\\tpos = NULL;\\n\\t\\telse\\n\\t\\t\\tget_task_struct(pos);\\n\\t}\\n\\trcu_read_unlock();\\n\\tput_task_struct(start);\\n\\treturn pos;\\n}\",\n \"static int proc_task_fill_cache(struct file *filp, void *dirent, filldir_t filldir,\\n\\tstruct task_struct *task, int tid)\\n{\\n\\tchar name[PROC_NUMBUF];\\n\\tint len = snprintf(name, sizeof(name), \\\"%d\\\", tid);\\n\\treturn proc_fill_cache(filp, dirent, filldir, name, len,\\n\\t\\t\\t\\tproc_task_instantiate, task, NULL);\\n}\",\n \"/* for the /proc/TGID/task/ directories */\\nstatic int proc_task_readdir(struct file * filp, void * dirent, filldir_t filldir)\\n{\\n\\tstruct dentry *dentry = filp->f_path.dentry;\\n\\tstruct inode *inode = dentry->d_inode;\\n\\tstruct task_struct *leader = NULL;\\n\\tstruct task_struct *task;\\n\\tint retval = -ENOENT;\\n\\tino_t ino;\\n\\tint tid;\\n\\tstruct pid_namespace *ns;\",\n \"\\ttask = get_proc_task(inode);\\n\\tif (!task)\\n\\t\\tgoto out_no_task;\\n\\trcu_read_lock();\\n\\tif (pid_alive(task)) {\\n\\t\\tleader = task->group_leader;\\n\\t\\tget_task_struct(leader);\\n\\t}\\n\\trcu_read_unlock();\\n\\tput_task_struct(task);\\n\\tif (!leader)\\n\\t\\tgoto out_no_task;\\n\\tretval = 0;\",\n \"\\tswitch ((unsigned long)filp->f_pos) {\\n\\tcase 0:\\n\\t\\tino = inode->i_ino;\\n\\t\\tif (filldir(dirent, \\\".\\\", 1, filp->f_pos, ino, DT_DIR) < 0)\\n\\t\\t\\tgoto out;\\n\\t\\tfilp->f_pos++;\\n\\t\\t/* fall through */\\n\\tcase 1:\\n\\t\\tino = parent_ino(dentry);\\n\\t\\tif (filldir(dirent, \\\"..\\\", 2, filp->f_pos, ino, DT_DIR) < 0)\\n\\t\\t\\tgoto out;\\n\\t\\tfilp->f_pos++;\\n\\t\\t/* fall through */\\n\\t}\",\n \"\\t/* f_version caches the tgid value that the last readdir call couldn't\\n\\t * return. lseek aka telldir automagically resets f_version to 0.\\n\\t */\\n\\tns = filp->f_dentry->d_sb->s_fs_info;\\n\\ttid = (int)filp->f_version;\\n\\tfilp->f_version = 0;\\n\\tfor (task = first_tid(leader, tid, filp->f_pos - 2, ns);\\n\\t task;\\n\\t task = next_tid(task), filp->f_pos++) {\\n\\t\\ttid = task_pid_nr_ns(task, ns);\\n\\t\\tif (proc_task_fill_cache(filp, dirent, filldir, task, tid) < 0) {\\n\\t\\t\\t/* returning this tgid failed, save it as the first\\n\\t\\t\\t * pid for the next readir call */\\n\\t\\t\\tfilp->f_version = (u64)tid;\\n\\t\\t\\tput_task_struct(task);\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\nout:\\n\\tput_task_struct(leader);\\nout_no_task:\\n\\treturn retval;\\n}\",\n \"static int proc_task_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)\\n{\\n\\tstruct inode *inode = dentry->d_inode;\\n\\tstruct task_struct *p = get_proc_task(inode);\\n\\tgeneric_fillattr(inode, stat);\",\n \"\\tif (p) {\\n\\t\\tstat->nlink += get_nr_threads(p);\\n\\t\\tput_task_struct(p);\\n\\t}\",\n \"\\treturn 0;\\n}\",\n \"static const struct inode_operations proc_task_inode_operations = {\\n\\t.lookup\\t\\t= proc_task_lookup,\\n\\t.getattr\\t= proc_task_getattr,\\n\\t.setattr\\t= proc_setattr,\\n};\",\n \"static const struct file_operations proc_task_operations = {\\n\\t.read\\t\\t= generic_read_dir,\\n\\t.readdir\\t= proc_task_readdir,\\n\\t.llseek\\t\\t= default_llseek,\\n};\\n\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"REPOSVUL"},"index":{"kind":"number","value":74,"string":"74"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":1,"numItemsPerPage":100,"numTotalItems":227445,"offset":100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3Njc2NzY3Mywic3ViIjoiL2RhdGFzZXRzL3ZpdmkteXUvYWxsX3Byb2Nlc3NlZCIsImV4cCI6MTc3Njc3MTI3MywiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.hld8LYaRCAF8pNNqsO4oH2G88Znw6HtDX9NVGKu3weDq6FM5e2tlKORd5TUYCHH7G18OmD83oMX9EeFOlBcuDQ","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":227445,"numBytesParquet":1052826886},{"config":"default","split":"test","numRows":44001,"numBytesParquet":121181568},{"config":"default","split":"validation","numRows":40977,"numBytesParquet":103806423}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
prompt stringclasses 547
values | completions listlengths 1 63.8k | labels listlengths 1 63.8k | source stringclasses 5
values | index int64 0 151k |
|---|---|---|---|---|
Determine whether the code is vulnerable or not. | [
"/*\n * kernel/sched.c\n *\n * Kernel scheduler and related syscalls\n *\n * Copyright (C) 1991-2002 Linus Torvalds\n *\n * 1996-12-23 Modified by Dave Grothe to fix bugs in semaphores and\n *\t\tmake semaphores SMP safe\n * 1998-11-19\tImplemented schedule_timeout() and related stuff\n *\t\tby Andrea Arcang... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 31 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/cifs/dir.c\n *\n * vfs operations that deal with dentries\n *\n * Copyright (C) International Business Machines Corp., 2002,2009\n * Author(s): Steve French (sfrench@us.ibm.com)\n *\n * This library is free software; you can redistribute it and/or modify\n * it under the terms of the GNU Les... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 32 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/fs/binfmt_elf.c\n *\n * These are the functions used to load ELF format executables as used\n * on SVr4 machines. Information on the format may be found in the book\n * \"UNIX SYSTEM V RELEASE 4 Programmers Guide: Ansi C and Programming Support\n * Tools\".\n *\n * Copyright 1993, 1994: Eric Youngdal... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 33 |
Determine whether the code is vulnerable or not. | [
"/*\n * User-mode machine state access\n *\n * Copyright (C) 2007 Red Hat, Inc. All rights reserved.\n *\n * This copyrighted material is made available to anyone wishing to use,\n * modify, copy, or redistribute it subject to the terms and conditions\n * of the GNU General Public License v.2.\n *\n * Red Hat Auth... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 33 |
Determine whether the code is vulnerable or not. | [
"/* memcontrol.c - Memory Controller\n *\n * Copyright IBM Corporation, 2007\n * Author Balbir Singh <balbir@linux.vnet.ibm.com>\n *\n * Copyright 2007 OpenVZ SWsoft Inc\n * Author: Pavel Emelianov <xemul@openvz.org>\n *\n * Memory thresholds\n * Copyright (C) 2009 Nokia Corporation\n * Author: Kirill A. Shutemov\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 34 |
Determine whether the code is vulnerable or not. | [
"/*\n * kvm_ia64.c: Basic KVM suppport On Itanium series processors\n *\n *\n * \tCopyright (C) 2007, Intel Corporation.\n * \tXiantao Zhang (xiantao.zhang@intel.com)\n *\n * This program is free software; you can redistribute it and/or modify it\n * under the terms and conditions of the GNU General Public Licens... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 35 |
Determine whether the code is vulnerable or not. | [
"/*\n * Kernel-based Virtual Machine driver for Linux\n *\n * derived from drivers/kvm/kvm_main.c\n *\n * Copyright (C) 2006 Qumranet, Inc.\n * Copyright (C) 2008 Qumranet, Inc.\n * Copyright IBM Corporation, 2008\n * Copyright 2010 Red Hat, Inc. and/or its affiliates.\n *\n * Authors:\n * Avi Kivity <avi@qumra... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 35 |
Determine whether the code is vulnerable or not. | [
"#ifndef __KVM_HOST_H\n#define __KVM_HOST_H",
"/*\n * This work is licensed under the terms of the GNU GPL, version 2. See\n * the COPYING file in the top-level directory.\n */",
"#include <linux/types.h>\n#include <linux/hardirq.h>\n#include <linux/list.h>\n#include <linux/mutex.h>\n#include <linux/spinlock.h... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 35 |
Determine whether the code is vulnerable or not. | [
"/*\n * Kernel-based Virtual Machine driver for Linux\n *\n * This module enables machines with Intel VT-x extensions to run virtual\n * machines without emulation or binary translation.\n *\n * Copyright (C) 2006 Qumranet, Inc.\n * Copyright 2010 Red Hat, Inc. and/or its affiliates.\n *\n * Authors:\n * Avi Kivi... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 35 |
Determine whether the code is vulnerable or not. | [
"#ifndef __KVM_HOST_H\n#define __KVM_HOST_H",
"/*\n * This work is licensed under the terms of the GNU GPL, version 2. See\n * the COPYING file in the top-level directory.\n */",
"#include <linux/types.h>\n#include <linux/hardirq.h>\n#include <linux/list.h>\n#include <linux/mutex.h>\n#include <linux/spinlock.h... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 36 |
Determine whether the code is vulnerable or not. | [
"/*\n * Copyright (c) 2006, Intel Corporation.\n *\n * This program is free software; you can redistribute it and/or modify it\n * under the terms and conditions of the GNU General Public License,\n * version 2, as published by the Free Software Foundation.\n *\n * This program is distributed in the hope it will be... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1... | REPOSVUL | 36 |
Determine whether the code is vulnerable or not. | [
"/*\n * Copyright (c) 2006, Intel Corporation.\n *\n * This program is free software; you can redistribute it and/or modify it\n * under the terms and conditions of the GNU General Public License,\n * version 2, as published by the Free Software Foundation.\n *\n * This program is distributed in the hope it will be... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 36 |
Determine whether the code is vulnerable or not. | [
"/*\n * Kernel-based Virtual Machine driver for Linux\n *\n * This module enables machines with Intel VT-x extensions to run virtual\n * machines without emulation or binary translation.\n *\n * Copyright (C) 2006 Qumranet, Inc.\n * Copyright 2010 Red Hat, Inc. and/or its affiliates.\n *\n * Authors:\n * Avi Kivi... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 36 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/nfs/nfs4proc.c\n *\n * Client-side procedure declarations for NFSv4.\n *\n * Copyright (c) 2002 The Regents of the University of Michigan.\n * All rights reserved.\n *\n * Kendrick Smith <kmsmith@umich.edu>\n * Andy Adamson <andros@umich.edu>\n *\n * Redistribution and use in source and binary f... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 37 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/nfs/nfs4xdr.c\n *\n * Client-side XDR for NFSv4.\n *\n * Copyright (c) 2002 The Regents of the University of Michigan.\n * All rights reserved.\n *\n * Kendrick Smith <kmsmith@umich.edu>\n * Andy Adamson <andros@umich.edu>\n *\n * Redistribution and use in source and binary forms, with or withou... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 37 |
Determine whether the code is vulnerable or not. | [
"#ifndef _LINUX_NFS_XDR_H\n#define _LINUX_NFS_XDR_H",
"#include <linux/nfsacl.h>\n#include <linux/nfs3.h>\n#include <linux/sunrpc/gss_api.h>",
"/*\n * To change the maximum rsize and wsize supported by the NFS client, adjust\n * NFS_MAX_FILE_IO_SIZE. 64KB is a typical maximum, but some servers can\n * support ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 37 |
Determine whether the code is vulnerable or not. | [
"/*\n * XDR standard data types and function declarations\n *\n * Copyright (C) 1995-1997 Olaf Kirch <okir@monad.swb.de>\n *\n * Based on:\n * RFC 4506 \"XDR: External Data Representation Standard\", May 2006\n */",
"#ifndef _SUNRPC_XDR_H_\n#define _SUNRPC_XDR_H_",
"#ifdef __KERNEL__",
"#include <linux/uio.... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 37 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/net/sunrpc/xdr.c\n *\n * Generic XDR support.\n *\n * Copyright (C) 1995, 1996 Olaf Kirch <okir@monad.swb.de>\n */",
"#include <linux/module.h>\n#include <linux/slab.h>\n#include <linux/types.h>\n#include <linux/string.h>\n#include <linux/kernel.h>\n#include <linux/pagemap.h>\n#include <linux/errno.... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 37 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/fs/hfsplus/catalog.c\n *\n * Copyright (C) 2001\n * Brad Boyer (flar@allandria.com)\n * (C) 2003 Ardis Technologies <roman@ardistech.com>\n *\n * Handling of catalog records\n */",
"\n#include \"hfsplus_fs.h\"\n#include \"hfsplus_raw.h\"",
"int hfsplus_cat_case_cmp_key(const hfsplus_btree_key *k1... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 38 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/fs/hfsplus/dir.c\n *\n * Copyright (C) 2001\n * Brad Boyer (flar@allandria.com)\n * (C) 2003 Ardis Technologies <roman@ardistech.com>\n *\n * Handling of directories\n */",
"#include <linux/errno.h>\n#include <linux/fs.h>\n#include <linux/slab.h>\n#include <linux/random.h>",
"#include \"hfsplus_f... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 38 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/mm/oom_kill.c\n * \n * Copyright (C) 1998,2000 Rik van Riel\n *\tThanks go out to Claus Fischer for some serious inspiration and\n *\tfor goading me into coding this file...\n * Copyright (C) 2010 Google, Inc.\n *\tRewritten by David Rientjes\n *\n * The routines in this file are used to kill ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 39 |
Determine whether the code is vulnerable or not. | [
"/* $Id: isdn_net.c,v 1.1.2.2 2004/01/12 22:37:19 keil Exp $\n *\n * Linux ISDN subsystem, network interfaces and related functions (linklevel).\n *\n * Copyright 1994-1998 by Fritz Elfert (fritz@isdn4linux.de)\n * Copyright 1995,96 by Thinking Objects Software GmbH Wuerzburg\n * Copyright 1995,96 by Michael... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * originally based on the dummy device.\n *\n * Copyright 1999, Thomas Davis, tadavis@lbl.gov.\n * Licensed under the GPL. Based on dummy.c, and eql.c devices.\n *\n * bonding.c: an Ethernet Bonding driver\n *\n * This is useful to talk to a Cisco EtherChannel compatible equipment:\n *\tCisco 5500\n *\tSun Tr... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/* drivers/net/ifb.c:",
"\tThe purpose of this driver is to provide a device that allows\n\tfor sharing of resources:",
"\t1) qdiscs/policies that are per device as opposed to system wide.\n\tifb allows for a device which can be redirected to thus providing\n\tan impression of sharing.",
"\t2) Allows for que... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * Copyright (c) 2007 Patrick McHardy <kaber@trash.net>\n *\n * This program is free software; you can redistribute it and/or\n * modify it under the terms of the GNU General Public License as\n * published by the Free Software Foundation; either version 2 of\n * the License, or (at your option) any later vers... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * TUN - Universal TUN/TAP device driver.\n * Copyright (C) 1999-2002 Maxim Krasnyansky <maxk@qualcomm.com>\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * drivers/net/veth.c\n *\n * Copyright (C) 2007 OpenVZ http://openvz.org, SWsoft Inc\n *\n * Author: Pavel Emelianov <xemul@openvz.org>\n * Ethtool interface from: Eric W. Biederman <ebiederm@xmission.com>\n *\n */",
"#include <linux/netdevice.h>\n#include <linux/slab.h>\n#include <linux/ethtool.h>\n#incl... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * Generic HDLC support routines for Linux\n * Frame Relay support\n *\n * Copyright (C) 1999 - 2006 Krzysztof Halasa <khc@pm.waw.pl>\n *\n * This program is free software; you can redistribute it and/or modify it\n * under the terms of version 2 of the GNU General Public License\n * as published by the Free S... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*======================================================================",
" Aironet driver for 4500 and 4800 series cards",
" This code is released under both the GPL version 2 and BSD licenses.\n Either license may be used. The respective licenses are found at\n the end of this file.",
" Th... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * Host AP (software wireless LAN access point) driver for\n * Intersil Prism2/2.5/3 - hostap.o module, common routines\n *\n * Copyright (c) 2001-2002, SSH Communications Security Corp and Jouni Malinen\n * <j@w1.fi>\n * Copyright (c) 2002-2005, Jouni Malinen <j@w1.fi>\n *\n * This program is free software; y... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"//------------------------------------------------------------------------------\n// Copyright (c) 2004-2010 Atheros Communications Inc.\n// All rights reserved.\n//\n// \n//\n// Permission to use, copy, modify, and/or distribute this software for any\n// purpose with or without fee is hereby granted, provided tha... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/* -*- linux-c -*-\n * INET\t\t802.1Q VLAN\n *\t\tEthernet-type device handling.\n *\n * Authors:\tBen Greear <greearb@candelatech.com>\n * Please send support related email to: netdev@vger.kernel.org\n * VLAN Home Page: http://www.candelatech.com/~greear/vlan.html\n *\n * Fixes: Ma... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n BNEP implementation for Linux Bluetooth stack (BlueZ).\n Copyright (C) 2001-2002 Inventel Systemes\n Written 2001-2002 by\n\tClément Moreau <clement.moreau@inventel.fr>\n\tDavid Libault <david.libault@inventel.fr>",
" Copyright (C) 2002 Maxim Krasnyansky <maxk@qualcomm.com>",
" This program is ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * L2TPv3 ethernet pseudowire driver\n *\n * Copyright (c) 2008,2009,2010 Katalix Systems Ltd\n *\n *\tThis program is free software; you can redistribute it and/or\n *\tmodify it under the terms of the GNU General Public License\n *\tas published by the Free Software Foundation; either version\n *\t2 of the L... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * Interface handling (except master interface)\n *\n * Copyright 2002-2005, Instant802 Networks, Inc.\n * Copyright 2005-2006, Devicescape Software, Inc.\n * Copyright (c) 2006 Jiri Benc <jbenc@suse.cz>\n * Copyright 2008, Johannes Berg <johannes@sipsolutions.net>\n *\n * This program is free software; you ca... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 40 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/kernel/exit.c\n *\n * Copyright (C) 1991, 1992 Linus Torvalds\n */",
"#include <linux/mm.h>\n#include <linux/slab.h>\n#include <linux/interrupt.h>\n#include <linux/module.h>\n#include <linux/capability.h>\n#include <linux/completion.h>\n#include <linux/personality.h>\n#include <linux/tty.h>\n#inc... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 41 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/kernel/fork.c\n *\n * Copyright (C) 1991, 1992 Linus Torvalds\n */",
"/*\n * 'fork.c' contains the help-routines for the 'fork' system call\n * (see also entry.S and others).\n * Fork is rather simple, once you get the hang of it, but the memory\n * management can be a bitch. See 'mm/memory.c': ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 41 |
Determine whether the code is vulnerable or not. | [
"/*\n * Copyright (C) 2004 IBM Corporation\n *\n * Authors:\n * Leendert van Doorn <leendert@watson.ibm.com>\n * Dave Safford <safford@watson.ibm.com>\n * Reiner Sailer <sailer@watson.ibm.com>\n * Kylene Hall <kjhall@us.ibm.com>\n *\n * Maintained by: <tpmdd-devel@lists.sourceforge.net>\n *\n * Device driver for TC... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 42 |
Determine whether the code is vulnerable or not. | [
"/*\n *\tdev_table.h\n *\n *\tGlobal definitions for device call tables\n *\n *\n * Copyright (C) by Hannu Savolainen 1993-1997\n *\n * OSS/Free for Linux is distributed under the GNU GENERAL PUBLIC LICENSE (GPL)\n * Version 2 (June 1991). See the \"COPYING\" file distributed with this software\n * for more info.\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 43 |
Determine whether the code is vulnerable or not. | [
"/*\n * sound/oss/midi_synth.c\n *\n * High level midi sequencer manager for dumb MIDI interfaces.\n */\n/*\n * Copyright (C) by Hannu Savolainen 1993-1997\n *\n * OSS/Free for Linux is distributed under the GNU GENERAL PUBLIC LICENSE (GPL)\n * Version 2 (June 1991). See the \"COPYING\" file distributed with this s... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 43 |
Determine whether the code is vulnerable or not. | [
"int midi_synth_ioctl (int dev,\n\t unsigned int cmd, void __user * arg);\nint midi_synth_kill_note (int dev, int channel, int note, int velocity);\nint midi_synth_set_instr (int dev, int channel, int instr_no);\nint midi_synth_start_note (int dev, int channel, int note, int volume);\nvoid midi_synth_reset (int ... | [
1,
1,
1
] | REPOSVUL | 43 |
Determine whether the code is vulnerable or not. | [
"/*\n * sound/oss/opl3.c\n *\n * A low level driver for Yamaha YM3812 and OPL-3 -chips\n *\n *\n * Copyright (C) by Hannu Savolainen 1993-1997\n *\n * OSS/Free for Linux is distributed under the GNU GENERAL PUBLIC LICENSE (GPL)\n * Version 2 (June 1991). See the \"COPYING\" file distributed with this software\n * f... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 43 |
Determine whether the code is vulnerable or not. | [
"/*\n * sound/oss/sequencer.c\n *\n * The sequencer personality manager.\n */\n/*\n * Copyright (C) by Hannu Savolainen 1993-1997\n *\n * OSS/Free for Linux is distributed under the GNU GENERAL PUBLIC LICENSE (GPL)\n * Version 2 (June 1991). See the \"COPYING\" file distributed with this software\n * for more info.... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 43 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/inotify_user.c - inotify support for userspace\n *\n * Authors:\n *\tJohn McCutchan\t<ttb@tentacle.dhs.org>\n *\tRobert Love\t<rml@novell.com>\n *\n * Copyright (C) 2005 John McCutchan\n * Copyright 2006 Hewlett-Packard Development Company, L.P.\n *\n * Copyright (C) 2009 Eric Paris <Red Hat Inc>\n * ino... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 44 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/inotify_user.c - inotify support for userspace\n *\n * Authors:\n *\tJohn McCutchan\t<ttb@tentacle.dhs.org>\n *\tRobert Love\t<rml@novell.com>\n *\n * Copyright (C) 2005 John McCutchan\n * Copyright 2006 Hewlett-Packard Development Company, L.P.\n *\n * Copyright (C) 2009 Eric Paris <Red Hat Inc>\n * ino... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 44 |
Determine whether the code is vulnerable or not. | [
"/*\n * Copyright (C) 2008 IBM Corporation\n * Author: Mimi Zohar <zohar@us.ibm.com>\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, version 2 of the License.\n *\n * ima_policy.c\... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 45 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/fs/proc/root.c\n *\n * Copyright (C) 1991, 1992 Linus Torvalds\n *\n * proc root directory handling functions\n */",
"#include <asm/uaccess.h>",
"#include <linux/errno.h>\n#include <linux/time.h>\n#include <linux/proc_fs.h>\n#include <linux/stat.h>\n#include <linux/init.h>\n#include <linux/sche... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 46 |
Determine whether the code is vulnerable or not. | [
"/*\n * Bridge multicast support.\n *\n * Copyright (c) 2010 Herbert Xu <herbert@gondor.apana.org.au>\n *\n * This program is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License as published by the Free\n * Software Foundation; either version 2 of the Licens... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 47 |
Determine whether the code is vulnerable or not. | [
"/*\n * debugfs.c - ACPI debugfs interface to userspace.\n */",
"#include <linux/init.h>\n#include <linux/module.h>\n#include <linux/kernel.h>\n#include <linux/uaccess.h>\n#include <linux/debugfs.h>\n#include <acpi/acpi_drivers.h>",
"#include \"internal.h\"",
"#define _COMPONENT\t\tACPI_SYSTEM_COMPONENT\nACPI... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 48 |
Determine whether the code is vulnerable or not. | [
"/*\n * debugfs.c - ACPI debugfs interface to userspace.\n */",
"#include <linux/init.h>\n#include <linux/debugfs.h>\n#include <acpi/acpi_drivers.h>",
"#define _COMPONENT\t\tACPI_SYSTEM_COMPONENT\nACPI_MODULE_NAME(\"debugfs\");",
"struct dentry *acpi_debugfs_dir;\nEXPORT_SYMBOL_GPL(acpi_debugfs_dir);",
"voi... | [
1,
1,
1,
1,
1
] | REPOSVUL | 48 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/fs/nfs/inode.c\n *\n * Copyright (C) 1992 Rick Sladkey\n *\n * nfs inode and superblock handling functions\n *\n * Modularised by Alan Cox <alan@lxorguk.ukuu.org.uk>, while hacking some\n * experimental NFS changes. Modularisation taken straight from SYS5 fs.\n *\n * Change to nfs_read_super() ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 49 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/fs/nfs/nfs4_fs.h\n *\n * Copyright (C) 2005 Trond Myklebust\n *\n * NFSv4-specific filesystem definitions and declarations\n */",
"#ifndef __LINUX_FS_NFS_NFS4_FS_H\n#define __LINUX_FS_NFS_NFS4_FS_H",
"#ifdef CONFIG_NFS_V4",
"struct idmap;",
"/*\n * In a seqid-mutating op, this macro controls w... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 49 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/nfs/nfs4proc.c\n *\n * Client-side procedure declarations for NFSv4.\n *\n * Copyright (c) 2002 The Regents of the University of Michigan.\n * All rights reserved.\n *\n * Kendrick Smith <kmsmith@umich.edu>\n * Andy Adamson <andros@umich.edu>\n *\n * Redistribution and use in source and binary f... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 49 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/nfs/nfs4state.c\n *\n * Client-side XDR for NFSv4.\n *\n * Copyright (c) 2002 The Regents of the University of Michigan.\n * All rights reserved.\n *\n * Kendrick Smith <kmsmith@umich.edu>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted pr... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 49 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/nfs/nfs4xdr.c\n *\n * Client-side XDR for NFSv4.\n *\n * Copyright (c) 2002 The Regents of the University of Michigan.\n * All rights reserved.\n *\n * Kendrick Smith <kmsmith@umich.edu>\n * Andy Adamson <andros@umich.edu>\n * \n * Redistribution and use in source and binary forms, with or witho... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 49 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/include/linux/nfs_fs.h\n *\n * Copyright (C) 1992 Rick Sladkey\n *\n * OS-specific nfs filesystem definitions and declarations\n */",
"#ifndef _LINUX_NFS_FS_H\n#define _LINUX_NFS_FS_H",
"#include <linux/magic.h>",
"/* Default timeout values */\n#define NFS_DEF_UDP_TIMEO\t(11)\n#define NFS_DE... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 49 |
Determine whether the code is vulnerable or not. | [
"#ifndef _LINUX_NFS_XDR_H\n#define _LINUX_NFS_XDR_H",
"#include <linux/nfsacl.h>",
"/*\n * To change the maximum rsize and wsize supported by the NFS client, adjust\n * NFS_MAX_FILE_IO_SIZE. 64KB is a typical maximum, but some servers can\n * support a megabyte or more. The default is left at 4096 bytes, whic... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 49 |
Determine whether the code is vulnerable or not. | [
"/*\n * sound/oss/opl3.c\n *\n * A low level driver for Yamaha YM3812 and OPL-3 -chips\n *\n *\n * Copyright (C) by Hannu Savolainen 1993-1997\n *\n * OSS/Free for Linux is distributed under the GNU GENERAL PUBLIC LICENSE (GPL)\n * Version 2 (June 1991). See the \"COPYING\" file distributed with this software\n * f... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 50 |
Determine whether the code is vulnerable or not. | [
"/*\n *\tDeclarations of Rose type objects.\n *\n *\tJonathan Naylor G4KLX\t25/8/96\n */",
"#ifndef _ROSE_H\n#define _ROSE_H ",
"#include <linux/rose.h>\n#include <net/sock.h>",
"#define\tROSE_ADDR_LEN\t\t\t5",
"#define\tROSE_MIN_LEN\t\t\t3",
"#define\tROSE_CALL_REQ_ADDR_LEN_OFF\t3\n#define\tROSE_CALL_REQ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 51 |
Determine whether the code is vulnerable or not. | [
"/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 51 |
Determine whether the code is vulnerable or not. | [
"/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 51 |
Determine whether the code is vulnerable or not. | [
"/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 51 |
Determine whether the code is vulnerable or not. | [
"/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 51 |
Determine whether the code is vulnerable or not. | [
"/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
0,
1,
1,
0,
1,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
1,
1,
1,
0,
1... | REPOSVUL | 51 |
Determine whether the code is vulnerable or not. | [
"/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 51 |
Determine whether the code is vulnerable or not. | [
"/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
0,
1,
1,
1... | REPOSVUL | 52 |
Determine whether the code is vulnerable or not. | [
"/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 52 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/inotify_user.c - inotify support for userspace\n *\n * Authors:\n *\tJohn McCutchan\t<ttb@tentacle.dhs.org>\n *\tRobert Love\t<rml@novell.com>\n *\n * Copyright (C) 2005 John McCutchan\n * Copyright 2006 Hewlett-Packard Development Company, L.P.\n *\n * Copyright (C) 2009 Eric Paris <Red Hat Inc>\n * ino... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 53 |
Determine whether the code is vulnerable or not. | [
"/*\n BlueZ - Bluetooth protocol stack for Linux\n Copyright (C) 2000-2001 Qualcomm Incorporated",
" Written 2000,2001 by Maxim Krasnyansky <maxk@qualcomm.com>",
" This program is free software; you can redistribute it and/or modify\n it under the terms of the GNU General Public License version 2 as\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 54 |
Determine whether the code is vulnerable or not. | [
"/*\n BlueZ - Bluetooth protocol stack for Linux\n Copyright (C) 2000-2001 Qualcomm Incorporated",
" Written 2000,2001 by Maxim Krasnyansky <maxk@qualcomm.com>",
" This program is free software; you can redistribute it and/or modify\n it under the terms of the GNU General Public License version 2 as\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 54 |
Determine whether the code is vulnerable or not. | [
"/*\n BNEP implementation for Linux Bluetooth stack (BlueZ).\n Copyright (C) 2001-2002 Inventel Systemes\n Written 2001-2002 by\n\tDavid Libault <david.libault@inventel.fr>",
" Copyright (C) 2002 Maxim Krasnyansky <maxk@qualcomm.com>",
" This program is free software; you can redistribute it and/or m... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 55 |
Determine whether the code is vulnerable or not. | [
"/*\n * ebtables\n *\n * Author:\n * Bart De Schuymer\t\t<bdschuym@pandora.be>\n *\n * ebtables.c,v 2.0, July, 2002\n *\n * This code is stongly inspired on the iptables code which is\n * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling\n *\n * This program is free software; you can redistribute ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 56 |
Determine whether the code is vulnerable or not. | [
"/* Wireless extensions support.\n *\n * See copyright notice in main.c\n */\n#include <linux/slab.h>\n#include <linux/kernel.h>\n#include <linux/if_arp.h>\n#include <linux/wireless.h>\n#include <linux/ieee80211.h>\n#include <net/iw_handler.h>\n#include <net/cfg80211.h>",
"#include \"hermes.h\"\n#include \"hermes... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 57 |
Determine whether the code is vulnerable or not. | [
"/*\n FUSE: Filesystem in Userspace\n Copyright (C) 2001-2008 Miklos Szeredi <miklos@szeredi.hu>",
" This program can be distributed under the terms of the GNU GPL.\n See the file COPYING.\n*/",
"#include \"fuse_i.h\"",
"#include <linux/pagemap.h>\n#include <linux/slab.h>\n#include <linux/kernel.h>\n#inc... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 58 |
Determine whether the code is vulnerable or not. | [
"/**\n * Copyright 2008-2011 Digital Bazaar, Inc.\n *\n * This file is part of librdfa.\n *\n * librdfa is Free Software, and can be licensed under any of the\n * following three licenses:\n *\n * 1. GNU Lesser General Public License (LGPL) V2.1 or any\n * newer version\n * 2. GNU General Public License (G... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 59 |
Determine whether the code is vulnerable or not. | [
"/* -*- Mode: c; c-basic-offset: 2 -*-\n *\n * raptor_libxml.c - Raptor libxml functions\n *\n * Copyright (C) 2000-2009, David Beckett http://www.dajobe.org/\n * Copyright (C) 2000-2004, University of Bristol, UK http://www.bristol.ac.uk/\n * \n * This package is Free Software and part of Redland http://librdf.org... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 59 |
Determine whether the code is vulnerable or not. | [
"/* -*- Mode: c; c-basic-offset: 2 -*-\n *\n * raptor_option.c - Class options\n *\n * Copyright (C) 2004-2010, David Beckett http://www.dajobe.org/\n * Copyright (C) 2004-2005, University of Bristol, UK http://www.bristol.ac.uk/\n * \n * This package is Free Software and part of Redland http://librdf.org/\n * \n *... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 59 |
Determine whether the code is vulnerable or not. | [
"/* -*- Mode: c; c-basic-offset: 2 -*-\n *\n * raptor_rdfxml.c - Raptor RDF/XML Parser\n *\n * Copyright (C) 2000-2008, David Beckett http://www.dajobe.org/\n * Copyright (C) 2000-2005, University of Bristol, UK http://www.bristol.ac.uk/\n * \n * This package is Free Software and part of Redland http://librdf.org/\... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 59 |
Determine whether the code is vulnerable or not. | [
"/* -*- Mode: c; c-basic-offset: 2 -*-\n *\n * raptor_rss.c - Raptor Feeds (RSS and Atom) tag soup parser\n *\n * Copyright (C) 2003-2010, David Beckett http://www.dajobe.org/\n * Copyright (C) 2003-2005, University of Bristol, UK http://www.bristol.ac.uk/\n * \n * This package is Free Software and part of Redland ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 59 |
Determine whether the code is vulnerable or not. | [
"/* -*- Mode: c; c-basic-offset: 2 -*-\n *\n * raptor_turtle_writer.c - Raptor Turtle Writer\n *\n * Copyright (C) 2006, Dave Robillard\n * Copyright (C) 2003-2008, David Beckett http://www.dajobe.org/\n * Copyright (C) 2003-2005, University of Bristol, UK http://www.bristol.ac.uk/\n * \n * This package is Free Sof... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 59 |
Determine whether the code is vulnerable or not. | [
"/*\n * Copyright (C)2003,2004 USAGI/WIDE Project\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 60 |
Determine whether the code is vulnerable or not. | [
"/*\n * taskstats.c - Export per-task statistics to userland\n *\n * Copyright (C) Shailabh Nagar, IBM Corp. 2006\n * (C) Balbir Singh, IBM Corp. 2006\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n *... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 61 |
Determine whether the code is vulnerable or not. | [
"/*\n *\tmm/mremap.c\n *\n *\t(C) Copyright 1996 Linus Torvalds\n *\n *\tAddress space accounting code\t<alan@lxorguk.ukuu.org.uk>\n *\t(C) Copyright 2002 Red Hat Inc, All Rights Reserved\n */",
"#include <linux/mm.h>\n#include <linux/hugetlb.h>\n#include <linux/shm.h>\n#include <linux/ksm.h>\n#include <linux/mma... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 62 |
Determine whether the code is vulnerable or not. | [
"/* D-Link DL2000-based Gigabit Ethernet Adapter Linux driver */\n/*\n Copyright (c) 2001, 2002 by D-Link Corporation\n Written by Edward Peng.<edward_peng@dlink.com.tw>\n Created 03-May-2001, base on Linux' sundance.c.",
" This program is free software; you can redistribute it and/or modify\n it ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 63 |
Determine whether the code is vulnerable or not. | [
"/* D-Link DL2000-based Gigabit Ethernet Adapter Linux driver */\n/*\n Copyright (c) 2001, 2002 by D-Link Corporation\n Written by Edward Peng.<edward_peng@dlink.com.tw>\n Created 03-May-2001, base on Linux' sundance.c.",
" This program is free software; you can redistribute it and/or modify\n it ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | REPOSVUL | 63 |
Determine whether the code is vulnerable or not. | [
"/*\n * fs/nfs/nfs4proc.c\n *\n * Client-side procedure declarations for NFSv4.\n *\n * Copyright (c) 2002 The Regents of the University of Michigan.\n * All rights reserved.\n *\n * Kendrick Smith <kmsmith@umich.edu>\n * Andy Adamson <andros@umich.edu>\n *\n * Redistribution and use in source and binary f... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 64 |
Determine whether the code is vulnerable or not. | [
"/*\n * Copyright © 2008,2010 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 65 |
Determine whether the code is vulnerable or not. | [
"/*\n * Copyright © 2008,2010 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 66 |
Determine whether the code is vulnerable or not. | [
"/*\n * Generic hugetlb support.\n * (C) William Irwin, April 2004\n */\n#include <linux/list.h>\n#include <linux/init.h>\n#include <linux/module.h>\n#include <linux/mm.h>\n#include <linux/seq_file.h>\n#include <linux/sysctl.h>\n#include <linux/highmem.h>\n#include <linux/mmu_notifier.h>\n#include <linux/nodemask.h... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 67 |
Determine whether the code is vulnerable or not. | [
"/**\n * ldm - Support for Windows Logical Disk Manager (Dynamic Disks)\n *\n * Copyright (C) 2001,2002 Richard Russon <ldm@flatcap.org>\n * Copyright (c) 2001-2007 Anton Altaparmakov\n * Copyright (C) 2001,2002 Jakob Kemi <jakob.kemi@telia.com>\n *\n * Documentation is available at http://www.linux-ntfs.org/doku.p... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 68 |
Determine whether the code is vulnerable or not. | [
"/*\n * Memory merging support.\n *\n * This code enables dynamic sharing of identical pages found in different\n * memory areas, even if they are not shared by fork()\n *\n * Copyright (C) 2008-2009 Red Hat, Inc.\n * Authors:\n *\tIzik Eidus\n *\tAndrea Arcangeli\n *\tChris Wright\n *\tHugh Dickins\n *\n * This wo... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 69 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/arch/alpha/kernel/osf_sys.c\n *\n * Copyright (C) 1995 Linus Torvalds\n */",
"/*\n * This file handles some of the stranger OSF/1 system call interfaces.\n * Some of the system calls expect a non-C calling standard, others have\n * special parameter blocks..\n */",
"#include <linux/errno.h>\n#i... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 70 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/arch/alpha/kernel/osf_sys.c\n *\n * Copyright (C) 1995 Linus Torvalds\n */",
"/*\n * This file handles some of the stranger OSF/1 system call interfaces.\n * Some of the system calls expect a non-C calling standard, others have\n * special parameter blocks..\n */",
"#include <linux/errno.h>\n#i... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 70 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/arch/alpha/kernel/osf_sys.c\n *\n * Copyright (C) 1995 Linus Torvalds\n */",
"/*\n * This file handles some of the stranger OSF/1 system call interfaces.\n * Some of the system calls expect a non-C calling standard, others have\n * special parameter blocks..\n */",
"#include <linux/errno.h>\n#i... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 71 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/arch/alpha/kernel/osf_sys.c\n *\n * Copyright (C) 1995 Linus Torvalds\n */",
"/*\n * This file handles some of the stranger OSF/1 system call interfaces.\n * Some of the system calls expect a non-C calling standard, others have\n * special parameter blocks..\n */",
"#include <linux/errno.h>\n#i... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 71 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/arch/alpha/kernel/osf_sys.c\n *\n * Copyright (C) 1995 Linus Torvalds\n */",
"/*\n * This file handles some of the stranger OSF/1 system call interfaces.\n * Some of the system calls expect a non-C calling standard, others have\n * special parameter blocks..\n */",
"#include <linux/errno.h>\n#i... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 72 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/arch/alpha/kernel/osf_sys.c\n *\n * Copyright (C) 1995 Linus Torvalds\n */",
"/*\n * This file handles some of the stranger OSF/1 system call interfaces.\n * Some of the system calls expect a non-C calling standard, others have\n * special parameter blocks..\n */",
"#include <linux/errno.h>\n#i... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 72 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/arch/alpha/kernel/osf_sys.c\n *\n * Copyright (C) 1995 Linus Torvalds\n */",
"/*\n * This file handles some of the stranger OSF/1 system call interfaces.\n * Some of the system calls expect a non-C calling standard, others have\n * special parameter blocks..\n */",
"#include <linux/errno.h>\n#i... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 73 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/arch/alpha/kernel/osf_sys.c\n *\n * Copyright (C) 1995 Linus Torvalds\n */",
"/*\n * This file handles some of the stranger OSF/1 system call interfaces.\n * Some of the system calls expect a non-C calling standard, others have\n * special parameter blocks..\n */",
"#include <linux/errno.h>\n#i... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 73 |
Determine whether the code is vulnerable or not. | [
"/*\n * linux/fs/proc/base.c\n *\n * Copyright (C) 1991, 1992 Linus Torvalds\n *\n * proc base directory handling functions\n *\n * 1999, Al Viro. Rewritten. Now it covers the whole per-process part.\n * Instead of using magical inumbers to determine the kind of object\n * we allocate and fill in-core inodes ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | REPOSVUL | 74 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.