diff options
Diffstat (limited to 'net/ceph/crush/crush.c')
-rw-r--r-- | net/ceph/crush/crush.c | 39 |
1 files changed, 7 insertions, 32 deletions
diff --git a/net/ceph/crush/crush.c b/net/ceph/crush/crush.c index d6ebb13a18a4..089613234f03 100644 --- a/net/ceph/crush/crush.c +++ b/net/ceph/crush/crush.c | |||
@@ -26,9 +26,9 @@ const char *crush_bucket_alg_name(int alg) | |||
26 | * @b: bucket pointer | 26 | * @b: bucket pointer |
27 | * @p: item index in bucket | 27 | * @p: item index in bucket |
28 | */ | 28 | */ |
29 | int crush_get_bucket_item_weight(struct crush_bucket *b, int p) | 29 | int crush_get_bucket_item_weight(const struct crush_bucket *b, int p) |
30 | { | 30 | { |
31 | if (p >= b->size) | 31 | if ((__u32)p >= b->size) |
32 | return 0; | 32 | return 0; |
33 | 33 | ||
34 | switch (b->alg) { | 34 | switch (b->alg) { |
@@ -37,38 +37,13 @@ int crush_get_bucket_item_weight(struct crush_bucket *b, int p) | |||
37 | case CRUSH_BUCKET_LIST: | 37 | case CRUSH_BUCKET_LIST: |
38 | return ((struct crush_bucket_list *)b)->item_weights[p]; | 38 | return ((struct crush_bucket_list *)b)->item_weights[p]; |
39 | case CRUSH_BUCKET_TREE: | 39 | case CRUSH_BUCKET_TREE: |
40 | if (p & 1) | 40 | return ((struct crush_bucket_tree *)b)->node_weights[crush_calc_tree_node(p)]; |
41 | return ((struct crush_bucket_tree *)b)->node_weights[p]; | ||
42 | return 0; | ||
43 | case CRUSH_BUCKET_STRAW: | 41 | case CRUSH_BUCKET_STRAW: |
44 | return ((struct crush_bucket_straw *)b)->item_weights[p]; | 42 | return ((struct crush_bucket_straw *)b)->item_weights[p]; |
45 | } | 43 | } |
46 | return 0; | 44 | return 0; |
47 | } | 45 | } |
48 | 46 | ||
49 | /** | ||
50 | * crush_calc_parents - Calculate parent vectors for the given crush map. | ||
51 | * @map: crush_map pointer | ||
52 | */ | ||
53 | void crush_calc_parents(struct crush_map *map) | ||
54 | { | ||
55 | int i, b, c; | ||
56 | |||
57 | for (b = 0; b < map->max_buckets; b++) { | ||
58 | if (map->buckets[b] == NULL) | ||
59 | continue; | ||
60 | for (i = 0; i < map->buckets[b]->size; i++) { | ||
61 | c = map->buckets[b]->items[i]; | ||
62 | BUG_ON(c >= map->max_devices || | ||
63 | c < -map->max_buckets); | ||
64 | if (c >= 0) | ||
65 | map->device_parents[c] = map->buckets[b]->id; | ||
66 | else | ||
67 | map->bucket_parents[-1-c] = map->buckets[b]->id; | ||
68 | } | ||
69 | } | ||
70 | } | ||
71 | |||
72 | void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b) | 47 | void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b) |
73 | { | 48 | { |
74 | kfree(b->h.perm); | 49 | kfree(b->h.perm); |
@@ -87,6 +62,8 @@ void crush_destroy_bucket_list(struct crush_bucket_list *b) | |||
87 | 62 | ||
88 | void crush_destroy_bucket_tree(struct crush_bucket_tree *b) | 63 | void crush_destroy_bucket_tree(struct crush_bucket_tree *b) |
89 | { | 64 | { |
65 | kfree(b->h.perm); | ||
66 | kfree(b->h.items); | ||
90 | kfree(b->node_weights); | 67 | kfree(b->node_weights); |
91 | kfree(b); | 68 | kfree(b); |
92 | } | 69 | } |
@@ -124,10 +101,9 @@ void crush_destroy_bucket(struct crush_bucket *b) | |||
124 | */ | 101 | */ |
125 | void crush_destroy(struct crush_map *map) | 102 | void crush_destroy(struct crush_map *map) |
126 | { | 103 | { |
127 | int b; | ||
128 | |||
129 | /* buckets */ | 104 | /* buckets */ |
130 | if (map->buckets) { | 105 | if (map->buckets) { |
106 | __s32 b; | ||
131 | for (b = 0; b < map->max_buckets; b++) { | 107 | for (b = 0; b < map->max_buckets; b++) { |
132 | if (map->buckets[b] == NULL) | 108 | if (map->buckets[b] == NULL) |
133 | continue; | 109 | continue; |
@@ -138,13 +114,12 @@ void crush_destroy(struct crush_map *map) | |||
138 | 114 | ||
139 | /* rules */ | 115 | /* rules */ |
140 | if (map->rules) { | 116 | if (map->rules) { |
117 | __u32 b; | ||
141 | for (b = 0; b < map->max_rules; b++) | 118 | for (b = 0; b < map->max_rules; b++) |
142 | kfree(map->rules[b]); | 119 | kfree(map->rules[b]); |
143 | kfree(map->rules); | 120 | kfree(map->rules); |
144 | } | 121 | } |
145 | 122 | ||
146 | kfree(map->bucket_parents); | ||
147 | kfree(map->device_parents); | ||
148 | kfree(map); | 123 | kfree(map); |
149 | } | 124 | } |
150 | 125 | ||