-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMOSDPGQuery.h
More file actions
103 lines (92 loc) · 2.66 KB
/
Copy pathMOSDPGQuery.h
File metadata and controls
103 lines (92 loc) · 2.66 KB
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
// -*- 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 <[email protected]>
*
* 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_MOSDPGQUERY_H
#define CEPH_MOSDPGQUERY_H
#include "common/hobject.h"
#include "msg/Message.h"
/*
* PGQuery - query another OSD as to the contents of their PGs
*/
class MOSDPGQuery : public Message {
static const int HEAD_VERSION = 3;
static const int COMPAT_VERSION = 1;
version_t epoch;
public:
version_t get_epoch() { return epoch; }
map<spg_t, pg_query_t> pg_list;
MOSDPGQuery() : Message(MSG_OSD_PG_QUERY,
HEAD_VERSION,
COMPAT_VERSION) {}
MOSDPGQuery(epoch_t e, map<spg_t,pg_query_t>& ls) :
Message(MSG_OSD_PG_QUERY,
HEAD_VERSION,
COMPAT_VERSION),
epoch(e) {
pg_list.swap(ls);
}
private:
~MOSDPGQuery() {}
public:
const char *get_type_name() const { return "pg_query"; }
void print(ostream& out) const {
out << "pg_query(";
for (map<spg_t,pg_query_t>::const_iterator p = pg_list.begin();
p != pg_list.end(); ++p) {
if (p != pg_list.begin())
out << ",";
out << p->first;
}
out << " epoch " << epoch << ")";
}
void encode_payload(uint64_t features) {
::encode(epoch, payload);
vector<pair<pg_t, pg_query_t> > _pg_list;
_pg_list.reserve(pg_list.size());
vector<shard_id_t> _shard_list;
_shard_list.reserve(pg_list.size());
for (map<spg_t, pg_query_t>::iterator i = pg_list.begin();
i != pg_list.end();
++i) {
_pg_list.push_back(make_pair(i->first.pgid, i->second));
_shard_list.push_back(i->first.shard);
}
::encode(_pg_list, payload, features);
::encode(_shard_list, payload);
}
void decode_payload() {
bufferlist::iterator p = payload.begin();
::decode(epoch, p);
vector<pair<pg_t, pg_query_t> > _pg_list;
::decode(_pg_list, p);
vector<shard_id_t> _shard_list(_pg_list.size(), shard_id_t::NO_SHARD);
if (header.version >= 3) {
_shard_list.clear();
::decode(_shard_list, p);
}
assert(_pg_list.size() == _shard_list.size());
for (unsigned i = 0; i < _pg_list.size(); ++i) {
pg_list.insert(
make_pair(
spg_t(_pg_list[i].first, _shard_list[i]), _pg_list[i].second));
}
if (header.version < 2) {
for (map<spg_t, pg_query_t>::iterator i = pg_list.begin();
i != pg_list.end();
++i) {
i->second.epoch_sent = epoch;
}
}
}
};
#endif