Merge tag 'mac80211-for-davem-2016-09-13' of git://git.kernel.org/pub/scm/linux/kerne...
[deliverable/linux.git] / fs / ceph / mdsmap.c
CommitLineData
3d14c5d2 1#include <linux/ceph/ceph_debug.h>
2f2dc053
SW
2
3#include <linux/bug.h>
4#include <linux/err.h>
5#include <linux/random.h>
6#include <linux/slab.h>
7#include <linux/types.h>
8
3d14c5d2
YS
9#include <linux/ceph/mdsmap.h>
10#include <linux/ceph/messenger.h>
11#include <linux/ceph/decode.h>
2f2dc053
SW
12
13#include "super.h"
14
15
16/*
17 * choose a random mds that is "up" (i.e. has a state > 0), or -1.
18 */
19int ceph_mdsmap_get_random_mds(struct ceph_mdsmap *m)
20{
21 int n = 0;
22 int i;
a84cd293
SL
23
24 /* special case for one mds */
25 if (1 == m->m_max_mds && m->m_info[0].state > 0)
26 return 0;
2f2dc053
SW
27
28 /* count */
29 for (i = 0; i < m->m_max_mds; i++)
30 if (m->m_info[i].state > 0)
31 n++;
32 if (n == 0)
33 return -1;
34
35 /* pick */
a84cd293 36 n = prandom_u32() % n;
2f2dc053
SW
37 i = 0;
38 for (i = 0; n > 0; i++, n--)
39 while (m->m_info[i].state <= 0)
40 i++;
41
42 return i;
43}
44
45/*
46 * Decode an MDS map
47 *
48 * Ignore any fields we don't care about (there are quite a few of
49 * them).
50 */
51struct ceph_mdsmap *ceph_mdsmap_decode(void **p, void *end)
52{
53 struct ceph_mdsmap *m;
9ec7cab1 54 const void *start = *p;
2f2dc053
SW
55 int i, j, n;
56 int err = -EINVAL;
d463a43d 57 u8 mdsmap_v, mdsmap_cv;
2f2dc053
SW
58
59 m = kzalloc(sizeof(*m), GFP_NOFS);
60 if (m == NULL)
61 return ERR_PTR(-ENOMEM);
62
d463a43d
YZ
63 ceph_decode_need(p, end, 1 + 1, bad);
64 mdsmap_v = ceph_decode_8(p);
65 mdsmap_cv = ceph_decode_8(p);
66 if (mdsmap_v >= 4) {
67 u32 mdsmap_len;
68 ceph_decode_32_safe(p, end, mdsmap_len, bad);
69 if (end < *p + mdsmap_len)
70 goto bad;
71 end = *p + mdsmap_len;
4f6a7e5e 72 }
2f2dc053
SW
73
74 ceph_decode_need(p, end, 8*sizeof(u32) + sizeof(u64), bad);
c89136ea
SW
75 m->m_epoch = ceph_decode_32(p);
76 m->m_client_epoch = ceph_decode_32(p);
77 m->m_last_failure = ceph_decode_32(p);
78 m->m_root = ceph_decode_32(p);
79 m->m_session_timeout = ceph_decode_32(p);
80 m->m_session_autoclose = ceph_decode_32(p);
81 m->m_max_file_size = ceph_decode_64(p);
82 m->m_max_mds = ceph_decode_32(p);
2f2dc053
SW
83
84 m->m_info = kcalloc(m->m_max_mds, sizeof(*m->m_info), GFP_NOFS);
85 if (m->m_info == NULL)
86 goto badmem;
87
88 /* pick out active nodes from mds_info (state > 0) */
c89136ea 89 n = ceph_decode_32(p);
2f2dc053 90 for (i = 0; i < n; i++) {
94045e11 91 u64 global_id;
2f2dc053
SW
92 u32 namelen;
93 s32 mds, inc, state;
94 u64 state_seq;
d463a43d
YZ
95 u8 info_v;
96 void *info_end = NULL;
2f2dc053
SW
97 struct ceph_entity_addr addr;
98 u32 num_export_targets;
99 void *pexport_targets = NULL;
0deb01c9 100 struct ceph_timespec laggy_since;
6af86528 101 struct ceph_mds_info *info;
2f2dc053 102
d463a43d 103 ceph_decode_need(p, end, sizeof(u64) + 1, bad);
94045e11 104 global_id = ceph_decode_64(p);
d463a43d
YZ
105 info_v= ceph_decode_8(p);
106 if (info_v >= 4) {
107 u32 info_len;
108 u8 info_cv;
109 ceph_decode_need(p, end, 1 + sizeof(u32), bad);
110 info_cv = ceph_decode_8(p);
111 info_len = ceph_decode_32(p);
112 info_end = *p + info_len;
113 if (info_end > end)
114 goto bad;
115 }
116
117 ceph_decode_need(p, end, sizeof(u64) + sizeof(u32), bad);
94045e11 118 *p += sizeof(u64);
c89136ea 119 namelen = ceph_decode_32(p); /* skip mds name */
2f2dc053
SW
120 *p += namelen;
121
122 ceph_decode_need(p, end,
e251e288 123 4*sizeof(u32) + sizeof(u64) +
2f2dc053
SW
124 sizeof(addr) + sizeof(struct ceph_timespec),
125 bad);
c89136ea
SW
126 mds = ceph_decode_32(p);
127 inc = ceph_decode_32(p);
128 state = ceph_decode_32(p);
129 state_seq = ceph_decode_64(p);
94045e11
SW
130 ceph_decode_copy(p, &addr, sizeof(addr));
131 ceph_decode_addr(&addr);
0deb01c9 132 ceph_decode_copy(p, &laggy_since, sizeof(laggy_since));
2f2dc053
SW
133 *p += sizeof(u32);
134 ceph_decode_32_safe(p, end, namelen, bad);
e251e288 135 *p += namelen;
d463a43d 136 if (info_v >= 2) {
2f2dc053
SW
137 ceph_decode_32_safe(p, end, num_export_targets, bad);
138 pexport_targets = *p;
e251e288 139 *p += num_export_targets * sizeof(u32);
2f2dc053
SW
140 } else {
141 num_export_targets = 0;
142 }
143
d463a43d
YZ
144 if (info_end && *p != info_end) {
145 if (*p > info_end)
146 goto bad;
147 *p = info_end;
148 }
149
94045e11 150 dout("mdsmap_decode %d/%d %lld mds%d.%d %s %s\n",
3d14c5d2
YS
151 i+1, n, global_id, mds, inc,
152 ceph_pr_addr(&addr.in_addr),
2f2dc053 153 ceph_mds_state_name(state));
6af86528
DC
154
155 if (mds < 0 || mds >= m->m_max_mds || state <= 0)
156 continue;
157
158 info = &m->m_info[mds];
159 info->global_id = global_id;
160 info->state = state;
161 info->addr = addr;
162 info->laggy = (laggy_since.tv_sec != 0 ||
163 laggy_since.tv_nsec != 0);
164 info->num_export_targets = num_export_targets;
165 if (num_export_targets) {
166 info->export_targets = kcalloc(num_export_targets,
167 sizeof(u32), GFP_NOFS);
168 if (info->export_targets == NULL)
169 goto badmem;
170 for (j = 0; j < num_export_targets; j++)
171 info->export_targets[j] =
172 ceph_decode_32(&pexport_targets);
173 } else {
174 info->export_targets = NULL;
2f2dc053
SW
175 }
176 }
177
178 /* pg_pools */
179 ceph_decode_32_safe(p, end, n, bad);
180 m->m_num_data_pg_pools = n;
4f6a7e5e 181 m->m_data_pg_pools = kcalloc(n, sizeof(u64), GFP_NOFS);
2f2dc053
SW
182 if (!m->m_data_pg_pools)
183 goto badmem;
4f6a7e5e 184 ceph_decode_need(p, end, sizeof(u64)*(n+1), bad);
2f2dc053 185 for (i = 0; i < n; i++)
4f6a7e5e
SW
186 m->m_data_pg_pools[i] = ceph_decode_64(p);
187 m->m_cas_pg_pool = ceph_decode_64(p);
2f2dc053
SW
188
189 /* ok, we don't care about the rest. */
d463a43d 190 *p = end;
2f2dc053
SW
191 dout("mdsmap_decode success epoch %u\n", m->m_epoch);
192 return m;
193
194badmem:
195 err = -ENOMEM;
196bad:
197 pr_err("corrupt mdsmap\n");
9ec7cab1
SW
198 print_hex_dump(KERN_DEBUG, "mdsmap: ",
199 DUMP_PREFIX_OFFSET, 16, 1,
200 start, end - start, true);
2f2dc053 201 ceph_mdsmap_destroy(m);
c213b50b 202 return ERR_PTR(err);
2f2dc053
SW
203}
204
205void ceph_mdsmap_destroy(struct ceph_mdsmap *m)
206{
207 int i;
208
209 for (i = 0; i < m->m_max_mds; i++)
210 kfree(m->m_info[i].export_targets);
211 kfree(m->m_info);
212 kfree(m->m_data_pg_pools);
213 kfree(m);
214}
This page took 0.333307 seconds and 5 git commands to generate.