blob: cf81dfd514e7eed460e036d9a84e812700cbb9cc (
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
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#ifndef CEPH_MUTEX_H
#define CEPH_MUTEX_H
#include <pthread.h>
#include "include/assert.h"
#include "common/lockdep.h"
#include "common/ceph_context.h"
using namespace ceph;
class PerfCounters;
enum {
l_mutex_first = 999082,
l_mutex_wait,
l_mutex_last
};
class Mutex {
private:
const char *name;
int id;
bool recursive;
bool lockdep;
bool backtrace; // gather backtrace on lock acquisition
pthread_mutex_t _m;
int nlock;
pthread_t locked_by;
CephContext *cct;
PerfCounters *logger;
// don't allow copying.
void operator=(Mutex &M) {}
Mutex( const Mutex &M ) {}
void _register() {
id = lockdep_register(name);
}
void _will_lock() { // about to lock
id = lockdep_will_lock(name, id);
}
void _locked() { // just locked
id = lockdep_locked(name, id, backtrace);
}
void _will_unlock() { // about to unlock
id = lockdep_will_unlock(name, id);
}
public:
Mutex(const char *n, bool r = false, bool ld=true, bool bt=false,
CephContext *cct = 0);
~Mutex();
bool is_locked() const {
return (nlock > 0);
}
bool is_locked_by_me() const {
return nlock > 0 && locked_by == pthread_self();
}
bool TryLock() {
int r = pthread_mutex_trylock(&_m);
if (r == 0) {
if (lockdep && g_lockdep) _locked();
_post_lock();
}
return r == 0;
}
void Lock(bool no_lockdep=false);
void _post_lock() {
if (!recursive) {
assert(nlock == 0);
locked_by = pthread_self();
};
nlock++;
}
void _pre_unlock() {
assert(nlock > 0);
--nlock;
if (!recursive) {
assert(locked_by == pthread_self());
locked_by = 0;
assert(nlock == 0);
}
}
void Unlock() {
_pre_unlock();
if (lockdep && g_lockdep) _will_unlock();
int r = pthread_mutex_unlock(&_m);
assert(r == 0);
}
friend class Cond;
public:
class Locker {
Mutex &mutex;
public:
Locker(Mutex& m) : mutex(m) {
mutex.Lock();
}
~Locker() {
mutex.Unlock();
}
};
};
#endif
|
