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()
128 int j; in crush_decode_straw2_bucket() local
134 for (j = 0; j < b->h.size; j++) in crush_decode_straw2_bucket()
135 b->item_weights[j] = ceph_decode_32(p); in crush_decode_straw2_bucket()
160 int i, j; in crush_decode() local
255 for (j = 0; j < b->size; j++) in crush_decode()
256 b->items[j] = ceph_decode_32(p); in crush_decode()
327 for (j = 0; j < r->len; j++) { in crush_decode()
328 r->steps[j].op = ceph_decode_32(p); in crush_decode()
329 r->steps[j].arg1 = ceph_decode_32(p); in crush_decode()
330 r->steps[j].arg2 = ceph_decode_32(p); in crush_decode()