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
|
// -*- 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.
*
*/
#include "InoTable.h"
#include "MDSRank.h"
#include "include/types.h"
#include "common/config.h"
#define dout_context g_ceph_context
#define dout_subsys ceph_subsys_mds
#undef dout_prefix
#define dout_prefix *_dout << "mds." << rank << "." << table_name << ": "
void InoTable::reset_state()
{
// use generic range. FIXME THIS IS CRAP
free.clear();
//#ifdef __LP64__
uint64_t start = (uint64_t)(rank+1) << 40;
uint64_t len = (uint64_t)1 << 40;
//#else
//# warning this looks like a 32-bit system, using small inode numbers.
// uint64_t start = (uint64_t)(mds->get_nodeid()+1) << 25;
// uint64_t end = ((uint64_t)(mds->get_nodeid()+2) << 25) - 1;
//#endif
free.insert(start, len);
projected_free = free;
}
inodeno_t InoTable::project_alloc_id(inodeno_t id)
{
dout(10) << "project_alloc_id " << id << " to " << projected_free << "/" << free << dendl;
ceph_assert(is_active());
if (!id)
id = projected_free.range_start();
projected_free.erase(id);
++projected_version;
return id;
}
void InoTable::apply_alloc_id(inodeno_t id)
{
dout(10) << "apply_alloc_id " << id << " to " << projected_free << "/" << free << dendl;
free.erase(id);
++version;
}
void InoTable::project_alloc_ids(interval_set<inodeno_t>& ids, int want)
{
ceph_assert(is_active());
while (want > 0) {
inodeno_t start = projected_free.range_start();
inodeno_t end = projected_free.end_after(start);
inodeno_t num = end - start;
if (num > (inodeno_t)want)
num = want;
projected_free.erase(start, num);
ids.insert(start, num);
want -= num;
}
dout(10) << "project_alloc_ids " << ids << " to " << projected_free << "/" << free << dendl;
++projected_version;
}
void InoTable::apply_alloc_ids(interval_set<inodeno_t>& ids)
{
dout(10) << "apply_alloc_ids " << ids << " to " << projected_free << "/" << free << dendl;
free.subtract(ids);
++version;
}
void InoTable::project_release_ids(const interval_set<inodeno_t>& ids)
{
dout(10) << "project_release_ids " << ids << " to " << projected_free << "/" << free << dendl;
projected_free.insert(ids);
++projected_version;
}
void InoTable::apply_release_ids(const interval_set<inodeno_t>& ids)
{
dout(10) << "apply_release_ids " << ids << " to " << projected_free << "/" << free << dendl;
free.insert(ids);
++version;
}
//
void InoTable::replay_alloc_id(inodeno_t id)
{
ceph_assert(mds); // Only usable in online mode
dout(10) << "replay_alloc_id " << id << dendl;
if (free.contains(id)) {
free.erase(id);
projected_free.erase(id);
} else {
mds->clog->error() << "journal replay alloc " << id
<< " not in free " << free;
}
projected_version = ++version;
}
void InoTable::replay_alloc_ids(interval_set<inodeno_t>& ids)
{
ceph_assert(mds); // Only usable in online mode
dout(10) << "replay_alloc_ids " << ids << dendl;
interval_set<inodeno_t> is;
is.intersection_of(free, ids);
if (!(is==ids)) {
mds->clog->error() << "journal replay alloc " << ids << ", only "
<< is << " is in free " << free;
}
free.subtract(is);
projected_free.subtract(is);
projected_version = ++version;
}
void InoTable::replay_release_ids(interval_set<inodeno_t>& ids)
{
dout(10) << "replay_release_ids " << ids << dendl;
free.insert(ids);
projected_free.insert(ids);
projected_version = ++version;
}
void InoTable::replay_reset()
{
dout(10) << "replay_reset " << free << dendl;
skip_inos(inodeno_t(10000000)); // a lot!
projected_free = free;
projected_version = ++version;
}
void InoTable::skip_inos(inodeno_t i)
{
dout(10) << "skip_inos was " << free << dendl;
inodeno_t first = free.range_start();
interval_set<inodeno_t> s;
s.insert(first, i);
s.intersection_of(free);
free.subtract(s);
projected_free = free;
projected_version = ++version;
dout(10) << "skip_inos now " << free << dendl;
}
void InoTable::dump(Formatter *f) const
{
f->open_object_section("inotable");
f->open_array_section("projected_free");
for (interval_set<inodeno_t>::const_iterator i = projected_free.begin(); i != projected_free.end(); ++i) {
f->open_object_section("range");
f->dump_int("start", (*i).first);
f->dump_int("len", (*i).second);
f->close_section();
}
f->close_section();
f->open_array_section("free");
for (interval_set<inodeno_t>::const_iterator i = free.begin(); i != free.end(); ++i) {
f->open_object_section("range");
f->dump_int("start", (*i).first);
f->dump_int("len", (*i).second);
f->close_section();
}
f->close_section();
f->close_section();
}
void InoTable::generate_test_instances(std::list<InoTable*>& ls)
{
ls.push_back(new InoTable());
}
bool InoTable::is_marked_free(inodeno_t id) const
{
return free.contains(id) || projected_free.contains(id);
}
bool InoTable::intersects_free(
const interval_set<inodeno_t> &other,
interval_set<inodeno_t> *intersection)
{
interval_set<inodeno_t> i;
i.intersection_of(free, other);
if (intersection != nullptr) {
*intersection = i;
}
return !(i.empty());
}
bool InoTable::repair(inodeno_t id)
{
if (projected_version != version) {
// Can't do the repair while other things are in flight
return false;
}
ceph_assert(is_marked_free(id));
dout(10) << "repair: before status. ino = " << id << " pver =" << projected_version << " ver= " << version << dendl;
free.erase(id);
projected_free.erase(id);
projected_version = ++version;
dout(10) << "repair: after status. ino = " << id << " pver =" << projected_version << " ver= " << version << dendl;
return true;
}
bool InoTable::force_consume_to(inodeno_t ino)
{
inodeno_t first = free.range_start();
if (first > ino)
return false;
skip_inos(inodeno_t(ino + 1 - first));
return true;
}
|
