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()
229 		int i, j;  in free_choose_arg_map()  local
236 			for (j = 0; j < arg->weight_set_size; j++)  in free_choose_arg_map()
237 				kfree(arg->weight_set[j].weights);  in free_choose_arg_map()
419 	int i, j;  in crush_decode()  local
512 		for (j = 0; j < b->size; j++)  in crush_decode()
513 			b->items[j] = ceph_decode_32(p);  in crush_decode()
581 		for (j = 0; j < r->len; j++) {  in crush_decode()
582 			r->steps[j].op = ceph_decode_32(p);  in crush_decode()
583 			r->steps[j].arg1 = ceph_decode_32(p);  in crush_decode()
584 			r->steps[j].arg2 = ceph_decode_32(p);  in crush_decode()
2581 	int i, j;  in apply_upmap()  local
2615 			for (j = 0; j < raw->size; j++) {  in apply_upmap()
2616 				int osd = raw->osds[j];  in apply_upmap()
2627 					pos = j;  in apply_upmap()
3022 	int i, j;  in get_immediate_parent()  local
3034 		for (j = 0; j < b->size; j++) {  in get_immediate_parent()
3035 			if (b->items[j] != id)  in get_immediate_parent()