File: fmutex.h

package info (click to toggle)
mariadb-10.0 10.0.32-0%2Bdeb8u1
  • links: PTS, VCS
  • area: main
  • in suites: jessie
  • size: 476,064 kB
  • sloc: cpp: 1,400,131; ansic: 832,140; perl: 54,391; sh: 41,304; pascal: 32,365; yacc: 14,921; xml: 5,257; sql: 4,667; cs: 4,647; makefile: 4,555; ruby: 4,465; python: 2,292; lex: 1,427; java: 941; asm: 295; awk: 54; php: 22; sed: 16
file content (144 lines) | stat: -rw-r--r-- 4,050 bytes parent folder | download | duplicates (3)
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
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
#ident "$Id$"
/*======
This file is part of PerconaFT.


Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.

    PerconaFT is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License, version 2,
    as published by the Free Software Foundation.

    PerconaFT 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 PerconaFT.  If not, see <http://www.gnu.org/licenses/>.

----------------------------------------

    PerconaFT is free software: you can redistribute it and/or modify
    it under the terms of the GNU Affero General Public License, version 3,
    as published by the Free Software Foundation.

    PerconaFT 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 Affero General Public License for more details.

    You should have received a copy of the GNU Affero General Public License
    along with PerconaFT.  If not, see <http://www.gnu.org/licenses/>.
======= */

#ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."

#pragma once

// fair mutex
struct fmutex {
    pthread_mutex_t mutex;
    int mutex_held;
    int num_want_mutex;
    struct queue_item *wait_head;
    struct queue_item *wait_tail;
};

// item on the queue
struct queue_item {
    pthread_cond_t *cond;
    struct queue_item *next;
};

static void enq_item(struct fmutex *fm, struct queue_item *const item) {
    assert(item->next == NULL);
    if (fm->wait_tail != NULL) {
        fm->wait_tail->next = item;
    } else {
        assert(fm->wait_head == NULL);
        fm->wait_head = item;
    }
    fm->wait_tail = item;
}

static pthread_cond_t *deq_item(struct fmutex *fm) {
    assert(fm->wait_head != NULL);
    assert(fm->wait_tail != NULL);
    struct queue_item *item = fm->wait_head;
    fm->wait_head = fm->wait_head->next;
    if (fm->wait_tail == item) {
        fm->wait_tail = NULL;
    }
    return item->cond;
}

void fmutex_create(struct fmutex *fm) {
    pthread_mutex_init(&fm->mutex, NULL);
    fm->mutex_held = 0;
    fm->num_want_mutex = 0;
    fm->wait_head = NULL;
    fm->wait_tail = NULL;
}

void fmutex_destroy(struct fmutex *fm) {
    pthread_mutex_destroy(&fm->mutex);
}

// Prerequisite: Holds m_mutex.
void fmutex_lock(struct fmutex *fm) {
    pthread_mutex_lock(&fm->mutex);

    if (fm->mutex_held == 0 || fm->num_want_mutex == 0) {
        // No one holds the lock.  Grant the write lock.
        fm->mutex_held = 1;
        return;
    }

    pthread_cond_t cond;
    pthread_cond_init(&cond, NULL);
    struct queue_item item = { .cond = &cond, .next = NULL };
    enq_item(fm, &item);

    // Wait for our turn.
    ++fm->num_want_mutex;
    pthread_cond_wait(&cond, &fm->mutex);
    pthread_cond_destroy(&cond);

    // Now it's our turn.
    assert(fm->num_want_mutex > 0);
    assert(fm->mutex_held == 0);

    // Not waiting anymore; grab the lock.
    --fm->num_want_mutex;
    fm->mutex_held = 1;

    pthread_mutex_unlock();
}

void fmutex_mutex_unlock(struct fmutex *fm) {
    pthread_mutex_lock();

    fm->mutex_held = 0;
    if (fm->wait_head == NULL) {
        assert(fm->num_want_mutex == 0);
        return;
    }
    assert(fm->num_want_mutex > 0);

    // Grant lock to the next waiter
    pthread_cond_t *cond = deq_item(fm);
    pthread_cond_signal(cond);

    pthread_mutex_unlock();
}

int fmutex_users(struct fmutex *fm) const {
    return fm->mutex_held + fm->num_want_mutex;
}

int fmutex_blocked_users(struct fmutex *fm) const {
    return fm->num_want_mutex;
}