Lines Matching refs:j
69 int j; in crush_decode_list_bucket() local
78 for (j = 0; j < b->h.size; j++) { in crush_decode_list_bucket()
79 b->item_weights[j] = ceph_decode_32(p); in crush_decode_list_bucket()
80 b->sum_weights[j] = ceph_decode_32(p); in crush_decode_list_bucket()
90 int j; in crush_decode_tree_bucket() local
97 for (j = 0; j < b->num_nodes; j++) in crush_decode_tree_bucket()
98 b->node_weights[j] = ceph_decode_32(p); in crush_decode_tree_bucket()
107 int j; in crush_decode_straw_bucket() local
116 for (j = 0; j < b->h.size; j++) { in crush_decode_straw_bucket()
117 b->item_weights[j] = ceph_decode_32(p); in crush_decode_straw_bucket()
118 b->straws[j] = ceph_decode_32(p); in crush_decode_straw_bucket()
144 int i, j; in crush_decode() local
236 for (j = 0; j < b->size; j++) in crush_decode()
237 b->items[j] = ceph_decode_32(p); in crush_decode()
301 for (j = 0; j < r->len; j++) { in crush_decode()
302 r->steps[j].op = ceph_decode_32(p); in crush_decode()
303 r->steps[j].arg1 = ceph_decode_32(p); in crush_decode()
304 r->steps[j].arg2 = ceph_decode_32(p); in crush_decode()
746 int n, j; in osdmap_decode() local
765 for (j = 0; j < n; j++) in osdmap_decode()
766 pg->osds[j] = ceph_decode_32(p); in osdmap_decode()
964 int j; in osdmap_apply_incremental() local
989 for (j = 0; j < pglen; j++) in osdmap_apply_incremental()
990 pg->osds[j] = ceph_decode_32(p); in osdmap_apply_incremental()