net/ceph/osdmap.c

   1
   2 #include <linux/ceph/ceph_debug.h>
   3
   4 #include <linux/module.h>
   5 #include <linux/slab.h>
   6 #include <asm/div64.h>
   7
   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>
  13
  14 char *ceph_osdmap_state_str(char *str, int len, int state)
  15 {
  16         if (!len)
  17                 return str;
  18
  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
  26                 snprintf(str, len, "doesn't exist");
  27
  28         return str;
  29 }
  30
  31 /* maps */
  32
  33 static int calc_bits_of(unsigned int t)
  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 {
  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;
  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);
  60         b->item_weight = ceph_decode_32(p);
  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++) {
  79                 b->item_weights[j] = ceph_decode_32(p);
  80                 b->sum_weights[j] = ceph_decode_32(p);
  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);
  92         ceph_decode_32_safe(p, end, b->num_nodes, bad);
  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++)
  98                 b->node_weights[j] = ceph_decode_32(p);
  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++) {
 117                 b->item_weights[j] = ceph_decode_32(p);
 118                 b->straws[j] = ceph_decode_32(p);
 119         }
 120         return 0;
 121 bad:
 122         return -EINVAL;
 123 }
 124
 125 static int skip_name_map(void **p, void *end)
 126 {
 127         int len;
 128         ceph_decode_32_safe(p, end, len ,bad);
 129         while (len--) {
 130                 int strlen;
 131                 *p += sizeof(u32);
 132                 ceph_decode_32_safe(p, end, strlen, bad);
 133                 *p += strlen;
 134 }
 135         return 0;
 136 bad:
 137         return -EINVAL;
 138 }
 139
 140 static struct crush_map *crush_decode(void *pbyval, void *end)
 141 {
 142         struct crush_map *c;
 143         int err = -EINVAL;
 144         int i, j;
 145         void **p = &pbyval;
 146         void *start = pbyval;
 147         u32 magic;
 148         u32 num_name_maps;
 149
 150         dout("crush_decode %p to %p len %d\n", *p, end, (int)(end - *p));
 151
 152         c = kzalloc(sizeof(*c), GFP_NOFS);
 153         if (c == NULL)
 154                 return ERR_PTR(-ENOMEM);
 155
 156         /* set tunables to default values */
 157         c->choose_local_tries = 2;
 158         c->choose_local_fallback_tries = 5;
 159         c->choose_total_tries = 19;
 160         c->chooseleaf_descend_once = 0;
 161
 162         ceph_decode_need(p, end, 4*sizeof(u32), bad);
 163         magic = ceph_decode_32(p);
 164         if (magic != CRUSH_MAGIC) {
 165                 pr_err("crush_decode magic %x != current %x\n",
 166                        (unsigned int)magic, (unsigned int)CRUSH_MAGIC);
 167                 goto bad;
 168         }
 169         c->max_buckets = ceph_decode_32(p);
 170         c->max_rules = ceph_decode_32(p);
 171         c->max_devices = ceph_decode_32(p);
 172
 173         c->buckets = kcalloc(c->max_buckets, sizeof(*c->buckets), GFP_NOFS);
 174         if (c->buckets == NULL)
 175                 goto badmem;
 176         c->rules = kcalloc(c->max_rules, sizeof(*c->rules), GFP_NOFS);
 177         if (c->rules == NULL)
 178                 goto badmem;
 179
 180         /* buckets */
 181         for (i = 0; i < c->max_buckets; i++) {
 182                 int size = 0;
 183                 u32 alg;
 184                 struct crush_bucket *b;
 185
 186                 ceph_decode_32_safe(p, end, alg, bad);
 187                 if (alg == 0) {
 188                         c->buckets[i] = NULL;
 189                         continue;
 190                 }
 191                 dout("crush_decode bucket %d off %x %p to %p\n",
 192                      i, (int)(*p-start), *p, end);
 193
 194                 switch (alg) {
 195                 case CRUSH_BUCKET_UNIFORM:
 196                         size = sizeof(struct crush_bucket_uniform);
 197                         break;
 198                 case CRUSH_BUCKET_LIST:
 199                         size = sizeof(struct crush_bucket_list);
 200                         break;
 201                 case CRUSH_BUCKET_TREE:
 202                         size = sizeof(struct crush_bucket_tree);
 203                         break;
 204                 case CRUSH_BUCKET_STRAW:
 205                         size = sizeof(struct crush_bucket_straw);
 206                         break;
 207                 default:
 208                         err = -EINVAL;
 209                         goto bad;
 210                 }
 211                 BUG_ON(size == 0);
 212                 b = c->buckets[i] = kzalloc(size, GFP_NOFS);
 213                 if (b == NULL)
 214                         goto badmem;
 215
 216                 ceph_decode_need(p, end, 4*sizeof(u32), bad);
 217                 b->id = ceph_decode_32(p);
 218                 b->type = ceph_decode_16(p);
 219                 b->alg = ceph_decode_8(p);
 220                 b->hash = ceph_decode_8(p);
 221                 b->weight = ceph_decode_32(p);
 222                 b->size = ceph_decode_32(p);
 223
 224                 dout("crush_decode bucket size %d off %x %p to %p\n",
 225                      b->size, (int)(*p-start), *p, end);
 226
 227                 b->items = kcalloc(b->size, sizeof(__s32), GFP_NOFS);
 228                 if (b->items == NULL)
 229                         goto badmem;
 230                 b->perm = kcalloc(b->size, sizeof(u32), GFP_NOFS);
 231                 if (b->perm == NULL)
 232                         goto badmem;
 233                 b->perm_n = 0;
 234
 235                 ceph_decode_need(p, end, b->size*sizeof(u32), bad);
 236                 for (j = 0; j < b->size; j++)
 237                         b->items[j] = ceph_decode_32(p);
 238
 239                 switch (b->alg) {
 240                 case CRUSH_BUCKET_UNIFORM:
 241                         err = crush_decode_uniform_bucket(p, end,
 242                                   (struct crush_bucket_uniform *)b);
 243                         if (err < 0)
 244                                 goto bad;
 245                         break;
 246                 case CRUSH_BUCKET_LIST:
 247                         err = crush_decode_list_bucket(p, end,
 248                                (struct crush_bucket_list *)b);
 249                         if (err < 0)
 250                                 goto bad;
 251                         break;
 252                 case CRUSH_BUCKET_TREE:
 253                         err = crush_decode_tree_bucket(p, end,
 254                                 (struct crush_bucket_tree *)b);
 255                         if (err < 0)
 256                                 goto bad;
 257                         break;
 258                 case CRUSH_BUCKET_STRAW:
 259                         err = crush_decode_straw_bucket(p, end,
 260                                 (struct crush_bucket_straw *)b);
 261                         if (err < 0)
 262                                 goto bad;
 263                         break;
 264                 }
 265         }
 266
 267         /* rules */
 268         dout("rule vec is %p\n", c->rules);
 269         for (i = 0; i < c->max_rules; i++) {
 270                 u32 yes;
 271                 struct crush_rule *r;
 272
 273                 ceph_decode_32_safe(p, end, yes, bad);
 274                 if (!yes) {
 275                         dout("crush_decode NO rule %d off %x %p to %p\n",
 276                              i, (int)(*p-start), *p, end);
 277                         c->rules[i] = NULL;
 278                         continue;
 279                 }
 280
 281                 dout("crush_decode rule %d off %x %p to %p\n",
 282                      i, (int)(*p-start), *p, end);
 283
 284                 /* len */
 285                 ceph_decode_32_safe(p, end, yes, bad);
 286 #if BITS_PER_LONG == 32
 287                 err = -EINVAL;
 288                 if (yes > (ULONG_MAX - sizeof(*r))
 289                           / sizeof(struct crush_rule_step))
 290                         goto bad;
 291 #endif
 292                 r = c->rules[i] = kmalloc(sizeof(*r) +
 293                                           yes*sizeof(struct crush_rule_step),
 294                                           GFP_NOFS);
 295                 if (r == NULL)
 296                         goto badmem;
 297                 dout(" rule %d is at %p\n", i, r);
 298                 r->len = yes;
 299                 ceph_decode_copy_safe(p, end, &r->mask, 4, bad); /* 4 u8's */
 300                 ceph_decode_need(p, end, r->len*3*sizeof(u32), bad);
 301                 for (j = 0; j < r->len; j++) {
 302                         r->steps[j].op = ceph_decode_32(p);
 303                         r->steps[j].arg1 = ceph_decode_32(p);
 304                         r->steps[j].arg2 = ceph_decode_32(p);
 305                 }
 306         }
 307
 308         /* ignore trailing name maps. */
 309         for (num_name_maps = 0; num_name_maps < 3; num_name_maps++) {
 310                 err = skip_name_map(p, end);
 311                 if (err < 0)
 312                         goto done;
 313         }
 314
 315         /* tunables */
 316         ceph_decode_need(p, end, 3*sizeof(u32), done);
 317         c->choose_local_tries = ceph_decode_32(p);
 318         c->choose_local_fallback_tries =  ceph_decode_32(p);
 319         c->choose_total_tries = ceph_decode_32(p);
 320         dout("crush decode tunable choose_local_tries = %d",
 321              c->choose_local_tries);
 322         dout("crush decode tunable choose_local_fallback_tries = %d",
 323              c->choose_local_fallback_tries);
 324         dout("crush decode tunable choose_total_tries = %d",
 325              c->choose_total_tries);
 326
 327         ceph_decode_need(p, end, sizeof(u32), done);
 328         c->chooseleaf_descend_once = ceph_decode_32(p);
 329         dout("crush decode tunable chooseleaf_descend_once = %d",
 330              c->chooseleaf_descend_once);
 331
 332 done:
 333         dout("crush_decode success\n");
 334         return c;
 335
 336 badmem:
 337         err = -ENOMEM;
 338 bad:
 339         dout("crush_decode fail %d\n", err);
 340         crush_destroy(c);
 341         return ERR_PTR(err);
 342 }
 343
 344 /*
 345  * rbtree of pg_mapping for handling pg_temp (explicit mapping of pgid
 346  * to a set of osds)
 347  */
 348 static int pgid_cmp(struct ceph_pg l, struct ceph_pg r)
 349 {
 350         if (l.pool < r.pool)
 351                 return -1;
 352         if (l.pool > r.pool)
 353                 return 1;
 354         if (l.seed < r.seed)
 355                 return -1;
 356         if (l.seed > r.seed)
 357                 return 1;
 358         return 0;
 359 }
 360
 361 static int __insert_pg_mapping(struct ceph_pg_mapping *new,
 362                                struct rb_root *root)
 363 {
 364         struct rb_node **p = &root->rb_node;
 365         struct rb_node *parent = NULL;
 366         struct ceph_pg_mapping *pg = NULL;
 367         int c;
 368
 369         dout("__insert_pg_mapping %llx %p\n", *(u64 *)&new->pgid, new);
 370         while (*p) {
 371                 parent = *p;
 372                 pg = rb_entry(parent, struct ceph_pg_mapping, node);
 373                 c = pgid_cmp(new->pgid, pg->pgid);
 374                 if (c < 0)
 375                         p = &(*p)->rb_left;
 376                 else if (c > 0)
 377                         p = &(*p)->rb_right;
 378                 else
 379                         return -EEXIST;
 380         }
 381
 382         rb_link_node(&new->node, parent, p);
 383         rb_insert_color(&new->node, root);
 384         return 0;
 385 }
 386
 387 static struct ceph_pg_mapping *__lookup_pg_mapping(struct rb_root *root,
 388                                                    struct ceph_pg pgid)
 389 {
 390         struct rb_node *n = root->rb_node;
 391         struct ceph_pg_mapping *pg;
 392         int c;
 393
 394         while (n) {
 395                 pg = rb_entry(n, struct ceph_pg_mapping, node);
 396                 c = pgid_cmp(pgid, pg->pgid);
 397                 if (c < 0) {
 398                         n = n->rb_left;
 399                 } else if (c > 0) {
 400                         n = n->rb_right;
 401                 } else {
 402                         dout("__lookup_pg_mapping %lld.%x got %p\n",
 403                              pgid.pool, pgid.seed, pg);
 404                         return pg;
 405                 }
 406         }
 407         return NULL;
 408 }
 409
 410 static int __remove_pg_mapping(struct rb_root *root, struct ceph_pg pgid)
 411 {
 412         struct ceph_pg_mapping *pg = __lookup_pg_mapping(root, pgid);
 413
 414         if (pg) {
 415                 dout("__remove_pg_mapping %lld.%x %p\n", pgid.pool, pgid.seed,
 416                      pg);
 417                 rb_erase(&pg->node, root);
 418                 kfree(pg);
 419                 return 0;
 420         }
 421         dout("__remove_pg_mapping %lld.%x dne\n", pgid.pool, pgid.seed);
 422         return -ENOENT;
 423 }
 424
 425 /*
 426  * rbtree of pg pool info
 427  */
 428 static int __insert_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *new)
 429 {
 430         struct rb_node **p = &root->rb_node;
 431         struct rb_node *parent = NULL;
 432         struct ceph_pg_pool_info *pi = NULL;
 433
 434         while (*p) {
 435                 parent = *p;
 436                 pi = rb_entry(parent, struct ceph_pg_pool_info, node);
 437                 if (new->id < pi->id)
 438                         p = &(*p)->rb_left;
 439                 else if (new->id > pi->id)
 440                         p = &(*p)->rb_right;
 441                 else
 442                         return -EEXIST;
 443         }
 444
 445         rb_link_node(&new->node, parent, p);
 446         rb_insert_color(&new->node, root);
 447         return 0;
 448 }
 449
 450 static struct ceph_pg_pool_info *__lookup_pg_pool(struct rb_root *root, u64 id)
 451 {
 452         struct ceph_pg_pool_info *pi;
 453         struct rb_node *n = root->rb_node;
 454
 455         while (n) {
 456                 pi = rb_entry(n, struct ceph_pg_pool_info, node);
 457                 if (id < pi->id)
 458                         n = n->rb_left;
 459                 else if (id > pi->id)
 460                         n = n->rb_right;
 461                 else
 462                         return pi;
 463         }
 464         return NULL;
 465 }
 466
 467 struct ceph_pg_pool_info *ceph_pg_pool_by_id(struct ceph_osdmap *map, u64 id)
 468 {
 469         return __lookup_pg_pool(&map->pg_pools, id);
 470 }
 471
 472 const char *ceph_pg_pool_name_by_id(struct ceph_osdmap *map, u64 id)
 473 {
 474         struct ceph_pg_pool_info *pi;
 475
 476         if (id == CEPH_NOPOOL)
 477                 return NULL;
 478
 479         if (WARN_ON_ONCE(id > (u64) INT_MAX))
 480                 return NULL;
 481
 482         pi = __lookup_pg_pool(&map->pg_pools, (int) id);
 483
 484         return pi ? pi->name : NULL;
 485 }
 486 EXPORT_SYMBOL(ceph_pg_pool_name_by_id);
 487
 488 int ceph_pg_poolid_by_name(struct ceph_osdmap *map, const char *name)
 489 {
 490         struct rb_node *rbp;
 491
 492         for (rbp = rb_first(&map->pg_pools); rbp; rbp = rb_next(rbp)) {
 493                 struct ceph_pg_pool_info *pi =
 494                         rb_entry(rbp, struct ceph_pg_pool_info, node);
 495                 if (pi->name && strcmp(pi->name, name) == 0)
 496                         return pi->id;
 497         }
 498         return -ENOENT;
 499 }
 500 EXPORT_SYMBOL(ceph_pg_poolid_by_name);
 501
 502 static void __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi)
 503 {
 504         rb_erase(&pi->node, root);
 505         kfree(pi->name);
 506         kfree(pi);
 507 }
 508
 509 static int decode_pool(void **p, void *end, struct ceph_pg_pool_info *pi)
 510 {
 511         u8 ev, cv;
 512         unsigned len, num;
 513         void *pool_end;
 514
 515         ceph_decode_need(p, end, 2 + 4, bad);
 516         ev = ceph_decode_8(p);  /* encoding version */
 517         cv = ceph_decode_8(p); /* compat version */
 518         if (ev < 5) {
 519                 pr_warning("got v %d < 5 cv %d of ceph_pg_pool\n", ev, cv);
 520                 return -EINVAL;
 521         }
 522         if (cv > 9) {
 523                 pr_warning("got v %d cv %d > 9 of ceph_pg_pool\n", ev, cv);
 524                 return -EINVAL;
 525         }
 526         len = ceph_decode_32(p);
 527         ceph_decode_need(p, end, len, bad);
 528         pool_end = *p + len;
 529
 530         pi->type = ceph_decode_8(p);
 531         pi->size = ceph_decode_8(p);
 532         pi->crush_ruleset = ceph_decode_8(p);
 533         pi->object_hash = ceph_decode_8(p);
 534
 535         pi->pg_num = ceph_decode_32(p);
 536         pi->pgp_num = ceph_decode_32(p);
 537
 538         *p += 4 + 4;  /* skip lpg* */
 539         *p += 4;      /* skip last_change */
 540         *p += 8 + 4;  /* skip snap_seq, snap_epoch */
 541
 542         /* skip snaps */
 543         num = ceph_decode_32(p);
 544         while (num--) {
 545                 *p += 8;  /* snapid key */
 546                 *p += 1 + 1; /* versions */
 547                 len = ceph_decode_32(p);
 548                 *p += len;
 549         }
 550
 551         /* skip removed_snaps */
 552         num = ceph_decode_32(p);
 553         *p += num * (8 + 8);
 554
 555         *p += 8;  /* skip auid */
 556         pi->flags = ceph_decode_64(p);
 557         *p += 4;  /* skip crash_replay_interval */
 558
 559         if (ev >= 7)
 560                 *p += 1;  /* skip min_size */
 561
 562         if (ev >= 8)
 563                 *p += 8 + 8;  /* skip quota_max_* */
 564
 565         if (ev >= 9) {
 566                 /* skip tiers */
 567                 num = ceph_decode_32(p);
 568                 *p += num * 8;
 569
 570                 *p += 8;  /* skip tier_of */
 571                 *p += 1;  /* skip cache_mode */
 572
 573                 pi->read_tier = ceph_decode_64(p);
 574                 pi->write_tier = ceph_decode_64(p);
 575         } else {
 576                 pi->read_tier = -1;
 577                 pi->write_tier = -1;
 578         }
 579
 580         /* ignore the rest */
 581
 582         *p = pool_end;
 583         calc_pg_masks(pi);
 584         return 0;
 585
 586 bad:
 587         return -EINVAL;
 588 }
 589
 590 static int decode_pool_names(void **p, void *end, struct ceph_osdmap *map)
 591 {
 592         struct ceph_pg_pool_info *pi;
 593         u32 num, len;
 594         u64 pool;
 595
 596         ceph_decode_32_safe(p, end, num, bad);
 597         dout(" %d pool names\n", num);
 598         while (num--) {
 599                 ceph_decode_64_safe(p, end, pool, bad);
 600                 ceph_decode_32_safe(p, end, len, bad);
 601                 dout("  pool %llu len %d\n", pool, len);
 602                 ceph_decode_need(p, end, len, bad);
 603                 pi = __lookup_pg_pool(&map->pg_pools, pool);
 604                 if (pi) {
 605                         char *name = kstrndup(*p, len, GFP_NOFS);
 606
 607                         if (!name)
 608                                 return -ENOMEM;
 609                         kfree(pi->name);
 610                         pi->name = name;
 611                         dout("  name is %s\n", pi->name);
 612                 }
 613                 *p += len;
 614         }
 615         return 0;
 616
 617 bad:
 618         return -EINVAL;
 619 }
 620
 621 /*
 622  * osd map
 623  */
 624 void ceph_osdmap_destroy(struct ceph_osdmap *map)
 625 {
 626         dout("osdmap_destroy %p\n", map);
 627         if (map->crush)
 628                 crush_destroy(map->crush);
 629         while (!RB_EMPTY_ROOT(&map->pg_temp)) {
 630                 struct ceph_pg_mapping *pg =
 631                         rb_entry(rb_first(&map->pg_temp),
 632                                  struct ceph_pg_mapping, node);
 633                 rb_erase(&pg->node, &map->pg_temp);
 634                 kfree(pg);
 635         }
 636         while (!RB_EMPTY_ROOT(&map->pg_pools)) {
 637                 struct ceph_pg_pool_info *pi =
 638                         rb_entry(rb_first(&map->pg_pools),
 639                                  struct ceph_pg_pool_info, node);
 640                 __remove_pg_pool(&map->pg_pools, pi);
 641         }
 642         kfree(map->osd_state);
 643         kfree(map->osd_weight);
 644         kfree(map->osd_addr);
 645         kfree(map);
 646 }
 647
 648 /*
 649  * adjust max osd value.  reallocate arrays.
 650  */
 651 static int osdmap_set_max_osd(struct ceph_osdmap *map, int max)
 652 {
 653         u8 *state;
 654         struct ceph_entity_addr *addr;
 655         u32 *weight;
 656
 657         state = kcalloc(max, sizeof(*state), GFP_NOFS);
 658         addr = kcalloc(max, sizeof(*addr), GFP_NOFS);
 659         weight = kcalloc(max, sizeof(*weight), GFP_NOFS);
 660         if (state == NULL || addr == NULL || weight == NULL) {
 661                 kfree(state);
 662                 kfree(addr);
 663                 kfree(weight);
 664                 return -ENOMEM;
 665         }
 666
 667         /* copy old? */
 668         if (map->osd_state) {
 669                 memcpy(state, map->osd_state, map->max_osd*sizeof(*state));
 670                 memcpy(addr, map->osd_addr, map->max_osd*sizeof(*addr));
 671                 memcpy(weight, map->osd_weight, map->max_osd*sizeof(*weight));
 672                 kfree(map->osd_state);
 673                 kfree(map->osd_addr);
 674                 kfree(map->osd_weight);
 675         }
 676
 677         map->osd_state = state;
 678         map->osd_weight = weight;
 679         map->osd_addr = addr;
 680         map->max_osd = max;
 681         return 0;
 682 }
 683
 684 static int __decode_pools(void **p, void *end, struct ceph_osdmap *map,
 685                           bool incremental)
 686 {
 687         u32 n;
 688
 689         ceph_decode_32_safe(p, end, n, e_inval);
 690         while (n--) {
 691                 struct ceph_pg_pool_info *pi;
 692                 u64 pool;
 693                 int ret;
 694
 695                 ceph_decode_64_safe(p, end, pool, e_inval);
 696
 697                 pi = __lookup_pg_pool(&map->pg_pools, pool);
 698                 if (!incremental || !pi) {
 699                         pi = kzalloc(sizeof(*pi), GFP_NOFS);
 700                         if (!pi)
 701                                 return -ENOMEM;
 702
 703                         pi->id = pool;
 704
 705                         ret = __insert_pg_pool(&map->pg_pools, pi);
 706                         if (ret) {
 707                                 kfree(pi);
 708                                 return ret;
 709                         }
 710                 }
 711
 712                 ret = decode_pool(p, end, pi);
 713                 if (ret)
 714                         return ret;
 715         }
 716
 717         return 0;
 718
 719 e_inval:
 720         return -EINVAL;
 721 }
 722
 723 static int decode_pools(void **p, void *end, struct ceph_osdmap *map)
 724 {
 725         return __decode_pools(p, end, map, false);
 726 }
 727
 728 static int decode_new_pools(void **p, void *end, struct ceph_osdmap *map)
 729 {
 730         return __decode_pools(p, end, map, true);
 731 }
 732
 733 /*
 734  * decode a full map.
 735  */
 736 static int osdmap_decode(void **p, void *end, struct ceph_osdmap *map)
 737 {
 738         u16 version;
 739         u32 epoch = 0;
 740         void *start = *p;
 741         u32 max;
 742         u32 len, i;
 743         int err;
 744
 745         dout("%s %p to %p len %d\n", __func__, *p, end, (int)(end - *p));
 746
 747         ceph_decode_16_safe(p, end, version, e_inval);
 748         if (version > 6) {
 749                 pr_warning("got unknown v %d > 6 of osdmap\n", version);
 750                 goto e_inval;
 751         }
 752         if (version < 6) {
 753                 pr_warning("got old v %d < 6 of osdmap\n", version);
 754                 goto e_inval;
 755         }
 756
 757         /* fsid, epoch, created, modified */
 758         ceph_decode_need(p, end, sizeof(map->fsid) + sizeof(u32) +
 759                          sizeof(map->created) + sizeof(map->modified), e_inval);
 760         ceph_decode_copy(p, &map->fsid, sizeof(map->fsid));
 761         epoch = map->epoch = ceph_decode_32(p);
 762         ceph_decode_copy(p, &map->created, sizeof(map->created));
 763         ceph_decode_copy(p, &map->modified, sizeof(map->modified));
 764
 765         /* pools */
 766         err = decode_pools(p, end, map);
 767         if (err)
 768                 goto bad;
 769
 770         /* pool_name */
 771         err = decode_pool_names(p, end, map);
 772         if (err)
 773                 goto bad;
 774
 775         ceph_decode_32_safe(p, end, map->pool_max, e_inval);
 776
 777         ceph_decode_32_safe(p, end, map->flags, e_inval);
 778
 779         /* max_osd */
 780         ceph_decode_32_safe(p, end, max, e_inval);
 781
 782         /* (re)alloc osd arrays */
 783         err = osdmap_set_max_osd(map, max);
 784         if (err)
 785                 goto bad;
 786
 787         /* osd_state, osd_weight, osd_addrs->client_addr */
 788         ceph_decode_need(p, end, 3*sizeof(u32) +
 789                          map->max_osd*(1 + sizeof(*map->osd_weight) +
 790                                        sizeof(*map->osd_addr)), e_inval);
 791
 792         if (ceph_decode_32(p) != map->max_osd)
 793                 goto e_inval;
 794
 795         ceph_decode_copy(p, map->osd_state, map->max_osd);
 796
 797         if (ceph_decode_32(p) != map->max_osd)
 798                 goto e_inval;
 799
 800         for (i = 0; i < map->max_osd; i++)
 801                 map->osd_weight[i] = ceph_decode_32(p);
 802
 803         if (ceph_decode_32(p) != map->max_osd)
 804                 goto e_inval;
 805
 806         ceph_decode_copy(p, map->osd_addr, map->max_osd*sizeof(*map->osd_addr));
 807         for (i = 0; i < map->max_osd; i++)
 808                 ceph_decode_addr(&map->osd_addr[i]);
 809
 810         /* pg_temp */
 811         ceph_decode_32_safe(p, end, len, e_inval);
 812         for (i = 0; i < len; i++) {
 813                 int n, j;
 814                 struct ceph_pg pgid;
 815                 struct ceph_pg_mapping *pg;
 816
 817                 err = ceph_decode_pgid(p, end, &pgid);
 818                 if (err)
 819                         goto bad;
 820                 ceph_decode_need(p, end, sizeof(u32), e_inval);
 821                 n = ceph_decode_32(p);
 822                 if (n > (UINT_MAX - sizeof(*pg)) / sizeof(u32))
 823                         goto e_inval;
 824                 ceph_decode_need(p, end, n * sizeof(u32), e_inval);
 825                 pg = kmalloc(sizeof(*pg) + n*sizeof(u32), GFP_NOFS);
 826                 if (!pg) {
 827                         err = -ENOMEM;
 828                         goto bad;
 829                 }
 830                 pg->pgid = pgid;
 831                 pg->len = n;
 832                 for (j = 0; j < n; j++)
 833                         pg->osds[j] = ceph_decode_32(p);
 834
 835                 err = __insert_pg_mapping(pg, &map->pg_temp);
 836                 if (err)
 837                         goto bad;
 838                 dout(" added pg_temp %lld.%x len %d\n", pgid.pool, pgid.seed,
 839                      len);
 840         }
 841
 842         /* crush */
 843         ceph_decode_32_safe(p, end, len, e_inval);
 844         map->crush = crush_decode(*p, min(*p + len, end));
 845         if (IS_ERR(map->crush)) {
 846                 err = PTR_ERR(map->crush);
 847                 map->crush = NULL;
 848                 goto bad;
 849         }
 850         *p += len;
 851
 852         /* ignore the rest */
 853         *p = end;
 854
 855         dout("full osdmap epoch %d max_osd %d\n", map->epoch, map->max_osd);
 856         return 0;
 857
 858 e_inval:
 859         err = -EINVAL;
 860 bad:
 861         pr_err("corrupt full osdmap (%d) epoch %d off %d (%p of %p-%p)\n",
 862                err, epoch, (int)(*p - start), *p, start, end);
 863         print_hex_dump(KERN_DEBUG, "osdmap: ",
 864                        DUMP_PREFIX_OFFSET, 16, 1,
 865                        start, end - start, true);
 866         return err;
 867 }
 868
 869 /*
 870  * Allocate and decode a full map.
 871  */
 872 struct ceph_osdmap *ceph_osdmap_decode(void **p, void *end)
 873 {
 874         struct ceph_osdmap *map;
 875         int ret;
 876
 877         map = kzalloc(sizeof(*map), GFP_NOFS);
 878         if (!map)
 879                 return ERR_PTR(-ENOMEM);
 880
 881         map->pg_temp = RB_ROOT;
 882         mutex_init(&map->crush_scratch_mutex);
 883
 884         ret = osdmap_decode(p, end, map);
 885         if (ret) {
 886                 ceph_osdmap_destroy(map);
 887                 return ERR_PTR(ret);
 888         }
 889
 890         return map;
 891 }
 892
 893 /*
 894  * decode and apply an incremental map update.
 895  */
 896 struct ceph_osdmap *osdmap_apply_incremental(void **p, void *end,
 897                                              struct ceph_osdmap *map,
 898                                              struct ceph_messenger *msgr)
 899 {
 900         struct crush_map *newcrush = NULL;
 901         struct ceph_fsid fsid;
 902         u32 epoch = 0;
 903         struct ceph_timespec modified;
 904         s32 len;
 905         u64 pool;
 906         __s64 new_pool_max;
 907         __s32 new_flags, max;
 908         void *start = *p;
 909         int err;
 910         u16 version;
 911
 912         dout("%s %p to %p len %d\n", __func__, *p, end, (int)(end - *p));
 913
 914         ceph_decode_16_safe(p, end, version, e_inval);
 915         if (version != 6) {
 916                 pr_warning("got unknown v %d != 6 of inc osdmap\n", version);
 917                 goto e_inval;
 918         }
 919
 920         /* fsid, epoch, modified, new_pool_max, new_flags */
 921         ceph_decode_need(p, end, sizeof(fsid) + sizeof(u32) + sizeof(modified) +
 922                          sizeof(u64) + sizeof(u32), e_inval);
 923         ceph_decode_copy(p, &fsid, sizeof(fsid));
 924         epoch = ceph_decode_32(p);
 925         BUG_ON(epoch != map->epoch+1);
 926         ceph_decode_copy(p, &modified, sizeof(modified));
 927         new_pool_max = ceph_decode_64(p);
 928         new_flags = ceph_decode_32(p);
 929
 930         /* full map? */
 931         ceph_decode_32_safe(p, end, len, e_inval);
 932         if (len > 0) {
 933                 dout("apply_incremental full map len %d, %p to %p\n",
 934                      len, *p, end);
 935                 return ceph_osdmap_decode(p, min(*p+len, end));
 936         }
 937
 938         /* new crush? */
 939         ceph_decode_32_safe(p, end, len, e_inval);
 940         if (len > 0) {
 941                 newcrush = crush_decode(*p, min(*p+len, end));
 942                 if (IS_ERR(newcrush)) {
 943                         err = PTR_ERR(newcrush);
 944                         newcrush = NULL;
 945                         goto bad;
 946                 }
 947                 *p += len;
 948         }
 949
 950         /* new flags? */
 951         if (new_flags >= 0)
 952                 map->flags = new_flags;
 953         if (new_pool_max >= 0)
 954                 map->pool_max = new_pool_max;
 955
 956         /* new max? */
 957         ceph_decode_32_safe(p, end, max, e_inval);
 958         if (max >= 0) {
 959                 err = osdmap_set_max_osd(map, max);
 960                 if (err)
 961                         goto bad;
 962         }
 963
 964         map->epoch++;
 965         map->modified = modified;
 966         if (newcrush) {
 967                 if (map->crush)
 968                         crush_destroy(map->crush);
 969                 map->crush = newcrush;
 970                 newcrush = NULL;
 971         }
 972
 973         /* new_pools */
 974         err = decode_new_pools(p, end, map);
 975         if (err)
 976                 goto bad;
 977
 978         /* new_pool_names */
 979         err = decode_pool_names(p, end, map);
 980         if (err)
 981                 goto bad;
 982
 983         /* old_pool */
 984         ceph_decode_32_safe(p, end, len, e_inval);
 985         while (len--) {
 986                 struct ceph_pg_pool_info *pi;
 987
 988                 ceph_decode_64_safe(p, end, pool, e_inval);
 989                 pi = __lookup_pg_pool(&map->pg_pools, pool);
 990                 if (pi)
 991                         __remove_pg_pool(&map->pg_pools, pi);
 992         }
 993
 994         /* new_up */
 995         ceph_decode_32_safe(p, end, len, e_inval);
 996         while (len--) {
 997                 u32 osd;
 998                 struct ceph_entity_addr addr;
 999                 ceph_decode_32_safe(p, end, osd, e_inval);
1000                 ceph_decode_copy_safe(p, end, &addr, sizeof(addr), e_inval);
1001                 ceph_decode_addr(&addr);
1002                 pr_info("osd%d up\n", osd);
1003                 BUG_ON(osd >= map->max_osd);
1004                 map->osd_state[osd] |= CEPH_OSD_UP;
1005                 map->osd_addr[osd] = addr;
1006         }
1007
1008         /* new_state */
1009         ceph_decode_32_safe(p, end, len, e_inval);
1010         while (len--) {
1011                 u32 osd;
1012                 u8 xorstate;
1013                 ceph_decode_32_safe(p, end, osd, e_inval);
1014                 xorstate = **(u8 **)p;
1015                 (*p)++;  /* clean flag */
1016                 if (xorstate == 0)
1017                         xorstate = CEPH_OSD_UP;
1018                 if (xorstate & CEPH_OSD_UP)
1019                         pr_info("osd%d down\n", osd);
1020                 if (osd < map->max_osd)
1021                         map->osd_state[osd] ^= xorstate;
1022         }
1023
1024         /* new_weight */
1025         ceph_decode_32_safe(p, end, len, e_inval);
1026         while (len--) {
1027                 u32 osd, off;
1028                 ceph_decode_need(p, end, sizeof(u32)*2, e_inval);
1029                 osd = ceph_decode_32(p);
1030                 off = ceph_decode_32(p);
1031                 pr_info("osd%d weight 0x%x %s\n", osd, off,
1032                      off == CEPH_OSD_IN ? "(in)" :
1033                      (off == CEPH_OSD_OUT ? "(out)" : ""));
1034                 if (osd < map->max_osd)
1035                         map->osd_weight[osd] = off;
1036         }
1037
1038         /* new_pg_temp */
1039         ceph_decode_32_safe(p, end, len, e_inval);
1040         while (len--) {
1041                 struct ceph_pg_mapping *pg;
1042                 int j;
1043                 struct ceph_pg pgid;
1044                 u32 pglen;
1045
1046                 err = ceph_decode_pgid(p, end, &pgid);
1047                 if (err)
1048                         goto bad;
1049                 ceph_decode_need(p, end, sizeof(u32), e_inval);
1050                 pglen = ceph_decode_32(p);
1051                 if (pglen) {
1052                         ceph_decode_need(p, end, pglen*sizeof(u32), e_inval);
1053
1054                         /* removing existing (if any) */
1055                         (void) __remove_pg_mapping(&map->pg_temp, pgid);
1056
1057                         /* insert */
1058                         if (pglen > (UINT_MAX - sizeof(*pg)) / sizeof(u32))
1059                                 goto e_inval;
1060                         pg = kmalloc(sizeof(*pg) + sizeof(u32)*pglen, GFP_NOFS);
1061                         if (!pg) {
1062                                 err = -ENOMEM;
1063                                 goto bad;
1064                         }
1065                         pg->pgid = pgid;
1066                         pg->len = pglen;
1067                         for (j = 0; j < pglen; j++)
1068                                 pg->osds[j] = ceph_decode_32(p);
1069                         err = __insert_pg_mapping(pg, &map->pg_temp);
1070                         if (err) {
1071                                 kfree(pg);
1072                                 goto bad;
1073                         }
1074                         dout(" added pg_temp %lld.%x len %d\n", pgid.pool,
1075                              pgid.seed, pglen);
1076                 } else {
1077                         /* remove */
1078                         __remove_pg_mapping(&map->pg_temp, pgid);
1079                 }
1080         }
1081
1082         /* ignore the rest */
1083         *p = end;
1084
1085         dout("inc osdmap epoch %d max_osd %d\n", map->epoch, map->max_osd);
1086         return map;
1087
1088 e_inval:
1089         err = -EINVAL;
1090 bad:
1091         pr_err("corrupt inc osdmap (%d) epoch %d off %d (%p of %p-%p)\n",
1092                err, epoch, (int)(*p - start), *p, start, end);
1093         print_hex_dump(KERN_DEBUG, "osdmap: ",
1094                        DUMP_PREFIX_OFFSET, 16, 1,
1095                        start, end - start, true);
1096         if (newcrush)
1097                 crush_destroy(newcrush);
1098         return ERR_PTR(err);
1099 }
1100
1101
1102
1103
1104 /*
1105  * calculate file layout from given offset, length.
1106  * fill in correct oid, logical length, and object extent
1107  * offset, length.
1108  *
1109  * for now, we write only a single su, until we can
1110  * pass a stride back to the caller.
1111  */
1112 int ceph_calc_file_object_mapping(struct ceph_file_layout *layout,
1113                                    u64 off, u64 len,
1114                                    u64 *ono,
1115                                    u64 *oxoff, u64 *oxlen)
1116 {
1117         u32 osize = le32_to_cpu(layout->fl_object_size);
1118         u32 su = le32_to_cpu(layout->fl_stripe_unit);
1119         u32 sc = le32_to_cpu(layout->fl_stripe_count);
1120         u32 bl, stripeno, stripepos, objsetno;
1121         u32 su_per_object;
1122         u64 t, su_offset;
1123
1124         dout("mapping %llu~%llu  osize %u fl_su %u\n", off, len,
1125              osize, su);
1126         if (su == 0 || sc == 0)
1127                 goto invalid;
1128         su_per_object = osize / su;
1129         if (su_per_object == 0)
1130                 goto invalid;
1131         dout("osize %u / su %u = su_per_object %u\n", osize, su,
1132              su_per_object);
1133
1134         if ((su & ~PAGE_MASK) != 0)
1135                 goto invalid;
1136
1137         /* bl = *off / su; */
1138         t = off;
1139         do_div(t, su);
1140         bl = t;
1141         dout("off %llu / su %u = bl %u\n", off, su, bl);
1142
1143         stripeno = bl / sc;
1144         stripepos = bl % sc;
1145         objsetno = stripeno / su_per_object;
1146
1147         *ono = objsetno * sc + stripepos;
1148         dout("objset %u * sc %u = ono %u\n", objsetno, sc, (unsigned int)*ono);
1149
1150         /* *oxoff = *off % layout->fl_stripe_unit;  # offset in su */
1151         t = off;
1152         su_offset = do_div(t, su);
1153         *oxoff = su_offset + (stripeno % su_per_object) * su;
1154
1155         /*
1156          * Calculate the length of the extent being written to the selected
1157          * object. This is the minimum of the full length requested (len) or
1158          * the remainder of the current stripe being written to.
1159          */
1160         *oxlen = min_t(u64, len, su - su_offset);
1161
1162         dout(" obj extent %llu~%llu\n", *oxoff, *oxlen);
1163         return 0;
1164
1165 invalid:
1166         dout(" invalid layout\n");
1167         *ono = 0;
1168         *oxoff = 0;
1169         *oxlen = 0;
1170         return -EINVAL;
1171 }
1172 EXPORT_SYMBOL(ceph_calc_file_object_mapping);
1173
1174 /*
1175  * Calculate mapping of a (oloc, oid) pair to a PG.  Should only be
1176  * called with target's (oloc, oid), since tiering isn't taken into
1177  * account.
1178  */
1179 int ceph_oloc_oid_to_pg(struct ceph_osdmap *osdmap,
1180                         struct ceph_object_locator *oloc,
1181                         struct ceph_object_id *oid,
1182                         struct ceph_pg *pg_out)
1183 {
1184         struct ceph_pg_pool_info *pi;
1185
1186         pi = __lookup_pg_pool(&osdmap->pg_pools, oloc->pool);
1187         if (!pi)
1188                 return -EIO;
1189
1190         pg_out->pool = oloc->pool;
1191         pg_out->seed = ceph_str_hash(pi->object_hash, oid->name,
1192                                      oid->name_len);
1193
1194         dout("%s '%.*s' pgid %llu.%x\n", __func__, oid->name_len, oid->name,
1195              pg_out->pool, pg_out->seed);
1196         return 0;
1197 }
1198 EXPORT_SYMBOL(ceph_oloc_oid_to_pg);
1199
1200 static int do_crush(struct ceph_osdmap *map, int ruleno, int x,
1201                     int *result, int result_max,
1202                     const __u32 *weight, int weight_max)
1203 {
1204         int r;
1205
1206         BUG_ON(result_max > CEPH_PG_MAX_SIZE);
1207
1208         mutex_lock(&map->crush_scratch_mutex);
1209         r = crush_do_rule(map->crush, ruleno, x, result, result_max,
1210                           weight, weight_max, map->crush_scratch_ary);
1211         mutex_unlock(&map->crush_scratch_mutex);
1212
1213         return r;
1214 }
1215
1216 /*
1217  * Calculate raw osd vector for the given pgid.  Return pointer to osd
1218  * array, or NULL on failure.
1219  */
1220 static int *calc_pg_raw(struct ceph_osdmap *osdmap, struct ceph_pg pgid,
1221                         int *osds, int *num)
1222 {
1223         struct ceph_pg_mapping *pg;
1224         struct ceph_pg_pool_info *pool;
1225         int ruleno;
1226         int r;
1227         u32 pps;
1228
1229         pool = __lookup_pg_pool(&osdmap->pg_pools, pgid.pool);
1230         if (!pool)
1231                 return NULL;
1232
1233         /* pg_temp? */
1234         pgid.seed = ceph_stable_mod(pgid.seed, pool->pg_num,
1235                                     pool->pg_num_mask);
1236         pg = __lookup_pg_mapping(&osdmap->pg_temp, pgid);
1237         if (pg) {
1238                 *num = pg->len;
1239                 return pg->osds;
1240         }
1241
1242         /* crush */
1243         ruleno = crush_find_rule(osdmap->crush, pool->crush_ruleset,
1244                                  pool->type, pool->size);
1245         if (ruleno < 0) {
1246                 pr_err("no crush rule pool %lld ruleset %d type %d size %d\n",
1247                        pgid.pool, pool->crush_ruleset, pool->type,
1248                        pool->size);
1249                 return NULL;
1250         }
1251
1252         if (pool->flags & CEPH_POOL_FLAG_HASHPSPOOL) {
1253                 /* hash pool id and seed sothat pool PGs do not overlap */
1254                 pps = crush_hash32_2(CRUSH_HASH_RJENKINS1,
1255                                      ceph_stable_mod(pgid.seed, pool->pgp_num,
1256                                                      pool->pgp_num_mask),
1257                                      pgid.pool);
1258         } else {
1259                 /*
1260                  * legacy ehavior: add ps and pool together.  this is
1261                  * not a great approach because the PGs from each pool
1262                  * will overlap on top of each other: 0.5 == 1.4 ==
1263                  * 2.3 == ...
1264                  */
1265                 pps = ceph_stable_mod(pgid.seed, pool->pgp_num,
1266                                       pool->pgp_num_mask) +
1267                         (unsigned)pgid.pool;
1268         }
1269         r = do_crush(osdmap, ruleno, pps, osds, min_t(int, pool->size, *num),
1270                      osdmap->osd_weight, osdmap->max_osd);
1271         if (r < 0) {
1272                 pr_err("error %d from crush rule: pool %lld ruleset %d type %d"
1273                        " size %d\n", r, pgid.pool, pool->crush_ruleset,
1274                        pool->type, pool->size);
1275                 return NULL;
1276         }
1277         *num = r;
1278         return osds;
1279 }
1280
1281 /*
1282  * Return acting set for given pgid.
1283  */
1284 int ceph_calc_pg_acting(struct ceph_osdmap *osdmap, struct ceph_pg pgid,
1285                         int *acting)
1286 {
1287         int rawosds[CEPH_PG_MAX_SIZE], *osds;
1288         int i, o, num = CEPH_PG_MAX_SIZE;
1289
1290         osds = calc_pg_raw(osdmap, pgid, rawosds, &num);
1291         if (!osds)
1292                 return -1;
1293
1294         /* primary is first up osd */
1295         o = 0;
1296         for (i = 0; i < num; i++)
1297                 if (ceph_osd_is_up(osdmap, osds[i]))
1298                         acting[o++] = osds[i];
1299         return o;
1300 }
1301
1302 /*
1303  * Return primary osd for given pgid, or -1 if none.
1304  */
1305 int ceph_calc_pg_primary(struct ceph_osdmap *osdmap, struct ceph_pg pgid)
1306 {
1307         int rawosds[CEPH_PG_MAX_SIZE], *osds;
1308         int i, num = CEPH_PG_MAX_SIZE;
1309
1310         osds = calc_pg_raw(osdmap, pgid, rawosds, &num);
1311         if (!osds)
1312                 return -1;
1313
1314         /* primary is first up osd */
1315         for (i = 0; i < num; i++)
1316                 if (ceph_osd_is_up(osdmap, osds[i]))
1317                         return osds[i];
1318         return -1;
1319 }
1320 EXPORT_SYMBOL(ceph_calc_pg_primary);