Lines Matching refs:j
85 int j; in crush_decode_list_bucket() local
94 for (j = 0; j < b->h.size; j++) { in crush_decode_list_bucket()
95 b->item_weights[j] = ceph_decode_32(p); in crush_decode_list_bucket()
96 b->sum_weights[j] = ceph_decode_32(p); in crush_decode_list_bucket()
106 int j; in crush_decode_tree_bucket() local
113 for (j = 0; j < b->num_nodes; j++) in crush_decode_tree_bucket()
114 b->node_weights[j] = ceph_decode_32(p); in crush_decode_tree_bucket()
123 int j; in crush_decode_straw_bucket() local
132 for (j = 0; j < b->h.size; j++) { in crush_decode_straw_bucket()
133 b->item_weights[j] = ceph_decode_32(p); in crush_decode_straw_bucket()
134 b->straws[j] = ceph_decode_32(p); in crush_decode_straw_bucket()
144 int j; in crush_decode_straw2_bucket() local
150 for (j = 0; j < b->h.size; j++) in crush_decode_straw2_bucket()
151 b->item_weights[j] = ceph_decode_32(p); in crush_decode_straw2_bucket()
245 int i, j; in free_choose_arg_map() local
252 for (j = 0; j < arg->weight_set_size; j++) in free_choose_arg_map()
253 kfree(arg->weight_set[j].weights); in free_choose_arg_map()
435 int i, j; in crush_decode() local
528 for (j = 0; j < b->size; j++) in crush_decode()
529 b->items[j] = ceph_decode_32(p); in crush_decode()
597 for (j = 0; j < r->len; j++) { in crush_decode()
598 r->steps[j].op = ceph_decode_32(p); in crush_decode()
599 r->steps[j].arg1 = ceph_decode_32(p); in crush_decode()
600 r->steps[j].arg2 = ceph_decode_32(p); in crush_decode()
2597 int i, j; in apply_upmap() local
2631 for (j = 0; j < raw->size; j++) { in apply_upmap()
2632 int osd = raw->osds[j]; in apply_upmap()
2643 pos = j; in apply_upmap()
3038 int i, j; in get_immediate_parent() local
3050 for (j = 0; j < b->size; j++) { in get_immediate_parent()
3051 if (b->items[j] != id) in get_immediate_parent()