]>
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 | ||
66a0e2d5 ID |
156 | static void crush_finalize(struct crush_map *c) |
157 | { | |
158 | __s32 b; | |
159 | ||
160 | /* Space for the array of pointers to per-bucket workspace */ | |
161 | c->working_size = sizeof(struct crush_work) + | |
162 | c->max_buckets * sizeof(struct crush_work_bucket *); | |
163 | ||
164 | for (b = 0; b < c->max_buckets; b++) { | |
165 | if (!c->buckets[b]) | |
166 | continue; | |
167 | ||
168 | switch (c->buckets[b]->alg) { | |
169 | default: | |
170 | /* | |
171 | * The base case, permutation variables and | |
172 | * the pointer to the permutation array. | |
173 | */ | |
174 | c->working_size += sizeof(struct crush_work_bucket); | |
175 | break; | |
176 | } | |
177 | /* Every bucket has a permutation array. */ | |
178 | c->working_size += c->buckets[b]->size * sizeof(__u32); | |
179 | } | |
180 | } | |
181 | ||
f24e9980 SW |
182 | static struct crush_map *crush_decode(void *pbyval, void *end) |
183 | { | |
184 | struct crush_map *c; | |
185 | int err = -EINVAL; | |
186 | int i, j; | |
187 | void **p = &pbyval; | |
188 | void *start = pbyval; | |
189 | u32 magic; | |
546f04ef | 190 | u32 num_name_maps; |
f24e9980 SW |
191 | |
192 | dout("crush_decode %p to %p len %d\n", *p, end, (int)(end - *p)); | |
193 | ||
194 | c = kzalloc(sizeof(*c), GFP_NOFS); | |
195 | if (c == NULL) | |
196 | return ERR_PTR(-ENOMEM); | |
197 | ||
546f04ef SW |
198 | /* set tunables to default values */ |
199 | c->choose_local_tries = 2; | |
200 | c->choose_local_fallback_tries = 5; | |
201 | c->choose_total_tries = 19; | |
1604f488 | 202 | c->chooseleaf_descend_once = 0; |
546f04ef | 203 | |
f24e9980 | 204 | ceph_decode_need(p, end, 4*sizeof(u32), bad); |
c89136ea | 205 | magic = ceph_decode_32(p); |
f24e9980 SW |
206 | if (magic != CRUSH_MAGIC) { |
207 | pr_err("crush_decode magic %x != current %x\n", | |
95c96174 | 208 | (unsigned int)magic, (unsigned int)CRUSH_MAGIC); |
f24e9980 SW |
209 | goto bad; |
210 | } | |
c89136ea SW |
211 | c->max_buckets = ceph_decode_32(p); |
212 | c->max_rules = ceph_decode_32(p); | |
213 | c->max_devices = ceph_decode_32(p); | |
f24e9980 | 214 | |
f24e9980 SW |
215 | c->buckets = kcalloc(c->max_buckets, sizeof(*c->buckets), GFP_NOFS); |
216 | if (c->buckets == NULL) | |
217 | goto badmem; | |
218 | c->rules = kcalloc(c->max_rules, sizeof(*c->rules), GFP_NOFS); | |
219 | if (c->rules == NULL) | |
220 | goto badmem; | |
221 | ||
222 | /* buckets */ | |
223 | for (i = 0; i < c->max_buckets; i++) { | |
224 | int size = 0; | |
225 | u32 alg; | |
226 | struct crush_bucket *b; | |
227 | ||
228 | ceph_decode_32_safe(p, end, alg, bad); | |
229 | if (alg == 0) { | |
230 | c->buckets[i] = NULL; | |
231 | continue; | |
232 | } | |
233 | dout("crush_decode bucket %d off %x %p to %p\n", | |
234 | i, (int)(*p-start), *p, end); | |
235 | ||
236 | switch (alg) { | |
237 | case CRUSH_BUCKET_UNIFORM: | |
238 | size = sizeof(struct crush_bucket_uniform); | |
239 | break; | |
240 | case CRUSH_BUCKET_LIST: | |
241 | size = sizeof(struct crush_bucket_list); | |
242 | break; | |
243 | case CRUSH_BUCKET_TREE: | |
244 | size = sizeof(struct crush_bucket_tree); | |
245 | break; | |
246 | case CRUSH_BUCKET_STRAW: | |
247 | size = sizeof(struct crush_bucket_straw); | |
248 | break; | |
958a2765 ID |
249 | case CRUSH_BUCKET_STRAW2: |
250 | size = sizeof(struct crush_bucket_straw2); | |
251 | break; | |
f24e9980 | 252 | default: |
30dc6381 | 253 | err = -EINVAL; |
f24e9980 SW |
254 | goto bad; |
255 | } | |
256 | BUG_ON(size == 0); | |
257 | b = c->buckets[i] = kzalloc(size, GFP_NOFS); | |
258 | if (b == NULL) | |
259 | goto badmem; | |
260 | ||
261 | ceph_decode_need(p, end, 4*sizeof(u32), bad); | |
c89136ea SW |
262 | b->id = ceph_decode_32(p); |
263 | b->type = ceph_decode_16(p); | |
fb690390 SW |
264 | b->alg = ceph_decode_8(p); |
265 | b->hash = ceph_decode_8(p); | |
c89136ea SW |
266 | b->weight = ceph_decode_32(p); |
267 | b->size = ceph_decode_32(p); | |
f24e9980 SW |
268 | |
269 | dout("crush_decode bucket size %d off %x %p to %p\n", | |
270 | b->size, (int)(*p-start), *p, end); | |
271 | ||
272 | b->items = kcalloc(b->size, sizeof(__s32), GFP_NOFS); | |
273 | if (b->items == NULL) | |
274 | goto badmem; | |
f24e9980 SW |
275 | |
276 | ceph_decode_need(p, end, b->size*sizeof(u32), bad); | |
277 | for (j = 0; j < b->size; j++) | |
c89136ea | 278 | b->items[j] = ceph_decode_32(p); |
f24e9980 SW |
279 | |
280 | switch (b->alg) { | |
281 | case CRUSH_BUCKET_UNIFORM: | |
282 | err = crush_decode_uniform_bucket(p, end, | |
283 | (struct crush_bucket_uniform *)b); | |
284 | if (err < 0) | |
285 | goto bad; | |
286 | break; | |
287 | case CRUSH_BUCKET_LIST: | |
288 | err = crush_decode_list_bucket(p, end, | |
289 | (struct crush_bucket_list *)b); | |
290 | if (err < 0) | |
291 | goto bad; | |
292 | break; | |
293 | case CRUSH_BUCKET_TREE: | |
294 | err = crush_decode_tree_bucket(p, end, | |
295 | (struct crush_bucket_tree *)b); | |
296 | if (err < 0) | |
297 | goto bad; | |
298 | break; | |
299 | case CRUSH_BUCKET_STRAW: | |
300 | err = crush_decode_straw_bucket(p, end, | |
301 | (struct crush_bucket_straw *)b); | |
302 | if (err < 0) | |
303 | goto bad; | |
304 | break; | |
958a2765 ID |
305 | case CRUSH_BUCKET_STRAW2: |
306 | err = crush_decode_straw2_bucket(p, end, | |
307 | (struct crush_bucket_straw2 *)b); | |
308 | if (err < 0) | |
309 | goto bad; | |
310 | break; | |
f24e9980 SW |
311 | } |
312 | } | |
313 | ||
314 | /* rules */ | |
315 | dout("rule vec is %p\n", c->rules); | |
316 | for (i = 0; i < c->max_rules; i++) { | |
317 | u32 yes; | |
318 | struct crush_rule *r; | |
319 | ||
293dffaa | 320 | err = -EINVAL; |
f24e9980 SW |
321 | ceph_decode_32_safe(p, end, yes, bad); |
322 | if (!yes) { | |
323 | dout("crush_decode NO rule %d off %x %p to %p\n", | |
324 | i, (int)(*p-start), *p, end); | |
325 | c->rules[i] = NULL; | |
326 | continue; | |
327 | } | |
328 | ||
329 | dout("crush_decode rule %d off %x %p to %p\n", | |
330 | i, (int)(*p-start), *p, end); | |
331 | ||
332 | /* len */ | |
333 | ceph_decode_32_safe(p, end, yes, bad); | |
334 | #if BITS_PER_LONG == 32 | |
30dc6381 | 335 | err = -EINVAL; |
64486697 XW |
336 | if (yes > (ULONG_MAX - sizeof(*r)) |
337 | / sizeof(struct crush_rule_step)) | |
f24e9980 SW |
338 | goto bad; |
339 | #endif | |
340 | r = c->rules[i] = kmalloc(sizeof(*r) + | |
341 | yes*sizeof(struct crush_rule_step), | |
342 | GFP_NOFS); | |
343 | if (r == NULL) | |
344 | goto badmem; | |
345 | dout(" rule %d is at %p\n", i, r); | |
346 | r->len = yes; | |
347 | ceph_decode_copy_safe(p, end, &r->mask, 4, bad); /* 4 u8's */ | |
348 | ceph_decode_need(p, end, r->len*3*sizeof(u32), bad); | |
349 | for (j = 0; j < r->len; j++) { | |
c89136ea SW |
350 | r->steps[j].op = ceph_decode_32(p); |
351 | r->steps[j].arg1 = ceph_decode_32(p); | |
352 | r->steps[j].arg2 = ceph_decode_32(p); | |
f24e9980 SW |
353 | } |
354 | } | |
355 | ||
356 | /* ignore trailing name maps. */ | |
546f04ef SW |
357 | for (num_name_maps = 0; num_name_maps < 3; num_name_maps++) { |
358 | err = skip_name_map(p, end); | |
359 | if (err < 0) | |
360 | goto done; | |
361 | } | |
362 | ||
363 | /* tunables */ | |
364 | ceph_decode_need(p, end, 3*sizeof(u32), done); | |
365 | c->choose_local_tries = ceph_decode_32(p); | |
366 | c->choose_local_fallback_tries = ceph_decode_32(p); | |
367 | c->choose_total_tries = ceph_decode_32(p); | |
b9b519b7 | 368 | dout("crush decode tunable choose_local_tries = %d\n", |
546f04ef | 369 | c->choose_local_tries); |
b9b519b7 | 370 | dout("crush decode tunable choose_local_fallback_tries = %d\n", |
546f04ef | 371 | c->choose_local_fallback_tries); |
b9b519b7 | 372 | dout("crush decode tunable choose_total_tries = %d\n", |
546f04ef | 373 | c->choose_total_tries); |
f24e9980 | 374 | |
1604f488 JS |
375 | ceph_decode_need(p, end, sizeof(u32), done); |
376 | c->chooseleaf_descend_once = ceph_decode_32(p); | |
b9b519b7 | 377 | dout("crush decode tunable chooseleaf_descend_once = %d\n", |
1604f488 JS |
378 | c->chooseleaf_descend_once); |
379 | ||
f140662f ID |
380 | ceph_decode_need(p, end, sizeof(u8), done); |
381 | c->chooseleaf_vary_r = ceph_decode_8(p); | |
b9b519b7 | 382 | dout("crush decode tunable chooseleaf_vary_r = %d\n", |
f140662f ID |
383 | c->chooseleaf_vary_r); |
384 | ||
b9b519b7 ID |
385 | /* skip straw_calc_version, allowed_bucket_algs */ |
386 | ceph_decode_need(p, end, sizeof(u8) + sizeof(u32), done); | |
387 | *p += sizeof(u8) + sizeof(u32); | |
388 | ||
389 | ceph_decode_need(p, end, sizeof(u8), done); | |
390 | c->chooseleaf_stable = ceph_decode_8(p); | |
391 | dout("crush decode tunable chooseleaf_stable = %d\n", | |
392 | c->chooseleaf_stable); | |
393 | ||
546f04ef | 394 | done: |
9afd30db | 395 | crush_finalize(c); |
f24e9980 SW |
396 | dout("crush_decode success\n"); |
397 | return c; | |
398 | ||
399 | badmem: | |
400 | err = -ENOMEM; | |
401 | bad: | |
402 | dout("crush_decode fail %d\n", err); | |
403 | crush_destroy(c); | |
404 | return ERR_PTR(err); | |
405 | } | |
406 | ||
f984cb76 | 407 | int ceph_pg_compare(const struct ceph_pg *lhs, const struct ceph_pg *rhs) |
51042122 | 408 | { |
f984cb76 | 409 | if (lhs->pool < rhs->pool) |
5b191d99 | 410 | return -1; |
f984cb76 | 411 | if (lhs->pool > rhs->pool) |
5b191d99 | 412 | return 1; |
f984cb76 | 413 | if (lhs->seed < rhs->seed) |
51042122 | 414 | return -1; |
f984cb76 | 415 | if (lhs->seed > rhs->seed) |
51042122 | 416 | return 1; |
f984cb76 | 417 | |
51042122 SW |
418 | return 0; |
419 | } | |
420 | ||
f984cb76 ID |
421 | /* |
422 | * rbtree of pg_mapping for handling pg_temp (explicit mapping of pgid | |
423 | * to a set of osds) and primary_temp (explicit primary setting) | |
424 | */ | |
991abb6e SW |
425 | static int __insert_pg_mapping(struct ceph_pg_mapping *new, |
426 | struct rb_root *root) | |
f24e9980 SW |
427 | { |
428 | struct rb_node **p = &root->rb_node; | |
429 | struct rb_node *parent = NULL; | |
430 | struct ceph_pg_mapping *pg = NULL; | |
51042122 | 431 | int c; |
f24e9980 | 432 | |
8adc8b3d | 433 | dout("__insert_pg_mapping %llx %p\n", *(u64 *)&new->pgid, new); |
f24e9980 SW |
434 | while (*p) { |
435 | parent = *p; | |
436 | pg = rb_entry(parent, struct ceph_pg_mapping, node); | |
f984cb76 | 437 | c = ceph_pg_compare(&new->pgid, &pg->pgid); |
51042122 | 438 | if (c < 0) |
f24e9980 | 439 | p = &(*p)->rb_left; |
51042122 | 440 | else if (c > 0) |
f24e9980 SW |
441 | p = &(*p)->rb_right; |
442 | else | |
991abb6e | 443 | return -EEXIST; |
f24e9980 SW |
444 | } |
445 | ||
446 | rb_link_node(&new->node, parent, p); | |
447 | rb_insert_color(&new->node, root); | |
991abb6e | 448 | return 0; |
f24e9980 SW |
449 | } |
450 | ||
9794b146 | 451 | static struct ceph_pg_mapping *__lookup_pg_mapping(struct rb_root *root, |
5b191d99 | 452 | struct ceph_pg pgid) |
9794b146 SW |
453 | { |
454 | struct rb_node *n = root->rb_node; | |
455 | struct ceph_pg_mapping *pg; | |
456 | int c; | |
457 | ||
458 | while (n) { | |
459 | pg = rb_entry(n, struct ceph_pg_mapping, node); | |
f984cb76 | 460 | c = ceph_pg_compare(&pgid, &pg->pgid); |
8adc8b3d | 461 | if (c < 0) { |
9794b146 | 462 | n = n->rb_left; |
8adc8b3d | 463 | } else if (c > 0) { |
9794b146 | 464 | n = n->rb_right; |
8adc8b3d | 465 | } else { |
5b191d99 SW |
466 | dout("__lookup_pg_mapping %lld.%x got %p\n", |
467 | pgid.pool, pgid.seed, pg); | |
9794b146 | 468 | return pg; |
8adc8b3d | 469 | } |
9794b146 SW |
470 | } |
471 | return NULL; | |
472 | } | |
473 | ||
5b191d99 | 474 | static int __remove_pg_mapping(struct rb_root *root, struct ceph_pg pgid) |
8adc8b3d SW |
475 | { |
476 | struct ceph_pg_mapping *pg = __lookup_pg_mapping(root, pgid); | |
477 | ||
478 | if (pg) { | |
5b191d99 SW |
479 | dout("__remove_pg_mapping %lld.%x %p\n", pgid.pool, pgid.seed, |
480 | pg); | |
8adc8b3d SW |
481 | rb_erase(&pg->node, root); |
482 | kfree(pg); | |
483 | return 0; | |
484 | } | |
5b191d99 | 485 | dout("__remove_pg_mapping %lld.%x dne\n", pgid.pool, pgid.seed); |
8adc8b3d SW |
486 | return -ENOENT; |
487 | } | |
488 | ||
4fc51be8 SW |
489 | /* |
490 | * rbtree of pg pool info | |
491 | */ | |
492 | static int __insert_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *new) | |
493 | { | |
494 | struct rb_node **p = &root->rb_node; | |
495 | struct rb_node *parent = NULL; | |
496 | struct ceph_pg_pool_info *pi = NULL; | |
497 | ||
498 | while (*p) { | |
499 | parent = *p; | |
500 | pi = rb_entry(parent, struct ceph_pg_pool_info, node); | |
501 | if (new->id < pi->id) | |
502 | p = &(*p)->rb_left; | |
503 | else if (new->id > pi->id) | |
504 | p = &(*p)->rb_right; | |
505 | else | |
506 | return -EEXIST; | |
507 | } | |
508 | ||
509 | rb_link_node(&new->node, parent, p); | |
510 | rb_insert_color(&new->node, root); | |
511 | return 0; | |
512 | } | |
513 | ||
4f6a7e5e | 514 | static struct ceph_pg_pool_info *__lookup_pg_pool(struct rb_root *root, u64 id) |
4fc51be8 SW |
515 | { |
516 | struct ceph_pg_pool_info *pi; | |
517 | struct rb_node *n = root->rb_node; | |
518 | ||
519 | while (n) { | |
520 | pi = rb_entry(n, struct ceph_pg_pool_info, node); | |
521 | if (id < pi->id) | |
522 | n = n->rb_left; | |
523 | else if (id > pi->id) | |
524 | n = n->rb_right; | |
525 | else | |
526 | return pi; | |
527 | } | |
528 | return NULL; | |
529 | } | |
530 | ||
ce7f6a27 ID |
531 | struct ceph_pg_pool_info *ceph_pg_pool_by_id(struct ceph_osdmap *map, u64 id) |
532 | { | |
533 | return __lookup_pg_pool(&map->pg_pools, id); | |
534 | } | |
535 | ||
72afc71f AE |
536 | const char *ceph_pg_pool_name_by_id(struct ceph_osdmap *map, u64 id) |
537 | { | |
538 | struct ceph_pg_pool_info *pi; | |
539 | ||
540 | if (id == CEPH_NOPOOL) | |
541 | return NULL; | |
542 | ||
543 | if (WARN_ON_ONCE(id > (u64) INT_MAX)) | |
544 | return NULL; | |
545 | ||
546 | pi = __lookup_pg_pool(&map->pg_pools, (int) id); | |
547 | ||
548 | return pi ? pi->name : NULL; | |
549 | } | |
550 | EXPORT_SYMBOL(ceph_pg_pool_name_by_id); | |
551 | ||
7669a2c9 YS |
552 | int ceph_pg_poolid_by_name(struct ceph_osdmap *map, const char *name) |
553 | { | |
554 | struct rb_node *rbp; | |
555 | ||
556 | for (rbp = rb_first(&map->pg_pools); rbp; rbp = rb_next(rbp)) { | |
557 | struct ceph_pg_pool_info *pi = | |
558 | rb_entry(rbp, struct ceph_pg_pool_info, node); | |
559 | if (pi->name && strcmp(pi->name, name) == 0) | |
560 | return pi->id; | |
561 | } | |
562 | return -ENOENT; | |
563 | } | |
3d14c5d2 | 564 | EXPORT_SYMBOL(ceph_pg_poolid_by_name); |
7669a2c9 | 565 | |
2844a76a SW |
566 | static void __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi) |
567 | { | |
568 | rb_erase(&pi->node, root); | |
569 | kfree(pi->name); | |
570 | kfree(pi); | |
571 | } | |
572 | ||
0f70c7ee | 573 | static int decode_pool(void **p, void *end, struct ceph_pg_pool_info *pi) |
efd7576b | 574 | { |
4f6a7e5e SW |
575 | u8 ev, cv; |
576 | unsigned len, num; | |
577 | void *pool_end; | |
578 | ||
579 | ceph_decode_need(p, end, 2 + 4, bad); | |
580 | ev = ceph_decode_8(p); /* encoding version */ | |
581 | cv = ceph_decode_8(p); /* compat version */ | |
582 | if (ev < 5) { | |
b9a67899 | 583 | pr_warn("got v %d < 5 cv %d of ceph_pg_pool\n", ev, cv); |
4f6a7e5e SW |
584 | return -EINVAL; |
585 | } | |
17a13e40 | 586 | if (cv > 9) { |
b9a67899 | 587 | pr_warn("got v %d cv %d > 9 of ceph_pg_pool\n", ev, cv); |
4f6a7e5e SW |
588 | return -EINVAL; |
589 | } | |
590 | len = ceph_decode_32(p); | |
591 | ceph_decode_need(p, end, len, bad); | |
592 | pool_end = *p + len; | |
73a7e693 | 593 | |
4f6a7e5e SW |
594 | pi->type = ceph_decode_8(p); |
595 | pi->size = ceph_decode_8(p); | |
596 | pi->crush_ruleset = ceph_decode_8(p); | |
597 | pi->object_hash = ceph_decode_8(p); | |
73a7e693 | 598 | |
4f6a7e5e SW |
599 | pi->pg_num = ceph_decode_32(p); |
600 | pi->pgp_num = ceph_decode_32(p); | |
601 | ||
602 | *p += 4 + 4; /* skip lpg* */ | |
603 | *p += 4; /* skip last_change */ | |
604 | *p += 8 + 4; /* skip snap_seq, snap_epoch */ | |
605 | ||
606 | /* skip snaps */ | |
607 | num = ceph_decode_32(p); | |
608 | while (num--) { | |
609 | *p += 8; /* snapid key */ | |
610 | *p += 1 + 1; /* versions */ | |
611 | len = ceph_decode_32(p); | |
612 | *p += len; | |
73a7e693 SW |
613 | } |
614 | ||
17a13e40 | 615 | /* skip removed_snaps */ |
4f6a7e5e SW |
616 | num = ceph_decode_32(p); |
617 | *p += num * (8 + 8); | |
618 | ||
619 | *p += 8; /* skip auid */ | |
620 | pi->flags = ceph_decode_64(p); | |
17a13e40 ID |
621 | *p += 4; /* skip crash_replay_interval */ |
622 | ||
623 | if (ev >= 7) | |
04812acf ID |
624 | pi->min_size = ceph_decode_8(p); |
625 | else | |
626 | pi->min_size = pi->size - pi->size / 2; | |
17a13e40 ID |
627 | |
628 | if (ev >= 8) | |
629 | *p += 8 + 8; /* skip quota_max_* */ | |
630 | ||
631 | if (ev >= 9) { | |
632 | /* skip tiers */ | |
633 | num = ceph_decode_32(p); | |
634 | *p += num * 8; | |
635 | ||
636 | *p += 8; /* skip tier_of */ | |
637 | *p += 1; /* skip cache_mode */ | |
638 | ||
639 | pi->read_tier = ceph_decode_64(p); | |
640 | pi->write_tier = ceph_decode_64(p); | |
641 | } else { | |
642 | pi->read_tier = -1; | |
643 | pi->write_tier = -1; | |
644 | } | |
4f6a7e5e | 645 | |
04812acf ID |
646 | if (ev >= 10) { |
647 | /* skip properties */ | |
648 | num = ceph_decode_32(p); | |
649 | while (num--) { | |
650 | len = ceph_decode_32(p); | |
651 | *p += len; /* key */ | |
652 | len = ceph_decode_32(p); | |
653 | *p += len; /* val */ | |
654 | } | |
655 | } | |
656 | ||
657 | if (ev >= 11) { | |
658 | /* skip hit_set_params */ | |
659 | *p += 1 + 1; /* versions */ | |
660 | len = ceph_decode_32(p); | |
661 | *p += len; | |
662 | ||
663 | *p += 4; /* skip hit_set_period */ | |
664 | *p += 4; /* skip hit_set_count */ | |
665 | } | |
666 | ||
667 | if (ev >= 12) | |
668 | *p += 4; /* skip stripe_width */ | |
669 | ||
670 | if (ev >= 13) { | |
671 | *p += 8; /* skip target_max_bytes */ | |
672 | *p += 8; /* skip target_max_objects */ | |
673 | *p += 4; /* skip cache_target_dirty_ratio_micro */ | |
674 | *p += 4; /* skip cache_target_full_ratio_micro */ | |
675 | *p += 4; /* skip cache_min_flush_age */ | |
676 | *p += 4; /* skip cache_min_evict_age */ | |
677 | } | |
678 | ||
679 | if (ev >= 14) { | |
680 | /* skip erasure_code_profile */ | |
681 | len = ceph_decode_32(p); | |
682 | *p += len; | |
683 | } | |
684 | ||
685 | if (ev >= 15) | |
686 | pi->last_force_request_resend = ceph_decode_32(p); | |
687 | else | |
688 | pi->last_force_request_resend = 0; | |
689 | ||
4f6a7e5e SW |
690 | /* ignore the rest */ |
691 | ||
692 | *p = pool_end; | |
693 | calc_pg_masks(pi); | |
73a7e693 SW |
694 | return 0; |
695 | ||
696 | bad: | |
697 | return -EINVAL; | |
efd7576b SW |
698 | } |
699 | ||
0f70c7ee | 700 | static int decode_pool_names(void **p, void *end, struct ceph_osdmap *map) |
2844a76a SW |
701 | { |
702 | struct ceph_pg_pool_info *pi; | |
4f6a7e5e SW |
703 | u32 num, len; |
704 | u64 pool; | |
2844a76a SW |
705 | |
706 | ceph_decode_32_safe(p, end, num, bad); | |
707 | dout(" %d pool names\n", num); | |
708 | while (num--) { | |
4f6a7e5e | 709 | ceph_decode_64_safe(p, end, pool, bad); |
2844a76a | 710 | ceph_decode_32_safe(p, end, len, bad); |
4f6a7e5e | 711 | dout(" pool %llu len %d\n", pool, len); |
ad3b904c | 712 | ceph_decode_need(p, end, len, bad); |
2844a76a SW |
713 | pi = __lookup_pg_pool(&map->pg_pools, pool); |
714 | if (pi) { | |
ad3b904c XW |
715 | char *name = kstrndup(*p, len, GFP_NOFS); |
716 | ||
717 | if (!name) | |
718 | return -ENOMEM; | |
2844a76a | 719 | kfree(pi->name); |
ad3b904c XW |
720 | pi->name = name; |
721 | dout(" name is %s\n", pi->name); | |
2844a76a SW |
722 | } |
723 | *p += len; | |
724 | } | |
725 | return 0; | |
726 | ||
727 | bad: | |
728 | return -EINVAL; | |
729 | } | |
730 | ||
731 | /* | |
732 | * osd map | |
733 | */ | |
e5253a7b ID |
734 | struct ceph_osdmap *ceph_osdmap_alloc(void) |
735 | { | |
736 | struct ceph_osdmap *map; | |
737 | ||
738 | map = kzalloc(sizeof(*map), GFP_NOIO); | |
739 | if (!map) | |
740 | return NULL; | |
741 | ||
742 | map->pg_pools = RB_ROOT; | |
743 | map->pool_max = -1; | |
744 | map->pg_temp = RB_ROOT; | |
745 | map->primary_temp = RB_ROOT; | |
743efcff | 746 | mutex_init(&map->crush_workspace_mutex); |
e5253a7b ID |
747 | |
748 | return map; | |
749 | } | |
750 | ||
2844a76a SW |
751 | void ceph_osdmap_destroy(struct ceph_osdmap *map) |
752 | { | |
753 | dout("osdmap_destroy %p\n", map); | |
754 | if (map->crush) | |
755 | crush_destroy(map->crush); | |
756 | while (!RB_EMPTY_ROOT(&map->pg_temp)) { | |
757 | struct ceph_pg_mapping *pg = | |
758 | rb_entry(rb_first(&map->pg_temp), | |
759 | struct ceph_pg_mapping, node); | |
760 | rb_erase(&pg->node, &map->pg_temp); | |
761 | kfree(pg); | |
762 | } | |
9686f94c ID |
763 | while (!RB_EMPTY_ROOT(&map->primary_temp)) { |
764 | struct ceph_pg_mapping *pg = | |
765 | rb_entry(rb_first(&map->primary_temp), | |
766 | struct ceph_pg_mapping, node); | |
767 | rb_erase(&pg->node, &map->primary_temp); | |
768 | kfree(pg); | |
769 | } | |
2844a76a SW |
770 | while (!RB_EMPTY_ROOT(&map->pg_pools)) { |
771 | struct ceph_pg_pool_info *pi = | |
772 | rb_entry(rb_first(&map->pg_pools), | |
773 | struct ceph_pg_pool_info, node); | |
774 | __remove_pg_pool(&map->pg_pools, pi); | |
775 | } | |
776 | kfree(map->osd_state); | |
777 | kfree(map->osd_weight); | |
778 | kfree(map->osd_addr); | |
2cfa34f2 | 779 | kfree(map->osd_primary_affinity); |
66a0e2d5 | 780 | kfree(map->crush_workspace); |
2844a76a SW |
781 | kfree(map); |
782 | } | |
783 | ||
784 | /* | |
4d60351f ID |
785 | * Adjust max_osd value, (re)allocate arrays. |
786 | * | |
787 | * The new elements are properly initialized. | |
2844a76a SW |
788 | */ |
789 | static int osdmap_set_max_osd(struct ceph_osdmap *map, int max) | |
790 | { | |
791 | u8 *state; | |
2844a76a | 792 | u32 *weight; |
4d60351f ID |
793 | struct ceph_entity_addr *addr; |
794 | int i; | |
2844a76a | 795 | |
4d60351f | 796 | state = krealloc(map->osd_state, max*sizeof(*state), GFP_NOFS); |
589506f1 LR |
797 | if (!state) |
798 | return -ENOMEM; | |
799 | map->osd_state = state; | |
800 | ||
4d60351f | 801 | weight = krealloc(map->osd_weight, max*sizeof(*weight), GFP_NOFS); |
589506f1 LR |
802 | if (!weight) |
803 | return -ENOMEM; | |
804 | map->osd_weight = weight; | |
4d60351f | 805 | |
589506f1 LR |
806 | addr = krealloc(map->osd_addr, max*sizeof(*addr), GFP_NOFS); |
807 | if (!addr) | |
2844a76a | 808 | return -ENOMEM; |
589506f1 | 809 | map->osd_addr = addr; |
2844a76a | 810 | |
4d60351f | 811 | for (i = map->max_osd; i < max; i++) { |
589506f1 LR |
812 | map->osd_state[i] = 0; |
813 | map->osd_weight[i] = CEPH_OSD_OUT; | |
814 | memset(map->osd_addr + i, 0, sizeof(*map->osd_addr)); | |
2844a76a SW |
815 | } |
816 | ||
2cfa34f2 ID |
817 | if (map->osd_primary_affinity) { |
818 | u32 *affinity; | |
819 | ||
820 | affinity = krealloc(map->osd_primary_affinity, | |
821 | max*sizeof(*affinity), GFP_NOFS); | |
822 | if (!affinity) | |
823 | return -ENOMEM; | |
589506f1 | 824 | map->osd_primary_affinity = affinity; |
2cfa34f2 ID |
825 | |
826 | for (i = map->max_osd; i < max; i++) | |
589506f1 LR |
827 | map->osd_primary_affinity[i] = |
828 | CEPH_OSD_DEFAULT_PRIMARY_AFFINITY; | |
2cfa34f2 ID |
829 | } |
830 | ||
2844a76a | 831 | map->max_osd = max; |
4d60351f | 832 | |
2844a76a SW |
833 | return 0; |
834 | } | |
835 | ||
1b6a78b5 ID |
836 | static int osdmap_set_crush(struct ceph_osdmap *map, struct crush_map *crush) |
837 | { | |
66a0e2d5 | 838 | void *workspace; |
743efcff | 839 | size_t work_size; |
66a0e2d5 | 840 | |
1b6a78b5 ID |
841 | if (IS_ERR(crush)) |
842 | return PTR_ERR(crush); | |
843 | ||
743efcff ID |
844 | work_size = crush_work_size(crush, CEPH_PG_MAX_SIZE); |
845 | dout("%s work_size %zu bytes\n", __func__, work_size); | |
846 | workspace = kmalloc(work_size, GFP_NOIO); | |
66a0e2d5 ID |
847 | if (!workspace) { |
848 | crush_destroy(crush); | |
849 | return -ENOMEM; | |
850 | } | |
851 | crush_init_workspace(crush, workspace); | |
852 | ||
1b6a78b5 ID |
853 | if (map->crush) |
854 | crush_destroy(map->crush); | |
66a0e2d5 | 855 | kfree(map->crush_workspace); |
1b6a78b5 | 856 | map->crush = crush; |
66a0e2d5 | 857 | map->crush_workspace = workspace; |
1b6a78b5 ID |
858 | return 0; |
859 | } | |
860 | ||
ec7af972 ID |
861 | #define OSDMAP_WRAPPER_COMPAT_VER 7 |
862 | #define OSDMAP_CLIENT_DATA_COMPAT_VER 1 | |
863 | ||
864 | /* | |
865 | * Return 0 or error. On success, *v is set to 0 for old (v6) osdmaps, | |
866 | * to struct_v of the client_data section for new (v7 and above) | |
867 | * osdmaps. | |
868 | */ | |
869 | static int get_osdmap_client_data_v(void **p, void *end, | |
870 | const char *prefix, u8 *v) | |
871 | { | |
872 | u8 struct_v; | |
873 | ||
874 | ceph_decode_8_safe(p, end, struct_v, e_inval); | |
875 | if (struct_v >= 7) { | |
876 | u8 struct_compat; | |
877 | ||
878 | ceph_decode_8_safe(p, end, struct_compat, e_inval); | |
879 | if (struct_compat > OSDMAP_WRAPPER_COMPAT_VER) { | |
b9a67899 JP |
880 | pr_warn("got v %d cv %d > %d of %s ceph_osdmap\n", |
881 | struct_v, struct_compat, | |
882 | OSDMAP_WRAPPER_COMPAT_VER, prefix); | |
ec7af972 ID |
883 | return -EINVAL; |
884 | } | |
885 | *p += 4; /* ignore wrapper struct_len */ | |
886 | ||
887 | ceph_decode_8_safe(p, end, struct_v, e_inval); | |
888 | ceph_decode_8_safe(p, end, struct_compat, e_inval); | |
889 | if (struct_compat > OSDMAP_CLIENT_DATA_COMPAT_VER) { | |
b9a67899 JP |
890 | pr_warn("got v %d cv %d > %d of %s ceph_osdmap client data\n", |
891 | struct_v, struct_compat, | |
892 | OSDMAP_CLIENT_DATA_COMPAT_VER, prefix); | |
ec7af972 ID |
893 | return -EINVAL; |
894 | } | |
895 | *p += 4; /* ignore client data struct_len */ | |
896 | } else { | |
897 | u16 version; | |
898 | ||
899 | *p -= 1; | |
900 | ceph_decode_16_safe(p, end, version, e_inval); | |
901 | if (version < 6) { | |
b9a67899 JP |
902 | pr_warn("got v %d < 6 of %s ceph_osdmap\n", |
903 | version, prefix); | |
ec7af972 ID |
904 | return -EINVAL; |
905 | } | |
906 | ||
907 | /* old osdmap enconding */ | |
908 | struct_v = 0; | |
909 | } | |
910 | ||
911 | *v = struct_v; | |
912 | return 0; | |
913 | ||
914 | e_inval: | |
915 | return -EINVAL; | |
916 | } | |
917 | ||
433fbdd3 ID |
918 | static int __decode_pools(void **p, void *end, struct ceph_osdmap *map, |
919 | bool incremental) | |
920 | { | |
921 | u32 n; | |
922 | ||
923 | ceph_decode_32_safe(p, end, n, e_inval); | |
924 | while (n--) { | |
925 | struct ceph_pg_pool_info *pi; | |
926 | u64 pool; | |
927 | int ret; | |
928 | ||
929 | ceph_decode_64_safe(p, end, pool, e_inval); | |
930 | ||
931 | pi = __lookup_pg_pool(&map->pg_pools, pool); | |
932 | if (!incremental || !pi) { | |
933 | pi = kzalloc(sizeof(*pi), GFP_NOFS); | |
934 | if (!pi) | |
935 | return -ENOMEM; | |
936 | ||
937 | pi->id = pool; | |
938 | ||
939 | ret = __insert_pg_pool(&map->pg_pools, pi); | |
940 | if (ret) { | |
941 | kfree(pi); | |
942 | return ret; | |
943 | } | |
944 | } | |
945 | ||
946 | ret = decode_pool(p, end, pi); | |
947 | if (ret) | |
948 | return ret; | |
949 | } | |
950 | ||
951 | return 0; | |
952 | ||
953 | e_inval: | |
954 | return -EINVAL; | |
955 | } | |
956 | ||
957 | static int decode_pools(void **p, void *end, struct ceph_osdmap *map) | |
958 | { | |
959 | return __decode_pools(p, end, map, false); | |
960 | } | |
961 | ||
962 | static int decode_new_pools(void **p, void *end, struct ceph_osdmap *map) | |
963 | { | |
964 | return __decode_pools(p, end, map, true); | |
965 | } | |
966 | ||
10db634e ID |
967 | static int __decode_pg_temp(void **p, void *end, struct ceph_osdmap *map, |
968 | bool incremental) | |
969 | { | |
970 | u32 n; | |
971 | ||
972 | ceph_decode_32_safe(p, end, n, e_inval); | |
973 | while (n--) { | |
974 | struct ceph_pg pgid; | |
975 | u32 len, i; | |
976 | int ret; | |
977 | ||
978 | ret = ceph_decode_pgid(p, end, &pgid); | |
979 | if (ret) | |
980 | return ret; | |
981 | ||
982 | ceph_decode_32_safe(p, end, len, e_inval); | |
983 | ||
984 | ret = __remove_pg_mapping(&map->pg_temp, pgid); | |
985 | BUG_ON(!incremental && ret != -ENOENT); | |
986 | ||
987 | if (!incremental || len > 0) { | |
988 | struct ceph_pg_mapping *pg; | |
989 | ||
990 | ceph_decode_need(p, end, len*sizeof(u32), e_inval); | |
991 | ||
992 | if (len > (UINT_MAX - sizeof(*pg)) / sizeof(u32)) | |
993 | return -EINVAL; | |
994 | ||
995 | pg = kzalloc(sizeof(*pg) + len*sizeof(u32), GFP_NOFS); | |
996 | if (!pg) | |
997 | return -ENOMEM; | |
998 | ||
999 | pg->pgid = pgid; | |
35a935d7 | 1000 | pg->pg_temp.len = len; |
10db634e | 1001 | for (i = 0; i < len; i++) |
35a935d7 | 1002 | pg->pg_temp.osds[i] = ceph_decode_32(p); |
10db634e ID |
1003 | |
1004 | ret = __insert_pg_mapping(pg, &map->pg_temp); | |
1005 | if (ret) { | |
1006 | kfree(pg); | |
1007 | return ret; | |
1008 | } | |
1009 | } | |
1010 | } | |
1011 | ||
1012 | return 0; | |
1013 | ||
1014 | e_inval: | |
1015 | return -EINVAL; | |
1016 | } | |
1017 | ||
1018 | static int decode_pg_temp(void **p, void *end, struct ceph_osdmap *map) | |
1019 | { | |
1020 | return __decode_pg_temp(p, end, map, false); | |
1021 | } | |
1022 | ||
1023 | static int decode_new_pg_temp(void **p, void *end, struct ceph_osdmap *map) | |
1024 | { | |
1025 | return __decode_pg_temp(p, end, map, true); | |
1026 | } | |
1027 | ||
d286de79 ID |
1028 | static int __decode_primary_temp(void **p, void *end, struct ceph_osdmap *map, |
1029 | bool incremental) | |
1030 | { | |
1031 | u32 n; | |
1032 | ||
1033 | ceph_decode_32_safe(p, end, n, e_inval); | |
1034 | while (n--) { | |
1035 | struct ceph_pg pgid; | |
1036 | u32 osd; | |
1037 | int ret; | |
1038 | ||
1039 | ret = ceph_decode_pgid(p, end, &pgid); | |
1040 | if (ret) | |
1041 | return ret; | |
1042 | ||
1043 | ceph_decode_32_safe(p, end, osd, e_inval); | |
1044 | ||
1045 | ret = __remove_pg_mapping(&map->primary_temp, pgid); | |
1046 | BUG_ON(!incremental && ret != -ENOENT); | |
1047 | ||
1048 | if (!incremental || osd != (u32)-1) { | |
1049 | struct ceph_pg_mapping *pg; | |
1050 | ||
1051 | pg = kzalloc(sizeof(*pg), GFP_NOFS); | |
1052 | if (!pg) | |
1053 | return -ENOMEM; | |
1054 | ||
1055 | pg->pgid = pgid; | |
1056 | pg->primary_temp.osd = osd; | |
1057 | ||
1058 | ret = __insert_pg_mapping(pg, &map->primary_temp); | |
1059 | if (ret) { | |
1060 | kfree(pg); | |
1061 | return ret; | |
1062 | } | |
1063 | } | |
1064 | } | |
1065 | ||
1066 | return 0; | |
1067 | ||
1068 | e_inval: | |
1069 | return -EINVAL; | |
1070 | } | |
1071 | ||
1072 | static int decode_primary_temp(void **p, void *end, struct ceph_osdmap *map) | |
1073 | { | |
1074 | return __decode_primary_temp(p, end, map, false); | |
1075 | } | |
1076 | ||
1077 | static int decode_new_primary_temp(void **p, void *end, | |
1078 | struct ceph_osdmap *map) | |
1079 | { | |
1080 | return __decode_primary_temp(p, end, map, true); | |
1081 | } | |
1082 | ||
2cfa34f2 ID |
1083 | u32 ceph_get_primary_affinity(struct ceph_osdmap *map, int osd) |
1084 | { | |
1085 | BUG_ON(osd >= map->max_osd); | |
1086 | ||
1087 | if (!map->osd_primary_affinity) | |
1088 | return CEPH_OSD_DEFAULT_PRIMARY_AFFINITY; | |
1089 | ||
1090 | return map->osd_primary_affinity[osd]; | |
1091 | } | |
1092 | ||
1093 | static int set_primary_affinity(struct ceph_osdmap *map, int osd, u32 aff) | |
1094 | { | |
1095 | BUG_ON(osd >= map->max_osd); | |
1096 | ||
1097 | if (!map->osd_primary_affinity) { | |
1098 | int i; | |
1099 | ||
1100 | map->osd_primary_affinity = kmalloc(map->max_osd*sizeof(u32), | |
1101 | GFP_NOFS); | |
1102 | if (!map->osd_primary_affinity) | |
1103 | return -ENOMEM; | |
1104 | ||
1105 | for (i = 0; i < map->max_osd; i++) | |
1106 | map->osd_primary_affinity[i] = | |
1107 | CEPH_OSD_DEFAULT_PRIMARY_AFFINITY; | |
1108 | } | |
1109 | ||
1110 | map->osd_primary_affinity[osd] = aff; | |
1111 | ||
1112 | return 0; | |
1113 | } | |
1114 | ||
63a6993f ID |
1115 | static int decode_primary_affinity(void **p, void *end, |
1116 | struct ceph_osdmap *map) | |
1117 | { | |
1118 | u32 len, i; | |
1119 | ||
1120 | ceph_decode_32_safe(p, end, len, e_inval); | |
1121 | if (len == 0) { | |
1122 | kfree(map->osd_primary_affinity); | |
1123 | map->osd_primary_affinity = NULL; | |
1124 | return 0; | |
1125 | } | |
1126 | if (len != map->max_osd) | |
1127 | goto e_inval; | |
1128 | ||
1129 | ceph_decode_need(p, end, map->max_osd*sizeof(u32), e_inval); | |
1130 | ||
1131 | for (i = 0; i < map->max_osd; i++) { | |
1132 | int ret; | |
1133 | ||
1134 | ret = set_primary_affinity(map, i, ceph_decode_32(p)); | |
1135 | if (ret) | |
1136 | return ret; | |
1137 | } | |
1138 | ||
1139 | return 0; | |
1140 | ||
1141 | e_inval: | |
1142 | return -EINVAL; | |
1143 | } | |
1144 | ||
1145 | static int decode_new_primary_affinity(void **p, void *end, | |
1146 | struct ceph_osdmap *map) | |
1147 | { | |
1148 | u32 n; | |
1149 | ||
1150 | ceph_decode_32_safe(p, end, n, e_inval); | |
1151 | while (n--) { | |
1152 | u32 osd, aff; | |
1153 | int ret; | |
1154 | ||
1155 | ceph_decode_32_safe(p, end, osd, e_inval); | |
1156 | ceph_decode_32_safe(p, end, aff, e_inval); | |
1157 | ||
1158 | ret = set_primary_affinity(map, osd, aff); | |
1159 | if (ret) | |
1160 | return ret; | |
f31da0f3 ID |
1161 | |
1162 | pr_info("osd%d primary-affinity 0x%x\n", osd, aff); | |
63a6993f ID |
1163 | } |
1164 | ||
1165 | return 0; | |
1166 | ||
1167 | e_inval: | |
1168 | return -EINVAL; | |
1169 | } | |
1170 | ||
f24e9980 SW |
1171 | /* |
1172 | * decode a full map. | |
1173 | */ | |
a2505d63 | 1174 | static int osdmap_decode(void **p, void *end, struct ceph_osdmap *map) |
f24e9980 | 1175 | { |
ec7af972 | 1176 | u8 struct_v; |
38a8d560 | 1177 | u32 epoch = 0; |
f24e9980 | 1178 | void *start = *p; |
3977058c ID |
1179 | u32 max; |
1180 | u32 len, i; | |
597b52f6 | 1181 | int err; |
f24e9980 | 1182 | |
a2505d63 | 1183 | dout("%s %p to %p len %d\n", __func__, *p, end, (int)(end - *p)); |
f24e9980 | 1184 | |
ec7af972 ID |
1185 | err = get_osdmap_client_data_v(p, end, "full", &struct_v); |
1186 | if (err) | |
1187 | goto bad; | |
f24e9980 | 1188 | |
53bbaba9 ID |
1189 | /* fsid, epoch, created, modified */ |
1190 | ceph_decode_need(p, end, sizeof(map->fsid) + sizeof(u32) + | |
1191 | sizeof(map->created) + sizeof(map->modified), e_inval); | |
f24e9980 | 1192 | ceph_decode_copy(p, &map->fsid, sizeof(map->fsid)); |
38a8d560 | 1193 | epoch = map->epoch = ceph_decode_32(p); |
f24e9980 SW |
1194 | ceph_decode_copy(p, &map->created, sizeof(map->created)); |
1195 | ceph_decode_copy(p, &map->modified, sizeof(map->modified)); | |
1196 | ||
433fbdd3 ID |
1197 | /* pools */ |
1198 | err = decode_pools(p, end, map); | |
1199 | if (err) | |
1200 | goto bad; | |
2844a76a | 1201 | |
0f70c7ee ID |
1202 | /* pool_name */ |
1203 | err = decode_pool_names(p, end, map); | |
597b52f6 | 1204 | if (err) |
4f6a7e5e | 1205 | goto bad; |
2844a76a | 1206 | |
597b52f6 | 1207 | ceph_decode_32_safe(p, end, map->pool_max, e_inval); |
f24e9980 | 1208 | |
597b52f6 | 1209 | ceph_decode_32_safe(p, end, map->flags, e_inval); |
f24e9980 | 1210 | |
3977058c ID |
1211 | /* max_osd */ |
1212 | ceph_decode_32_safe(p, end, max, e_inval); | |
f24e9980 SW |
1213 | |
1214 | /* (re)alloc osd arrays */ | |
1215 | err = osdmap_set_max_osd(map, max); | |
597b52f6 | 1216 | if (err) |
f24e9980 | 1217 | goto bad; |
f24e9980 | 1218 | |
2d88b2e0 | 1219 | /* osd_state, osd_weight, osd_addrs->client_addr */ |
f24e9980 SW |
1220 | ceph_decode_need(p, end, 3*sizeof(u32) + |
1221 | map->max_osd*(1 + sizeof(*map->osd_weight) + | |
597b52f6 ID |
1222 | sizeof(*map->osd_addr)), e_inval); |
1223 | ||
2d88b2e0 ID |
1224 | if (ceph_decode_32(p) != map->max_osd) |
1225 | goto e_inval; | |
1226 | ||
f24e9980 SW |
1227 | ceph_decode_copy(p, map->osd_state, map->max_osd); |
1228 | ||
2d88b2e0 ID |
1229 | if (ceph_decode_32(p) != map->max_osd) |
1230 | goto e_inval; | |
1231 | ||
f24e9980 | 1232 | for (i = 0; i < map->max_osd; i++) |
c89136ea | 1233 | map->osd_weight[i] = ceph_decode_32(p); |
f24e9980 | 1234 | |
2d88b2e0 ID |
1235 | if (ceph_decode_32(p) != map->max_osd) |
1236 | goto e_inval; | |
1237 | ||
f24e9980 | 1238 | ceph_decode_copy(p, map->osd_addr, map->max_osd*sizeof(*map->osd_addr)); |
63f2d211 SW |
1239 | for (i = 0; i < map->max_osd; i++) |
1240 | ceph_decode_addr(&map->osd_addr[i]); | |
f24e9980 SW |
1241 | |
1242 | /* pg_temp */ | |
10db634e ID |
1243 | err = decode_pg_temp(p, end, map); |
1244 | if (err) | |
1245 | goto bad; | |
f24e9980 | 1246 | |
d286de79 ID |
1247 | /* primary_temp */ |
1248 | if (struct_v >= 1) { | |
1249 | err = decode_primary_temp(p, end, map); | |
1250 | if (err) | |
1251 | goto bad; | |
1252 | } | |
1253 | ||
63a6993f ID |
1254 | /* primary_affinity */ |
1255 | if (struct_v >= 2) { | |
1256 | err = decode_primary_affinity(p, end, map); | |
1257 | if (err) | |
1258 | goto bad; | |
1259 | } else { | |
1260 | /* XXX can this happen? */ | |
1261 | kfree(map->osd_primary_affinity); | |
1262 | map->osd_primary_affinity = NULL; | |
1263 | } | |
1264 | ||
f24e9980 | 1265 | /* crush */ |
597b52f6 | 1266 | ceph_decode_32_safe(p, end, len, e_inval); |
1b6a78b5 ID |
1267 | err = osdmap_set_crush(map, crush_decode(*p, min(*p + len, end))); |
1268 | if (err) | |
f24e9980 | 1269 | goto bad; |
f24e9980 | 1270 | |
38a8d560 | 1271 | /* ignore the rest */ |
f24e9980 SW |
1272 | *p = end; |
1273 | ||
38a8d560 | 1274 | dout("full osdmap epoch %d max_osd %d\n", map->epoch, map->max_osd); |
a2505d63 | 1275 | return 0; |
f24e9980 | 1276 | |
597b52f6 ID |
1277 | e_inval: |
1278 | err = -EINVAL; | |
f24e9980 | 1279 | bad: |
38a8d560 ID |
1280 | pr_err("corrupt full osdmap (%d) epoch %d off %d (%p of %p-%p)\n", |
1281 | err, epoch, (int)(*p - start), *p, start, end); | |
1282 | print_hex_dump(KERN_DEBUG, "osdmap: ", | |
1283 | DUMP_PREFIX_OFFSET, 16, 1, | |
1284 | start, end - start, true); | |
a2505d63 ID |
1285 | return err; |
1286 | } | |
1287 | ||
1288 | /* | |
1289 | * Allocate and decode a full map. | |
1290 | */ | |
1291 | struct ceph_osdmap *ceph_osdmap_decode(void **p, void *end) | |
1292 | { | |
1293 | struct ceph_osdmap *map; | |
1294 | int ret; | |
1295 | ||
e5253a7b | 1296 | map = ceph_osdmap_alloc(); |
a2505d63 ID |
1297 | if (!map) |
1298 | return ERR_PTR(-ENOMEM); | |
1299 | ||
a2505d63 ID |
1300 | ret = osdmap_decode(p, end, map); |
1301 | if (ret) { | |
1302 | ceph_osdmap_destroy(map); | |
1303 | return ERR_PTR(ret); | |
1304 | } | |
1305 | ||
1306 | return map; | |
f24e9980 SW |
1307 | } |
1308 | ||
930c5328 ID |
1309 | /* |
1310 | * Encoding order is (new_up_client, new_state, new_weight). Need to | |
1311 | * apply in the (new_weight, new_state, new_up_client) order, because | |
1312 | * an incremental map may look like e.g. | |
1313 | * | |
1314 | * new_up_client: { osd=6, addr=... } # set osd_state and addr | |
1315 | * new_state: { osd=6, xorstate=EXISTS } # clear osd_state | |
1316 | */ | |
1317 | static int decode_new_up_state_weight(void **p, void *end, | |
1318 | struct ceph_osdmap *map) | |
1319 | { | |
1320 | void *new_up_client; | |
1321 | void *new_state; | |
1322 | void *new_weight_end; | |
1323 | u32 len; | |
1324 | ||
1325 | new_up_client = *p; | |
1326 | ceph_decode_32_safe(p, end, len, e_inval); | |
1327 | len *= sizeof(u32) + sizeof(struct ceph_entity_addr); | |
1328 | ceph_decode_need(p, end, len, e_inval); | |
1329 | *p += len; | |
1330 | ||
1331 | new_state = *p; | |
1332 | ceph_decode_32_safe(p, end, len, e_inval); | |
1333 | len *= sizeof(u32) + sizeof(u8); | |
1334 | ceph_decode_need(p, end, len, e_inval); | |
1335 | *p += len; | |
1336 | ||
1337 | /* new_weight */ | |
1338 | ceph_decode_32_safe(p, end, len, e_inval); | |
1339 | while (len--) { | |
1340 | s32 osd; | |
1341 | u32 w; | |
1342 | ||
1343 | ceph_decode_need(p, end, 2*sizeof(u32), e_inval); | |
1344 | osd = ceph_decode_32(p); | |
1345 | w = ceph_decode_32(p); | |
1346 | BUG_ON(osd >= map->max_osd); | |
1347 | pr_info("osd%d weight 0x%x %s\n", osd, w, | |
1348 | w == CEPH_OSD_IN ? "(in)" : | |
1349 | (w == CEPH_OSD_OUT ? "(out)" : "")); | |
1350 | map->osd_weight[osd] = w; | |
1351 | ||
1352 | /* | |
1353 | * If we are marking in, set the EXISTS, and clear the | |
1354 | * AUTOOUT and NEW bits. | |
1355 | */ | |
1356 | if (w) { | |
1357 | map->osd_state[osd] |= CEPH_OSD_EXISTS; | |
1358 | map->osd_state[osd] &= ~(CEPH_OSD_AUTOOUT | | |
1359 | CEPH_OSD_NEW); | |
1360 | } | |
1361 | } | |
1362 | new_weight_end = *p; | |
1363 | ||
1364 | /* new_state (up/down) */ | |
1365 | *p = new_state; | |
1366 | len = ceph_decode_32(p); | |
1367 | while (len--) { | |
1368 | s32 osd; | |
1369 | u8 xorstate; | |
1370 | int ret; | |
1371 | ||
1372 | osd = ceph_decode_32(p); | |
1373 | xorstate = ceph_decode_8(p); | |
1374 | if (xorstate == 0) | |
1375 | xorstate = CEPH_OSD_UP; | |
1376 | BUG_ON(osd >= map->max_osd); | |
1377 | if ((map->osd_state[osd] & CEPH_OSD_UP) && | |
1378 | (xorstate & CEPH_OSD_UP)) | |
1379 | pr_info("osd%d down\n", osd); | |
1380 | if ((map->osd_state[osd] & CEPH_OSD_EXISTS) && | |
1381 | (xorstate & CEPH_OSD_EXISTS)) { | |
1382 | pr_info("osd%d does not exist\n", osd); | |
930c5328 ID |
1383 | ret = set_primary_affinity(map, osd, |
1384 | CEPH_OSD_DEFAULT_PRIMARY_AFFINITY); | |
1385 | if (ret) | |
1386 | return ret; | |
1387 | memset(map->osd_addr + osd, 0, sizeof(*map->osd_addr)); | |
1388 | map->osd_state[osd] = 0; | |
1389 | } else { | |
1390 | map->osd_state[osd] ^= xorstate; | |
1391 | } | |
1392 | } | |
1393 | ||
1394 | /* new_up_client */ | |
1395 | *p = new_up_client; | |
1396 | len = ceph_decode_32(p); | |
1397 | while (len--) { | |
1398 | s32 osd; | |
1399 | struct ceph_entity_addr addr; | |
1400 | ||
1401 | osd = ceph_decode_32(p); | |
1402 | ceph_decode_copy(p, &addr, sizeof(addr)); | |
1403 | ceph_decode_addr(&addr); | |
1404 | BUG_ON(osd >= map->max_osd); | |
1405 | pr_info("osd%d up\n", osd); | |
1406 | map->osd_state[osd] |= CEPH_OSD_EXISTS | CEPH_OSD_UP; | |
1407 | map->osd_addr[osd] = addr; | |
1408 | } | |
1409 | ||
1410 | *p = new_weight_end; | |
1411 | return 0; | |
1412 | ||
1413 | e_inval: | |
1414 | return -EINVAL; | |
1415 | } | |
1416 | ||
f24e9980 SW |
1417 | /* |
1418 | * decode and apply an incremental map update. | |
1419 | */ | |
1420 | struct ceph_osdmap *osdmap_apply_incremental(void **p, void *end, | |
0c0a8de1 | 1421 | struct ceph_osdmap *map) |
f24e9980 | 1422 | { |
f24e9980 SW |
1423 | struct ceph_fsid fsid; |
1424 | u32 epoch = 0; | |
1425 | struct ceph_timespec modified; | |
4f6a7e5e SW |
1426 | s32 len; |
1427 | u64 pool; | |
1428 | __s64 new_pool_max; | |
1429 | __s32 new_flags, max; | |
f24e9980 | 1430 | void *start = *p; |
86f1742b | 1431 | int err; |
ec7af972 | 1432 | u8 struct_v; |
f24e9980 | 1433 | |
38a8d560 ID |
1434 | dout("%s %p to %p len %d\n", __func__, *p, end, (int)(end - *p)); |
1435 | ||
ec7af972 ID |
1436 | err = get_osdmap_client_data_v(p, end, "inc", &struct_v); |
1437 | if (err) | |
1438 | goto bad; | |
f24e9980 | 1439 | |
53bbaba9 ID |
1440 | /* fsid, epoch, modified, new_pool_max, new_flags */ |
1441 | ceph_decode_need(p, end, sizeof(fsid) + sizeof(u32) + sizeof(modified) + | |
1442 | sizeof(u64) + sizeof(u32), e_inval); | |
f24e9980 | 1443 | ceph_decode_copy(p, &fsid, sizeof(fsid)); |
c89136ea | 1444 | epoch = ceph_decode_32(p); |
f24e9980 SW |
1445 | BUG_ON(epoch != map->epoch+1); |
1446 | ceph_decode_copy(p, &modified, sizeof(modified)); | |
4f6a7e5e | 1447 | new_pool_max = ceph_decode_64(p); |
c89136ea | 1448 | new_flags = ceph_decode_32(p); |
f24e9980 SW |
1449 | |
1450 | /* full map? */ | |
86f1742b | 1451 | ceph_decode_32_safe(p, end, len, e_inval); |
f24e9980 SW |
1452 | if (len > 0) { |
1453 | dout("apply_incremental full map len %d, %p to %p\n", | |
1454 | len, *p, end); | |
a2505d63 | 1455 | return ceph_osdmap_decode(p, min(*p+len, end)); |
f24e9980 SW |
1456 | } |
1457 | ||
1458 | /* new crush? */ | |
86f1742b | 1459 | ceph_decode_32_safe(p, end, len, e_inval); |
f24e9980 | 1460 | if (len > 0) { |
1b6a78b5 ID |
1461 | err = osdmap_set_crush(map, |
1462 | crush_decode(*p, min(*p + len, end))); | |
1463 | if (err) | |
86f1742b | 1464 | goto bad; |
cebc5be6 | 1465 | *p += len; |
f24e9980 SW |
1466 | } |
1467 | ||
1468 | /* new flags? */ | |
1469 | if (new_flags >= 0) | |
1470 | map->flags = new_flags; | |
4fc51be8 SW |
1471 | if (new_pool_max >= 0) |
1472 | map->pool_max = new_pool_max; | |
f24e9980 | 1473 | |
f24e9980 | 1474 | /* new max? */ |
53bbaba9 | 1475 | ceph_decode_32_safe(p, end, max, e_inval); |
f24e9980 SW |
1476 | if (max >= 0) { |
1477 | err = osdmap_set_max_osd(map, max); | |
86f1742b | 1478 | if (err) |
f24e9980 SW |
1479 | goto bad; |
1480 | } | |
1481 | ||
1482 | map->epoch++; | |
31456665 | 1483 | map->modified = modified; |
f24e9980 | 1484 | |
433fbdd3 ID |
1485 | /* new_pools */ |
1486 | err = decode_new_pools(p, end, map); | |
1487 | if (err) | |
1488 | goto bad; | |
9464d008 | 1489 | |
0f70c7ee ID |
1490 | /* new_pool_names */ |
1491 | err = decode_pool_names(p, end, map); | |
9464d008 ID |
1492 | if (err) |
1493 | goto bad; | |
f24e9980 | 1494 | |
4fc51be8 | 1495 | /* old_pool */ |
86f1742b | 1496 | ceph_decode_32_safe(p, end, len, e_inval); |
4fc51be8 SW |
1497 | while (len--) { |
1498 | struct ceph_pg_pool_info *pi; | |
1499 | ||
86f1742b | 1500 | ceph_decode_64_safe(p, end, pool, e_inval); |
4fc51be8 | 1501 | pi = __lookup_pg_pool(&map->pg_pools, pool); |
2844a76a SW |
1502 | if (pi) |
1503 | __remove_pg_pool(&map->pg_pools, pi); | |
4fc51be8 | 1504 | } |
f24e9980 | 1505 | |
930c5328 ID |
1506 | /* new_up_client, new_state, new_weight */ |
1507 | err = decode_new_up_state_weight(p, end, map); | |
1508 | if (err) | |
1509 | goto bad; | |
f24e9980 SW |
1510 | |
1511 | /* new_pg_temp */ | |
10db634e ID |
1512 | err = decode_new_pg_temp(p, end, map); |
1513 | if (err) | |
1514 | goto bad; | |
f24e9980 | 1515 | |
d286de79 ID |
1516 | /* new_primary_temp */ |
1517 | if (struct_v >= 1) { | |
1518 | err = decode_new_primary_temp(p, end, map); | |
1519 | if (err) | |
1520 | goto bad; | |
1521 | } | |
1522 | ||
63a6993f ID |
1523 | /* new_primary_affinity */ |
1524 | if (struct_v >= 2) { | |
1525 | err = decode_new_primary_affinity(p, end, map); | |
1526 | if (err) | |
1527 | goto bad; | |
1528 | } | |
1529 | ||
f24e9980 SW |
1530 | /* ignore the rest */ |
1531 | *p = end; | |
38a8d560 ID |
1532 | |
1533 | dout("inc osdmap epoch %d max_osd %d\n", map->epoch, map->max_osd); | |
f24e9980 SW |
1534 | return map; |
1535 | ||
86f1742b ID |
1536 | e_inval: |
1537 | err = -EINVAL; | |
f24e9980 | 1538 | bad: |
38a8d560 ID |
1539 | pr_err("corrupt inc osdmap (%d) epoch %d off %d (%p of %p-%p)\n", |
1540 | err, epoch, (int)(*p - start), *p, start, end); | |
9ec7cab1 SW |
1541 | print_hex_dump(KERN_DEBUG, "osdmap: ", |
1542 | DUMP_PREFIX_OFFSET, 16, 1, | |
1543 | start, end - start, true); | |
f24e9980 SW |
1544 | return ERR_PTR(err); |
1545 | } | |
1546 | ||
30c156d9 YZ |
1547 | void ceph_oloc_copy(struct ceph_object_locator *dest, |
1548 | const struct ceph_object_locator *src) | |
1549 | { | |
ca35ffea | 1550 | ceph_oloc_destroy(dest); |
30c156d9 YZ |
1551 | |
1552 | dest->pool = src->pool; | |
1553 | if (src->pool_ns) | |
1554 | dest->pool_ns = ceph_get_string(src->pool_ns); | |
ca35ffea ID |
1555 | else |
1556 | dest->pool_ns = NULL; | |
30c156d9 YZ |
1557 | } |
1558 | EXPORT_SYMBOL(ceph_oloc_copy); | |
1559 | ||
1560 | void ceph_oloc_destroy(struct ceph_object_locator *oloc) | |
1561 | { | |
1562 | ceph_put_string(oloc->pool_ns); | |
1563 | } | |
1564 | EXPORT_SYMBOL(ceph_oloc_destroy); | |
1565 | ||
d30291b9 ID |
1566 | void ceph_oid_copy(struct ceph_object_id *dest, |
1567 | const struct ceph_object_id *src) | |
1568 | { | |
ca35ffea | 1569 | ceph_oid_destroy(dest); |
d30291b9 ID |
1570 | |
1571 | if (src->name != src->inline_name) { | |
1572 | /* very rare, see ceph_object_id definition */ | |
1573 | dest->name = kmalloc(src->name_len + 1, | |
1574 | GFP_NOIO | __GFP_NOFAIL); | |
ca35ffea ID |
1575 | } else { |
1576 | dest->name = dest->inline_name; | |
d30291b9 | 1577 | } |
d30291b9 ID |
1578 | memcpy(dest->name, src->name, src->name_len + 1); |
1579 | dest->name_len = src->name_len; | |
1580 | } | |
1581 | EXPORT_SYMBOL(ceph_oid_copy); | |
1582 | ||
1583 | static __printf(2, 0) | |
1584 | int oid_printf_vargs(struct ceph_object_id *oid, const char *fmt, va_list ap) | |
1585 | { | |
1586 | int len; | |
1587 | ||
1588 | WARN_ON(!ceph_oid_empty(oid)); | |
1589 | ||
1590 | len = vsnprintf(oid->inline_name, sizeof(oid->inline_name), fmt, ap); | |
1591 | if (len >= sizeof(oid->inline_name)) | |
1592 | return len; | |
1593 | ||
1594 | oid->name_len = len; | |
1595 | return 0; | |
1596 | } | |
1597 | ||
1598 | /* | |
1599 | * If oid doesn't fit into inline buffer, BUG. | |
1600 | */ | |
1601 | void ceph_oid_printf(struct ceph_object_id *oid, const char *fmt, ...) | |
1602 | { | |
1603 | va_list ap; | |
1604 | ||
1605 | va_start(ap, fmt); | |
1606 | BUG_ON(oid_printf_vargs(oid, fmt, ap)); | |
1607 | va_end(ap); | |
1608 | } | |
1609 | EXPORT_SYMBOL(ceph_oid_printf); | |
1610 | ||
1611 | static __printf(3, 0) | |
1612 | int oid_aprintf_vargs(struct ceph_object_id *oid, gfp_t gfp, | |
1613 | const char *fmt, va_list ap) | |
1614 | { | |
1615 | va_list aq; | |
1616 | int len; | |
1617 | ||
1618 | va_copy(aq, ap); | |
1619 | len = oid_printf_vargs(oid, fmt, aq); | |
1620 | va_end(aq); | |
1621 | ||
1622 | if (len) { | |
1623 | char *external_name; | |
1624 | ||
1625 | external_name = kmalloc(len + 1, gfp); | |
1626 | if (!external_name) | |
1627 | return -ENOMEM; | |
f24e9980 | 1628 | |
d30291b9 ID |
1629 | oid->name = external_name; |
1630 | WARN_ON(vsnprintf(oid->name, len + 1, fmt, ap) != len); | |
1631 | oid->name_len = len; | |
1632 | } | |
f24e9980 | 1633 | |
d30291b9 ID |
1634 | return 0; |
1635 | } | |
1636 | ||
1637 | /* | |
1638 | * If oid doesn't fit into inline buffer, allocate. | |
1639 | */ | |
1640 | int ceph_oid_aprintf(struct ceph_object_id *oid, gfp_t gfp, | |
1641 | const char *fmt, ...) | |
1642 | { | |
1643 | va_list ap; | |
1644 | int ret; | |
1645 | ||
1646 | va_start(ap, fmt); | |
1647 | ret = oid_aprintf_vargs(oid, gfp, fmt, ap); | |
1648 | va_end(ap); | |
1649 | ||
1650 | return ret; | |
1651 | } | |
1652 | EXPORT_SYMBOL(ceph_oid_aprintf); | |
1653 | ||
1654 | void ceph_oid_destroy(struct ceph_object_id *oid) | |
1655 | { | |
1656 | if (oid->name != oid->inline_name) | |
1657 | kfree(oid->name); | |
1658 | } | |
1659 | EXPORT_SYMBOL(ceph_oid_destroy); | |
f24e9980 | 1660 | |
63244fa1 ID |
1661 | /* |
1662 | * osds only | |
1663 | */ | |
1664 | static bool __osds_equal(const struct ceph_osds *lhs, | |
1665 | const struct ceph_osds *rhs) | |
1666 | { | |
1667 | if (lhs->size == rhs->size && | |
1668 | !memcmp(lhs->osds, rhs->osds, rhs->size * sizeof(rhs->osds[0]))) | |
1669 | return true; | |
1670 | ||
1671 | return false; | |
1672 | } | |
1673 | ||
1674 | /* | |
1675 | * osds + primary | |
1676 | */ | |
1677 | static bool osds_equal(const struct ceph_osds *lhs, | |
1678 | const struct ceph_osds *rhs) | |
1679 | { | |
1680 | if (__osds_equal(lhs, rhs) && | |
1681 | lhs->primary == rhs->primary) | |
1682 | return true; | |
1683 | ||
1684 | return false; | |
1685 | } | |
1686 | ||
6f3bfd45 ID |
1687 | static bool osds_valid(const struct ceph_osds *set) |
1688 | { | |
1689 | /* non-empty set */ | |
1690 | if (set->size > 0 && set->primary >= 0) | |
1691 | return true; | |
1692 | ||
1693 | /* empty can_shift_osds set */ | |
1694 | if (!set->size && set->primary == -1) | |
1695 | return true; | |
1696 | ||
1697 | /* empty !can_shift_osds set - all NONE */ | |
1698 | if (set->size > 0 && set->primary == -1) { | |
1699 | int i; | |
1700 | ||
1701 | for (i = 0; i < set->size; i++) { | |
1702 | if (set->osds[i] != CRUSH_ITEM_NONE) | |
1703 | break; | |
1704 | } | |
1705 | if (i == set->size) | |
1706 | return true; | |
1707 | } | |
1708 | ||
1709 | return false; | |
1710 | } | |
1711 | ||
1712 | void ceph_osds_copy(struct ceph_osds *dest, const struct ceph_osds *src) | |
1713 | { | |
1714 | memcpy(dest->osds, src->osds, src->size * sizeof(src->osds[0])); | |
1715 | dest->size = src->size; | |
1716 | dest->primary = src->primary; | |
1717 | } | |
1718 | ||
63244fa1 ID |
1719 | static bool is_split(const struct ceph_pg *pgid, |
1720 | u32 old_pg_num, | |
1721 | u32 new_pg_num) | |
1722 | { | |
1723 | int old_bits = calc_bits_of(old_pg_num); | |
1724 | int old_mask = (1 << old_bits) - 1; | |
1725 | int n; | |
1726 | ||
1727 | WARN_ON(pgid->seed >= old_pg_num); | |
1728 | if (new_pg_num <= old_pg_num) | |
1729 | return false; | |
1730 | ||
1731 | for (n = 1; ; n++) { | |
1732 | int next_bit = n << (old_bits - 1); | |
1733 | u32 s = next_bit | pgid->seed; | |
1734 | ||
1735 | if (s < old_pg_num || s == pgid->seed) | |
1736 | continue; | |
1737 | if (s >= new_pg_num) | |
1738 | break; | |
1739 | ||
1740 | s = ceph_stable_mod(s, old_pg_num, old_mask); | |
1741 | if (s == pgid->seed) | |
1742 | return true; | |
1743 | } | |
1744 | ||
1745 | return false; | |
1746 | } | |
1747 | ||
1748 | bool ceph_is_new_interval(const struct ceph_osds *old_acting, | |
1749 | const struct ceph_osds *new_acting, | |
1750 | const struct ceph_osds *old_up, | |
1751 | const struct ceph_osds *new_up, | |
1752 | int old_size, | |
1753 | int new_size, | |
1754 | int old_min_size, | |
1755 | int new_min_size, | |
1756 | u32 old_pg_num, | |
1757 | u32 new_pg_num, | |
1758 | bool old_sort_bitwise, | |
1759 | bool new_sort_bitwise, | |
1760 | const struct ceph_pg *pgid) | |
1761 | { | |
1762 | return !osds_equal(old_acting, new_acting) || | |
1763 | !osds_equal(old_up, new_up) || | |
1764 | old_size != new_size || | |
1765 | old_min_size != new_min_size || | |
1766 | is_split(pgid, old_pg_num, new_pg_num) || | |
1767 | old_sort_bitwise != new_sort_bitwise; | |
1768 | } | |
1769 | ||
1770 | static int calc_pg_rank(int osd, const struct ceph_osds *acting) | |
1771 | { | |
1772 | int i; | |
1773 | ||
1774 | for (i = 0; i < acting->size; i++) { | |
1775 | if (acting->osds[i] == osd) | |
1776 | return i; | |
1777 | } | |
1778 | ||
1779 | return -1; | |
1780 | } | |
1781 | ||
1782 | static bool primary_changed(const struct ceph_osds *old_acting, | |
1783 | const struct ceph_osds *new_acting) | |
1784 | { | |
1785 | if (!old_acting->size && !new_acting->size) | |
1786 | return false; /* both still empty */ | |
1787 | ||
1788 | if (!old_acting->size ^ !new_acting->size) | |
1789 | return true; /* was empty, now not, or vice versa */ | |
1790 | ||
1791 | if (old_acting->primary != new_acting->primary) | |
1792 | return true; /* primary changed */ | |
1793 | ||
1794 | if (calc_pg_rank(old_acting->primary, old_acting) != | |
1795 | calc_pg_rank(new_acting->primary, new_acting)) | |
1796 | return true; | |
1797 | ||
1798 | return false; /* same primary (tho replicas may have changed) */ | |
1799 | } | |
1800 | ||
1801 | bool ceph_osds_changed(const struct ceph_osds *old_acting, | |
1802 | const struct ceph_osds *new_acting, | |
1803 | bool any_change) | |
1804 | { | |
1805 | if (primary_changed(old_acting, new_acting)) | |
1806 | return true; | |
1807 | ||
1808 | if (any_change && !__osds_equal(old_acting, new_acting)) | |
1809 | return true; | |
1810 | ||
1811 | return false; | |
1812 | } | |
1813 | ||
f24e9980 SW |
1814 | /* |
1815 | * calculate file layout from given offset, length. | |
1816 | * fill in correct oid, logical length, and object extent | |
1817 | * offset, length. | |
1818 | * | |
1819 | * for now, we write only a single su, until we can | |
1820 | * pass a stride back to the caller. | |
1821 | */ | |
d63b77f4 | 1822 | int ceph_calc_file_object_mapping(struct ceph_file_layout *layout, |
e8afad65 | 1823 | u64 off, u64 len, |
645a1025 | 1824 | u64 *ono, |
f24e9980 SW |
1825 | u64 *oxoff, u64 *oxlen) |
1826 | { | |
7627151e YZ |
1827 | u32 osize = layout->object_size; |
1828 | u32 su = layout->stripe_unit; | |
1829 | u32 sc = layout->stripe_count; | |
f24e9980 SW |
1830 | u32 bl, stripeno, stripepos, objsetno; |
1831 | u32 su_per_object; | |
ff1d1f71 | 1832 | u64 t, su_offset; |
f24e9980 | 1833 | |
e8afad65 | 1834 | dout("mapping %llu~%llu osize %u fl_su %u\n", off, len, |
f24e9980 | 1835 | osize, su); |
d63b77f4 SW |
1836 | if (su == 0 || sc == 0) |
1837 | goto invalid; | |
35e054a6 | 1838 | su_per_object = osize / su; |
d63b77f4 SW |
1839 | if (su_per_object == 0) |
1840 | goto invalid; | |
f24e9980 SW |
1841 | dout("osize %u / su %u = su_per_object %u\n", osize, su, |
1842 | su_per_object); | |
1843 | ||
d63b77f4 SW |
1844 | if ((su & ~PAGE_MASK) != 0) |
1845 | goto invalid; | |
1846 | ||
f24e9980 SW |
1847 | /* bl = *off / su; */ |
1848 | t = off; | |
1849 | do_div(t, su); | |
1850 | bl = t; | |
1851 | dout("off %llu / su %u = bl %u\n", off, su, bl); | |
1852 | ||
1853 | stripeno = bl / sc; | |
1854 | stripepos = bl % sc; | |
1855 | objsetno = stripeno / su_per_object; | |
1856 | ||
645a1025 | 1857 | *ono = objsetno * sc + stripepos; |
95c96174 | 1858 | dout("objset %u * sc %u = ono %u\n", objsetno, sc, (unsigned int)*ono); |
645a1025 SW |
1859 | |
1860 | /* *oxoff = *off % layout->fl_stripe_unit; # offset in su */ | |
f24e9980 | 1861 | t = off; |
ff1d1f71 NW |
1862 | su_offset = do_div(t, su); |
1863 | *oxoff = su_offset + (stripeno % su_per_object) * su; | |
1864 | ||
1865 | /* | |
1866 | * Calculate the length of the extent being written to the selected | |
e8afad65 | 1867 | * object. This is the minimum of the full length requested (len) or |
ff1d1f71 NW |
1868 | * the remainder of the current stripe being written to. |
1869 | */ | |
e8afad65 | 1870 | *oxlen = min_t(u64, len, su - su_offset); |
f24e9980 SW |
1871 | |
1872 | dout(" obj extent %llu~%llu\n", *oxoff, *oxlen); | |
d63b77f4 SW |
1873 | return 0; |
1874 | ||
1875 | invalid: | |
1876 | dout(" invalid layout\n"); | |
1877 | *ono = 0; | |
1878 | *oxoff = 0; | |
1879 | *oxlen = 0; | |
1880 | return -EINVAL; | |
f24e9980 | 1881 | } |
3d14c5d2 | 1882 | EXPORT_SYMBOL(ceph_calc_file_object_mapping); |
f24e9980 SW |
1883 | |
1884 | /* | |
d9591f5e ID |
1885 | * Map an object into a PG. |
1886 | * | |
1887 | * Should only be called with target_oid and target_oloc (as opposed to | |
1888 | * base_oid and base_oloc), since tiering isn't taken into account. | |
f24e9980 | 1889 | */ |
d9591f5e ID |
1890 | int ceph_object_locator_to_pg(struct ceph_osdmap *osdmap, |
1891 | struct ceph_object_id *oid, | |
1892 | struct ceph_object_locator *oloc, | |
1893 | struct ceph_pg *raw_pgid) | |
f24e9980 | 1894 | { |
7c13cb64 | 1895 | struct ceph_pg_pool_info *pi; |
f24e9980 | 1896 | |
d9591f5e | 1897 | pi = ceph_pg_pool_by_id(osdmap, oloc->pool); |
7c13cb64 | 1898 | if (!pi) |
d9591f5e | 1899 | return -ENOENT; |
f24e9980 | 1900 | |
30c156d9 YZ |
1901 | if (!oloc->pool_ns) { |
1902 | raw_pgid->pool = oloc->pool; | |
1903 | raw_pgid->seed = ceph_str_hash(pi->object_hash, oid->name, | |
1904 | oid->name_len); | |
1905 | dout("%s %s -> raw_pgid %llu.%x\n", __func__, oid->name, | |
1906 | raw_pgid->pool, raw_pgid->seed); | |
1907 | } else { | |
1908 | char stack_buf[256]; | |
1909 | char *buf = stack_buf; | |
1910 | int nsl = oloc->pool_ns->len; | |
1911 | size_t total = nsl + 1 + oid->name_len; | |
1912 | ||
1913 | if (total > sizeof(stack_buf)) { | |
1914 | buf = kmalloc(total, GFP_NOIO); | |
1915 | if (!buf) | |
1916 | return -ENOMEM; | |
1917 | } | |
1918 | memcpy(buf, oloc->pool_ns->str, nsl); | |
1919 | buf[nsl] = '\037'; | |
1920 | memcpy(buf + nsl + 1, oid->name, oid->name_len); | |
1921 | raw_pgid->pool = oloc->pool; | |
1922 | raw_pgid->seed = ceph_str_hash(pi->object_hash, buf, total); | |
1923 | if (buf != stack_buf) | |
1924 | kfree(buf); | |
1925 | dout("%s %s ns %.*s -> raw_pgid %llu.%x\n", __func__, | |
1926 | oid->name, nsl, oloc->pool_ns->str, | |
1927 | raw_pgid->pool, raw_pgid->seed); | |
1928 | } | |
f24e9980 SW |
1929 | return 0; |
1930 | } | |
d9591f5e | 1931 | EXPORT_SYMBOL(ceph_object_locator_to_pg); |
f24e9980 | 1932 | |
6f3bfd45 ID |
1933 | /* |
1934 | * Map a raw PG (full precision ps) into an actual PG. | |
1935 | */ | |
1936 | static void raw_pg_to_pg(struct ceph_pg_pool_info *pi, | |
1937 | const struct ceph_pg *raw_pgid, | |
1938 | struct ceph_pg *pgid) | |
1939 | { | |
1940 | pgid->pool = raw_pgid->pool; | |
1941 | pgid->seed = ceph_stable_mod(raw_pgid->seed, pi->pg_num, | |
1942 | pi->pg_num_mask); | |
1943 | } | |
1944 | ||
1945 | /* | |
1946 | * Map a raw PG (full precision ps) into a placement ps (placement | |
1947 | * seed). Include pool id in that value so that different pools don't | |
1948 | * use the same seeds. | |
1949 | */ | |
1950 | static u32 raw_pg_to_pps(struct ceph_pg_pool_info *pi, | |
1951 | const struct ceph_pg *raw_pgid) | |
1952 | { | |
1953 | if (pi->flags & CEPH_POOL_FLAG_HASHPSPOOL) { | |
1954 | /* hash pool id and seed so that pool PGs do not overlap */ | |
1955 | return crush_hash32_2(CRUSH_HASH_RJENKINS1, | |
1956 | ceph_stable_mod(raw_pgid->seed, | |
1957 | pi->pgp_num, | |
1958 | pi->pgp_num_mask), | |
1959 | raw_pgid->pool); | |
1960 | } else { | |
1961 | /* | |
1962 | * legacy behavior: add ps and pool together. this is | |
1963 | * not a great approach because the PGs from each pool | |
1964 | * will overlap on top of each other: 0.5 == 1.4 == | |
1965 | * 2.3 == ... | |
1966 | */ | |
1967 | return ceph_stable_mod(raw_pgid->seed, pi->pgp_num, | |
1968 | pi->pgp_num_mask) + | |
1969 | (unsigned)raw_pgid->pool; | |
1970 | } | |
1971 | } | |
1972 | ||
9d521470 ID |
1973 | static int do_crush(struct ceph_osdmap *map, int ruleno, int x, |
1974 | int *result, int result_max, | |
1975 | const __u32 *weight, int weight_max) | |
e8ef19c4 | 1976 | { |
9d521470 ID |
1977 | int r; |
1978 | ||
1979 | BUG_ON(result_max > CEPH_PG_MAX_SIZE); | |
1980 | ||
743efcff | 1981 | mutex_lock(&map->crush_workspace_mutex); |
9d521470 | 1982 | r = crush_do_rule(map->crush, ruleno, x, result, result_max, |
743efcff ID |
1983 | weight, weight_max, map->crush_workspace); |
1984 | mutex_unlock(&map->crush_workspace_mutex); | |
e8ef19c4 | 1985 | |
9d521470 | 1986 | return r; |
e8ef19c4 ID |
1987 | } |
1988 | ||
2bd93d4d | 1989 | /* |
6f3bfd45 ID |
1990 | * Calculate raw set (CRUSH output) for given PG. The result may |
1991 | * contain nonexistent OSDs. ->primary is undefined for a raw set. | |
2bd93d4d | 1992 | * |
6f3bfd45 | 1993 | * Placement seed (CRUSH input) is returned through @ppps. |
2bd93d4d | 1994 | */ |
6f3bfd45 ID |
1995 | static void pg_to_raw_osds(struct ceph_osdmap *osdmap, |
1996 | struct ceph_pg_pool_info *pi, | |
1997 | const struct ceph_pg *raw_pgid, | |
1998 | struct ceph_osds *raw, | |
1999 | u32 *ppps) | |
2bd93d4d | 2000 | { |
6f3bfd45 | 2001 | u32 pps = raw_pg_to_pps(pi, raw_pgid); |
2bd93d4d ID |
2002 | int ruleno; |
2003 | int len; | |
2004 | ||
6f3bfd45 ID |
2005 | ceph_osds_init(raw); |
2006 | if (ppps) | |
2007 | *ppps = pps; | |
2008 | ||
2009 | ruleno = crush_find_rule(osdmap->crush, pi->crush_ruleset, pi->type, | |
2010 | pi->size); | |
2bd93d4d ID |
2011 | if (ruleno < 0) { |
2012 | pr_err("no crush rule: pool %lld ruleset %d type %d size %d\n", | |
6f3bfd45 ID |
2013 | pi->id, pi->crush_ruleset, pi->type, pi->size); |
2014 | return; | |
2bd93d4d ID |
2015 | } |
2016 | ||
ef9324bb ID |
2017 | if (pi->size > ARRAY_SIZE(raw->osds)) { |
2018 | pr_err_ratelimited("pool %lld ruleset %d type %d too wide: size %d > %zu\n", | |
2019 | pi->id, pi->crush_ruleset, pi->type, pi->size, | |
2020 | ARRAY_SIZE(raw->osds)); | |
2021 | return; | |
2022 | } | |
2023 | ||
2024 | len = do_crush(osdmap, ruleno, pps, raw->osds, pi->size, | |
2bd93d4d ID |
2025 | osdmap->osd_weight, osdmap->max_osd); |
2026 | if (len < 0) { | |
2027 | pr_err("error %d from crush rule %d: pool %lld ruleset %d type %d size %d\n", | |
6f3bfd45 ID |
2028 | len, ruleno, pi->id, pi->crush_ruleset, pi->type, |
2029 | pi->size); | |
2030 | return; | |
2bd93d4d ID |
2031 | } |
2032 | ||
6f3bfd45 | 2033 | raw->size = len; |
2bd93d4d ID |
2034 | } |
2035 | ||
2036 | /* | |
6f3bfd45 ID |
2037 | * Given raw set, calculate up set and up primary. By definition of an |
2038 | * up set, the result won't contain nonexistent or down OSDs. | |
2bd93d4d | 2039 | * |
6f3bfd45 ID |
2040 | * This is done in-place - on return @set is the up set. If it's |
2041 | * empty, ->primary will remain undefined. | |
2bd93d4d | 2042 | */ |
6f3bfd45 ID |
2043 | static void raw_to_up_osds(struct ceph_osdmap *osdmap, |
2044 | struct ceph_pg_pool_info *pi, | |
2045 | struct ceph_osds *set) | |
2bd93d4d | 2046 | { |
2bd93d4d ID |
2047 | int i; |
2048 | ||
6f3bfd45 ID |
2049 | /* ->primary is undefined for a raw set */ |
2050 | BUG_ON(set->primary != -1); | |
2051 | ||
2052 | if (ceph_can_shift_osds(pi)) { | |
2bd93d4d ID |
2053 | int removed = 0; |
2054 | ||
6f3bfd45 ID |
2055 | /* shift left */ |
2056 | for (i = 0; i < set->size; i++) { | |
2057 | if (ceph_osd_is_down(osdmap, set->osds[i])) { | |
2bd93d4d ID |
2058 | removed++; |
2059 | continue; | |
2060 | } | |
2061 | if (removed) | |
6f3bfd45 | 2062 | set->osds[i - removed] = set->osds[i]; |
2bd93d4d | 2063 | } |
6f3bfd45 ID |
2064 | set->size -= removed; |
2065 | if (set->size > 0) | |
2066 | set->primary = set->osds[0]; | |
2bd93d4d | 2067 | } else { |
6f3bfd45 ID |
2068 | /* set down/dne devices to NONE */ |
2069 | for (i = set->size - 1; i >= 0; i--) { | |
2070 | if (ceph_osd_is_down(osdmap, set->osds[i])) | |
2071 | set->osds[i] = CRUSH_ITEM_NONE; | |
2bd93d4d | 2072 | else |
6f3bfd45 | 2073 | set->primary = set->osds[i]; |
2bd93d4d ID |
2074 | } |
2075 | } | |
2bd93d4d ID |
2076 | } |
2077 | ||
6f3bfd45 ID |
2078 | static void apply_primary_affinity(struct ceph_osdmap *osdmap, |
2079 | struct ceph_pg_pool_info *pi, | |
2080 | u32 pps, | |
2081 | struct ceph_osds *up) | |
47ec1f3c ID |
2082 | { |
2083 | int i; | |
2084 | int pos = -1; | |
2085 | ||
2086 | /* | |
2087 | * Do we have any non-default primary_affinity values for these | |
2088 | * osds? | |
2089 | */ | |
2090 | if (!osdmap->osd_primary_affinity) | |
2091 | return; | |
2092 | ||
6f3bfd45 ID |
2093 | for (i = 0; i < up->size; i++) { |
2094 | int osd = up->osds[i]; | |
92b2e751 ID |
2095 | |
2096 | if (osd != CRUSH_ITEM_NONE && | |
2097 | osdmap->osd_primary_affinity[osd] != | |
47ec1f3c ID |
2098 | CEPH_OSD_DEFAULT_PRIMARY_AFFINITY) { |
2099 | break; | |
2100 | } | |
2101 | } | |
6f3bfd45 | 2102 | if (i == up->size) |
47ec1f3c ID |
2103 | return; |
2104 | ||
2105 | /* | |
2106 | * Pick the primary. Feed both the seed (for the pg) and the | |
2107 | * osd into the hash/rng so that a proportional fraction of an | |
2108 | * osd's pgs get rejected as primary. | |
2109 | */ | |
6f3bfd45 ID |
2110 | for (i = 0; i < up->size; i++) { |
2111 | int osd = up->osds[i]; | |
47ec1f3c ID |
2112 | u32 aff; |
2113 | ||
47ec1f3c ID |
2114 | if (osd == CRUSH_ITEM_NONE) |
2115 | continue; | |
2116 | ||
2117 | aff = osdmap->osd_primary_affinity[osd]; | |
2118 | if (aff < CEPH_OSD_MAX_PRIMARY_AFFINITY && | |
2119 | (crush_hash32_2(CRUSH_HASH_RJENKINS1, | |
2120 | pps, osd) >> 16) >= aff) { | |
2121 | /* | |
2122 | * We chose not to use this primary. Note it | |
2123 | * anyway as a fallback in case we don't pick | |
2124 | * anyone else, but keep looking. | |
2125 | */ | |
2126 | if (pos < 0) | |
2127 | pos = i; | |
2128 | } else { | |
2129 | pos = i; | |
2130 | break; | |
2131 | } | |
2132 | } | |
2133 | if (pos < 0) | |
2134 | return; | |
2135 | ||
6f3bfd45 | 2136 | up->primary = up->osds[pos]; |
47ec1f3c | 2137 | |
6f3bfd45 | 2138 | if (ceph_can_shift_osds(pi) && pos > 0) { |
47ec1f3c ID |
2139 | /* move the new primary to the front */ |
2140 | for (i = pos; i > 0; i--) | |
6f3bfd45 ID |
2141 | up->osds[i] = up->osds[i - 1]; |
2142 | up->osds[0] = up->primary; | |
47ec1f3c ID |
2143 | } |
2144 | } | |
2145 | ||
45966c34 | 2146 | /* |
6f3bfd45 | 2147 | * Get pg_temp and primary_temp mappings for given PG. |
45966c34 | 2148 | * |
6f3bfd45 ID |
2149 | * Note that a PG may have none, only pg_temp, only primary_temp or |
2150 | * both pg_temp and primary_temp mappings. This means @temp isn't | |
2151 | * always a valid OSD set on return: in the "only primary_temp" case, | |
2152 | * @temp will have its ->primary >= 0 but ->size == 0. | |
45966c34 | 2153 | */ |
6f3bfd45 ID |
2154 | static void get_temp_osds(struct ceph_osdmap *osdmap, |
2155 | struct ceph_pg_pool_info *pi, | |
2156 | const struct ceph_pg *raw_pgid, | |
2157 | struct ceph_osds *temp) | |
45966c34 | 2158 | { |
6f3bfd45 | 2159 | struct ceph_pg pgid; |
45966c34 | 2160 | struct ceph_pg_mapping *pg; |
45966c34 ID |
2161 | int i; |
2162 | ||
6f3bfd45 ID |
2163 | raw_pg_to_pg(pi, raw_pgid, &pgid); |
2164 | ceph_osds_init(temp); | |
45966c34 ID |
2165 | |
2166 | /* pg_temp? */ | |
2167 | pg = __lookup_pg_mapping(&osdmap->pg_temp, pgid); | |
2168 | if (pg) { | |
45966c34 ID |
2169 | for (i = 0; i < pg->pg_temp.len; i++) { |
2170 | if (ceph_osd_is_down(osdmap, pg->pg_temp.osds[i])) { | |
6f3bfd45 | 2171 | if (ceph_can_shift_osds(pi)) |
45966c34 | 2172 | continue; |
6f3bfd45 ID |
2173 | |
2174 | temp->osds[temp->size++] = CRUSH_ITEM_NONE; | |
45966c34 | 2175 | } else { |
6f3bfd45 | 2176 | temp->osds[temp->size++] = pg->pg_temp.osds[i]; |
45966c34 ID |
2177 | } |
2178 | } | |
2179 | ||
2180 | /* apply pg_temp's primary */ | |
6f3bfd45 ID |
2181 | for (i = 0; i < temp->size; i++) { |
2182 | if (temp->osds[i] != CRUSH_ITEM_NONE) { | |
2183 | temp->primary = temp->osds[i]; | |
45966c34 ID |
2184 | break; |
2185 | } | |
2186 | } | |
45966c34 ID |
2187 | } |
2188 | ||
5e8d4d36 ID |
2189 | /* primary_temp? */ |
2190 | pg = __lookup_pg_mapping(&osdmap->primary_temp, pgid); | |
2191 | if (pg) | |
6f3bfd45 | 2192 | temp->primary = pg->primary_temp.osd; |
45966c34 ID |
2193 | } |
2194 | ||
d85b7056 | 2195 | /* |
6f3bfd45 | 2196 | * Map a PG to its acting set as well as its up set. |
ac972230 | 2197 | * |
6f3bfd45 ID |
2198 | * Acting set is used for data mapping purposes, while up set can be |
2199 | * recorded for detecting interval changes and deciding whether to | |
2200 | * resend a request. | |
d85b7056 | 2201 | */ |
6f3bfd45 ID |
2202 | void ceph_pg_to_up_acting_osds(struct ceph_osdmap *osdmap, |
2203 | const struct ceph_pg *raw_pgid, | |
2204 | struct ceph_osds *up, | |
2205 | struct ceph_osds *acting) | |
d85b7056 | 2206 | { |
6f3bfd45 | 2207 | struct ceph_pg_pool_info *pi; |
ac972230 | 2208 | u32 pps; |
d85b7056 | 2209 | |
6f3bfd45 ID |
2210 | pi = ceph_pg_pool_by_id(osdmap, raw_pgid->pool); |
2211 | if (!pi) { | |
2212 | ceph_osds_init(up); | |
2213 | ceph_osds_init(acting); | |
2214 | goto out; | |
8008ab10 | 2215 | } |
d85b7056 | 2216 | |
6f3bfd45 ID |
2217 | pg_to_raw_osds(osdmap, pi, raw_pgid, up, &pps); |
2218 | raw_to_up_osds(osdmap, pi, up); | |
2219 | apply_primary_affinity(osdmap, pi, pps, up); | |
2220 | get_temp_osds(osdmap, pi, raw_pgid, acting); | |
2221 | if (!acting->size) { | |
2222 | memcpy(acting->osds, up->osds, up->size * sizeof(up->osds[0])); | |
2223 | acting->size = up->size; | |
2224 | if (acting->primary == -1) | |
2225 | acting->primary = up->primary; | |
8008ab10 | 2226 | } |
6f3bfd45 ID |
2227 | out: |
2228 | WARN_ON(!osds_valid(up) || !osds_valid(acting)); | |
d85b7056 SW |
2229 | } |
2230 | ||
f24e9980 | 2231 | /* |
f81f1633 | 2232 | * Return acting primary for given PG, or -1 if none. |
f24e9980 | 2233 | */ |
f81f1633 ID |
2234 | int ceph_pg_to_acting_primary(struct ceph_osdmap *osdmap, |
2235 | const struct ceph_pg *raw_pgid) | |
f24e9980 | 2236 | { |
6f3bfd45 | 2237 | struct ceph_osds up, acting; |
f24e9980 | 2238 | |
f81f1633 | 2239 | ceph_pg_to_up_acting_osds(osdmap, raw_pgid, &up, &acting); |
6f3bfd45 | 2240 | return acting.primary; |
f24e9980 | 2241 | } |
f81f1633 | 2242 | EXPORT_SYMBOL(ceph_pg_to_acting_primary); |