summaryrefslogtreecommitdiff
path: root/Kernel/Tasks/AtomicEdgeAction.h
blob: c80adcaa1da60ec6fa459baae882106b83206e34 (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
/*
 * Copyright (c) 2021, the SerenityOS developers.
 *
 * SPDX-License-Identifier: BSD-2-Clause
 */

#pragma once

#include <AK/Atomic.h>
#include <Kernel/Arch/Processor.h>

namespace Kernel {

template<typename AtomicRefCountType>
class AtomicEdgeAction {
public:
    template<typename FirstRefAction>
    bool ref(FirstRefAction first_ref_action)
    {
        AtomicRefCountType expected = 0;
        AtomicRefCountType desired = (1 << 1) | 1;
        // Least significant bit indicates we're busy protecting/unprotecting
        for (;;) {
            if (m_atomic_ref_count.compare_exchange_strong(expected, desired, AK::memory_order_relaxed))
                break;

            Processor::wait_check();

            expected &= ~1;
            desired = expected + (1 << 1);
            VERIFY(desired > expected);
            if (expected == 0)
                desired |= 1;
        }

        atomic_thread_fence(AK::memory_order_acquire);

        if (expected == 0) {
            first_ref_action();

            // drop the busy flag
            m_atomic_ref_count.store(desired & ~1, AK::memory_order_release);
            return true;
        }
        return false;
    }

    template<typename LastRefAction>
    bool unref(LastRefAction last_ref_action)
    {
        AtomicRefCountType expected = 1 << 1;
        AtomicRefCountType desired = (1 << 1) | 1;
        // Least significant bit indicates we're busy protecting/unprotecting
        for (;;) {
            if (m_atomic_ref_count.compare_exchange_strong(expected, desired, AK::memory_order_relaxed))
                break;

            Processor::wait_check();

            expected &= ~1;
            VERIFY(expected != 0); // Someone should always have at least one reference

            if (expected == 1 << 1) {
                desired = (1 << 1) | 1;
            } else {
                desired = expected - (1 << 1);
                VERIFY(desired < expected);
            }
        }

        AK::atomic_thread_fence(AK::memory_order_release);

        if (expected == 1 << 1) {
            last_ref_action();

            // drop the busy flag and release reference
            m_atomic_ref_count.store(0, AK::memory_order_release);
            return true;
        }
        return false;
    }

private:
    Atomic<AtomicRefCountType> m_atomic_ref_count { 0 };
};

}