scm.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341
  1. /* scm.c - Socket level control messages processing.
  2. *
  3. * Author: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
  4. * Alignment and value checking mods by Craig Metz
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the License, or (at your option) any later version.
  10. */
  11. #include <linux/module.h>
  12. #include <linux/signal.h>
  13. #include <linux/capability.h>
  14. #include <linux/errno.h>
  15. #include <linux/sched.h>
  16. #include <linux/mm.h>
  17. #include <linux/kernel.h>
  18. #include <linux/stat.h>
  19. #include <linux/socket.h>
  20. #include <linux/file.h>
  21. #include <linux/fcntl.h>
  22. #include <linux/net.h>
  23. #include <linux/interrupt.h>
  24. #include <linux/netdevice.h>
  25. #include <linux/security.h>
  26. #include <linux/pid_namespace.h>
  27. #include <linux/pid.h>
  28. #include <linux/nsproxy.h>
  29. #include <linux/slab.h>
  30. #include <asm/uaccess.h>
  31. #include <net/protocol.h>
  32. #include <linux/skbuff.h>
  33. #include <net/sock.h>
  34. #include <net/compat.h>
  35. #include <net/scm.h>
  36. #include <net/cls_cgroup.h>
  37. /*
  38. * Only allow a user to send credentials, that they could set with
  39. * setu(g)id.
  40. */
  41. static __inline__ int scm_check_creds(struct ucred *creds)
  42. {
  43. const struct cred *cred = current_cred();
  44. kuid_t uid = make_kuid(cred->user_ns, creds->uid);
  45. kgid_t gid = make_kgid(cred->user_ns, creds->gid);
  46. if (!uid_valid(uid) || !gid_valid(gid))
  47. return -EINVAL;
  48. if ((creds->pid == task_tgid_vnr(current) ||
  49. ns_capable(current->nsproxy->pid_ns->user_ns, CAP_SYS_ADMIN)) &&
  50. ((uid_eq(uid, cred->uid) || uid_eq(uid, cred->euid) ||
  51. uid_eq(uid, cred->suid)) || nsown_capable(CAP_SETUID)) &&
  52. ((gid_eq(gid, cred->gid) || gid_eq(gid, cred->egid) ||
  53. gid_eq(gid, cred->sgid)) || nsown_capable(CAP_SETGID))) {
  54. return 0;
  55. }
  56. return -EPERM;
  57. }
  58. static int scm_fp_copy(struct cmsghdr *cmsg, struct scm_fp_list **fplp)
  59. {
  60. int *fdp = (int*)CMSG_DATA(cmsg);
  61. struct scm_fp_list *fpl = *fplp;
  62. struct file **fpp;
  63. int i, num;
  64. num = (cmsg->cmsg_len - CMSG_ALIGN(sizeof(struct cmsghdr)))/sizeof(int);
  65. if (num <= 0)
  66. return 0;
  67. if (num > SCM_MAX_FD)
  68. return -EINVAL;
  69. if (!fpl)
  70. {
  71. fpl = kmalloc(sizeof(struct scm_fp_list), GFP_KERNEL);
  72. if (!fpl)
  73. return -ENOMEM;
  74. *fplp = fpl;
  75. fpl->count = 0;
  76. fpl->max = SCM_MAX_FD;
  77. }
  78. fpp = &fpl->fp[fpl->count];
  79. if (fpl->count + num > fpl->max)
  80. return -EINVAL;
  81. /*
  82. * Verify the descriptors and increment the usage count.
  83. */
  84. for (i=0; i< num; i++)
  85. {
  86. int fd = fdp[i];
  87. struct file *file;
  88. if (fd < 0 || !(file = fget_raw(fd)))
  89. return -EBADF;
  90. *fpp++ = file;
  91. fpl->count++;
  92. }
  93. return num;
  94. }
  95. void __scm_destroy(struct scm_cookie *scm)
  96. {
  97. struct scm_fp_list *fpl = scm->fp;
  98. int i;
  99. if (fpl) {
  100. scm->fp = NULL;
  101. for (i=fpl->count-1; i>=0; i--)
  102. fput(fpl->fp[i]);
  103. kfree(fpl);
  104. }
  105. }
  106. EXPORT_SYMBOL(__scm_destroy);
  107. int __scm_send(struct socket *sock, struct msghdr *msg, struct scm_cookie *p)
  108. {
  109. struct cmsghdr *cmsg;
  110. int err;
  111. for (cmsg = CMSG_FIRSTHDR(msg); cmsg; cmsg = CMSG_NXTHDR(msg, cmsg))
  112. {
  113. err = -EINVAL;
  114. /* Verify that cmsg_len is at least sizeof(struct cmsghdr) */
  115. /* The first check was omitted in <= 2.2.5. The reasoning was
  116. that parser checks cmsg_len in any case, so that
  117. additional check would be work duplication.
  118. But if cmsg_level is not SOL_SOCKET, we do not check
  119. for too short ancillary data object at all! Oops.
  120. OK, let's add it...
  121. */
  122. if (!CMSG_OK(msg, cmsg))
  123. goto error;
  124. if (cmsg->cmsg_level != SOL_SOCKET)
  125. continue;
  126. switch (cmsg->cmsg_type)
  127. {
  128. case SCM_RIGHTS:
  129. if (!sock->ops || sock->ops->family != PF_UNIX)
  130. goto error;
  131. err=scm_fp_copy(cmsg, &p->fp);
  132. if (err<0)
  133. goto error;
  134. break;
  135. case SCM_CREDENTIALS:
  136. {
  137. struct ucred creds;
  138. kuid_t uid;
  139. kgid_t gid;
  140. if (cmsg->cmsg_len != CMSG_LEN(sizeof(struct ucred)))
  141. goto error;
  142. memcpy(&creds, CMSG_DATA(cmsg), sizeof(struct ucred));
  143. err = scm_check_creds(&creds);
  144. if (err)
  145. goto error;
  146. p->creds.pid = creds.pid;
  147. if (!p->pid || pid_vnr(p->pid) != creds.pid) {
  148. struct pid *pid;
  149. err = -ESRCH;
  150. pid = find_get_pid(creds.pid);
  151. if (!pid)
  152. goto error;
  153. put_pid(p->pid);
  154. p->pid = pid;
  155. }
  156. err = -EINVAL;
  157. uid = make_kuid(current_user_ns(), creds.uid);
  158. gid = make_kgid(current_user_ns(), creds.gid);
  159. if (!uid_valid(uid) || !gid_valid(gid))
  160. goto error;
  161. p->creds.uid = uid;
  162. p->creds.gid = gid;
  163. break;
  164. }
  165. default:
  166. goto error;
  167. }
  168. }
  169. if (p->fp && !p->fp->count)
  170. {
  171. kfree(p->fp);
  172. p->fp = NULL;
  173. }
  174. return 0;
  175. error:
  176. scm_destroy(p);
  177. return err;
  178. }
  179. EXPORT_SYMBOL(__scm_send);
  180. int put_cmsg(struct msghdr * msg, int level, int type, int len, void *data)
  181. {
  182. struct cmsghdr __user *cm
  183. = (__force struct cmsghdr __user *)msg->msg_control;
  184. struct cmsghdr cmhdr;
  185. int cmlen = CMSG_LEN(len);
  186. int err;
  187. if (MSG_CMSG_COMPAT & msg->msg_flags)
  188. return put_cmsg_compat(msg, level, type, len, data);
  189. if (cm==NULL || msg->msg_controllen < sizeof(*cm)) {
  190. msg->msg_flags |= MSG_CTRUNC;
  191. return 0; /* XXX: return error? check spec. */
  192. }
  193. if (msg->msg_controllen < cmlen) {
  194. msg->msg_flags |= MSG_CTRUNC;
  195. cmlen = msg->msg_controllen;
  196. }
  197. cmhdr.cmsg_level = level;
  198. cmhdr.cmsg_type = type;
  199. cmhdr.cmsg_len = cmlen;
  200. err = -EFAULT;
  201. if (copy_to_user(cm, &cmhdr, sizeof cmhdr))
  202. goto out;
  203. if (copy_to_user(CMSG_DATA(cm), data, cmlen - sizeof(struct cmsghdr)))
  204. goto out;
  205. cmlen = CMSG_SPACE(len);
  206. if (msg->msg_controllen < cmlen)
  207. cmlen = msg->msg_controllen;
  208. msg->msg_control += cmlen;
  209. msg->msg_controllen -= cmlen;
  210. err = 0;
  211. out:
  212. return err;
  213. }
  214. EXPORT_SYMBOL(put_cmsg);
  215. void scm_detach_fds(struct msghdr *msg, struct scm_cookie *scm)
  216. {
  217. struct cmsghdr __user *cm
  218. = (__force struct cmsghdr __user*)msg->msg_control;
  219. int fdmax = 0;
  220. int fdnum = scm->fp->count;
  221. struct file **fp = scm->fp->fp;
  222. int __user *cmfptr;
  223. int err = 0, i;
  224. if (MSG_CMSG_COMPAT & msg->msg_flags) {
  225. scm_detach_fds_compat(msg, scm);
  226. return;
  227. }
  228. if (msg->msg_controllen > sizeof(struct cmsghdr))
  229. fdmax = ((msg->msg_controllen - sizeof(struct cmsghdr))
  230. / sizeof(int));
  231. if (fdnum < fdmax)
  232. fdmax = fdnum;
  233. for (i=0, cmfptr=(__force int __user *)CMSG_DATA(cm); i<fdmax;
  234. i++, cmfptr++)
  235. {
  236. struct socket *sock;
  237. int new_fd;
  238. err = security_file_receive(fp[i]);
  239. if (err)
  240. break;
  241. err = get_unused_fd_flags(MSG_CMSG_CLOEXEC & msg->msg_flags
  242. ? O_CLOEXEC : 0);
  243. if (err < 0)
  244. break;
  245. new_fd = err;
  246. err = put_user(new_fd, cmfptr);
  247. if (err) {
  248. put_unused_fd(new_fd);
  249. break;
  250. }
  251. /* Bump the usage count and install the file. */
  252. sock = sock_from_file(fp[i], &err);
  253. if (sock) {
  254. sock_update_netprioidx(sock->sk, current);
  255. sock_update_classid(sock->sk);
  256. }
  257. fd_install(new_fd, get_file(fp[i]));
  258. }
  259. if (i > 0)
  260. {
  261. int cmlen = CMSG_LEN(i*sizeof(int));
  262. err = put_user(SOL_SOCKET, &cm->cmsg_level);
  263. if (!err)
  264. err = put_user(SCM_RIGHTS, &cm->cmsg_type);
  265. if (!err)
  266. err = put_user(cmlen, &cm->cmsg_len);
  267. if (!err) {
  268. cmlen = CMSG_SPACE(i*sizeof(int));
  269. msg->msg_control += cmlen;
  270. msg->msg_controllen -= cmlen;
  271. }
  272. }
  273. if (i < fdnum || (fdnum && fdmax <= 0))
  274. msg->msg_flags |= MSG_CTRUNC;
  275. /*
  276. * All of the files that fit in the message have had their
  277. * usage counts incremented, so we just free the list.
  278. */
  279. __scm_destroy(scm);
  280. }
  281. EXPORT_SYMBOL(scm_detach_fds);
  282. struct scm_fp_list *scm_fp_dup(struct scm_fp_list *fpl)
  283. {
  284. struct scm_fp_list *new_fpl;
  285. int i;
  286. if (!fpl)
  287. return NULL;
  288. new_fpl = kmemdup(fpl, offsetof(struct scm_fp_list, fp[fpl->count]),
  289. GFP_KERNEL);
  290. if (new_fpl) {
  291. for (i = 0; i < fpl->count; i++)
  292. get_file(fpl->fp[i]);
  293. new_fpl->max = new_fpl->count;
  294. }
  295. return new_fpl;
  296. }
  297. EXPORT_SYMBOL(scm_fp_dup);