42 	__u32 i;  in crush_find_rule()  local
44 	for (i = 0; i < map->max_rules; i++) {  in crush_find_rule()
45 		if (map->rules[i] &&  in crush_find_rule()
46 		    map->rules[i]->mask.ruleset == ruleset &&  in crush_find_rule()
47 		    map->rules[i]->mask.type == type &&  in crush_find_rule()
48 		    map->rules[i]->mask.min_size <= size &&  in crush_find_rule()
49 		    map->rules[i]->mask.max_size >= size)  in crush_find_rule()
50 			return i;  in crush_find_rule()
77 	unsigned int i, s;  in bucket_perm_choose()  local
93 		for (i = 0; i < bucket->size; i++)  in bucket_perm_choose()
94 			bucket->perm[i] = i;  in bucket_perm_choose()
98 		for (i = 1; i < bucket->size; i++)  in bucket_perm_choose()
99 			bucket->perm[i] = i;  in bucket_perm_choose()
105 	for (i = 0; i < bucket->perm_n; i++)  in bucket_perm_choose()
106 		dprintk(" perm_choose have %d: %d\n", i, bucket->perm[i]);  in bucket_perm_choose()
111 			i = crush_hash32_3(bucket->hash, x, bucket->id, p) %  in bucket_perm_choose()
113 			if (i) {  in bucket_perm_choose()
114 				unsigned int t = bucket->perm[p + i];  in bucket_perm_choose()
115 				bucket->perm[p + i] = bucket->perm[p];  in bucket_perm_choose()
118 			dprintk(" perm_choose swap %d with %d\n", p, p+i);  in bucket_perm_choose()
122 	for (i = 0; i < bucket->size; i++)  in bucket_perm_choose()
123 		dprintk(" perm_choose  %d: %d\n", i, bucket->perm[i]);  in bucket_perm_choose()
143 	int i;  in bucket_list_choose()  local
145 	for (i = bucket->h.size-1; i >= 0; i--) {  in bucket_list_choose()
146 		__u64 w = crush_hash32_4(bucket->h.hash, x, bucket->h.items[i],  in bucket_list_choose()
151 			i, x, r, bucket->h.items[i], bucket->item_weights[i],  in bucket_list_choose()
152 			bucket->sum_weights[i], w);  in bucket_list_choose()
153 		w *= bucket->sum_weights[i];  in bucket_list_choose()
156 		if (w < bucket->item_weights[i])  in bucket_list_choose()
157 			return bucket->h.items[i];  in bucket_list_choose()
228 	__u32 i;  in bucket_straw_choose()  local
233 	for (i = 0; i < bucket->h.size; i++) {  in bucket_straw_choose()
234 		draw = crush_hash32_3(bucket->h.hash, x, bucket->h.items[i], r);  in bucket_straw_choose()
236 		draw *= bucket->straws[i];  in bucket_straw_choose()
237 		if (i == 0 || draw > high_draw) {  in bucket_straw_choose()
238 			high = i;  in bucket_straw_choose()
300 	unsigned int i, high = 0;  in bucket_straw2_choose()  local
305 	for (i = 0; i < bucket->h.size; i++) {  in bucket_straw2_choose()
306 		w = bucket->item_weights[i];  in bucket_straw2_choose()
309 					   bucket->h.items[i], r);  in bucket_straw2_choose()
335 		if (i == 0 || draw > high_draw) {  in bucket_straw2_choose()
336 			high = i;  in bucket_straw2_choose()
430 	int i;  in crush_choose_firstn()  local
497 				for (i = 0; i < outpos; i++) {  in crush_choose_firstn()
498 					if (out[i] == item) {  in crush_choose_firstn()
608 	int i;  in crush_choose_indep()  local
706 				for (i = outpos; i < endpos; i++) {  in crush_choose_indep()
707 					if (out[i] == item) {  in crush_choose_indep()
802 	int i, j;  in crush_do_rule()  local
890 			for (i = 0; i < wsize; i++) {  in crush_do_rule()
914 						map->buckets[-1-w[i]],  in crush_do_rule()
933 						map->buckets[-1-w[i]],  in crush_do_rule()
961 			for (i = 0; i < wsize && result_len < result_max; i++) {  in crush_do_rule()
962 				result[result_len] = w[i];  in crush_do_rule()