blob: 426b9150ea60d44541d5d5eb703fcd7da2e00d90 (
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
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
|
// -*- 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 "MDS.h"
#include "include/types.h"
#include "common/config.h"
#define dout_subsys ceph_subsys_mds
#undef dout_prefix
#define dout_prefix *_dout << "mds." << mds->get_nodeid() << "." << table_name << ": "
void InoTable::reset_state()
{
// use generic range. FIXME THIS IS CRAP
free.clear();
//#ifdef __LP64__
uint64_t start = (uint64_t)(mds->get_nodeid()+1) << 40;
uint64_t end = ((uint64_t)(mds->get_nodeid()+2) << 40) - 1;
//#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, end);
projected_free = free;
}
inodeno_t InoTable::project_alloc_id(inodeno_t id)
{
dout(10) << "project_alloc_id " << id << " to " << projected_free << "/" << free << dendl;
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)
{
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(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(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)
{
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 << "\n";
}
projected_version = ++version;
}
void InoTable::replay_alloc_ids(interval_set<inodeno_t>& ids)
{
dout(10) << "replay_alloc_ids " << ids << dendl;
interval_set<inodeno_t> is;
is.intersection_of(free, ids);
if (is == ids) {
free.subtract(ids);
projected_free.subtract(ids);
} else {
mds->clog.error() << "journal replay alloc " << ids << ", only "
<< is << " is in free " << free << "\n";
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();
inodeno_t last = first + i;
interval_set<inodeno_t> s;
s.insert(first, last);
s.intersection_of(free);
free.subtract(s);
projected_free = free;
projected_version = ++version;
dout(10) << "skip_inos now " << free << dendl;
}
|
