b.liu | e958203 | 2025-04-17 19:18:16 +0800 | [diff] [blame^] | 1 | // SPDX-License-Identifier: GPL-2.0-or-later |
| 2 | /* scm.c - Socket level control messages processing. |
| 3 | * |
| 4 | * Author: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru> |
| 5 | * Alignment and value checking mods by Craig Metz |
| 6 | */ |
| 7 | |
| 8 | #include <linux/module.h> |
| 9 | #include <linux/signal.h> |
| 10 | #include <linux/capability.h> |
| 11 | #include <linux/errno.h> |
| 12 | #include <linux/sched.h> |
| 13 | #include <linux/sched/user.h> |
| 14 | #include <linux/mm.h> |
| 15 | #include <linux/kernel.h> |
| 16 | #include <linux/stat.h> |
| 17 | #include <linux/socket.h> |
| 18 | #include <linux/file.h> |
| 19 | #include <linux/fcntl.h> |
| 20 | #include <linux/net.h> |
| 21 | #include <linux/interrupt.h> |
| 22 | #include <linux/netdevice.h> |
| 23 | #include <linux/security.h> |
| 24 | #include <linux/pid_namespace.h> |
| 25 | #include <linux/pid.h> |
| 26 | #include <linux/nsproxy.h> |
| 27 | #include <linux/slab.h> |
| 28 | #include <linux/errqueue.h> |
| 29 | #include <linux/io_uring.h> |
| 30 | |
| 31 | #include <linux/uaccess.h> |
| 32 | |
| 33 | #include <net/protocol.h> |
| 34 | #include <linux/skbuff.h> |
| 35 | #include <net/sock.h> |
| 36 | #include <net/compat.h> |
| 37 | #include <net/scm.h> |
| 38 | #include <net/cls_cgroup.h> |
| 39 | |
| 40 | |
| 41 | /* |
| 42 | * Only allow a user to send credentials, that they could set with |
| 43 | * setu(g)id. |
| 44 | */ |
| 45 | |
| 46 | static __inline__ int scm_check_creds(struct ucred *creds) |
| 47 | { |
| 48 | const struct cred *cred = current_cred(); |
| 49 | kuid_t uid = make_kuid(cred->user_ns, creds->uid); |
| 50 | kgid_t gid = make_kgid(cred->user_ns, creds->gid); |
| 51 | |
| 52 | if (!uid_valid(uid) || !gid_valid(gid)) |
| 53 | return -EINVAL; |
| 54 | |
| 55 | if ((creds->pid == task_tgid_vnr(current) || |
| 56 | ns_capable(task_active_pid_ns(current)->user_ns, CAP_SYS_ADMIN)) && |
| 57 | ((uid_eq(uid, cred->uid) || uid_eq(uid, cred->euid) || |
| 58 | uid_eq(uid, cred->suid)) || ns_capable(cred->user_ns, CAP_SETUID)) && |
| 59 | ((gid_eq(gid, cred->gid) || gid_eq(gid, cred->egid) || |
| 60 | gid_eq(gid, cred->sgid)) || ns_capable(cred->user_ns, CAP_SETGID))) { |
| 61 | return 0; |
| 62 | } |
| 63 | return -EPERM; |
| 64 | } |
| 65 | |
| 66 | static int scm_fp_copy(struct cmsghdr *cmsg, struct scm_fp_list **fplp) |
| 67 | { |
| 68 | int *fdp = (int*)CMSG_DATA(cmsg); |
| 69 | struct scm_fp_list *fpl = *fplp; |
| 70 | struct file **fpp; |
| 71 | int i, num; |
| 72 | |
| 73 | num = (cmsg->cmsg_len - sizeof(struct cmsghdr))/sizeof(int); |
| 74 | |
| 75 | if (num <= 0) |
| 76 | return 0; |
| 77 | |
| 78 | if (num > SCM_MAX_FD) |
| 79 | return -EINVAL; |
| 80 | |
| 81 | if (!fpl) |
| 82 | { |
| 83 | fpl = kmalloc(sizeof(struct scm_fp_list), GFP_KERNEL); |
| 84 | if (!fpl) |
| 85 | return -ENOMEM; |
| 86 | *fplp = fpl; |
| 87 | fpl->count = 0; |
| 88 | fpl->max = SCM_MAX_FD; |
| 89 | fpl->user = NULL; |
| 90 | } |
| 91 | fpp = &fpl->fp[fpl->count]; |
| 92 | |
| 93 | if (fpl->count + num > fpl->max) |
| 94 | return -EINVAL; |
| 95 | |
| 96 | /* |
| 97 | * Verify the descriptors and increment the usage count. |
| 98 | */ |
| 99 | |
| 100 | for (i=0; i< num; i++) |
| 101 | { |
| 102 | int fd = fdp[i]; |
| 103 | struct file *file; |
| 104 | |
| 105 | if (fd < 0 || !(file = fget_raw(fd))) |
| 106 | return -EBADF; |
| 107 | /* don't allow io_uring files */ |
| 108 | if (io_is_uring_fops(file)) { |
| 109 | fput(file); |
| 110 | return -EINVAL; |
| 111 | } |
| 112 | *fpp++ = file; |
| 113 | fpl->count++; |
| 114 | } |
| 115 | |
| 116 | if (!fpl->user) |
| 117 | fpl->user = get_uid(current_user()); |
| 118 | |
| 119 | return num; |
| 120 | } |
| 121 | |
| 122 | void __scm_destroy(struct scm_cookie *scm) |
| 123 | { |
| 124 | struct scm_fp_list *fpl = scm->fp; |
| 125 | int i; |
| 126 | |
| 127 | if (fpl) { |
| 128 | scm->fp = NULL; |
| 129 | for (i=fpl->count-1; i>=0; i--) |
| 130 | fput(fpl->fp[i]); |
| 131 | free_uid(fpl->user); |
| 132 | kfree(fpl); |
| 133 | } |
| 134 | } |
| 135 | EXPORT_SYMBOL(__scm_destroy); |
| 136 | |
| 137 | int __scm_send(struct socket *sock, struct msghdr *msg, struct scm_cookie *p) |
| 138 | { |
| 139 | struct cmsghdr *cmsg; |
| 140 | int err; |
| 141 | |
| 142 | for_each_cmsghdr(cmsg, msg) { |
| 143 | err = -EINVAL; |
| 144 | |
| 145 | /* Verify that cmsg_len is at least sizeof(struct cmsghdr) */ |
| 146 | /* The first check was omitted in <= 2.2.5. The reasoning was |
| 147 | that parser checks cmsg_len in any case, so that |
| 148 | additional check would be work duplication. |
| 149 | But if cmsg_level is not SOL_SOCKET, we do not check |
| 150 | for too short ancillary data object at all! Oops. |
| 151 | OK, let's add it... |
| 152 | */ |
| 153 | if (!CMSG_OK(msg, cmsg)) |
| 154 | goto error; |
| 155 | |
| 156 | if (cmsg->cmsg_level != SOL_SOCKET) |
| 157 | continue; |
| 158 | |
| 159 | switch (cmsg->cmsg_type) |
| 160 | { |
| 161 | case SCM_RIGHTS: |
| 162 | if (!sock->ops || sock->ops->family != PF_UNIX) |
| 163 | goto error; |
| 164 | err=scm_fp_copy(cmsg, &p->fp); |
| 165 | if (err<0) |
| 166 | goto error; |
| 167 | break; |
| 168 | case SCM_CREDENTIALS: |
| 169 | { |
| 170 | struct ucred creds; |
| 171 | kuid_t uid; |
| 172 | kgid_t gid; |
| 173 | if (cmsg->cmsg_len != CMSG_LEN(sizeof(struct ucred))) |
| 174 | goto error; |
| 175 | memcpy(&creds, CMSG_DATA(cmsg), sizeof(struct ucred)); |
| 176 | err = scm_check_creds(&creds); |
| 177 | if (err) |
| 178 | goto error; |
| 179 | |
| 180 | p->creds.pid = creds.pid; |
| 181 | if (!p->pid || pid_vnr(p->pid) != creds.pid) { |
| 182 | struct pid *pid; |
| 183 | err = -ESRCH; |
| 184 | pid = find_get_pid(creds.pid); |
| 185 | if (!pid) |
| 186 | goto error; |
| 187 | put_pid(p->pid); |
| 188 | p->pid = pid; |
| 189 | } |
| 190 | |
| 191 | err = -EINVAL; |
| 192 | uid = make_kuid(current_user_ns(), creds.uid); |
| 193 | gid = make_kgid(current_user_ns(), creds.gid); |
| 194 | if (!uid_valid(uid) || !gid_valid(gid)) |
| 195 | goto error; |
| 196 | |
| 197 | p->creds.uid = uid; |
| 198 | p->creds.gid = gid; |
| 199 | break; |
| 200 | } |
| 201 | default: |
| 202 | goto error; |
| 203 | } |
| 204 | } |
| 205 | |
| 206 | if (p->fp && !p->fp->count) |
| 207 | { |
| 208 | kfree(p->fp); |
| 209 | p->fp = NULL; |
| 210 | } |
| 211 | return 0; |
| 212 | |
| 213 | error: |
| 214 | scm_destroy(p); |
| 215 | return err; |
| 216 | } |
| 217 | EXPORT_SYMBOL(__scm_send); |
| 218 | |
| 219 | int put_cmsg(struct msghdr * msg, int level, int type, int len, void *data) |
| 220 | { |
| 221 | struct cmsghdr __user *cm |
| 222 | = (__force struct cmsghdr __user *)msg->msg_control; |
| 223 | struct cmsghdr cmhdr; |
| 224 | int cmlen = CMSG_LEN(len); |
| 225 | int err; |
| 226 | |
| 227 | if (MSG_CMSG_COMPAT & msg->msg_flags) |
| 228 | return put_cmsg_compat(msg, level, type, len, data); |
| 229 | |
| 230 | if (cm==NULL || msg->msg_controllen < sizeof(*cm)) { |
| 231 | msg->msg_flags |= MSG_CTRUNC; |
| 232 | return 0; /* XXX: return error? check spec. */ |
| 233 | } |
| 234 | if (msg->msg_controllen < cmlen) { |
| 235 | msg->msg_flags |= MSG_CTRUNC; |
| 236 | cmlen = msg->msg_controllen; |
| 237 | } |
| 238 | cmhdr.cmsg_level = level; |
| 239 | cmhdr.cmsg_type = type; |
| 240 | cmhdr.cmsg_len = cmlen; |
| 241 | |
| 242 | err = -EFAULT; |
| 243 | if (copy_to_user(cm, &cmhdr, sizeof cmhdr)) |
| 244 | goto out; |
| 245 | if (copy_to_user(CMSG_DATA(cm), data, cmlen - sizeof(struct cmsghdr))) |
| 246 | goto out; |
| 247 | cmlen = CMSG_SPACE(len); |
| 248 | if (msg->msg_controllen < cmlen) |
| 249 | cmlen = msg->msg_controllen; |
| 250 | msg->msg_control += cmlen; |
| 251 | msg->msg_controllen -= cmlen; |
| 252 | err = 0; |
| 253 | out: |
| 254 | return err; |
| 255 | } |
| 256 | EXPORT_SYMBOL(put_cmsg); |
| 257 | |
| 258 | void put_cmsg_scm_timestamping64(struct msghdr *msg, struct scm_timestamping_internal *tss_internal) |
| 259 | { |
| 260 | struct scm_timestamping64 tss; |
| 261 | int i; |
| 262 | |
| 263 | for (i = 0; i < ARRAY_SIZE(tss.ts); i++) { |
| 264 | tss.ts[i].tv_sec = tss_internal->ts[i].tv_sec; |
| 265 | tss.ts[i].tv_nsec = tss_internal->ts[i].tv_nsec; |
| 266 | } |
| 267 | |
| 268 | put_cmsg(msg, SOL_SOCKET, SO_TIMESTAMPING_NEW, sizeof(tss), &tss); |
| 269 | } |
| 270 | EXPORT_SYMBOL(put_cmsg_scm_timestamping64); |
| 271 | |
| 272 | void put_cmsg_scm_timestamping(struct msghdr *msg, struct scm_timestamping_internal *tss_internal) |
| 273 | { |
| 274 | struct scm_timestamping tss; |
| 275 | int i; |
| 276 | |
| 277 | for (i = 0; i < ARRAY_SIZE(tss.ts); i++) { |
| 278 | tss.ts[i].tv_sec = tss_internal->ts[i].tv_sec; |
| 279 | tss.ts[i].tv_nsec = tss_internal->ts[i].tv_nsec; |
| 280 | } |
| 281 | |
| 282 | put_cmsg(msg, SOL_SOCKET, SO_TIMESTAMPING_OLD, sizeof(tss), &tss); |
| 283 | } |
| 284 | EXPORT_SYMBOL(put_cmsg_scm_timestamping); |
| 285 | |
| 286 | void scm_detach_fds(struct msghdr *msg, struct scm_cookie *scm) |
| 287 | { |
| 288 | struct cmsghdr __user *cm |
| 289 | = (__force struct cmsghdr __user*)msg->msg_control; |
| 290 | |
| 291 | int fdmax = 0; |
| 292 | int fdnum = scm->fp->count; |
| 293 | struct file **fp = scm->fp->fp; |
| 294 | int __user *cmfptr; |
| 295 | int err = 0, i; |
| 296 | |
| 297 | if (MSG_CMSG_COMPAT & msg->msg_flags) { |
| 298 | scm_detach_fds_compat(msg, scm); |
| 299 | return; |
| 300 | } |
| 301 | |
| 302 | if (msg->msg_controllen > sizeof(struct cmsghdr)) |
| 303 | fdmax = ((msg->msg_controllen - sizeof(struct cmsghdr)) |
| 304 | / sizeof(int)); |
| 305 | |
| 306 | if (fdnum < fdmax) |
| 307 | fdmax = fdnum; |
| 308 | |
| 309 | for (i=0, cmfptr=(__force int __user *)CMSG_DATA(cm); i<fdmax; |
| 310 | i++, cmfptr++) |
| 311 | { |
| 312 | struct socket *sock; |
| 313 | int new_fd; |
| 314 | err = security_file_receive(fp[i]); |
| 315 | if (err) |
| 316 | break; |
| 317 | err = get_unused_fd_flags(MSG_CMSG_CLOEXEC & msg->msg_flags |
| 318 | ? O_CLOEXEC : 0); |
| 319 | if (err < 0) |
| 320 | break; |
| 321 | new_fd = err; |
| 322 | err = put_user(new_fd, cmfptr); |
| 323 | if (err) { |
| 324 | put_unused_fd(new_fd); |
| 325 | break; |
| 326 | } |
| 327 | /* Bump the usage count and install the file. */ |
| 328 | sock = sock_from_file(fp[i], &err); |
| 329 | if (sock) { |
| 330 | sock_update_netprioidx(&sock->sk->sk_cgrp_data); |
| 331 | sock_update_classid(&sock->sk->sk_cgrp_data); |
| 332 | } |
| 333 | fd_install(new_fd, get_file(fp[i])); |
| 334 | } |
| 335 | |
| 336 | if (i > 0) |
| 337 | { |
| 338 | int cmlen = CMSG_LEN(i*sizeof(int)); |
| 339 | err = put_user(SOL_SOCKET, &cm->cmsg_level); |
| 340 | if (!err) |
| 341 | err = put_user(SCM_RIGHTS, &cm->cmsg_type); |
| 342 | if (!err) |
| 343 | err = put_user(cmlen, &cm->cmsg_len); |
| 344 | if (!err) { |
| 345 | cmlen = CMSG_SPACE(i*sizeof(int)); |
| 346 | if (msg->msg_controllen < cmlen) |
| 347 | cmlen = msg->msg_controllen; |
| 348 | msg->msg_control += cmlen; |
| 349 | msg->msg_controllen -= cmlen; |
| 350 | } |
| 351 | } |
| 352 | if (i < fdnum || (fdnum && fdmax <= 0)) |
| 353 | msg->msg_flags |= MSG_CTRUNC; |
| 354 | |
| 355 | /* |
| 356 | * All of the files that fit in the message have had their |
| 357 | * usage counts incremented, so we just free the list. |
| 358 | */ |
| 359 | __scm_destroy(scm); |
| 360 | } |
| 361 | EXPORT_SYMBOL(scm_detach_fds); |
| 362 | |
| 363 | struct scm_fp_list *scm_fp_dup(struct scm_fp_list *fpl) |
| 364 | { |
| 365 | struct scm_fp_list *new_fpl; |
| 366 | int i; |
| 367 | |
| 368 | if (!fpl) |
| 369 | return NULL; |
| 370 | |
| 371 | new_fpl = kmemdup(fpl, offsetof(struct scm_fp_list, fp[fpl->count]), |
| 372 | GFP_KERNEL); |
| 373 | if (new_fpl) { |
| 374 | for (i = 0; i < fpl->count; i++) |
| 375 | get_file(fpl->fp[i]); |
| 376 | new_fpl->max = new_fpl->count; |
| 377 | new_fpl->user = get_uid(fpl->user); |
| 378 | } |
| 379 | return new_fpl; |
| 380 | } |
| 381 | EXPORT_SYMBOL(scm_fp_dup); |