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
|
// -*- 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_SCATTERLOCK_H
#define CEPH_SCATTERLOCK_H
#include "SimpleLock.h"
class ScatterLock : public SimpleLock {
struct more_bits_t {
bool dirty, flushing;
bool scatter_wanted;
utime_t last_scatter;
xlist<ScatterLock*>::item item_updated;
utime_t update_stamp;
more_bits_t(ScatterLock *lock) :
dirty(false), flushing(false), scatter_wanted(false),
item_updated(lock)
{}
bool empty() {
return dirty == false &&
flushing == false &&
scatter_wanted == false &&
!item_updated.is_on_list();
}
};
more_bits_t *_more;
bool have_more() { return _more ? true : false; }
void try_clear_more() {
if (_more && _more->empty()) {
delete _more;
_more = NULL;
}
}
more_bits_t *more() {
if (!_more)
_more = new more_bits_t(this);
return _more;
}
public:
ScatterLock(MDSCacheObject *o, LockType *lt) :
SimpleLock(o, lt), _more(NULL)
{}
~ScatterLock() {
if (_more) {
_more->item_updated.remove_myself(); // FIXME this should happen sooner, i think...
delete _more;
}
}
xlist<ScatterLock*>::item *get_updated_item() { return &more()->item_updated; }
utime_t get_update_stamp() { return more()->update_stamp; }
void set_update_stamp(utime_t t) { more()->update_stamp = t; }
void set_scatter_wanted() {
more()->scatter_wanted = true;
}
void clear_scatter_wanted() {
if (have_more())
_more->scatter_wanted = false;
}
bool get_scatter_wanted() {
return have_more() ? _more->scatter_wanted : false;
}
bool is_dirty() {
return have_more() ? _more->dirty : false;
}
bool is_flushing() {
return have_more() ? _more->flushing : false;
}
void mark_dirty() {
if (!more()->dirty) {
if (!_more->flushing)
parent->get(MDSCacheObject::PIN_DIRTYSCATTERED);
_more->dirty = true;
}
}
void start_flush() {
more()->flushing |= more()->dirty;
more()->dirty = false;
}
void finish_flush() {
if (more()->flushing) {
_more->flushing = false;
if (!_more->dirty) {
parent->put(MDSCacheObject::PIN_DIRTYSCATTERED);
parent->clear_dirty_scattered(get_type());
}
}
}
void clear_dirty() {
start_flush();
finish_flush();
}
void set_last_scatter(utime_t t) { more()->last_scatter = t; }
utime_t get_last_scatter() { return more()->last_scatter; }
void infer_state_from_strong_rejoin(int rstate, bool locktoo) {
if (rstate == LOCK_MIX ||
rstate == LOCK_MIX_LOCK || // replica still has wrlocks?
rstate == LOCK_MIX_SYNC || // "
rstate == LOCK_MIX_TSYN) // "
state = LOCK_MIX;
else if (locktoo && rstate == LOCK_LOCK)
state = LOCK_LOCK;
}
void print(ostream& out) {
out << "(";
_print(out);
if (is_dirty())
out << " dirty";
if (is_flushing())
out << " flushing";
out << ")";
}
};
#endif
|