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
|
// -*- 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_MMONELECTION_H
#define CEPH_MMONELECTION_H
#include "common/ceph_releases.h"
#include "msg/Message.h"
#include "mon/MonMap.h"
#include "mon/mon_types.h"
class MMonElection final : public Message {
private:
static constexpr int HEAD_VERSION = 9;
static constexpr int COMPAT_VERSION = 5;
public:
static constexpr int OP_PROPOSE = 1;
static constexpr int OP_ACK = 2;
static constexpr int OP_NAK = 3;
static constexpr int OP_VICTORY = 4;
static const char *get_opname(int o) {
switch (o) {
case OP_PROPOSE: return "propose";
case OP_ACK: return "ack";
case OP_NAK: return "nak";
case OP_VICTORY: return "victory";
default: ceph_abort(); return 0;
}
}
uuid_d fsid;
int32_t op;
epoch_t epoch;
ceph::buffer::list monmap_bl;
std::set<int32_t> quorum;
uint64_t quorum_features;
mon_feature_t mon_features;
ceph_release_t mon_release{ceph_release_t::unknown};
ceph::buffer::list sharing_bl;
ceph::buffer::list scoring_bl;
uint8_t strategy;
std::map<std::string,std::string> metadata;
MMonElection() : Message{MSG_MON_ELECTION, HEAD_VERSION, COMPAT_VERSION},
op(0), epoch(0),
quorum_features(0),
mon_features(0),
strategy(0)
{ }
MMonElection(int o, epoch_t e, const bufferlist& bl, uint8_t s, MonMap *m)
: Message{MSG_MON_ELECTION, HEAD_VERSION, COMPAT_VERSION},
fsid(m->fsid), op(o), epoch(e),
quorum_features(0),
mon_features(0), scoring_bl(bl), strategy(s)
{
// encode using full feature set; we will reencode for dest later,
// if necessary
m->encode(monmap_bl, CEPH_FEATURES_ALL);
}
private:
~MMonElection() final {}
public:
std::string_view get_type_name() const override { return "election"; }
void print(std::ostream& out) const override {
out << "election(" << fsid << " " << get_opname(op)
<< " rel " << (int)mon_release << " e" << epoch << ")";
}
void encode_payload(uint64_t features) override {
using ceph::encode;
if (monmap_bl.length() && (features != CEPH_FEATURES_ALL)) {
// reencode old-format monmap
MonMap t;
t.decode(monmap_bl);
monmap_bl.clear();
t.encode(monmap_bl, features);
}
encode(fsid, payload);
encode(op, payload);
encode(epoch, payload);
encode(monmap_bl, payload);
encode(quorum, payload);
encode(quorum_features, payload);
encode((version_t)0, payload); // defunct
encode((version_t)0, payload); // defunct
encode(sharing_bl, payload);
encode(mon_features, payload);
encode(metadata, payload);
encode(mon_release, payload);
encode(scoring_bl, payload);
encode(strategy, payload);
}
void decode_payload() override {
using ceph::decode;
auto p = payload.cbegin();
decode(fsid, p);
decode(op, p);
decode(epoch, p);
decode(monmap_bl, p);
decode(quorum, p);
decode(quorum_features, p);
{
version_t v; // defunct fields from old encoding
decode(v, p);
decode(v, p);
}
decode(sharing_bl, p);
if (header.version >= 6)
decode(mon_features, p);
if (header.version >= 7)
decode(metadata, p);
if (header.version >= 8)
decode(mon_release, p);
else
mon_release = infer_ceph_release_from_mon_features(mon_features);
if (header.version >= 9) {
decode(scoring_bl, p);
decode(strategy, p);
} else {
strategy = MonMap::election_strategy::CLASSIC;
}
}
private:
template<class T, typename... Args>
friend boost::intrusive_ptr<T> ceph::make_message(Args&&... args);
};
#endif
|
