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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/* SPDX-License-Identifier: GPL-2.0
*
* Copyright (C) 2018 Thomas Gschwantner <tharre3@gmail.com>. All Rights Reserved.
* Copyright (C) 2018 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved.
*/
#ifdef DEBUG
#include "../mpmc_ptr_ring.h"
#include <linux/kthread.h>
#define THREADS_PRODUCER 20
#define THREADS_CONSUMER 20
#define ELEMENT_COUNT 100000000LL /* divisible by threads_{consumer,producer} */
#define QUEUE_SIZE 1024
#define EXPECTED_TOTAL ((ELEMENT_COUNT * (ELEMENT_COUNT + 1)) / 2)
#define PER_PRODUCER (ELEMENT_COUNT / THREADS_PRODUCER)
#define PER_CONSUMER (ELEMENT_COUNT / THREADS_CONSUMER)
#define THREADS_TOTAL (THREADS_PRODUCER + THREADS_CONSUMER)
struct worker_producer {
struct mpmc_ptr_ring *ring;
struct rw_semaphore *sem;
int thread_num;
};
struct worker_consumer {
struct mpmc_ptr_ring *ring;
struct rw_semaphore *sem;
uint64_t total;
uint64_t count;
};
static __init int producer_function(void *data)
{
struct worker_producer *td = data;
uint64_t i;
for (i = td->thread_num * PER_PRODUCER + 1; i <= (td->thread_num + 1) * PER_PRODUCER; ++i) {
while (mpmc_ptr_ring_produce(td->ring, (void *)i)) {
if (need_resched())
schedule();
}
}
up_read(td->sem);
return 0;
}
static __init int consumer_function(void *data)
{
struct worker_consumer *td = data;
uint64_t i;
for (i = 0; i < PER_CONSUMER; ++i) {
uintptr_t value;
while (!(value = (uintptr_t)mpmc_ptr_ring_consume(td->ring))) {
if (need_resched())
schedule();
}
td->total += value;
++td->count;
}
up_read(td->sem);
return 0;
}
bool __init mpmc_ring_selftest(void)
{
struct worker_producer *producers;
struct worker_consumer *consumers;
struct mpmc_ptr_ring ring;
DECLARE_RWSEM(threads_done);
int64_t total = 0, count = 0;
int i;
producers = kmalloc_array(THREADS_PRODUCER, sizeof(*producers), GFP_KERNEL);
consumers = kmalloc_array(THREADS_CONSUMER, sizeof(*consumers), GFP_KERNEL);
BUG_ON(!producers || !consumers);
BUG_ON(mpmc_ptr_ring_init(&ring, QUEUE_SIZE, GFP_KERNEL));
for (i = 0; i < THREADS_PRODUCER; ++i) {
producers[i].ring = ˚
producers[i].thread_num = i;
producers[i].sem = &threads_done;
down_read(producers[i].sem);
kthread_run(producer_function, &producers[i], "producer %d", i);
}
for (i = 0; i < THREADS_CONSUMER; ++i) {
consumers[i].ring = ˚
consumers[i].total = 0;
consumers[i].count = 0;
consumers[i].sem = &threads_done;
down_read(consumers[i].sem);
kthread_run(consumer_function, &consumers[i], "consumer %d", i);
}
down_write(&threads_done);
BUG_ON(!mpmc_ptr_ring_empty(&ring));
mpmc_ptr_ring_cleanup(&ring, NULL);
for (i = 0; i < THREADS_CONSUMER; ++i) {
total += consumers[i].total;
count += consumers[i].count;
}
kfree(producers);
kfree(consumers);
if (count == ELEMENT_COUNT && total == EXPECTED_TOTAL) {
pr_info("mpmc_ring self-tests: pass");
return true;
}
pr_info("mpmc_ring self-test failed:");
pr_info("Count: %llu, expected: %llu", count, ELEMENT_COUNT);
pr_info("Total: %llu, expected: %llu", total, EXPECTED_TOTAL);
return false;
}
#endif
|
