blob: 4b428f46a8ca42941f6e689175ae4a3def412bc9 [file] [log] [blame]
Sage Weil5ecc0a02009-10-06 11:31:11 -07001#ifdef __KERNEL__
2# include <linux/slab.h>
Ilya Dryomovb459be72015-06-12 13:21:07 +03003# include <linux/crush/crush.h>
Ilya Dryomov5cf9c4a2017-06-22 19:44:05 +02004void clear_choose_args(struct crush_map *c);
Sage Weil5ecc0a02009-10-06 11:31:11 -07005#else
Ilya Dryomovb459be72015-06-12 13:21:07 +03006# include "crush_compat.h"
7# include "crush.h"
Sage Weil5ecc0a02009-10-06 11:31:11 -07008#endif
9
Sage Weilc6cf7262009-11-06 16:39:26 -080010const char *crush_bucket_alg_name(int alg)
11{
12 switch (alg) {
13 case CRUSH_BUCKET_UNIFORM: return "uniform";
14 case CRUSH_BUCKET_LIST: return "list";
15 case CRUSH_BUCKET_TREE: return "tree";
16 case CRUSH_BUCKET_STRAW: return "straw";
Ilya Dryomov958a2762015-04-14 16:54:52 +030017 case CRUSH_BUCKET_STRAW2: return "straw2";
Sage Weilc6cf7262009-11-06 16:39:26 -080018 default: return "unknown";
19 }
20}
21
Sage Weil5ecc0a02009-10-06 11:31:11 -070022/**
23 * crush_get_bucket_item_weight - Get weight of an item in given bucket
24 * @b: bucket pointer
25 * @p: item index in bucket
26 */
Sage Weil8b12d472012-05-07 15:38:35 -070027int crush_get_bucket_item_weight(const struct crush_bucket *b, int p)
Sage Weil5ecc0a02009-10-06 11:31:11 -070028{
Sage Weil8b12d472012-05-07 15:38:35 -070029 if ((__u32)p >= b->size)
Sage Weil5ecc0a02009-10-06 11:31:11 -070030 return 0;
31
32 switch (b->alg) {
33 case CRUSH_BUCKET_UNIFORM:
34 return ((struct crush_bucket_uniform *)b)->item_weight;
35 case CRUSH_BUCKET_LIST:
36 return ((struct crush_bucket_list *)b)->item_weights[p];
37 case CRUSH_BUCKET_TREE:
Sage Weilf671d4c2012-05-07 15:36:49 -070038 return ((struct crush_bucket_tree *)b)->node_weights[crush_calc_tree_node(p)];
Sage Weil5ecc0a02009-10-06 11:31:11 -070039 case CRUSH_BUCKET_STRAW:
40 return ((struct crush_bucket_straw *)b)->item_weights[p];
Ilya Dryomov958a2762015-04-14 16:54:52 +030041 case CRUSH_BUCKET_STRAW2:
42 return ((struct crush_bucket_straw2 *)b)->item_weights[p];
Sage Weil5ecc0a02009-10-06 11:31:11 -070043 }
44 return 0;
45}
46
Sage Weil5ecc0a02009-10-06 11:31:11 -070047void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b)
48{
Sage Weil5ecc0a02009-10-06 11:31:11 -070049 kfree(b->h.items);
50 kfree(b);
51}
52
53void crush_destroy_bucket_list(struct crush_bucket_list *b)
54{
55 kfree(b->item_weights);
56 kfree(b->sum_weights);
Sage Weil5ecc0a02009-10-06 11:31:11 -070057 kfree(b->h.items);
58 kfree(b);
59}
60
61void crush_destroy_bucket_tree(struct crush_bucket_tree *b)
62{
Sage Weil6eb43f42012-05-07 15:37:05 -070063 kfree(b->h.items);
Sage Weil5ecc0a02009-10-06 11:31:11 -070064 kfree(b->node_weights);
65 kfree(b);
66}
67
68void crush_destroy_bucket_straw(struct crush_bucket_straw *b)
69{
70 kfree(b->straws);
71 kfree(b->item_weights);
Sage Weil5ecc0a02009-10-06 11:31:11 -070072 kfree(b->h.items);
73 kfree(b);
74}
75
Ilya Dryomov958a2762015-04-14 16:54:52 +030076void crush_destroy_bucket_straw2(struct crush_bucket_straw2 *b)
77{
78 kfree(b->item_weights);
Ilya Dryomov958a2762015-04-14 16:54:52 +030079 kfree(b->h.items);
80 kfree(b);
81}
82
Sage Weil5ecc0a02009-10-06 11:31:11 -070083void crush_destroy_bucket(struct crush_bucket *b)
84{
85 switch (b->alg) {
86 case CRUSH_BUCKET_UNIFORM:
87 crush_destroy_bucket_uniform((struct crush_bucket_uniform *)b);
88 break;
89 case CRUSH_BUCKET_LIST:
90 crush_destroy_bucket_list((struct crush_bucket_list *)b);
91 break;
92 case CRUSH_BUCKET_TREE:
93 crush_destroy_bucket_tree((struct crush_bucket_tree *)b);
94 break;
95 case CRUSH_BUCKET_STRAW:
96 crush_destroy_bucket_straw((struct crush_bucket_straw *)b);
97 break;
Ilya Dryomov958a2762015-04-14 16:54:52 +030098 case CRUSH_BUCKET_STRAW2:
99 crush_destroy_bucket_straw2((struct crush_bucket_straw2 *)b);
100 break;
Sage Weil5ecc0a02009-10-06 11:31:11 -0700101 }
102}
103
104/**
105 * crush_destroy - Destroy a crush_map
106 * @map: crush_map pointer
107 */
108void crush_destroy(struct crush_map *map)
109{
Sage Weil5ecc0a02009-10-06 11:31:11 -0700110 /* buckets */
111 if (map->buckets) {
Sage Weil8b12d472012-05-07 15:38:35 -0700112 __s32 b;
Sage Weil5ecc0a02009-10-06 11:31:11 -0700113 for (b = 0; b < map->max_buckets; b++) {
114 if (map->buckets[b] == NULL)
115 continue;
116 crush_destroy_bucket(map->buckets[b]);
117 }
118 kfree(map->buckets);
119 }
120
121 /* rules */
122 if (map->rules) {
Sage Weil8b12d472012-05-07 15:38:35 -0700123 __u32 b;
Sage Weil5ecc0a02009-10-06 11:31:11 -0700124 for (b = 0; b < map->max_rules; b++)
Ilya Dryomovbfb16d72013-12-24 21:19:24 +0200125 crush_destroy_rule(map->rules[b]);
Sage Weil5ecc0a02009-10-06 11:31:11 -0700126 kfree(map->rules);
127 }
128
Ilya Dryomovb459be72015-06-12 13:21:07 +0300129#ifndef __KERNEL__
130 kfree(map->choose_tries);
Ilya Dryomov5cf9c4a2017-06-22 19:44:05 +0200131#else
132 clear_choose_args(map);
Ilya Dryomovb459be72015-06-12 13:21:07 +0300133#endif
Sage Weil5ecc0a02009-10-06 11:31:11 -0700134 kfree(map);
135}
136
Ilya Dryomovbfb16d72013-12-24 21:19:24 +0200137void crush_destroy_rule(struct crush_rule *rule)
138{
139 kfree(rule);
140}