summaryrefslogtreecommitdiff
path: root/kern/llsync.c
blob: d2471b4e74e23beb2e6fedd7e8d38c5edba447dd (plain)
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
/*
 * Copyright (c) 2013 Richard Braun.
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 *
 * The method used by this module is described in the expired US patent 
 * 4809168, "Passive Serialization in a Multitasking Environment". It is
 * similar to "Classic RCU (Read-Copy Update)" as found in Linux 2.6, with
 * the notable difference that RCU actively starts grace periods, where
 * passive serialization waits for two sequential "multiprocess checkpoints"
 * (renamed global checkpoints in this implementation) to occur.
 *
 * It is used instead of RCU because of patents that may not allow writing
 * an implementation not based on the Linux code (see
 * http://lists.lttng.org/pipermail/lttng-dev/2013-May/020305.html). As
 * patents expire, this module could be reworked to become a true RCU
 * implementation. In the mean time, the module interface was carefully
 * designed to be compatible with RCU.
 *
 * TODO Implement and use generic worker threads.
 *
 * TODO Gracefully handle large amounts of deferred works.
 */

#include <kern/bitmap.h>
#include <kern/condition.h>
#include <kern/list.h>
#include <kern/llsync.h>
#include <kern/llsync_i.h>
#include <kern/macros.h>
#include <kern/mutex.h>
#include <kern/panic.h>
#include <kern/param.h>
#include <kern/printk.h>
#include <kern/spinlock.h>
#include <kern/stddef.h>
#include <kern/thread.h>
#include <machine/cpu.h>

#define LLSYNC_NR_WORKS_WARN 10000

struct llsync_cpu llsync_cpus[MAX_CPUS];

/*
 * Global lock protecting the remaining module data.
 *
 * Interrupts must be disabled when acquiring this lock.
 */
static struct spinlock llsync_lock;

/*
 * Map of processors regularly checking in.
 */
static BITMAP_DECLARE(llsync_registered_cpus, MAX_CPUS);
static unsigned int llsync_nr_registered_cpus;

/*
 * Map of processors for which a checkpoint commit is pending.
 *
 * To reduce contention, checking in only affects a single per-processor
 * cache line. Special events (currently the system timer interrupt only)
 * trigger checkpoint commits, which report the local state to this bitmap,
 * thereby acquiring the global lock.
 */
static BITMAP_DECLARE(llsync_pending_checkpoints, MAX_CPUS);
static unsigned int llsync_nr_pending_checkpoints;

/*
 * List of deferred works.
 *
 * The list number matches the number of global checkpoints that occurred
 * since works contained in it were added, except list2 for which it's two
 * or more.
 */
static struct list llsync_list0;
static struct list llsync_list1;
static struct list llsync_list2;

/*
 * Total number of deferred works.
 *
 * Mostly unused, except to monitor work processing.
 */
static unsigned long llsync_nr_works;

/*
 * Thread processing deferred works.
 */
static struct thread *llsync_worker;

struct llsync_waiter {
    struct llsync_work work;
    struct mutex lock;
    struct condition cond;
    int done;
};

static void
llsync_work(void *arg)
{
    struct llsync_work *work ;
    struct list tmp;
    unsigned long flags, nr_works;

    (void)arg;

    spinlock_lock_intr_save(&llsync_lock, &flags);

    for (;;) {
        while (list_empty(&llsync_list2))
            thread_sleep(&llsync_lock);

        list_set_head(&tmp, &llsync_list2);
        list_init(&llsync_list2);

        spinlock_unlock_intr_restore(&llsync_lock, flags);

        nr_works = 0;

        do {
            work = list_first_entry(&tmp, struct llsync_work, node);
            list_remove(&work->node);
            nr_works++;
            work->fn(work);
        } while (!list_empty(&tmp));

        spinlock_lock_intr_save(&llsync_lock, &flags);

        llsync_nr_works -= nr_works;
    }
}

void
llsync_setup(void)
{
    struct thread_attr attr;
    int error;

    spinlock_init(&llsync_lock);
    list_init(&llsync_list0);
    list_init(&llsync_list1);
    list_init(&llsync_list2);

    attr.task = NULL;
    attr.name = "x15_llsync_work";
    attr.policy = THREAD_SCHED_POLICY_TS;
    attr.priority = THREAD_SCHED_TS_PRIO_DEFAULT;
    attr.cpumap = NULL;
    error = thread_create(&llsync_worker, &attr, llsync_work, NULL);

    if (error)
        panic("llsync: unable to create worker thread");
}

