123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142 |
- #ifdef __KERNEL__
- # include <linux/slab.h>
- # include <linux/crush/crush.h>
- #else
- # include "crush_compat.h"
- # include "crush.h"
- #endif
- const char *crush_bucket_alg_name(int alg)
- {
- switch (alg) {
- case CRUSH_BUCKET_UNIFORM: return "uniform";
- case CRUSH_BUCKET_LIST: return "list";
- case CRUSH_BUCKET_TREE: return "tree";
- case CRUSH_BUCKET_STRAW: return "straw";
- case CRUSH_BUCKET_STRAW2: return "straw2";
- default: return "unknown";
- }
- }
- /**
- * crush_get_bucket_item_weight - Get weight of an item in given bucket
- * @b: bucket pointer
- * @p: item index in bucket
- */
- int crush_get_bucket_item_weight(const struct crush_bucket *b, int p)
- {
- if ((__u32)p >= b->size)
- return 0;
- switch (b->alg) {
- case CRUSH_BUCKET_UNIFORM:
- return ((struct crush_bucket_uniform *)b)->item_weight;
- case CRUSH_BUCKET_LIST:
- return ((struct crush_bucket_list *)b)->item_weights[p];
- case CRUSH_BUCKET_TREE:
- return ((struct crush_bucket_tree *)b)->node_weights[crush_calc_tree_node(p)];
- case CRUSH_BUCKET_STRAW:
- return ((struct crush_bucket_straw *)b)->item_weights[p];
- case CRUSH_BUCKET_STRAW2:
- return ((struct crush_bucket_straw2 *)b)->item_weights[p];
- }
- return 0;
- }
- void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b)
- {
- kfree(b->h.perm);
- kfree(b->h.items);
- kfree(b);
- }
- void crush_destroy_bucket_list(struct crush_bucket_list *b)
- {
- kfree(b->item_weights);
- kfree(b->sum_weights);
- kfree(b->h.perm);
- kfree(b->h.items);
- kfree(b);
- }
- void crush_destroy_bucket_tree(struct crush_bucket_tree *b)
- {
- kfree(b->h.perm);
- kfree(b->h.items);
- kfree(b->node_weights);
- kfree(b);
- }
- void crush_destroy_bucket_straw(struct crush_bucket_straw *b)
- {
- kfree(b->straws);
- kfree(b->item_weights);
- kfree(b->h.perm);
- kfree(b->h.items);
- kfree(b);
- }
- void crush_destroy_bucket_straw2(struct crush_bucket_straw2 *b)
- {
- kfree(b->item_weights);
- kfree(b->h.perm);
- kfree(b->h.items);
- kfree(b);
- }
- void crush_destroy_bucket(struct crush_bucket *b)
- {
- switch (b->alg) {
- case CRUSH_BUCKET_UNIFORM:
- crush_destroy_bucket_uniform((struct crush_bucket_uniform *)b);
- break;
- case CRUSH_BUCKET_LIST:
- crush_destroy_bucket_list((struct crush_bucket_list *)b);
- break;
- case CRUSH_BUCKET_TREE:
- crush_destroy_bucket_tree((struct crush_bucket_tree *)b);
- break;
- case CRUSH_BUCKET_STRAW:
- crush_destroy_bucket_straw((struct crush_bucket_straw *)b);
- break;
- case CRUSH_BUCKET_STRAW2:
- crush_destroy_bucket_straw2((struct crush_bucket_straw2 *)b);
- break;
- }
- }
- /**
- * crush_destroy - Destroy a crush_map
- * @map: crush_map pointer
- */
- void crush_destroy(struct crush_map *map)
- {
- /* buckets */
- if (map->buckets) {
- __s32 b;
- for (b = 0; b < map->max_buckets; b++) {
- if (map->buckets[b] == NULL)
- continue;
- crush_destroy_bucket(map->buckets[b]);
- }
- kfree(map->buckets);
- }
- /* rules */
- if (map->rules) {
- __u32 b;
- for (b = 0; b < map->max_rules; b++)
- crush_destroy_rule(map->rules[b]);
- kfree(map->rules);
- }
- #ifndef __KERNEL__
- kfree(map->choose_tries);
- #endif
- kfree(map);
- }
- void crush_destroy_rule(struct crush_rule *rule)
- {
- kfree(rule);
- }
|