76 			      int x, int r)  in bucket_perm_choose()  argument
78 	unsigned int pr = r % bucket->size;  in bucket_perm_choose()
130 		bucket->size, x, r, pr, s);  in bucket_perm_choose()
136 				 struct crush_work_bucket *work, int x, int r)  in bucket_uniform_choose()  argument
138 	return bucket_perm_choose(&bucket->h, work, x, r);  in bucket_uniform_choose()
143 			      int x, int r)  in bucket_list_choose()  argument
149 					 r, bucket->h.id);  in bucket_list_choose()
153 			i, x, r, bucket->h.items[i], bucket->item_weights[i],  in bucket_list_choose()
197 			      int x, int r)  in bucket_tree_choose()  argument
210 		t = (__u64)crush_hash32_4(bucket->h.hash, x, n, r,  in bucket_tree_choose()
229 			       int x, int r)  in bucket_straw_choose()  argument
237 		draw = crush_hash32_3(bucket->h.hash, x, bucket->h.items[i], r);  in bucket_straw_choose()
327 				int x, int r,  in bucket_straw2_choose()  argument
340 			u = crush_hash32_3(bucket->h.hash, x, ids[i], r);  in bucket_straw2_choose()
378 			       int x, int r,  in crush_bucket_choose()  argument
382 	dprintk(" crush_bucket_choose %d x=%d r=%d\n", in->id, x, r);  in crush_bucket_choose()
388 			work, x, r);  in crush_bucket_choose()
391 					  x, r);  in crush_bucket_choose()
394 					  x, r);  in crush_bucket_choose()
398 			x, r);  in crush_bucket_choose()
402 			x, r, arg, position);  in crush_bucket_choose()
471 	int r;  in crush_choose_firstn()  local
497 				r = rep + parent_r;  in crush_choose_firstn()
499 				r += ftotal;  in crush_choose_firstn()
511 						x, r);  in crush_choose_firstn()
515 						x, r,  in crush_choose_firstn()
558 							sub_r = r >> (vary_r-1);  in crush_choose_firstn()
660 	int r;  in crush_choose_indep()  local
707 				r = rep + parent_r;  in crush_choose_indep()
713 					r += (numrep+1) * ftotal;  in crush_choose_indep()
716 					r += numrep * ftotal;  in crush_choose_indep()
726 					x, r,  in crush_choose_indep()
783 							0, NULL, r,  in crush_choose_indep()