You've already forked linux-apfs
mirror of
https://github.com/linux-apfs/linux-apfs.git
synced 2026-05-01 15:00:59 -07:00
Ilya Dryomov
66a0e2d579
Then add it to the working state. It would be very nice if we didn't have to take a lock to calculate a crush placement. By moving the permutation array into the working data, we can treat the CRUSH map as immutable. Reflects ceph.git commit cbcd039651c0569551cb90d26ce27e1432671f2a. Signed-off-by: Ilya Dryomov <idryomov@gmail.com>
23 lines
525 B
C
23 lines
525 B
C
#ifndef CEPH_CRUSH_MAPPER_H
|
|
#define CEPH_CRUSH_MAPPER_H
|
|
|
|
/*
|
|
* CRUSH functions for find rules and then mapping an input to an
|
|
* output set.
|
|
*
|
|
* LGPL2
|
|
*/
|
|
|
|
#include "crush.h"
|
|
|
|
extern int crush_find_rule(const struct crush_map *map, int ruleset, int type, int size);
|
|
extern int crush_do_rule(const struct crush_map *map,
|
|
int ruleno,
|
|
int x, int *result, int result_max,
|
|
const __u32 *weights, int weight_max,
|
|
void *cwin, int *scratch);
|
|
|
|
void crush_init_workspace(const struct crush_map *map, void *v);
|
|
|
|
#endif
|