blob: 141edabb947e31524b0256504ad52582cb2a45a8 [file] [log] [blame]
Sage Weil5cd068c2010-07-07 08:38:17 -07001#ifndef CEPH_CRUSH_MAPPER_H
2#define CEPH_CRUSH_MAPPER_H
Sage Weil5ecc0a02009-10-06 11:31:11 -07003
4/*
5 * CRUSH functions for find rules and then mapping an input to an
6 * output set.
7 *
8 * LGPL2
9 */
10
Ilya Dryomovb459be72015-06-12 13:21:07 +030011#include "crush.h"
Sage Weil5ecc0a02009-10-06 11:31:11 -070012
Sage Weil8b12d472012-05-07 15:38:35 -070013extern int crush_find_rule(const struct crush_map *map, int ruleset, int type, int size);
Ilya Dryomov069f3222017-06-22 19:44:05 +020014int crush_do_rule(const struct crush_map *map,
15 int ruleno, int x, int *result, int result_max,
16 const __u32 *weight, int weight_max,
17 void *cwin, const struct crush_choose_arg *choose_args);
Ilya Dryomov743efcf2017-01-31 15:55:06 +010018
19/*
20 * Returns the exact amount of workspace that will need to be used
21 * for a given combination of crush_map and result_max. The caller can
22 * then allocate this much on its own, either on the stack, in a
23 * per-thread long-lived buffer, or however it likes.
24 */
25static inline size_t crush_work_size(const struct crush_map *map,
26 int result_max)
27{
28 return map->working_size + result_max * 3 * sizeof(__u32);
29}
Ilya Dryomov66a0e2d2017-01-31 15:55:06 +010030
31void crush_init_workspace(const struct crush_map *map, void *v);
Sage Weil5ecc0a02009-10-06 11:31:11 -070032
33#endif