blob: 2160791acf03e6207dd909f3742efbb0757e3219 [file] [log] [blame]
Sage Weil5ecc0a02009-10-06 11:31:11 -07001
2#ifdef __KERNEL__
3# include <linux/slab.h>
4#else
5# include <stdlib.h>
6# include <assert.h>
7# define kfree(x) do { if (x) free(x); } while (0)
8# define BUG_ON(x) assert(!(x))
9#endif
10
Yehuda Sadeh3d14c5d2010-04-06 15:14:15 -070011#include <linux/crush/crush.h>
Sage Weil5ecc0a02009-10-06 11:31:11 -070012
Sage Weilc6cf7262009-11-06 16:39:26 -080013const char *crush_bucket_alg_name(int alg)
14{
15 switch (alg) {
16 case CRUSH_BUCKET_UNIFORM: return "uniform";
17 case CRUSH_BUCKET_LIST: return "list";
18 case CRUSH_BUCKET_TREE: return "tree";
19 case CRUSH_BUCKET_STRAW: return "straw";
20 default: return "unknown";
21 }
22}
23
Sage Weil5ecc0a02009-10-06 11:31:11 -070024/**
25 * crush_get_bucket_item_weight - Get weight of an item in given bucket
26 * @b: bucket pointer
27 * @p: item index in bucket
28 */
Sage Weil8b12d472012-05-07 15:38:35 -070029int crush_get_bucket_item_weight(const struct crush_bucket *b, int p)
Sage Weil5ecc0a02009-10-06 11:31:11 -070030{
Sage Weil8b12d472012-05-07 15:38:35 -070031 if ((__u32)p >= b->size)
Sage Weil5ecc0a02009-10-06 11:31:11 -070032 return 0;
33
34 switch (b->alg) {
35 case CRUSH_BUCKET_UNIFORM:
36 return ((struct crush_bucket_uniform *)b)->item_weight;
37 case CRUSH_BUCKET_LIST:
38 return ((struct crush_bucket_list *)b)->item_weights[p];
39 case CRUSH_BUCKET_TREE:
40 if (p & 1)
41 return ((struct crush_bucket_tree *)b)->node_weights[p];
42 return 0;
43 case CRUSH_BUCKET_STRAW:
44 return ((struct crush_bucket_straw *)b)->item_weights[p];
45 }
46 return 0;
47}
48
Sage Weil5ecc0a02009-10-06 11:31:11 -070049void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b)
50{
51 kfree(b->h.perm);
52 kfree(b->h.items);
53 kfree(b);
54}
55
56void crush_destroy_bucket_list(struct crush_bucket_list *b)
57{
58 kfree(b->item_weights);
59 kfree(b->sum_weights);
60 kfree(b->h.perm);
61 kfree(b->h.items);
62 kfree(b);
63}
64
65void crush_destroy_bucket_tree(struct crush_bucket_tree *b)
66{
67 kfree(b->node_weights);
68 kfree(b);
69}
70
71void crush_destroy_bucket_straw(struct crush_bucket_straw *b)
72{
73 kfree(b->straws);
74 kfree(b->item_weights);
75 kfree(b->h.perm);
76 kfree(b->h.items);
77 kfree(b);
78}
79
80void crush_destroy_bucket(struct crush_bucket *b)
81{
82 switch (b->alg) {
83 case CRUSH_BUCKET_UNIFORM:
84 crush_destroy_bucket_uniform((struct crush_bucket_uniform *)b);
85 break;
86 case CRUSH_BUCKET_LIST:
87 crush_destroy_bucket_list((struct crush_bucket_list *)b);
88 break;
89 case CRUSH_BUCKET_TREE:
90 crush_destroy_bucket_tree((struct crush_bucket_tree *)b);
91 break;
92 case CRUSH_BUCKET_STRAW:
93 crush_destroy_bucket_straw((struct crush_bucket_straw *)b);
94 break;
95 }
96}
97
98/**
99 * crush_destroy - Destroy a crush_map
100 * @map: crush_map pointer
101 */
102void crush_destroy(struct crush_map *map)
103{
Sage Weil5ecc0a02009-10-06 11:31:11 -0700104 /* buckets */
105 if (map->buckets) {
Sage Weil8b12d472012-05-07 15:38:35 -0700106 __s32 b;
Sage Weil5ecc0a02009-10-06 11:31:11 -0700107 for (b = 0; b < map->max_buckets; b++) {
108 if (map->buckets[b] == NULL)
109 continue;
110 crush_destroy_bucket(map->buckets[b]);
111 }
112 kfree(map->buckets);
113 }
114
115 /* rules */
116 if (map->rules) {
Sage Weil8b12d472012-05-07 15:38:35 -0700117 __u32 b;
Sage Weil5ecc0a02009-10-06 11:31:11 -0700118 for (b = 0; b < map->max_rules; b++)
119 kfree(map->rules[b]);
120 kfree(map->rules);
121 }
122
Sage Weil5ecc0a02009-10-06 11:31:11 -0700123 kfree(map);
124}
125
126