1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
/* Copyright (C) 2015-2017 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved. */
#include "queueing.h"
#include <linux/slab.h>
struct kmem_cache *crypt_ctx_cache __read_mostly;
struct multicore_worker __percpu *packet_alloc_percpu_multicore_worker(work_func_t function, void *ptr)
{
int cpu;
struct multicore_worker __percpu *worker = alloc_percpu(struct multicore_worker);
if (!worker)
return NULL;
for_each_possible_cpu (cpu) {
per_cpu_ptr(worker, cpu)->ptr = ptr;
INIT_WORK(&per_cpu_ptr(worker, cpu)->work, function);
}
return worker;
}
int packet_queue_init(struct crypt_queue *queue, work_func_t function, bool multicore, unsigned int len)
{
int ret;
memset(queue, 0, sizeof(*queue));
ret = ptr_ring_init(&queue->ring, len, GFP_KERNEL);
if (ret)
return ret;
if (multicore) {
queue->worker = packet_alloc_percpu_multicore_worker(function, queue);
if (!queue->worker)
return -ENOMEM;
} else
INIT_WORK(&queue->work, function);
return 0;
}
void packet_queue_free(struct crypt_queue *queue, bool multicore)
{
if (multicore)
free_percpu(queue->worker);
WARN_ON(!ptr_ring_empty_bh(&queue->ring));
ptr_ring_cleanup(&queue->ring, NULL);
}
int __init crypt_ctx_cache_init(void)
{
crypt_ctx_cache = KMEM_CACHE(crypt_ctx, 0);
if (!crypt_ctx_cache)
return -ENOMEM;
return 0;
}
void crypt_ctx_cache_uninit(void)
{
kmem_cache_destroy(crypt_ctx_cache);
}
|
