Lines Matching refs:size
75 ceph_decode_need(p, end, (1+b->h.size) * sizeof(u32), bad);
87 b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
90 b->sum_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
93 ceph_decode_need(p, end, 2 * b->h.size * sizeof(u32), bad);
94 for (j = 0; j < b->h.size; j++) {
125 b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
128 b->straws = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
131 ceph_decode_need(p, end, 2 * b->h.size * sizeof(u32), bad);
132 for (j = 0; j < b->h.size; j++) {
146 b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
149 ceph_decode_need(p, end, b->h.size * sizeof(u32), bad);
150 for (j = 0; j < b->h.size; j++)
249 for (i = 0; i < arg_map->size; i++) {
328 w->weights = decode_array_32_alloc(p, end, &w->size);
366 arg_map->size = c->max_buckets;
367 arg_map->args = kcalloc(arg_map->size, sizeof(*arg_map->args),
380 if (bucket_index >= arg_map->size)
389 arg->ids_size != c->buckets[bucket_index]->size)
427 c->working_size += c->buckets[b]->size * sizeof(__u32);
476 int size = 0;
490 size = sizeof(struct crush_bucket_uniform);
493 size = sizeof(struct crush_bucket_list);
496 size = sizeof(struct crush_bucket_tree);
499 size = sizeof(struct crush_bucket_straw);
502 size = sizeof(struct crush_bucket_straw2);
507 BUG_ON(size == 0);
508 b = c->buckets[i] = kzalloc(size, GFP_NOFS);
518 b->size = ceph_decode_32(p);
520 dout("crush_decode bucket size %d off %x %p to %p\n",
521 b->size, (int)(*p-start), *p, end);
523 b->items = kcalloc(b->size, sizeof(__s32), GFP_NOFS);
527 ceph_decode_need(p, end, b->size*sizeof(u32), bad);
528 for (j = 0; j < b->size; j++)
810 pi->size = ceph_decode_8(p);
841 pi->min_size = pi->size - pi->size / 2;
2238 if (lhs->size == rhs->size &&
2239 !memcmp(lhs->osds, rhs->osds, rhs->size * sizeof(rhs->osds[0])))
2261 if (set->size > 0 && set->primary >= 0)
2265 if (!set->size && set->primary == -1)
2269 if (set->size > 0 && set->primary == -1) {
2272 for (i = 0; i < set->size; i++) {
2276 if (i == set->size)
2285 memcpy(dest->osds, src->osds, src->size * sizeof(src->osds[0]));
2286 dest->size = src->size;
2347 for (i = 0; i < acting->size; i++) {
2358 if (!old_acting->size && !new_acting->size)
2361 if (!old_acting->size ^ !new_acting->size)
2525 for (i = 0; i < set->size; i++) {
2533 set->size -= removed;
2536 for (i = 0; i < set->size; i++) {
2564 pi->size);
2566 pr_err("no crush rule: pool %lld ruleset %d type %d size %d\n",
2567 pi->id, pi->crush_ruleset, pi->type, pi->size);
2571 if (pi->size > ARRAY_SIZE(raw->osds)) {
2572 pr_err_ratelimited("pool %lld ruleset %d type %d too wide: size %d > %zu\n",
2573 pi->id, pi->crush_ruleset, pi->type, pi->size,
2578 len = do_crush(osdmap, ruleno, pps, raw->osds, pi->size,
2581 pr_err("error %d from crush rule %d: pool %lld ruleset %d type %d size %d\n",
2583 pi->size);
2587 raw->size = len;
2614 raw->size = pg->pg_upmap.len;
2631 for (j = 0; j < raw->size; j++) {
2672 for (i = 0; i < set->size; i++) {
2680 set->size -= removed;
2681 if (set->size > 0)
2685 for (i = set->size - 1; i >= 0; i--) {
2709 for (i = 0; i < up->size; i++) {
2718 if (i == up->size)
2726 for (i = 0; i < up->size; i++) {
2768 * @temp will have its ->primary >= 0 but ->size == 0.
2788 temp->osds[temp->size++] = CRUSH_ITEM_NONE;
2790 temp->osds[temp->size++] = pg->pg_temp.osds[i];
2795 for (i = 0; i < temp->size; i++) {
2833 if (!acting->size) {
2834 memcpy(acting->osds, up->osds, up->size * sizeof(up->osds[0]));
2835 acting->size = up->size;
2861 for (i = 0; i < acting.size; i++) {
3050 for (j = 0; j < b->size; j++) {