Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 1 | |
| 2 | #ifdef __KERNEL__ |
| 3 | # include <linux/string.h> |
| 4 | # include <linux/slab.h> |
| 5 | # include <linux/bug.h> |
| 6 | # include <linux/kernel.h> |
| 7 | # ifndef dprintk |
| 8 | # define dprintk(args...) |
| 9 | # endif |
| 10 | #else |
| 11 | # include <string.h> |
| 12 | # include <stdio.h> |
| 13 | # include <stdlib.h> |
| 14 | # include <assert.h> |
| 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) |
| 19 | #endif |
| 20 | |
Yehuda Sadeh | 3d14c5d | 2010-04-06 15:14:15 -0700 | [diff] [blame] | 21 | #include <linux/crush/crush.h> |
| 22 | #include <linux/crush/hash.h> |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 23 | |
| 24 | /* |
| 25 | * Implement the core CRUSH mapping algorithm. |
| 26 | */ |
| 27 | |
| 28 | /** |
| 29 | * crush_find_rule - find a crush_rule id for a given ruleset, type, and size. |
| 30 | * @map: the crush_map |
| 31 | * @ruleset: the storage ruleset id (user defined) |
| 32 | * @type: storage ruleset type (user defined) |
| 33 | * @size: output set size |
| 34 | */ |
Sage Weil | 8b12d47 | 2012-05-07 15:38:35 -0700 | [diff] [blame] | 35 | int crush_find_rule(const struct crush_map *map, int ruleset, int type, int size) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 36 | { |
Sage Weil | 8b12d47 | 2012-05-07 15:38:35 -0700 | [diff] [blame] | 37 | __u32 i; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 38 | |
| 39 | for (i = 0; i < map->max_rules; i++) { |
| 40 | if (map->rules[i] && |
| 41 | map->rules[i]->mask.ruleset == ruleset && |
| 42 | map->rules[i]->mask.type == type && |
| 43 | map->rules[i]->mask.min_size <= size && |
| 44 | map->rules[i]->mask.max_size >= size) |
| 45 | return i; |
| 46 | } |
| 47 | return -1; |
| 48 | } |
| 49 | |
| 50 | |
| 51 | /* |
| 52 | * bucket choose methods |
| 53 | * |
| 54 | * For each bucket algorithm, we have a "choose" method that, given a |
| 55 | * crush input @x and replica position (usually, position in output set) @r, |
| 56 | * will produce an item in the bucket. |
| 57 | */ |
| 58 | |
| 59 | /* |
| 60 | * Choose based on a random permutation of the bucket. |
| 61 | * |
| 62 | * We used to use some prime number arithmetic to do this, but it |
| 63 | * wasn't very random, and had some other bad behaviors. Instead, we |
| 64 | * calculate an actual random permutation of the bucket members. |
| 65 | * Since this is expensive, we optimize for the r=0 case, which |
| 66 | * captures the vast majority of calls. |
| 67 | */ |
| 68 | static int bucket_perm_choose(struct crush_bucket *bucket, |
| 69 | int x, int r) |
| 70 | { |
Eric Dumazet | 95c9617 | 2012-04-15 05:58:06 +0000 | [diff] [blame] | 71 | unsigned int pr = r % bucket->size; |
| 72 | unsigned int i, s; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 73 | |
| 74 | /* start a new permutation if @x has changed */ |
Sage Weil | 8b12d47 | 2012-05-07 15:38:35 -0700 | [diff] [blame] | 75 | if (bucket->perm_x != (__u32)x || bucket->perm_n == 0) { |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 76 | dprintk("bucket %d new x=%d\n", bucket->id, x); |
| 77 | bucket->perm_x = x; |
| 78 | |
| 79 | /* optimize common r=0 case */ |
| 80 | if (pr == 0) { |
Sage Weil | fb69039 | 2009-11-07 20:18:22 -0800 | [diff] [blame] | 81 | s = crush_hash32_3(bucket->hash, x, bucket->id, 0) % |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 82 | bucket->size; |
| 83 | bucket->perm[0] = s; |
| 84 | bucket->perm_n = 0xffff; /* magic value, see below */ |
| 85 | goto out; |
| 86 | } |
| 87 | |
| 88 | for (i = 0; i < bucket->size; i++) |
| 89 | bucket->perm[i] = i; |
| 90 | bucket->perm_n = 0; |
| 91 | } else if (bucket->perm_n == 0xffff) { |
| 92 | /* clean up after the r=0 case above */ |
| 93 | for (i = 1; i < bucket->size; i++) |
| 94 | bucket->perm[i] = i; |
| 95 | bucket->perm[bucket->perm[0]] = 0; |
| 96 | bucket->perm_n = 1; |
| 97 | } |
| 98 | |
| 99 | /* calculate permutation up to pr */ |
| 100 | for (i = 0; i < bucket->perm_n; i++) |
| 101 | dprintk(" perm_choose have %d: %d\n", i, bucket->perm[i]); |
| 102 | while (bucket->perm_n <= pr) { |
Eric Dumazet | 95c9617 | 2012-04-15 05:58:06 +0000 | [diff] [blame] | 103 | unsigned int p = bucket->perm_n; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 104 | /* no point in swapping the final entry */ |
| 105 | if (p < bucket->size - 1) { |
Sage Weil | fb69039 | 2009-11-07 20:18:22 -0800 | [diff] [blame] | 106 | i = crush_hash32_3(bucket->hash, x, bucket->id, p) % |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 107 | (bucket->size - p); |
| 108 | if (i) { |
Eric Dumazet | 95c9617 | 2012-04-15 05:58:06 +0000 | [diff] [blame] | 109 | unsigned int t = bucket->perm[p + i]; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 110 | bucket->perm[p + i] = bucket->perm[p]; |
| 111 | bucket->perm[p] = t; |
| 112 | } |
| 113 | dprintk(" perm_choose swap %d with %d\n", p, p+i); |
| 114 | } |
| 115 | bucket->perm_n++; |
| 116 | } |
| 117 | for (i = 0; i < bucket->size; i++) |
| 118 | dprintk(" perm_choose %d: %d\n", i, bucket->perm[i]); |
| 119 | |
| 120 | s = bucket->perm[pr]; |
| 121 | out: |
| 122 | dprintk(" perm_choose %d sz=%d x=%d r=%d (%d) s=%d\n", bucket->id, |
| 123 | bucket->size, x, r, pr, s); |
| 124 | return bucket->items[s]; |
| 125 | } |
| 126 | |
| 127 | /* uniform */ |
| 128 | static int bucket_uniform_choose(struct crush_bucket_uniform *bucket, |
| 129 | int x, int r) |
| 130 | { |
| 131 | return bucket_perm_choose(&bucket->h, x, r); |
| 132 | } |
| 133 | |
| 134 | /* list */ |
| 135 | static int bucket_list_choose(struct crush_bucket_list *bucket, |
| 136 | int x, int r) |
| 137 | { |
| 138 | int i; |
| 139 | |
| 140 | for (i = bucket->h.size-1; i >= 0; i--) { |
Sage Weil | fb69039 | 2009-11-07 20:18:22 -0800 | [diff] [blame] | 141 | __u64 w = crush_hash32_4(bucket->h.hash,x, bucket->h.items[i], |
| 142 | r, bucket->h.id); |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 143 | w &= 0xffff; |
| 144 | dprintk("list_choose i=%d x=%d r=%d item %d weight %x " |
| 145 | "sw %x rand %llx", |
| 146 | i, x, r, bucket->h.items[i], bucket->item_weights[i], |
| 147 | bucket->sum_weights[i], w); |
| 148 | w *= bucket->sum_weights[i]; |
| 149 | w = w >> 16; |
| 150 | /*dprintk(" scaled %llx\n", w);*/ |
| 151 | if (w < bucket->item_weights[i]) |
| 152 | return bucket->h.items[i]; |
| 153 | } |
| 154 | |
Sage Weil | a1f4895 | 2012-05-07 15:35:24 -0700 | [diff] [blame] | 155 | dprintk("bad list sums for bucket %d\n", bucket->h.id); |
| 156 | return bucket->h.items[0]; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 157 | } |
| 158 | |
| 159 | |
| 160 | /* (binary) tree */ |
| 161 | static int height(int n) |
| 162 | { |
| 163 | int h = 0; |
| 164 | while ((n & 1) == 0) { |
| 165 | h++; |
| 166 | n = n >> 1; |
| 167 | } |
| 168 | return h; |
| 169 | } |
| 170 | |
| 171 | static int left(int x) |
| 172 | { |
| 173 | int h = height(x); |
| 174 | return x - (1 << (h-1)); |
| 175 | } |
| 176 | |
| 177 | static int right(int x) |
| 178 | { |
| 179 | int h = height(x); |
| 180 | return x + (1 << (h-1)); |
| 181 | } |
| 182 | |
| 183 | static int terminal(int x) |
| 184 | { |
| 185 | return x & 1; |
| 186 | } |
| 187 | |
| 188 | static int bucket_tree_choose(struct crush_bucket_tree *bucket, |
| 189 | int x, int r) |
| 190 | { |
Ilya Dryomov | 8f99c85 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 191 | int n; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 192 | __u32 w; |
| 193 | __u64 t; |
| 194 | |
| 195 | /* start at root */ |
| 196 | n = bucket->num_nodes >> 1; |
| 197 | |
| 198 | while (!terminal(n)) { |
Ilya Dryomov | 8f99c85 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 199 | int l; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 200 | /* pick point in [0, w) */ |
| 201 | w = bucket->node_weights[n]; |
Sage Weil | fb69039 | 2009-11-07 20:18:22 -0800 | [diff] [blame] | 202 | t = (__u64)crush_hash32_4(bucket->h.hash, x, n, r, |
| 203 | bucket->h.id) * (__u64)w; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 204 | t = t >> 32; |
| 205 | |
| 206 | /* descend to the left or right? */ |
| 207 | l = left(n); |
| 208 | if (t < bucket->node_weights[l]) |
| 209 | n = l; |
| 210 | else |
| 211 | n = right(n); |
| 212 | } |
| 213 | |
| 214 | return bucket->h.items[n >> 1]; |
| 215 | } |
| 216 | |
| 217 | |
| 218 | /* straw */ |
| 219 | |
| 220 | static int bucket_straw_choose(struct crush_bucket_straw *bucket, |
| 221 | int x, int r) |
| 222 | { |
Sage Weil | 8b12d47 | 2012-05-07 15:38:35 -0700 | [diff] [blame] | 223 | __u32 i; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 224 | int high = 0; |
| 225 | __u64 high_draw = 0; |
| 226 | __u64 draw; |
| 227 | |
| 228 | for (i = 0; i < bucket->h.size; i++) { |
Sage Weil | fb69039 | 2009-11-07 20:18:22 -0800 | [diff] [blame] | 229 | draw = crush_hash32_3(bucket->h.hash, x, bucket->h.items[i], r); |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 230 | draw &= 0xffff; |
| 231 | draw *= bucket->straws[i]; |
| 232 | if (i == 0 || draw > high_draw) { |
| 233 | high = i; |
| 234 | high_draw = draw; |
| 235 | } |
| 236 | } |
| 237 | return bucket->h.items[high]; |
| 238 | } |
| 239 | |
| 240 | static int crush_bucket_choose(struct crush_bucket *in, int x, int r) |
| 241 | { |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 242 | dprintk(" crush_bucket_choose %d x=%d r=%d\n", in->id, x, r); |
Sage Weil | a1f4895 | 2012-05-07 15:35:24 -0700 | [diff] [blame] | 243 | BUG_ON(in->size == 0); |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 244 | switch (in->alg) { |
| 245 | case CRUSH_BUCKET_UNIFORM: |
| 246 | return bucket_uniform_choose((struct crush_bucket_uniform *)in, |
| 247 | x, r); |
| 248 | case CRUSH_BUCKET_LIST: |
| 249 | return bucket_list_choose((struct crush_bucket_list *)in, |
| 250 | x, r); |
| 251 | case CRUSH_BUCKET_TREE: |
| 252 | return bucket_tree_choose((struct crush_bucket_tree *)in, |
| 253 | x, r); |
| 254 | case CRUSH_BUCKET_STRAW: |
| 255 | return bucket_straw_choose((struct crush_bucket_straw *)in, |
| 256 | x, r); |
| 257 | default: |
Sage Weil | a1f4895 | 2012-05-07 15:35:24 -0700 | [diff] [blame] | 258 | dprintk("unknown bucket %d alg %d\n", in->id, in->alg); |
Sage Weil | 50b885b | 2009-12-01 14:12:07 -0800 | [diff] [blame] | 259 | return in->items[0]; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 260 | } |
| 261 | } |
| 262 | |
| 263 | /* |
| 264 | * true if device is marked "out" (failed, fully offloaded) |
| 265 | * of the cluster |
| 266 | */ |
Ilya Dryomov | b3b33b0 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 267 | static int is_out(const struct crush_map *map, |
| 268 | const __u32 *weight, int weight_max, |
| 269 | int item, int x) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 270 | { |
Ilya Dryomov | b3b33b0 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 271 | if (item >= weight_max) |
| 272 | return 1; |
Sage Weil | 153a109 | 2010-07-05 09:44:17 -0700 | [diff] [blame] | 273 | if (weight[item] >= 0x10000) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 274 | return 0; |
| 275 | if (weight[item] == 0) |
| 276 | return 1; |
Sage Weil | fb69039 | 2009-11-07 20:18:22 -0800 | [diff] [blame] | 277 | if ((crush_hash32_2(CRUSH_HASH_RJENKINS1, x, item) & 0xffff) |
| 278 | < weight[item]) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 279 | return 0; |
| 280 | return 1; |
| 281 | } |
| 282 | |
| 283 | /** |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 284 | * crush_choose_firstn - choose numrep distinct items of given type |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 285 | * @map: the crush_map |
| 286 | * @bucket: the bucket we are choose an item from |
| 287 | * @x: crush input value |
| 288 | * @numrep: the number of items to choose |
| 289 | * @type: the type of item to choose |
| 290 | * @out: pointer to output vector |
| 291 | * @outpos: our position in that vector |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 292 | * @out_size: size of the out vector |
Ilya Dryomov | 0e32d71 | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 293 | * @tries: number of attempts to make |
| 294 | * @recurse_tries: number of attempts to have recursive chooseleaf make |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 295 | * @local_retries: localized retries |
| 296 | * @local_fallback_retries: localized fallback retries |
Ilya Dryomov | 0e32d71 | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 297 | * @recurse_to_leaf: true if we want one device under each item of given type (chooseleaf instead of choose) |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 298 | * @vary_r: pass r to recursive calls |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 299 | * @out2: second output vector for leaf items (if @recurse_to_leaf) |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 300 | * @parent_r: r value passed from the parent |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 301 | */ |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 302 | static int crush_choose_firstn(const struct crush_map *map, |
| 303 | struct crush_bucket *bucket, |
| 304 | const __u32 *weight, int weight_max, |
| 305 | int x, int numrep, int type, |
| 306 | int *out, int outpos, |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 307 | int out_size, |
Ilya Dryomov | 2d8be0b | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 308 | unsigned int tries, |
| 309 | unsigned int recurse_tries, |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 310 | unsigned int local_retries, |
| 311 | unsigned int local_fallback_retries, |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 312 | int recurse_to_leaf, |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 313 | unsigned int vary_r, |
| 314 | int *out2, |
| 315 | int parent_r) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 316 | { |
| 317 | int rep; |
Sage Weil | 8b12d47 | 2012-05-07 15:38:35 -0700 | [diff] [blame] | 318 | unsigned int ftotal, flocal; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 319 | int retry_descent, retry_bucket, skip_rep; |
| 320 | struct crush_bucket *in = bucket; |
| 321 | int r; |
| 322 | int i; |
Sage Weil | b28813a | 2009-10-07 10:59:34 -0700 | [diff] [blame] | 323 | int item = 0; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 324 | int itemtype; |
| 325 | int collide, reject; |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 326 | int count = out_size; |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 327 | |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 328 | dprintk("CHOOSE%s bucket %d x %d outpos %d numrep %d tries %d recurse_tries %d local_retries %d local_fallback_retries %d parent_r %d\n", |
| 329 | recurse_to_leaf ? "_LEAF" : "", |
| 330 | bucket->id, x, outpos, numrep, |
| 331 | tries, recurse_tries, local_retries, local_fallback_retries, |
| 332 | parent_r); |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 333 | |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 334 | for (rep = outpos; rep < numrep && count > 0 ; rep++) { |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 335 | /* keep trying until we get a non-out, non-colliding item */ |
| 336 | ftotal = 0; |
| 337 | skip_rep = 0; |
| 338 | do { |
| 339 | retry_descent = 0; |
| 340 | in = bucket; /* initial bucket */ |
| 341 | |
| 342 | /* choose through intervening buckets */ |
| 343 | flocal = 0; |
| 344 | do { |
Sage Weil | b28813a | 2009-10-07 10:59:34 -0700 | [diff] [blame] | 345 | collide = 0; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 346 | retry_bucket = 0; |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 347 | r = rep + parent_r; |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 348 | /* r' = r + f_total */ |
| 349 | r += ftotal; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 350 | |
| 351 | /* bucket choose */ |
Sage Weil | b28813a | 2009-10-07 10:59:34 -0700 | [diff] [blame] | 352 | if (in->size == 0) { |
| 353 | reject = 1; |
| 354 | goto reject; |
| 355 | } |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 356 | if (local_fallback_retries > 0 && |
Sage Weil | 546f04e | 2012-07-30 18:15:23 -0700 | [diff] [blame] | 357 | flocal >= (in->size>>1) && |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 358 | flocal > local_fallback_retries) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 359 | item = bucket_perm_choose(in, x, r); |
| 360 | else |
| 361 | item = crush_bucket_choose(in, x, r); |
Sage Weil | a1f4895 | 2012-05-07 15:35:24 -0700 | [diff] [blame] | 362 | if (item >= map->max_devices) { |
| 363 | dprintk(" bad item %d\n", item); |
| 364 | skip_rep = 1; |
| 365 | break; |
| 366 | } |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 367 | |
| 368 | /* desired type? */ |
| 369 | if (item < 0) |
| 370 | itemtype = map->buckets[-1-item]->type; |
| 371 | else |
| 372 | itemtype = 0; |
| 373 | dprintk(" item %d type %d\n", item, itemtype); |
| 374 | |
| 375 | /* keep going? */ |
| 376 | if (itemtype != type) { |
Sage Weil | a1f4895 | 2012-05-07 15:35:24 -0700 | [diff] [blame] | 377 | if (item >= 0 || |
| 378 | (-1-item) >= map->max_buckets) { |
| 379 | dprintk(" bad item type %d\n", type); |
| 380 | skip_rep = 1; |
| 381 | break; |
| 382 | } |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 383 | in = map->buckets[-1-item]; |
Sage Weil | 55bda7a | 2010-06-24 12:55:48 -0700 | [diff] [blame] | 384 | retry_bucket = 1; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 385 | continue; |
| 386 | } |
| 387 | |
| 388 | /* collision? */ |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 389 | for (i = 0; i < outpos; i++) { |
| 390 | if (out[i] == item) { |
| 391 | collide = 1; |
| 392 | break; |
| 393 | } |
| 394 | } |
| 395 | |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 396 | reject = 0; |
Sage Weil | 7d7c1f6 | 2013-01-15 18:49:09 -0800 | [diff] [blame] | 397 | if (!collide && recurse_to_leaf) { |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 398 | if (item < 0) { |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 399 | int sub_r; |
| 400 | if (vary_r) |
| 401 | sub_r = r >> (vary_r-1); |
| 402 | else |
| 403 | sub_r = 0; |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 404 | if (crush_choose_firstn(map, |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 405 | map->buckets[-1-item], |
Ilya Dryomov | b3b33b0 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 406 | weight, weight_max, |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 407 | x, outpos+1, 0, |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 408 | out2, outpos, count, |
Ilya Dryomov | 2d8be0b | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 409 | recurse_tries, 0, |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 410 | local_retries, |
| 411 | local_fallback_retries, |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 412 | 0, |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 413 | vary_r, |
| 414 | NULL, |
| 415 | sub_r) <= outpos) |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 416 | /* didn't get leaf */ |
| 417 | reject = 1; |
| 418 | } else { |
| 419 | /* we already have a leaf! */ |
| 420 | out2[outpos] = item; |
| 421 | } |
| 422 | } |
| 423 | |
| 424 | if (!reject) { |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 425 | /* out? */ |
| 426 | if (itemtype == 0) |
| 427 | reject = is_out(map, weight, |
Ilya Dryomov | b3b33b0 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 428 | weight_max, |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 429 | item, x); |
| 430 | else |
| 431 | reject = 0; |
| 432 | } |
| 433 | |
Sage Weil | b28813a | 2009-10-07 10:59:34 -0700 | [diff] [blame] | 434 | reject: |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 435 | if (reject || collide) { |
| 436 | ftotal++; |
| 437 | flocal++; |
| 438 | |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 439 | if (collide && flocal <= local_retries) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 440 | /* retry locally a few times */ |
| 441 | retry_bucket = 1; |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 442 | else if (local_fallback_retries > 0 && |
| 443 | flocal <= in->size + local_fallback_retries) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 444 | /* exhaustive bucket search */ |
| 445 | retry_bucket = 1; |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 446 | else if (ftotal < tries) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 447 | /* then retry descent */ |
| 448 | retry_descent = 1; |
| 449 | else |
| 450 | /* else give up */ |
| 451 | skip_rep = 1; |
| 452 | dprintk(" reject %d collide %d " |
Sage Weil | 8b12d47 | 2012-05-07 15:38:35 -0700 | [diff] [blame] | 453 | "ftotal %u flocal %u\n", |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 454 | reject, collide, ftotal, |
| 455 | flocal); |
| 456 | } |
| 457 | } while (retry_bucket); |
| 458 | } while (retry_descent); |
| 459 | |
| 460 | if (skip_rep) { |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 461 | dprintk("skip rep\n"); |
| 462 | continue; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 463 | } |
| 464 | |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 465 | dprintk("CHOOSE got %d\n", item); |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 466 | out[outpos] = item; |
| 467 | outpos++; |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 468 | count--; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 469 | } |
| 470 | |
Sage Weil | a1a31e7 | 2010-06-24 12:58:14 -0700 | [diff] [blame] | 471 | dprintk("CHOOSE returns %d\n", outpos); |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 472 | return outpos; |
| 473 | } |
| 474 | |
| 475 | |
| 476 | /** |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 477 | * crush_choose_indep: alternative breadth-first positionally stable mapping |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 478 | * |
| 479 | */ |
| 480 | static void crush_choose_indep(const struct crush_map *map, |
Ilya Dryomov | be3226a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 481 | struct crush_bucket *bucket, |
| 482 | const __u32 *weight, int weight_max, |
Ilya Dryomov | ab4ce2b5 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 483 | int x, int left, int numrep, int type, |
Ilya Dryomov | be3226a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 484 | int *out, int outpos, |
Ilya Dryomov | 2d8be0b | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 485 | unsigned int tries, |
| 486 | unsigned int recurse_tries, |
Ilya Dryomov | be3226a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 487 | int recurse_to_leaf, |
Ilya Dryomov | 4158608 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 488 | int *out2, |
| 489 | int parent_r) |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 490 | { |
| 491 | struct crush_bucket *in = bucket; |
Ilya Dryomov | ab4ce2b5 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 492 | int endpos = outpos + left; |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 493 | int rep; |
| 494 | unsigned int ftotal; |
| 495 | int r; |
| 496 | int i; |
| 497 | int item = 0; |
| 498 | int itemtype; |
| 499 | int collide; |
| 500 | |
| 501 | dprintk("CHOOSE%s INDEP bucket %d x %d outpos %d numrep %d\n", recurse_to_leaf ? "_LEAF" : "", |
| 502 | bucket->id, x, outpos, numrep); |
| 503 | |
| 504 | /* initially my result is undefined */ |
Ilya Dryomov | ab4ce2b5 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 505 | for (rep = outpos; rep < endpos; rep++) { |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 506 | out[rep] = CRUSH_ITEM_UNDEF; |
| 507 | if (out2) |
| 508 | out2[rep] = CRUSH_ITEM_UNDEF; |
| 509 | } |
| 510 | |
Ilya Dryomov | 2d8be0b | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 511 | for (ftotal = 0; left > 0 && ftotal < tries; ftotal++) { |
Ilya Dryomov | ab4ce2b5 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 512 | for (rep = outpos; rep < endpos; rep++) { |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 513 | if (out[rep] != CRUSH_ITEM_UNDEF) |
| 514 | continue; |
| 515 | |
| 516 | in = bucket; /* initial bucket */ |
| 517 | |
| 518 | /* choose through intervening buckets */ |
| 519 | for (;;) { |
Ilya Dryomov | 3102b0a | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 520 | /* note: we base the choice on the position |
| 521 | * even in the nested call. that means that |
| 522 | * if the first layer chooses the same bucket |
| 523 | * in a different position, we will tend to |
| 524 | * choose a different item in that bucket. |
| 525 | * this will involve more devices in data |
| 526 | * movement and tend to distribute the load. |
| 527 | */ |
Ilya Dryomov | 4158608 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 528 | r = rep + parent_r; |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 529 | |
| 530 | /* be careful */ |
| 531 | if (in->alg == CRUSH_BUCKET_UNIFORM && |
| 532 | in->size % numrep == 0) |
| 533 | /* r'=r+(n+1)*f_total */ |
| 534 | r += (numrep+1) * ftotal; |
| 535 | else |
| 536 | /* r' = r + n*f_total */ |
| 537 | r += numrep * ftotal; |
| 538 | |
| 539 | /* bucket choose */ |
| 540 | if (in->size == 0) { |
| 541 | dprintk(" empty bucket\n"); |
| 542 | break; |
| 543 | } |
| 544 | |
| 545 | item = crush_bucket_choose(in, x, r); |
| 546 | if (item >= map->max_devices) { |
| 547 | dprintk(" bad item %d\n", item); |
| 548 | out[rep] = CRUSH_ITEM_NONE; |
| 549 | if (out2) |
| 550 | out2[rep] = CRUSH_ITEM_NONE; |
| 551 | left--; |
| 552 | break; |
| 553 | } |
| 554 | |
| 555 | /* desired type? */ |
| 556 | if (item < 0) |
| 557 | itemtype = map->buckets[-1-item]->type; |
| 558 | else |
| 559 | itemtype = 0; |
| 560 | dprintk(" item %d type %d\n", item, itemtype); |
| 561 | |
| 562 | /* keep going? */ |
| 563 | if (itemtype != type) { |
| 564 | if (item >= 0 || |
| 565 | (-1-item) >= map->max_buckets) { |
| 566 | dprintk(" bad item type %d\n", type); |
| 567 | out[rep] = CRUSH_ITEM_NONE; |
| 568 | if (out2) |
| 569 | out2[rep] = |
| 570 | CRUSH_ITEM_NONE; |
| 571 | left--; |
| 572 | break; |
| 573 | } |
| 574 | in = map->buckets[-1-item]; |
| 575 | continue; |
| 576 | } |
| 577 | |
| 578 | /* collision? */ |
| 579 | collide = 0; |
Ilya Dryomov | ab4ce2b5 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 580 | for (i = outpos; i < endpos; i++) { |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 581 | if (out[i] == item) { |
| 582 | collide = 1; |
| 583 | break; |
| 584 | } |
| 585 | } |
| 586 | if (collide) |
| 587 | break; |
| 588 | |
| 589 | if (recurse_to_leaf) { |
| 590 | if (item < 0) { |
| 591 | crush_choose_indep(map, |
Ilya Dryomov | be3226a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 592 | map->buckets[-1-item], |
| 593 | weight, weight_max, |
| 594 | x, 1, numrep, 0, |
| 595 | out2, rep, |
Ilya Dryomov | 2d8be0b | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 596 | recurse_tries, 0, |
Ilya Dryomov | be3226a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 597 | 0, NULL, r); |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 598 | if (out2[rep] == CRUSH_ITEM_NONE) { |
| 599 | /* placed nothing; no leaf */ |
| 600 | break; |
| 601 | } |
| 602 | } else { |
| 603 | /* we already have a leaf! */ |
| 604 | out2[rep] = item; |
| 605 | } |
| 606 | } |
| 607 | |
| 608 | /* out? */ |
| 609 | if (itemtype == 0 && |
| 610 | is_out(map, weight, weight_max, item, x)) |
| 611 | break; |
| 612 | |
| 613 | /* yay! */ |
| 614 | out[rep] = item; |
| 615 | left--; |
| 616 | break; |
| 617 | } |
| 618 | } |
| 619 | } |
Ilya Dryomov | ab4ce2b5 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 620 | for (rep = outpos; rep < endpos; rep++) { |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 621 | if (out[rep] == CRUSH_ITEM_UNDEF) { |
| 622 | out[rep] = CRUSH_ITEM_NONE; |
| 623 | } |
| 624 | if (out2 && out2[rep] == CRUSH_ITEM_UNDEF) { |
| 625 | out2[rep] = CRUSH_ITEM_NONE; |
| 626 | } |
| 627 | } |
| 628 | } |
| 629 | |
| 630 | /** |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 631 | * crush_do_rule - calculate a mapping with the given input and rule |
| 632 | * @map: the crush_map |
| 633 | * @ruleno: the rule id |
| 634 | * @x: hash input |
| 635 | * @result: pointer to result vector |
| 636 | * @result_max: maximum result size |
Ilya Dryomov | b3b33b0 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 637 | * @weight: weight vector (for map leaves) |
| 638 | * @weight_max: size of weight vector |
Ilya Dryomov | e8ef19c | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 639 | * @scratch: scratch vector for private use; must be >= 3 * result_max |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 640 | */ |
Sage Weil | 8b12d47 | 2012-05-07 15:38:35 -0700 | [diff] [blame] | 641 | int crush_do_rule(const struct crush_map *map, |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 642 | int ruleno, int x, int *result, int result_max, |
Ilya Dryomov | e8ef19c | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 643 | const __u32 *weight, int weight_max, |
| 644 | int *scratch) |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 645 | { |
| 646 | int result_len; |
Ilya Dryomov | e8ef19c | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 647 | int *a = scratch; |
| 648 | int *b = scratch + result_max; |
| 649 | int *c = scratch + result_max*2; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 650 | int recurse_to_leaf; |
| 651 | int *w; |
| 652 | int wsize = 0; |
| 653 | int *o; |
| 654 | int osize; |
| 655 | int *tmp; |
| 656 | struct crush_rule *rule; |
Sage Weil | 8b12d47 | 2012-05-07 15:38:35 -0700 | [diff] [blame] | 657 | __u32 step; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 658 | int i, j; |
| 659 | int numrep; |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 660 | int out_size; |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 661 | /* |
| 662 | * the original choose_total_tries value was off by one (it |
| 663 | * counted "retries" and not "tries"). add one. |
| 664 | */ |
| 665 | int choose_tries = map->choose_total_tries + 1; |
Ilya Dryomov | f18650a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 666 | int choose_leaf_tries = 0; |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 667 | /* |
| 668 | * the local tries values were counted as "retries", though, |
| 669 | * and need no adjustment |
| 670 | */ |
| 671 | int choose_local_retries = map->choose_local_tries; |
| 672 | int choose_local_fallback_retries = map->choose_local_fallback_tries; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 673 | |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 674 | int vary_r = map->chooseleaf_vary_r; |
| 675 | |
Sage Weil | a1f4895 | 2012-05-07 15:35:24 -0700 | [diff] [blame] | 676 | if ((__u32)ruleno >= map->max_rules) { |
| 677 | dprintk(" bad ruleno %d\n", ruleno); |
| 678 | return 0; |
| 679 | } |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 680 | |
| 681 | rule = map->rules[ruleno]; |
| 682 | result_len = 0; |
| 683 | w = a; |
| 684 | o = b; |
| 685 | |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 686 | for (step = 0; step < rule->len; step++) { |
Ilya Dryomov | 8f99c85 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 687 | int firstn = 0; |
Sage Weil | 0668216 | 2012-05-07 15:35:48 -0700 | [diff] [blame] | 688 | struct crush_rule_step *curstep = &rule->steps[step]; |
| 689 | |
Sage Weil | 0668216 | 2012-05-07 15:35:48 -0700 | [diff] [blame] | 690 | switch (curstep->op) { |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 691 | case CRUSH_RULE_TAKE: |
Sage Weil | 0668216 | 2012-05-07 15:35:48 -0700 | [diff] [blame] | 692 | w[0] = curstep->arg1; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 693 | wsize = 1; |
| 694 | break; |
| 695 | |
Ilya Dryomov | cc10df4 | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 696 | case CRUSH_RULE_SET_CHOOSE_TRIES: |
| 697 | if (curstep->arg1 > 0) |
| 698 | choose_tries = curstep->arg1; |
| 699 | break; |
| 700 | |
Ilya Dryomov | 917edad | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 701 | case CRUSH_RULE_SET_CHOOSELEAF_TRIES: |
Ilya Dryomov | be3226a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 702 | if (curstep->arg1 > 0) |
| 703 | choose_leaf_tries = curstep->arg1; |
| 704 | break; |
| 705 | |
Ilya Dryomov | f046bf9 | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 706 | case CRUSH_RULE_SET_CHOOSE_LOCAL_TRIES: |
Ilya Dryomov | 6ed1002 | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 707 | if (curstep->arg1 >= 0) |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 708 | choose_local_retries = curstep->arg1; |
Ilya Dryomov | f046bf9 | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 709 | break; |
| 710 | |
| 711 | case CRUSH_RULE_SET_CHOOSE_LOCAL_FALLBACK_TRIES: |
Ilya Dryomov | 6ed1002 | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 712 | if (curstep->arg1 >= 0) |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 713 | choose_local_fallback_retries = curstep->arg1; |
Ilya Dryomov | f046bf9 | 2013-12-24 21:19:27 +0200 | [diff] [blame] | 714 | break; |
| 715 | |
Ilya Dryomov | d83ed85 | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 716 | case CRUSH_RULE_SET_CHOOSELEAF_VARY_R: |
| 717 | if (curstep->arg1 >= 0) |
| 718 | vary_r = curstep->arg1; |
| 719 | break; |
| 720 | |
Ilya Dryomov | 917edad | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 721 | case CRUSH_RULE_CHOOSELEAF_FIRSTN: |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 722 | case CRUSH_RULE_CHOOSE_FIRSTN: |
| 723 | firstn = 1; |
Sage Weil | 0668216 | 2012-05-07 15:35:48 -0700 | [diff] [blame] | 724 | /* fall through */ |
Ilya Dryomov | 917edad | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 725 | case CRUSH_RULE_CHOOSELEAF_INDEP: |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 726 | case CRUSH_RULE_CHOOSE_INDEP: |
Sage Weil | a1f4895 | 2012-05-07 15:35:24 -0700 | [diff] [blame] | 727 | if (wsize == 0) |
| 728 | break; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 729 | |
| 730 | recurse_to_leaf = |
Sage Weil | 0668216 | 2012-05-07 15:35:48 -0700 | [diff] [blame] | 731 | curstep->op == |
Ilya Dryomov | 917edad | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 732 | CRUSH_RULE_CHOOSELEAF_FIRSTN || |
Sage Weil | 0668216 | 2012-05-07 15:35:48 -0700 | [diff] [blame] | 733 | curstep->op == |
Ilya Dryomov | 917edad | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 734 | CRUSH_RULE_CHOOSELEAF_INDEP; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 735 | |
| 736 | /* reset output */ |
| 737 | osize = 0; |
| 738 | |
| 739 | for (i = 0; i < wsize; i++) { |
| 740 | /* |
| 741 | * see CRUSH_N, CRUSH_N_MINUS macros. |
| 742 | * basically, numrep <= 0 means relative to |
| 743 | * the provided result_max |
| 744 | */ |
Sage Weil | 0668216 | 2012-05-07 15:35:48 -0700 | [diff] [blame] | 745 | numrep = curstep->arg1; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 746 | if (numrep <= 0) { |
| 747 | numrep += result_max; |
| 748 | if (numrep <= 0) |
| 749 | continue; |
| 750 | } |
| 751 | j = 0; |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 752 | if (firstn) { |
Ilya Dryomov | d390bb2 | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 753 | int recurse_tries; |
| 754 | if (choose_leaf_tries) |
| 755 | recurse_tries = |
| 756 | choose_leaf_tries; |
| 757 | else if (map->chooseleaf_descend_once) |
| 758 | recurse_tries = 1; |
| 759 | else |
| 760 | recurse_tries = choose_tries; |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 761 | osize += crush_choose_firstn( |
| 762 | map, |
| 763 | map->buckets[-1-w[i]], |
| 764 | weight, weight_max, |
| 765 | x, numrep, |
| 766 | curstep->arg2, |
| 767 | o+osize, j, |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 768 | result_max-osize, |
Ilya Dryomov | f18650a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 769 | choose_tries, |
Ilya Dryomov | d390bb2 | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 770 | recurse_tries, |
Ilya Dryomov | 48a163d | 2014-03-19 16:58:36 +0200 | [diff] [blame] | 771 | choose_local_retries, |
| 772 | choose_local_fallback_retries, |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 773 | recurse_to_leaf, |
Ilya Dryomov | e2b149c | 2014-03-19 16:58:37 +0200 | [diff] [blame] | 774 | vary_r, |
| 775 | c+osize, |
| 776 | 0); |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 777 | } else { |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 778 | out_size = ((numrep < (result_max-osize)) ? |
| 779 | numrep : (result_max-osize)); |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 780 | crush_choose_indep( |
| 781 | map, |
| 782 | map->buckets[-1-w[i]], |
| 783 | weight, weight_max, |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 784 | x, out_size, numrep, |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 785 | curstep->arg2, |
| 786 | o+osize, j, |
Ilya Dryomov | f18650a | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 787 | choose_tries, |
Ilya Dryomov | d390bb2 | 2013-12-24 21:19:26 +0200 | [diff] [blame] | 788 | choose_leaf_tries ? |
| 789 | choose_leaf_tries : 1, |
Ilya Dryomov | 9fe0718 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 790 | recurse_to_leaf, |
Ilya Dryomov | 4158608 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 791 | c+osize, |
| 792 | 0); |
Ilya Dryomov | 4500226 | 2015-04-14 16:04:23 +0300 | [diff] [blame^] | 793 | osize += out_size; |
Ilya Dryomov | 9a3b490 | 2013-12-24 21:19:25 +0200 | [diff] [blame] | 794 | } |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 795 | } |
| 796 | |
| 797 | if (recurse_to_leaf) |
| 798 | /* copy final _leaf_ values to output set */ |
| 799 | memcpy(o, c, osize*sizeof(*o)); |
| 800 | |
Ilya Dryomov | 2a4ba74 | 2013-12-24 21:19:24 +0200 | [diff] [blame] | 801 | /* swap o and w arrays */ |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 802 | tmp = o; |
| 803 | o = w; |
| 804 | w = tmp; |
| 805 | wsize = osize; |
| 806 | break; |
| 807 | |
| 808 | |
| 809 | case CRUSH_RULE_EMIT: |
| 810 | for (i = 0; i < wsize && result_len < result_max; i++) { |
| 811 | result[result_len] = w[i]; |
| 812 | result_len++; |
| 813 | } |
| 814 | wsize = 0; |
| 815 | break; |
| 816 | |
| 817 | default: |
Sage Weil | a1f4895 | 2012-05-07 15:35:24 -0700 | [diff] [blame] | 818 | dprintk(" unknown op %d at step %d\n", |
| 819 | curstep->op, step); |
| 820 | break; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 821 | } |
| 822 | } |
Sage Weil | f1932fc | 2011-12-07 09:10:26 -0800 | [diff] [blame] | 823 | return result_len; |
Sage Weil | 5ecc0a0 | 2009-10-06 11:31:11 -0700 | [diff] [blame] | 824 | } |
| 825 | |
| 826 | |