static void
llsync_wakeup_worker(void)
{
    if (thread_self() != llsync_worker)
        thread_wakeup(llsync_worker);
}

static void
llsync_process_global_checkpoint(unsigned int cpu)
{
    int i, nr_cpus;

    nr_cpus = cpu_count();
    bitmap_copy(llsync_pending_checkpoints, llsync_registered_cpus, nr_cpus);
    llsync_nr_pending_checkpoints = llsync_nr_registered_cpus;

    if (llsync_nr_registered_cpus == 0) {
        list_concat(&llsync_list1, &llsync_list0);
        list_init(&llsync_list0);
    }

    list_concat(&llsync_list2, &llsync_list1);
    list_set_head(&llsync_list1, &llsync_list0);
    list_init(&llsync_list0);

    llsync_reset_checkpoint(cpu);

    bitmap_for_each(llsync_registered_cpus, nr_cpus, i)
        if ((unsigned int)i != cpu)
            cpu_send_llsync_reset(i);

    if (!list_empty(&llsync_list2))
        llsync_wakeup_worker();
}

void
llsync_register_cpu(unsigned int cpu)
{
    unsigned long flags;

    spinlock_lock_intr_save(&llsync_lock, &flags);

    assert(!bitmap_test(llsync_registered_cpus, cpu));
    bitmap_set(llsync_registered_cpus, cpu);
    llsync_nr_registered_cpus++;

    if (llsync_nr_registered_cpus == 1)
        llsync_process_global_checkpoint(cpu);

    assert(!llsync_cpus[cpu].registered);
    llsync_cpus[cpu].registered = 1;

    spinlock_unlock_intr_restore(&llsync_lock, flags);
}

static void
llsync_commit_checkpoint_common(unsigned int cpu)
{
    int pending;

    pending = bitmap_test(llsync_pending_checkpoints, cpu);

    if (!pending)
        return;

    bitmap_clear(llsync_pending_checkpoints, cpu);
    llsync_nr_pending_checkpoints--;

    if (llsync_nr_pending_checkpoints == 0)
        llsync_process_global_checkpoint(cpu);
}

void
llsync_unregister_cpu(unsigned int cpu)
{
    unsigned long flags;

    spinlock_lock_intr_save(&llsync_lock, &flags);

    assert(llsync_cpus[cpu].registered);
    llsync_cpus[cpu].registered = 0;

    assert(bitmap_test(llsync_registered_cpus, cpu));
    bitmap_clear(llsync_registered_cpus, cpu);
    llsync_nr_registered_cpus--;

    llsync_commit_checkpoint_common(cpu);

    spinlock_unlock_intr_restore(&llsync_lock, flags);
}

void
llsync_commit_checkpoint(unsigned int cpu)
{
    assert(!cpu_intr_enabled());

    if (!(llsync_cpus[cpu].registered && llsync_cpus[cpu].checked))
        return;

    spinlock_lock(&llsync_lock);
    llsync_commit_checkpoint_common(cpu);
    spinlock_unlock(&llsync_lock);
}

void
llsync_defer(struct llsync_work *work, llsync_fn_t fn)
{
    unsigned long flags;

    work->fn = fn;

    spinlock_lock_intr_save(&llsync_lock, &flags);

    list_insert_tail(&llsync_list0, &work->node);
    llsync_nr_works++;

    if (llsync_nr_works == LLSYNC_NR_WORKS_WARN)
        printk("llsync: warning: large number of deferred works\n");

    spinlock_unlock_intr_restore(&llsync_lock, flags);
}

static void
llsync_signal(struct llsync_work *work)
{
    struct llsync_waiter *waiter;

    waiter = structof(work, struct llsync_waiter, work);

    mutex_lock(&waiter->lock);
    waiter->done = 1;
    condition_signal(&waiter->cond);
    mutex_unlock(&waiter->lock);
}

void
llsync_wait(void)
{
    struct llsync_waiter waiter;

    mutex_init(&waiter.lock);
    condition_init(&waiter.cond);
    waiter.done = 0;

    llsync_defer(&waiter.work, llsync_signal);

    mutex_lock(&waiter.lock);

    while (!waiter.done)
        condition_wait(&waiter.cond, &waiter.lock);

    mutex_unlock(&waiter.lock);
}