]>
Commit | Line | Data |
---|---|---|
5ecc0a0f SW |
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 | ||
3d14c5d2 YS |
21 | #include <linux/crush/crush.h> |
22 | #include <linux/crush/hash.h> | |
feb50ac1 | 23 | #include <linux/crush/mapper.h> |
5ecc0a0f SW |
24 | |
25 | /* | |
26 | * Implement the core CRUSH mapping algorithm. | |
27 | */ | |
28 | ||
29 | /** | |
30 | * crush_find_rule - find a crush_rule id for a given ruleset, type, and size. | |
31 | * @map: the crush_map | |
32 | * @ruleset: the storage ruleset id (user defined) | |
33 | * @type: storage ruleset type (user defined) | |
34 | * @size: output set size | |
35 | */ | |
8b12d47b | 36 | int crush_find_rule(const struct crush_map *map, int ruleset, int type, int size) |
5ecc0a0f | 37 | { |
8b12d47b | 38 | __u32 i; |
5ecc0a0f SW |
39 | |
40 | for (i = 0; i < map->max_rules; i++) { | |
41 | if (map->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) | |
46 | return i; | |
47 | } | |
48 | return -1; | |
49 | } | |
50 | ||
51 | ||
52 | /* | |
53 | * bucket choose methods | |
54 | * | |
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. | |
58 | */ | |
59 | ||
60 | /* | |
61 | * Choose based on a random permutation of the bucket. | |
62 | * | |
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. | |
68 | */ | |
69 | static int bucket_perm_choose(struct crush_bucket *bucket, | |
70 | int x, int r) | |
71 | { | |
95c96174 ED |
72 | unsigned int pr = r % bucket->size; |
73 | unsigned int i, s; | |
5ecc0a0f SW |
74 | |
75 | /* start a new permutation if @x has changed */ | |
8b12d47b | 76 | if (bucket->perm_x != (__u32)x || bucket->perm_n == 0) { |
5ecc0a0f SW |
77 | dprintk("bucket %d new x=%d\n", bucket->id, x); |
78 | bucket->perm_x = x; | |
79 | ||
80 | /* optimize common r=0 case */ | |
81 | if (pr == 0) { | |
fb690390 | 82 | s = crush_hash32_3(bucket->hash, x, bucket->id, 0) % |
5ecc0a0f SW |
83 | bucket->size; |
84 | bucket->perm[0] = s; | |
85 | bucket->perm_n = 0xffff; /* magic value, see below */ | |
86 | goto out; | |
87 | } | |
88 | ||
89 | for (i = 0; i < bucket->size; i++) | |
90 | bucket->perm[i] = i; | |
91 | bucket->perm_n = 0; | |
92 | } else if (bucket->perm_n == 0xffff) { | |
93 | /* clean up after the r=0 case above */ | |
94 | for (i = 1; i < bucket->size; i++) | |
95 | bucket->perm[i] = i; | |
96 | bucket->perm[bucket->perm[0]] = 0; | |
97 | bucket->perm_n = 1; | |
98 | } | |
99 | ||
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) { | |
95c96174 | 104 | unsigned int p = bucket->perm_n; |
5ecc0a0f SW |
105 | /* no point in swapping the final entry */ |
106 | if (p < bucket->size - 1) { | |
fb690390 | 107 | i = crush_hash32_3(bucket->hash, x, bucket->id, p) % |
5ecc0a0f SW |
108 | (bucket->size - p); |
109 | if (i) { | |
95c96174 | 110 | unsigned int t = bucket->perm[p + i]; |
5ecc0a0f SW |
111 | bucket->perm[p + i] = bucket->perm[p]; |
112 | bucket->perm[p] = t; | |
113 | } | |
114 | dprintk(" perm_choose swap %d with %d\n", p, p+i); | |
115 | } | |
116 | bucket->perm_n++; | |
117 | } | |
118 | for (i = 0; i < bucket->size; i++) | |
119 | dprintk(" perm_choose %d: %d\n", i, bucket->perm[i]); | |
120 | ||
121 | s = bucket->perm[pr]; | |
122 | out: | |
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]; | |
126 | } | |
127 | ||
128 | /* uniform */ | |
129 | static int bucket_uniform_choose(struct crush_bucket_uniform *bucket, | |
130 | int x, int r) | |
131 | { | |
132 | return bucket_perm_choose(&bucket->h, x, r); | |
133 | } | |
134 | ||
135 | /* list */ | |
136 | static int bucket_list_choose(struct crush_bucket_list *bucket, | |
137 | int x, int r) | |
138 | { | |
139 | int i; | |
140 | ||
141 | for (i = bucket->h.size-1; i >= 0; i--) { | |
fb690390 SW |
142 | __u64 w = crush_hash32_4(bucket->h.hash,x, bucket->h.items[i], |
143 | r, bucket->h.id); | |
5ecc0a0f SW |
144 | w &= 0xffff; |
145 | dprintk("list_choose i=%d x=%d r=%d item %d weight %x " | |
146 | "sw %x rand %llx", | |
147 | i, x, r, bucket->h.items[i], bucket->item_weights[i], | |
148 | bucket->sum_weights[i], w); | |
149 | w *= bucket->sum_weights[i]; | |
150 | w = w >> 16; | |
151 | /*dprintk(" scaled %llx\n", w);*/ | |
152 | if (w < bucket->item_weights[i]) | |
153 | return bucket->h.items[i]; | |
154 | } | |
155 | ||
a1f4895b SW |
156 | dprintk("bad list sums for bucket %d\n", bucket->h.id); |
157 | return bucket->h.items[0]; | |
5ecc0a0f SW |
158 | } |
159 | ||
160 | ||
161 | /* (binary) tree */ | |
162 | static int height(int n) | |
163 | { | |
164 | int h = 0; | |
165 | while ((n & 1) == 0) { | |
166 | h++; | |
167 | n = n >> 1; | |
168 | } | |
169 | return h; | |
170 | } | |
171 | ||
172 | static int left(int x) | |
173 | { | |
174 | int h = height(x); | |
175 | return x - (1 << (h-1)); | |
176 | } | |
177 | ||
178 | static int right(int x) | |
179 | { | |
180 | int h = height(x); | |
181 | return x + (1 << (h-1)); | |
182 | } | |
183 | ||
184 | static int terminal(int x) | |
185 | { | |
186 | return x & 1; | |
187 | } | |
188 | ||
189 | static int bucket_tree_choose(struct crush_bucket_tree *bucket, | |
190 | int x, int r) | |
191 | { | |
8f99c85b | 192 | int n; |
5ecc0a0f SW |
193 | __u32 w; |
194 | __u64 t; | |
195 | ||
196 | /* start at root */ | |
197 | n = bucket->num_nodes >> 1; | |
198 | ||
199 | while (!terminal(n)) { | |
8f99c85b | 200 | int l; |
5ecc0a0f SW |
201 | /* pick point in [0, w) */ |
202 | w = bucket->node_weights[n]; | |
fb690390 SW |
203 | t = (__u64)crush_hash32_4(bucket->h.hash, x, n, r, |
204 | bucket->h.id) * (__u64)w; | |
5ecc0a0f SW |
205 | t = t >> 32; |
206 | ||
207 | /* descend to the left or right? */ | |
208 | l = left(n); | |
209 | if (t < bucket->node_weights[l]) | |
210 | n = l; | |
211 | else | |
212 | n = right(n); | |
213 | } | |
214 | ||
215 | return bucket->h.items[n >> 1]; | |
216 | } | |
217 | ||
218 | ||
219 | /* straw */ | |
220 | ||
221 | static int bucket_straw_choose(struct crush_bucket_straw *bucket, | |
222 | int x, int r) | |
223 | { | |
8b12d47b | 224 | __u32 i; |
5ecc0a0f SW |
225 | int high = 0; |
226 | __u64 high_draw = 0; | |
227 | __u64 draw; | |
228 | ||
229 | for (i = 0; i < bucket->h.size; i++) { | |
fb690390 | 230 | draw = crush_hash32_3(bucket->h.hash, x, bucket->h.items[i], r); |
5ecc0a0f SW |
231 | draw &= 0xffff; |
232 | draw *= bucket->straws[i]; | |
233 | if (i == 0 || draw > high_draw) { | |
234 | high = i; | |
235 | high_draw = draw; | |
236 | } | |
237 | } | |
238 | return bucket->h.items[high]; | |
239 | } | |
240 | ||
241 | static int crush_bucket_choose(struct crush_bucket *in, int x, int r) | |
242 | { | |
a1a31e73 | 243 | dprintk(" crush_bucket_choose %d x=%d r=%d\n", in->id, x, r); |
a1f4895b | 244 | BUG_ON(in->size == 0); |
5ecc0a0f SW |
245 | switch (in->alg) { |
246 | case CRUSH_BUCKET_UNIFORM: | |
247 | return bucket_uniform_choose((struct crush_bucket_uniform *)in, | |
248 | x, r); | |
249 | case CRUSH_BUCKET_LIST: | |
250 | return bucket_list_choose((struct crush_bucket_list *)in, | |
251 | x, r); | |
252 | case CRUSH_BUCKET_TREE: | |
253 | return bucket_tree_choose((struct crush_bucket_tree *)in, | |
254 | x, r); | |
255 | case CRUSH_BUCKET_STRAW: | |
256 | return bucket_straw_choose((struct crush_bucket_straw *)in, | |
257 | x, r); | |
258 | default: | |
a1f4895b | 259 | dprintk("unknown bucket %d alg %d\n", in->id, in->alg); |
50b885b9 | 260 | return in->items[0]; |
5ecc0a0f SW |
261 | } |
262 | } | |
263 | ||
264 | /* | |
265 | * true if device is marked "out" (failed, fully offloaded) | |
266 | * of the cluster | |
267 | */ | |
b3b33b0e ID |
268 | static int is_out(const struct crush_map *map, |
269 | const __u32 *weight, int weight_max, | |
270 | int item, int x) | |
5ecc0a0f | 271 | { |
b3b33b0e ID |
272 | if (item >= weight_max) |
273 | return 1; | |
153a1093 | 274 | if (weight[item] >= 0x10000) |
5ecc0a0f SW |
275 | return 0; |
276 | if (weight[item] == 0) | |
277 | return 1; | |
fb690390 SW |
278 | if ((crush_hash32_2(CRUSH_HASH_RJENKINS1, x, item) & 0xffff) |
279 | < weight[item]) | |
5ecc0a0f SW |
280 | return 0; |
281 | return 1; | |
282 | } | |
283 | ||
284 | /** | |
285 | * crush_choose - 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 | * @firstn: true if choosing "first n" items, false if choosing "indep" | |
294 | * @recurse_to_leaf: true if we want one device under each item of given type | |
1604f488 | 295 | * @descend_once: true if we should only try one descent before giving up |
5ecc0a0f SW |
296 | * @out2: second output vector for leaf items (if @recurse_to_leaf) |
297 | */ | |
8b12d47b | 298 | static int crush_choose(const struct crush_map *map, |
5ecc0a0f | 299 | struct crush_bucket *bucket, |
b3b33b0e | 300 | const __u32 *weight, int weight_max, |
5ecc0a0f SW |
301 | int x, int numrep, int type, |
302 | int *out, int outpos, | |
303 | int firstn, int recurse_to_leaf, | |
1604f488 | 304 | int descend_once, int *out2) |
5ecc0a0f SW |
305 | { |
306 | int rep; | |
8b12d47b | 307 | unsigned int ftotal, flocal; |
5ecc0a0f SW |
308 | int retry_descent, retry_bucket, skip_rep; |
309 | struct crush_bucket *in = bucket; | |
310 | int r; | |
311 | int i; | |
b28813a6 | 312 | int item = 0; |
5ecc0a0f SW |
313 | int itemtype; |
314 | int collide, reject; | |
a1a31e73 SW |
315 | |
316 | dprintk("CHOOSE%s bucket %d x %d outpos %d numrep %d\n", recurse_to_leaf ? "_LEAF" : "", | |
317 | bucket->id, x, outpos, numrep); | |
5ecc0a0f SW |
318 | |
319 | for (rep = outpos; rep < numrep; rep++) { | |
320 | /* keep trying until we get a non-out, non-colliding item */ | |
321 | ftotal = 0; | |
322 | skip_rep = 0; | |
323 | do { | |
324 | retry_descent = 0; | |
325 | in = bucket; /* initial bucket */ | |
326 | ||
327 | /* choose through intervening buckets */ | |
328 | flocal = 0; | |
329 | do { | |
b28813a6 | 330 | collide = 0; |
5ecc0a0f SW |
331 | retry_bucket = 0; |
332 | r = rep; | |
333 | if (in->alg == CRUSH_BUCKET_UNIFORM) { | |
334 | /* be careful */ | |
8b12d47b | 335 | if (firstn || (__u32)numrep >= in->size) |
5ecc0a0f SW |
336 | /* r' = r + f_total */ |
337 | r += ftotal; | |
338 | else if (in->size % numrep == 0) | |
339 | /* r'=r+(n+1)*f_local */ | |
340 | r += (numrep+1) * | |
341 | (flocal+ftotal); | |
342 | else | |
343 | /* r' = r + n*f_local */ | |
344 | r += numrep * (flocal+ftotal); | |
345 | } else { | |
346 | if (firstn) | |
347 | /* r' = r + f_total */ | |
348 | r += ftotal; | |
349 | else | |
350 | /* r' = r + n*f_local */ | |
351 | r += numrep * (flocal+ftotal); | |
352 | } | |
353 | ||
354 | /* bucket choose */ | |
b28813a6 SW |
355 | if (in->size == 0) { |
356 | reject = 1; | |
357 | goto reject; | |
358 | } | |
546f04ef SW |
359 | if (map->choose_local_fallback_tries > 0 && |
360 | flocal >= (in->size>>1) && | |
361 | flocal > map->choose_local_fallback_tries) | |
5ecc0a0f SW |
362 | item = bucket_perm_choose(in, x, r); |
363 | else | |
364 | item = crush_bucket_choose(in, x, r); | |
a1f4895b SW |
365 | if (item >= map->max_devices) { |
366 | dprintk(" bad item %d\n", item); | |
367 | skip_rep = 1; | |
368 | break; | |
369 | } | |
5ecc0a0f SW |
370 | |
371 | /* desired type? */ | |
372 | if (item < 0) | |
373 | itemtype = map->buckets[-1-item]->type; | |
374 | else | |
375 | itemtype = 0; | |
376 | dprintk(" item %d type %d\n", item, itemtype); | |
377 | ||
378 | /* keep going? */ | |
379 | if (itemtype != type) { | |
a1f4895b SW |
380 | if (item >= 0 || |
381 | (-1-item) >= map->max_buckets) { | |
382 | dprintk(" bad item type %d\n", type); | |
383 | skip_rep = 1; | |
384 | break; | |
385 | } | |
5ecc0a0f | 386 | in = map->buckets[-1-item]; |
55bda7aa | 387 | retry_bucket = 1; |
5ecc0a0f SW |
388 | continue; |
389 | } | |
390 | ||
391 | /* collision? */ | |
5ecc0a0f SW |
392 | for (i = 0; i < outpos; i++) { |
393 | if (out[i] == item) { | |
394 | collide = 1; | |
395 | break; | |
396 | } | |
397 | } | |
398 | ||
a1a31e73 | 399 | reject = 0; |
7d7c1f61 | 400 | if (!collide && recurse_to_leaf) { |
a1a31e73 SW |
401 | if (item < 0) { |
402 | if (crush_choose(map, | |
403 | map->buckets[-1-item], | |
b3b33b0e | 404 | weight, weight_max, |
a1a31e73 SW |
405 | x, outpos+1, 0, |
406 | out2, outpos, | |
407 | firstn, 0, | |
1604f488 | 408 | map->chooseleaf_descend_once, |
a1a31e73 SW |
409 | NULL) <= outpos) |
410 | /* didn't get leaf */ | |
411 | reject = 1; | |
412 | } else { | |
413 | /* we already have a leaf! */ | |
414 | out2[outpos] = item; | |
415 | } | |
416 | } | |
417 | ||
418 | if (!reject) { | |
5ecc0a0f SW |
419 | /* out? */ |
420 | if (itemtype == 0) | |
421 | reject = is_out(map, weight, | |
b3b33b0e | 422 | weight_max, |
5ecc0a0f SW |
423 | item, x); |
424 | else | |
425 | reject = 0; | |
426 | } | |
427 | ||
b28813a6 | 428 | reject: |
5ecc0a0f SW |
429 | if (reject || collide) { |
430 | ftotal++; | |
431 | flocal++; | |
432 | ||
1604f488 JS |
433 | if (reject && descend_once) |
434 | /* let outer call try again */ | |
435 | skip_rep = 1; | |
436 | else if (collide && flocal <= map->choose_local_tries) | |
5ecc0a0f SW |
437 | /* retry locally a few times */ |
438 | retry_bucket = 1; | |
546f04ef SW |
439 | else if (map->choose_local_fallback_tries > 0 && |
440 | flocal <= in->size + map->choose_local_fallback_tries) | |
5ecc0a0f SW |
441 | /* exhaustive bucket search */ |
442 | retry_bucket = 1; | |
546f04ef | 443 | else if (ftotal <= map->choose_total_tries) |
5ecc0a0f SW |
444 | /* then retry descent */ |
445 | retry_descent = 1; | |
446 | else | |
447 | /* else give up */ | |
448 | skip_rep = 1; | |
449 | dprintk(" reject %d collide %d " | |
8b12d47b | 450 | "ftotal %u flocal %u\n", |
5ecc0a0f SW |
451 | reject, collide, ftotal, |
452 | flocal); | |
453 | } | |
454 | } while (retry_bucket); | |
455 | } while (retry_descent); | |
456 | ||
457 | if (skip_rep) { | |
458 | dprintk("skip rep\n"); | |
459 | continue; | |
460 | } | |
461 | ||
a1a31e73 | 462 | dprintk("CHOOSE got %d\n", item); |
5ecc0a0f SW |
463 | out[outpos] = item; |
464 | outpos++; | |
465 | } | |
466 | ||
a1a31e73 | 467 | dprintk("CHOOSE returns %d\n", outpos); |
5ecc0a0f SW |
468 | return outpos; |
469 | } | |
470 | ||
471 | ||
472 | /** | |
473 | * crush_do_rule - calculate a mapping with the given input and rule | |
474 | * @map: the crush_map | |
475 | * @ruleno: the rule id | |
476 | * @x: hash input | |
477 | * @result: pointer to result vector | |
478 | * @result_max: maximum result size | |
b3b33b0e ID |
479 | * @weight: weight vector (for map leaves) |
480 | * @weight_max: size of weight vector | |
5ecc0a0f | 481 | */ |
8b12d47b | 482 | int crush_do_rule(const struct crush_map *map, |
5ecc0a0f | 483 | int ruleno, int x, int *result, int result_max, |
b3b33b0e | 484 | const __u32 *weight, int weight_max) |
5ecc0a0f SW |
485 | { |
486 | int result_len; | |
5ecc0a0f SW |
487 | int a[CRUSH_MAX_SET]; |
488 | int b[CRUSH_MAX_SET]; | |
489 | int c[CRUSH_MAX_SET]; | |
490 | int recurse_to_leaf; | |
491 | int *w; | |
492 | int wsize = 0; | |
493 | int *o; | |
494 | int osize; | |
495 | int *tmp; | |
496 | struct crush_rule *rule; | |
8b12d47b | 497 | __u32 step; |
5ecc0a0f SW |
498 | int i, j; |
499 | int numrep; | |
1604f488 | 500 | const int descend_once = 0; |
5ecc0a0f | 501 | |
a1f4895b SW |
502 | if ((__u32)ruleno >= map->max_rules) { |
503 | dprintk(" bad ruleno %d\n", ruleno); | |
504 | return 0; | |
505 | } | |
5ecc0a0f SW |
506 | |
507 | rule = map->rules[ruleno]; | |
508 | result_len = 0; | |
509 | w = a; | |
510 | o = b; | |
511 | ||
5ecc0a0f | 512 | for (step = 0; step < rule->len; step++) { |
8f99c85b | 513 | int firstn = 0; |
0668216e SW |
514 | struct crush_rule_step *curstep = &rule->steps[step]; |
515 | ||
0668216e | 516 | switch (curstep->op) { |
5ecc0a0f | 517 | case CRUSH_RULE_TAKE: |
0668216e | 518 | w[0] = curstep->arg1; |
5ecc0a0f SW |
519 | wsize = 1; |
520 | break; | |
521 | ||
522 | case CRUSH_RULE_CHOOSE_LEAF_FIRSTN: | |
523 | case CRUSH_RULE_CHOOSE_FIRSTN: | |
524 | firstn = 1; | |
0668216e | 525 | /* fall through */ |
5ecc0a0f SW |
526 | case CRUSH_RULE_CHOOSE_LEAF_INDEP: |
527 | case CRUSH_RULE_CHOOSE_INDEP: | |
a1f4895b SW |
528 | if (wsize == 0) |
529 | break; | |
5ecc0a0f SW |
530 | |
531 | recurse_to_leaf = | |
0668216e | 532 | curstep->op == |
5ecc0a0f | 533 | CRUSH_RULE_CHOOSE_LEAF_FIRSTN || |
0668216e | 534 | curstep->op == |
5ecc0a0f SW |
535 | CRUSH_RULE_CHOOSE_LEAF_INDEP; |
536 | ||
537 | /* reset output */ | |
538 | osize = 0; | |
539 | ||
540 | for (i = 0; i < wsize; i++) { | |
541 | /* | |
542 | * see CRUSH_N, CRUSH_N_MINUS macros. | |
543 | * basically, numrep <= 0 means relative to | |
544 | * the provided result_max | |
545 | */ | |
0668216e | 546 | numrep = curstep->arg1; |
5ecc0a0f SW |
547 | if (numrep <= 0) { |
548 | numrep += result_max; | |
549 | if (numrep <= 0) | |
550 | continue; | |
551 | } | |
552 | j = 0; | |
5ecc0a0f SW |
553 | osize += crush_choose(map, |
554 | map->buckets[-1-w[i]], | |
b3b33b0e | 555 | weight, weight_max, |
5ecc0a0f | 556 | x, numrep, |
0668216e | 557 | curstep->arg2, |
5ecc0a0f SW |
558 | o+osize, j, |
559 | firstn, | |
1604f488 JS |
560 | recurse_to_leaf, |
561 | descend_once, c+osize); | |
5ecc0a0f SW |
562 | } |
563 | ||
564 | if (recurse_to_leaf) | |
565 | /* copy final _leaf_ values to output set */ | |
566 | memcpy(o, c, osize*sizeof(*o)); | |
567 | ||
2a4ba74e | 568 | /* swap o and w arrays */ |
5ecc0a0f SW |
569 | tmp = o; |
570 | o = w; | |
571 | w = tmp; | |
572 | wsize = osize; | |
573 | break; | |
574 | ||
575 | ||
576 | case CRUSH_RULE_EMIT: | |
577 | for (i = 0; i < wsize && result_len < result_max; i++) { | |
578 | result[result_len] = w[i]; | |
579 | result_len++; | |
580 | } | |
581 | wsize = 0; | |
582 | break; | |
583 | ||
584 | default: | |
a1f4895b SW |
585 | dprintk(" unknown op %d at step %d\n", |
586 | curstep->op, step); | |
587 | break; | |
5ecc0a0f SW |
588 | } |
589 | } | |
f1932fc1 | 590 | return result_len; |
5ecc0a0f SW |
591 | } |
592 | ||
593 |