scm.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342
  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.h>
  27. #include <linux/nsproxy.h>
  28. #include <linux/slab.h>
  29. #include <asm/system.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. /*
  37. * Only allow a user to send credentials, that they could set with
  38. * setu(g)id.
  39. */
  40. static __inline__ int scm_check_creds(struct ucred *creds)
  41. {
  42. const struct cred *cred = current_cred();
  43. if ((creds->pid == task_tgid_vnr(current) || capable(CAP_SYS_ADMIN)) &&
  44. ((creds->uid == cred->uid || creds->uid == cred->euid ||
  45. creds->uid == cred->suid) || capable(CAP_SETUID)) &&
  46. ((creds->gid == cred->gid || creds->gid == cred->egid ||
  47. creds->gid == cred->sgid) || capable(CAP_SETGID))) {
  48. return 0;
  49. }
  50. return -EPERM;
  51. }
  52. static int scm_fp_copy(struct cmsghdr *cmsg, struct scm_fp_list **fplp)
  53. {
  54. int *fdp = (int*)CMSG_DATA(cmsg);
  55. struct scm_fp_list *fpl = *fplp;
  56. struct file **fpp;
  57. int i, num;
  58. num = (cmsg->cmsg_len - CMSG_ALIGN(sizeof(struct cmsghdr)))/sizeof(int);
  59. if (num <= 0)
  60. return 0;
  61. if (num > SCM_MAX_FD)
  62. return -EINVAL;
  63. if (!fpl)
  64. {
  65. fpl = kmalloc(sizeof(struct scm_fp_list), GFP_KERNEL);
  66. if (!fpl)
  67. return -ENOMEM;
  68. *fplp = fpl;
  69. fpl->count = 0;
  70. }
  71. fpp = &fpl->fp[fpl->count];
  72. if (fpl->count + num > SCM_MAX_FD)
  73. return -EINVAL;
  74. /*
  75. * Verify the descriptors and increment the usage count.
  76. */
  77. for (i=0; i< num; i++)
  78. {
  79. int fd = fdp[i];
  80. struct file *file;
  81. if (fd < 0 || !(file = fget(fd)))
  82. return -EBADF;
  83. *fpp++ = file;
  84. fpl->count++;
  85. }
  86. return num;
  87. }
  88. void __scm_destroy(struct scm_cookie *scm)
  89. {
  90. struct scm_fp_list *fpl = scm->fp;
  91. int i;
  92. if (fpl) {
  93. scm->fp = NULL;
  94. if (current->scm_work_list) {
  95. list_add_tail(&fpl->list, current->scm_work_list);
  96. } else {
  97. LIST_HEAD(work_list);
  98. current->scm_work_list = &work_list;
  99. list_add(&fpl->list, &work_list);
  100. while (!list_empty(&work_list)) {
  101. fpl = list_first_entry(&work_list, struct scm_fp_list, list);
  102. list_del(&fpl->list);
  103. for (i=fpl->count-1; i>=0; i--)
  104. fput(fpl->fp[i]);
  105. kfree(fpl);
  106. }
  107. current->scm_work_list = NULL;
  108. }
  109. }
  110. }
  111. EXPORT_SYMBOL(__scm_destroy);
  112. int __scm_send(struct socket *sock, struct msghdr *msg, struct scm_cookie *p)
  113. {
  114. struct cmsghdr *cmsg;
  115. int err;
  116. for (cmsg = CMSG_FIRSTHDR(msg); cmsg; cmsg = CMSG_NXTHDR(msg, cmsg))
  117. {
  118. err = -EINVAL;
  119. /* Verify that cmsg_len is at least sizeof(struct cmsghdr) */
  120. /* The first check was omitted in <= 2.2.5. The reasoning was
  121. that parser checks cmsg_len in any case, so that
  122. additional check would be work duplication.
  123. But if cmsg_level is not SOL_SOCKET, we do not check
  124. for too short ancillary data object at all! Oops.
  125. OK, let's add it...
  126. */
  127. if (!CMSG_OK(msg, cmsg))
  128. goto error;
  129. if (cmsg->cmsg_level != SOL_SOCKET)
  130. continue;
  131. switch (cmsg->cmsg_type)
  132. {
  133. case SCM_RIGHTS:
  134. if (!sock->ops || sock->ops->family != PF_UNIX)
  135. goto error;
  136. err=scm_fp_copy(cmsg, &p->fp);
  137. if (err<0)
  138. goto error;
  139. break;
  140. case SCM_CREDENTIALS:
  141. if (cmsg->cmsg_len != CMSG_LEN(sizeof(struct ucred)))
  142. goto error;
  143. memcpy(&p->creds, CMSG_DATA(cmsg), sizeof(struct ucred));
  144. err = scm_check_creds(&p->creds);
  145. if (err)
  146. goto error;
  147. if (pid_vnr(p->pid) != p->creds.pid) {
  148. struct pid *pid;
  149. err = -ESRCH;
  150. pid = find_get_pid(p->creds.pid);
  151. if (!pid)
  152. goto error;
  153. put_pid(p->pid);
  154. p->pid = pid;
  155. }
  156. if ((p->cred->euid != p->creds.uid) ||
  157. (p->cred->egid != p->creds.gid)) {
  158. struct cred *cred;
  159. err = -ENOMEM;
  160. cred = prepare_creds();
  161. if (!cred)
  162. goto error;
  163. cred->uid = cred->euid = p->creds.uid;
  164. cred->gid = cred->egid = p->creds.uid;
  165. put_cred(p->cred);
  166. p->cred = cred;
  167. }
  168. break;
  169. default:
  170. goto error;
  171. }
  172. }
  173. if (p->fp && !p->fp->count)
  174. {
  175. kfree(p->fp);
  176. p->fp = NULL;
  177. }
  178. return 0;
  179. error:
  180. scm_destroy(p);
  181. return err;
  182. }
  183. EXPORT_SYMBOL(__scm_send);
  184. int put_cmsg(struct msghdr * msg, int level, int type, int len, void *data)
  185. {
  186. struct cmsghdr __user *cm
  187. = (__force struct cmsghdr __user *)msg->msg_control;
  188. struct cmsghdr cmhdr;
  189. int cmlen = CMSG_LEN(len);
  190. int err;
  191. if (MSG_CMSG_COMPAT & msg->msg_flags)
  192. return put_cmsg_compat(msg, level, type, len, data);
  193. if (cm==NULL || msg->msg_controllen < sizeof(*cm)) {
  194. msg->msg_flags |= MSG_CTRUNC;
  195. return 0; /* XXX: return error? check spec. */
  196. }
  197. if (msg->msg_controllen < cmlen) {
  198. msg->msg_flags |= MSG_CTRUNC;
  199. cmlen = msg->msg_controllen;
  200. }
  201. cmhdr.cmsg_level = level;
  202. cmhdr.cmsg_type = type;
  203. cmhdr.cmsg_len = cmlen;
  204. err = -EFAULT;
  205. if (copy_to_user(cm, &cmhdr, sizeof cmhdr))
  206. goto out;
  207. if (copy_to_user(CMSG_DATA(cm), data, cmlen - sizeof(struct cmsghdr)))
  208. goto out;
  209. cmlen = CMSG_SPACE(len);
  210. if (msg->msg_controllen < cmlen)
  211. cmlen = msg->msg_controllen;
  212. msg->msg_control += cmlen;
  213. msg->msg_controllen -= cmlen;
  214. err = 0;
  215. out:
  216. return err;
  217. }
  218. EXPORT_SYMBOL(put_cmsg);
  219. void scm_detach_fds(struct msghdr *msg, struct scm_cookie *scm)
  220. {
  221. struct cmsghdr __user *cm
  222. = (__force struct cmsghdr __user*)msg->msg_control;
  223. int fdmax = 0;
  224. int fdnum = scm->fp->count;
  225. struct file **fp = scm->fp->fp;
  226. int __user *cmfptr;
  227. int err = 0, i;
  228. if (MSG_CMSG_COMPAT & msg->msg_flags) {
  229. scm_detach_fds_compat(msg, scm);
  230. return;
  231. }
  232. if (msg->msg_controllen > sizeof(struct cmsghdr))
  233. fdmax = ((msg->msg_controllen - sizeof(struct cmsghdr))
  234. / sizeof(int));
  235. if (fdnum < fdmax)
  236. fdmax = fdnum;
  237. for (i=0, cmfptr=(__force int __user *)CMSG_DATA(cm); i<fdmax;
  238. i++, cmfptr++)
  239. {
  240. int new_fd;
  241. err = security_file_receive(fp[i]);
  242. if (err)
  243. break;
  244. err = get_unused_fd_flags(MSG_CMSG_CLOEXEC & msg->msg_flags
  245. ? O_CLOEXEC : 0);
  246. if (err < 0)
  247. break;
  248. new_fd = err;
  249. err = put_user(new_fd, cmfptr);
  250. if (err) {
  251. put_unused_fd(new_fd);
  252. break;
  253. }
  254. /* Bump the usage count and install the file. */
  255. get_file(fp[i]);
  256. fd_install(new_fd, fp[i]);
  257. }
  258. if (i > 0)
  259. {
  260. int cmlen = CMSG_LEN(i*sizeof(int));
  261. err = put_user(SOL_SOCKET, &cm->cmsg_level);
  262. if (!err)
  263. err = put_user(SCM_RIGHTS, &cm->cmsg_type);
  264. if (!err)
  265. err = put_user(cmlen, &cm->cmsg_len);
  266. if (!err) {
  267. cmlen = CMSG_SPACE(i*sizeof(int));
  268. msg->msg_control += cmlen;
  269. msg->msg_controllen -= cmlen;
  270. }
  271. }
  272. if (i < fdnum || (fdnum && fdmax <= 0))
  273. msg->msg_flags |= MSG_CTRUNC;
  274. /*
  275. * All of the files that fit in the message have had their
  276. * usage counts incremented, so we just free the list.
  277. */
  278. __scm_destroy(scm);
  279. }
  280. EXPORT_SYMBOL(scm_detach_fds);
  281. struct scm_fp_list *scm_fp_dup(struct scm_fp_list *fpl)
  282. {
  283. struct scm_fp_list *new_fpl;
  284. int i;
  285. if (!fpl)
  286. return NULL;
  287. new_fpl = kmalloc(sizeof(*fpl), GFP_KERNEL);
  288. if (new_fpl) {
  289. for (i=fpl->count-1; i>=0; i--)
  290. get_file(fpl->fp[i]);
  291. memcpy(new_fpl, fpl, sizeof(*fpl));
  292. }
  293. return new_fpl;
  294. }
  295. EXPORT_SYMBOL(scm_fp_dup);