1 /*
2 * af_alg: User-space algorithm interface
3 *
4 * This file provides the user-space API for algorithms.
5 *
6 * Copyright (c) 2010 Herbert Xu <herbert@gondor.apana.org.au>
7 *
8 * This program is free software; you can redistribute it and/or modify it
9 * under the terms of the GNU General Public License as published by the Free
10 * Software Foundation; either version 2 of the License, or (at your option)
11 * any later version.
12 *
13 */
14
15 #include <linux/atomic.h>
16 #include <crypto/if_alg.h>
17 #include <linux/crypto.h>
18 #include <linux/init.h>
19 #include <linux/kernel.h>
20 #include <linux/list.h>
21 #include <linux/module.h>
22 #include <linux/net.h>
23 #include <linux/rwsem.h>
24 #include <linux/sched/signal.h>
25 #include <linux/security.h>
26
27 struct alg_type_list {
28 const struct af_alg_type *type;
29 struct list_head list;
30 };
31
32 static atomic_long_t alg_memory_allocated;
33
34 static struct proto alg_proto = {
35 .name = "ALG",
36 .owner = THIS_MODULE,
37 .memory_allocated = &alg_memory_allocated,
38 .obj_size = sizeof(struct alg_sock),
39 };
40
41 static LIST_HEAD(alg_types);
42 static DECLARE_RWSEM(alg_types_sem);
43
alg_get_type(const char * name)44 static const struct af_alg_type *alg_get_type(const char *name)
45 {
46 const struct af_alg_type *type = ERR_PTR(-ENOENT);
47 struct alg_type_list *node;
48
49 down_read(&alg_types_sem);
50 list_for_each_entry(node, &alg_types, list) {
51 if (strcmp(node->type->name, name))
52 continue;
53
54 if (try_module_get(node->type->owner))
55 type = node->type;
56 break;
57 }
58 up_read(&alg_types_sem);
59
60 return type;
61 }
62
af_alg_register_type(const struct af_alg_type * type)63 int af_alg_register_type(const struct af_alg_type *type)
64 {
65 struct alg_type_list *node;
66 int err = -EEXIST;
67
68 down_write(&alg_types_sem);
69 list_for_each_entry(node, &alg_types, list) {
70 if (!strcmp(node->type->name, type->name))
71 goto unlock;
72 }
73
74 node = kmalloc(sizeof(*node), GFP_KERNEL);
75 err = -ENOMEM;
76 if (!node)
77 goto unlock;
78
79 type->ops->owner = THIS_MODULE;
80 if (type->ops_nokey)
81 type->ops_nokey->owner = THIS_MODULE;
82 node->type = type;
83 list_add(&node->list, &alg_types);
84 err = 0;
85
86 unlock:
87 up_write(&alg_types_sem);
88
89 return err;
90 }
91 EXPORT_SYMBOL_GPL(af_alg_register_type);
92
af_alg_unregister_type(const struct af_alg_type * type)93 int af_alg_unregister_type(const struct af_alg_type *type)
94 {
95 struct alg_type_list *node;
96 int err = -ENOENT;
97
98 down_write(&alg_types_sem);
99 list_for_each_entry(node, &alg_types, list) {
100 if (strcmp(node->type->name, type->name))
101 continue;
102
103 list_del(&node->list);
104 kfree(node);
105 err = 0;
106 break;
107 }
108 up_write(&alg_types_sem);
109
110 return err;
111 }
112 EXPORT_SYMBOL_GPL(af_alg_unregister_type);
113
alg_do_release(const struct af_alg_type * type,void * private)114 static void alg_do_release(const struct af_alg_type *type, void *private)
115 {
116 if (!type)
117 return;
118
119 type->release(private);
120 module_put(type->owner);
121 }
122
af_alg_release(struct socket * sock)123 int af_alg_release(struct socket *sock)
124 {
125 if (sock->sk) {
126 sock_put(sock->sk);
127 sock->sk = NULL;
128 }
129 return 0;
130 }
131 EXPORT_SYMBOL_GPL(af_alg_release);
132
af_alg_release_parent(struct sock * sk)133 void af_alg_release_parent(struct sock *sk)
134 {
135 struct alg_sock *ask = alg_sk(sk);
136 unsigned int nokey = ask->nokey_refcnt;
137 bool last = nokey && !ask->refcnt;
138
139 sk = ask->parent;
140 ask = alg_sk(sk);
141
142 local_bh_disable();
143 bh_lock_sock(sk);
144 ask->nokey_refcnt -= nokey;
145 if (!last)
146 last = !--ask->refcnt;
147 bh_unlock_sock(sk);
148 local_bh_enable();
149
150 if (last)
151 sock_put(sk);
152 }
153 EXPORT_SYMBOL_GPL(af_alg_release_parent);
154
alg_bind(struct socket * sock,struct sockaddr * uaddr,int addr_len)155 static int alg_bind(struct socket *sock, struct sockaddr *uaddr, int addr_len)
156 {
157 const u32 allowed = CRYPTO_ALG_KERN_DRIVER_ONLY;
158 struct sock *sk = sock->sk;
159 struct alg_sock *ask = alg_sk(sk);
160 struct sockaddr_alg *sa = (void *)uaddr;
161 const struct af_alg_type *type;
162 void *private;
163 int err;
164
165 if (sock->state == SS_CONNECTED)
166 return -EINVAL;
167
168 if (addr_len < sizeof(*sa))
169 return -EINVAL;
170
171 /* If caller uses non-allowed flag, return error. */
172 if ((sa->salg_feat & ~allowed) || (sa->salg_mask & ~allowed))
173 return -EINVAL;
174
175 sa->salg_type[sizeof(sa->salg_type) - 1] = 0;
176 sa->salg_name[sizeof(sa->salg_name) + addr_len - sizeof(*sa) - 1] = 0;
177
178 type = alg_get_type(sa->salg_type);
179 if (IS_ERR(type) && PTR_ERR(type) == -ENOENT) {
180 request_module("algif-%s", sa->salg_type);
181 type = alg_get_type(sa->salg_type);
182 }
183
184 if (IS_ERR(type))
185 return PTR_ERR(type);
186
187 private = type->bind(sa->salg_name, sa->salg_feat, sa->salg_mask);
188 if (IS_ERR(private)) {
189 module_put(type->owner);
190 return PTR_ERR(private);
191 }
192
193 err = -EBUSY;
194 lock_sock(sk);
195 if (ask->refcnt | ask->nokey_refcnt)
196 goto unlock;
197
198 swap(ask->type, type);
199 swap(ask->private, private);
200
201 err = 0;
202
203 unlock:
204 release_sock(sk);
205
206 alg_do_release(type, private);
207
208 return err;
209 }
210
alg_setkey(struct sock * sk,char __user * ukey,unsigned int keylen)211 static int alg_setkey(struct sock *sk, char __user *ukey,
212 unsigned int keylen)
213 {
214 struct alg_sock *ask = alg_sk(sk);
215 const struct af_alg_type *type = ask->type;
216 u8 *key;
217 int err;
218
219 key = sock_kmalloc(sk, keylen, GFP_KERNEL);
220 if (!key)
221 return -ENOMEM;
222
223 err = -EFAULT;
224 if (copy_from_user(key, ukey, keylen))
225 goto out;
226
227 err = type->setkey(ask->private, key, keylen);
228
229 out:
230 sock_kzfree_s(sk, key, keylen);
231
232 return err;
233 }
234
alg_setsockopt(struct socket * sock,int level,int optname,char __user * optval,unsigned int optlen)235 static int alg_setsockopt(struct socket *sock, int level, int optname,
236 char __user *optval, unsigned int optlen)
237 {
238 struct sock *sk = sock->sk;
239 struct alg_sock *ask = alg_sk(sk);
240 const struct af_alg_type *type;
241 int err = -EBUSY;
242
243 lock_sock(sk);
244 if (ask->refcnt)
245 goto unlock;
246
247 type = ask->type;
248
249 err = -ENOPROTOOPT;
250 if (level != SOL_ALG || !type)
251 goto unlock;
252
253 switch (optname) {
254 case ALG_SET_KEY:
255 if (sock->state == SS_CONNECTED)
256 goto unlock;
257 if (!type->setkey)
258 goto unlock;
259
260 err = alg_setkey(sk, optval, optlen);
261 break;
262 case ALG_SET_AEAD_AUTHSIZE:
263 if (sock->state == SS_CONNECTED)
264 goto unlock;
265 if (!type->setauthsize)
266 goto unlock;
267 err = type->setauthsize(ask->private, optlen);
268 }
269
270 unlock:
271 release_sock(sk);
272
273 return err;
274 }
275
af_alg_accept(struct sock * sk,struct socket * newsock,bool kern)276 int af_alg_accept(struct sock *sk, struct socket *newsock, bool kern)
277 {
278 struct alg_sock *ask = alg_sk(sk);
279 const struct af_alg_type *type;
280 struct sock *sk2;
281 unsigned int nokey;
282 int err;
283
284 lock_sock(sk);
285 type = ask->type;
286
287 err = -EINVAL;
288 if (!type)
289 goto unlock;
290
291 sk2 = sk_alloc(sock_net(sk), PF_ALG, GFP_KERNEL, &alg_proto, kern);
292 err = -ENOMEM;
293 if (!sk2)
294 goto unlock;
295
296 sock_init_data(newsock, sk2);
297 security_sock_graft(sk2, newsock);
298 security_sk_clone(sk, sk2);
299
300 err = type->accept(ask->private, sk2);
301
302 nokey = err == -ENOKEY;
303 if (nokey && type->accept_nokey)
304 err = type->accept_nokey(ask->private, sk2);
305
306 if (err)
307 goto unlock;
308
309 sk2->sk_family = PF_ALG;
310
311 if (nokey || !ask->refcnt++)
312 sock_hold(sk);
313 ask->nokey_refcnt += nokey;
314 alg_sk(sk2)->parent = sk;
315 alg_sk(sk2)->type = type;
316 alg_sk(sk2)->nokey_refcnt = nokey;
317
318 newsock->ops = type->ops;
319 newsock->state = SS_CONNECTED;
320
321 if (nokey)
322 newsock->ops = type->ops_nokey;
323
324 err = 0;
325
326 unlock:
327 release_sock(sk);
328
329 return err;
330 }
331 EXPORT_SYMBOL_GPL(af_alg_accept);
332
alg_accept(struct socket * sock,struct socket * newsock,int flags,bool kern)333 static int alg_accept(struct socket *sock, struct socket *newsock, int flags,
334 bool kern)
335 {
336 return af_alg_accept(sock->sk, newsock, kern);
337 }
338
339 static const struct proto_ops alg_proto_ops = {
340 .family = PF_ALG,
341 .owner = THIS_MODULE,
342
343 .connect = sock_no_connect,
344 .socketpair = sock_no_socketpair,
345 .getname = sock_no_getname,
346 .ioctl = sock_no_ioctl,
347 .listen = sock_no_listen,
348 .shutdown = sock_no_shutdown,
349 .getsockopt = sock_no_getsockopt,
350 .mmap = sock_no_mmap,
351 .sendpage = sock_no_sendpage,
352 .sendmsg = sock_no_sendmsg,
353 .recvmsg = sock_no_recvmsg,
354 .poll = sock_no_poll,
355
356 .bind = alg_bind,
357 .release = af_alg_release,
358 .setsockopt = alg_setsockopt,
359 .accept = alg_accept,
360 };
361
alg_sock_destruct(struct sock * sk)362 static void alg_sock_destruct(struct sock *sk)
363 {
364 struct alg_sock *ask = alg_sk(sk);
365
366 alg_do_release(ask->type, ask->private);
367 }
368
alg_create(struct net * net,struct socket * sock,int protocol,int kern)369 static int alg_create(struct net *net, struct socket *sock, int protocol,
370 int kern)
371 {
372 struct sock *sk;
373 int err;
374
375 if (sock->type != SOCK_SEQPACKET)
376 return -ESOCKTNOSUPPORT;
377 if (protocol != 0)
378 return -EPROTONOSUPPORT;
379
380 err = -ENOMEM;
381 sk = sk_alloc(net, PF_ALG, GFP_KERNEL, &alg_proto, kern);
382 if (!sk)
383 goto out;
384
385 sock->ops = &alg_proto_ops;
386 sock_init_data(sock, sk);
387
388 sk->sk_family = PF_ALG;
389 sk->sk_destruct = alg_sock_destruct;
390
391 return 0;
392 out:
393 return err;
394 }
395
396 static const struct net_proto_family alg_family = {
397 .family = PF_ALG,
398 .create = alg_create,
399 .owner = THIS_MODULE,
400 };
401
af_alg_make_sg(struct af_alg_sgl * sgl,struct iov_iter * iter,int len)402 int af_alg_make_sg(struct af_alg_sgl *sgl, struct iov_iter *iter, int len)
403 {
404 size_t off;
405 ssize_t n;
406 int npages, i;
407
408 n = iov_iter_get_pages(iter, sgl->pages, len, ALG_MAX_PAGES, &off);
409 if (n < 0)
410 return n;
411
412 npages = (off + n + PAGE_SIZE - 1) >> PAGE_SHIFT;
413 if (WARN_ON(npages == 0))
414 return -EINVAL;
415 /* Add one extra for linking */
416 sg_init_table(sgl->sg, npages + 1);
417
418 for (i = 0, len = n; i < npages; i++) {
419 int plen = min_t(int, len, PAGE_SIZE - off);
420
421 sg_set_page(sgl->sg + i, sgl->pages[i], plen, off);
422
423 off = 0;
424 len -= plen;
425 }
426 sg_mark_end(sgl->sg + npages - 1);
427 sgl->npages = npages;
428
429 return n;
430 }
431 EXPORT_SYMBOL_GPL(af_alg_make_sg);
432
af_alg_link_sg(struct af_alg_sgl * sgl_prev,struct af_alg_sgl * sgl_new)433 void af_alg_link_sg(struct af_alg_sgl *sgl_prev, struct af_alg_sgl *sgl_new)
434 {
435 sg_unmark_end(sgl_prev->sg + sgl_prev->npages - 1);
436 sg_chain(sgl_prev->sg, sgl_prev->npages + 1, sgl_new->sg);
437 }
438 EXPORT_SYMBOL_GPL(af_alg_link_sg);
439
af_alg_free_sg(struct af_alg_sgl * sgl)440 void af_alg_free_sg(struct af_alg_sgl *sgl)
441 {
442 int i;
443
444 for (i = 0; i < sgl->npages; i++)
445 put_page(sgl->pages[i]);
446 }
447 EXPORT_SYMBOL_GPL(af_alg_free_sg);
448
af_alg_cmsg_send(struct msghdr * msg,struct af_alg_control * con)449 int af_alg_cmsg_send(struct msghdr *msg, struct af_alg_control *con)
450 {
451 struct cmsghdr *cmsg;
452
453 for_each_cmsghdr(cmsg, msg) {
454 if (!CMSG_OK(msg, cmsg))
455 return -EINVAL;
456 if (cmsg->cmsg_level != SOL_ALG)
457 continue;
458
459 switch (cmsg->cmsg_type) {
460 case ALG_SET_IV:
461 if (cmsg->cmsg_len < CMSG_LEN(sizeof(*con->iv)))
462 return -EINVAL;
463 con->iv = (void *)CMSG_DATA(cmsg);
464 if (cmsg->cmsg_len < CMSG_LEN(con->iv->ivlen +
465 sizeof(*con->iv)))
466 return -EINVAL;
467 break;
468
469 case ALG_SET_OP:
470 if (cmsg->cmsg_len < CMSG_LEN(sizeof(u32)))
471 return -EINVAL;
472 con->op = *(u32 *)CMSG_DATA(cmsg);
473 break;
474
475 case ALG_SET_AEAD_ASSOCLEN:
476 if (cmsg->cmsg_len < CMSG_LEN(sizeof(u32)))
477 return -EINVAL;
478 con->aead_assoclen = *(u32 *)CMSG_DATA(cmsg);
479 break;
480
481 default:
482 return -EINVAL;
483 }
484 }
485
486 return 0;
487 }
488 EXPORT_SYMBOL_GPL(af_alg_cmsg_send);
489
af_alg_wait_for_completion(int err,struct af_alg_completion * completion)490 int af_alg_wait_for_completion(int err, struct af_alg_completion *completion)
491 {
492 switch (err) {
493 case -EINPROGRESS:
494 case -EBUSY:
495 wait_for_completion(&completion->completion);
496 reinit_completion(&completion->completion);
497 err = completion->err;
498 break;
499 };
500
501 return err;
502 }
503 EXPORT_SYMBOL_GPL(af_alg_wait_for_completion);
504
af_alg_complete(struct crypto_async_request * req,int err)505 void af_alg_complete(struct crypto_async_request *req, int err)
506 {
507 struct af_alg_completion *completion = req->data;
508
509 if (err == -EINPROGRESS)
510 return;
511
512 completion->err = err;
513 complete(&completion->completion);
514 }
515 EXPORT_SYMBOL_GPL(af_alg_complete);
516
517 /**
518 * af_alg_alloc_tsgl - allocate the TX SGL
519 *
520 * @sk socket of connection to user space
521 * @return: 0 upon success, < 0 upon error
522 */
af_alg_alloc_tsgl(struct sock * sk)523 int af_alg_alloc_tsgl(struct sock *sk)
524 {
525 struct alg_sock *ask = alg_sk(sk);
526 struct af_alg_ctx *ctx = ask->private;
527 struct af_alg_tsgl *sgl;
528 struct scatterlist *sg = NULL;
529
530 sgl = list_entry(ctx->tsgl_list.prev, struct af_alg_tsgl, list);
531 if (!list_empty(&ctx->tsgl_list))
532 sg = sgl->sg;
533
534 if (!sg || sgl->cur >= MAX_SGL_ENTS) {
535 sgl = sock_kmalloc(sk, sizeof(*sgl) +
536 sizeof(sgl->sg[0]) * (MAX_SGL_ENTS + 1),
537 GFP_KERNEL);
538 if (!sgl)
539 return -ENOMEM;
540
541 sg_init_table(sgl->sg, MAX_SGL_ENTS + 1);
542 sgl->cur = 0;
543
544 if (sg)
545 sg_chain(sg, MAX_SGL_ENTS + 1, sgl->sg);
546
547 list_add_tail(&sgl->list, &ctx->tsgl_list);
548 }
549
550 return 0;
551 }
552 EXPORT_SYMBOL_GPL(af_alg_alloc_tsgl);
553
554 /**
555 * aead_count_tsgl - Count number of TX SG entries
556 *
557 * The counting starts from the beginning of the SGL to @bytes. If
558 * an offset is provided, the counting of the SG entries starts at the offset.
559 *
560 * @sk socket of connection to user space
561 * @bytes Count the number of SG entries holding given number of bytes.
562 * @offset Start the counting of SG entries from the given offset.
563 * @return Number of TX SG entries found given the constraints
564 */
af_alg_count_tsgl(struct sock * sk,size_t bytes,size_t offset)565 unsigned int af_alg_count_tsgl(struct sock *sk, size_t bytes, size_t offset)
566 {
567 struct alg_sock *ask = alg_sk(sk);
568 struct af_alg_ctx *ctx = ask->private;
569 struct af_alg_tsgl *sgl, *tmp;
570 unsigned int i;
571 unsigned int sgl_count = 0;
572
573 if (!bytes)
574 return 0;
575
576 list_for_each_entry_safe(sgl, tmp, &ctx->tsgl_list, list) {
577 struct scatterlist *sg = sgl->sg;
578
579 for (i = 0; i < sgl->cur; i++) {
580 size_t bytes_count;
581
582 /* Skip offset */
583 if (offset >= sg[i].length) {
584 offset -= sg[i].length;
585 bytes -= sg[i].length;
586 continue;
587 }
588
589 bytes_count = sg[i].length - offset;
590
591 offset = 0;
592 sgl_count++;
593
594 /* If we have seen requested number of bytes, stop */
595 if (bytes_count >= bytes)
596 return sgl_count;
597
598 bytes -= bytes_count;
599 }
600 }
601
602 return sgl_count;
603 }
604 EXPORT_SYMBOL_GPL(af_alg_count_tsgl);
605
606 /**
607 * aead_pull_tsgl - Release the specified buffers from TX SGL
608 *
609 * If @dst is non-null, reassign the pages to dst. The caller must release
610 * the pages. If @dst_offset is given only reassign the pages to @dst starting
611 * at the @dst_offset (byte). The caller must ensure that @dst is large
612 * enough (e.g. by using af_alg_count_tsgl with the same offset).
613 *
614 * @sk socket of connection to user space
615 * @used Number of bytes to pull from TX SGL
616 * @dst If non-NULL, buffer is reassigned to dst SGL instead of releasing. The
617 * caller must release the buffers in dst.
618 * @dst_offset Reassign the TX SGL from given offset. All buffers before
619 * reaching the offset is released.
620 */
af_alg_pull_tsgl(struct sock * sk,size_t used,struct scatterlist * dst,size_t dst_offset)621 void af_alg_pull_tsgl(struct sock *sk, size_t used, struct scatterlist *dst,
622 size_t dst_offset)
623 {
624 struct alg_sock *ask = alg_sk(sk);
625 struct af_alg_ctx *ctx = ask->private;
626 struct af_alg_tsgl *sgl;
627 struct scatterlist *sg;
628 unsigned int i, j = 0;
629
630 while (!list_empty(&ctx->tsgl_list)) {
631 sgl = list_first_entry(&ctx->tsgl_list, struct af_alg_tsgl,
632 list);
633 sg = sgl->sg;
634
635 for (i = 0; i < sgl->cur; i++) {
636 size_t plen = min_t(size_t, used, sg[i].length);
637 struct page *page = sg_page(sg + i);
638
639 if (!page)
640 continue;
641
642 /*
643 * Assumption: caller created af_alg_count_tsgl(len)
644 * SG entries in dst.
645 */
646 if (dst) {
647 if (dst_offset >= plen) {
648 /* discard page before offset */
649 dst_offset -= plen;
650 } else {
651 /* reassign page to dst after offset */
652 get_page(page);
653 sg_set_page(dst + j, page,
654 plen - dst_offset,
655 sg[i].offset + dst_offset);
656 dst_offset = 0;
657 j++;
658 }
659 }
660
661 sg[i].length -= plen;
662 sg[i].offset += plen;
663
664 used -= plen;
665 ctx->used -= plen;
666
667 if (sg[i].length)
668 return;
669
670 put_page(page);
671 sg_assign_page(sg + i, NULL);
672 }
673
674 list_del(&sgl->list);
675 sock_kfree_s(sk, sgl, sizeof(*sgl) + sizeof(sgl->sg[0]) *
676 (MAX_SGL_ENTS + 1));
677 }
678
679 if (!ctx->used)
680 ctx->merge = 0;
681 }
682 EXPORT_SYMBOL_GPL(af_alg_pull_tsgl);
683
684 /**
685 * af_alg_free_areq_sgls - Release TX and RX SGLs of the request
686 *
687 * @areq Request holding the TX and RX SGL
688 */
af_alg_free_areq_sgls(struct af_alg_async_req * areq)689 void af_alg_free_areq_sgls(struct af_alg_async_req *areq)
690 {
691 struct sock *sk = areq->sk;
692 struct alg_sock *ask = alg_sk(sk);
693 struct af_alg_ctx *ctx = ask->private;
694 struct af_alg_rsgl *rsgl, *tmp;
695 struct scatterlist *tsgl;
696 struct scatterlist *sg;
697 unsigned int i;
698
699 list_for_each_entry_safe(rsgl, tmp, &areq->rsgl_list, list) {
700 atomic_sub(rsgl->sg_num_bytes, &ctx->rcvused);
701 af_alg_free_sg(&rsgl->sgl);
702 list_del(&rsgl->list);
703 if (rsgl != &areq->first_rsgl)
704 sock_kfree_s(sk, rsgl, sizeof(*rsgl));
705 }
706
707 tsgl = areq->tsgl;
708 if (tsgl) {
709 for_each_sg(tsgl, sg, areq->tsgl_entries, i) {
710 if (!sg_page(sg))
711 continue;
712 put_page(sg_page(sg));
713 }
714
715 sock_kfree_s(sk, tsgl, areq->tsgl_entries * sizeof(*tsgl));
716 }
717 }
718 EXPORT_SYMBOL_GPL(af_alg_free_areq_sgls);
719
720 /**
721 * af_alg_wait_for_wmem - wait for availability of writable memory
722 *
723 * @sk socket of connection to user space
724 * @flags If MSG_DONTWAIT is set, then only report if function would sleep
725 * @return 0 when writable memory is available, < 0 upon error
726 */
af_alg_wait_for_wmem(struct sock * sk,unsigned int flags)727 int af_alg_wait_for_wmem(struct sock *sk, unsigned int flags)
728 {
729 DEFINE_WAIT_FUNC(wait, woken_wake_function);
730 int err = -ERESTARTSYS;
731 long timeout;
732
733 if (flags & MSG_DONTWAIT)
734 return -EAGAIN;
735
736 sk_set_bit(SOCKWQ_ASYNC_NOSPACE, sk);
737
738 add_wait_queue(sk_sleep(sk), &wait);
739 for (;;) {
740 if (signal_pending(current))
741 break;
742 timeout = MAX_SCHEDULE_TIMEOUT;
743 if (sk_wait_event(sk, &timeout, af_alg_writable(sk), &wait)) {
744 err = 0;
745 break;
746 }
747 }
748 remove_wait_queue(sk_sleep(sk), &wait);
749
750 return err;
751 }
752 EXPORT_SYMBOL_GPL(af_alg_wait_for_wmem);
753
754 /**
755 * af_alg_wmem_wakeup - wakeup caller when writable memory is available
756 *
757 * @sk socket of connection to user space
758 */
af_alg_wmem_wakeup(struct sock * sk)759 void af_alg_wmem_wakeup(struct sock *sk)
760 {
761 struct socket_wq *wq;
762
763 if (!af_alg_writable(sk))
764 return;
765
766 rcu_read_lock();
767 wq = rcu_dereference(sk->sk_wq);
768 if (skwq_has_sleeper(wq))
769 wake_up_interruptible_sync_poll(&wq->wait, POLLIN |
770 POLLRDNORM |
771 POLLRDBAND);
772 sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_IN);
773 rcu_read_unlock();
774 }
775 EXPORT_SYMBOL_GPL(af_alg_wmem_wakeup);
776
777 /**
778 * af_alg_wait_for_data - wait for availability of TX data
779 *
780 * @sk socket of connection to user space
781 * @flags If MSG_DONTWAIT is set, then only report if function would sleep
782 * @return 0 when writable memory is available, < 0 upon error
783 */
af_alg_wait_for_data(struct sock * sk,unsigned flags)784 int af_alg_wait_for_data(struct sock *sk, unsigned flags)
785 {
786 DEFINE_WAIT_FUNC(wait, woken_wake_function);
787 struct alg_sock *ask = alg_sk(sk);
788 struct af_alg_ctx *ctx = ask->private;
789 long timeout;
790 int err = -ERESTARTSYS;
791
792 if (flags & MSG_DONTWAIT)
793 return -EAGAIN;
794
795 sk_set_bit(SOCKWQ_ASYNC_WAITDATA, sk);
796
797 add_wait_queue(sk_sleep(sk), &wait);
798 for (;;) {
799 if (signal_pending(current))
800 break;
801 timeout = MAX_SCHEDULE_TIMEOUT;
802 if (sk_wait_event(sk, &timeout, (ctx->used || !ctx->more),
803 &wait)) {
804 err = 0;
805 break;
806 }
807 }
808 remove_wait_queue(sk_sleep(sk), &wait);
809
810 sk_clear_bit(SOCKWQ_ASYNC_WAITDATA, sk);
811
812 return err;
813 }
814 EXPORT_SYMBOL_GPL(af_alg_wait_for_data);
815
816 /**
817 * af_alg_data_wakeup - wakeup caller when new data can be sent to kernel
818 *
819 * @sk socket of connection to user space
820 */
821
af_alg_data_wakeup(struct sock * sk)822 void af_alg_data_wakeup(struct sock *sk)
823 {
824 struct alg_sock *ask = alg_sk(sk);
825 struct af_alg_ctx *ctx = ask->private;
826 struct socket_wq *wq;
827
828 if (!ctx->used)
829 return;
830
831 rcu_read_lock();
832 wq = rcu_dereference(sk->sk_wq);
833 if (skwq_has_sleeper(wq))
834 wake_up_interruptible_sync_poll(&wq->wait, POLLOUT |
835 POLLRDNORM |
836 POLLRDBAND);
837 sk_wake_async(sk, SOCK_WAKE_SPACE, POLL_OUT);
838 rcu_read_unlock();
839 }
840 EXPORT_SYMBOL_GPL(af_alg_data_wakeup);
841
842 /**
843 * af_alg_sendmsg - implementation of sendmsg system call handler
844 *
845 * The sendmsg system call handler obtains the user data and stores it
846 * in ctx->tsgl_list. This implies allocation of the required numbers of
847 * struct af_alg_tsgl.
848 *
849 * In addition, the ctx is filled with the information sent via CMSG.
850 *
851 * @sock socket of connection to user space
852 * @msg message from user space
853 * @size size of message from user space
854 * @ivsize the size of the IV for the cipher operation to verify that the
855 * user-space-provided IV has the right size
856 * @return the number of copied data upon success, < 0 upon error
857 */
af_alg_sendmsg(struct socket * sock,struct msghdr * msg,size_t size,unsigned int ivsize)858 int af_alg_sendmsg(struct socket *sock, struct msghdr *msg, size_t size,
859 unsigned int ivsize)
860 {
861 struct sock *sk = sock->sk;
862 struct alg_sock *ask = alg_sk(sk);
863 struct af_alg_ctx *ctx = ask->private;
864 struct af_alg_tsgl *sgl;
865 struct af_alg_control con = {};
866 long copied = 0;
867 bool enc = 0;
868 bool init = 0;
869 int err = 0;
870
871 if (msg->msg_controllen) {
872 err = af_alg_cmsg_send(msg, &con);
873 if (err)
874 return err;
875
876 init = 1;
877 switch (con.op) {
878 case ALG_OP_ENCRYPT:
879 enc = 1;
880 break;
881 case ALG_OP_DECRYPT:
882 enc = 0;
883 break;
884 default:
885 return -EINVAL;
886 }
887
888 if (con.iv && con.iv->ivlen != ivsize)
889 return -EINVAL;
890 }
891
892 lock_sock(sk);
893 if (!ctx->more && ctx->used) {
894 err = -EINVAL;
895 goto unlock;
896 }
897
898 if (init) {
899 ctx->enc = enc;
900 if (con.iv)
901 memcpy(ctx->iv, con.iv->iv, ivsize);
902
903 ctx->aead_assoclen = con.aead_assoclen;
904 }
905
906 while (size) {
907 struct scatterlist *sg;
908 size_t len = size;
909 size_t plen;
910
911 /* use the existing memory in an allocated page */
912 if (ctx->merge) {
913 sgl = list_entry(ctx->tsgl_list.prev,
914 struct af_alg_tsgl, list);
915 sg = sgl->sg + sgl->cur - 1;
916 len = min_t(size_t, len,
917 PAGE_SIZE - sg->offset - sg->length);
918
919 err = memcpy_from_msg(page_address(sg_page(sg)) +
920 sg->offset + sg->length,
921 msg, len);
922 if (err)
923 goto unlock;
924
925 sg->length += len;
926 ctx->merge = (sg->offset + sg->length) &
927 (PAGE_SIZE - 1);
928
929 ctx->used += len;
930 copied += len;
931 size -= len;
932 continue;
933 }
934
935 if (!af_alg_writable(sk)) {
936 err = af_alg_wait_for_wmem(sk, msg->msg_flags);
937 if (err)
938 goto unlock;
939 }
940
941 /* allocate a new page */
942 len = min_t(unsigned long, len, af_alg_sndbuf(sk));
943
944 err = af_alg_alloc_tsgl(sk);
945 if (err)
946 goto unlock;
947
948 sgl = list_entry(ctx->tsgl_list.prev, struct af_alg_tsgl,
949 list);
950 sg = sgl->sg;
951 if (sgl->cur)
952 sg_unmark_end(sg + sgl->cur - 1);
953
954 do {
955 unsigned int i = sgl->cur;
956
957 plen = min_t(size_t, len, PAGE_SIZE);
958
959 sg_assign_page(sg + i, alloc_page(GFP_KERNEL));
960 if (!sg_page(sg + i)) {
961 err = -ENOMEM;
962 goto unlock;
963 }
964
965 err = memcpy_from_msg(page_address(sg_page(sg + i)),
966 msg, plen);
967 if (err) {
968 __free_page(sg_page(sg + i));
969 sg_assign_page(sg + i, NULL);
970 goto unlock;
971 }
972
973 sg[i].length = plen;
974 len -= plen;
975 ctx->used += plen;
976 copied += plen;
977 size -= plen;
978 sgl->cur++;
979 } while (len && sgl->cur < MAX_SGL_ENTS);
980
981 if (!size)
982 sg_mark_end(sg + sgl->cur - 1);
983
984 ctx->merge = plen & (PAGE_SIZE - 1);
985 }
986
987 err = 0;
988
989 ctx->more = msg->msg_flags & MSG_MORE;
990
991 unlock:
992 af_alg_data_wakeup(sk);
993 release_sock(sk);
994
995 return copied ?: err;
996 }
997 EXPORT_SYMBOL_GPL(af_alg_sendmsg);
998
999 /**
1000 * af_alg_sendpage - sendpage system call handler
1001 *
1002 * This is a generic implementation of sendpage to fill ctx->tsgl_list.
1003 */
af_alg_sendpage(struct socket * sock,struct page * page,int offset,size_t size,int flags)1004 ssize_t af_alg_sendpage(struct socket *sock, struct page *page,
1005 int offset, size_t size, int flags)
1006 {
1007 struct sock *sk = sock->sk;
1008 struct alg_sock *ask = alg_sk(sk);
1009 struct af_alg_ctx *ctx = ask->private;
1010 struct af_alg_tsgl *sgl;
1011 int err = -EINVAL;
1012
1013 if (flags & MSG_SENDPAGE_NOTLAST)
1014 flags |= MSG_MORE;
1015
1016 lock_sock(sk);
1017 if (!ctx->more && ctx->used)
1018 goto unlock;
1019
1020 if (!size)
1021 goto done;
1022
1023 if (!af_alg_writable(sk)) {
1024 err = af_alg_wait_for_wmem(sk, flags);
1025 if (err)
1026 goto unlock;
1027 }
1028
1029 err = af_alg_alloc_tsgl(sk);
1030 if (err)
1031 goto unlock;
1032
1033 ctx->merge = 0;
1034 sgl = list_entry(ctx->tsgl_list.prev, struct af_alg_tsgl, list);
1035
1036 if (sgl->cur)
1037 sg_unmark_end(sgl->sg + sgl->cur - 1);
1038
1039 sg_mark_end(sgl->sg + sgl->cur);
1040
1041 get_page(page);
1042 sg_set_page(sgl->sg + sgl->cur, page, size, offset);
1043 sgl->cur++;
1044 ctx->used += size;
1045
1046 done:
1047 ctx->more = flags & MSG_MORE;
1048
1049 unlock:
1050 af_alg_data_wakeup(sk);
1051 release_sock(sk);
1052
1053 return err ?: size;
1054 }
1055 EXPORT_SYMBOL_GPL(af_alg_sendpage);
1056
1057 /**
1058 * af_alg_free_resources - release resources required for crypto request
1059 */
af_alg_free_resources(struct af_alg_async_req * areq)1060 void af_alg_free_resources(struct af_alg_async_req *areq)
1061 {
1062 struct sock *sk = areq->sk;
1063
1064 af_alg_free_areq_sgls(areq);
1065 sock_kfree_s(sk, areq, areq->areqlen);
1066 }
1067 EXPORT_SYMBOL_GPL(af_alg_free_resources);
1068
1069 /**
1070 * af_alg_async_cb - AIO callback handler
1071 *
1072 * This handler cleans up the struct af_alg_async_req upon completion of the
1073 * AIO operation.
1074 *
1075 * The number of bytes to be generated with the AIO operation must be set
1076 * in areq->outlen before the AIO callback handler is invoked.
1077 */
af_alg_async_cb(struct crypto_async_request * _req,int err)1078 void af_alg_async_cb(struct crypto_async_request *_req, int err)
1079 {
1080 struct af_alg_async_req *areq = _req->data;
1081 struct sock *sk = areq->sk;
1082 struct kiocb *iocb = areq->iocb;
1083 unsigned int resultlen;
1084
1085 /* Buffer size written by crypto operation. */
1086 resultlen = areq->outlen;
1087
1088 af_alg_free_resources(areq);
1089 sock_put(sk);
1090
1091 iocb->ki_complete(iocb, err ? err : (int)resultlen, 0);
1092 }
1093 EXPORT_SYMBOL_GPL(af_alg_async_cb);
1094
1095 /**
1096 * af_alg_poll - poll system call handler
1097 */
af_alg_poll(struct file * file,struct socket * sock,poll_table * wait)1098 unsigned int af_alg_poll(struct file *file, struct socket *sock,
1099 poll_table *wait)
1100 {
1101 struct sock *sk = sock->sk;
1102 struct alg_sock *ask = alg_sk(sk);
1103 struct af_alg_ctx *ctx = ask->private;
1104 unsigned int mask;
1105
1106 sock_poll_wait(file, sk_sleep(sk), wait);
1107 mask = 0;
1108
1109 if (!ctx->more || ctx->used)
1110 mask |= POLLIN | POLLRDNORM;
1111
1112 if (af_alg_writable(sk))
1113 mask |= POLLOUT | POLLWRNORM | POLLWRBAND;
1114
1115 return mask;
1116 }
1117 EXPORT_SYMBOL_GPL(af_alg_poll);
1118
1119 /**
1120 * af_alg_alloc_areq - allocate struct af_alg_async_req
1121 *
1122 * @sk socket of connection to user space
1123 * @areqlen size of struct af_alg_async_req + crypto_*_reqsize
1124 * @return allocated data structure or ERR_PTR upon error
1125 */
af_alg_alloc_areq(struct sock * sk,unsigned int areqlen)1126 struct af_alg_async_req *af_alg_alloc_areq(struct sock *sk,
1127 unsigned int areqlen)
1128 {
1129 struct af_alg_async_req *areq = sock_kmalloc(sk, areqlen, GFP_KERNEL);
1130
1131 if (unlikely(!areq))
1132 return ERR_PTR(-ENOMEM);
1133
1134 areq->areqlen = areqlen;
1135 areq->sk = sk;
1136 areq->last_rsgl = NULL;
1137 INIT_LIST_HEAD(&areq->rsgl_list);
1138 areq->tsgl = NULL;
1139 areq->tsgl_entries = 0;
1140
1141 return areq;
1142 }
1143 EXPORT_SYMBOL_GPL(af_alg_alloc_areq);
1144
1145 /**
1146 * af_alg_get_rsgl - create the RX SGL for the output data from the crypto
1147 * operation
1148 *
1149 * @sk socket of connection to user space
1150 * @msg user space message
1151 * @flags flags used to invoke recvmsg with
1152 * @areq instance of the cryptographic request that will hold the RX SGL
1153 * @maxsize maximum number of bytes to be pulled from user space
1154 * @outlen number of bytes in the RX SGL
1155 * @return 0 on success, < 0 upon error
1156 */
af_alg_get_rsgl(struct sock * sk,struct msghdr * msg,int flags,struct af_alg_async_req * areq,size_t maxsize,size_t * outlen)1157 int af_alg_get_rsgl(struct sock *sk, struct msghdr *msg, int flags,
1158 struct af_alg_async_req *areq, size_t maxsize,
1159 size_t *outlen)
1160 {
1161 struct alg_sock *ask = alg_sk(sk);
1162 struct af_alg_ctx *ctx = ask->private;
1163 size_t len = 0;
1164
1165 while (maxsize > len && msg_data_left(msg)) {
1166 struct af_alg_rsgl *rsgl;
1167 size_t seglen;
1168 int err;
1169
1170 /* limit the amount of readable buffers */
1171 if (!af_alg_readable(sk))
1172 break;
1173
1174 seglen = min_t(size_t, (maxsize - len),
1175 msg_data_left(msg));
1176
1177 if (list_empty(&areq->rsgl_list)) {
1178 rsgl = &areq->first_rsgl;
1179 } else {
1180 rsgl = sock_kmalloc(sk, sizeof(*rsgl), GFP_KERNEL);
1181 if (unlikely(!rsgl))
1182 return -ENOMEM;
1183 }
1184
1185 rsgl->sgl.npages = 0;
1186 list_add_tail(&rsgl->list, &areq->rsgl_list);
1187
1188 /* make one iovec available as scatterlist */
1189 err = af_alg_make_sg(&rsgl->sgl, &msg->msg_iter, seglen);
1190 if (err < 0) {
1191 rsgl->sg_num_bytes = 0;
1192 return err;
1193 }
1194
1195 /* chain the new scatterlist with previous one */
1196 if (areq->last_rsgl)
1197 af_alg_link_sg(&areq->last_rsgl->sgl, &rsgl->sgl);
1198
1199 areq->last_rsgl = rsgl;
1200 len += err;
1201 atomic_add(err, &ctx->rcvused);
1202 rsgl->sg_num_bytes = err;
1203 iov_iter_advance(&msg->msg_iter, err);
1204 }
1205
1206 *outlen = len;
1207 return 0;
1208 }
1209 EXPORT_SYMBOL_GPL(af_alg_get_rsgl);
1210
af_alg_init(void)1211 static int __init af_alg_init(void)
1212 {
1213 int err = proto_register(&alg_proto, 0);
1214
1215 if (err)
1216 goto out;
1217
1218 err = sock_register(&alg_family);
1219 if (err != 0)
1220 goto out_unregister_proto;
1221
1222 out:
1223 return err;
1224
1225 out_unregister_proto:
1226 proto_unregister(&alg_proto);
1227 goto out;
1228 }
1229
af_alg_exit(void)1230 static void __exit af_alg_exit(void)
1231 {
1232 sock_unregister(PF_ALG);
1233 proto_unregister(&alg_proto);
1234 }
1235
1236 module_init(af_alg_init);
1237 module_exit(af_alg_exit);
1238 MODULE_LICENSE("GPL");
1239 MODULE_ALIAS_NETPROTO(AF_ALG);
1240