3 # include <linux/string.h>
4 # include <linux/slab.h>
5 # include <linux/bug.h>
6 # include <linux/kernel.h>
8 # define dprintk(args...)
15 # define BUG_ON(x) assert(!(x))
16 # define dprintk(args...) /* printf(args) */
17 # define kmalloc(x, f) malloc(x)
18 # define kfree(x) free(x)
21 #include <linux/crush/crush.h>
22 #include <linux/crush/hash.h>
23 #include <linux/crush/mapper.h>
26 * Implement the core CRUSH mapping algorithm.
30 * crush_find_rule - find a crush_rule id for a given ruleset, type, and size.
32 * @ruleset: the storage ruleset id (user defined)
33 * @type: storage ruleset type (user defined)
34 * @size: output set size
36 int crush_find_rule(const struct crush_map *map, int ruleset, int type, int size)
40 for (i = 0; i < map->max_rules; i++) {
42 map->rules[i]->mask.ruleset == ruleset &&
43 map->rules[i]->mask.type == type &&
44 map->rules[i]->mask.min_size <= size &&
45 map->rules[i]->mask.max_size >= size)
53 * bucket choose methods
55 * For each bucket algorithm, we have a "choose" method that, given a
56 * crush input @x and replica position (usually, position in output set) @r,
57 * will produce an item in the bucket.
61 * Choose based on a random permutation of the bucket.
63 * We used to use some prime number arithmetic to do this, but it
64 * wasn't very random, and had some other bad behaviors. Instead, we
65 * calculate an actual random permutation of the bucket members.
66 * Since this is expensive, we optimize for the r=0 case, which
67 * captures the vast majority of calls.
69 static int bucket_perm_choose(struct crush_bucket *bucket,
72 unsigned int pr = r % bucket->size;
75 /* start a new permutation if @x has changed */
76 if (bucket->perm_x != (__u32)x || bucket->perm_n == 0) {
77 dprintk("bucket %d new x=%d\n", bucket->id, x);
80 /* optimize common r=0 case */
82 s = crush_hash32_3(bucket->hash, x, bucket->id, 0) %
85 bucket->perm_n = 0xffff; /* magic value, see below */
89 for (i = 0; i < bucket->size; i++)
92 } else if (bucket->perm_n == 0xffff) {
93 /* clean up after the r=0 case above */
94 for (i = 1; i < bucket->size; i++)
96 bucket->perm[bucket->perm[0]] = 0;
100 /* calculate permutation up to pr */
101 for (i = 0; i < bucket->perm_n; i++)
102 dprintk(" perm_choose have %d: %d\n", i, bucket->perm[i]);
103 while (bucket->perm_n <= pr) {
104 unsigned int p = bucket->perm_n;
105 /* no point in swapping the final entry */
106 if (p < bucket->size - 1) {
107 i = crush_hash32_3(bucket->hash, x, bucket->id, p) %
110 unsigned int t = bucket->perm[p + i];
111 bucket->perm[p + i] = bucket->perm[p];
114 dprintk(" perm_choose swap %d with %d\n", p, p+i);
118 for (i = 0; i < bucket->size; i++)
119 dprintk(" perm_choose %d: %d\n", i, bucket->perm[i]);
121 s = bucket->perm[pr];
123 dprintk(" perm_choose %d sz=%d x=%d r=%d (%d) s=%d\n", bucket->id,
124 bucket->size, x, r, pr, s);
125 return bucket->items[s];
129 static int bucket_uniform_choose(struct crush_bucket_uniform *bucket,
132 return bucket_perm_choose(&bucket->h, x, r);
136 static int bucket_list_choose(struct crush_bucket_list *bucket,
141 for (i = bucket->h.size-1; i >= 0; i--) {
142 __u64 w = crush_hash32_4(bucket->h.hash,x, bucket->h.items[i],
145 dprintk("list_choose i=%d x=%d r=%d item %d weight %x "
147 i, x, r, bucket->h.items[i], bucket->item_weights[i],
148 bucket->sum_weights[i], w);
149 w *= bucket->sum_weights[i];
151 /*dprintk(" scaled %llx\n", w);*/
152 if (w < bucket->item_weights[i])
153 return bucket->h.items[i];
156 dprintk("bad list sums for bucket %d\n", bucket->h.id);
157 return bucket->h.items[0];
162 static int height(int n)
165 while ((n & 1) == 0) {
172 static int left(int x)
175 return x - (1 << (h-1));
178 static int right(int x)
181 return x + (1 << (h-1));
184 static int terminal(int x)
189 static int bucket_tree_choose(struct crush_bucket_tree *bucket,
197 n = bucket->num_nodes >> 1;
199 while (!terminal(n)) {
201 /* pick point in [0, w) */
202 w = bucket->node_weights[n];
203 t = (__u64)crush_hash32_4(bucket->h.hash, x, n, r,
204 bucket->h.id) * (__u64)w;
207 /* descend to the left or right? */
209 if (t < bucket->node_weights[l])
215 return bucket->h.items[n >> 1];
221 static int bucket_straw_choose(struct crush_bucket_straw *bucket,
229 for (i = 0; i < bucket->h.size; i++) {
230 draw = crush_hash32_3(bucket->h.hash, x, bucket->h.items[i], r);
232 draw *= bucket->straws[i];
233 if (i == 0 || draw > high_draw) {
238 return bucket->h.items[high];
241 static int crush_bucket_choose(struct crush_bucket *in, int x, int r)
243 dprintk(" crush_bucket_choose %d x=%d r=%d\n", in->id, x, r);
244 BUG_ON(in->size == 0);
246 case CRUSH_BUCKET_UNIFORM:
247 return bucket_uniform_choose((struct crush_bucket_uniform *)in,
249 case CRUSH_BUCKET_LIST:
250 return bucket_list_choose((struct crush_bucket_list *)in,
252 case CRUSH_BUCKET_TREE:
253 return bucket_tree_choose((struct crush_bucket_tree *)in,
255 case CRUSH_BUCKET_STRAW:
256 return bucket_straw_choose((struct crush_bucket_straw *)in,
259 dprintk("unknown bucket %d alg %d\n", in->id, in->alg);
265 * true if device is marked "out" (failed, fully offloaded)
268 static int is_out(const struct crush_map *map,
269 const __u32 *weight, int weight_max,
272 if (item >= weight_max)
274 if (weight[item] >= 0x10000)
276 if (weight[item] == 0)
278 if ((crush_hash32_2(CRUSH_HASH_RJENKINS1, x, item) & 0xffff)
285 * crush_choose_firstn - choose numrep distinct items of given type
286 * @map: the crush_map
287 * @bucket: the bucket we are choose an item from
288 * @x: crush input value
289 * @numrep: the number of items to choose
290 * @type: the type of item to choose
291 * @out: pointer to output vector
292 * @outpos: our position in that vector
293 * @tries: number of attempts to make
294 * @recurse_tries: number of attempts to have recursive chooseleaf make
295 * @local_tries: localized retries
296 * @local_fallback_tries: localized fallback retries
297 * @recurse_to_leaf: true if we want one device under each item of given type (chooseleaf instead of choose)
298 * @out2: second output vector for leaf items (if @recurse_to_leaf)
300 static int crush_choose_firstn(const struct crush_map *map,
301 struct crush_bucket *bucket,
302 const __u32 *weight, int weight_max,
303 int x, int numrep, int type,
304 int *out, int outpos,
306 unsigned int recurse_tries,
307 unsigned int local_tries,
308 unsigned int local_fallback_tries,
313 unsigned int ftotal, flocal;
314 int retry_descent, retry_bucket, skip_rep;
315 struct crush_bucket *in = bucket;
322 dprintk("CHOOSE%s bucket %d x %d outpos %d numrep %d\n", recurse_to_leaf ? "_LEAF" : "",
323 bucket->id, x, outpos, numrep);
325 for (rep = outpos; rep < numrep; rep++) {
326 /* keep trying until we get a non-out, non-colliding item */
331 in = bucket; /* initial bucket */
333 /* choose through intervening buckets */
339 /* r' = r + f_total */
347 if (local_fallback_tries > 0 &&
348 flocal >= (in->size>>1) &&
349 flocal > local_fallback_tries)
350 item = bucket_perm_choose(in, x, r);
352 item = crush_bucket_choose(in, x, r);
353 if (item >= map->max_devices) {
354 dprintk(" bad item %d\n", item);
361 itemtype = map->buckets[-1-item]->type;
364 dprintk(" item %d type %d\n", item, itemtype);
367 if (itemtype != type) {
369 (-1-item) >= map->max_buckets) {
370 dprintk(" bad item type %d\n", type);
374 in = map->buckets[-1-item];
380 for (i = 0; i < outpos; i++) {
381 if (out[i] == item) {
388 if (!collide && recurse_to_leaf) {
390 if (crush_choose_firstn(map,
391 map->buckets[-1-item],
397 local_fallback_tries,
400 /* didn't get leaf */
403 /* we already have a leaf! */
411 reject = is_out(map, weight,
419 if (reject || collide) {
423 if (collide && flocal <= local_tries)
424 /* retry locally a few times */
426 else if (local_fallback_tries > 0 &&
427 flocal <= in->size + local_fallback_tries)
428 /* exhaustive bucket search */
430 else if (ftotal <= tries)
431 /* then retry descent */
436 dprintk(" reject %d collide %d "
437 "ftotal %u flocal %u\n",
438 reject, collide, ftotal,
441 } while (retry_bucket);
442 } while (retry_descent);
445 dprintk("skip rep\n");
449 dprintk("CHOOSE got %d\n", item);
454 dprintk("CHOOSE returns %d\n", outpos);
460 * crush_choose_indep: alternative breadth-first positionally stable mapping
463 static void crush_choose_indep(const struct crush_map *map,
464 struct crush_bucket *bucket,
465 const __u32 *weight, int weight_max,
466 int x, int left, int numrep, int type,
467 int *out, int outpos,
469 unsigned int recurse_tries,
474 struct crush_bucket *in = bucket;
475 int endpos = outpos + left;
484 dprintk("CHOOSE%s INDEP bucket %d x %d outpos %d numrep %d\n", recurse_to_leaf ? "_LEAF" : "",
485 bucket->id, x, outpos, numrep);
487 /* initially my result is undefined */
488 for (rep = outpos; rep < endpos; rep++) {
489 out[rep] = CRUSH_ITEM_UNDEF;
491 out2[rep] = CRUSH_ITEM_UNDEF;
494 for (ftotal = 0; left > 0 && ftotal < tries; ftotal++) {
495 for (rep = outpos; rep < endpos; rep++) {
496 if (out[rep] != CRUSH_ITEM_UNDEF)
499 in = bucket; /* initial bucket */
501 /* choose through intervening buckets */
503 /* note: we base the choice on the position
504 * even in the nested call. that means that
505 * if the first layer chooses the same bucket
506 * in a different position, we will tend to
507 * choose a different item in that bucket.
508 * this will involve more devices in data
509 * movement and tend to distribute the load.
514 if (in->alg == CRUSH_BUCKET_UNIFORM &&
515 in->size % numrep == 0)
516 /* r'=r+(n+1)*f_total */
517 r += (numrep+1) * ftotal;
519 /* r' = r + n*f_total */
520 r += numrep * ftotal;
524 dprintk(" empty bucket\n");
528 item = crush_bucket_choose(in, x, r);
529 if (item >= map->max_devices) {
530 dprintk(" bad item %d\n", item);
531 out[rep] = CRUSH_ITEM_NONE;
533 out2[rep] = CRUSH_ITEM_NONE;
540 itemtype = map->buckets[-1-item]->type;
543 dprintk(" item %d type %d\n", item, itemtype);
546 if (itemtype != type) {
548 (-1-item) >= map->max_buckets) {
549 dprintk(" bad item type %d\n", type);
550 out[rep] = CRUSH_ITEM_NONE;
557 in = map->buckets[-1-item];
563 for (i = outpos; i < endpos; i++) {
564 if (out[i] == item) {
572 if (recurse_to_leaf) {
574 crush_choose_indep(map,
575 map->buckets[-1-item],
581 if (out2[rep] == CRUSH_ITEM_NONE) {
582 /* placed nothing; no leaf */
586 /* we already have a leaf! */
593 is_out(map, weight, weight_max, item, x))
603 for (rep = outpos; rep < endpos; rep++) {
604 if (out[rep] == CRUSH_ITEM_UNDEF) {
605 out[rep] = CRUSH_ITEM_NONE;
607 if (out2 && out2[rep] == CRUSH_ITEM_UNDEF) {
608 out2[rep] = CRUSH_ITEM_NONE;
614 * crush_do_rule - calculate a mapping with the given input and rule
615 * @map: the crush_map
616 * @ruleno: the rule id
618 * @result: pointer to result vector
619 * @result_max: maximum result size
620 * @weight: weight vector (for map leaves)
621 * @weight_max: size of weight vector
622 * @scratch: scratch vector for private use; must be >= 3 * result_max
624 int crush_do_rule(const struct crush_map *map,
625 int ruleno, int x, int *result, int result_max,
626 const __u32 *weight, int weight_max,
631 int *b = scratch + result_max;
632 int *c = scratch + result_max*2;
639 struct crush_rule *rule;
643 int choose_tries = map->choose_total_tries;
644 int choose_local_tries = map->choose_local_tries;
645 int choose_local_fallback_tries = map->choose_local_fallback_tries;
646 int choose_leaf_tries = 0;
648 if ((__u32)ruleno >= map->max_rules) {
649 dprintk(" bad ruleno %d\n", ruleno);
653 rule = map->rules[ruleno];
658 for (step = 0; step < rule->len; step++) {
660 struct crush_rule_step *curstep = &rule->steps[step];
662 switch (curstep->op) {
663 case CRUSH_RULE_TAKE:
664 w[0] = curstep->arg1;
668 case CRUSH_RULE_SET_CHOOSE_TRIES:
669 if (curstep->arg1 > 0)
670 choose_tries = curstep->arg1;
673 case CRUSH_RULE_SET_CHOOSELEAF_TRIES:
674 if (curstep->arg1 > 0)
675 choose_leaf_tries = curstep->arg1;
678 case CRUSH_RULE_SET_CHOOSE_LOCAL_TRIES:
679 if (curstep->arg1 > 0)
680 choose_local_tries = curstep->arg1;
683 case CRUSH_RULE_SET_CHOOSE_LOCAL_FALLBACK_TRIES:
684 if (curstep->arg1 > 0)
685 choose_local_fallback_tries = curstep->arg1;
688 case CRUSH_RULE_CHOOSELEAF_FIRSTN:
689 case CRUSH_RULE_CHOOSE_FIRSTN:
692 case CRUSH_RULE_CHOOSELEAF_INDEP:
693 case CRUSH_RULE_CHOOSE_INDEP:
699 CRUSH_RULE_CHOOSELEAF_FIRSTN ||
701 CRUSH_RULE_CHOOSELEAF_INDEP;
706 for (i = 0; i < wsize; i++) {
708 * see CRUSH_N, CRUSH_N_MINUS macros.
709 * basically, numrep <= 0 means relative to
710 * the provided result_max
712 numrep = curstep->arg1;
714 numrep += result_max;
721 if (choose_leaf_tries)
724 else if (map->chooseleaf_descend_once)
727 recurse_tries = choose_tries;
728 osize += crush_choose_firstn(
730 map->buckets[-1-w[i]],
738 choose_local_fallback_tries,
744 map->buckets[-1-w[i]],
751 choose_leaf_tries : 1,
760 /* copy final _leaf_ values to output set */
761 memcpy(o, c, osize*sizeof(*o));
763 /* swap o and w arrays */
771 case CRUSH_RULE_EMIT:
772 for (i = 0; i < wsize && result_len < result_max; i++) {
773 result[result_len] = w[i];
780 dprintk(" unknown op %d at step %d\n",