Commit | Line | Data |
---|---|---|
f24e9980 | 1 | |
3d14c5d2 | 2 | #include <linux/ceph/ceph_debug.h> |
5a0e3ad6 | 3 | |
3d14c5d2 | 4 | #include <linux/module.h> |
5a0e3ad6 | 5 | #include <linux/slab.h> |
f24e9980 SW |
6 | #include <asm/div64.h> |
7 | ||
3d14c5d2 YS |
8 | #include <linux/ceph/libceph.h> |
9 | #include <linux/ceph/osdmap.h> | |
10 | #include <linux/ceph/decode.h> | |
11 | #include <linux/crush/hash.h> | |
12 | #include <linux/crush/mapper.h> | |
f24e9980 SW |
13 | |
14 | char *ceph_osdmap_state_str(char *str, int len, int state) | |
15 | { | |
f24e9980 | 16 | if (!len) |
1ec3911d | 17 | return str; |
f24e9980 | 18 | |
1ec3911d CD |
19 | if ((state & CEPH_OSD_EXISTS) && (state & CEPH_OSD_UP)) |
20 | snprintf(str, len, "exists, up"); | |
21 | else if (state & CEPH_OSD_EXISTS) | |
22 | snprintf(str, len, "exists"); | |
23 | else if (state & CEPH_OSD_UP) | |
24 | snprintf(str, len, "up"); | |
25 | else | |
f24e9980 | 26 | snprintf(str, len, "doesn't exist"); |
1ec3911d | 27 | |
f24e9980 SW |
28 | return str; |
29 | } | |
30 | ||
31 | /* maps */ | |
32 | ||
95c96174 | 33 | static int calc_bits_of(unsigned int t) |
f24e9980 SW |
34 | { |
35 | int b = 0; | |
36 | while (t) { | |
37 | t = t >> 1; | |
38 | b++; | |
39 | } | |
40 | return b; | |
41 | } | |
42 | ||
43 | /* | |
44 | * the foo_mask is the smallest value 2^n-1 that is >= foo. | |
45 | */ | |
46 | static void calc_pg_masks(struct ceph_pg_pool_info *pi) | |
47 | { | |
4f6a7e5e SW |
48 | pi->pg_num_mask = (1 << calc_bits_of(pi->pg_num-1)) - 1; |
49 | pi->pgp_num_mask = (1 << calc_bits_of(pi->pgp_num-1)) - 1; | |
f24e9980 SW |
50 | } |
51 | ||
52 | /* | |
53 | * decode crush map | |
54 | */ | |
55 | static int crush_decode_uniform_bucket(void **p, void *end, | |
56 | struct crush_bucket_uniform *b) | |
57 | { | |
58 | dout("crush_decode_uniform_bucket %p to %p\n", *p, end); | |
59 | ceph_decode_need(p, end, (1+b->h.size) * sizeof(u32), bad); | |
c89136ea | 60 | b->item_weight = ceph_decode_32(p); |
f24e9980 SW |
61 | return 0; |
62 | bad: | |
63 | return -EINVAL; | |
64 | } | |
65 | ||
66 | static int crush_decode_list_bucket(void **p, void *end, | |
67 | struct crush_bucket_list *b) | |
68 | { | |
69 | int j; | |
70 | dout("crush_decode_list_bucket %p to %p\n", *p, end); | |
71 | b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS); | |
72 | if (b->item_weights == NULL) | |
73 | return -ENOMEM; | |
74 | b->sum_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS); | |
75 | if (b->sum_weights == NULL) | |
76 | return -ENOMEM; | |
77 | ceph_decode_need(p, end, 2 * b->h.size * sizeof(u32), bad); | |
78 | for (j = 0; j < b->h.size; j++) { | |
c89136ea SW |
79 | b->item_weights[j] = ceph_decode_32(p); |
80 | b->sum_weights[j] = ceph_decode_32(p); | |
f24e9980 SW |
81 | } |
82 | return 0; | |
83 | bad: | |
84 | return -EINVAL; | |
85 | } | |
86 | ||
87 | static int crush_decode_tree_bucket(void **p, void *end, | |
88 | struct crush_bucket_tree *b) | |
89 | { | |
90 | int j; | |
91 | dout("crush_decode_tree_bucket %p to %p\n", *p, end); | |
82cd003a | 92 | ceph_decode_8_safe(p, end, b->num_nodes, bad); |
f24e9980 SW |
93 | b->node_weights = kcalloc(b->num_nodes, sizeof(u32), GFP_NOFS); |
94 | if (b->node_weights == NULL) | |
95 | return -ENOMEM; | |
96 | ceph_decode_need(p, end, b->num_nodes * sizeof(u32), bad); | |
97 | for (j = 0; j < b->num_nodes; j++) | |
c89136ea | 98 | b->node_weights[j] = ceph_decode_32(p); |
f24e9980 SW |
99 | return 0; |
100 | bad: | |
101 | return -EINVAL; | |
102 | } | |
103 | ||
104 | static int crush_decode_straw_bucket(void **p, void *end, | |
105 | struct crush_bucket_straw *b) | |
106 | { | |
107 | int j; | |
108 | dout("crush_decode_straw_bucket %p to %p\n", *p, end); | |
109 | b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS); | |
110 | if (b->item_weights == NULL) | |
111 | return -ENOMEM; | |
112 | b->straws = kcalloc(b->h.size, sizeof(u32), GFP_NOFS); | |
113 | if (b->straws == NULL) | |
114 | return -ENOMEM; | |
115 | ceph_decode_need(p, end, 2 * b->h.size * sizeof(u32), bad); | |
116 | for (j = 0; j < b->h.size; j++) { | |
c89136ea SW |
117 | b->item_weights[j] = ceph_decode_32(p); |
118 | b->straws[j] = ceph_decode_32(p); | |
f24e9980 SW |
119 | } |
120 | return 0; | |
121 | bad: | |
122 | return -EINVAL; | |
123 | } | |
124 | ||
958a2765 ID |
125 | static int crush_decode_straw2_bucket(void **p, void *end, |
126 | struct crush_bucket_straw2 *b) | |
127 | { | |
128 | int j; | |
129 | dout("crush_decode_straw2_bucket %p to %p\n", *p, end); | |
130 | b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS); | |
131 | if (b->item_weights == NULL) | |
132 | return -ENOMEM; | |
133 | ceph_decode_need(p, end, b->h.size * sizeof(u32), bad); | |
134 | for (j = 0; j < b->h.size; j++) | |
135 | b->item_weights[j] = ceph_decode_32(p); | |
136 | return 0; | |
137 | bad: | |
138 | return -EINVAL; | |
139 | } | |
140 | ||
546f04ef SW |
141 | static int skip_name_map(void **p, void *end) |
142 | { | |
143 | int len; | |
144 | ceph_decode_32_safe(p, end, len ,bad); | |
145 | while (len--) { | |
146 | int strlen; | |
147 | *p += sizeof(u32); | |
148 | ceph_decode_32_safe(p, end, strlen, bad); | |
149 | *p += strlen; | |
150 | } | |
151 | return 0; | |
152 | bad: | |
153 | return -EINVAL; | |
154 | } | |
155 | ||
f24e9980 SW |
156 | static struct crush_map *crush_decode(void *pbyval, void *end) |
157 | { | |
158 | struct crush_map *c; | |
159 | int err = -EINVAL; | |
160 | int i, j; | |
161 | void **p = &pbyval; | |
162 | void *start = pbyval; | |
163 | u32 magic; | |
546f04ef | 164 | u32 num_name_maps; |
f24e9980 SW |
165 | |
166 | dout("crush_decode %p to %p len %d\n", *p, end, (int)(end - *p)); | |
167 | ||
168 | c = kzalloc(sizeof(*c), GFP_NOFS); | |
169 | if (c == NULL) | |
170 | return ERR_PTR(-ENOMEM); | |
171 | ||
546f04ef SW |
172 | /* set tunables to default values */ |
173 | c->choose_local_tries = 2; | |
174 | c->choose_local_fallback_tries = 5; | |
175 | c->choose_total_tries = 19; | |
1604f488 | 176 | c->chooseleaf_descend_once = 0; |
546f04ef | 177 | |
f24e9980 | 178 | ceph_decode_need(p, end, 4*sizeof(u32), bad); |
c89136ea | 179 | magic = ceph_decode_32(p); |
f24e9980 SW |
180 | if (magic != CRUSH_MAGIC) { |
181 | pr_err("crush_decode magic %x != current %x\n", | |
95c96174 | 182 | (unsigned int)magic, (unsigned int)CRUSH_MAGIC); |
f24e9980 SW |
183 | goto bad; |
184 | } | |
c89136ea SW |
185 | c->max_buckets = ceph_decode_32(p); |
186 | c->max_rules = ceph_decode_32(p); | |
187 | c->max_devices = ceph_decode_32(p); | |
f24e9980 | 188 | |
f24e9980 SW |
189 | c->buckets = kcalloc(c->max_buckets, sizeof(*c->buckets), GFP_NOFS); |
190 | if (c->buckets == NULL) | |
191 | goto badmem; | |
192 | c->rules = kcalloc(c->max_rules, sizeof(*c->rules), GFP_NOFS); | |
193 | if (c->rules == NULL) | |
194 | goto badmem; | |
195 | ||
196 | /* buckets */ | |
197 | for (i = 0; i < c->max_buckets; i++) { | |
198 | int size = 0; | |
199 | u32 alg; | |
200 | struct crush_bucket *b; | |
201 | ||
202 | ceph_decode_32_safe(p, end, alg, bad); | |
203 | if (alg == 0) { | |
204 | c->buckets[i] = NULL; | |
205 | continue; | |
206 | } | |
207 | dout("crush_decode bucket %d off %x %p to %p\n", | |
208 | i, (int)(*p-start), *p, end); | |
209 | ||
210 | switch (alg) { | |
211 | case CRUSH_BUCKET_UNIFORM: | |
212 | size = sizeof(struct crush_bucket_uniform); | |
213 | break; | |
214 | case CRUSH_BUCKET_LIST: | |
215 | size = sizeof(struct crush_bucket_list); | |
216 | break; | |
217 | case CRUSH_BUCKET_TREE: | |
218 | size = sizeof(struct crush_bucket_tree); | |
219 | break; | |
220 | case CRUSH_BUCKET_STRAW: | |
221 | size = sizeof(struct crush_bucket_straw); | |
222 | break; | |
958a2765 ID |
223 | case CRUSH_BUCKET_STRAW2: |
224 | size = sizeof(struct crush_bucket_straw2); | |
225 | break; | |
f24e9980 | 226 | default: |
30dc6381 | 227 | err = -EINVAL; |
f24e9980 SW |
228 | goto bad; |
229 | } | |
230 | BUG_ON(size == 0); | |
231 | b = c->buckets[i] = kzalloc(size, GFP_NOFS); | |
232 | if (b == NULL) | |
233 | goto badmem; | |
234 | ||
235 | ceph_decode_need(p, end, 4*sizeof(u32), bad); | |
c89136ea SW |
236 | b->id = ceph_decode_32(p); |
237 | b->type = ceph_decode_16(p); | |
fb690390 SW |
238 | b->alg = ceph_decode_8(p); |
239 | b->hash = ceph_decode_8(p); | |
c89136ea SW |
240 | b->weight = ceph_decode_32(p); |
241 | b->size = ceph_decode_32(p); | |
f24e9980 SW |
242 | |
243 | dout("crush_decode bucket size %d off %x %p to %p\n", | |
244 | b->size, (int)(*p-start), *p, end); | |
245 | ||
246 | b->items = kcalloc(b->size, sizeof(__s32), GFP_NOFS); | |
247 | if (b->items == NULL) | |
248 | goto badmem; | |
249 | b->perm = kcalloc(b->size, sizeof(u32), GFP_NOFS); | |
250 | if (b->perm == NULL) | |
251 | goto badmem; | |
252 | b->perm_n = 0; | |
253 | ||
254 | ceph_decode_need(p, end, b->size*sizeof(u32), bad); | |
255 | for (j = 0; j < b->size; j++) | |
c89136ea | 256 | b->items[j] = ceph_decode_32(p); |
f24e9980 SW |
257 | |
258 | switch (b->alg) { | |
259 | case CRUSH_BUCKET_UNIFORM: | |
260 | err = crush_decode_uniform_bucket(p, end, | |
261 | (struct crush_bucket_uniform *)b); | |
262 | if (err < 0) | |
263 | goto bad; | |
264 | break; | |
265 | case CRUSH_BUCKET_LIST: | |
266 | err = crush_decode_list_bucket(p, end, | |
267 | (struct crush_bucket_list *)b); | |
268 | if (err < 0) | |
269 | goto bad; | |
270 | break; | |
271 | case CRUSH_BUCKET_TREE: | |
272 | err = crush_decode_tree_bucket(p, end, | |
273 | (struct crush_bucket_tree *)b); | |
274 | if (err < 0) | |
275 | goto bad; | |
276 | break; | |
277 | case CRUSH_BUCKET_STRAW: | |
278 | err = crush_decode_straw_bucket(p, end, | |
279 | (struct crush_bucket_straw *)b); | |
280 | if (err < 0) | |
281 | goto bad; | |
282 | break; | |
958a2765 ID |
283 | case CRUSH_BUCKET_STRAW2: |
284 | err = crush_decode_straw2_bucket(p, end, | |
285 | (struct crush_bucket_straw2 *)b); | |
286 | if (err < 0) | |
287 | goto bad; | |
288 | break; | |
f24e9980 SW |
289 | } |
290 | } | |
291 | ||
292 | /* rules */ | |
293 | dout("rule vec is %p\n", c->rules); | |
294 | for (i = 0; i < c->max_rules; i++) { | |
295 | u32 yes; | |
296 | struct crush_rule *r; | |
297 | ||
298 | ceph_decode_32_safe(p, end, yes, bad); | |
299 | if (!yes) { | |
300 | dout("crush_decode NO rule %d off %x %p to %p\n", | |
301 | i, (int)(*p-start), *p, end); | |
302 | c->rules[i] = NULL; | |
303 | continue; | |
304 | } | |
305 | ||
306 | dout("crush_decode rule %d off %x %p to %p\n", | |
307 | i, (int)(*p-start), *p, end); | |
308 | ||
309 | /* len */ | |
310 | ceph_decode_32_safe(p, end, yes, bad); | |
311 | #if BITS_PER_LONG == 32 | |
30dc6381 | 312 | err = -EINVAL; |
64486697 XW |
313 | if (yes > (ULONG_MAX - sizeof(*r)) |
314 | / sizeof(struct crush_rule_step)) | |
f24e9980 SW |
315 | goto bad; |
316 | #endif | |
317 | r = c->rules[i] = kmalloc(sizeof(*r) + | |
318 | yes*sizeof(struct crush_rule_step), | |
319 | GFP_NOFS); | |
320 | if (r == NULL) | |
321 | goto badmem; | |
322 | dout(" rule %d is at %p\n", i, r); | |
323 | r->len = yes; | |
324 | ceph_decode_copy_safe(p, end, &r->mask, 4, bad); /* 4 u8's */ | |
325 | ceph_decode_need(p, end, r->len*3*sizeof(u32), bad); | |
326 | for (j = 0; j < r->len; j++) { | |
c89136ea SW |
327 | r->steps[j].op = ceph_decode_32(p); |
328 | r->steps[j].arg1 = ceph_decode_32(p); | |
329 | r->steps[j].arg2 = ceph_decode_32(p); | |
f24e9980 SW |
330 | } |
331 | } | |
332 | ||
333 | /* ignore trailing name maps. */ | |
546f04ef SW |
334 | for (num_name_maps = 0; num_name_maps < 3; num_name_maps++) { |
335 | err = skip_name_map(p, end); | |
336 | if (err < 0) | |
337 | goto done; | |
338 | } | |
339 | ||
340 | /* tunables */ | |
341 | ceph_decode_need(p, end, 3*sizeof(u32), done); | |
342 | c->choose_local_tries = ceph_decode_32(p); | |
343 | c->choose_local_fallback_tries = ceph_decode_32(p); | |
344 | c->choose_total_tries = ceph_decode_32(p); | |
b9b519b7 | 345 | dout("crush decode tunable choose_local_tries = %d\n", |
546f04ef | 346 | c->choose_local_tries); |
b9b519b7 | 347 | dout("crush decode tunable choose_local_fallback_tries = %d\n", |
546f04ef | 348 | c->choose_local_fallback_tries); |
b9b519b7 | 349 | dout("crush decode tunable choose_total_tries = %d\n", |
546f04ef | 350 | c->choose_total_tries); |
f24e9980 | 351 | |
1604f488 JS |
352 | ceph_decode_need(p, end, sizeof(u32), done); |
353 | c->chooseleaf_descend_once = ceph_decode_32(p); | |
b9b519b7 | 354 | dout("crush decode tunable chooseleaf_descend_once = %d\n", |
1604f488 JS |
355 | c->chooseleaf_descend_once); |
356 | ||
f140662f ID |
357 | ceph_decode_need(p, end, sizeof(u8), done); |
358 | c->chooseleaf_vary_r = ceph_decode_8(p); | |
b9b519b7 | 359 | dout("crush decode tunable chooseleaf_vary_r = %d\n", |
f140662f ID |
360 | c->chooseleaf_vary_r); |
361 | ||
b9b519b7 ID |
362 | /* skip straw_calc_version, allowed_bucket_algs */ |
363 | ceph_decode_need(p, end, sizeof(u8) + sizeof(u32), done); | |
364 | *p += sizeof(u8) + sizeof(u32); | |
365 | ||
366 | ceph_decode_need(p, end, sizeof(u8), done); | |
367 | c->chooseleaf_stable = ceph_decode_8(p); | |
368 | dout("crush decode tunable chooseleaf_stable = %d\n", | |
369 | c->chooseleaf_stable); | |
370 | ||
546f04ef | 371 | done: |
f24e9980 SW |
372 | dout("crush_decode success\n"); |
373 | return c; | |
374 | ||
375 | badmem: | |
376 | err = -ENOMEM; | |
377 | bad: | |
378 | dout("crush_decode fail %d\n", err); | |
379 | crush_destroy(c); | |
380 | return ERR_PTR(err); | |
381 | } | |
382 | ||
f24e9980 | 383 | /* |
9794b146 | 384 | * rbtree of pg_mapping for handling pg_temp (explicit mapping of pgid |
9686f94c | 385 | * to a set of osds) and primary_temp (explicit primary setting) |
f24e9980 | 386 | */ |
5b191d99 | 387 | static int pgid_cmp(struct ceph_pg l, struct ceph_pg r) |
51042122 | 388 | { |
5b191d99 SW |
389 | if (l.pool < r.pool) |
390 | return -1; | |
391 | if (l.pool > r.pool) | |
392 | return 1; | |
393 | if (l.seed < r.seed) | |
51042122 | 394 | return -1; |
5b191d99 | 395 | if (l.seed > r.seed) |
51042122 SW |
396 | return 1; |
397 | return 0; | |
398 | } | |
399 | ||
991abb6e SW |
400 | static int __insert_pg_mapping(struct ceph_pg_mapping *new, |
401 | struct rb_root *root) | |
f24e9980 SW |
402 | { |
403 | struct rb_node **p = &root->rb_node; | |
404 | struct rb_node *parent = NULL; | |
405 | struct ceph_pg_mapping *pg = NULL; | |
51042122 | 406 | int c; |
f24e9980 | 407 | |
8adc8b3d | 408 | dout("__insert_pg_mapping %llx %p\n", *(u64 *)&new->pgid, new); |
f24e9980 SW |
409 | while (*p) { |
410 | parent = *p; | |
411 | pg = rb_entry(parent, struct ceph_pg_mapping, node); | |
51042122 SW |
412 | c = pgid_cmp(new->pgid, pg->pgid); |
413 | if (c < 0) | |
f24e9980 | 414 | p = &(*p)->rb_left; |
51042122 | 415 | else if (c > 0) |
f24e9980 SW |
416 | p = &(*p)->rb_right; |
417 | else | |
991abb6e | 418 | return -EEXIST; |
f24e9980 SW |
419 | } |
420 | ||
421 | rb_link_node(&new->node, parent, p); | |
422 | rb_insert_color(&new->node, root); | |
991abb6e | 423 | return 0; |
f24e9980 SW |
424 | } |
425 | ||
9794b146 | 426 | static struct ceph_pg_mapping *__lookup_pg_mapping(struct rb_root *root, |
5b191d99 | 427 | struct ceph_pg pgid) |
9794b146 SW |
428 | { |
429 | struct rb_node *n = root->rb_node; | |
430 | struct ceph_pg_mapping *pg; | |
431 | int c; | |
432 | ||
433 | while (n) { | |
434 | pg = rb_entry(n, struct ceph_pg_mapping, node); | |
435 | c = pgid_cmp(pgid, pg->pgid); | |
8adc8b3d | 436 | if (c < 0) { |
9794b146 | 437 | n = n->rb_left; |
8adc8b3d | 438 | } else if (c > 0) { |
9794b146 | 439 | n = n->rb_right; |
8adc8b3d | 440 | } else { |
5b191d99 SW |
441 | dout("__lookup_pg_mapping %lld.%x got %p\n", |
442 | pgid.pool, pgid.seed, pg); | |
9794b146 | 443 | return pg; |
8adc8b3d | 444 | } |
9794b146 SW |
445 | } |
446 | return NULL; | |
447 | } | |
448 | ||
5b191d99 | 449 | static int __remove_pg_mapping(struct rb_root *root, struct ceph_pg pgid) |
8adc8b3d SW |
450 | { |
451 | struct ceph_pg_mapping *pg = __lookup_pg_mapping(root, pgid); | |
452 | ||
453 | if (pg) { | |
5b191d99 SW |
454 | dout("__remove_pg_mapping %lld.%x %p\n", pgid.pool, pgid.seed, |
455 | pg); | |
8adc8b3d SW |
456 | rb_erase(&pg->node, root); |
457 | kfree(pg); | |
458 | return 0; | |
459 | } | |
5b191d99 | 460 | dout("__remove_pg_mapping %lld.%x dne\n", pgid.pool, pgid.seed); |
8adc8b3d SW |
461 | return -ENOENT; |
462 | } | |
463 | ||
4fc51be8 SW |
464 | /* |
465 | * rbtree of pg pool info | |
466 | */ | |
467 | static int __insert_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *new) | |
468 | { | |
469 | struct rb_node **p = &root->rb_node; | |
470 | struct rb_node *parent = NULL; | |
471 | struct ceph_pg_pool_info *pi = NULL; | |
472 | ||
473 | while (*p) { | |
474 | parent = *p; | |
475 | pi = rb_entry(parent, struct ceph_pg_pool_info, node); | |
476 | if (new->id < pi->id) | |
477 | p = &(*p)->rb_left; | |
478 | else if (new->id > pi->id) | |
479 | p = &(*p)->rb_right; | |
480 | else | |
481 | return -EEXIST; | |
482 | } | |
483 | ||
484 | rb_link_node(&new->node, parent, p); | |
485 | rb_insert_color(&new->node, root); | |
486 | return 0; | |
487 | } | |
488 | ||
4f6a7e5e | 489 | static struct ceph_pg_pool_info *__lookup_pg_pool(struct rb_root *root, u64 id) |
4fc51be8 SW |
490 | { |
491 | struct ceph_pg_pool_info *pi; | |
492 | struct rb_node *n = root->rb_node; | |
493 | ||
494 | while (n) { | |
495 | pi = rb_entry(n, struct ceph_pg_pool_info, node); | |
496 | if (id < pi->id) | |
497 | n = n->rb_left; | |
498 | else if (id > pi->id) | |
499 | n = n->rb_right; | |
500 | else | |
501 | return pi; | |
502 | } | |
503 | return NULL; | |
504 | } | |
505 | ||
ce7f6a27 ID |
506 | struct ceph_pg_pool_info *ceph_pg_pool_by_id(struct ceph_osdmap *map, u64 id) |
507 | { | |
508 | return __lookup_pg_pool(&map->pg_pools, id); | |
509 | } | |
510 | ||
72afc71f AE |
511 | const char *ceph_pg_pool_name_by_id(struct ceph_osdmap *map, u64 id) |
512 | { | |
513 | struct ceph_pg_pool_info *pi; | |
514 | ||
515 | if (id == CEPH_NOPOOL) | |
516 | return NULL; | |
517 | ||
518 | if (WARN_ON_ONCE(id > (u64) INT_MAX)) | |
519 | return NULL; | |
520 | ||
521 | pi = __lookup_pg_pool(&map->pg_pools, (int) id); | |
522 | ||
523 | return pi ? pi->name : NULL; | |
524 | } | |
525 | EXPORT_SYMBOL(ceph_pg_pool_name_by_id); | |
526 | ||
7669a2c9 YS |
527 | int ceph_pg_poolid_by_name(struct ceph_osdmap *map, const char *name) |
528 | { | |
529 | struct rb_node *rbp; | |
530 | ||
531 | for (rbp = rb_first(&map->pg_pools); rbp; rbp = rb_next(rbp)) { | |
532 | struct ceph_pg_pool_info *pi = | |
533 | rb_entry(rbp, struct ceph_pg_pool_info, node); | |
534 | if (pi->name && strcmp(pi->name, name) == 0) | |
535 | return pi->id; | |
536 | } | |
537 | return -ENOENT; | |
538 | } | |
3d14c5d2 | 539 | EXPORT_SYMBOL(ceph_pg_poolid_by_name); |
7669a2c9 | 540 | |
2844a76a SW |
541 | static void __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi) |
542 | { | |
543 | rb_erase(&pi->node, root); | |
544 | kfree(pi->name); | |
545 | kfree(pi); | |
546 | } | |
547 | ||
0f70c7ee | 548 | static int decode_pool(void **p, void *end, struct ceph_pg_pool_info *pi) |
efd7576b | 549 | { |
4f6a7e5e SW |
550 | u8 ev, cv; |
551 | unsigned len, num; | |
552 | void *pool_end; | |
553 | ||
554 | ceph_decode_need(p, end, 2 + 4, bad); | |
555 | ev = ceph_decode_8(p); /* encoding version */ | |
556 | cv = ceph_decode_8(p); /* compat version */ | |
557 | if (ev < 5) { | |
b9a67899 | 558 | pr_warn("got v %d < 5 cv %d of ceph_pg_pool\n", ev, cv); |
4f6a7e5e SW |
559 | return -EINVAL; |
560 | } | |
17a13e40 | 561 | if (cv > 9) { |
b9a67899 | 562 | pr_warn("got v %d cv %d > 9 of ceph_pg_pool\n", ev, cv); |
4f6a7e5e SW |
563 | return -EINVAL; |
564 | } | |
565 | len = ceph_decode_32(p); | |
566 | ceph_decode_need(p, end, len, bad); | |
567 | pool_end = *p + len; | |
73a7e693 | 568 | |
4f6a7e5e SW |
569 | pi->type = ceph_decode_8(p); |
570 | pi->size = ceph_decode_8(p); | |
571 | pi->crush_ruleset = ceph_decode_8(p); | |
572 | pi->object_hash = ceph_decode_8(p); | |
73a7e693 | 573 | |
4f6a7e5e SW |
574 | pi->pg_num = ceph_decode_32(p); |
575 | pi->pgp_num = ceph_decode_32(p); | |
576 | ||
577 | *p += 4 + 4; /* skip lpg* */ | |
578 | *p += 4; /* skip last_change */ | |
579 | *p += 8 + 4; /* skip snap_seq, snap_epoch */ | |
580 | ||
581 | /* skip snaps */ | |
582 | num = ceph_decode_32(p); | |
583 | while (num--) { | |
584 | *p += 8; /* snapid key */ | |
585 | *p += 1 + 1; /* versions */ | |
586 | len = ceph_decode_32(p); | |
587 | *p += len; | |
73a7e693 SW |
588 | } |
589 | ||
17a13e40 | 590 | /* skip removed_snaps */ |
4f6a7e5e SW |
591 | num = ceph_decode_32(p); |
592 | *p += num * (8 + 8); | |
593 | ||
594 | *p += 8; /* skip auid */ | |
595 | pi->flags = ceph_decode_64(p); | |
17a13e40 ID |
596 | *p += 4; /* skip crash_replay_interval */ |
597 | ||
598 | if (ev >= 7) | |
599 | *p += 1; /* skip min_size */ | |
600 | ||
601 | if (ev >= 8) | |
602 | *p += 8 + 8; /* skip quota_max_* */ | |
603 | ||
604 | if (ev >= 9) { | |
605 | /* skip tiers */ | |
606 | num = ceph_decode_32(p); | |
607 | *p += num * 8; | |
608 | ||
609 | *p += 8; /* skip tier_of */ | |
610 | *p += 1; /* skip cache_mode */ | |
611 | ||
612 | pi->read_tier = ceph_decode_64(p); | |
613 | pi->write_tier = ceph_decode_64(p); | |
614 | } else { | |
615 | pi->read_tier = -1; | |
616 | pi->write_tier = -1; | |
617 | } | |
4f6a7e5e SW |
618 | |
619 | /* ignore the rest */ | |
620 | ||
621 | *p = pool_end; | |
622 | calc_pg_masks(pi); | |
73a7e693 SW |
623 | return 0; |
624 | ||
625 | bad: | |
626 | return -EINVAL; | |
efd7576b SW |
627 | } |
628 | ||
0f70c7ee | 629 | static int decode_pool_names(void **p, void *end, struct ceph_osdmap *map) |
2844a76a SW |
630 | { |
631 | struct ceph_pg_pool_info *pi; | |
4f6a7e5e SW |
632 | u32 num, len; |
633 | u64 pool; | |
2844a76a SW |
634 | |
635 | ceph_decode_32_safe(p, end, num, bad); | |
636 | dout(" %d pool names\n", num); | |
637 | while (num--) { | |
4f6a7e5e | 638 | ceph_decode_64_safe(p, end, pool, bad); |
2844a76a | 639 | ceph_decode_32_safe(p, end, len, bad); |
4f6a7e5e | 640 | dout(" pool %llu len %d\n", pool, len); |
ad3b904c | 641 | ceph_decode_need(p, end, len, bad); |
2844a76a SW |
642 | pi = __lookup_pg_pool(&map->pg_pools, pool); |
643 | if (pi) { | |
ad3b904c XW |
644 | char *name = kstrndup(*p, len, GFP_NOFS); |
645 | ||
646 | if (!name) | |
647 | return -ENOMEM; | |
2844a76a | 648 | kfree(pi->name); |
ad3b904c XW |
649 | pi->name = name; |
650 | dout(" name is %s\n", pi->name); | |
2844a76a SW |
651 | } |
652 | *p += len; | |
653 | } | |
654 | return 0; | |
655 | ||
656 | bad: | |
657 | return -EINVAL; | |
658 | } | |
659 | ||
660 | /* | |
661 | * osd map | |
662 | */ | |
663 | void ceph_osdmap_destroy(struct ceph_osdmap *map) | |
664 | { | |
665 | dout("osdmap_destroy %p\n", map); | |
666 | if (map->crush) | |
667 | crush_destroy(map->crush); | |
668 | while (!RB_EMPTY_ROOT(&map->pg_temp)) { | |
669 | struct ceph_pg_mapping *pg = | |
670 | rb_entry(rb_first(&map->pg_temp), | |
671 | struct ceph_pg_mapping, node); | |
672 | rb_erase(&pg->node, &map->pg_temp); | |
673 | kfree(pg); | |
674 | } | |
9686f94c ID |
675 | while (!RB_EMPTY_ROOT(&map->primary_temp)) { |
676 | struct ceph_pg_mapping *pg = | |
677 | rb_entry(rb_first(&map->primary_temp), | |
678 | struct ceph_pg_mapping, node); | |
679 | rb_erase(&pg->node, &map->primary_temp); | |
680 | kfree(pg); | |
681 | } | |
2844a76a SW |
682 | while (!RB_EMPTY_ROOT(&map->pg_pools)) { |
683 | struct ceph_pg_pool_info *pi = | |
684 | rb_entry(rb_first(&map->pg_pools), | |
685 | struct ceph_pg_pool_info, node); | |
686 | __remove_pg_pool(&map->pg_pools, pi); | |
687 | } | |
688 | kfree(map->osd_state); | |
689 | kfree(map->osd_weight); | |
690 | kfree(map->osd_addr); | |
2cfa34f2 | 691 | kfree(map->osd_primary_affinity); |
2844a76a SW |
692 | kfree(map); |
693 | } | |
694 | ||
695 | /* | |
4d60351f ID |
696 | * Adjust max_osd value, (re)allocate arrays. |
697 | * | |
698 | * The new elements are properly initialized. | |
2844a76a SW |
699 | */ |
700 | static int osdmap_set_max_osd(struct ceph_osdmap *map, int max) | |
701 | { | |
702 | u8 *state; | |
2844a76a | 703 | u32 *weight; |
4d60351f ID |
704 | struct ceph_entity_addr *addr; |
705 | int i; | |
2844a76a | 706 | |
4d60351f | 707 | state = krealloc(map->osd_state, max*sizeof(*state), GFP_NOFS); |
589506f1 LR |
708 | if (!state) |
709 | return -ENOMEM; | |
710 | map->osd_state = state; | |
711 | ||
4d60351f | 712 | weight = krealloc(map->osd_weight, max*sizeof(*weight), GFP_NOFS); |
589506f1 LR |
713 | if (!weight) |
714 | return -ENOMEM; | |
715 | map->osd_weight = weight; | |
4d60351f | 716 | |
589506f1 LR |
717 | addr = krealloc(map->osd_addr, max*sizeof(*addr), GFP_NOFS); |
718 | if (!addr) | |
2844a76a | 719 | return -ENOMEM; |
589506f1 | 720 | map->osd_addr = addr; |
2844a76a | 721 | |
4d60351f | 722 | for (i = map->max_osd; i < max; i++) { |
589506f1 LR |
723 | map->osd_state[i] = 0; |
724 | map->osd_weight[i] = CEPH_OSD_OUT; | |
725 | memset(map->osd_addr + i, 0, sizeof(*map->osd_addr)); | |
2844a76a SW |
726 | } |
727 | ||
2cfa34f2 ID |
728 | if (map->osd_primary_affinity) { |
729 | u32 *affinity; | |
730 | ||
731 | affinity = krealloc(map->osd_primary_affinity, | |
732 | max*sizeof(*affinity), GFP_NOFS); | |
733 | if (!affinity) | |
734 | return -ENOMEM; | |
589506f1 | 735 | map->osd_primary_affinity = affinity; |
2cfa34f2 ID |
736 | |
737 | for (i = map->max_osd; i < max; i++) | |
589506f1 LR |
738 | map->osd_primary_affinity[i] = |
739 | CEPH_OSD_DEFAULT_PRIMARY_AFFINITY; | |
2cfa34f2 ID |
740 | } |
741 | ||
2844a76a | 742 | map->max_osd = max; |
4d60351f | 743 | |
2844a76a SW |
744 | return 0; |
745 | } | |
746 | ||
ec7af972 ID |
747 | #define OSDMAP_WRAPPER_COMPAT_VER 7 |
748 | #define OSDMAP_CLIENT_DATA_COMPAT_VER 1 | |
749 | ||
750 | /* | |
751 | * Return 0 or error. On success, *v is set to 0 for old (v6) osdmaps, | |
752 | * to struct_v of the client_data section for new (v7 and above) | |
753 | * osdmaps. | |
754 | */ | |
755 | static int get_osdmap_client_data_v(void **p, void *end, | |
756 | const char *prefix, u8 *v) | |
757 | { | |
758 | u8 struct_v; | |
759 | ||
760 | ceph_decode_8_safe(p, end, struct_v, e_inval); | |
761 | if (struct_v >= 7) { | |
762 | u8 struct_compat; | |
763 | ||
764 | ceph_decode_8_safe(p, end, struct_compat, e_inval); | |
765 | if (struct_compat > OSDMAP_WRAPPER_COMPAT_VER) { | |
b9a67899 JP |
766 | pr_warn("got v %d cv %d > %d of %s ceph_osdmap\n", |
767 | struct_v, struct_compat, | |
768 | OSDMAP_WRAPPER_COMPAT_VER, prefix); | |
ec7af972 ID |
769 | return -EINVAL; |
770 | } | |
771 | *p += 4; /* ignore wrapper struct_len */ | |
772 | ||
773 | ceph_decode_8_safe(p, end, struct_v, e_inval); | |
774 | ceph_decode_8_safe(p, end, struct_compat, e_inval); | |
775 | if (struct_compat > OSDMAP_CLIENT_DATA_COMPAT_VER) { | |
b9a67899 JP |
776 | pr_warn("got v %d cv %d > %d of %s ceph_osdmap client data\n", |
777 | struct_v, struct_compat, | |
778 | OSDMAP_CLIENT_DATA_COMPAT_VER, prefix); | |
ec7af972 ID |
779 | return -EINVAL; |
780 | } | |
781 | *p += 4; /* ignore client data struct_len */ | |
782 | } else { | |
783 | u16 version; | |
784 | ||
785 | *p -= 1; | |
786 | ceph_decode_16_safe(p, end, version, e_inval); | |
787 | if (version < 6) { | |
b9a67899 JP |
788 | pr_warn("got v %d < 6 of %s ceph_osdmap\n", |
789 | version, prefix); | |
ec7af972 ID |
790 | return -EINVAL; |
791 | } | |
792 | ||
793 | /* old osdmap enconding */ | |
794 | struct_v = 0; | |
795 | } | |
796 | ||
797 | *v = struct_v; | |
798 | return 0; | |
799 | ||
800 | e_inval: | |
801 | return -EINVAL; | |
802 | } | |
803 | ||
433fbdd3 ID |
804 | static int __decode_pools(void **p, void *end, struct ceph_osdmap *map, |
805 | bool incremental) | |
806 | { | |
807 | u32 n; | |
808 | ||
809 | ceph_decode_32_safe(p, end, n, e_inval); | |
810 | while (n--) { | |
811 | struct ceph_pg_pool_info *pi; | |
812 | u64 pool; | |
813 | int ret; | |
814 | ||
815 | ceph_decode_64_safe(p, end, pool, e_inval); | |
816 | ||
817 | pi = __lookup_pg_pool(&map->pg_pools, pool); | |
818 | if (!incremental || !pi) { | |
819 | pi = kzalloc(sizeof(*pi), GFP_NOFS); | |
820 | if (!pi) | |
821 | return -ENOMEM; | |
822 | ||
823 | pi->id = pool; | |
824 | ||
825 | ret = __insert_pg_pool(&map->pg_pools, pi); | |
826 | if (ret) { | |
827 | kfree(pi); | |
828 | return ret; | |
829 | } | |
830 | } | |
831 | ||
832 | ret = decode_pool(p, end, pi); | |
833 | if (ret) | |
834 | return ret; | |
835 | } | |
836 | ||
837 | return 0; | |
838 | ||
839 | e_inval: | |
840 | return -EINVAL; | |
841 | } | |
842 | ||
843 | static int decode_pools(void **p, void *end, struct ceph_osdmap *map) | |
844 | { | |
845 | return __decode_pools(p, end, map, false); | |
846 | } | |
847 | ||
848 | static int decode_new_pools(void **p, void *end, struct ceph_osdmap *map) | |
849 | { | |
850 | return __decode_pools(p, end, map, true); | |
851 | } | |
852 | ||
10db634e ID |
853 | static int __decode_pg_temp(void **p, void *end, struct ceph_osdmap *map, |
854 | bool incremental) | |
855 | { | |
856 | u32 n; | |
857 | ||
858 | ceph_decode_32_safe(p, end, n, e_inval); | |
859 | while (n--) { | |
860 | struct ceph_pg pgid; | |
861 | u32 len, i; | |
862 | int ret; | |
863 | ||
864 | ret = ceph_decode_pgid(p, end, &pgid); | |
865 | if (ret) | |
866 | return ret; | |
867 | ||
868 | ceph_decode_32_safe(p, end, len, e_inval); | |
869 | ||
870 | ret = __remove_pg_mapping(&map->pg_temp, pgid); | |
871 | BUG_ON(!incremental && ret != -ENOENT); | |
872 | ||
873 | if (!incremental || len > 0) { | |
874 | struct ceph_pg_mapping *pg; | |
875 | ||
876 | ceph_decode_need(p, end, len*sizeof(u32), e_inval); | |
877 | ||
878 | if (len > (UINT_MAX - sizeof(*pg)) / sizeof(u32)) | |
879 | return -EINVAL; | |
880 | ||
881 | pg = kzalloc(sizeof(*pg) + len*sizeof(u32), GFP_NOFS); | |
882 | if (!pg) | |
883 | return -ENOMEM; | |
884 | ||
885 | pg->pgid = pgid; | |
35a935d7 | 886 | pg->pg_temp.len = len; |
10db634e | 887 | for (i = 0; i < len; i++) |
35a935d7 | 888 | pg->pg_temp.osds[i] = ceph_decode_32(p); |
10db634e ID |
889 | |
890 | ret = __insert_pg_mapping(pg, &map->pg_temp); | |
891 | if (ret) { | |
892 | kfree(pg); | |
893 | return ret; | |
894 | } | |
895 | } | |
896 | } | |
897 | ||
898 | return 0; | |
899 | ||
900 | e_inval: | |
901 | return -EINVAL; | |
902 | } | |
903 | ||
904 | static int decode_pg_temp(void **p, void *end, struct ceph_osdmap *map) | |
905 | { | |
906 | return __decode_pg_temp(p, end, map, false); | |
907 | } | |
908 | ||
909 | static int decode_new_pg_temp(void **p, void *end, struct ceph_osdmap *map) | |
910 | { | |
911 | return __decode_pg_temp(p, end, map, true); | |
912 | } | |
913 | ||
d286de79 ID |
914 | static int __decode_primary_temp(void **p, void *end, struct ceph_osdmap *map, |
915 | bool incremental) | |
916 | { | |
917 | u32 n; | |
918 | ||
919 | ceph_decode_32_safe(p, end, n, e_inval); | |
920 | while (n--) { | |
921 | struct ceph_pg pgid; | |
922 | u32 osd; | |
923 | int ret; | |
924 | ||
925 | ret = ceph_decode_pgid(p, end, &pgid); | |
926 | if (ret) | |
927 | return ret; | |
928 | ||
929 | ceph_decode_32_safe(p, end, osd, e_inval); | |
930 | ||
931 | ret = __remove_pg_mapping(&map->primary_temp, pgid); | |
932 | BUG_ON(!incremental && ret != -ENOENT); | |
933 | ||
934 | if (!incremental || osd != (u32)-1) { | |
935 | struct ceph_pg_mapping *pg; | |
936 | ||
937 | pg = kzalloc(sizeof(*pg), GFP_NOFS); | |
938 | if (!pg) | |
939 | return -ENOMEM; | |
940 | ||
941 | pg->pgid = pgid; | |
942 | pg->primary_temp.osd = osd; | |
943 | ||
944 | ret = __insert_pg_mapping(pg, &map->primary_temp); | |
945 | if (ret) { | |
946 | kfree(pg); | |
947 | return ret; | |
948 | } | |
949 | } | |
950 | } | |
951 | ||
952 | return 0; | |
953 | ||
954 | e_inval: | |
955 | return -EINVAL; | |
956 | } | |
957 | ||
958 | static int decode_primary_temp(void **p, void *end, struct ceph_osdmap *map) | |
959 | { | |
960 | return __decode_primary_temp(p, end, map, false); | |
961 | } | |
962 | ||
963 | static int decode_new_primary_temp(void **p, void *end, | |
964 | struct ceph_osdmap *map) | |
965 | { | |
966 | return __decode_primary_temp(p, end, map, true); | |
967 | } | |
968 | ||
2cfa34f2 ID |
969 | u32 ceph_get_primary_affinity(struct ceph_osdmap *map, int osd) |
970 | { | |
971 | BUG_ON(osd >= map->max_osd); | |
972 | ||
973 | if (!map->osd_primary_affinity) | |
974 | return CEPH_OSD_DEFAULT_PRIMARY_AFFINITY; | |
975 | ||
976 | return map->osd_primary_affinity[osd]; | |
977 | } | |
978 | ||
979 | static int set_primary_affinity(struct ceph_osdmap *map, int osd, u32 aff) | |
980 | { | |
981 | BUG_ON(osd >= map->max_osd); | |
982 | ||
983 | if (!map->osd_primary_affinity) { | |
984 | int i; | |
985 | ||
986 | map->osd_primary_affinity = kmalloc(map->max_osd*sizeof(u32), | |
987 | GFP_NOFS); | |
988 | if (!map->osd_primary_affinity) | |
989 | return -ENOMEM; | |
990 | ||
991 | for (i = 0; i < map->max_osd; i++) | |
992 | map->osd_primary_affinity[i] = | |
993 | CEPH_OSD_DEFAULT_PRIMARY_AFFINITY; | |
994 | } | |
995 | ||
996 | map->osd_primary_affinity[osd] = aff; | |
997 | ||
998 | return 0; | |
999 | } | |
1000 | ||
63a6993f ID |
1001 | static int decode_primary_affinity(void **p, void *end, |
1002 | struct ceph_osdmap *map) | |
1003 | { | |
1004 | u32 len, i; | |
1005 | ||
1006 | ceph_decode_32_safe(p, end, len, e_inval); | |
1007 | if (len == 0) { | |
1008 | kfree(map->osd_primary_affinity); | |
1009 | map->osd_primary_affinity = NULL; | |
1010 | return 0; | |
1011 | } | |
1012 | if (len != map->max_osd) | |
1013 | goto e_inval; | |
1014 | ||
1015 | ceph_decode_need(p, end, map->max_osd*sizeof(u32), e_inval); | |
1016 | ||
1017 | for (i = 0; i < map->max_osd; i++) { | |
1018 | int ret; | |
1019 | ||
1020 | ret = set_primary_affinity(map, i, ceph_decode_32(p)); | |
1021 | if (ret) | |
1022 | return ret; | |
1023 | } | |
1024 | ||
1025 | return 0; | |
1026 | ||
1027 | e_inval: | |
1028 | return -EINVAL; | |
1029 | } | |
1030 | ||
1031 | static int decode_new_primary_affinity(void **p, void *end, | |
1032 | struct ceph_osdmap *map) | |
1033 | { | |
1034 | u32 n; | |
1035 | ||
1036 | ceph_decode_32_safe(p, end, n, e_inval); | |
1037 | while (n--) { | |
1038 | u32 osd, aff; | |
1039 | int ret; | |
1040 | ||
1041 | ceph_decode_32_safe(p, end, osd, e_inval); | |
1042 | ceph_decode_32_safe(p, end, aff, e_inval); | |
1043 | ||
1044 | ret = set_primary_affinity(map, osd, aff); | |
1045 | if (ret) | |
1046 | return ret; | |
f31da0f3 ID |
1047 | |
1048 | pr_info("osd%d primary-affinity 0x%x\n", osd, aff); | |
63a6993f ID |
1049 | } |
1050 | ||
1051 | return 0; | |
1052 | ||
1053 | e_inval: | |
1054 | return -EINVAL; | |
1055 | } | |
1056 | ||
f24e9980 SW |
1057 | /* |
1058 | * decode a full map. | |
1059 | */ | |
a2505d63 | 1060 | static int osdmap_decode(void **p, void *end, struct ceph_osdmap *map) |
f24e9980 | 1061 | { |
ec7af972 | 1062 | u8 struct_v; |
38a8d560 | 1063 | u32 epoch = 0; |
f24e9980 | 1064 | void *start = *p; |
3977058c ID |
1065 | u32 max; |
1066 | u32 len, i; | |
597b52f6 | 1067 | int err; |
f24e9980 | 1068 | |
a2505d63 | 1069 | dout("%s %p to %p len %d\n", __func__, *p, end, (int)(end - *p)); |
f24e9980 | 1070 | |
ec7af972 ID |
1071 | err = get_osdmap_client_data_v(p, end, "full", &struct_v); |
1072 | if (err) | |
1073 | goto bad; | |
f24e9980 | 1074 | |
53bbaba9 ID |
1075 | /* fsid, epoch, created, modified */ |
1076 | ceph_decode_need(p, end, sizeof(map->fsid) + sizeof(u32) + | |
1077 | sizeof(map->created) + sizeof(map->modified), e_inval); | |
f24e9980 | 1078 | ceph_decode_copy(p, &map->fsid, sizeof(map->fsid)); |
38a8d560 | 1079 | epoch = map->epoch = ceph_decode_32(p); |
f24e9980 SW |
1080 | ceph_decode_copy(p, &map->created, sizeof(map->created)); |
1081 | ceph_decode_copy(p, &map->modified, sizeof(map->modified)); | |
1082 | ||
433fbdd3 ID |
1083 | /* pools */ |
1084 | err = decode_pools(p, end, map); | |
1085 | if (err) | |
1086 | goto bad; | |
2844a76a | 1087 | |
0f70c7ee ID |
1088 | /* pool_name */ |
1089 | err = decode_pool_names(p, end, map); | |
597b52f6 | 1090 | if (err) |
4f6a7e5e | 1091 | goto bad; |
2844a76a | 1092 | |
597b52f6 | 1093 | ceph_decode_32_safe(p, end, map->pool_max, e_inval); |
f24e9980 | 1094 | |
597b52f6 | 1095 | ceph_decode_32_safe(p, end, map->flags, e_inval); |
f24e9980 | 1096 | |
3977058c ID |
1097 | /* max_osd */ |
1098 | ceph_decode_32_safe(p, end, max, e_inval); | |
f24e9980 SW |
1099 | |
1100 | /* (re)alloc osd arrays */ | |
1101 | err = osdmap_set_max_osd(map, max); | |
597b52f6 | 1102 | if (err) |
f24e9980 | 1103 | goto bad; |
f24e9980 | 1104 | |
2d88b2e0 | 1105 | /* osd_state, osd_weight, osd_addrs->client_addr */ |
f24e9980 SW |
1106 | ceph_decode_need(p, end, 3*sizeof(u32) + |
1107 | map->max_osd*(1 + sizeof(*map->osd_weight) + | |
597b52f6 ID |
1108 | sizeof(*map->osd_addr)), e_inval); |
1109 | ||
2d88b2e0 ID |
1110 | if (ceph_decode_32(p) != map->max_osd) |
1111 | goto e_inval; | |
1112 | ||
f24e9980 SW |
1113 | ceph_decode_copy(p, map->osd_state, map->max_osd); |
1114 | ||
2d88b2e0 ID |
1115 | if (ceph_decode_32(p) != map->max_osd) |
1116 | goto e_inval; | |
1117 | ||
f24e9980 | 1118 | for (i = 0; i < map->max_osd; i++) |
c89136ea | 1119 | map->osd_weight[i] = ceph_decode_32(p); |
f24e9980 | 1120 | |
2d88b2e0 ID |
1121 | if (ceph_decode_32(p) != map->max_osd) |
1122 | goto e_inval; | |
1123 | ||
f24e9980 | 1124 | ceph_decode_copy(p, map->osd_addr, map->max_osd*sizeof(*map->osd_addr)); |
63f2d211 SW |
1125 | for (i = 0; i < map->max_osd; i++) |
1126 | ceph_decode_addr(&map->osd_addr[i]); | |
f24e9980 SW |
1127 | |
1128 | /* pg_temp */ | |
10db634e ID |
1129 | err = decode_pg_temp(p, end, map); |
1130 | if (err) | |
1131 | goto bad; | |
f24e9980 | 1132 | |
d286de79 ID |
1133 | /* primary_temp */ |
1134 | if (struct_v >= 1) { | |
1135 | err = decode_primary_temp(p, end, map); | |
1136 | if (err) | |
1137 | goto bad; | |
1138 | } | |
1139 | ||
63a6993f ID |
1140 | /* primary_affinity */ |
1141 | if (struct_v >= 2) { | |
1142 | err = decode_primary_affinity(p, end, map); | |
1143 | if (err) | |
1144 | goto bad; | |
1145 | } else { | |
1146 | /* XXX can this happen? */ | |
1147 | kfree(map->osd_primary_affinity); | |
1148 | map->osd_primary_affinity = NULL; | |
1149 | } | |
1150 | ||
f24e9980 | 1151 | /* crush */ |
597b52f6 | 1152 | ceph_decode_32_safe(p, end, len, e_inval); |
9902e682 | 1153 | map->crush = crush_decode(*p, min(*p + len, end)); |
f24e9980 SW |
1154 | if (IS_ERR(map->crush)) { |
1155 | err = PTR_ERR(map->crush); | |
1156 | map->crush = NULL; | |
1157 | goto bad; | |
1158 | } | |
9902e682 | 1159 | *p += len; |
f24e9980 | 1160 | |
38a8d560 | 1161 | /* ignore the rest */ |
f24e9980 SW |
1162 | *p = end; |
1163 | ||
38a8d560 | 1164 | dout("full osdmap epoch %d max_osd %d\n", map->epoch, map->max_osd); |
a2505d63 | 1165 | return 0; |
f24e9980 | 1166 | |
597b52f6 ID |
1167 | e_inval: |
1168 | err = -EINVAL; | |
f24e9980 | 1169 | bad: |
38a8d560 ID |
1170 | pr_err("corrupt full osdmap (%d) epoch %d off %d (%p of %p-%p)\n", |
1171 | err, epoch, (int)(*p - start), *p, start, end); | |
1172 | print_hex_dump(KERN_DEBUG, "osdmap: ", | |
1173 | DUMP_PREFIX_OFFSET, 16, 1, | |
1174 | start, end - start, true); | |
a2505d63 ID |
1175 | return err; |
1176 | } | |
1177 | ||
1178 | /* | |
1179 | * Allocate and decode a full map. | |
1180 | */ | |
1181 | struct ceph_osdmap *ceph_osdmap_decode(void **p, void *end) | |
1182 | { | |
1183 | struct ceph_osdmap *map; | |
1184 | int ret; | |
1185 | ||
1186 | map = kzalloc(sizeof(*map), GFP_NOFS); | |
1187 | if (!map) | |
1188 | return ERR_PTR(-ENOMEM); | |
1189 | ||
1190 | map->pg_temp = RB_ROOT; | |
9686f94c | 1191 | map->primary_temp = RB_ROOT; |
a2505d63 ID |
1192 | mutex_init(&map->crush_scratch_mutex); |
1193 | ||
1194 | ret = osdmap_decode(p, end, map); | |
1195 | if (ret) { | |
1196 | ceph_osdmap_destroy(map); | |
1197 | return ERR_PTR(ret); | |
1198 | } | |
1199 | ||
1200 | return map; | |
f24e9980 SW |
1201 | } |
1202 | ||
1203 | /* | |
1204 | * decode and apply an incremental map update. | |
1205 | */ | |
1206 | struct ceph_osdmap *osdmap_apply_incremental(void **p, void *end, | |
1207 | struct ceph_osdmap *map, | |
1208 | struct ceph_messenger *msgr) | |
1209 | { | |
f24e9980 SW |
1210 | struct crush_map *newcrush = NULL; |
1211 | struct ceph_fsid fsid; | |
1212 | u32 epoch = 0; | |
1213 | struct ceph_timespec modified; | |
4f6a7e5e SW |
1214 | s32 len; |
1215 | u64 pool; | |
1216 | __s64 new_pool_max; | |
1217 | __s32 new_flags, max; | |
f24e9980 | 1218 | void *start = *p; |
86f1742b | 1219 | int err; |
ec7af972 | 1220 | u8 struct_v; |
f24e9980 | 1221 | |
38a8d560 ID |
1222 | dout("%s %p to %p len %d\n", __func__, *p, end, (int)(end - *p)); |
1223 | ||
ec7af972 ID |
1224 | err = get_osdmap_client_data_v(p, end, "inc", &struct_v); |
1225 | if (err) | |
1226 | goto bad; | |
f24e9980 | 1227 | |
53bbaba9 ID |
1228 | /* fsid, epoch, modified, new_pool_max, new_flags */ |
1229 | ceph_decode_need(p, end, sizeof(fsid) + sizeof(u32) + sizeof(modified) + | |
1230 | sizeof(u64) + sizeof(u32), e_inval); | |
f24e9980 | 1231 | ceph_decode_copy(p, &fsid, sizeof(fsid)); |
c89136ea | 1232 | epoch = ceph_decode_32(p); |
f24e9980 SW |
1233 | BUG_ON(epoch != map->epoch+1); |
1234 | ceph_decode_copy(p, &modified, sizeof(modified)); | |
4f6a7e5e | 1235 | new_pool_max = ceph_decode_64(p); |
c89136ea | 1236 | new_flags = ceph_decode_32(p); |
f24e9980 SW |
1237 | |
1238 | /* full map? */ | |
86f1742b | 1239 | ceph_decode_32_safe(p, end, len, e_inval); |
f24e9980 SW |
1240 | if (len > 0) { |
1241 | dout("apply_incremental full map len %d, %p to %p\n", | |
1242 | len, *p, end); | |
a2505d63 | 1243 | return ceph_osdmap_decode(p, min(*p+len, end)); |
f24e9980 SW |
1244 | } |
1245 | ||
1246 | /* new crush? */ | |
86f1742b | 1247 | ceph_decode_32_safe(p, end, len, e_inval); |
f24e9980 | 1248 | if (len > 0) { |
f24e9980 | 1249 | newcrush = crush_decode(*p, min(*p+len, end)); |
86f1742b ID |
1250 | if (IS_ERR(newcrush)) { |
1251 | err = PTR_ERR(newcrush); | |
1252 | newcrush = NULL; | |
1253 | goto bad; | |
1254 | } | |
cebc5be6 | 1255 | *p += len; |
f24e9980 SW |
1256 | } |
1257 | ||
1258 | /* new flags? */ | |
1259 | if (new_flags >= 0) | |
1260 | map->flags = new_flags; | |
4fc51be8 SW |
1261 | if (new_pool_max >= 0) |
1262 | map->pool_max = new_pool_max; | |
f24e9980 | 1263 | |
f24e9980 | 1264 | /* new max? */ |
53bbaba9 | 1265 | ceph_decode_32_safe(p, end, max, e_inval); |
f24e9980 SW |
1266 | if (max >= 0) { |
1267 | err = osdmap_set_max_osd(map, max); | |
86f1742b | 1268 | if (err) |
f24e9980 SW |
1269 | goto bad; |
1270 | } | |
1271 | ||
1272 | map->epoch++; | |
31456665 | 1273 | map->modified = modified; |
f24e9980 SW |
1274 | if (newcrush) { |
1275 | if (map->crush) | |
1276 | crush_destroy(map->crush); | |
1277 | map->crush = newcrush; | |
1278 | newcrush = NULL; | |
1279 | } | |
1280 | ||
433fbdd3 ID |
1281 | /* new_pools */ |
1282 | err = decode_new_pools(p, end, map); | |
1283 | if (err) | |
1284 | goto bad; | |
9464d008 | 1285 | |
0f70c7ee ID |
1286 | /* new_pool_names */ |
1287 | err = decode_pool_names(p, end, map); | |
9464d008 ID |
1288 | if (err) |
1289 | goto bad; | |
f24e9980 | 1290 | |
4fc51be8 | 1291 | /* old_pool */ |
86f1742b | 1292 | ceph_decode_32_safe(p, end, len, e_inval); |
4fc51be8 SW |
1293 | while (len--) { |
1294 | struct ceph_pg_pool_info *pi; | |
1295 | ||
86f1742b | 1296 | ceph_decode_64_safe(p, end, pool, e_inval); |
4fc51be8 | 1297 | pi = __lookup_pg_pool(&map->pg_pools, pool); |
2844a76a SW |
1298 | if (pi) |
1299 | __remove_pg_pool(&map->pg_pools, pi); | |
4fc51be8 | 1300 | } |
f24e9980 SW |
1301 | |
1302 | /* new_up */ | |
86f1742b | 1303 | ceph_decode_32_safe(p, end, len, e_inval); |
f24e9980 SW |
1304 | while (len--) { |
1305 | u32 osd; | |
1306 | struct ceph_entity_addr addr; | |
86f1742b ID |
1307 | ceph_decode_32_safe(p, end, osd, e_inval); |
1308 | ceph_decode_copy_safe(p, end, &addr, sizeof(addr), e_inval); | |
63f2d211 | 1309 | ceph_decode_addr(&addr); |
f24e9980 SW |
1310 | pr_info("osd%d up\n", osd); |
1311 | BUG_ON(osd >= map->max_osd); | |
6dd74e44 | 1312 | map->osd_state[osd] |= CEPH_OSD_UP | CEPH_OSD_EXISTS; |
f24e9980 SW |
1313 | map->osd_addr[osd] = addr; |
1314 | } | |
1315 | ||
7662d8ff | 1316 | /* new_state */ |
86f1742b | 1317 | ceph_decode_32_safe(p, end, len, e_inval); |
f24e9980 SW |
1318 | while (len--) { |
1319 | u32 osd; | |
7662d8ff | 1320 | u8 xorstate; |
86f1742b | 1321 | ceph_decode_32_safe(p, end, osd, e_inval); |
7662d8ff | 1322 | xorstate = **(u8 **)p; |
f24e9980 | 1323 | (*p)++; /* clean flag */ |
7662d8ff SW |
1324 | if (xorstate == 0) |
1325 | xorstate = CEPH_OSD_UP; | |
1326 | if (xorstate & CEPH_OSD_UP) | |
1327 | pr_info("osd%d down\n", osd); | |
f24e9980 | 1328 | if (osd < map->max_osd) |
7662d8ff | 1329 | map->osd_state[osd] ^= xorstate; |
f24e9980 SW |
1330 | } |
1331 | ||
1332 | /* new_weight */ | |
86f1742b | 1333 | ceph_decode_32_safe(p, end, len, e_inval); |
f24e9980 SW |
1334 | while (len--) { |
1335 | u32 osd, off; | |
86f1742b | 1336 | ceph_decode_need(p, end, sizeof(u32)*2, e_inval); |
c89136ea SW |
1337 | osd = ceph_decode_32(p); |
1338 | off = ceph_decode_32(p); | |
f24e9980 SW |
1339 | pr_info("osd%d weight 0x%x %s\n", osd, off, |
1340 | off == CEPH_OSD_IN ? "(in)" : | |
1341 | (off == CEPH_OSD_OUT ? "(out)" : "")); | |
1342 | if (osd < map->max_osd) | |
1343 | map->osd_weight[osd] = off; | |
1344 | } | |
1345 | ||
1346 | /* new_pg_temp */ | |
10db634e ID |
1347 | err = decode_new_pg_temp(p, end, map); |
1348 | if (err) | |
1349 | goto bad; | |
f24e9980 | 1350 | |
d286de79 ID |
1351 | /* new_primary_temp */ |
1352 | if (struct_v >= 1) { | |
1353 | err = decode_new_primary_temp(p, end, map); | |
1354 | if (err) | |
1355 | goto bad; | |
1356 | } | |
1357 | ||
63a6993f ID |
1358 | /* new_primary_affinity */ |
1359 | if (struct_v >= 2) { | |
1360 | err = decode_new_primary_affinity(p, end, map); | |
1361 | if (err) | |
1362 | goto bad; | |
1363 | } | |
1364 | ||
f24e9980 SW |
1365 | /* ignore the rest */ |
1366 | *p = end; | |
38a8d560 ID |
1367 | |
1368 | dout("inc osdmap epoch %d max_osd %d\n", map->epoch, map->max_osd); | |
f24e9980 SW |
1369 | return map; |
1370 | ||
86f1742b ID |
1371 | e_inval: |
1372 | err = -EINVAL; | |
f24e9980 | 1373 | bad: |
38a8d560 ID |
1374 | pr_err("corrupt inc osdmap (%d) epoch %d off %d (%p of %p-%p)\n", |
1375 | err, epoch, (int)(*p - start), *p, start, end); | |
9ec7cab1 SW |
1376 | print_hex_dump(KERN_DEBUG, "osdmap: ", |
1377 | DUMP_PREFIX_OFFSET, 16, 1, | |
1378 | start, end - start, true); | |
f24e9980 SW |
1379 | if (newcrush) |
1380 | crush_destroy(newcrush); | |
1381 | return ERR_PTR(err); | |
1382 | } | |
1383 | ||
1384 | ||
1385 | ||
1386 | ||
1387 | /* | |
1388 | * calculate file layout from given offset, length. | |
1389 | * fill in correct oid, logical length, and object extent | |
1390 | * offset, length. | |
1391 | * | |
1392 | * for now, we write only a single su, until we can | |
1393 | * pass a stride back to the caller. | |
1394 | */ | |
d63b77f4 | 1395 | int ceph_calc_file_object_mapping(struct ceph_file_layout *layout, |
e8afad65 | 1396 | u64 off, u64 len, |
645a1025 | 1397 | u64 *ono, |
f24e9980 SW |
1398 | u64 *oxoff, u64 *oxlen) |
1399 | { | |
1400 | u32 osize = le32_to_cpu(layout->fl_object_size); | |
1401 | u32 su = le32_to_cpu(layout->fl_stripe_unit); | |
1402 | u32 sc = le32_to_cpu(layout->fl_stripe_count); | |
1403 | u32 bl, stripeno, stripepos, objsetno; | |
1404 | u32 su_per_object; | |
ff1d1f71 | 1405 | u64 t, su_offset; |
f24e9980 | 1406 | |
e8afad65 | 1407 | dout("mapping %llu~%llu osize %u fl_su %u\n", off, len, |
f24e9980 | 1408 | osize, su); |
d63b77f4 SW |
1409 | if (su == 0 || sc == 0) |
1410 | goto invalid; | |
35e054a6 | 1411 | su_per_object = osize / su; |
d63b77f4 SW |
1412 | if (su_per_object == 0) |
1413 | goto invalid; | |
f24e9980 SW |
1414 | dout("osize %u / su %u = su_per_object %u\n", osize, su, |
1415 | su_per_object); | |
1416 | ||
d63b77f4 SW |
1417 | if ((su & ~PAGE_MASK) != 0) |
1418 | goto invalid; | |
1419 | ||
f24e9980 SW |
1420 | /* bl = *off / su; */ |
1421 | t = off; | |
1422 | do_div(t, su); | |
1423 | bl = t; | |
1424 | dout("off %llu / su %u = bl %u\n", off, su, bl); | |
1425 | ||
1426 | stripeno = bl / sc; | |
1427 | stripepos = bl % sc; | |
1428 | objsetno = stripeno / su_per_object; | |
1429 | ||
645a1025 | 1430 | *ono = objsetno * sc + stripepos; |
95c96174 | 1431 | dout("objset %u * sc %u = ono %u\n", objsetno, sc, (unsigned int)*ono); |
645a1025 SW |
1432 | |
1433 | /* *oxoff = *off % layout->fl_stripe_unit; # offset in su */ | |
f24e9980 | 1434 | t = off; |
ff1d1f71 NW |
1435 | su_offset = do_div(t, su); |
1436 | *oxoff = su_offset + (stripeno % su_per_object) * su; | |
1437 | ||
1438 | /* | |
1439 | * Calculate the length of the extent being written to the selected | |
e8afad65 | 1440 | * object. This is the minimum of the full length requested (len) or |
ff1d1f71 NW |
1441 | * the remainder of the current stripe being written to. |
1442 | */ | |
e8afad65 | 1443 | *oxlen = min_t(u64, len, su - su_offset); |
f24e9980 SW |
1444 | |
1445 | dout(" obj extent %llu~%llu\n", *oxoff, *oxlen); | |
d63b77f4 SW |
1446 | return 0; |
1447 | ||
1448 | invalid: | |
1449 | dout(" invalid layout\n"); | |
1450 | *ono = 0; | |
1451 | *oxoff = 0; | |
1452 | *oxlen = 0; | |
1453 | return -EINVAL; | |
f24e9980 | 1454 | } |
3d14c5d2 | 1455 | EXPORT_SYMBOL(ceph_calc_file_object_mapping); |
f24e9980 SW |
1456 | |
1457 | /* | |
7c13cb64 ID |
1458 | * Calculate mapping of a (oloc, oid) pair to a PG. Should only be |
1459 | * called with target's (oloc, oid), since tiering isn't taken into | |
1460 | * account. | |
f24e9980 | 1461 | */ |
7c13cb64 ID |
1462 | int ceph_oloc_oid_to_pg(struct ceph_osdmap *osdmap, |
1463 | struct ceph_object_locator *oloc, | |
1464 | struct ceph_object_id *oid, | |
1465 | struct ceph_pg *pg_out) | |
f24e9980 | 1466 | { |
7c13cb64 | 1467 | struct ceph_pg_pool_info *pi; |
f24e9980 | 1468 | |
7c13cb64 ID |
1469 | pi = __lookup_pg_pool(&osdmap->pg_pools, oloc->pool); |
1470 | if (!pi) | |
4fc51be8 | 1471 | return -EIO; |
f24e9980 | 1472 | |
7c13cb64 ID |
1473 | pg_out->pool = oloc->pool; |
1474 | pg_out->seed = ceph_str_hash(pi->object_hash, oid->name, | |
1475 | oid->name_len); | |
1476 | ||
1477 | dout("%s '%.*s' pgid %llu.%x\n", __func__, oid->name_len, oid->name, | |
1478 | pg_out->pool, pg_out->seed); | |
f24e9980 SW |
1479 | return 0; |
1480 | } | |
7c13cb64 | 1481 | EXPORT_SYMBOL(ceph_oloc_oid_to_pg); |
f24e9980 | 1482 | |
9d521470 ID |
1483 | static int do_crush(struct ceph_osdmap *map, int ruleno, int x, |
1484 | int *result, int result_max, | |
1485 | const __u32 *weight, int weight_max) | |
e8ef19c4 | 1486 | { |
9d521470 ID |
1487 | int r; |
1488 | ||
1489 | BUG_ON(result_max > CEPH_PG_MAX_SIZE); | |
1490 | ||
1491 | mutex_lock(&map->crush_scratch_mutex); | |
1492 | r = crush_do_rule(map->crush, ruleno, x, result, result_max, | |
1493 | weight, weight_max, map->crush_scratch_ary); | |
1494 | mutex_unlock(&map->crush_scratch_mutex); | |
e8ef19c4 | 1495 | |
9d521470 | 1496 | return r; |
e8ef19c4 ID |
1497 | } |
1498 | ||
2bd93d4d ID |
1499 | /* |
1500 | * Calculate raw (crush) set for given pgid. | |
1501 | * | |
1502 | * Return raw set length, or error. | |
1503 | */ | |
1504 | static int pg_to_raw_osds(struct ceph_osdmap *osdmap, | |
1505 | struct ceph_pg_pool_info *pool, | |
1506 | struct ceph_pg pgid, u32 pps, int *osds) | |
1507 | { | |
1508 | int ruleno; | |
1509 | int len; | |
1510 | ||
1511 | /* crush */ | |
1512 | ruleno = crush_find_rule(osdmap->crush, pool->crush_ruleset, | |
1513 | pool->type, pool->size); | |
1514 | if (ruleno < 0) { | |
1515 | pr_err("no crush rule: pool %lld ruleset %d type %d size %d\n", | |
1516 | pgid.pool, pool->crush_ruleset, pool->type, | |
1517 | pool->size); | |
1518 | return -ENOENT; | |
1519 | } | |
1520 | ||
1521 | len = do_crush(osdmap, ruleno, pps, osds, | |
1522 | min_t(int, pool->size, CEPH_PG_MAX_SIZE), | |
1523 | osdmap->osd_weight, osdmap->max_osd); | |
1524 | if (len < 0) { | |
1525 | pr_err("error %d from crush rule %d: pool %lld ruleset %d type %d size %d\n", | |
1526 | len, ruleno, pgid.pool, pool->crush_ruleset, | |
1527 | pool->type, pool->size); | |
1528 | return len; | |
1529 | } | |
1530 | ||
1531 | return len; | |
1532 | } | |
1533 | ||
1534 | /* | |
1535 | * Given raw set, calculate up set and up primary. | |
1536 | * | |
1537 | * Return up set length. *primary is set to up primary osd id, or -1 | |
1538 | * if up set is empty. | |
1539 | */ | |
1540 | static int raw_to_up_osds(struct ceph_osdmap *osdmap, | |
1541 | struct ceph_pg_pool_info *pool, | |
1542 | int *osds, int len, int *primary) | |
1543 | { | |
1544 | int up_primary = -1; | |
1545 | int i; | |
1546 | ||
1547 | if (ceph_can_shift_osds(pool)) { | |
1548 | int removed = 0; | |
1549 | ||
1550 | for (i = 0; i < len; i++) { | |
1551 | if (ceph_osd_is_down(osdmap, osds[i])) { | |
1552 | removed++; | |
1553 | continue; | |
1554 | } | |
1555 | if (removed) | |
1556 | osds[i - removed] = osds[i]; | |
1557 | } | |
1558 | ||
1559 | len -= removed; | |
1560 | if (len > 0) | |
1561 | up_primary = osds[0]; | |
1562 | } else { | |
1563 | for (i = len - 1; i >= 0; i--) { | |
1564 | if (ceph_osd_is_down(osdmap, osds[i])) | |
1565 | osds[i] = CRUSH_ITEM_NONE; | |
1566 | else | |
1567 | up_primary = osds[i]; | |
1568 | } | |
1569 | } | |
1570 | ||
1571 | *primary = up_primary; | |
1572 | return len; | |
1573 | } | |
1574 | ||
47ec1f3c ID |
1575 | static void apply_primary_affinity(struct ceph_osdmap *osdmap, u32 pps, |
1576 | struct ceph_pg_pool_info *pool, | |
1577 | int *osds, int len, int *primary) | |
1578 | { | |
1579 | int i; | |
1580 | int pos = -1; | |
1581 | ||
1582 | /* | |
1583 | * Do we have any non-default primary_affinity values for these | |
1584 | * osds? | |
1585 | */ | |
1586 | if (!osdmap->osd_primary_affinity) | |
1587 | return; | |
1588 | ||
1589 | for (i = 0; i < len; i++) { | |
92b2e751 ID |
1590 | int osd = osds[i]; |
1591 | ||
1592 | if (osd != CRUSH_ITEM_NONE && | |
1593 | osdmap->osd_primary_affinity[osd] != | |
47ec1f3c ID |
1594 | CEPH_OSD_DEFAULT_PRIMARY_AFFINITY) { |
1595 | break; | |
1596 | } | |
1597 | } | |
1598 | if (i == len) | |
1599 | return; | |
1600 | ||
1601 | /* | |
1602 | * Pick the primary. Feed both the seed (for the pg) and the | |
1603 | * osd into the hash/rng so that a proportional fraction of an | |
1604 | * osd's pgs get rejected as primary. | |
1605 | */ | |
1606 | for (i = 0; i < len; i++) { | |
92b2e751 | 1607 | int osd = osds[i]; |
47ec1f3c ID |
1608 | u32 aff; |
1609 | ||
47ec1f3c ID |
1610 | if (osd == CRUSH_ITEM_NONE) |
1611 | continue; | |
1612 | ||
1613 | aff = osdmap->osd_primary_affinity[osd]; | |
1614 | if (aff < CEPH_OSD_MAX_PRIMARY_AFFINITY && | |
1615 | (crush_hash32_2(CRUSH_HASH_RJENKINS1, | |
1616 | pps, osd) >> 16) >= aff) { | |
1617 | /* | |
1618 | * We chose not to use this primary. Note it | |
1619 | * anyway as a fallback in case we don't pick | |
1620 | * anyone else, but keep looking. | |
1621 | */ | |
1622 | if (pos < 0) | |
1623 | pos = i; | |
1624 | } else { | |
1625 | pos = i; | |
1626 | break; | |
1627 | } | |
1628 | } | |
1629 | if (pos < 0) | |
1630 | return; | |
1631 | ||
1632 | *primary = osds[pos]; | |
1633 | ||
1634 | if (ceph_can_shift_osds(pool) && pos > 0) { | |
1635 | /* move the new primary to the front */ | |
1636 | for (i = pos; i > 0; i--) | |
1637 | osds[i] = osds[i - 1]; | |
1638 | osds[0] = *primary; | |
1639 | } | |
1640 | } | |
1641 | ||
45966c34 | 1642 | /* |
5e8d4d36 | 1643 | * Given up set, apply pg_temp and primary_temp mappings. |
45966c34 ID |
1644 | * |
1645 | * Return acting set length. *primary is set to acting primary osd id, | |
1646 | * or -1 if acting set is empty. | |
1647 | */ | |
1648 | static int apply_temps(struct ceph_osdmap *osdmap, | |
1649 | struct ceph_pg_pool_info *pool, struct ceph_pg pgid, | |
1650 | int *osds, int len, int *primary) | |
1651 | { | |
1652 | struct ceph_pg_mapping *pg; | |
1653 | int temp_len; | |
1654 | int temp_primary; | |
1655 | int i; | |
1656 | ||
1657 | /* raw_pg -> pg */ | |
1658 | pgid.seed = ceph_stable_mod(pgid.seed, pool->pg_num, | |
1659 | pool->pg_num_mask); | |
1660 | ||
1661 | /* pg_temp? */ | |
1662 | pg = __lookup_pg_mapping(&osdmap->pg_temp, pgid); | |
1663 | if (pg) { | |
1664 | temp_len = 0; | |
1665 | temp_primary = -1; | |
1666 | ||
1667 | for (i = 0; i < pg->pg_temp.len; i++) { | |
1668 | if (ceph_osd_is_down(osdmap, pg->pg_temp.osds[i])) { | |
1669 | if (ceph_can_shift_osds(pool)) | |
1670 | continue; | |
1671 | else | |
1672 | osds[temp_len++] = CRUSH_ITEM_NONE; | |
1673 | } else { | |
1674 | osds[temp_len++] = pg->pg_temp.osds[i]; | |
1675 | } | |
1676 | } | |
1677 | ||
1678 | /* apply pg_temp's primary */ | |
1679 | for (i = 0; i < temp_len; i++) { | |
1680 | if (osds[i] != CRUSH_ITEM_NONE) { | |
1681 | temp_primary = osds[i]; | |
1682 | break; | |
1683 | } | |
1684 | } | |
1685 | } else { | |
1686 | temp_len = len; | |
1687 | temp_primary = *primary; | |
1688 | } | |
1689 | ||
5e8d4d36 ID |
1690 | /* primary_temp? */ |
1691 | pg = __lookup_pg_mapping(&osdmap->primary_temp, pgid); | |
1692 | if (pg) | |
1693 | temp_primary = pg->primary_temp.osd; | |
1694 | ||
45966c34 ID |
1695 | *primary = temp_primary; |
1696 | return temp_len; | |
1697 | } | |
1698 | ||
d85b7056 | 1699 | /* |
ac972230 ID |
1700 | * Calculate acting set for given pgid. |
1701 | * | |
8008ab10 ID |
1702 | * Return acting set length, or error. *primary is set to acting |
1703 | * primary osd id, or -1 if acting set is empty or on error. | |
d85b7056 | 1704 | */ |
5b191d99 | 1705 | int ceph_calc_pg_acting(struct ceph_osdmap *osdmap, struct ceph_pg pgid, |
8008ab10 | 1706 | int *osds, int *primary) |
d85b7056 | 1707 | { |
ac972230 ID |
1708 | struct ceph_pg_pool_info *pool; |
1709 | u32 pps; | |
1710 | int len; | |
d85b7056 | 1711 | |
ac972230 | 1712 | pool = __lookup_pg_pool(&osdmap->pg_pools, pgid.pool); |
8008ab10 ID |
1713 | if (!pool) { |
1714 | *primary = -1; | |
1715 | return -ENOENT; | |
1716 | } | |
d85b7056 | 1717 | |
ac972230 ID |
1718 | if (pool->flags & CEPH_POOL_FLAG_HASHPSPOOL) { |
1719 | /* hash pool id and seed so that pool PGs do not overlap */ | |
1720 | pps = crush_hash32_2(CRUSH_HASH_RJENKINS1, | |
1721 | ceph_stable_mod(pgid.seed, pool->pgp_num, | |
1722 | pool->pgp_num_mask), | |
1723 | pgid.pool); | |
1724 | } else { | |
1725 | /* | |
1726 | * legacy behavior: add ps and pool together. this is | |
1727 | * not a great approach because the PGs from each pool | |
1728 | * will overlap on top of each other: 0.5 == 1.4 == | |
1729 | * 2.3 == ... | |
1730 | */ | |
1731 | pps = ceph_stable_mod(pgid.seed, pool->pgp_num, | |
1732 | pool->pgp_num_mask) + | |
1733 | (unsigned)pgid.pool; | |
1734 | } | |
1735 | ||
1736 | len = pg_to_raw_osds(osdmap, pool, pgid, pps, osds); | |
8008ab10 ID |
1737 | if (len < 0) { |
1738 | *primary = -1; | |
ac972230 | 1739 | return len; |
8008ab10 | 1740 | } |
ac972230 | 1741 | |
8008ab10 | 1742 | len = raw_to_up_osds(osdmap, pool, osds, len, primary); |
ac972230 | 1743 | |
47ec1f3c ID |
1744 | apply_primary_affinity(osdmap, pps, pool, osds, len, primary); |
1745 | ||
8008ab10 | 1746 | len = apply_temps(osdmap, pool, pgid, osds, len, primary); |
ac972230 ID |
1747 | |
1748 | return len; | |
d85b7056 SW |
1749 | } |
1750 | ||
f24e9980 SW |
1751 | /* |
1752 | * Return primary osd for given pgid, or -1 if none. | |
1753 | */ | |
5b191d99 | 1754 | int ceph_calc_pg_primary(struct ceph_osdmap *osdmap, struct ceph_pg pgid) |
f24e9980 | 1755 | { |
c4c12285 ID |
1756 | int osds[CEPH_PG_MAX_SIZE]; |
1757 | int primary; | |
f24e9980 | 1758 | |
c4c12285 | 1759 | ceph_calc_pg_acting(osdmap, pgid, osds, &primary); |
f24e9980 | 1760 | |
c4c12285 | 1761 | return primary; |
f24e9980 | 1762 | } |
3d14c5d2 | 1763 | EXPORT_SYMBOL(ceph_calc_pg_primary); |