scm.c 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319
  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. int __scm_send(struct socket *sock, struct msghdr *msg, struct scm_cookie *p)
  112. {
  113. struct cmsghdr *cmsg;
  114. int err;
  115. for (cmsg = CMSG_FIRSTHDR(msg); cmsg; cmsg = CMSG_NXTHDR(msg, cmsg))
  116. {
  117. err = -EINVAL;
  118. /* Verify that cmsg_len is at least sizeof(struct cmsghdr) */
  119. /* The first check was omitted in <= 2.2.5. The reasoning was
  120. that parser checks cmsg_len in any case, so that
  121. additional check would be work duplication.
  122. But if cmsg_level is not SOL_SOCKET, we do not check
  123. for too short ancillary data object at all! Oops.
  124. OK, let's add it...
  125. */
  126. if (!CMSG_OK(msg, cmsg))
  127. goto error;
  128. if (cmsg->cmsg_level != SOL_SOCKET)
  129. continue;
  130. switch (cmsg->cmsg_type)
  131. {
  132. case SCM_RIGHTS:
  133. if (!sock->ops || sock->ops->family != PF_UNIX)
  134. goto error;
  135. err=scm_fp_copy(cmsg, &p->fp);
  136. if (err<0)
  137. goto error;
  138. break;
  139. case SCM_CREDENTIALS:
  140. if (cmsg->cmsg_len != CMSG_LEN(sizeof(struct ucred)))
  141. goto error;
  142. memcpy(&p->creds, CMSG_DATA(cmsg), sizeof(struct ucred));
  143. err = scm_check_creds(&p->creds);
  144. if (err)
  145. goto error;
  146. break;
  147. default:
  148. goto error;
  149. }
  150. }
  151. if (p->fp && !p->fp->count)
  152. {
  153. kfree(p->fp);
  154. p->fp = NULL;
  155. }
  156. return 0;
  157. error:
  158. scm_destroy(p);
  159. return err;
  160. }
  161. int put_cmsg(struct msghdr * msg, int level, int type, int len, void *data)
  162. {
  163. struct cmsghdr __user *cm
  164. = (__force struct cmsghdr __user *)msg->msg_control;
  165. struct cmsghdr cmhdr;
  166. int cmlen = CMSG_LEN(len);
  167. int err;
  168. if (MSG_CMSG_COMPAT & msg->msg_flags)
  169. return put_cmsg_compat(msg, level, type, len, data);
  170. if (cm==NULL || msg->msg_controllen < sizeof(*cm)) {
  171. msg->msg_flags |= MSG_CTRUNC;
  172. return 0; /* XXX: return error? check spec. */
  173. }
  174. if (msg->msg_controllen < cmlen) {
  175. msg->msg_flags |= MSG_CTRUNC;
  176. cmlen = msg->msg_controllen;
  177. }
  178. cmhdr.cmsg_level = level;
  179. cmhdr.cmsg_type = type;
  180. cmhdr.cmsg_len = cmlen;
  181. err = -EFAULT;
  182. if (copy_to_user(cm, &cmhdr, sizeof cmhdr))
  183. goto out;
  184. if (copy_to_user(CMSG_DATA(cm), data, cmlen - sizeof(struct cmsghdr)))
  185. goto out;
  186. cmlen = CMSG_SPACE(len);
  187. if (msg->msg_controllen < cmlen)
  188. cmlen = msg->msg_controllen;
  189. msg->msg_control += cmlen;
  190. msg->msg_controllen -= cmlen;
  191. err = 0;
  192. out:
  193. return err;
  194. }
  195. void scm_detach_fds(struct msghdr *msg, struct scm_cookie *scm)
  196. {
  197. struct cmsghdr __user *cm
  198. = (__force struct cmsghdr __user*)msg->msg_control;
  199. int fdmax = 0;
  200. int fdnum = scm->fp->count;
  201. struct file **fp = scm->fp->fp;
  202. int __user *cmfptr;
  203. int err = 0, i;
  204. if (MSG_CMSG_COMPAT & msg->msg_flags) {
  205. scm_detach_fds_compat(msg, scm);
  206. return;
  207. }
  208. if (msg->msg_controllen > sizeof(struct cmsghdr))
  209. fdmax = ((msg->msg_controllen - sizeof(struct cmsghdr))
  210. / sizeof(int));
  211. if (fdnum < fdmax)
  212. fdmax = fdnum;
  213. for (i=0, cmfptr=(__force int __user *)CMSG_DATA(cm); i<fdmax;
  214. i++, cmfptr++)
  215. {
  216. int new_fd;
  217. err = security_file_receive(fp[i]);
  218. if (err)
  219. break;
  220. err = get_unused_fd_flags(MSG_CMSG_CLOEXEC & msg->msg_flags
  221. ? O_CLOEXEC : 0);
  222. if (err < 0)
  223. break;
  224. new_fd = err;
  225. err = put_user(new_fd, cmfptr);
  226. if (err) {
  227. put_unused_fd(new_fd);
  228. break;
  229. }
  230. /* Bump the usage count and install the file. */
  231. get_file(fp[i]);
  232. fd_install(new_fd, fp[i]);
  233. }
  234. if (i > 0)
  235. {
  236. int cmlen = CMSG_LEN(i*sizeof(int));
  237. err = put_user(SOL_SOCKET, &cm->cmsg_level);
  238. if (!err)
  239. err = put_user(SCM_RIGHTS, &cm->cmsg_type);
  240. if (!err)
  241. err = put_user(cmlen, &cm->cmsg_len);
  242. if (!err) {
  243. cmlen = CMSG_SPACE(i*sizeof(int));
  244. msg->msg_control += cmlen;
  245. msg->msg_controllen -= cmlen;
  246. }
  247. }
  248. if (i < fdnum || (fdnum && fdmax <= 0))
  249. msg->msg_flags |= MSG_CTRUNC;
  250. /*
  251. * All of the files that fit in the message have had their
  252. * usage counts incremented, so we just free the list.
  253. */
  254. __scm_destroy(scm);
  255. }
  256. struct scm_fp_list *scm_fp_dup(struct scm_fp_list *fpl)
  257. {
  258. struct scm_fp_list *new_fpl;
  259. int i;
  260. if (!fpl)
  261. return NULL;
  262. new_fpl = kmalloc(sizeof(*fpl), GFP_KERNEL);
  263. if (new_fpl) {
  264. for (i=fpl->count-1; i>=0; i--)
  265. get_file(fpl->fp[i]);
  266. memcpy(new_fpl, fpl, sizeof(*fpl));
  267. }
  268. return new_fpl;
  269. }
  270. EXPORT_SYMBOL(__scm_destroy);
  271. EXPORT_SYMBOL(__scm_send);
  272. EXPORT_SYMBOL(put_cmsg);
  273. EXPORT_SYMBOL(scm_detach_fds);
  274. EXPORT_SYMBOL(scm_fp_dup);