Lines Matching defs:size
59 ceph_decode_need(p, end, (1+b->h.size) * sizeof(u32), bad);
71 b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
74 b->sum_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
77 ceph_decode_need(p, end, 2 * b->h.size * sizeof(u32), bad);
78 for (j = 0; j < b->h.size; j++) {
109 b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
112 b->straws = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
115 ceph_decode_need(p, end, 2 * b->h.size * sizeof(u32), bad);
116 for (j = 0; j < b->h.size; j++) {
130 b->item_weights = kcalloc(b->h.size, sizeof(u32), GFP_NOFS);
133 ceph_decode_need(p, end, b->h.size * sizeof(u32), bad);
134 for (j = 0; j < b->h.size; j++)
233 for (i = 0; i < arg_map->size; i++) {
312 w->weights = decode_array_32_alloc(p, end, &w->size);
350 arg_map->size = c->max_buckets;
351 arg_map->args = kcalloc(arg_map->size, sizeof(*arg_map->args),
364 if (bucket_index >= arg_map->size)
373 arg->ids_size != c->buckets[bucket_index]->size)
411 c->working_size += c->buckets[b]->size * sizeof(__u32);
460 int size = 0;
474 size = sizeof(struct crush_bucket_uniform);
477 size = sizeof(struct crush_bucket_list);
480 size = sizeof(struct crush_bucket_tree);
483 size = sizeof(struct crush_bucket_straw);
486 size = sizeof(struct crush_bucket_straw2);
491 BUG_ON(size == 0);
492 b = c->buckets[i] = kzalloc(size, GFP_NOFS);
502 b->size = ceph_decode_32(p);
504 dout("crush_decode bucket size %d off %x %p to %p\n",
505 b->size, (int)(*p-start), *p, end);
507 b->items = kcalloc(b->size, sizeof(__s32), GFP_NOFS);
511 ceph_decode_need(p, end, b->size*sizeof(u32), bad);
512 for (j = 0; j < b->size; j++)
794 pi->size = ceph_decode_8(p);
825 pi->min_size = pi->size - pi->size / 2;
2203 if (lhs->size == rhs->size &&
2204 !memcmp(lhs->osds, rhs->osds, rhs->size * sizeof(rhs->osds[0])))
2226 if (set->size > 0 && set->primary >= 0)
2230 if (!set->size && set->primary == -1)
2234 if (set->size > 0 && set->primary == -1) {
2237 for (i = 0; i < set->size; i++) {
2241 if (i == set->size)
2250 memcpy(dest->osds, src->osds, src->size * sizeof(src->osds[0]));
2251 dest->size = src->size;
2312 for (i = 0; i < acting->size; i++) {
2323 if (!old_acting->size && !new_acting->size)
2326 if (!old_acting->size ^ !new_acting->size)
2490 for (i = 0; i < set->size; i++) {
2498 set->size -= removed;
2501 for (i = 0; i < set->size; i++) {
2529 pi->size);
2531 pr_err("no crush rule: pool %lld ruleset %d type %d size %d\n",
2532 pi->id, pi->crush_ruleset, pi->type, pi->size);
2536 if (pi->size > ARRAY_SIZE(raw->osds)) {
2537 pr_err_ratelimited("pool %lld ruleset %d type %d too wide: size %d > %zu\n",
2538 pi->id, pi->crush_ruleset, pi->type, pi->size,
2543 len = do_crush(osdmap, ruleno, pps, raw->osds, pi->size,
2546 pr_err("error %d from crush rule %d: pool %lld ruleset %d type %d size %d\n",
2548 pi->size);
2552 raw->size = len;
2579 raw->size = pg->pg_upmap.len;
2596 for (j = 0; j < raw->size; j++) {
2637 for (i = 0; i < set->size; i++) {
2645 set->size -= removed;
2646 if (set->size > 0)
2650 for (i = set->size - 1; i >= 0; i--) {
2674 for (i = 0; i < up->size; i++) {
2683 if (i == up->size)
2691 for (i = 0; i < up->size; i++) {
2733 * @temp will have its ->primary >= 0 but ->size == 0.
2753 temp->osds[temp->size++] = CRUSH_ITEM_NONE;
2755 temp->osds[temp->size++] = pg->pg_temp.osds[i];
2760 for (i = 0; i < temp->size; i++) {
2798 if (!acting->size) {
2799 memcpy(acting->osds, up->osds, up->size * sizeof(up->osds[0]));
2800 acting->size = up->size;
2826 for (i = 0; i < acting.size; i++) {
3015 for (j = 0; j < b->size; j++) {